@hackage partage0.1.0.1

Parsing factorized

Categories
- Natural Language Processing
License
BSD-3-Clause
Maintainer
waszczuk.kuba@gmail.com
Links
Versions
- 0.1.0.1 Wed, 16 Mar 2016
- 0.1.0.0 Tue, 15 Mar 2016

Installation
In your cabal file:
Dependencies (12)
- base >=4 && <5
- containers >=0.5 && <0.6
- mtl >=2.1 && <2.3
- random >=1.1 && <1.2
- transformers >=0.3 && <0.5
- vector >=0.10 && <0.12
Dependents (1)
@hackage/acme-everything

The library implements an Earley-style, bottom-up parser for tree adjoining grammars (TAGs) with special focus on structure (and, hence, computation) sharing.

Two particular flavours of structure sharing are currently implemented:

Subtrees common to different elementary trees are shared amongst them. The input TAG, which can be seen as a set of elementary (initial and auxiliary) grammar trees, is in fact transformed into an equivalent DAG.
Flat production grammar rules representing the individual parts of the DAG are then compressed in the form of a minimal FSA. Other forms of compression are also provided by the library (e.g. prefix tree).