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.
Type de document :
Rapport
[Research Report] RR-3390, INRIA. 1998
Liste complète des métadonnées

https://hal.inria.fr/inria-00073299
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:28:35
Dernière modification le : vendredi 25 mai 2018 - 12:02:02
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:49:23

Fichiers

Identifiants

  • HAL Id : inria-00073299, version 1

Collections

Citation

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〉

Partager

Métriques

Consultations de la notice

174

Téléchargements de fichiers

72