On 19.11.2012, 10:39:33 Marcin Miłkowski wrote: > Yeah, but to reuse the pattern, we would have to build a finite-state > machine in memory (or on disk) first. This is far from trivial because > we would have to flatly encode all features (token, pos, lemma) and make > sure we still have Java Unicode regular expressions.
This has been mentioned before, but I'll just mention it again, in the hope that somebody might want to take a closer look: It might well be that everything our syntax can express can also be expressed with Jape: http://gate.ac.uk/sale/tao/splitch8.html#chap:jape They compile their grammar into a FSM, and they have no restrictions on the right hand side, i.e. you can use Java to handle your match. It might be possible to create Jape rules on-the-fly from our XML syntax. Regards Daniel -- http://www.danielnaber.de ------------------------------------------------------------------------------ Monitor your physical, virtual and cloud infrastructure from a single web console. Get in-depth insight into apps, servers, databases, vmware, SAP, cloud infrastructure, etc. Download 30-day Free Trial. Pricing starts from $795 for 25 servers or applications! http://p.sf.net/sfu/zoho_dev2dev_nov _______________________________________________ Languagetool-devel mailing list Languagetool-devel@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/languagetool-devel
