| Interface | Description |
|---|---|
| EdgeEvaluator |
This class is used to predict the outside score of a state.
|
| Intersectable<State> |
Dummy interface that both TreeAutomaton and SiblingFinderInvhom implement.
|
| IntersectionAutomaton.StateDiscoveryListener |
Defines an interface which accepts newly discovered states during
the intersection construction.
|
| IntTrie.EntryVisitor<E> |
This defines an interface for a class which consumes keys stored in the
trie together with the value they are associated with.
|
| RuleEvaluator<E> | |
| RuleEvaluatorTopDown<E> | |
| TreeAutomaton.BottomUpStateVisitor |
| Class | Description |
|---|---|
| BestFirstIntersectionAutomaton<LeftState,RightState> |
An intersection automaton for viterbi search that constructs transitions bottom up
when makeAllRulesExplicit is called, according to
a queue and stops construction once a complete tree can be derived.
|
| ConcreteTreeAutomaton<State> |
An automaton which can be constructed by explicitly adding rules, and which
stores these rules explicitly in memory.
|
| Determinizer<State> |
This class constructs a bottom-up deterministic automaton from a given
tree automaton, each instance is only applicable for a single automaton.
|
| IntersectionAutomaton<LeftState,RightState> |
This class is used to represent the intersection of two tree automata.
|
| IntTrie<E> |
This is a trie data structure used to map sequences of integers to a value.
|
| InverseHomAutomaton<State> | |
| LeafToStateSubstitution<State,Label> | |
| NondeletingInverseHomAutomaton<State> |
A tree automaton that describes the homomorphic pre-image of the language of
another tree automaton.
|
| Rule |
A rule in a tree automaton.
|
| SingletonAutomaton |
A tree automaton that accepts a single, given tree.
|
| SkipFailRulesFilter | |
| TreeAutomaton<State> |
A finite tree automaton.
|
| UniversalAutomaton |
A tree automaton that accepts all terms over the given signature.
|
| WeightedTree |
A tree with a weight.
|
Copyright © 2017. All rights reserved.