Package | Description |
---|---|
de.up.ling.irtg.automata |
Classes for tree automata of various types.
|
Modifier and Type | Class and Description |
---|---|
class |
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.
|
Modifier and Type | Method and Description |
---|---|
static IntersectionAutomaton |
IntersectionAutomaton.intersectBottomUpNaive(TreeAutomaton lhs,
TreeAutomaton rhs)
Helper method which creates an intersection automaton and
makes all rules explicit with the default algorithm.
|
static IntersectionAutomaton |
IntersectionAutomaton.intersectTopDownBottomUpCKY(TreeAutomaton lhs,
TreeAutomaton rhs)
Helper method which creates an intersection automaton and
makes all rules explicit with the CKY algorithm.
|
Modifier and Type | Method and Description |
---|---|
double |
EdgeEvaluator.evaluate(int outputState,
IntersectionAutomaton auto)
This method is called each time the intersection algorithm
discovers a new state to put on the agenda.
|
Copyright © 2017. All rights reserved.