arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.07013cs.DScs.IR
收藏

符号序列比较的序列覆盖相似性

Sequence Covering Similarity for Symbolic Sequence Comparison

Pierre-François Marteau

摘要:

本文介绍了序列覆盖相似性,我们正式定义的符号序列(字符串)和一组符号序列(字符串)之间的相似性评估。从这个覆盖相似性,我们推导出一个成对的距离比较两个符号序列。我们证明了这个覆盖距离是一个半度量。给出几个例子来说明如何在$O(n \cdot log n)$字符串度量比较与Levenshtein的距离是在$O(n^2)$。最后一个例子介绍了其应用程序的剽窃检测。

英文摘要:

This paper introduces the sequence covering similarity, that we formally define for evaluating the similarity between a symbolic sequence (string) and a set of symbolic sequences (strings). From this covering similarity we derive a pair-wise distance to compare two symbolic sequences. We show that this covering distance is a semimetric. Few examples are given to show how this string metric in $O(n \cdot log n)$ compares with the Levenshtein's distance that is in $O(n^2)$. A final example presents its application to plagiarism detection.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑