Intelligent search
Results 1 to 5 of 5

Thread: Intelligent search

  1. #1
    Senior Member
    Join Date
    May 2003
    Posts
    226

    Intelligent search

    I am interested in the Google features.."Did you mean xxxxxxx" when you type in a misspell word. How it is done?

  2. #2
    Senior Member
    Join Date
    Dec 2004
    Posts
    104
    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
    http://www.AntiOnline.com/sig.php?imageid=745
    http://www.AntiOnline.com/sig.php?imageid=746
    -- Be a part of the team! Join Protochaderin and help us build the game you want to play! --
    - http://img.photobucket.com/albums/v6...m/devlogo2.gif -

  3. #3
    Senior Member
    Join Date
    May 2003
    Posts
    226
    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?

  4. #4
    T̙͓̞̣̯ͦͭͅͅȂͧͭͧ̏̈͏̖̖Z̿ ͆̎̄
    Join Date
    Dec 2004
    Posts
    3,171
    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.

  5. #5
    Senior Member
    Join Date
    Oct 2001
    Posts
    786
    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
  •