A Deductive Approach to Dependency Parsing

13 years 6 months ago

Download www.aclweb.org

We define a new formalism, based on Sikkel's parsing schemata for constituency parsers, that can be used to describe, analyze and compare dependency parsing algorithms. This abstraction allows us to establish clear relations between several existing projective dependency parsers and prove their correctness.

Carlos Gómez-Rodríguez, John A. Carr

Real-time Traffic

ACL 2008 | Computational Linguistics | Dependency Parsing Algorithms | Projective Dependency Parsers | Sikkel's Parsing Schemata |

claim paper

» A lowcomplexity broadcoverage probabilistic Dependency Parser for English

» Memoisation for Glue Language Deduction and Categorial Parsing

» DataDriven Parsing with Probabilistic Linear ContextFree Rewriting Systems

» It Depends on the Translation Unsupervised Dependency Parsing via Word Alignment

» ShiftReduce Dependency DAG Parsing

» An Earley Parsing Algorithm for Range Concatenation Grammars

» A Modular Cascaded Approach to Complete Parsing

» Improving Dependency Parsing with Subtrees from AutoParsed Data

Post Info
More Details (n/a)

Added	29 Oct 2010
Updated	29 Oct 2010
Type	Conference
Year	2008
Where	ACL
Authors	Carlos Gómez-Rodríguez, John A. Carroll, David J. Weir

Comments (0)

Sciweavers

A Deductive Approach to Dependency Parsing

ACL 2008 | Computational Linguistics | Dependency Parsing Algorithms | Projective Dependency Parsers | Sikkel's Parsing Schemata |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers