|
|
|
|
|
|
Synopsis |
|
|
|
Documentation |
|
data Builder st it pa |
|
|
type Output = (UninflectedSentence, Derivation) |
|
type Derivation = TagDerivation |
|
data Input |
|
|
type UninflectedWord = (String, Flist) |
|
type UninflectedSentence = [UninflectedWord] |
|
type UninflectedDisjunction = ([String], Flist) |
|
type SentenceAut = NFA Int UninflectedWord |
|
type BuilderState s a = StateT s (State Statistics) a |
|
preInit :: Input -> Params -> (Input, (Int, Int, Int), PolResult) |
|
unlessEmptySem :: Input -> Params -> a -> a |
Equivalent to id unless the input contains an empty or uninstatiated
semantics
|
|
run :: Builder st it Params -> Input -> Params -> (st, Statistics) |
Performs surface realisation from an input semantics and a lexical selection.
|
|
type SemBitMap = Map Pred BitVector |
|
defineSemanticBits :: Sem -> SemBitMap |
assign a bit vector value to each literal in the semantics
the resulting map can then be used to construct a bit vector
representation of the semantics
|
|
semToBitVector :: SemBitMap -> Sem -> BitVector |
|
bitVectorToSem :: SemBitMap -> BitVector -> Sem |
|
type IafMap = Map String Sem |
|
dependentSem :: IafMap -> String -> Sem |
Return the literals of the semantics (in bit vector form)
whose accesibility depends on the given index
|
|
literalArgs :: Pred -> [GeniVal] |
Return the handle and arguments of a literal
|
|
semToIafMap :: Sem -> IafMap |
|
fromUniConst :: Monad m => GeniVal -> m String |
Like fromGConst but only for the non-disjoint ones: meant to be used as Maybe or List
|
|
getIdx :: Flist -> [GeniVal] |
|
ts_iafFailure :: [String] -> [Pred] -> String |
|
recalculateAccesibility :: IafAble a => a -> a |
Calculate the new set of accessibilityinaccesible indices, returning a
a tuple of accesible inaccesible indices
|
|
iafBadSem |
|
|
class IafAble a where |
| Methods | | | Instances | |
|
|
defaultStepAll :: Builder st it pa -> BuilderState st () |
Default implementation for the stepAll function in Builder
|
|
type DispatchFilter s a = a -> s (Maybe a) |
|
(>-->) :: Monad s => DispatchFilter s a -> DispatchFilter s a -> DispatchFilter s a |
Sequence two dispatch filters.
|
|
nullFilter :: Monad s => DispatchFilter s a |
A filter that always fails (i.e. no filtering)
|
|
condFilter :: Monad s => (a -> Bool) -> DispatchFilter s a -> DispatchFilter s a -> DispatchFilter s a |
If the item meets some condition, use the first filter, otherwise
use the second one.
|
|
addCounters :: Statistics -> Statistics -> Statistics |
|
modifyStats :: (Metric -> Metric) -> BuilderState st () |
|
incrCounter :: String -> Int -> BuilderState st () |
|
queryCounter :: String -> Statistics -> Maybe Int |
|
initStats :: Params -> Statistics |
|
namedMetric :: String -> Metric |
|
defaultMetricNames :: [String] |
|
num_iterations :: String |
|
chart_size :: String |
|
num_comparisons :: String |
|
nullBuilder :: Builder () (NullState ()) Params |
|
type NullState a = BuilderState () a |
|
initNullBuilder :: Input -> Params -> ((), Statistics) |
|
Produced by Haddock version 0.8 |