partage: Parsing factorized

[ bsd3, library, natural-language-processing ] [ Propose Tags ] [ Report a vulnerability ]

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).

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.1.0.1
Dependencies base (>=4 && <5), containers (>=0.5 && <0.6), data-lens-light (>=0.1 && <0.2), data-partition (>=0.3 && <0.4), dawg-ord (>=0.5 && <0.6), mmorph (>=1.0 && <1.1), mtl (>=2.1 && <2.3), pipes (>=4.1 && <4.2), PSQueue (>=1.1 && <1.2), random (>=1.1 && <1.2), transformers (>=0.3 && <0.5), vector (>=0.10 && <0.12) [details]
License BSD-3-Clause
Copyright Copyright (c) 2015-2016 Jakub Waszczuk
Author Jakub Waszczuk
Maintainer waszczuk.kuba@gmail.com
Category Natural Language Processing
Home page https://github.com/kawu/partage
Source repo head: git clone https://github.com/kawu/partage.git
Uploaded by JakubWaszczuk at 2016-03-16T10:40:11Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 1484 total (0 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2016-03-16 [all 1 reports]