Package | Description |
---|---|
de.up.ling.irtg.automata |
Classes for tree automata of various types.
|
de.up.ling.irtg.automata.coarse_to_fine |
Classes used to implement coarse-to-fine parsing.
|
de.up.ling.irtg.binarization |
Classes for binarizing IRTGs.
|
de.up.ling.irtg.codec |
Classes for reading and writing IRTGs, tree automata,
and other objects.
|
de.up.ling.irtg.siblingfinder |
This contains class for sibling finder based intersection, which is used to
speed up intersection.
|
Modifier and Type | Method and Description |
---|---|
ConcreteTreeAutomaton<State> |
TreeAutomaton.asConcreteTreeAutomaton()
Computes a concrete representation of this automaton.
|
ConcreteTreeAutomaton |
TreeAutomaton.asConcreteTreeAutomatonBottomUp()
Computes a concrete representation of this automaton.
|
ConcreteTreeAutomaton<String> |
TreeAutomaton.asConcreteTreeAutomatonWithStringStates()
Computes a concrete representation of this automaton, with string states.
|
Modifier and Type | Method and Description |
---|---|
ConcreteTreeAutomaton |
SiblingFinderCoarserstParser.parse(List<RuleRefinementNode> coarseNodes,
List<Rule> partnerInvhomRules)
Note: returns the invhom automaton for future reference.
|
Modifier and Type | Class and Description |
---|---|
static class |
StringAlgebraSeed.OneSymbolAutomaton |
Modifier and Type | Method and Description |
---|---|
List<String> |
CodecUtilities.introduceAnonymousStates(ConcreteTreeAutomaton<String> auto,
List<String> children,
Set<String> states)
Normalizes a list of strings by introducing new anonymous states
where necessary.
|
Modifier and Type | Method and Description |
---|---|
static ConcreteTreeAutomaton |
SiblingFinderIntersection.makeVeryLazyExplicit(SiblingFinderIntersection veryLazyAuto) |
ConcreteTreeAutomaton<State> |
SiblingFinderInvhom.seenRulesAsAutomaton() |
ConcreteTreeAutomaton<Pair<LeftState,RightState>> |
SiblingFinderIntersection.seenRulesAsAutomaton() |
Copyright © 2017. All rights reserved.