hallgren 0feb386691 Faster regular expression pattern matching in the grammar compiler. ...

The sequence operator (x+y) was implemented by splitting the string to be
matched at all positions and trying to match the parts against the two
subpatterns. To reduce the number of splits, we now estimate the minimum and
maximum length of the string that the subpatterns could match. For common
cases, where one of the subpatterns is a string of known length, like
in (x+"y") or (x + ("a"|"o"|"u"|"e")+"y"), only one split will be tried.

2013-02-27 20:59:43 +00:00

..

Command

pg -lexc now writes a list of multichar symbols and a title ("Root") for the lexicon, as required by Xerox lexc

2013-02-03 10:03:15 +00:00

Compile

Faster regular expression pattern matching in the grammar compiler.

2013-02-27 20:59:43 +00:00

Data

Some changed/new utility functions

2012-11-07 15:31:45 +00:00

Grammar

Faster regular expression pattern matching in the grammar compiler.

2013-02-27 20:59:43 +00:00

Infra

now the beam size for the statistical parser can be configured by using the flag beam_size in the top-level concrete module

2013-02-12 10:53:13 +00:00

JavaScript

now the PGF to JavaScript convertor uses PMCFG

2009-12-14 09:53:53 +00:00

Speech

Added an O(n log n) version of nub

2012-08-29 21:45:10 +00:00

System

Eliminate warnings about deprecated use of catch and try

2012-11-08 15:53:46 +00:00

Text

unicode4k-changed

2012-11-05 16:44:31 +00:00

Compile.hs

Better error message for Predef.error

2013-01-28 16:12:56 +00:00

CompilerAPI.hs

started CompilerAPI, still dummy

2011-01-28 15:28:05 +00:00

Grammar.hs

reorganize the directories under src, and rescue the JavaScript interpreter from deprecated

2009-12-13 18:50:29 +00:00

Index.hs

Adding an option to the gf compiler to add an index to pgf files

2010-12-11 16:36:30 +00:00

Quiz.hs

fixed some bugs in translation quiz

2010-11-17 08:30:02 +00:00