Graph Interpolation Grammars: a Rule-based Approach to the Incremental Parsing of Natural Languages - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

Graph Interpolation Grammars: a Rule-based Approach to the Incremental Parsing of Natural Languages

Abstract

Graph Interpolation Grammars are a declarative formalism with an operational semantics. Their goal is to emulate salient features of the human parser, and notably incrementality. The parsing process defined by GIGs incrementally builds a syntactic representation of a sentence as each successive lexeme is read. A GIG rule specifies a set of parse configurations that trigger its application and an operation to perform on a matching configuration. Rules are partly context-sensitive; furthermore, they are reversible, meaning that their operations can be undone, which allows the parsing process to be nondeterministic. These two factors confer enough expressive power to the formalism for parsing natural languages.
Fichier principal
Vignette du fichier
RR-3390.pdf (99.16 Ko) Télécharger le fichier

Dates and versions

inria-00073299 , version 1 (24-05-2006)

Identifiers

  • HAL Id : inria-00073299 , version 1

Cite

John Larchevêque. Graph Interpolation Grammars: a Rule-based Approach to the Incremental Parsing of Natural Languages. [Research Report] RR-3390, INRIA. 1998. ⟨inria-00073299⟩
57 View
35 Download

Share

Gmail Facebook X LinkedIn More