Top-Down Predictive Linking and Complex-Feature-Based Formalisms

Automatic compilation of the linking relation employed in certain parsing algorithms for context-free languages is examined. Special problems arise in the extension of these algorithms to the possibly infinite domain of feature structures. A technique is proposed which is designed specifically for left-recursive categories and is based on the generalization of their occurrences in a derivation. Particular attention is drawn to the top-down predictive character of the linking relation and to its significance not only as a filter for increasing the efficiency of syntactic analysis but as a device for the top-down instantiation of information, which then serves as a key to the directed analysis of inflected forms as well as "unknown" or "new" words.

• Type: Conference
• Year: 1996
• Where: COLING
• Authors: James Kilbury
• Keywords: Certain Parsing Algorithms, COLING 1996, COLING 2008, Linking Relation, Top-down Predictive Character