C＃ - 模糊比较两个大字符串数组的 [英] C# - Fuzzy compare of two large string arrays

问题描述

我需要找到B中的所有字符串是部分，在一个存在。

I need to find all strings in B that "partly" exists in A.

B = [ "Hello World!", "Hello Stack Overflow!", "Foo Bar!", "Food is nice...", "Hej" ]
A = [ "World", "Foo" ]
C = B.FuzzyCompare(A) // C = [ "Hello World!", "Foo Bar!", "Food is nice..." ]

我一直在寻找到使用 Levenshtein距离算法 对这个问题的模糊的一部分，还有的 LINQ 的迭代。
但是，A * B通常会导致超过1.5十亿比较。

I've been looking into using Levenshtein Distance Algorithm for the "fuzzy" part of the problem, as well as LINQ for the iterations. However, A * B usually results in over 1,5 billion comparisons.

我应该怎么去呢？有没有一种方法可以快速的几乎比的字符串的两个列表？

How should i go about this? Is there a way to quickly "almost compare" two Lists of strings?

推荐答案

也许这是足够简单地比较字符串，这将是更有效的：

Maybe it's sufficient to simply compare substrings, this would be much more efficient:

var C = B.Where(s1 => A.Any(s2 => s1.IndexOf(s2, StringComparison.OrdinalIgnoreCase) >= 0)).ToList();

这篇关于C＃ - 模糊比较两个大字符串数组的的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！