de.up.ling.irtg.siblingfinder

Class SiblingFinder

java.lang.Object

de.up.ling.irtg.siblingfinder.SiblingFinder

Direct Known Subclasses:

SiblingFinder.SetPartnerFinder

public abstract class SiblingFinder
extends Object

Implementation of the sibling finders discussed in Groschwitz et al. 2016 (Efficient techniques for parsing with tree automata).

Author:

groschwitz

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	SiblingFinder.SetPartnerFinder Trivial and inefficient implementation, that has no indexing and simply returns all previous seen states as possible partners.

Constructor Summary

Constructors

Constructor and Description
SiblingFinder(int arity) Creates a new sibling finder for an operation with given arity.

Method Summary

Modifier and Type	Method and Description
void	addState(int stateID, int pos) Adds a state to the indexing structure, making it available for future calls to getPartners.
abstract Iterable<int[]>	getPartners(int stateID, int pos) Returns the possible stored siblings (ie other children) for a given state.

Methods inherited from class java.lang.Object

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

Constructor Detail

SiblingFinder

public SiblingFinder(int arity)

Creates a new sibling finder for an operation with given arity.

Parameters:

arity -

Method Detail

getPartners

public abstract Iterable<int[]> getPartners(int stateID,
                                            int pos)

Returns the possible stored siblings (ie other children) for a given state.

Parameters:

stateID - the state for which to find partners

pos - the desired position of state in the arguments

Returns:

all potential sibling combinations. the int[] arrays includes the given stateID at position pos

addState

public void addState(int stateID,
                     int pos)

Adds a state to the indexing structure, making it available for future calls to getPartners.

Parameters:

stateID -

pos -