Name
Abstract | ||
|---|---|---|
We consider the problem of parsing a sentence that is partially annotated with information about where phrases start and end. The application domain is interactive parse selection with probabilistic grammars. It is explained that the main obstacle is spurious ambiguity. The proposed solution is first described in terms of appropriately constrained synchronous grammars, and then in terms of a computational model for parsing. Experiments show the feasibility for a practical grammar. |
Year | Venue | Keywords |
|---|---|---|
2011 | IWPT | probabilistic grammar,application domain,main obstacle,synchronous grammar,bracketed structure,proposed solution,practical grammar,interactive parse selection,computational model,spurious ambiguity |
Field | DocType | Citations |
Rule-based machine translation,Top-down parsing,S-attributed grammar,L-attributed grammar,Computer science,Theoretical computer science,Bottom-up parsing,Parsing expression grammar,Artificial intelligence,Natural language processing,Parser combinator,Parsing | Conference | 0 |
PageRank | References | Authors |
0.34 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mark-jan Nederhof | 1 | 387 | 53.30 |
| Ricardo Sánchez-Sáez | 2 | 13 | 2.36 |