me and my colleagues are discussing google's correction system. i guess you know it?
(you enter a word and make a (spelling) mistake (aple). google offers you a search of the word without the mistake [did you mean: apple]).
does anyone of you have experience in such algorithms? how do you think does it work (in general)?
we guess it must be something like:
1. search for the entered word and getting the results
2. searching for other words, that 'look' like the entered one (comparing the letters and their place in the word) and getting the results
3. realizing, that another, very similar word, gets much more results
4. offering this word as [did you mean: ...]
what do you think of this? if you do agree, do you know more about step 2 (the comparing of the words)?
their algorithm must be quite strong (did you expect anything else of google?): http://www.google.com/jobs/britney.html
thank you,
m
Mark Hensler posted this at 08:53—27th February 2003.
He has: 4,044 posts
Joined: Aug 2000
My theory... google calculates the phonetic value of each search term, and searches a databank for words with the same phonetic value. Then it returns the 'corrected' word, which would most likely be determined by which word on the list of common phonetic values has the most results.
I read somewhere what the term is for calculating phonetic values, but I'm having a hard time finding it on google.
Mark Hensler ["Max Albert"] [Email]
If there is no answer on Google, then there is no question.
Mark Hensler posted this at 09:01—27th February 2003.
He has: 4,044 posts
Joined: Aug 2000
Ah, found one algo: metaphone
merlin posted this at 13:41—27th February 2003.
They have: 410 posts
Joined: Oct 1999
well, that sounds reasonable. didn't know, there are phonetic-scripts out there...
thnx mark!
i don't know what about you, but i'm almost every day surprised about google. their engine is just too good.
Panky posted this at 15:54—16th March 2003.
She has: 14 posts
Joined: Mar 2003
Google rules!
Panky
ICQ:51140074