crf-chain1: First-order, linear-chain conditional random fields
The library provides efficient implementation of the first-order, linear-chain conditional random fields (CRFs).
Important feature of the implemented flavour of CRFs is that transition features which are not included in the CRF model are considered to have probability of 0. It is particularly useful when the training material determines the set of possible label transitions (e.g. when using the IOB encoding method). Furthermore, this design decision makes the implementation much faster for sparse datasets.
|Versions||0.2.0, 0.2.1, 0.2.2|
|Dependencies||array, base (>=4 && <4.8), binary, containers, data-lens, logfloat, monad-codec (==0.2.*), parallel, random, sgd (>=0.2.1 && <0.3), vector, vector-binary (==0.1.*), vector-th-unbox (>=0.2.1 && <0.3) [details]|
|Copyright||Copyright (c) 2012 IPI PAN|
|Revised||Revision 1 made by AdamBergmark at Fri Oct 2 13:56:25 UTC 2015|
|Source repo||head: git clone git://github.com/kawu/crf-chain1.git|
|Uploaded||by JakubWaszczuk at Thu Jun 19 10:28:06 UTC 2014|
|Downloads||1599 total (25 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs available [build log]
Successful builds reported [all 1 reports]
Hackage Matrix CI
- crf-chain1-0.2.2.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees