Sciweavers

44 search results - page 2 / 9
» On-line Approximate String Matching in Natural Language
Sort
View
ICALP
2005
Springer
13 years 10 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...
ACL
2007
13 years 6 months ago
Grammar Approximation by Representative Sublanguage: A New Model for Language Learning
We propose a new language learning model that learns a syntactic-semantic grammar from a small number of natural language strings annotated with their semantics, along with basic ...
Smaranda Muresan, Owen Rambow
CICLING
2009
Springer
13 years 6 months ago
Generalized Mongue-Elkan Method for Approximate Text String Comparison
Abstract. The Mongue-Elkan method is a general text string comparison method based on an internal character-based similarity measure (e.g. edit distance) combined with a token leve...
Sergio Jimenez, Claudia Becerra, Alexander F. Gelb...
HOTOS
2007
IEEE
13 years 9 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
IJCNLP
2004
Springer
13 years 10 months ago
Improving Noun Phrase Coreference Resolution by Matching Strings
In this paper we present a noun phrase coreference resolution system which aims to enhance the identification of the coreference realized by string matching. For this purpose, we ...
Xiaofeng Yang, Guodong Zhou, Jian Su, Chew Lim Tan