W dniu 2013-04-30 17:36, Daniel Naber pisze: > On 30.04.2013, 09:47:28 Marcin Miłkowski wrote: > >> Why? It's just for internal processing, not for maintaining the >> dictionary. What might possibly go wrong? > > Maybe I didn't follow this discussion closely enough, but does that work > for compounds with more than two parts? At least for German, these are less > common than compounds made up of two words, but not uncommon enough to > ignore them.
If hunspell specifies them as valid words, then they would be present. If it turns out that the generated file gets too large to handle, we will think of other ways of compounding without hunspell (maybe in a rule-based way). Hm, as I think of it, if there are conversions from hunspell to HFST for German or Dutch dictionaries, then if HFST allows to print all the words it contains, we should have a very simple way to convert the dictionary. Regards, Marcin ------------------------------------------------------------------------------ Introducing AppDynamics Lite, a free troubleshooting tool for Java/.NET Get 100% visibility into your production application - at no cost. Code-level diagnostics for performance bottlenecks with <2% overhead Download for free and get started troubleshooting in minutes. http://p.sf.net/sfu/appdyn_d2d_ap1 _______________________________________________ Languagetool-devel mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/languagetool-devel
