-
January 6th, 2005, 02:49 PM
#1
Senior Member
Intelligent search
I am interested in the Google features.."Did you mean xxxxxxx" when you type in a misspell word. How it is done?
-
January 7th, 2005, 01:08 AM
#2
Click here.
EDIT: I'm not sure exactly how it's done, that's as close as I got to finding it. Just thought the thread deserved at least one response. x_x
-
January 7th, 2005, 12:51 PM
#3
Senior Member
Originally posted here by Winds8929
Click here.
EDIT: I'm not sure exactly how it's done, that's as close as I got to finding it. Just thought the thread deserved at least one response. x_x
beside using Google API. Any other alternatives?
-
January 14th, 2005, 05:10 AM
#4
I'm new here so take this for what it's worth...
Ask google how they do it...if it's a trade secret all they'll say is no...right!
as they say: it never hurts to ask! ...well, sometimes it does.
-
January 14th, 2005, 07:23 AM
#5
You would need a huge index of all of the terms. When the user types it in, you try to match terms. If it matches, you probably don't need a "Were you searching for: xxxx?". If it doesn't match, you'd probably have to find similar words using regular expressions. Then you have a list to select from, but you don't want to give the user all similar words, but ones they'd probably be searching for. You'd probably then weigh all of the similar terms, and return the one with the most relevance compared to the others.
User Query: Leen
Database: Apple, Car, Lap, Led, Lead, Leak, Leap, Lean, Learn, Long, Mountain, Orange, Zebra
Match All Letters: None
Match 3 Letters: Apple, Car, Lap, Led, Lead, Leak, Leap, Lean, Learn, Long, Mountain, Orange, Zebra
Match 2 Letters: Apple, Car, Lap, Led, Lead, Leak, Leap, Lean, Learn, Long, Mountain, Orange, Zebra
Match 1 Letter: Apple, Car, Lap, Led, Lead, Leak, Leap, Lean, Learn, Long, Mountain, Orange, Zebra
We have 2 very similar words that the user could have typed in (assuming they spelled somewhere in the ball park). Maybe some algorithm could take the similar words and ignore the vowels and see which matches the best (assuming vowels are often mis-placed/pronounced). Or perhaps we could see how many results "Lean" and "Learn" return in our queries, and return the one with the most "hits" (assumes the user wants the most popular result).
I'm not sure how they work, but those are just a few ideas that would seem fairly straight forward in principle. As for how to program this and scale it the way Google does, I don't want to think about it
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
-
Forum Rules
|
|