Safe Haskell	Safe
Language	Haskell98

Data.CRF.Chain1.Constrained.Dataset.External

Synopsis

data Word a b = Word {
- obs :: Set a
- lbs :: Set b
}
unknown :: Word a b -> Bool
type Sent a b = [Word a b]
data Prob a
mkProb :: Ord a => [(a, Double)] -> Prob a
data WordL a b
mkWordL :: Ord b => Word a b -> Prob b -> WordL a b
type SentL a b = [WordL a b]

Documentation

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.

Constructors

Word
Fields obs :: Set a The set of observations lbs :: Set b The set of potential interpretations.

Instances

(Eq a, Eq b) => Eq (Word a b) Source #
Instance details Defined in Data.CRF.Chain1.Constrained.Dataset.External Methods (==) :: Word a b -> Word a b -> Bool # (/=) :: Word a b -> Word a b -> Bool #
(Ord a, Ord b) => Ord (Word a b) Source #
Instance details Defined in Data.CRF.Chain1.Constrained.Dataset.External Methods compare :: Word a b -> Word a b -> Ordering # (<) :: Word a b -> Word a b -> Bool # (<=) :: Word a b -> Word a b -> Bool # (>) :: Word a b -> Word a b -> Bool # (>=) :: Word a b -> Word a b -> Bool # max :: Word a b -> Word a b -> Word a b # min :: Word a b -> Word a b -> Word a b #
(Show a, Show b) => Show (Word a b) Source #
Instance details Defined in Data.CRF.Chain1.Constrained.Dataset.External Methods showsPrec :: Int -> Word a b -> ShowS # show :: Word a b -> String # showList :: [Word a b] -> ShowS #

unknown :: Word a b -> Bool Source #

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 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) Source #
Instance details Defined in Data.CRF.Chain1.Constrained.Dataset.External Methods (==) :: Prob a -> Prob a -> Bool # (/=) :: Prob a -> Prob a -> Bool #
Ord a => Ord (Prob a) Source #
Instance details Defined in Data.CRF.Chain1.Constrained.Dataset.External Methods compare :: Prob a -> Prob a -> Ordering # (<) :: Prob a -> Prob a -> Bool # (<=) :: Prob a -> Prob a -> Bool # (>) :: Prob a -> Prob a -> Bool # (>=) :: Prob a -> Prob a -> Bool # max :: Prob a -> Prob a -> Prob a # min :: Prob a -> Prob a -> Prob a #
Show a => Show (Prob a) Source #
Instance details Defined in Data.CRF.Chain1.Constrained.Dataset.External Methods showsPrec :: Int -> Prob a -> ShowS # show :: Prob a -> String # showList :: [Prob a] -> ShowS #

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

data WordL a 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. Use the mkWordL smart constructor to build WordL.

mkWordL :: Ord b => Word a b -> Prob b -> WordL a b Source #

Ensure, that every label from the distribution domain is a member of the set of potential labels corresponding to the word.

type SentL a b = [WordL a b] Source #

A sentence of labeled words.