Efficient LFG parsing: SxLfg

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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00001060
Contributor : Benoît Sagot <>
Submitted on : Sunday, September 26, 2010 - 9:56:04 PM
Last modification on : Thursday, August 29, 2019 - 2:24:09 PM
Long-term archiving on : Monday, December 27, 2010 - 2:21:13 AM

File

IWPT05.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00001060, version 1

Collections

Citation

Pierre Boullier, Benoît Sagot. Efficient LFG parsing: SxLfg. International Workshop on Parsing Technologies, 2005, Vancouver, Canada. pp.1-10. ⟨inria-00001060⟩

Share

Metrics

Record views

118

Files downloads

330