274 search results - page 32 / 55 » Approximating Edit Distance Efficiently |
SIGIR
2010
ACM
13 years 10 months ago
2010
ACM
We present a novel approach to query reformulation which combines syntactic and semantic information by means of generalized Levenshtein distance algorithms where the substitution...
CIKM
2001
Springer
14 years 2 months ago
2001
Springer
We describe a model-based filtering application that generates candidate case-to-case distinguishing citations. We developed the system to aid editors in identifying indirect rela...
SIGMOD
2010
ACM
14 years 2 months ago
2010
ACM
Edit distance based string similarity join is a fundamental operator in string databases. Increasingly, many applications in data cleaning, data integration, and scientific compu...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
GIS
2007
ACM
14 years 11 months ago
2007
ACM
This work addresses the problem of obtaining the degree of similarity between trajectories of moving objects. Typically, a Moving Objects Database (MOD) contains sequences of (loc...