Skip to Main content Skip to Navigation
New interface
Conference papers

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
Complete list of metadata
Contributor : Jonathan Marchand Connect in order to contact the contributor
Submitted on : Thursday, November 18, 2010 - 9:50:01 AM
Last modification on : Friday, February 4, 2022 - 3:16:34 AM
Long-term archiving on: : Saturday, February 19, 2011 - 2:53:05 AM


Files produced by the author(s)


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



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⟩



Record views


Files downloads