Block addressing indices for approximate text retrieval

Journal of the American Society for Information Science and Technology

Volumn 51, Issue 1, 2000, Pages 69-82

  Baeza Yates, Ricardo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; TEXT PROCESSING; WORLD WIDE WEB;

BLOCK ADDRESSING INDICES; STRING MATCHING;

INDEXING (OF INFORMATION);

EID: 0033908395     PISSN: 15322882     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-4571(2000)51:1<69::AID-ASI10>3.0.CO;2-C     Document Type: Article

References (2)

1. Apostolico, A. (1985). The myriad virtues of subword trees. In Combination algorithms on words (pp. 85-96). NATO ISI Series. Berlin, Germany: Springer Verlag.
2. Araujo, M., Navarro, G., & Ziviani, N. (1997). Large text searching allowing errors. In Proceedings WSP'97 (pp. 2-20), Ottawa, Canada: Carleton University Press.