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

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

2010-11-18

arxiv.org/abs/1011.4155v1

Conf\'erence sur le Traitement Automatique des Langues Naturelles - TALN'10, Montr\'eal : Canada (2010)

Computer Science

Computation and Language

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Motifs de graphe pour le calcul de dépendances syntaxiques complètes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Motifs de graphe pour le calcul de dépendances syntaxiques complètes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Motifs de graphe pour le calcul de dépendances syntaxiques complètes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-536562