An Efficiency-Oriented LFG Parser
This paper describes work with the aim of the development of an LFGbased parser and grammar development system, which is to be applied as syntactic analysis component in a natural language consulting system under development. The implementation of the parser and the grammar development environment has been performed in Interlisp-D on a Lisp machine. The parser covers the various types of equations proposed in LFG (as described in Kaplan/Bresnan 82); the grammar development environment enables the grammar writer to specify the linguistic knowledge sources like grammar and lexicon in a descriptive way, where the specification format is very near the standard notational conventions used in LFG.
KeywordsRoot Node Input String Grammar Rule Variable Binding Merging Algorithm
Unable to display preview. Download preview PDF.
- Hans-Ulrich Block, Rudolf Hunze (1986), Incremental Construction of C-and F-structure in a LFG-Parser. In: Proceedings of COLING 86, 490–493Google Scholar
- Hans-Ulrich Block, Hans Haugeneder (1986), The Treatment of Movement-Rules in a LFG-Parser. In: Proceedings of COLING 86, 482–486Google Scholar
- Noam Chomsky (1981), Lectures on Government and Binding. Dordrecht: ForisGoogle Scholar
- Jay Earley (1970), An Efficient Context free Parsing Algorithm, CACM 6(8), 541–545Google Scholar
- Ronald M. Kaplan, Joan W. Bresnan (1982), Lexical-Functional Grammar: A Formal System für Grammatical Representation. In: Joan W. Bresnan (ed): The Mental Representation of Grammatical Relations, Cambridge/Mass.Google Scholar
- Ronald M. Kaplan, Annie Zaenen (1985), Grammatical Functions and Long-Distance Dependencies, ms. Xerox-PARCGoogle Scholar
- Ronald M. Kaplan, Annie Zaenen (1986), Functional Uncertainty in LFG. unpublished ms., StanfordGoogle Scholar
- Lauri Kartunnen, Martin Kay (1985), Structure Sharing with Binary Trees. In: Proceedings of 23rd Meeting of the ACL 1985, 133–136AGoogle Scholar