Sciweavers

141 search results - page 6 / 29
» Distance Based Indexing for String Proximity Search
Sort
View
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
15 years 1 months ago
A New Indexing Method for Approximate String Matching
We present a new indexing method for the approximate string matching problem. The method is based on a su x tree combined with a partitioning of the pattern. We analyze the resulti...
Gonzalo Navarro, Ricardo A. Baeza-Yates
ICDE
2010
IEEE
262views Database» more  ICDE 2010»
15 years 9 months ago
Approximate String Search in Spatial Databases
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...
Bin Yao, Feifei Li, Marios Hadjieleftheriou, Kun H...
IFIPTCS
2000
15 years 1 months ago
An Index for Two Dimensional String Matching Allowing Rotations
We present an index to search a two-dimensional pattern of size m m in a two-dimensional text of size n n, even when the pattern appears rotated in the text. The index is based on ...
Kimmo Fredriksson, Gonzalo Navarro, Esko Ukkonen
CLEF
2006
Springer
15 years 1 months ago
Statistical vs. Rule-Based Stemming for Monolingual French Retrieval
This paper describes our approach to the 2006 Adhoc Monolingual Information Retrieval run for French. The goal of our experiment was to compare the performance of a proposed stati...
Prasenjit Majumder, Mandar Mitra, Kalyankumar Datt...
SIGIR
2011
ACM
14 years 12 days ago
Inverted indexes for phrases and strings
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
Manish Patil, Sharma V. Thankachan, Rahul Shah, Wi...