Abstract | ||
---|---|---|
We present an approach for smoothing treebank-PCFG lexicons by interpolating treebank lexical parameter estimates with estimates obtained from unannotated data via the Inside-outside algorithm. The PCFG has complex lexical categories, making relative-frequency estimates from a treebank very sparse. This kind of smoothing for complex lexical categories results in improved parsing performance, with a particular advantage in identifying obligatory arguments subcategorized by verbs unseen in the treebank. |
Year | Venue | Keywords |
---|---|---|
2009 | Studies in Mycology | treebank-pcfg lexicon,unannotated data,obligatory argument,complex lexical categories result,inside-outside algorithm,improved parsing performance,relative-frequency estimate,treebank lexical parameter estimate,complex lexical category,particular advantage,smoothing fine-grained pcfg lexicon |
Field | DocType | Citations |
Computer science,Interpolation,Part of speech,Smoothing,Treebank,Artificial intelligence,Natural language processing,Parsing | Conference | 0 |
PageRank | References | Authors |
0.34 | 10 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Tejaswini Deoskar | 1 | 67 | 7.27 |
Mats Rooth | 2 | 427 | 140.68 |
Khalil Sima'an | 3 | 443 | 50.32 |