Okay, thanks Perhaps I could use Levenshtein distance to rank queries with more than one word, just assume one of the words is correctly spelled and then check the Levenshtein distance to the other ones if it won't be too many comparisons.
On Jan 20, 9:36 pm, Barry Hunter <[email protected]> wrote: > Simple-Text-Search (or Searchable) would probably work unless you need > complex queries and/or proper ranking (but you say 'closest' so > possibly not) > > From what I understand of Compass etc, they pretty much need to load > the whole index into memory to use it, so are not going to work on > large corpus's. > > 2010/1/20 Mats <[email protected]>: >
-- You received this message because you are subscribed to the Google Groups "Google App Engine" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/google-appengine?hl=en.
