Work

Relating complexity to practical performance in parsing with wide-coverage unification grammars

Year: 1994

Type: conference-paper

Abstract: The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorithms, using a wide-coverage grammar. The results imply that the study and optimisation of unification-based parsing must rely on empirical data until complexity theory can more accurately predict the practical behaviour of such parsers1.

Source: Proceedings of the conference - Association for Computational Linguistics. Meeting

DOI: 10.3115/981732.981772

Author: John Carroll

Institution: University of Cambridge

Language: English

Topic: Natural Language Processing Techniques

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W2152893442

FWCI: 4.117

Cites: 30

Cited by: 38

Related to: 10