Abstract
A wide range of algorithms for computing textual similarity have been proposed. Much recent work has been aimed at calculating lexical similarity, but in general such calculations have to be treated as components in larger algorithms for computing similarity between sentences.
In the current paper we describe a refinement of the well-known dynamic-time warping (DTW) algorithm for calculating the string edit distance between a pair of texts. The refined version of this algorithm allows for a range of constrained permutations without increasing the complexity of the underlying algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
BBC English //www.bbc.co.uk/news, The Guardian www.theguardian.com/uk, Independent http://www.independent.co.uk/news/uk/rss, Reuters uk.reuters.com/news/uk, and Express feeds.feedburner.com/daily-express-uk-.
- 2.
Just like student essays!.
- 3.
Timings are average of 10 runs, MacBook Pro 2.8Â Ghz processor.
- 4.
according to WUP, which all three algorithms use for calculating the cost of exchanging one word for another.
References
Alabbas, M., Ramsay, A.M.: Natural language inference for Arabic using extended tree edit distance with subtrees. J. Artif. Intell. Res. 48, 1–22 (2013). https://www.jair.org/media/3892/live-3892-7342-jair.pdf
Damerau, F.J.: A technique for computer detection and correction of spelling errors. Commun. ACM 7(3), 171–176 (1964)
Mikolov, T., Chen, K., Carrado, G., Dean, J.: Efficient Estimation of Word Representations in Vector Space, 1st edn. (2013). http://arxiv.org/pdf/1301.3781.pdf
Pennington, J., Socher, R., Manning, C.D.: Glove: Global Vectors for Word Representation (2014)
Sakoe, H., Chiba, S.: Dynamic programming optimization for spoken word recognition. IEEE Trans. Acoust. Speech Sign. Proces. 26, 43–49 (1978)
Wu, Z., Palmer, M.: Verb semantics and lexical selection. In: 32nd Annual Meeting of the Association for Computational Linguistics (1994). http://www.aclweb.org/anthology/P94-1019
Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6), 1245–1262 (1989)
Zhao, S., Lan, X., Liu, T., Li, S.: Application-driven statistical paraphrase generation. In: Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2-Volume 2, pp. 834–842. Association for Computational Linguistics (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Ramsay, A., Alshahrani, A. (2018). Constrained Permutations for Computing Textual Similarity. In: Agre, G., van Genabith, J., Declerck, T. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2018. Lecture Notes in Computer Science(), vol 11089. Springer, Cham. https://doi.org/10.1007/978-3-319-99344-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-99344-7_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99343-0
Online ISBN: 978-3-319-99344-7
eBook Packages: Computer ScienceComputer Science (R0)