Paper: Efficiency Considerations For LFG-Parsers - Incremental And Table-Lookup Techniques

ACL ID C88-1005
Title Efficiency Considerations For LFG-Parsers - Incremental And Table-Lookup Techniques
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1988
Authors

Istv£n B£tori and Stefan Marok FB 2 Linguistics EWH Rheinland-Pfalz, l~heinun 3-4, D-5400 Koblenz~ FRG The paper presents a concise description of the LFG-Parser- Generator developed at the EWH in Koblenz. Special attention is paid to efficiency considerations to speed up the system in the execution phase. Lexicon is separated, ll(k)-parsing tables are used and some preliminary ratifications are carried out before the actual execution. The run time system follows the single path strategy and produce.'; the f-structures simultaneously with the processing of the c-stru~:tures. 1 General Considerations of Parsing Effi- ciency Basic parsing techniques (both shift reduce and recursive descent) seem to be inherently inefficient inasmuch as they proceed strictly according to the sequence of the...