String generating hypergraph grammars with word order restrictions

Authors:
Martin Riedl;Sebastian Seifert;Ingrid Fischer
Affiliations:
Computer Science Institute, University of Erlangen–Nuremberg, Germany;Computer Science Institute, University of Erlangen–Nuremberg, Germany;ALTANA Chair for Bioinformatics and Information Mining, University of Konstanz, Germany
Venue:
ICGT'06 Proceedings of the Third international conference on Graph Transformations
Year:
2006

Citing 8
Cited 0

The string generating power of context-free hypergraph grammars

Journal of Computer and System Sciences
Context-free hypergraph grammars have the same term-generating power as attribute grammars

Acta Informatica
Hyperedge replacement graph grammars

Handbook of graph grammars and computing by graph transformation
An efficient context-free parsing algorithm

Communications of the ACM
Hyperedge Replacement: Grammars and Languages

Hyperedge Replacement: Grammars and Languages
Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition

Speech and Language Processing: An Introduction to Natural Language Processing, Computational Linguistics, and Speech Recognition
On the complexity of ID/LP parsing 1

Computational Linguistics
The computational difficulty of ID/LP parsing

ACL '85 Proceedings of the 23rd annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

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.