Juan Martorell wrote: >> In French grammar.xml, I have some very long regexp, >> and LT is still fast. I prefer to find as many errors as I can >> with as fewer false positive as possible. For speed, I try >> to optimize regexp if I can, but not at the price removing >> rules and finding less errors. >> > > I agree on that as long as it is worth, so to say I son´t want a rule with > lots of exceptions which triggers once every million sentences in texts.
Some rules may trigger very rarely, but when you start having hundreds or thousands of such rare rules, the probability of one of them triggering can become high. Regards Dominique ------------------------------------------------------------------------------ Learn Graph Databases - Download FREE O'Reilly Book "Graph Databases" is the definitive new guide to graph databases and their applications. Written by three acclaimed leaders in the field, this first edition is now available. Download your free book today! http://p.sf.net/sfu/NeoTech _______________________________________________ Languagetool-devel mailing list Languagetool-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/languagetool-devel
