| libGenI-0.16.1: A natural language generator (specifically, an FB-LTAG surface realiser) | Contents | Index |
|
|
|
|
Synopsis |
|
|
|
Documentation |
|
type Tags = Map String [TagElem] |
|
data TagElem |
Constructors | | Instances | |
|
|
class TagItem t where |
| Methods | | | Instances | |
|
|
data TagSite |
Constructors | | 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 |