Safe Haskell | None |
---|

- newtype Ob = Ob {}
- newtype Lb = Lb {}
- data X
- mkX :: [Ob] -> [Lb] -> X
- unX :: X -> [Ob]
- unR :: AVec Lb -> X -> [Lb]
- type Xs = Vector X
- newtype Y = Y {}
- mkY :: [(Lb, Double)] -> Y
- unY :: Y -> [(Lb, Double)]
- type Ys = Vector Y
- data AVec a
- fromList :: (Ord a, Unbox a) => [a] -> AVec a
- fromSet :: (Ord a, Unbox a) => Set a -> AVec a

# Documentation

An observation.

A label.

A word represented by a list of its observations and a list of its potential label interpretations.

Probability distribution over labels. We assume, that when y is
a member of chosen labels list it is also a member of the list
potential labels for corresponding `X`

word.
TODO: Perhaps we should substitute `Lb`

s with label indices
corresponding to labels from the vector of potential labels?
FIXME: The type definition is incorrect (see `fromList`

definition),
it should be something like AVec2.

Ascending vector of unique interger elements.