|
|
|
|
| Synopsis |
|
| data GNode = GN {} | | | | | type NodeName = String | | | data Ttree a = TT {} | | | type MTtree = Ttree GNode | | | type SemPols = [Int] | | | data TestCase = TestCase {} | | | | | type Pred = (GeniVal, GeniVal, [GeniVal]) | | | type Flist = [AvPair] | | | data AvPair = AvPair {} | | | | | type Lexicon = Map String [ILexEntry] | | | data ILexEntry = ILE {} | | | type MorphLexEntry = (String, String, Flist) | | | type Macros = [MTtree] | | | type Sem = [Pred] | | | type LitConstr = (Pred, [String]) | | | type SemInput = (Sem, Flist, [LitConstr]) | | | type Subst = Map String GeniVal | | | emptyLE :: ILexEntry | | | emptyGNode :: GNode | | | emptyMacro :: MTtree | | | gCategory :: Flist -> Maybe GeniVal | | | showLexeme :: [String] -> String | | | lexemeAttributes :: [String] | | | gnnameIs :: NodeName -> GNode -> Bool | | | plugTree :: Tree NodeName -> NodeName -> Tree NodeName -> Tree NodeName | | | spliceTree :: NodeName -> Tree NodeName -> NodeName -> Tree NodeName -> Tree NodeName | | | root :: Tree a -> a | | | rootUpd :: Tree a -> a -> Tree a | | | foot :: Tree GNode -> GNode | | | setLexeme :: [String] -> Tree GNode -> Tree GNode | | | setAnchor :: [String] -> Tree GNode -> Tree GNode | | | toKeys :: Sem -> [String] | | | subsumeSem :: Sem -> Sem -> [(Sem, Subst)] | | | sortSem :: Sem -> Sem | | | showSem :: Sem -> String | | | showPred :: Pred -> String | | | emptyPred :: Pred | | | sortFlist :: Flist -> Flist | | | unify :: Monad m => [GeniVal] -> [GeniVal] -> m ([GeniVal], Subst) | | | unifyFeat :: Monad m => Flist -> Flist -> m (Flist, Subst) | | | mergeSubst :: Subst -> Subst -> Subst | | | showFlist :: Flist -> String | | | showPairs :: Flist -> String | | | showAv :: AvPair -> String | | | replace :: DescendGeniVal a => Subst -> a -> a | | | class DescendGeniVal a where | | | | replaceList :: DescendGeniVal a => [(String, GeniVal)] -> a -> a | | | class Collectable a where | | | | class Idable a where | | | | alphaConvert :: (Collectable a, DescendGeniVal a) => String -> a -> a | | | alphaConvertById :: (Collectable a, DescendGeniVal a, Idable a) => a -> a | | | fromGConst :: GeniVal -> [String] | | | fromGVar :: GeniVal -> String | | | isConst :: GeniVal -> Bool | | | isVar :: GeniVal -> Bool | | | isAnon :: GeniVal -> Bool |
|
|
| Documentation |
|
|
| A single node of a TAG tree.
| | Constructors | | GN | | | gnname :: NodeName | | | gup :: Flist | top feature structure
| | gdown :: Flist | bottom feature structure
| | ganchor :: Bool | False for na nodes
| | glexeme :: [String] | [] for na nodes
| | gtype :: GType | | | gaconstr :: Bool | | | gorigin :: String | for TAG, this would be the elementary tree
that this node originally came from
|
|
|  Instances | |
|
|
|
| Constructors | | | Instances | |
|
|
|
|
|
| Constructors | | | Instances | |
|
|
|
|
|
|
|
| Constructors | | | Instances | |
|
|
|
| Constructors | | Initial | | | Auxiliar | | | Unspecified | |
| | Instances | |
|
|
|
|
|
|
|
| Constructors | | | Instances | |
|
|
|
| Constructors | | GConst [String] | atomic disjunction - constant x | y | z
| | GVar String | variable
| | GAnon | anonymous
|
| | Instances | |
|
|
|
| A lexicon maps semantic predicates to lexical entries.
|
|
|
| Constructors | | | Instances | |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| A null GNode which you can use for various debugging or display purposes.
|
|
|
| A null tree which you can use for various debugging or display purposes.
|
|
|
| Return the value of the cat attribute, if available
|
|
|
|
|
| Attributes recognised as lexemes, in order of preference
|
|
|
|
|
| Plug the first tree into the second tree at the specified node.
Anything below the second node is silently discarded.
We assume the trees are pluggable; it is treated as a bug if
they are not!
|
|
|
|
|
|
|
|
|
|
|
|
| Given a lexical item l and a tree node n (actually a subtree
with no children), return the same node with the lexical item as
its unique child. The idea is that it converts terminal lexeme nodes
into preterminal nodes where the actual terminal is the given lexical
item
|
|
|
| Given a lexical item s and a Tree GNode t, returns the tree t'
where l has been assigned to the anchor node in t'
|
|
|
| Given a Semantics, return the string with the proper keys
(propsymbol+arity) to access the agenda
|
|
|
|
|
| Sort semantics first according to its predicate, and then to its handles.
|
|
|
|
|
|
|
|
|
| Sort an Flist according with its attributes
|
|
|
| unify performs unification on two lists of GeniVal. If
unification succeeds, it returns Just (r,s) where verb!r! is
the result of unification and verb!s! is a list of substitutions that
this unification results in.
|
|
|
unifyFeat performs feature structure unification, under the
these assumptions about the input:
- Features are ordered
- The Flists do not share variables (renaming has already
been done.
The features are allowed to have different sets of attributes,
beacuse we use alignFeat to realign them.
|
|
|
Note that the first Subst is assumed to come chronologically
before the second one; so merging { X -> Y } and { Y -> 3 }
should give us { X -> 3; Y -> 3 };
See prependToSubst for a warning!
|
|
|
|
|
|
|
|
|
|
| class DescendGeniVal a where | Source |
|
| | Methods | | | | Instances | |
|
|
|
| Here it is safe to say (X -> Y; Y -> Z) because this would be crushed
down into a final value of (X -> Z; Y -> Z)
|
|
| class Collectable a where | Source |
|
| | Methods | | | | Instances | |
|
|
|
| An Idable is something that can be mapped to a unique id.
You might consider using this to implement Ord, but I won't.
Note that the only use I have for this so far (20 dec 2005)
is in alpha-conversion.
| | | Methods | | | | Instances | |
|
|
|
|
|
|
|
| (assumes that it's a GConst!)
|
|
|
| (assumes that it's a GVar!)
|
|
|
|
|
|
|
|
| Produced by Haddock version 2.6.0 |
