2836 search results - page 47 / 568 » Parsing Algorithms and Metrics |
129
Voted
COLING
2008
15 years 5 months ago
2008
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
143
Voted
EMNLP
2010
15 years 1 months ago
2010
We introduce a novel training algorithm for unsupervised grammar induction, called Zoomed Learning. Given a training set T and a test set S, the goal of our algorithm is to identi...
115
Voted
COLING
1994
15 years 5 months ago
1994
This paper presents a novel technique called "universal guides" which explores inherent properties of logic grammars (changing variable binding status) in order to chara...
129
Voted
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
We present the first 7/8-approximation algorithm for the maximum traveling salesman problem with triangle inequality. Our algorithm is deterministic. This improves over both the r...
136
Voted
ACL
2007
15 years 5 months ago
2007
While the average performance of statistical parsers gradually improves, they still attach to many sentences annotations of rather low quality. The number of such sentences grows ...