Sciweavers

125 search results - page 17 / 25
» Cross-Domain Approximate String Matching
Sort
View
SPIRE
2005
Springer
14 years 1 months ago
Faster Generation of Super Condensed Neighbourhoods Using Finite Automata
We present a new algorithm for generating super condensed neighbourhoods. Super condensed neighbourhoods have recently been presented as the minimal set of words that represent a p...
Luís M. S. Russo, Arlindo L. Oliveira
ICDE
2010
IEEE
199views Database» more  ICDE 2010»
14 years 7 months ago
Fuzzy Matching of Web Queries to Structured Data
Recognizing the alternative ways people use to reference an entity, is important for many Web applications that query structured data. In such applications, there is often a mismat...
Tao Cheng, Hady Wirawan Lauw, Stelios Paparizos
LATIN
1998
Springer
14 years 4 days ago
Fast Two-Dimensional Approximate Pattern Matching
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
Ricardo A. Baeza-Yates, Gonzalo Navarro
VLDB
2005
ACM
93views Database» more  VLDB 2005»
14 years 1 months ago
Indexing Mixed Types for Approximate Retrieval
In various applications such as data cleansing, being able to retrieve categorical or numerical attributes based on notions of approximate match (e.g., edit distance, numerical di...
Liang Jin, Nick Koudas, Chen Li, Anthony K. H. Tun...
FQAS
2009
Springer
127views Database» more  FQAS 2009»
14 years 2 months ago
Finding Top-k Approximate Answers to Path Queries
We consider the problem of finding and ranking paths in semistructured data without necessarily knowing its full structure. The query language we adopt comprises conjunctions of r...
Carlos A. Hurtado, Alexandra Poulovassilis, Peter ...