String Generating Hypergraph Grammars with Word Order Restrictions

Discontinuous constituents and free word order pose constant problems in natural language parsing. String generating hypergraph grammars have been proven useful for handling discontinuous constituents. In this paper we describe a new notation for hypergraph productions that allows on-the-fly interconnection of graph parts with regard to user-defined constraints. These constraints handle the order of nodes within the string hypergraph. The HyperEarley parser for string generating hypergraph grammars [1] is adapted to the new formalism. A German example is used for the explanation of the new notation and algorithms.

[1]  Ingrid Fischer,et al.  Parsing String Generating Hypergraph Grammars , 2004, ICGT.

[2]  Virginia Teller.  Review of Speech and language processing: an introduction to natural language processing, computational linguistics, and speech recognition by Daniel Jurafsky and James H. Martin. Prentice Hall 2000. , 2000 .

[3]  Martin Riedl.  Wortstellungsrestriktionen fur Zeichenketten generierende Hypergraphgrammatiken , 2005 .

[4]  Geoffrey K. Pullum,et al.  Generalized Phrase Structure Grammar , 1985 .

[5]  Joost Engelfriet,et al.  Context-free hypergraph grammars have the same term-generating power as attribute grammars , 1992, Acta Informatica.

[6]  Ingrid Fischer,et al.  Modeling Discontinuous Constituents with Hypergraph Grammars , 2003, AGTIVE.

[7]  G. Edward Barton,et al.  On the complexity of ID/LP parsing 1 , 1985 .

[8]  G. Edward Barton,et al.  The Computational Difficulty of ID/LP Parsing , 1985, ACL.

[9]  Annegret Habel,et al.  Hyperedge Replacement: Grammars and Languages , 1992, Lecture Notes in Computer Science.

[10]  Giorgio Satta,et al.  Partially Ordered Multiset Context-free Grammars and Free-word-order Parsing , 2003, IWPT.

[11]  James H. Martin,et al.  Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition , 2000 .

[12]  Ingrid Fischer,et al.  Word order and discontinuities in a dependency grammar for Hungarian , 2004 .

[13]  Annegret Habel,et al.  Hyperedge Replacement, Graph Grammars , 1997, Handbook of Graph Grammars.

[14]  G. E. Barton Jr..  On the Complexity of ID/LP Parsing , 1985, CL.

[15]  Jay Earley,et al.  An efficient context-free parsing algorithm , 1970, Commun. ACM.

[16]  Stefan Müller,et al.  Continuous or Discontinuous Constituents? A Comparison between Syntactic Analyses for Constituent Order and Their Processing Systems , 2004 .

[17]  James Kilbury,et al.  A Modification of the Earley-Shieber Algorithm for Direct Parsing of ID/LP Grammars , 1984, GWAI.

[18]  EarleyJay.  An efficient context-free parsing algorithm , 1970 .

[19]  Joost Engelfriet,et al.  The String Generating Power of Context-Free Hypergraph Grammars , 1991, J. Comput. Syst. Sci..