Dependency Parsing with Graph Rewriting

We propose to use Graph Rewriting for parsing syntactic dependencies. We present a system of rewriting rules dedicated to French and we evaluate it by parsing the SEQUOIA corpus.

[1]  Kemal Oflazer.  Dependency Parsing with an Extended Finite State Approach , 1999, ACL.

[2]  Bruno Guillaume,et al.  Modular Graph Rewriting to Compute Semantics , 2011, IWCS.

[3]  Marie Candito,et al.  Le corpus Sequoia : annotation syntaxique et exploitation pour l’adaptation d’analyseur par pont lexical (The Sequoia Corpus : Syntactic Annotation and Use for a Parser Lexical Domain Adaptation Method) [in French] , 2012, JEP/TALN/RECITAL.

[4]  Ralph Debusmann,et al.  Extensible Dependency Grammar: A New Methodology , 2004, Workshop On Recent Advances In Dependency Grammar.

[5]  Wolfgang Menzel,et al.  A Transformation-based Parsing Technique With Anytime Properties , 2000, IWPT.

[6]  Joakim Nivre,et al.  An Efficient Algorithm for Projective Dependency Parsing , 2003, IWPT.

[7]  Assaf Urieli,et al.  Robust French syntax analysis: reconciling statistical methods and linguistic knowledge in the Talismane toolkit. (Analyse syntaxique robuste du français : concilier méthodes statistiques et connaissances linguistiques dans l'outil Talismane) , 2013 .

[8]  Pascal Denis,et al.  Coupling an annotated corpus and a lexicon for state-of-the-art POS tagging , 2012, Lang. Resour. Evaluation.

[9]  Michael A. Covington,et al.  A Fundamental Algorithm for Dependency Parsing , 2004 .

[10]  Marie Candito,et al.  Dépendances syntaxiques de surface pour le français Spécifications pour l'évaluation de l'analyse syntaxique en dépendances , 2009 .

[11]  Jason Eisner,et al.  Three New Probabilistic Models for Dependency Parsing: An Exploration , 1996, COLING.

[12]  Éric Villemonte de la Clergerie,et al.  Jouer avec des analyseurs syntaxiques , 2014 .