Motifs de graphe pour le calcul de dépendances syntaxiques complètes

Jonathan Marchand 1 Bruno Guillaume 1 Guy Perrier 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : This article describes a method to build syntactical dependencies starting from the phrase structure parsing process. The goal is to obtain all the information needed for a detailled semantical analysis. Interaction Grammars are used for parsing; the saturation of polarities which is the core of this formalism can be mapped to dependency relation. Formally, graph patterns are used to express the set of constraints which control dependency creations.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.inria.fr/inria-00537103
Contributor : Jonathan Marchand <>
Submitted on : Thursday, November 18, 2010 - 9:50:01 AM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM
Document(s) archivé(s) le : Saturday, February 19, 2011 - 2:53:05 AM

Files

motif_dep.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00537103, version 1
  • ARXIV : 1011.4155

Collections

Citation

Jonathan Marchand, Bruno Guillaume, Guy Perrier. Motifs de graphe pour le calcul de dépendances syntaxiques complètes. Conférence sur le Traitement Automatique des Langues Naturelles - TALN'10, Jul 2010, Montréal, Canada. ⟨inria-00537103⟩

Share

Metrics

Record views

209

Files downloads

271