有没有办法生成某种文本的哈希值以进行比较?
我不知道我想要的是否可能,但是是这样的:
假设我有几个短语,我想生成可以代表文本的该短语的某种较少的字符串。我将把它应用到很多文本中。之后,我比较生成的字符串,看看一个文本与另一个文本有多少不同。
我不需要知道差异在哪里或检索原始字符串,我只需要它来比较字符串。
有这样的事吗?我使解决方案变得复杂?
I don't know if what I want is possible, but is this:
Suppose I have a few phrases, I want to generate some kind of fewer string of that phrase that can represent the text. I will apply this for a lot of texts. After that, I compare the resulting strings to see how much different are one text from the other.
I don't need to know where are the differences or retrieve the original string, I only need this to compare strings.
There is something like this? I'm complicating the solution?
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。

绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
发布评论
评论(1)
有这样的技术,称为模糊散列。看看 ssdeep。您可能还对
使用上下文触发分段散列识别几乎相同的文件
一文感兴趣。There is such technique and is called fuzzy hashing. Take a look at ssdeep. You also might be interested in the paper
Identifying almost identical files using context triggered piecewise hashing
.