You have free access to this content

Linear Context-Free Rewriting Systems

  1. Laura Kallmeyer†

Article first published online: 24 JAN 2013

DOI: 10.1002/lnc3.359

Issue

Language and Linguistics Compass

Language and Linguistics Compass

Volume 7, Issue 1, pages 22–38, January 2013

Additional Information

How to Cite

Kallmeyer, L. (2013), Linear Context-Free Rewriting Systems. Language and Linguistics Compass, 7: 22–38. doi: 10.1002/lnc3.359

Publication History

  1. Issue published online: 24 JAN 2013
  2. Article first published online: 24 JAN 2013

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

View Full Article (HTML) Get PDF (434K)

Works Cited

  • Boullier, P. 1998. A Proposal for a Natural Language Processing Syntactic Backbone. Technical Report 3342, INRIA.
  • Boullier, P.. 1999. On TAG parsing. TALN 99, 6e conférence annuelle sur le Traitement Automatique des Langues Naturelles, 75–84. Corse: Cargése.
  • Boullier, P.. 2000. Range concatenation grammars. Proceedings of the Sixth International Workshop on Parsing Technologies (IWPT2000), 53–64. Italy: Trento.
  • Bresnan, J., R. M. Kaplan, S. Peters, and A. Zaenen. 1982. Cross-serial dependencies in Dutch. Linguistic Inquiry 13(4). 613–35. Reprinted in Bach, Marxh and Safran-Naveh 1987).
  • Burden, H., and P. Ljunglöf. 2005. Parsing linear context-free rewriting systems. IWPT’05, 9th International Workshop on Parsing Technologies, 11–17. Canada: Vancouver.
  • Chen-Main, J., and A. Joshi. forthcoming. A dependency perspective on the adequacy of tree local multi-component tree adjoining grammar. Journal of Logic and Computation.
  • Chiang, D. 2004. Mildly context-sensitive grammars for estimating maximum entropy parsing models. Proceedings of FGVienna: The 8th conference on Formal Grammar, ed. by G. Jaeger, P. Monachesi and G. Penn. Vienna: CSLI.
  • Collins, M. 1999. Head-driven statistical models for natural language parsing. PhD thesis, University of Pennsylvania, PA, USA.
  • Crescenzi, P., D. Gildea, A. Marino, G. Rossi, and G. Satta. 2011. Optimal head-driven parsing complexity for linear context-free rewriting systems. Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, ed. by Y. Matsumoto and R. Mihalcea, 450–9. Oregon: Portland.
  • Evang, K. 2011. Parsing discontinuous constituents in English. Master's thesis, Eberhard Karls Universität Tübingen, Tübingen, Germany.
  • Evang, K., and L. Kallmeyer. 2011. PLCFRS parsing of english discontinuous constituents. Proceedings of the 12th International Conference on Parsing Technologies (IWPT 2011), ed. by H. Bunt, J. Nivre and Ö. Çetinoǧlu, 104–16. Dublin, Ireland.
  • Gildea, D. 2010. Optimal parsing strategies for linear context-free rewriting systems. Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, ed. by R. Kaplan, J. Burstein, M. Harper and G. Penn, 769–76. Los Angeles, California: Association for Computational Linguistics.
  • Gómez-Rodríguez, C. and G. Satta. 2009. An optimal-time binarization algorithm for linear context-free rewriting systems with fan-out two. Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, ed. by R. Kaplan, J. Burstein, M. Harper and G. Penn, 985–93. Suntec, Singapore: Association for Computational Linguistics.
  • Gómez-Rodríguez, C., M. Kuhlmann, G. Satta, and D. Weir. 2009. Optimal reduction of rule length in linear context-free rewriting systems. Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, ed. by M. Ostendorf, M. Collins, S. Narayanan, D. W. Oard and L. Vanderwende, 539–47. Boulder, Colorado: Association for Computational Linguistics.
  • Gómez-Rodríguez, C., M. Kuhlmann, and G. Satta. 2010. Efficient parsing of well-nested linear context-free rewriting systems. Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP, ed. by K.-Y. Su, J. Su, J. Wiebe and H. Li, 276–84. Los Angeles, California: Association for Computational Linguistics.
  • Huybregts, R. 1984. The weak inadequacy of context-free phrase structure grammars. Van Periferie naar Kern, ed. by G. de Haan, M. Trommelen and W. Zonneveld, 81–99. Dordrecht, Holland: Foris.
  • Joshi, A. K. 1985. Tree adjoining grammars: how much contextsensitivity is required to provide reasonable structural descriptions?. Natural Language Parsing, ed. by D. Dowty, L. Karttunen and A. Zwicky, 206–50. Cambridge, UK: Cambridge University Press.
  • Joshi, A. K., and Y. Schabes. 1997. Tree-adjoning grammars. Handbook of Formal Languages, ed. by G. Rozenberg and A. Salomaa, 69–123. Berlin: Springer.
  • Joshi, A. K., L. S. Levy, and M. Takahashi. 1975. Tree adjunct grammars. Journal of Computer and System Science 10. 136–63.
  • Kaji, Y., R. Nakanishi, H. Seki, and T. Kasami. 1992. The universal recognition problems for multiple context-free grammars and for linear context-free rewriting systems. IEICE Transactions on Information and Systems E75–D(1). 78–88.
  • Kallmeyer, L. 2010a. On mildly context-sensitive non-linear rewriting. Research on Language and Computation 8(4). 341–63.
  • Kallmeyer, L.. 2010b. Parsing beyond context-free grammars. Heidelberg: Springer.
  • Kallmeyer, L., and W. Maier. 2010. Data-driven parsing with probabilistic linear context-free rewriting systems. Proceedings of the 23rd International Conference on Computational Linguistics (COLING 2010), ed. by C.-R. Huang and D. Jurafsky, 537–45. Beijing, China: Coling 2010 Organizing Committee.
  • Kallmeyer, L., W. Maier, and G. Satta. 2009. Synchronous rewriting in tree banks. Proceedings of the 11th International Conference on Parsing Technologies (IWPT’09), ed. by É. Villemonte de la Clergerie, H. Bunt and L. Danlos, 69–72. Paris: Association for Computational Linguistics.
  • Kanazawa, M. 2009. The pumping lemma for well-nested multiple context-free languages. DLT 2009, Vol. 5583 of LNCS, ed. by V. Diekert and D. Nowotka, 312–25. Berlin Heidelberg: Springer.
  • Kato, Y., H. Seki, and T. Kasami. 2006. Stochastic multiple context-free grammar for rna pseudoknot modeling. Proceedings of The Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms (TAG+8), ed. by T. Becker and L. Kallmeyer, 57–64. Sydney, Australia: Association for Computational Linguistics.
  • Klein, D., and C. D. Manning. 2003. Accurate unlexicalized parsing. Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics, 423–30. Sapporo, Japan: Association for Computational Linguistics.
  • Kracht, M. 2003. The mathematics of language, number 63 in studies in generative grammar. Berlin: Mouton de Gruyter.
  • Kuhlmann, M. 2010. Dependency structures and lexicalized grammars, Vol. 6270 of LNCS. Berlin, Heidelberg, New York: Springer.
  • Kuhlmann, M., and G. Satta. 2009. Treebank grammar techniques for non-projective dependency parsing. Twelfth Conference of the European Chapter of the Association for Computational Linguistics, ed. by L. Lascarides, C. Gardent and J. Nivre, 478–86. Athens, Greece: Association for Computational Linguistics.
  • Levy, R. 2005. Probabilistic models of word order and syntactic discontinuity. PhD thesis, Stanford University, Stanford, CA, USA.
  • Ljunglöf, P. 2004. Expressivity and complexity of the grammatical framework. PhD thesis, Department of Computer Science, Gothenburg University and Chalmers University of Technology, Gothenburg, Sweden.
  • Maier, W. 2010. Direct parsing of discontinuous constituents in German. Proceedings of the NAACL HLT 2010 First Workshop on Statistical Parsing of Morphologically-Rich Languages, ed. by D. Seddah, S. Kübler and R. Tsarfaty, 58–66. Los Angeles, CA, USA: Association for Computational Linguistics.
  • Maier, W., and L. Kallmeyer. 2010. Discontinuity and non-projectivity: using mildly context-sensitive formalisms for data-driven parsing. Proceedings of the Tenth International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+10), ed. by S. Bangalore, R. Frank and M. Romero, 119–26. New Haven: Linguistics Department, Yale University.
  • Maier, W., and T. Lichte. 2011. Characterizing discontinuity in constituent treebanks, Formal Grammar. 14th International Conference, FG 2009. Bordeaux, France, July 25-26, 2009. Revised Selected Papers, Vol. 5591 of Lecture Notes in Artificial Intelligence, ed. by P. de Groote, M. Egg and L. Kallmeyer, 167–82. Berlin/Heidelberg/New York: Springer-Verlag.
  • Maier, W., and A. Søgaard. 2008. Treebanks and mild context-sensitivity. Proceedings of FG 2008: The 13th conference on Formal Grammar, ed. by Philippe de Groote, 61–76. Hamburg, Germany: CSLI Publications.
  • Marcus, M., G. Kim, M. A. Marcinkiewicz, R. MacIntyre, A. Bies, M. Ferguson, K. Katz, and B. Schasberger. 1994. The penn treebank: annotating predicate argument structure, HLT ’94. Proceedings of the Workshop on Human Language Technology, 114–9. Morristown, NJ, USA: Association for Computational Linguistics.
  • Michaelis, J. 2001a. Derivational minimalism is mildly context-sensitive. Logical Aspects of Computational Linguistics, Vol. 2014 of LNCS/LNAI, ed. by M. Moortgat, 179–98. Berlin, Heidelberg: Springer.
  • Michaelis, J.. 2001b. On formal properties of minimalist grammars. PhD thesis, Potsdam University, Potsdam, Germany.
  • Michaelis, J.. 2001c. Transforming linear context-free rewriting systems into minimalist grammars. Logical Aspects of Computational Linguistics, Vol. 2099 of LNCS/LNAI, ed. by C. R. Philippe de Groote and Glyn Morrill, 228–44. Berlin, Heidelberg: Springer.
  • Michaelis, J., and M. Kracht. 1996. Semilinearity as a syntactic invariant. Logical Aspects of Computational Linguistics, LNCS/LNAI Vol. 1328, ed. by C. Retoré, 329–45. Springer: Berlin, Heidelberg.
  • Mönnich, U. 2010. Well-nested tree languages and attributed tree transducers. Proceedings of the Tenth International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+10), ed. by S. Bangalore, R. Frank and M. Romero, 35–43. New Haven: Linguistics Department, Yale University.
  • Nederhof, M.-J. 2003. Weighted deductive parsing and Knuth's. Algorithm, Computational Linguistics 29(1). 135–43.
  • Parmentier, Y., L. Kallmeyer, W. Maier, T. Lichte, and J. Dellert. 2008. TuLiPA: a syntax-semantics parsing environment for mildly context-sensitive formalisms. Proceedings of the Ninth International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+9), 121–8. Tübingen.
  • Pereira, F. C. N., and D. Warren. 1983. Parsing as deduction. 21st Annual Meeting of the Association for Computational Linguistics, 137–44. Cambridge, MA: Association for Computational Linguistics.
  • Radzinski, D. 1991. Chinese number-names, tree adjoining languages, and mild context-sensitivity. Computational Linguistics 17. 277–99.
  • Sagot, B., and G. Satta. 2010. Optimal rank reduction for linear context-free rewriting systems with fan-out two. Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, ed. by J. Hajič, S. Carberry, S. Clark and J. Nivre, 525–33. Uppsala, Sweden: Association for Computational Linguistics.
  • Satta, G. 1992, Recognition of linear context-free rewriting systems. Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics. Newark, DE, USA: Association for Computational Linguistics.
  • Savitch, W. J., E. Bach, W. Marxh, and G. Safran-Naveh. (eds.) 1987. The formal complexity of natural language. Reidel, Dordrecht, Holland: Studies in Linguistics and Philosophy.
  • Seki, H., T. Matsumura, M. Fujii, and T. Kasami. 1991. On multiple context-free grammars. Theoretical Computer Science 88(2). 191–229.
  • Shieber, S. M. 1985. Evidence against the context-freeness of natural language. Linguistics and Philosophy 8. 333–43. Reprinted in (Savitch et al. 1987).
  • Shieber, S. M., Y. Schabes, and F. C. N. Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming 24(1 and 2). 3–36.
  • Sikkel, K. 1997. Parsing schemata, texts in theoretical computer science. Berlin, Heidelberg, New York: Springer-Verlag.
  • Skut, W., B. Krenn, T. Brants, and H. Uszkoreit. 1997. An annotation scheme for free word order languages. Proceedings of the Fifth Conference on Applied Natural Language Processing (ANLP), 88–95. Washington, D.C: Association for Computational Linguistics.
  • Stabler, E. P. 1997. Derivational minimalism. Logical aspects of computational linguistics, number 1328 in lecture notes in computer science, ed. by C. Retoré, 68–95. NY: Springer-Verlag.
  • Vijay-Shanker, K., D. J. Weir, and A. K. Joshi. 1987. Characterizing structural descriptions produced by various grammatical formalisms. Proceedings of the 25th Annual Meeting of the Association for Computational Linguistics. Stanford: Association for Computational Linguistics.
  • Villemonte de La Clergerie, E. 2002. Parsing mildly context-sensitive languages with thread automata, COLING 2002: The 19th International Conference on Computational Linguistics.
  • Weir, D. J. 1988. Characterizing mildly context-sensitive grammar formalisms. PhD thesis, University of Pennsylvania, Philadelphia, USA.
View Full Article (HTML) Get PDF (434K)