101 search results - page 1 / 21 » Accurate Unlexicalized Parsing |
ACL
2003
13 years 6 months ago
2003
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
TSD
2007
Springer
13 years 11 months ago
2007
Springer
Many state-of-the-art statistical parsers for English can be viewed as Probabilistic Context-Free Grammars (PCFGs) acquired from treebanks consisting of phrase-structure trees enri...
NAACL
2007
13 years 6 months ago
2007
We present several improvements to unlexicalized parsing with hierarchically state-split PCFGs. First, we present a novel coarse-to-fine method in which a grammar’s own hierarc...
EMNLP
2004
13 years 6 months ago
2004
Most statistical parsers have used the grammar induction approach, in which a stochastic grammar is induced from a treebank. An alternative approach is to induce a controller for ...
ACL
2011
12 years 8 months ago
2011
We investigate full-scale shortest-derivation parsing (SDP), wherein the parser selects an analysis built from the fewest number of training fragments. Shortest derivation parsing...