Parsing String Generating Hypergraph Grammars [chapter]

Sebastian Seifert, Ingrid Fischer
2004 Lecture Notes in Computer Science  
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 n b n c n 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
more » ... rley parser is well known. In this paper, an Earley parser for string generating hypergraph grammars is presented, leading to a parser for natural languages that is able to handle discontinuities. 1 The German examples are first translated word by word into English to explain the German sentence structure and then reordered into a correct English sentence. 2 The present perfect in German can be translated either in present perfect or in past tense in English.
doi:10.1007/978-3-540-30203-2_25 fatcat:koukx7hqyrhelkvczved4autbi