FYI: the unmunch algorithm for any one word and affix file is quite
fast so that instead of pre-expanding the root/word list you could in
fact simply take pieces of code from myspell that takes a word and
finds a root with affix flags and then expand it for all affixes on
the fly so to speak (at least for English).
dataparksearch (http://www.dataparksearch.org/) and mnoGoSearch
(http://www.mnogosearch.org/)
use ispell dictionaries the way you have described. I've wrote a message
to both search engine mail lists
about adding the hunspell/myspell support. Ispell is too old, and I
don't see the need of maintaining
ispell and hunspell dictionaries, only hunspell should remain IMHO. I
hope they will add support for hunspell.
Another nice feature of using a spellchecker with affix compression
in that way is that you would catch typos and could offer suggestions
to replace mistyped words very very easily.
Yes, 100% agree, it's a very useful side effect.
In fact, you could just incorporate myspell as a library (it is BSD
licensed) (or any other spellchecker with a compatible license) into
your search code and get all of these features.
I've posted your entire message to the SE mailing lists.
Both search enginges are written in C++, and I think it wouldn't be so
hard to provide hunspell support.
Kevin, thanks for your 2 cents, I think these a $2 :)
Kind Regards,
Oleg Burlaca
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
