Safe Haskell | None |
---|---|
Language | Haskell98 |
Feature extraction module for DAG-aware CRFs.
Synopsis
- data Feat
- presentFeats :: DAG a (X, Y) -> [(Feat, LogFloat)]
- data EdgeIx = EdgeIx {}
- hiddenFeats :: DAG a X -> [Feat]
- obFeatsOn :: DAG a X -> EdgeIx -> [Feat]
- trFeatsOn :: DAG a X -> Maybe EdgeIx -> Maybe EdgeIx -> Maybe EdgeIx -> [Feat]
- type FeatSel a = DAG a (X, Y) -> [Feat]
- selectPresent :: FeatSel a
- selectHidden :: FeatSel a
- lbNum :: DAG a X -> EdgeID -> Int
- lbIxs :: DAG a X -> EdgeID -> [CbIx]
- edgeIxs :: DAG a X -> EdgeID -> [EdgeIx]
- prevEdgeIxs :: DAG a X -> Maybe EdgeID -> [Maybe EdgeIx]
- nextEdgeIxs :: DAG a X -> Maybe EdgeID -> [Maybe EdgeIx]
- initialEdgeIxs :: DAG a X -> [EdgeIx]
- finalEdgeIxs :: DAG a X -> [EdgeIx]
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. |
Featre extraction
Present features
presentFeats :: DAG a (X, Y) -> [(Feat, LogFloat)] Source #
Present Feat
ures of all kinds occurring in the given DAG.
Hidden features
Edge with the corresponding label index.
obFeatsOn :: DAG a X -> EdgeIx -> [Feat] Source #
Observation features on a given position and with respect to a given label (determined by index).
:: DAG a X | |
-> Maybe EdgeIx | Current EdgeIx |
-> Maybe EdgeIx | Previous EdgeIx |
-> Maybe EdgeIx | One before the previous EdgeIx |
-> [Feat] |
Transition features on a given position and with respect to given labels (determined by indexes).
Feature selection
selectPresent :: FeatSel a Source #
The presentFeats
adapted to fit feature selection specs.
selectHidden :: FeatSel a Source #
The hiddenFeats
adapted to fit feature selection specs.
Indexing
lbNum :: DAG a X -> EdgeID -> Int Source #
Number of potential labels at the given position of the sentence.
edgeIxs :: DAG a X -> EdgeID -> [EdgeIx] Source #
The list of EdgeIx's corresponding to the given edge.
nextEdgeIxs :: DAG a X -> Maybe EdgeID -> [Maybe EdgeIx] Source #
Similar to prevEdgeIxs
but returns the succeeding edges.