Name
Abstract | ||
|---|---|---|
An open problem in dependency parsing is the accurate and efficient treatment of non-projective structures. We propose to attack this problem using chart-parsing algorithms developed for mildly context-sensitive grammar formalisms. In this paper, we provide two key tools for this approach. First, we show how to reduce non-projective dependency parsing to parsing with Linear Context-Free Rewriting Systems (LCFRS), by presenting a technique for extracting LCFRS from dependency treebanks. For efficient parsing, the extracted grammars need to be transformed in order to minimize the number of nonterminal symbols per production. Our second contribution is an algorithm that computes this transformation for a large, empirically relevant class of grammars. |
Year | Venue | Keywords |
|---|---|---|
2009 | EACL | dependency treebanks,open problem,efficient treatment,non-projective dependency,dependency parsing,non-projective structure,efficient parsing,treebank grammar technique,non-projective dependency parsing,chart-parsing algorithm,linear context-free rewriting systems,context-sensitive grammar formalisms,computational linguistics |
Field | DocType | Citations |
Top-down parsing language,Top-down parsing,S-attributed grammar,L-attributed grammar,Computer science,Bottom-up parsing,Parsing expression grammar,Natural language processing,Artificial intelligence,Parsing,Parser combinator | Conference | 27 |
PageRank | References | Authors |
1.12 | 16 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Kuhlmann | 1 | 309 | 23.06 |
| Giorgio Satta | 2 | 902 | 90.85 |