SIMILARITY AND DISSIMILARITY MEASURES FOR SETS OF STRINGS.
A common basis for many of the similarity and dissimilarity measures involving a pair of strings has been presented in the literature. We extend the concepts introduced previously to capture various numerical and nonnumerical measures involving more than two strings. A measure D(X,Y,. . . ,Z) has been defined involving the set of strings left brace X,Y,. . . Z right brace in terms of two abstract operators and a function which has as many arguments as there are strings in the set left brace X,Y,. . . ,Z right brace . The quantity D(X,Y,. . . ,Z) represents various numerical and nonnumerical quantities involving left brace X,Y,. . . ,Z right brace such as Length of their Longest Common Subsequence, (LLCS) the Length of their Shortest Common Supersequence, (LSCS) the set of their common subsequences, the set of their common supersequences and the set of their shuffles. The computational properties of D(X,Y,. . . ,Z) have been discussed.
|Conference||Proceedings of the 1982 Conference on Information Sciences and Systems.|
Kashyap, R.L. (R. L.), & Oommen, J. (1982). SIMILARITY AND DISSIMILARITY MEASURES FOR SETS OF STRINGS. In Proceedings of the 1982 Conference on Information Sciences and Systems. (pp. 101–105).