org.corpus_tools.annis.gui

Class Helper.CoveredMatchesCalculator

java.lang.Object

org.corpus_tools.annis.gui.Helper.CoveredMatchesCalculator

All Implemented Interfaces:

org.corpus_tools.salt.core.GraphTraverseHandler

Enclosing class:

Helper

public static class Helper.CoveredMatchesCalculator
extends Object
implements org.corpus_tools.salt.core.GraphTraverseHandler

Marks all nodes which are dominated by already marked nodes. 1. Sort ascending all initial marked nodes by the size of the intervall between left and right token index. 2. Traverse the salt document graph with the sorted list of step 1. as root nodes and mark all children with the same match position. Already marked nodes are omitted. Note: The algorithm prevents nested marked nodes to be overwritten. Nested nodes must have a smaller intervall from left to right by default, so this should always work.

Constructor Summary

Constructors

Constructor and Description
CoveredMatchesCalculator(org.corpus_tools.salt.common.SDocumentGraph graph, Map<org.corpus_tools.salt.core.SNode,Long> initialMatches, Map<org.corpus_tools.salt.common.SToken,Integer> token2index)

Method Summary

Modifier and Type	Method and Description
boolean	checkConstraint(org.corpus_tools.salt.core.SGraph.GRAPH_TRAVERSE_TYPE traversalType, String traversalId, org.corpus_tools.salt.core.SRelation edge, org.corpus_tools.salt.core.SNode currNode, long order)
Map<org.corpus_tools.salt.core.SNode,Long>	getMatchedAndCovered()
void	nodeLeft(org.corpus_tools.salt.core.SGraph.GRAPH_TRAVERSE_TYPE traversalType, String traversalId, org.corpus_tools.salt.core.SNode currNode, org.corpus_tools.salt.core.SRelation edge, org.corpus_tools.salt.core.SNode fromNode, long order)
void	nodeReached(org.corpus_tools.salt.core.SGraph.GRAPH_TRAVERSE_TYPE traversalType, String traversalId, org.corpus_tools.salt.core.SNode currNode, org.corpus_tools.salt.core.SRelation edge, org.corpus_tools.salt.core.SNode fromNode, long order)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

CoveredMatchesCalculator

public CoveredMatchesCalculator(org.corpus_tools.salt.common.SDocumentGraph graph,
                                Map<org.corpus_tools.salt.core.SNode,Long> initialMatches,
                                Map<org.corpus_tools.salt.common.SToken,Integer> token2index)

Method Detail

checkConstraint

public boolean checkConstraint(org.corpus_tools.salt.core.SGraph.GRAPH_TRAVERSE_TYPE traversalType,
                               String traversalId,
                               org.corpus_tools.salt.core.SRelation edge,
                               org.corpus_tools.salt.core.SNode currNode,
                               long order)

Specified by:

checkConstraint in interface org.corpus_tools.salt.core.GraphTraverseHandler

getMatchedAndCovered

public Map<org.corpus_tools.salt.core.SNode,Long> getMatchedAndCovered()

nodeLeft

public void nodeLeft(org.corpus_tools.salt.core.SGraph.GRAPH_TRAVERSE_TYPE traversalType,
                     String traversalId,
                     org.corpus_tools.salt.core.SNode currNode,
                     org.corpus_tools.salt.core.SRelation edge,
                     org.corpus_tools.salt.core.SNode fromNode,
                     long order)

Specified by:

nodeLeft in interface org.corpus_tools.salt.core.GraphTraverseHandler

nodeReached

public void nodeReached(org.corpus_tools.salt.core.SGraph.GRAPH_TRAVERSE_TYPE traversalType,
                        String traversalId,
                        org.corpus_tools.salt.core.SNode currNode,
                        org.corpus_tools.salt.core.SRelation edge,
                        org.corpus_tools.salt.core.SNode fromNode,
                        long order)

Specified by:

nodeReached in interface org.corpus_tools.salt.core.GraphTraverseHandler