How to check if two string are a partial match in C#? [duplicate]

Answer 1

You're looking for Levenshtein distance

Here is an implementation in C#.

Here is a Generic Implementation of the Levenshtein Distance. (as in the Diff/Dist. between two IEnum<T> 's)

Implementations of Levenshtein Distance Algorithm in a LOT of languages.

Answer 2

Usually an implementation of the Levenshtein distance also called edit distance is used for this. This will find matches based on the minimum number of edits needed to transform one string into the other, counting all insertions, deletions, or substitutions of a single character as a measure for the "cost" - candidates are then strings that have the minimum cost.

Here's a link to an article with a generic implementation in C#.