crf-chain2-tiers-0.2.4: Second-order, tiered, constrained, linear conditional random fields

Safe HaskellSafe-Inferred
LanguageHaskell98

Data.CRF.Chain2.Tiers.Dataset.External

Description

External data representation.

Synopsis

Documentation

data Word a b Source

A word consists of a set of observations and a set of potential labels.

Instances

(Eq a, Eq b) => Eq (Word a b) 
(Ord a, Ord b) => Ord (Word a b) 
(Show a, Show b) => Show (Word a b) 

mkWord :: Set a -> Set [b] -> Word a b Source

A word constructor which checks non-emptiness of the potential set of labels.

type Sent a b = [Word a b] Source

A sentence of words.

data Prob a Source

A probability distribution defined over elements of type a. All elements not included in the map have probability equal to 0.

Instances

Eq a => Eq (Prob a) 
Ord a => Ord (Prob a) 
Show a => Show (Prob a) 

mkProb :: Ord a => [(a, Double)] -> Prob a Source

Construct the probability distribution.

type WordL a b = (Word a b, Prob [b]) Source

A WordL is a labeled word, i.e. a word with probability distribution defined over labels. We assume that every label from the distribution domain is a member of the set of potential labels corresponding to the word. TODO: Ensure the assumption using the smart constructor.

type SentL a b = [WordL a b] Source

A sentence of labeled words.