4 search results - page 1 / 1 » Simple, Accurate Parsing with an All-Fragments Grammar |
ACL
2010
13 years 2 months ago
2010
We present a simple but accurate parser which exploits both large tree fragments and symbol refinement. We parse with all fragments of the training set, in contrast to much recent...
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...
ACL
1993
13 years 6 months ago
1993
In this paper we describe a new technique for parsing free text: a transformational grammar I is automatically learned that is capable of accurately parsing text into binary-branc...