Efficiency considerations for LFG-parsers: incremental and table-lookup techniques

Authors:
István Bátori;Stefan Marok
Affiliations:
Rheinland-Pfalz, Koblenz, FRG;Rheinland-Pfalz, Koblenz, FRG
Venue:
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Year:
1988

Citing 3
Cited 0

An object-oriented parser

Computational models of natural language processing
An efficient augmented-context-free parsing algorithm

Computational Linguistics
Language As a Cognitive Process: Syntax

Language As a Cognitive Process: Syntax

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, 11(k)-parsing tables are used and some preliminary unifications are carried out before the actual execution. The run time system follows the single path strategy and produces the f-structures simultaneously with the processing of the c-structures.