On Jan 24, 2008 4:24 PM, Zaphod Beeblebrox <[EMAIL PROTECTED]> wrote:
> thanks for the offer, but I ended up getting the app working using the
> n-gram method.
Sure you did. ;]
That was some cool stuff tho... isn't math like, rock'n?
--
There is a sacredness in tears. They are not the mark of w
thanks for the offer, but I ended up getting the app working using the
n-gram method.
On Jan 24, 2008 2:05 PM, Paul Vernon <[EMAIL PROTECTED]> wrote:
> > I've looked into Soundex, but it doesn't quite cut it.it seems
> > more for matching 1 word names and if they're transversed "Coffee
> > Bro
actually, I found a pretty easy way of doing it. The algorithm is
called n-gram and it takes but a few lines of code to implement.
On Jan 24, 2008 11:10 AM, Dinner <[EMAIL PROTECTED]> wrote:
> It will drive you mad trying, Zaph.
>
> I give grammar checkers mad props.
>
> --
> Sport is imposing o
> I've looked into Soundex, but it doesn't quite cut it.it seems
> more for matching 1 word names and if they're transversed "Coffee
> Brothers", it won't recognize it.
You mean like this?
http://www.newmediadevelopment.net/site_search_results.cfm?criteria=Brohters+Coffee&submit=Go
Verity ha
It will drive you mad trying, Zaph.
I give grammar checkers mad props.
--
Sport is imposing order on what was chaos.
Anthony Starr
On Jan 24, 2008 8:15 AM, Zaphod Beeblebrox <[EMAIL PROTECTED]> wrote:
> I"m trying to tweak my document management system so that typos are
> eliminated. Ideall
