Sciweavers

2 search results - page 1 / 1
» Ziv Lempel Compression of Huge Natural Language Data Tries U...
Sort
View
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
13 years 9 months ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
IR
2008
13 years 5 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira