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 <[email protected]> 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 <[email protected]> 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 <[email protected]> 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...
>
> > > On Jul 29, 1:06 am, CDZ <[email protected]> wrote:
>
> > > > Is there a similar function to what PHP has with similar_text() in
> > > > C#?
> > > > (http://us3.php.net/manual/en/function.similar-text.php)

Reply via email to