org.aika.corpus

Class SearchNode

java.lang.Object

org.aika.corpus.SearchNode

All Implemented Interfaces:

Comparable<SearchNode>

public class SearchNode
extends Object
implements Comparable<SearchNode>

The SearchNode class represents a node in the binary search tree that is used to find the optimal interpretation for a given document. Each search node posses a refinement (simply a set of interpretation nodes). The two options that this search node examines are that the refinement will either part of the final interpretation or not. During each search step the activation values in all the neuron activations adjusted such that they reflect the interpretation of the current search path. When the search reaches the maximum depth of the search tree and no further refinements exists, a weight is computed evaluating the current search path. The search path with the highest weight is used to determine the final interpretation. Before the search is started a set of initial refinements is generated from the conflicts within the document. In other words, if there are no conflicts in a given document, then no search is needed. In this case the final interpretation will simply be the set of all interpretation nodes. The initial refinements are then expanded, meaning all interpretation nodes that are consistent with this refinement are added to the refinement. The initial refinements are then propagated along the search path as refinement candidates.

Author:

Lukas Molzberger

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	SearchNode.RefMarker
static class	SearchNode.StateChange

Field Summary

Fields

Modifier and Type	Field and Description
TreeSet<SearchNode>	candidates
int	id
static boolean	INCOMPLETE_OPTIMIZATION This optimization may miss some cases and will not always return the best interpretation.
static int	MAX_SEARCH_STEPS
List<SearchNode.StateChange>	modifiedActs

Constructor Summary

Constructors

Constructor and Description
SearchNode(SearchNode parent)

Method Summary

Modifier and Type	Method and Description
void	changeState(SearchNode.StateChange.Mode m)
static List<InterprNode>	collectConflicts(Document doc)
int	compareTo(SearchNode c)
Neuron.NormWeight	computeAccumulatedWeight()
void	computeSelectedOption(Document doc)
boolean	containedInSelectedBranch(long v, InterprNode n)
static SearchNode	createCandidate(Document doc, List<InterprNode> changed, SearchNode parent, SearchNode selectedParent, SearchNode excludedParent, List<InterprNode> ref, SearchNode.RefMarker marker)
static SearchNode	createInitialExpandNode(Document doc)
void	generateInitialCandidates(Document doc)
void	generateNextLevelCandidates(Document doc, SearchNode selectedParent, SearchNode excludedParent)
boolean	isCovered(long g)
String	toString()

Methods inherited from class java.lang.Object

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

Field Detail

INCOMPLETE_OPTIMIZATION

public static boolean INCOMPLETE_OPTIMIZATION

This optimization may miss some cases and will not always return the best interpretation.

MAX_SEARCH_STEPS

public static int MAX_SEARCH_STEPS

id

public int id

modifiedActs

public List<SearchNode.StateChange> modifiedActs

candidates

public TreeSet<SearchNode> candidates

Constructor Detail

SearchNode

public SearchNode(SearchNode parent)

Method Detail

createInitialExpandNode

public static SearchNode createInitialExpandNode(Document doc)

computeSelectedOption

public void computeSelectedOption(Document doc)

generateInitialCandidates

public void generateInitialCandidates(Document doc)

generateNextLevelCandidates

public void generateNextLevelCandidates(Document doc,
                                        SearchNode selectedParent,
                                        SearchNode excludedParent)

collectConflicts

public static List<InterprNode> collectConflicts(Document doc)

computeAccumulatedWeight

public Neuron.NormWeight computeAccumulatedWeight()

isCovered

public boolean isCovered(long g)

containedInSelectedBranch

public boolean containedInSelectedBranch(long v,
                                         InterprNode n)

toString

public String toString()

Overrides:

toString in class Object

createCandidate

public static SearchNode createCandidate(Document doc,
                                         List<InterprNode> changed,
                                         SearchNode parent,
                                         SearchNode selectedParent,
                                         SearchNode excludedParent,
                                         List<InterprNode> ref,
                                         SearchNode.RefMarker marker)

changeState

public void changeState(SearchNode.StateChange.Mode m)

compareTo

public int compareTo(SearchNode c)

Specified by:

compareTo in interface Comparable<SearchNode>