| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
NLP.GenI.Lexicon.Internal
Description
Internals of lexical entry manipulation
- type Lexicon = [LexEntry]
- data LexEntry = LexEntry {}
- mkLexEntry :: FullList Text -> Text -> [GeniVal] -> Flist GeniVal -> Flist GeniVal -> Flist GeniVal -> Sem -> LexEntry
- mkFullLexEntry :: FullList Text -> Text -> [GeniVal] -> Flist GeniVal -> Flist GeniVal -> Flist GeniVal -> Sem -> [SemPols] -> LexEntry
- type PolValue = (GeniVal, Int)
- fromLexSem :: [Literal PolValue] -> (Sem, [SemPols])
- fromLexLiteral :: Literal PolValue -> (Literal GeniVal, SemPols)
Documentation
Lexical entry
Constructors
| LexEntry | |
Fields
| |
Arguments
| :: FullList Text | word |
| -> Text | family name |
| -> [GeniVal] | parameters list (deprecated) |
| -> Flist GeniVal | interface (use instead of params) |
| -> Flist GeniVal | filters |
| -> Flist GeniVal | equations |
| -> Sem | semantics |
| -> LexEntry |
See also mkFullLexEntry
This version comes with some sensible defaults.
Arguments
| :: FullList Text | word |
| -> Text | family name |
| -> [GeniVal] | parameters list (deprecated) |
| -> Flist GeniVal | interface (use instead of params) |
| -> Flist GeniVal | filters |
| -> Flist GeniVal | equations |
| -> Sem | semantics |
| -> [SemPols] | semantic polarities |
| -> LexEntry |
Variant of mkLexEntry but with more control
type PolValue = (GeniVal, Int) Source #
An annotated GeniVal. This is for a rather old, obscure variant on the polarity filtering optimisation. To account for zero literal semantics, we annotate each value in the semantics with a positive/negative marker. These markers are then counted up to determine with we need to insert more literals into the semantics or not. See the manual on polarity filtering for more details