Summary of the paper
| Title | Detecting Co-Derivative Documents in Large Text Collections |
|---|---|
| Authors | Jan Pomikálek and Pavel Rychlý |
| Abstract | We have analyzed the SPEX algorithm by Bernstein and Zobel (2004) for detecting co-derivative documents using duplicate n-grams. Although we totally agree with the claim that not using unique n-grams can greatly increase the efficiency and scalability of the process of detecting co-derivative documents, we have found serious bottlenecks in the way SPEX finds the duplicate n-grams. While the memory requirements for computing co-derivative documents can be reduced to up to 1% by only using duplicate n-grams, SPEX needs about 40 times more memory for computing the list of duplicate n-grams itself. Therefore the memory requirements of the whole process are not reduced enough to make the algorithm practical for very large collections. We propose a solution for this problem using an external sort with the suffix array in-memory sorting and temporary file compression. The proposed algorithm for computing duplicate n-grams uses a fixed amount of memory for any input size. |
| Language | Single language |
| Topics | Corpus (creation, annotation, etc.), Digital libraries, Document Classification, Text categorisation |
Full paper |
Detecting Co-Derivative Documents in Large Text Collections |
Slides |
- |
| Bibtex | @InProceedings{POMIKLEK08.481, author = {Jan Pomikálek and Pavel Rychlý}, title = {Detecting Co-Derivative Documents in Large Text Collections}, booktitle = {Proceedings of the Sixth International Conference on Language Resources and Evaluation (LREC'08)}, year = {2008}, month = {may}, date = {28-30}, address = {Marrakech, Morocco}, editor = {Nicoletta Calzolari (Conference Chair), Khalid Choukri, Bente Maegaard, Joseph Mariani, Jan Odijk, Stelios Piperidis, Daniel Tapias}, publisher = {European Language Resources Association (ELRA)}, isbn = {2-9517408-4-0}, note = {http://www.lrec-conf.org/proceedings/lrec2008/}, language = {english} } |