Name
Abstract | ||
|---|---|---|
We define a new formalism, based on Sikkel's parsing schemata for constituency parsers, that can be used to describe, analyze and com- pare dependency parsing algorithms. This abstraction allows us to establish clear rela- tions between several existing projective de- pendency parsers and prove their correctness. |
Year | Venue | Keywords |
|---|---|---|
2008 | ACL | dependency parsing |
Field | DocType | Volume |
Top-down parsing language,Top-down parsing,Programming language,S-attributed grammar,Computer science,Bottom-up parsing,Dependency grammar,Artificial intelligence,Natural language processing,Parser combinator,Formalism (philosophy),Parsing | Conference | P08-1 |
Citations | PageRank | References |
9 | 0.62 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlos Gómez-Rodríguez | 1 | 347 | 41.18 |
| John Carroll | 2 | 1971 | 222.19 |
| David J. Weir | 3 | 840 | 83.84 |