Sciweavers

ICDAR
2011
IEEE
12 years 4 months ago
Word Retrieval in Historical Document Using Character-Primitives
Word searching and indexing in historical document collections is a challenging problem because, characters in these documents are often touching or broken due to degradation/agei...
Partha Pratim Roy, Jean-Yves Ramel, Nicolas Ragot
STRINGOLOGY
2004
13 years 5 months ago
BDD-Based Analysis of Gapped q-Gram Filters
Recently, there has been a surge of interest in gapped q-gram filters for approximate string matching. Important design parameters for filters are for example the value of q, the f...
Marc Fontaine, Stefan Burkhardt, Juha Kärkk&a...
GEOINFO
2007
13 years 6 months ago
Approximate String Matching for Geographic Names and Personal Names
The problem of matching strings allowing errors has recently gained importance, considering the increasing volume of online textual data. In geotechnologies, approximate string mat...
Clodoveu A. Davis, Emerson de Salles
ALENEX
2007
158views Algorithms» more  ALENEX 2007»
13 years 6 months ago
Faster Filters for Approximate String Matching
We introduce a new filtering method for approximate string matching called the suffix filter. It has some similarity with well-known filtration algorithms, which we call factor...
Juha Kärkkäinen, Joong Chae Na
ASAP
2004
IEEE
185views Hardware» more  ASAP 2004»
13 years 8 months ago
Families of FPGA-Based Algorithms for Approximate String Matching
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
Tom Van Court, Martin C. Herbordt
CIKM
1997
Springer
13 years 8 months ago
Applications of Approximate Word Matching in Information Retrieval
As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the effective ...
James C. French, Allison L. Powell, Eric Schulman
LATIN
1998
Springer
13 years 8 months 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
SPIRE
1999
Springer
13 years 8 months ago
Cross-Domain Approximate String Matching
Approximate string matching is an important paradigm in domains ranging from speech recognition to information retrieval and molecular biology. In this paper, we introduce a new f...
Daniel P. Lopresti, Gordon T. Wilfong
CPM
1999
Springer
127views Combinatorics» more  CPM 1999»
13 years 8 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
ICDAR
1999
IEEE
13 years 8 months ago
Models and Algorithms for Duplicate Document Detection
This paper introduces a framework for clarifying and formalizing the duplicate document detection problem. Four distinct models are presented, each with a corresponding algorithm ...
Daniel P. Lopresti