Seifert S, Fischer I (2004)
Publication Language: English
Publication Type: Conference contribution, Original article
Publication year: 2004
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 On Computer Science
City/Town: Berlin Heidelberg
Pages Range: 352-267
Conference Proceedings Title: Graph Transformations - Second International Conference, ICGT 2004
Journal Issue: 3256
ISBN: 978-3-540-23207-0
URI: http://www2.informatik.uni-erlangen.de/publication/download/ICGT04.pdf
DOI: 10.1007/978-3-540-30203-2_25
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of these grammars, string languages like a nbncn can be modeled that can not be generated by context-free grammars for strings. They are well suited to model discontinuous constituents in natural languages, i.e. constituents that are interrupted by other constituents. For parsing context-free Chomsky grammars, the Barley parser is well known. In this paper, an Barley parser for string generating hypergraph grammars is presented, leading to a parser for natural languages that is able to handle discontinuities. © Springer-Verlag 2004.
APA:
Seifert, S., & Fischer, I. (2004). Parsing String Generating Hypergraph Grammars. In Hartmut Ehrig, Gregor Engels, Francesco Parisi-Presicce, Grzegorz Rozenberg (Eds.), Graph Transformations - Second International Conference, ICGT 2004 (pp. 352-267). Rome, Italy, IT: Berlin Heidelberg: Springer-verlag.
MLA:
Seifert, Sebastian, and Ingrid Fischer. "Parsing String Generating Hypergraph Grammars." Proceedings of the Second International Conference on Graph Transformations (ICGT 04), Rome, Italy Ed. Hartmut Ehrig, Gregor Engels, Francesco Parisi-Presicce, Grzegorz Rozenberg, Berlin Heidelberg: Springer-verlag, 2004. 352-267.
BibTeX: Download