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

Safe HaskellSafe-Inferred




data Word a b Source

A Word is represented by a set of observations and a set of potential interpretation labels. When the set of potential labels is empty the word is considered to be unknown and the default potential set is used in its place.




obs :: Set a

The set of observations

lbs :: Set b

The set of potential interpretations.


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

unknown :: Word a b -> BoolSource

The word is considered to be unknown when the set of potential labels is empty.

type Sent a b = [Word a b]Source

A sentence of words.

data Dist a Source

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

mkDist :: Ord a => [(a, Double)] -> Dist aSource

Construct the probability distribution.

type WordL a b = (Word a b, Dist 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.

annotate :: Ord b => Word a b -> b -> WordL a bSource

Annotate the word with the label.

type SentL a b = [WordL a b]Source

A sentence of labeled words.