Efficient and robust LFG parsing: SxLfg

Authors:
Pierre Boullier;Benoît Sagot
Affiliations:
INRIA-Rocquencourt, Chesnay Cedex, France;INRIA-Rocquencourt, Chesnay Cedex, France
Venue:
Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology
Year:
2005

Citing 4
Cited 4

The interface between phrasal and functional constraints

Computational Linguistics
Parsing the wall street journal using a Lexical-Functional Grammar and discriminative estimation techniques

ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Range concatenation grammars

New developments in parsing technology
Maximum entropy estimation for feature forests

HLT '02 Proceedings of the second international conference on Human Language Technology Research

Error mining in parsing results

ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Are very large context-free grammars tractable?

IWPT '07 Proceedings of the 10th International Conference on Parsing Technologies
Constructing parse forests that include exactly the n-best PCFG trees

IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Computational linguistics and natural language processing

CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we introduce a new parser, called SxLfg, based on the Lexical-Functional Grammars formalism (LFG). We describe the underlying context-free parser and how functional structures are efficiently computed on top of the CFG shared forest thanks to computation sharing, lazy evaluation, and compact data representation. We then present various error recovery techniques we implemented in order to build a robust parser. Finally, we offer concrete results when SxLfg is used with an existing grammar for French. We show that our parser is both efficient and robust, although the grammar is very ambiguous.