Sciweavers

4 search results - page 1 / 1
» Dictionary matching and indexing with errors and don't cares
Sort
View
STOC
2004
ACM
88views Algorithms» more  STOC 2004»
14 years 5 months ago
Dictionary matching and indexing with errors and don't cares
Richard Cole, Lee-Ad Gottlieb, Moshe Lewenstein
SPIRE
1998
Springer
13 years 9 months ago
Fast Approximate String Matching in a Dictionary
A successful technique to search large textual databases allowing errors relies on an online search in the vocabulary of the text. To reduce the time of that online search, we ind...
Ricardo A. Baeza-Yates, Gonzalo Navarro
SIGMOD
2008
ACM
142views Database» more  SIGMOD 2008»
14 years 4 months ago
Cost-based variable-length-gram selection for string collections to support approximate queries efficiently
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
Xiaochun Yang, Bin Wang, Chen Li
SPEECH
2008
203views more  SPEECH 2008»
13 years 4 months ago
A comparison of grapheme and phoneme-based units for Spanish spoken term detection
The ever-increasing volume of audio data available online through the world wide web means that automatic methods for indexing and search are becoming essential. Hidden Markov mod...
Javier Tejedor, Dong Wang, Joe Frankel, Simon King...