o note Google's approach to this.
Not some fancy spell checker - just mining searcher behaviour patterns.
Google's Bosworth describes this approach approx 13 minutes into this podcast:
http://www.itconversations.com/shows/detail571.html
- Original Message
From: Van Nguyen
podcast:
http://www.itconversations.com/shows/detail571.html
- Original Message
From: Van Nguyen <[EMAIL PROTECTED]>
To: java-user@lucene.apache.org
Sent: Monday, 12 June, 2006 11:09:20 PM
Subject: RE: question with spellchecker
I'll experiment with both.
Thanks...
-Original Message-
I'll experiment with both.
Thanks...
-Original Message-
From: mark harwood [mailto:[EMAIL PROTECTED]
Sent: Wednesday, June 07, 2006 2:16 AM
To: java-user@lucene.apache.org
Subject: Re: question with spellchecker
I think the problem in your particular example is the
suggestion sof
I think the problem in your particular example is the
suggestion software has no consideration of context.
I've been playing with context-sensitive suggestions
recently which take a bunch of validated (ie existing)
words (eg "tape") and use this to help shortlist
alternatives for an unknown or par
try your query like ((ducted^1000 duct~2) +tape)
Or maybe (duct* +tape)
or even better you could try to do some stemming (Porter stemmer should get rid
of these ed-suffixes) and some of the above
if this does not help, have a look at lingpipe spellChecker class as this looks
like exactly what yo
