Name
Abstract | ||
|---|---|---|
We develop a general dynamic programming technique for the tabulation of transition-based dependency parsers, and apply it to obtain novel, polynomial-time algorithms for parsing with the arc-standard and arc-eager models. We also show how to reverse our technique to obtain new transition-based dependency parsers from existing tabular methods. Additionally, we provide a detailed discussion of the conditions under which the feature models commonly used in transition-based parsing can be integrated into our algorithms. |
Year | Venue | Keywords |
|---|---|---|
2011 | ACL | feature model,general dynamic programming technique,arc-eager model,transition-based parsing,new transition-based dependency parsers,transition-based dependency parsers,detailed discussion,polynomial-time algorithm,dynamic programming algorithm,tabular method,computational linguistics |
Field | DocType | Volume |
Dynamic programming,Programming language,LR parser,Computer science,Computational linguistics,Algorithm,Theoretical computer science,Natural language processing,Artificial intelligence,Parsing | Conference | P11-1 |
Citations | PageRank | References |
28 | 1.13 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Kuhlmann | 1 | 309 | 23.06 |
| Carlos Gómez-Rodríguez | 2 | 347 | 41.18 |
| Giorgio Satta | 3 | 902 | 90.85 |