The crf-chain1-constrained package
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.
- No changelog available
|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|
|Copyright||Copyright (c) 2012 IPI PAN|
|Source repository||head: git clone git://github.com/kawu/crf-chain1-constrained.git|
|Uploaded||Sat Oct 27 13:43:23 UTC 2012 by JakubWaszczuk|
|Downloads||913 total (80 in last 30 days)|
|Status||Docs uploaded by user|
Build status unknown [no reports yet]
- crf-chain1-constrained-0.1.0.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
For package maintainers and hackage trustees