Sciweavers

180 search results - page 6 / 36
» Approximate Searching on Compressed Text
Sort
View
DCC
2003
IEEE
14 years 9 months ago
A Dictionary-Based Multi-Corpora Text Compression System
In this paper we introduce StarZip, a multi-corpora lossless text compression utility which incorporates StarNT, our newly proposed transform algorithm. StarNT is a dictionary-base...
Weifeng Sun, Nan Zhang 0005, Amar Mukherjee
SPIRE
1998
Springer
14 years 2 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
VLDB
1993
ACM
138views Database» more  VLDB 1993»
14 years 1 months ago
Searching Large Lexicons for Partially Specified Terms using Compressed Inverted Files
There are many advantages to be gained by storing the lexicon of a full text database in main memory. In this paper we describe how to use a compressed inverted file index to sear...
Justin Zobel, Alistair Moffat, Ron Sacks-Davis
CIKM
1997
Springer
14 years 2 months ago
Block Addressing Indices for Approximate Text Retrieval
Although the issue of approximate text retrieval is gaining importance in the last years, it is currently addressed by only a few indexing schemes. To reduce space requirements, t...
Ricardo A. Baeza-Yates, Gonzalo Navarro
CPM
2001
Springer
111views Combinatorics» more  CPM 2001»
14 years 2 months ago
Multiple Pattern Matching Algorithms on Collage System
Abstract. Compressed pattern matching is one of the most active topics in string matching. The goal is to find all occurrences of a pattern in a compressed text without decompress...
Takuya Kida, Tetsuya Matsumoto, Masayuki Takeda, A...