The Grammar Spring Cleaning algorithm goes through a grammar implemented in TDL and removes types that do not have an impact on the competence of the grammar. It is combined with a grammar compression algorithm, implemented by Yi Zhang, that counts the minimum types needed to create an equivalent grammar, where equivalent grammars refers to grammars that return the same set of analyses for the same input string (which may be the empty set).

AntskeFokkens: Spring Cleaning algorithm

YiZhang: Grammar Compression

The standard reference for Spring Cleaning and Grammar Compression is Fokkens et al. (2011) .bib

Currently, you should contact a.s.fokkens@vu.nl. A link to a release will be provided soon.

Coming soon.

All experiments reported below were carried out on 2012-12-12 and 2012-12-13, respectively.