On 30.05.2012, 10:51:31 Marcin Miłkowski wrote: Hi Marcin,
> > What about compounding and compounding rules? > > They are useful to create a wordlist, but the wordlist is anyway finite, > so it can be represented by the finite-state dictionary (actually, it > could also represent an infinite dictionary, but we have no simple way > to create such a binary automaton, i.e. it would have to be written). do you have any plans to work on that? I'm asking because I have a use case that requires fast suggestions for typos in German compounds. Regards Daniel -- http://www.danielnaber.de ------------------------------------------------------------------------------ Keep yourself connected to Go Parallel: VERIFY Test and improve your parallel project with help from experts and peers. http://goparallel.sourceforge.net _______________________________________________ Languagetool-devel mailing list Languagetool-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/languagetool-devel
