3630 search results - page 17 / 726 » How to Compare Treebanks |
ECML
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In their search through a huge space of possible hypotheses, rule induction algorithms compare estimations of qualities of a large number of rules to find the one that ap...
IJCNLP
2004
Springer
15 years 5 months ago
2004
Springer
This paper presents an iterative CKY parsing algorithm for probabilistic contextfree grammars (PCFG). This algorithm enables us to prune unnecessary edges produced during parsing,...
LREC
2008
15 years 1 months ago
2008
Some alternatives to the standard evalb measures for parser evaluation are considered, principally the use of a tree-distance measure, which assigns a score to a linearity and anc...
104
click to vote
NAACL
2007
15 years 1 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...
ACL
1998
15 years 1 months ago
1998
Determining the attachments of prepositions and subordinate conjunctions is a key problem in parsing natural language. This paper presents a trainable approach to making these att...