Percentage Match...

[CDZ]

Is there a similar function to what PHP has with similar_text() in
C#?
(http://us3.php.net/manual/en/function.similar-text.php)

[Brandon Betances]

hows this?

http://msdn.microsoft.com/en-us/library/system.string.compare.aspx

hope thats what your looking for.

[Cerebrus]

No, there isn't but there have been extension methods and other
implementations written to determine the level of similarity between
two given strings.

The most common method is using the Levenshtein algorithm : (Also make
sure to check the Soundex algorithm)

http://www.merriampark.com/ldcsharp.htm

Other useful links:

http://www.atalasoft.com/cs/blogs/stevehawley/archive/2009/01/26/string-similarity-and-extension-methods.aspx
http://dotnetperls.com/Content/Levenshtein-Implementation.aspx
http://en.wikipedia.org/wiki/Category:String_similarity_measures
http://en.wikipedia.org/wiki/Soundex

[Peter Smith]

Well, oh masterful watcher, PHP has levenshtein() and soundex() as
well. similar_text() Oliver's Decision Graphs, building them using
MMLP...I'll save the list the discussion and all, but the paper is at
http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=EBA8E104EF29FB4C88B1D2ED17CB0A3B?doi=10.1.1.52.1476&rep=rep1&type=pdf.

But, I digress. C# implementation of this one? Hrm. My searchFu
escapes me. I'd suggest digging up the php implementation and
converting, if you need the accuracy of this method (and can afford
the O(n*n*n) time complexity).

Course, if I get bored, I might do the same. :)

-- Peter Smith

[CDZ]

Hmm, that's what I was afriad of, I guess I'll just go with the
Levenshtein algorithm, it's not exactly what I wanted but it'll have
to do.

On Jul 29, 9:36 am, Cerebrus <zorg...@sify.com> wrote:
> No, there isn't but there have been extension methods and other
> implementations written to determine the level of similarity between
> two given strings.
>
> The most common method is using the Levenshtein algorithm : (Also make
> sure to check the Soundex algorithm)
>
> http://www.merriampark.com/ldcsharp.htm
>
> Other useful links:
>

> http://www.atalasoft.com/cs/blogs/stevehawley/archive/2009/01/26/stri...http://dotnetperls.com/Content/Levenshtein-Implementation.aspxhttp://en.wikipedia.org/wiki/Category:String_similarity_measureshttp://en.wikipedia.org/wiki/Soundex

[Brandon Betances]

oooooooooooooh you don't just want to compare them, but know how much they are alike. sorry mate.

[CDZ]

Yea, almost like a search engine relevancy... mostly to catch things
like John vs Jon, Car vs Cars, they're not 100% equal but close...

On Jul 29, 2:11 pm, Brandon Betances <bbetan...@gmail.com> wrote:
> oooooooooooooh you don't just want to compare them, but know how much they
> are alike. sorry mate.
>

> On Wed, Jul 29, 2009 at 12:43 PM, CDZ <curt.zieg...@gmail.com> wrote:
>
> > Hmm, that's what I was afriad of, I guess I'll just go with the
> > Levenshtein algorithm, it's not exactly what I wanted but it'll have
> > to do.
>
> > On Jul 29, 9:36 am, Cerebrus <zorg...@sify.com> wrote:
> > > No, there isn't but there have been extension methods and other
> > > implementations written to determine the level of similarity between
> > > two given strings.
>
> > > The most common method is using the Levenshtein algorithm : (Also make
> > > sure to check the Soundex algorithm)
>
> > >http://www.merriampark.com/ldcsharp.htm
>
> > > Other useful links:
>
> >http://www.atalasoft.com/cs/blogs/stevehawley/archive/2009/01/26/stri...
>