is there any method that will find nearest match

Question

I want to compare two strings, such as:

 str1 = "this is a dynamic data";
 str2 = "this is a <data_1> data";

Is there any method that will find the nearest match? I have used Ternary Search Tree (TST) Dictionary functions. Are there any other ways to do this kind of thing?

This should make for an interesting read http://stackoverflow.com/q/49263/108847 — Fishcake, May 24 '11 at 12:05

score 1 · Answer 1 · answered May 24 '11 at 12:08

1

There is no such method in BCL that finds nearest match of the string. But you can roll your own. read about "Levenshtein Distance" on the following link

answered May 24 '11 at 12:08

crypted

9,848
2
38
52

score 1 · Answer 2 · answered May 24 '11 at 12:13

1

In am not sure about this thing in C#, but yes that is there in SQL,

select difference('this is a dynamic data','this is a dynamic')

answered May 24 '11 at 12:13

user765671

174
7

score 1 · Accepted Answer · answered May 24 '11 at 12:21

1

What about the Jaccard similarity coefficient? http://en.wikipedia.org/wiki/Jaccard_index

It's easy to implement and gives a good similarity score. You have to tokenize your sentences though ;)

answered May 24 '11 at 12:21

Thomas Jungblut

20,525
5
65
89

is there any method that will find nearest match

3 Answers3