Using Fingerprints in n-Gram Indices
暂无分享,去创建一个
[1] Lee Jae-Gil,et al. n-Gram/2L: A Space and Time Efficient Two-Level n-Gram Inverted Index Structure , 2006 .
[2] Martin F. Porter,et al. An algorithm for suffix stripping , 1997, Program.
[3] M. F. Porter,et al. An algorithm for suffix stripping , 1997 .
[4] Jonathan D. Cohen,et al. Recursive hashing functions for n-grams , 1997, TOIS.
[5] Ian H. Witten,et al. Managing gigabytes 2nd edition , 1999 .
[6] Christos Faloutsos,et al. Hybrid Index Organizations for Text Databases , 1992, EDBT.
[7] Toru Matsuda,et al. Optimizing query evaluation in n-gram indexing , 1998, SIGIR '98.
[8] Shmuel Tomi Klein,et al. Improved techniques for processing queries in full-text systems , 1987, SIGIR '87.
[9] James Mayfield,et al. Single n-gram stemming , 2003, SIGIR.
[10] Dan Shen,et al. Performance and Scalability of a Large-Scale N-gram Based Information Retrieval System , 2000, J. Digit. Inf..
[11] JUSTIN ZOBEL,et al. Inverted files for text search engines , 2006, CSUR.
[12] Kotagiri Ramamohanarao,et al. Inverted files versus signature files for text indexing , 1998, TODS.