crf-chain1-constrained: First-order, constrained, linear-chain conditional random fields
|Versions||0.1.0, 0.1.1, 0.1.2, 0.2.0, 0.2.1, 0.3.0, 0.3.1, 0.3.2|
|Dependencies||array, base (==4.*), binary, containers, data‑lens, logfloat, monad‑codec (==0.2.*), parallel, random, sgd (>=0.2.1 && <0.3), vector, vector‑binary [details]|
|Copyright||Copyright (c) 2012 IPI PAN|
|Source repo||head: git clone git://github.com/kawu/crf-chain1-constrained.git|
|Uploaded||by JakubWaszczuk at Wed Jan 9 11:32:25 UTC 2013|
|Downloads||2900 total (26 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
The library provides efficient implementation of the first-order, linear-chain conditional random fields (CRFs) with position-wise constraints imposed over label values.
It is strongly related to the simpler http://hackage.haskell.org/package/crf-chain1 library where constraints are not taken into account and all features which are not included in the CRF model are considered to have probability of 0. Here, on the other hand, such features do not influence the overall probability of the (sentence, labels) pair - they are assigned the default potential of 0.
Efficient algorithm for determining marginal probabilities of individual labels is provided. The tagging is performed with respect to marginal probabilities.
For package maintainers and hackage trustees