Safe Haskell | None |
---|---|
Language | Haskell98 |
Internal core data types.
Synopsis
- newtype Ob = Ob {}
- mkOb :: Int -> Ob
- unOb :: Ob -> Int
- newtype Lb = Lb {}
- mkLb :: Int -> Lb
- unLb :: Lb -> Int
- newtype FeatIx = FeatIx {}
- mkFeatIx :: Int -> FeatIx
- unFeatIx :: FeatIx -> Int
- type CbIx = Int
- newtype Cb = Cb {}
- mkCb :: [Lb] -> Cb
- unCb :: Cb -> [Lb]
- data X
- mkX :: [Ob] -> [Cb] -> X
- unX :: X -> [Ob]
- unR :: X -> [Cb]
- lbAt :: X -> CbIx -> Cb
- data Y
- mkY :: [(Cb, Double)] -> Y
- unY :: Y -> [(Cb, LogFloat)]
- data Feat
- obFeats :: Ob -> Cb -> [Feat]
- trFeats1 :: Cb -> [Feat]
- trFeats2 :: Cb -> Cb -> [Feat]
- trFeats3 :: Cb -> Cb -> Cb -> [Feat]
Basic types
An observation.
Instances
An atomic label.
Instances
A feature index. To every model feature a unique index is assigned.
Instances
Complex label
A complex label is a vector of atomic labels.
Input element (word)
A word is represented by a list of its observations and a list of its potential label interpretations.
Indexing
Output element (choice)
Vector of chosen labels together with corresponding probabilities in log domain.
Feature
Feature; every feature is associated to a layer with ln
identifier.
TFeat3 | Second-order transition feature. |
TFeat2 | First-order transition feature. |
TFeat1 | Zero-order transition feature. |
OFeat | Observation feature. |