Name
Abstract | ||
|---|---|---|
Deep dependency parsing can be cast as the search for maximum acyclic subgraphs in weighted digraphs. Because this search problem is intractable in the general case, we consider its restriction to ... |
Year | Venue | Field |
|---|---|---|
2017 | IWPT | Graph,Top-down parsing,S-attributed grammar,Computer science,Dependency grammar,Bottom-up parsing,Artificial intelligence,Natural language processing,Parser combinator,Parsing,Search problem |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
10 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robin Kurtz | 1 | 0 | 0.68 |
| Marco Kuhlmann | 2 | 309 | 23.06 |