Forum Moderators: open
If not possible, is there any explanation to why so, other than the google FAQ :-
"To provide the most accurate results, Google does not use "stemming" or support "wildcard" searches."
Curiously ;)
Thanks
Basically because Google works by "simply" combining pre-compiled indexes of web pages containing (or in Google's case "relavent to") each word in your query - it doesn't actually search as such, rather it "looks up".
This is why it is so fast - type in "fjgbs" and you get a result back almost immediately.
Two or more words require the pre-compiled indexes to be combined. This is still reasonably fast for a small number of words.
To include wildcard matching, Google would not only have to scan the word list for wildcard matches (in itself not that difficult), but then have to combine the pre-compiled result sets of the many thousands (millions even) of words matching the wildcard, something which would take a massive amount of time and certainly not possible within the time-frame of an interactive query!
Hope this helps!
Thanks
The best way to understand Google - is to use the site search [webmasterworld.com] read the forum charter [webmasterworld.com] and read the famous Google papers from stanford about their indexing & technological roots.
Welcome to WebmasterWorld, btw. There is a LOT of information here.
Alternatively, if you are really brave, check out these Google papers by their staff [labs.google.com] which contain tons of information which will give you a more solid understanding of their inner workings, from the scientists themselves.
its a good question, but as the others said its more expensive, but I would not rule it out in the future.
I often go to good old Altavista for searching incomplete partnumbers.
(and they are not extremely slow by allowing this..)
It does make Google an incomplete search experience, I had the same desire/question:
[webmasterworld.com...]