Sciweavers

180 search results - page 4 / 36
» Approximate Searching on Compressed Text
Sort
View
ICDAR
2009
IEEE
13 years 7 months ago
Bayesian Similarity Model Estimation for Approximate Recognized Text Search
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
Atsuhiro Takasu
ICDE
2010
IEEE
288views Database» more  ICDE 2010»
14 years 9 months ago
Fast In-Memory XPath Search using Compressed Indexes
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
Diego Arroyuelo, Francisco Claude, Sebastian Manet...
ERCIMDL
2005
Springer
114views Education» more  ERCIMDL 2005»
14 years 3 months ago
Compressing Dynamic Text Collections via Phrase-Based Coding
We present a new statistical compression method, which we call Phrase Based Dense Code (PBDC), aimed at compressing large digital libraries. PBDC compresses the text collection to ...
Nieves R. Brisaboa, Antonio Fariña, Gonzalo...
DCC
2010
IEEE
14 years 4 months ago
A New Searchable Variable-to-Variable Compressor
Word-based compression over natural language text has shown to be a good choice to trade compression ratio and speed, obtaining compression ratios close to 30% and very fast decom...
Nieves R. Brisaboa, Antonio Fariña, Juan-Ra...
USITS
1997
13 years 11 months ago
SASE: Implementation of a Compressed Text Search Engine
Srinidhi Varadarajan, Tzi-cker Chiueh