Constrained Permutations for Computing Textual Similarity

A M Ramsay, A Alshahrani

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.
Original languageEnglish
Title of host publicationArtificial Intelligence:
Subtitle of host publicationMethodology, Systems, and Applications - 18th International Conference, AIMSA 2018, Varna, Bulgaria, September 12-14, 2018, Proceedings
Pages83-92
Number of pages10
DOIs
Publication statusPublished - 28 Aug 2018

Fingerprint

Dive into the research topics of 'Constrained Permutations for Computing Textual Similarity'. Together they form a unique fingerprint.

Cite this