On 30.11.2012, 11:57:28 Marcin Miłkowski wrote: > Alternatively, one could try developing a direct hunspell parser that > creates a graph by using the .aff file. This would be a bit cleaner > because the conversion to lexc / twolc is only a prototype (and hard to > compile).
This might help with the parsing, if someone wants to give it a try: http://code.google.com/p/hunspell- merge/source/browse/trunk/src/hunspell/merge/?r=24 Lucene also has some hunspell-related code that seems to parse the *aff file. Regards Daniel -- http://www.danielnaber.de ------------------------------------------------------------------------------ LogMeIn Rescue: Anywhere, Anytime Remote support for IT. Free Trial Remotely access PCs and mobile devices and provide instant support Improve your efficiency, and focus on delivering more value-add services Discover what IT Professionals Know. Rescue delivers http://p.sf.net/sfu/logmein_12329d2d _______________________________________________ Languagetool-devel mailing list Languagetool-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/languagetool-devel
