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.
|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|
|Change log||None available|
|Dependencies||array, base (==4.*), binary, containers, data-lens, logfloat (>=0.12.1 && <0.14), monad-codec (==0.2.*), parallel, random, sgd (>=0.3.2 && <0.4), vector, vector-binary, vector-th-unbox (>=0.2.1 && <0.3) [details]|
|Copyright||Copyright (c) 2012 IPI PAN|
|Source repository||head: git clone git://github.com/kawu/crf-chain1-constrained.git|
|Uploaded||Mon Feb 23 11:35:59 UTC 2015 by JakubWaszczuk|
|Downloads||1232 total (61 in last 30 days)|
|Status||Docs available [build log]|
Last success reported on 2015-02-23 [all 1 reports]
- crf-chain1-constrained-0.3.2.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
For package maintainers and hackage trustees