Hi Sam, to do such matching you first of all need something that keeps semantic information about words: e.g. a thesaurus, where "red", "blue" and "black" are all grouped under the same term "colour". Otherwise, how will your system know that "nike red shoes" should match to "nike shoes -black" and not to "nike shoes -"anything else"? You would also need rules that define that only certain terms are to be replaced with alternatives. Otherwise, your query can be mapped to X alternatives like: "-adidas red shoes", "nike red -pants" ...
Cheers, Olena On Sun, 23 Oct 2005, Sam Lee wrote: > Hi, > Someone suggested that I should use MemoryIndex to > match content to a large # of queries. e.g. "nike red > shoes" --match--> "nike shoes -blue" and --match--> > "nike shoes -black"... What if I have 100000 of these > queries for each content? and there maybe 1000000 of > these contents. > > But how fast is MemoryIndex? Is it cpu and memory > intensive? I read somewhere and it said that it is > about three order faster than normal operation. If > so, why not use it for the normal operation as well? > > Many thanks. > > > > > > __________________________________ > Start your day with Yahoo! - Make it your home page! > http://www.yahoo.com/r/hs > --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
