算法/库，用于测量串的平等程度 [英] Algorithm / Library for measuring degree of equality of strings

问题描述

有没有办法，给两个字符串得到它们之间的平等程度，应用，可以在外部提供指标的算法？例如，这两个字符串植物code和植物code可能是0.8平等，植物code和工厂可能是0.6平等， 车号和货件详细信息可能是0.6等于（使用extrenally提供的同义词词典）。这些数字是编造出来的，但我希望他们得到跨越点。是否存在这样的算法？我想preFER如果它作为一个库，而不是实现它在我自己的。任何帮助将大大AP preciated。谢谢你。

Is there an algorithm that given two strings yields the degree of equality between them, applying metrics that can be provided externally? For example, the two strings "Plant code" and "PlantCode" could be 0.8 equal, "Plant code" and "Plant" could be 0.6 equal, "Truck no" and "shipment details" could be 0.6 equal (using extrenally provided synonyms dictionary). The numbers are made up, but I hope they get the point across. Does there exist such an algorithm? I'd prefer if it comes as a library, rather than having to implement it on my own. Any help would be greatly appreciated. Thanks.

推荐答案

尝试 Simmetrics 库。它提供simmilarity度量的整数。

Try the Simmetrics library. It provides a whole number of simmilarity metrics.

这篇关于算法/库，用于测量串的平等程度的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！