Abstract
High precision text re-use detection allows humanists to discover where and how particular authors are quoted (e.g., the different sections of Plato’s work that come in and out of vogue). This paper reports on on-going work to provide the high recall text re-use detection that humanists often demand. Using an edition of one Greek work that marked quotations and paraphrases from the Homeric epics as our testbed, we were able to achieve a recall of at least 94% while maintaining a precision of 73%. This particular study is part of a larger effort to detect text re-use across 15 million words of Greek and 10 million words of Latin available or under development as openly licensed TEI XML.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balasubramanian, N., Allan, J.: Syntactic Query Models for Restatement Retrieval. In: Karlgren, J., Tarhio, J., Hyyrö, H. (eds.) SPIRE 2009. LNCS, vol. 5721, pp. 143–155. Springer, Heidelberg (2009)
Potthast, M., Stein, B.: New Issues in Near-duplicate Detection Data Analysis, Machine Learning and Applications. In: Studies in Classification, Data Analysis, and Knowledge Organization, pp. 601–609. Springer, Heidelberg (2008)
Wang, J.H., Chang, H.C.: Exploiting Sentence-Level Features for Near-Duplicate Document Detection. In: Lee, G.G., Song, D., Lin, C.-Y., Aizawa, A., Kuriyama, K., Yoshioka, M., Sakai, T. (eds.) AIRS 2009. LNCS, vol. 5839, pp. 205–217. Springer, Heidelberg (2009)
Hoad, T.C., Zobel, J.: Methods for identifying versioned and plagiarized documents. J. Am. Soc. Inf. Sci. Technol. 54(3), 203–215 (2003)
Alzahrani, S., Salim, N., Abraham, A.: Understanding plagiarism linguistic patterns, textual features, and detection methods. IEEE Transactions on Systems, Man, and Cybernetics, Part C 42(2), 133–149 (2012)
Lee, J.: A computational model of text reuse in ancient literary texts. In: Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics, Prague, Czech Republic, Association for Computational Linguistics, pp. 472–479 (June 2007)
Bourdaillet, J., Ganascia, J.G., Pierre, U., Curie, M.: J.g: Alignment of noisy unstructured text data. In: Proc. of the IJCAI Workshop on Analytics for Noisy Unstructured Text Data (AND 2007) of the 20th International Joint Conference on Artificial Intelligence (IJCAI), pp. 139–146 (2007)
Trillini, R.H., Quassdorf, S.: A ’key to all quotations’? a corpus-based parameter model of intertextuality. LLC 25(3), 269–286 (2010)
Coffee, N., Koenig, J.P., Poornim, S., Forstall, C., Ossewaarde, R., Jacobson, S.: The tesserae project: Intertextual analysis of latin poetry (2011), http://dh2011abstracts.stanford.edu/xtf/view?docId=tei/ab-215.xml;query=;brand=default (last accessed February 14, 2012)
Forstall, C.W., Jacobson, S.L., Scheirer, W.J.: Evidence of intertextuality: investigating paul the deacon’s angustae vitae. Literary and Linguistic Computing 26(3), 285–296 (2011)
Kane, A., Tompa, F.W.: Janus: the intertextuality search engine for the electronic manipulus florum project. Literary and Linguistic Computing 26(4), 407–415 (2011)
Broder, A.Z.: On the resemblance and containment of documents. In: Compression and Complexity of Sequences (SEQUENCES 1997), pp. 21–29. IEEE Computer Society (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Büchler, M., Crane, G., Moritz, M., Babeu, A. (2012). Increasing Recall for Text Re-use in Historical Documents to Support Research in the Humanities. In: Zaphiris, P., Buchanan, G., Rasmussen, E., Loizides, F. (eds) Theory and Practice of Digital Libraries. TPDL 2012. Lecture Notes in Computer Science, vol 7489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33290-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-33290-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33289-0
Online ISBN: 978-3-642-33290-6
eBook Packages: Computer ScienceComputer Science (R0)