Safe Haskell | None |
---|---|
Language | Haskell98 |
Documentation
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.
A probability distribution defined over elements of type a. All elements not included in the map have probability equal to 0.
A word consists of a set of observations and a set of potential labels.
mkWord :: Set a -> Set [b] -> Word a b Source #
A word constructor which checks non-emptiness of the potential set of labels.
mkProb :: Ord a => [(a, Double)] -> Prob a Source #
Construct the probability distribution.
Normalization is not performed because, when working with DAGs, the probability of a specific DAG edge can be lower than 1 (in particular, it can be 0).
Elements with probability 0 cab be filtered out since information that a
given label is a potential interpretation of the given word/edge is preserved
at the level of the Word