Software for "minimalist grammars" (MGs) and related systems
This page has code for
Ocaml,
SWI Prolog,
SICStus Prolog, and
MIT/GNU scheme
implementations of parsers, with sample
grammars, and display tools for trees in various formats.
The prolog implementations are easiest to use and modify.
But currently our fastest way to parse MGs (by far) is to translate
them into MCFGs using Guillaumin's code, and then use an MCFG parser.
The software packages here are in gzipped, tarred directories, as usual.
The tools here for displaying trees and dependency structures use
tcl/tk
and
dot, part of the graphviz package.
For the daring, here are some first studies of minimalist Tupled Pregroup Grammars:
Other closely related work:
- MG and TPG theory papers online by
Jens Michaelis,
Greg Kobele,
John Hale,
Maxime Amblard,
Henk Harkema,
Willemijn Vermaat,
Marcus Smith,
Sourabh Niyogi,
Ben Keil,
and me
-
John Hale has an Ocaml implementation of
the CKY MG parser here. It runs significantly faster than the Prolog versions on this page.
-
Willemijn Vermaat has an MG parser with web-browser access
here
-
Sourabh Niyogi has a MIT/GNU scheme implementation of the CKY MG parser
and a grammar with interesting verb subcategorizations
- The XTAG project has a parser here.
A simple TAG parser is also provided by the prolog code for Shieber, Schabes, and Pereira 1995, available here.
-
Richard Moot has proofnet-based
parser for type logical grammar
implemented in prolog.
-
A multimodal-CCG parser written in Java is here.
We are gradually getting the bugs out, and working on making these
tools more accessible to non-hackers... Watch for updates!
Comments (and especially bug fixes) welcome!
mailto: 
Last modified:
Thu Feb 9 10:36:49 PST 2006
ES home