libGenI-0.16.1: A natural language generator (specifically, an FB-LTAG surface realiser)ContentsIndex
NLP.GenI.Tags
Synopsis
type Tags = Map String [TagElem]
data TagElem = TE {
idname :: String
ttreename :: String
tidnum :: Integer
ttype :: !Ptype
ttree :: Tree GNode
tsemantics :: Sem
tpolarities :: Map String (Int, Int)
tinterface :: Flist
ttrace :: [String]
tsempols :: [SemPols]
}
class TagItem t where
tgIdName :: t -> String
tgIdNum :: t -> Integer
tgSemantics :: t -> Sem
data TagSite = TagSite {
tsName :: !String
tsUp :: !Flist
tsDown :: !Flist
tsOrigin :: !String
}
type TagDerivation = [(Char, String, (String, String))]
emptyTE :: TagElem
ts_synIncomplete :: String
ts_semIncomplete :: [Pred] -> String
ts_tbUnificationFailure :: String
ts_rootFeatureMismatch :: Flist -> String
addToTags :: Tags -> String -> TagElem -> Tags
tagLeaves :: TagElem -> [(String, UninflectedDisjunction)]
setTidnums :: [TagElem] -> [TagElem]
mapBySem :: TagItem t => [t] -> Map Pred [t]
drawTagTrees :: [TagElem] -> String
subsumedBy :: Sem -> Pred -> Bool
showTagSites :: [TagSite] -> String
collect :: Collectable a => a -> Set String -> Set String
detectSites :: Tree GNode -> ([TagSite], [TagSite], [TagSite])
Documentation
type Tags = Map String [TagElem]
data TagElem
Constructors
TE
idname :: String
ttreename :: String
tidnum :: Integer
ttype :: !Ptype
ttree :: Tree GNode
tsemantics :: Sem
tpolarities :: Map String (Int, Int)
tinterface :: Flist
ttrace :: [String]
tsempols :: [SemPols]
show/hide Instances
class TagItem t where
Methods
tgIdName :: t -> String
tgIdNum :: t -> Integer
tgSemantics :: t -> Sem
show/hide Instances
data TagSite
Constructors
TagSite
tsName :: !String
tsUp :: !Flist
tsDown :: !Flist
tsOrigin :: !String
show/hide Instances
type TagDerivation = [(Char, String, (String, String))]
emptyTE :: TagElem
ts_synIncomplete :: String
ts_semIncomplete :: [Pred] -> String
ts_tbUnificationFailure :: String
ts_rootFeatureMismatch :: Flist -> String
addToTags :: Tags -> String -> TagElem -> Tags
tagLeaves :: TagElem -> [(String, UninflectedDisjunction)]
setTidnums :: [TagElem] -> [TagElem]
Assigns a unique id to each element of this list, that is, an integer between 1 and the size of the list.
mapBySem :: TagItem t => [t] -> Map Pred [t]
drawTagTrees :: [TagElem] -> String
subsumedBy :: Sem -> Pred -> Bool
showTagSites :: [TagSite] -> String
collect :: Collectable a => a -> Set String -> Set String
detectSites :: Tree GNode -> ([TagSite], [TagSite], [TagSite])
Given a tree(GNode) returns a list of substitution or adjunction nodes, as well as remaining nodes with a null adjunction constraint.
Produced by Haddock version 2.1.0