Efficient LFG parsing: SxLfg - Archive ouverte HAL Access content directly
Conference Papers Year : 2005

Efficient LFG parsing: SxLfg

(1) , (1)
1

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.
Fichier principal
Vignette du fichier
IWPT05.pdf (311.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00001060 , version 1 (26-09-2010)

Identifiers

  • HAL Id : inria-00001060 , version 1

Cite

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

Collections

INRIA INRIA2
67 View
103 Download

Share

Gmail Facebook Twitter LinkedIn More