Self-indexing natural language

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5280 LNCS, Issue , 2008, Pages 121-132

  Brisaboa, Nieves R ^a   Fariña, Antonio ^a   Navarro, Gonzalo ^b   Places, Angeles S ^a   Rodríguez, Eduardo ^a  

^a UNIVERSITY OF A CORUÑA   (Spain)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION RETRIEVAL; ENTROPY;

INVERTED INDICES; LARGE ALPHABETS; NATURAL LANGUAGE TEXT; NATURAL LANGUAGES; SEARCH TIME; SPACE AND TIME; STRING OF WORDS; SUFFIX-TREES;

INDEXING (OF INFORMATION);

EID: 85041104131     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89097-3_13     Document Type: Conference Paper

References (32)

1. Apostolico, A.: The myriad virtues of subword trees. In: Combinatorial Algorithms on Words. NATO ISI Series, pp. 85-96. Springer, Heidelberg (1985)
2. Arroyuelo, D., Navarro, G., Sadakane, K.: Reducing the space requirement of LZ- index. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 319-330. Springer, Heidelberg (2006)
3. Baeza-Yates, R., Navarro, G.: Block-addressing indices for approximate text retrieval. J. of the American Society for Information Science 51(1), 69-82 (2000)
4. Baeza-Yates, R., Ribeiro-Neto, B.: Modern Information Retrieval. Addison-Wesley, Reading (1999)
5. Baeza-Yates, R., Salinger, A.: Experimental analysis of a fast intersection algorithm for sorted sequences. In: Proc. 12th SPIRE, pp. 13-24 (2005)
6. Barbay, J., López-Ortiz, A., Lu, T.: Faster adaptive set intersections for text searching. In: Proc. 5th WEA, pp. 146-157 (2006)
7. Bell, T., Cleary, J., Witten, I.: Text compression. Prentice Hall, Englewood Cliffs (1990)
8. Brisaboa, N., Fariña, A., Ladra, S., Navarro, G.: Reorganizing compressed text. In: Proc. 31st ACM SIGIR. ACM Press, New York (to appear, 2008)
9. Brisaboa, N., Fariña, A., Navarro, G., Paramá, J.: Lightweight natural language text compression. Information Retrieval 10, 1-33 (2007)
10. Culpepper, J., Moffat, A.: Compact set representation for information retrieval. In: Proc. 14th SPIRE, pp. 137-148 (2007)
11. Fariña, A., Navarro, G., Paramá, J.: Word-based statistical compressors as natural language compression boosters. In: Proc. 18th DCC, pp. 162-171 (2008)
12. Ferragina, P., Manzini, G., Makinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms (TALG) 3(2) article 20 (2007)
13. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th ACM-S1AM SODA, pp. 841-850 (2003)
14. Heaps, H.: Information Retrieval - Computational and Theoretical Aspects. Academic Press, London (1978)
15. Huffman, D.: A method for the construction of minimum-redundancy codes. Proc. of the I.R.E. 40(9), 1090-1101 (1952)
16. Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th FOCS, pp. 549-554 (1989)
17. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. S1AM Journal on Computing 22(5), 935-948 (1993)
18. Manzini, G.: An analysis of the Burrows-Wheeler transform. Journal of the ACM 48(3), 407-430 (2001)
19. Moffat, A.: Word-based text compression. Software Practice and Experience 19(2), 185-198 (1989)
20. Moffat, A., Katajainen, J.: In-place calculation of minimum-redundancy codes. In: Sack, J.-R., Akl, S.G., Dehne, F., Santoro, N. (eds.) WADS 1995, vol. 955, pp. 393-402. Springer, Heidelberg (1995)
21. Moura, E., Navarro. G., Ziviani, N., Baeza-Yates, R.: Fast and flexible word searching on compressed text. ACM Transactions on Information Systems (TOIS) 18(2), 113-139 (2000)
22. Munro, L: Tables. In: Chandra, V., Vinay, V. (eds.) FSTTCS 1996, vol. 1180, pp. 37-42.
23. Springer, Heidelberg (1996) 23. Navarro, G.: Indexing text using the Ziv-Lempel trie. Journal of Discrete Algorithms 2(1), 87-114 (2004)
24. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys 39(1) article 2 (2007)
25. Navarro, G., Moura., E., Neubert, M., Ziviani, N., Baeza-Yates, R,.: Adding compression to block addressing inverted indexes. information Retrieval 3(1), 49-77 (2000)
26. Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms 48(2), 294-313 (2003)
27. Sadakane, K.: Succinct data structures for flexible text retrieval systems. Journal of Discrete Algorithms (JDA) 5(1), 12-22 (2007)
28. Sanders, P., Transier, F.: Intersection in integer inverted indices. In: Proc. 9th ALENEX (2007)
29. Sanders, P., Transier, F.: Compressed inverted indexes for in-memory search engines. In: Proc. 10th ALENEX (2008)
30. Strohman, T., Croft, B.: Efficient document retrieval in main memory. In: Proc. 30th ACM S1G1R, pp. 175-182. ACM Press, New York (2007)
31. Weiner, P.: Linear pattern matching algorithm. In: Proc. 14th Annual IEEE Symposium on Switching and Automata Theory, pp. 1-11 (1973)
32. Witten, I., Moffat, A., Bell, T.: Managing Gigabytes, 2nd edn. Morgan Kaufmann Publishers, San Francisco (1999)