Sciweavers

2836 search results - page 153 / 568
» Parsing Algorithms and Metrics
Sort
View
EMNLP
2008
13 years 9 months ago
Syntactic Constraints on Paraphrases Extracted from Parallel Corpora
We improve the quality of paraphrases extracted from parallel corpora by requiring that phrases and their paraphrases be the same syntactic type. This is achieved by parsing the E...
Chris Callison-Burch
ACL
2006
13 years 9 months ago
Mildly Non-Projective Dependency Structures
We present parsing algorithms for various mildly non-projective dependency formalisms. In particular, algorithms are presented for: all well-nested structures of gap degree at mos...
Marco Kuhlmann, Joakim Nivre
COLING
2000
13 years 9 months ago
Automatic Extraction of Subcategorization Frames for Czech
We present some novel machine learning techniques for the identification of subcategorization information for verbs in Czech. We compare three different statistical techniques app...
Anoop Sarkar, Daniel Zeman
ICIP
2000
IEEE
14 years 9 months ago
Computationally Scalable Partial Distance Based Fast Search Motion Estimation
In this paper, we present a class of algorithms that use a partial distance metric to speedup the motion estimation process. The partial distance metric is used within the motion ...
Krisda Lengwehasatit, Antonio Ortega
IPL
2007
114views more  IPL 2007»
13 years 8 months ago
Spanning trees with minimum weighted degrees
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
Mohammad Ghodsi, Hamid Mahini, Kian Mirjalali, Sha...