String Generating Hypergraph Grammars with Word Order Restrictions
Riedl M, Seifert S, Fischer I (2006)
Publication Language: English
Publication Type: Conference contribution, Original article
Publication year: 2006
Journal
Publisher: Springer-verlag
Edited Volumes: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Series: Lecture Notes in Computer Science
City/Town: Berlin Heidelberg
Book Volume: 4178
Pages Range: 138-152
Conference Proceedings Title: Graph Transformations - ICGT 2006
Event location: Natal, Brasilia
ISBN: 978-3-540-38870-8
URI: http://www2.informatik.uni-erlangen.de/publication/download/riedl.pdf
DOI: 10.1007/11841883_11
Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
How to cite
APA:
Riedl, M., Seifert, S., & Fischer, I. (2006). String Generating Hypergraph Grammars with Word Order Restrictions. In Corradini, A. ; Ehrig, Hartmut ; Montanari, U. ; Ribeiro, L. ; Rozenberg, Grzegorz (Eds.), Graph Transformations - ICGT 2006 (pp. 138-152). Natal, Brasilia, BR: Berlin Heidelberg: Springer-verlag.
MLA:
Riedl, Martin, Sebastian Seifert, and Ingrid Fischer. "String Generating Hypergraph Grammars with Word Order Restrictions." Proceedings of the International Conference on Graph Transformations (ICGT 2006), Natal, Brasilia Ed. Corradini, A. ; Ehrig, Hartmut ; Montanari, U. ; Ribeiro, L. ; Rozenberg, Grzegorz, Berlin Heidelberg: Springer-verlag, 2006. 138-152.
BibTeX: Download