Package | Description |
---|---|
de.up.ling.irtg |
This package contains the core classes for Alto, which represent Interpreted
Regular tree grammars.
|
de.up.ling.irtg.algebra |
Classes representing a number of useful algebras.
|
de.up.ling.irtg.algebra.graph |
The algebra of s-graphs, together with supporting classes.
|
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.automata.condensed |
Classes for "condensed" tree automata.
|
de.up.ling.irtg.automata.index |
Index data structures for tree automata.
|
de.up.ling.irtg.automata.language_iteration |
This package implements Alto's functionality for iterating over the
language of a tree automaton in best first order.
|
de.up.ling.irtg.automata.pruning |
This package implements beam search in the construction of a parse chart.
|
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.corpus |
Classes for working with corpora.
|
de.up.ling.irtg.gui |
A graphical user interface (GUI) for Alto.
|
de.up.ling.irtg.maxent |
Classes for working with maximum-entropy IRTGs.
|
de.up.ling.irtg.random_automata |
This package contains code to generate random tree automata for evaluation
purposes.
|
de.up.ling.irtg.sampling |
This package contains tools to implement approximate inference via sampling.
|
de.up.ling.irtg.sampling.rule_weighting |
This package contains automata with adaptable sampling heuristics.
|
de.up.ling.irtg.script |
Various useful scripts.
|
de.up.ling.irtg.semiring |
A number of semirings used in computation over tree automata.
|
de.up.ling.irtg.siblingfinder |
This contains class for sibling finder based intersection, which is used to
speed up intersection.
|
de.up.ling.irtg.util |
Various utilities.
|
Class and Description |
---|
Intersectable
Dummy interface that both TreeAutomaton and SiblingFinderInvhom implement.
|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
Intersectable
Dummy interface that both TreeAutomaton and SiblingFinderInvhom implement.
|
Rule
A rule in a tree automaton.
|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
Intersectable
Dummy interface that both TreeAutomaton and SiblingFinderInvhom implement.
|
Rule
A rule in a tree automaton.
|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
ConcreteTreeAutomaton
An automaton which can be constructed by explicitly adding rules, and which
stores these rules explicitly in memory.
|
EdgeEvaluator
This class is used to predict the outside score of a state.
|
Intersectable
Dummy interface that both TreeAutomaton and SiblingFinderInvhom implement.
|
IntersectionAutomaton
This class is used to represent the intersection of two tree automata.
|
IntersectionAutomaton.StateDiscoveryListener
Defines an interface which accepts newly discovered states during
the intersection construction.
|
IntTrie
This is a trie data structure used to map sequences of integers to a value.
|
IntTrie.EntryVisitor
This defines an interface for a class which consumes keys stored in the
trie together with the value they are associated with.
|
Rule
A rule in a tree automaton.
|
RuleEvaluator |
RuleEvaluatorTopDown |
TreeAutomaton
A finite tree automaton.
|
TreeAutomaton.BottomUpStateVisitor |
WeightedTree
A tree with a weight.
|
Class and Description |
---|
ConcreteTreeAutomaton
An automaton which can be constructed by explicitly adding rules, and which
stores these rules explicitly in memory.
|
IntTrie
This is a trie data structure used to map sequences of integers to a value.
|
Rule
A rule in a tree automaton.
|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
Intersectable
Dummy interface that both TreeAutomaton and SiblingFinderInvhom implement.
|
Rule
A rule in a tree automaton.
|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
Rule
A rule in a tree automaton.
|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
Rule
A rule in a tree automaton.
|
TreeAutomaton
A finite tree automaton.
|
WeightedTree
A tree with a weight.
|
Class and Description |
---|
Rule
A rule in a tree automaton.
|
Class and Description |
---|
ConcreteTreeAutomaton
An automaton which can be constructed by explicitly adding rules, and which
stores these rules explicitly in memory.
|
Intersectable
Dummy interface that both TreeAutomaton and SiblingFinderInvhom implement.
|
Rule
A rule in a tree automaton.
|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
ConcreteTreeAutomaton
An automaton which can be constructed by explicitly adding rules, and which
stores these rules explicitly in memory.
|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
Rule
A rule in a tree automaton.
|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
Rule
A rule in a tree automaton.
|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
Rule
A rule in a tree automaton.
|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
Rule
A rule in a tree automaton.
|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
Rule
A rule in a tree automaton.
|
Class and Description |
---|
ConcreteTreeAutomaton
An automaton which can be constructed by explicitly adding rules, and which
stores these rules explicitly in memory.
|
Intersectable
Dummy interface that both TreeAutomaton and SiblingFinderInvhom implement.
|
Rule
A rule in a tree automaton.
|
TreeAutomaton
A finite tree automaton.
|
Class and Description |
---|
Rule
A rule in a tree automaton.
|
TreeAutomaton
A finite tree automaton.
|
Copyright © 2017. All rights reserved.