Predictive, Earley-style parsing for unrestricted relational grammars faces a number of problems not present in a context-free string grammar counterpart. Here a subclass of unrestricted relational grammars called fringe relational grammars is proposed along with an Earley-style recognition algorithm. The grammar makes use of fringe elements (the minimal and maximal elements of partially ordered sets) in defining its productions. The parsing algorithm uses indexing methods based on fringe elements in order to take advantage of equivalence relations on parse table entries, thus avoiding redundant processing.<>
Earley-style parsing for relational grammars
1992-01-01
781350 byte
Conference paper
Electronic Resource
English
Learning Grammars for Architecture-Specific Facade Parsing
British Library Online Contents | 2016
|Image interpretation using multi-relational grammars
IEEE | 1990
|Online Contents | 2015
|Learning daily activity patterns with probabilistic grammars
Online Contents | 2015
|