crf-chain1: First-order, linear-chain conditional random fields

[ bsd3, library, math ] [ Propose Tags ]

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.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.2.0, 0.2.1, 0.2.2, 0.2.3
Dependencies array, base (>=4 && <5), binary, containers, data-lens, logfloat, monad-codec (>=0.2 && <0.3), parallel, random, sgd (>=0.2.1 && <0.3), vector, vector-binary [details]
License BSD-3-Clause
Copyright Copyright (c) 2012 IPI PAN
Author Jakub Waszczuk
Maintainer waszczuk.kuba@gmail.com
Category Math
Home page https://github.com/kawu/crf-chain1
Source repo head: git clone git://github.com/kawu/crf-chain1.git
Uploaded by JakubWaszczuk at 2012-10-09T11:41:06Z
Distributions
Reverse Dependencies 2 direct, 0 indirect [details]
Downloads 3506 total (15 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]