Skip to main content
SpringerLink
Log in

Movement-Generalized Minimalist Grammars

  • Conference paper
Logical Aspects of Computational Linguistics (LACL 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7351))

Abstract

A general framework is presented that allows for Minimalist grammars to use arbitrary movement operations under the proviso that they are all definable by monadic second-order formulas over derivation trees. Lowering, sidewards movement, and clustering, among others, are the result of instantiating the parameters of this framework in a certain way. Even though weak generative capacity is not increased, strong generative capacity may change depending on the available movement types. Notably, TAG-style tree adjunction can be emulated by a special type of lowering movement.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bloem, R., Engelfriet, J.: A comparison of tree transductions defined by monadic second-order logic and attribute grammars. Journal of Computational System Science 61, 1–50 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Gärtner, H.-M., Michaelis, J.: On the treatment of multiple-wh-interrogatives in minimalist grammars. In: Hanneforth, T., Fanselow, G. (eds.) Language and Logos, pp. 339–366. Akademie Verlag, Berlin (2010)

    Google Scholar 

  3. Graf, T.: Closure Properties of Minimalist Derivation Tree Languages. In: Pogodalla, S., Prost, J.-P. (eds.) LACL 2011. LNCS (LNAI), vol. 6736, pp. 96–111. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  4. Graf, T.: Locality and the complexity of minimalist derivation tree languages. In: Proceedings of the 16th Conference on Formal Grammar (2011) (to appear)

    Google Scholar 

  5. Graf, T.: Tree adjunction as lowering in minimalist grammars (2012), ms., UCLA

    Google Scholar 

  6. Harkema, H.: A Characterization of Minimalist Languages. In: de Groote, P., Morrill, G., Retoré, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099, pp. 193–211. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Hornstein, N.: Movement and control. Linguistic Inquiry 30, 69–96 (1999)

    Article  Google Scholar 

  8. Joshi, A.: Tree-adjoining grammars: How much context sensitivity is required to provide reasonable structural descriptions? In: Dowty, D., Karttunen, L., Zwicky, A. (eds.) Natural Language Parsing, pp. 206–250. Cambridge University Press, Cambridge (1985)

    Google Scholar 

  9. Kobele, G.M.: Generating Copies: An Investigation into Structural Identity in Language and Grammar. Ph.D. thesis, UCLA (2006)

    Google Scholar 

  10. Kobele, G.M.: Across-the-board extraction and minimalist grammars. In: Proceedings of the Ninth International Workshop on Tree Adjoining Grammars and Related Frameworks (2008)

    Google Scholar 

  11. Kobele, G.M.: Minimalist Tree Languages Are Closed Under Intersection with Recognizable Tree Languages. In: Pogodalla, S., Prost, J.-P. (eds.) LACL 2011. LNCS (LNAI), vol. 6736, pp. 129–144. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Kobele, G.M., Retoré, C., Salvati, S.: An automata-theoretic approach to minimalism. In: Rogers, J., Kepser, S. (eds.) Model Theoretic Syntax at 10, pp. 71–80 (2007)

    Google Scholar 

  13. Michaelis, J.: Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars. In: de Groote, P., Morrill, G., Retoré, C. (eds.) LACL 2001. LNCS (LNAI), vol. 2099, pp. 228–244. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Mönnich, U.: Grammar morphisms (2006), University of Tübingen

    Google Scholar 

  15. Nunes, J.: The Copy Theory of Movement and Linearization of Chains in the Minimalist Program. Ph.D. thesis, University of Maryland, College Park (1995)

    Google Scholar 

  16. Rogers, J.: A Descriptive Approach to Language-Theoretic Complexity. CSLI, Stanford (1998)

    MATH  Google Scholar 

  17. Salvati, S.: Minimalist Grammars in the Light of Logic. In: Pogodalla, S., Quatrini, M., Retoré, C. (eds.) Logic and Grammar. LNCS, vol. 6700, pp. 81–117. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  18. Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science 88, 191–229 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  19. Stabler, E.P.: Remnant movement and complexity. In: Bouma, G., Kruijff, G.-J.M., Hinrichs, E., Oehrle, R.T. (eds.) Constraints and Resources in Natural Language Syntax and Semantics, pp. 299–326. CSLI Publications, Stanford (1999)

    Google Scholar 

  20. Stabler, E.P.: Sidewards without copying. In: Penn, G., Satta, G., Wintner, S. (eds.) Proceedings of the Conference on Formal Grammar 2006, pp. 133–146. CSLI Publications, Stanford (2006)

    Google Scholar 

  21. Stabler, E.P.: Computational perspectives on minimalism. In: Boeckx, C. (ed.) Oxford Handbook of Linguistic Minimalism, pp. 617–643. Oxford University Press, Oxford (2011)

    Google Scholar 

  22. Stabler, E.P., Keenan, E.: Structural similarity. Theoretical Computer Science 293, 345–363 (2003)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Linguistics, University of California, Los Angeles, USA

    Thomas Graf

Authors
  1. Thomas Graf
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LINA UMR 6241, Université de Nantes, 2, rue de la Houssinière, BP 92208, 44322, Nantes Cedex 3, France

    Denis Béchet  & Alexander Dikovsky  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Graf, T. (2012). Movement-Generalized Minimalist Grammars. In: Béchet, D., Dikovsky, A. (eds) Logical Aspects of Computational Linguistics. LACL 2012. Lecture Notes in Computer Science, vol 7351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31262-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31262-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31261-8

  • Online ISBN: 978-3-642-31262-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation