From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,b4b864fa2b61bbba X-Google-Attributes: gid103376,public,usenet X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news1.google.com!news4.google.com!proxad.net!feeder1-2.proxad.net!213.200.89.82.MISMATCH!tiscali!newsfeed1.ip.tiscali.net!newsfeed00.sul.t-online.de!newsfeed01.sul.t-online.de!t-online.de!newsfeed.arcor.de!newsspool4.arcor-online.net!news.arcor.de.POSTED!not-for-mail Newsgroups: comp.lang.ada Subject: Re: Parallel Text Corpus Processing with Ada? From: Georg Bauhaus In-Reply-To: <1194796479.6547.13.camel@K72> References: <1194735959.240323.38210@v2g2000hsf.googlegroups.com> <1t1ab1hzsng9p.101gcl2uomeoy.dlg@40tude.net> <1194796479.6547.13.camel@K72> Content-Type: text/plain Content-Transfer-Encoding: 7bit Message-ID: <1194797592.6547.15.camel@K72> Mime-Version: 1.0 X-Mailer: Evolution 2.12.0 Date: Sun, 11 Nov 2007 17:13:12 +0100 Organization: Arcor NNTP-Posting-Date: 11 Nov 2007 17:13:11 CET NNTP-Posting-Host: fcb6d869.newsspool4.arcor-online.net X-Trace: DXC=DTJ45RYWhJcfF8a^:6>b7e4IUKbC^P>2Fi0:^oPCY\c7>ejVh?MMLMG4L4:`7bFofHMT7Go X-Complaints-To: usenet-abuse@arcor.de Xref: g2news1.google.com comp.lang.ada:18281 Date: 2007-11-11T17:13:11+01:00 List-Id: On Sun, 2007-11-11 at 16:54 +0100, Georg Bauhaus wrote: > For example, BreakX is hard to beat; I believe that your assessment that > "patterns are more powerful, but slower in matching"[1] is really true. There is a "not" missing in the last sentence.