Skip to main content
Springer Nature Link
Log in

Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars

  • Conference paper
  • First Online:
Logical Aspects of Computational Linguistics (LACL 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2099))

Abstract

The type of a minimalist grammar (MG) as introduced by Stabler [11,12] provides an attempt of a rigorous algebraic formalization of the new perspectives adopted within the linguistic framework of transformational grammar due to the change from GB-theory to minimalism. Michaelis [6] has shown that MGs constitute a subclass of mildly context-sensitive grammars in the sense that for each MG there is a weakly equivalent linear context-free rewriting system (LCFRS). However, it has been left open in [6], whether the respective classes of string languages derivable by MGs and LCFRSs coincide. This paper completes the picture by showing that MGs in the sense of [11] and LCFRSs give in fact rise to the same class of derivable string languages.

Abstract

This work has been carried out funded by DFG-grant STA519/1-1. I especially wish to thank Kai-Uwe Kühnberger and Ed Stabler for inspiring discussions.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Henk Harkema. A recognizer for minimalist grammars. In Proceedings of the Sixth International Workshop on Parsing Technologies (IWPT 2000), Trento, pages 111–122, 2000.

    Google Scholar 

  2. Henk Harkema. A characterization of minimalist languages, 2001. This volume.

    Google Scholar 

  3. Richard S. Kayne. Overt vs. covert movement. Syntax, 1:128–191, 1998.

    Article  Google Scholar 

  4. Hilda Koopman and Anna Szabolcsi. Verbal Complexes. MIT Press, Cambridge, MA, 2000.

    Google Scholar 

  5. Anoop Mahajan. Eliminating head movement. In GLOW Newsletter #44, pages 44–45, 2000. Abstract of the talk held at the 23rd Generative Linguistics in the Old World Conference (GLOW 2000), Vitoria-Gasteiz/Bilbao.

    Google Scholar 

  6. Jens Michaelis. Derivational minimalism is mildy context-sensitive. In M. Moortgat, editor, Logical Aspects of Computational Linguistics (LACL’ 98), Lecture Notes in Artificial Intelligence Vol. 2014. Springer, Berlin, Heidelberg, to appear. Also available at http://www.ling.uni-potsdam.de/~michael/papers.html.

  7. Jens Michaelis. On formal properties of minimalist grammars. Potsdam University, Potsdam, in preperation.

    Google Scholar 

  8. Carl J. Pollard. Generalized Phrase Structure Grammars, Head Grammars, and Natural Language. PhD thesis, Stanford University, Stanford, CA, 1984.

    Google Scholar 

  9. Owen Rambow and Giorgio Satta. Independent parallelism in finite copying parallel rewriting systems. Theoretical Computer Science, 223:87–120, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  10. Hiroyuki Seki, Takashi Matsumura, Mamoru Fujii, and Tadao Kasami. On multiple context-free grammars. Theoretical Computer Science, 88:191–229, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  11. Edward P. Stabler. Derivational minimalism. In C. Retoré, editor, Logical Aspects of Computational Linguistics (LACL’ 96), Lecture Notes in Artificial Intelligence Vol. 1328, pages 68–95. Springer, Berlin, Heidelberg, 1997.

    Chapter  Google Scholar 

  12. Edward P. Stabler. Acquiring languages withm ovement. Syntax, 1:72–97, 1998.

    Article  Google Scholar 

  13. Edward P. Stabler. Remnant movement and complexity. In G. Bouma, G.-J. M. Kruijff, E. Hinrichs, and R. T. Oehrle, editors, Constraints and Resources in Natural Language Syntax and Semantics, pages 299–326. CSLI Publications, Stanford, CA, 1999.

    Google Scholar 

  14. Edward P. Stabler. Recognizing head movement, 2001. This volume.

    Google Scholar 

  15. K. Vijay-Shanker, David J. Weir, and Aravind K. Joshi. Characterizing structural descriptions produced by various grammatical formalisms. In 25th Annual Meeting of the Association for Computational Linguistics (ACL’ 87), Stanford, CA, pages 104–111. ACL, 1987.

    Chapter  Google Scholar 

  16. David J. Weir. Characterizing Mildly Context-Sensitive Grammar Formalisms. PhD thesis, University of Pennsylvania, Philadelphia, PA, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Linguistik, Universität Potsdam, PF 601553, 14415, Potsdam, Germany

    Jens Michaelis

Authors
  1. Jens Michaelis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA Lorraine, 615 rue du Jardin Botanique, B.P. 101, 54602, Villers-lès-Nancy Cedex, France

    Philippe de Groote

  2. Universitat Politècnica de Catalunya, Jordi Girona Salgado, 1-3, 08028, Barcelona, Spain

    Glyn Morrill

  3. Faculté des Sciences, Institut de recherche en Informatique de Nantes (IRIN), 2, rue de la Houssinière, B.P. 92208, 44322, Nantes Cedex 03, France

    Christian Retoré

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Michaelis, J. (2001). Transforming Linear Context-Free Rewriting Systems into Minimalist Grammars. In: de Groote, P., Morrill, G., Retoré, C. (eds) Logical Aspects of Computational Linguistics. LACL 2001. Lecture Notes in Computer Science(), vol 2099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48199-0_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-48199-0_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42273-0

  • Online ISBN: 978-3-540-48199-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics