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.pruning |
This package implements beam search in the construction of a parse chart.
|
de.up.ling.irtg.hom |
Classes for working with tree homomorphisms.
|
de.up.ling.irtg.laboratory |
This package contains the core classes used to run Alto Lab tasks.
|
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 |
---|---|
TreeAutomaton |
Interpretation.basicNonDelInvHom(TreeAutomaton auto)
This returns an inverse homomorphism automaton with the added assumption
that the underlying homomorphism is non-deleting.
|
InterpretedTreeAutomaton |
InterpretedTreeAutomaton.filterBinarizedForAppearingConstants(String interpName,
Object input)
Creates a new IRTG with many of the rules filtered out.
|
InterpretedTreeAutomaton |
InterpretedTreeAutomaton.filterForAppearingConstants(String interpName,
Object input)
Creates a new IRTG with many of the rules filtered out.
|
static InterpretedTreeAutomaton |
InterpretedTreeAutomaton.fromPath(String path)
Helper method that creates a stream from the given path and reads it as with
read from an IRTG input codec. |
static InterpretedTreeAutomaton |
InterpretedTreeAutomaton.fromString(String s)
Helper method that reads an IRTG from a string as with
read
from an IRTG input codec. |
Algebra<E> |
Interpretation.getAlgebra()
Obtains the algebra used by the interpretation.
|
TreeAutomaton<String> |
InterpretedTreeAutomaton.getAutomaton()
Returns the derivation tree automaton.
|
Homomorphism |
Interpretation.getHomomorphism()
Obtains the homomorphism used by the interpretation.
|
Interpretation |
InterpretedTreeAutomaton.getInterpretation(String interp)
Returns the interpretation with the given name.
|
E |
Interpretation.interpret(Tree<String> t)
Applies the homomorphism to the derivation tree "t" and evaluates it in
the algebra.
|
Intersectable |
Interpretation.invhom(TreeAutomaton auto)
Returns the image under inverse homomorphism of the given automaton.
|
TreeAutomaton |
InterpretedTreeAutomaton.parseSimple(String interpretationName,
Object input)
Parses a single input representations to a parse chart without using any optimization in the parsing process.
|
TreeAutomaton |
InterpretedTreeAutomaton.parseWithSiblingFinder(String interpretationName,
Object input)
Parses a single input representations to a parse chart without using a sibling finder in the intersection.
|
Modifier and Type | Method and Description |
---|---|
static int |
TreeAlgebra.countBrackets(Tree<String> tree)
Counts the number of nodes in a tree - minus the number of the leaf nodes.
|
TreeAutomaton |
Algebra.decompose(E value)
Computes a decomposition automaton for the given value.
|
E |
Algebra.evaluate(Tree<String> t)
Evaluates a term over the algebra's signature into an algebra object.
|
static int |
StringAlgebra.getMaxChartSize(int sentenceLength) |
static int |
TagStringAlgebra.getMaxChartSize(Object sentenceLength) |
static int |
StringAlgebra.getSentenceLength(List<String> sentence) |
static int |
TagStringAlgebra.getSentenceLength(Pair<List<String>,List<String>> sentence) |
static double |
TreeAlgebra.precision(Tree<String> result,
Tree<String> gold)
Computes the standard precision measure for two trees.
|
static double |
TreeAlgebra.recall(Tree<String> result,
Tree<String> gold)
Computes the standard recall measure for two trees.
|
Modifier and Type | Method and Description |
---|---|
TreeAutomaton |
GraphAlgebra.decomposeTopDown(SGraph value) |
int |
SGraph.nodeCount() |
static double |
GraphAlgebra.smatch(Object[] graphs,
Object[] gold)
Computes the smatch score of the two given arrays of graphs.
|
static double |
GraphAlgebra.smatch(SGraph graph,
SGraph gold)
Computes the smatch score of the two given graphs.
|
Modifier and Type | Method and Description |
---|---|
long |
TreeAutomaton.getNumberOfRules()
Returns the number of rules in this automaton.
|
int |
TreeAutomaton.getNumberOfSeenStates() |
double |
TreeAutomaton.getWeight(Tree<String> tree)
Computes the weight of the tree, given the (weighted) tree automaton.
|
<OtherState> |
TreeAutomaton.intersect(Intersectable<OtherState> other)
Intersects this automaton with another one.
|
static IntersectionAutomaton |
IntersectionAutomaton.intersectBottomUpNaive(TreeAutomaton lhs,
TreeAutomaton rhs)
Helper method which creates an intersection automaton and
makes all rules explicit with the default algorithm.
|
<OtherState> |
TreeAutomaton.intersectCondensed(CondensedTreeAutomaton<OtherState> other,
PruningPolicy pp) |
static IntersectionAutomaton |
IntersectionAutomaton.intersectTopDownBottomUpCKY(TreeAutomaton lhs,
TreeAutomaton rhs)
Helper method which creates an intersection automaton and
makes all rules explicit with the CKY algorithm.
|
Tree<String> |
TreeAutomaton.viterbi()
Computes the highest-weighted tree in the language of this (weighted)
automaton, using the Viterbi algorithm.
|
Constructor and Description |
---|
IntersectionAutomaton(TreeAutomaton<LeftState> left,
TreeAutomaton<RightState> right)
Crates a new instance which represents the intersection of the two given automata.
|
Modifier and Type | Method and Description |
---|---|
DoubleList |
CoarseToFineParser.Combination.getBinarizedStateSaturation() |
TreeAutomaton |
CoarseToFineParser.Combination.getChart() |
DoubleList |
CoarseToFineParser.Combination.getGrammarRulesNumber() |
double |
CoarseToFineParser.Combination.getInitialTime() |
DoubleList |
CoarseToFineParser.Combination.getInverseRulesNumber() |
DoubleList |
CoarseToFineParser.Combination.getPruned() |
DoubleList |
CoarseToFineParser.Combination.getRulesInChart() |
DoubleList |
CoarseToFineParser.Combination.getRulesPruned() |
DoubleList |
CoarseToFineParser.Combination.getSaturation() |
DoubleList |
CoarseToFineParser.Combination.getSeen() |
DoubleList |
CoarseToFineParser.Combination.getStateSaturation() |
DoubleList |
CoarseToFineParser.Combination.getTimeTakenPerLevel() |
static CoarseToFineParser |
CoarseToFineParser.makeCoarseToFineParser(InterpretedTreeAutomaton irtg,
String interpretation,
String ftcMap,
double theta)
This is a convenience method which constructs a coarse to fine parser with the given
parameters.
|
TreeAutomaton |
CoarseToFineParser.parseInputObject(Object inputObject)
Uses coarse to fine parsing to produce a pruned parse chart for the input
object.
|
CoarseToFineParser.Combination |
CoarseToFineParser.parseInputObjectTrackSizes(Object inputObject)
This method is used for evaluation of coarse-to-fine parsing with Alto Lab,
most users will not need it.
|
CoarseToFineParser.Combination |
CoarseToFineParser.parseInputObjectTrackTimes(Object inputObject)
This method is used for evaluation of coarse-to-fine parsing with Alto Lab,
most users will not need it.
|
TreeAutomaton |
CoarseToFineParser.parseInputObjectWithSF(Object inputObject)
Uses coarse to fine parsing to produce a pruned parse chart for the input
object.
|
CoarseToFineParser.Combination |
CoarseToFineParser.parseInputObjectWithSFTrackSizes(Object inputObject)
This method is used for evaluation of coarse-to-fine parsing with Alto Lab,
most users will not need it.
|
CoarseToFineParser.Combination |
CoarseToFineParser.parseInputObjectWithSFTrackTimes(Object inputObject)
This method is used for evaluation of coarse-to-fine parsing with Alto Lab,
most users will not need it.
|
static FineToCoarseMapping |
GrammarCoarsifier.readFtcMapping(String s) |
Modifier and Type | Method and Description |
---|---|
int |
NonCondensedIntersectionAutomaton.getNumberOfSeenRhsStates() |
static NonCondensedIntersectionAutomaton |
NonCondensedIntersectionAutomaton.intersectTopDownBottomUpNonCondensed(TreeAutomaton lhs,
CondensedTreeAutomaton rhs) |
static CondensedTreeAutomaton |
PMFactoryRestrictive.invhomWithNewFactory(TreeAutomaton rhs,
Homomorphism hom) |
Constructor and Description |
---|
CondensedIntersectionAutomaton(TreeAutomaton<LeftState> left,
CondensedTreeAutomaton<RightState> right)
Assumes the signatures are identical.
|
CondensedNondeletingInverseHomAutomaton(TreeAutomaton<State> rhsAutomaton,
Homomorphism hom) |
NonCondensedIntersectionAutomaton(TreeAutomaton<LeftState> left,
CondensedTreeAutomaton<RightState> right)
Assumes the signatures are identical.
|
Modifier and Type | Method and Description |
---|---|
static PruningPolicy |
HistogramPruningPolicy.createHistogramPruningPolicy(FOM fom,
int k) |
static FOM |
SemiringFOM.createInsideFom() |
static PruningPolicy |
NoPruningPolicy.createNoPruningPolicy() |
static PruningPolicy |
QuotientPruningPolicy.createQuotientPruningPolicy(FOM fom,
double factor) |
static PruningPolicy |
StatewiseHistogramPruningPolicy.createStatewiseHistogramPruningPolicy(FOM fom,
int k) |
long |
StatewiseHistogramPruningPolicy.numCollectedRules() |
long |
HistogramPruningPolicy.numCollectedRules() |
long |
QuotientPruningPolicy.numCollectedRules() |
long |
PruningPolicy.numCollectedRules() |
long |
NoPruningPolicy.numCollectedRules() |
long |
StatewiseHistogramPruningPolicy.numIteratedRules() |
long |
HistogramPruningPolicy.numIteratedRules() |
long |
QuotientPruningPolicy.numIteratedRules() |
long |
PruningPolicy.numIteratedRules() |
long |
NoPruningPolicy.numIteratedRules() |
Modifier and Type | Method and Description |
---|---|
Tree<String> |
Homomorphism.apply(Tree<String> tree) |
Modifier and Type | Method and Description |
---|---|
static double |
BasicOperations.average(Object[] values)
Computes the average value of the doubles.
|
static DoubleList |
BasicOperations.averageLists(Object[] list)
The input list must be a list of DoubleList entries, each of equal size
-- if that is the case, returns a DoubleList with i-th entry the average of
the i-th entries of the input lists.
|
static Double |
BasicOperations.div(Object denominator,
Object divisor)
Standard division.
|
static double |
BasicOperations.equals(Object object,
Object other)
Returns 1 if object and other are both null, or both not null and equal.
|
static double |
BasicOperations.f1(double precision,
double recall)
Computes F1-score (standard F-score) from precision and recall.
|
static double |
BasicOperations.isNotNull(Object object)
Returns 0 if object is null, and 1 if it is not null.
|
static double |
BasicOperations.percent(double x,
double y) |
static double |
BasicOperations.selfNormDifference(Object d1,
Object d2)
Returns the absolute value of (d1-d2)/d1.
|
static DoubleList |
BasicOperations.sumLists(Object[] list)
The input list must be a list of DoubleList entries, each of equal size
-- if that is the case, returns a DoubleList with i-th entry the sum of
the i-th entries of the input lists.
|
static Double |
BasicOperations.weightedAverageWithIntWeights(Object[] values,
Object[] weights)
Computes the average of values, weighted by weights.
|
Modifier and Type | Method and Description |
---|---|
static ConcreteTreeAutomaton |
SiblingFinderIntersection.makeVeryLazyExplicit(SiblingFinderIntersection veryLazyAuto) |
Constructor and Description |
---|
SiblingFinderIntersection(TreeAutomaton<LeftState> leftAutomaton,
SiblingFinderInvhom<RightState> rightAutomaton) |
SiblingFinderInvhom(TreeAutomaton<State> decompositionAutomaton,
Homomorphism hom) |
Copyright © 2017. All rights reserved.