de.tudarmstadt.ukp.dkpro.core.decompounding.splitter

Class DecompoundingTree

java.lang.Object

de.tudarmstadt.ukp.dkpro.core.decompounding.splitter.DecompoundingTree

public class DecompoundingTree
extends Object

A split tree. Holds all splits in a tree structure. This can help to see the how the split algorithm works

Constructor Summary

Constructors

Constructor and Description
DecompoundingTree(DecompoundedWord aSplit)
DecompoundingTree(String aWord)

Method Summary

Modifier and Type	Method and Description
List<DecompoundedWord>	getAllSplits() Converts the tree to a list.
protected void	getAllSplitsRecursive(Set<DecompoundedWord> aSplits, ValueNode<DecompoundedWord> aNode, boolean aAddNode)
ValueNode<DecompoundedWord>	getRoot()
List<DecompoundedWord>	getSplits() Converts the tree to a list.
void	setRoot(ValueNode<DecompoundedWord> aRoot)

Methods inherited from class java.lang.Object

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

Constructor Detail

DecompoundingTree

public DecompoundingTree(String aWord)

DecompoundingTree

public DecompoundingTree(DecompoundedWord aSplit)

Method Detail

getRoot

public ValueNode<DecompoundedWord> getRoot()

setRoot

public void setRoot(ValueNode<DecompoundedWord> aRoot)

getAllSplits

public List<DecompoundedWord> getAllSplits()

Converts the tree to a list.

Returns:

the splits.

getSplits

public List<DecompoundedWord> getSplits()

Converts the tree to a list. If there are splits, then the root node, which contains the unsplit word, is not returned.

Returns:

the splits.

getAllSplitsRecursive

protected void getAllSplitsRecursive(Set<DecompoundedWord> aSplits,
                                     ValueNode<DecompoundedWord> aNode,
                                     boolean aAddNode)