Sciweavers

2836 search results - page 47 / 568
» Parsing Algorithms and Metrics
Sort
View
COLING
2008
13 years 9 months ago
Unsupervised Induction of Labeled Parse Trees by Clustering with Syntactic Features
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...
Roi Reichart, Ari Rappoport
EMNLP
2010
13 years 5 months ago
Improved Fully Unsupervised Parsing with Zoomed Learning
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...
Roi Reichart, Ari Rappoport
COLING
1994
13 years 9 months ago
Universal Guides And Finiteness And Symmetry Of Grammar Processing Algorithms
This paper presents a novel technique called "universal guides" which explores inherent properties of logic grammars (changing variable binding status) in order to chara...
Miroslav Martinovic
APPROX
2008
Springer
124views Algorithms» more  APPROX 2008»
13 years 9 months ago
Deterministic 7/8-Approximation for the Metric Maximum TSP
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...
Lukasz Kowalik, Marcin Mucha
ACL
2007
13 years 9 months ago
An Ensemble Method for Selection of High Quality Parses
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 ...
Roi Reichart, Ari Rappoport