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

Class DataDrivenSplitterAlgorithm

java.lang.Object

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

All Implemented Interfaces:

SplitterAlgorithm

public class DataDrivenSplitterAlgorithm
extends Object
implements SplitterAlgorithm

A data driven algorithm, that uses a TRIE to look for splits

Constructor Summary

Constructors

Constructor and Description
DataDrivenSplitterAlgorithm() Empty constructor Before you use this class set the dictionary and the linking morphemes with the setter methods
DataDrivenSplitterAlgorithm(SimpleDictionary aDictionary, LinkingMorphemes aMorphemes) Constructor

Method Summary

Modifier and Type	Method and Description
protected List<DecompoundedWord>	checkForMorphemes(DecompoundedWord aSplit)
protected List<DecompoundedWord>	makeSplit(String aWord) Makes a single split on a given word.
void	setDictionary(Dictionary aDict) Sets the dictionary for the algorithm
void	setLinkingMorphemes(LinkingMorphemes aLinkingMorphemes) Sets the linking morphemes for the algorithm
void	setMaximalTreeDepth(int aDepth) Set the maximal tree depth.
DecompoundingTree	split(String aWord) Returns all possible splits for a given word.
protected void	splitIt(ValueNode<DecompoundedWord> aParent, int aDepth) Builds a splitting tree

Methods inherited from class java.lang.Object

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

Constructor Detail

DataDrivenSplitterAlgorithm

public DataDrivenSplitterAlgorithm()

Empty constructor Before you use this class set the dictionary and the linking morphemes with the setter methods

DataDrivenSplitterAlgorithm

public DataDrivenSplitterAlgorithm(SimpleDictionary aDictionary,
                                   LinkingMorphemes aMorphemes)

Constructor

Parameters:

aDictionary - A simple dictionary object

aMorphemes - A list of linking morphemes

Method Detail

split

public DecompoundingTree split(String aWord)

Description copied from interface: SplitterAlgorithm

Returns all possible splits for a given word.

Specified by:

split in interface SplitterAlgorithm

Parameters:

aWord - The word to split

Returns:

the decompouinding tree.

splitIt

protected void splitIt(ValueNode<DecompoundedWord> aParent,
                       int aDepth)

Builds a splitting tree

Parameters:

aParent - The parent node

aDepth - the current depth.

makeSplit

protected List<DecompoundedWord> makeSplit(String aWord)

Makes a single split on a given word. Returns all possible splittings. All splits consist of two elements

Parameters:

aWord - a word.

Returns:

all possible splittings.

checkForMorphemes

protected List<DecompoundedWord> checkForMorphemes(DecompoundedWord aSplit)

setDictionary

public void setDictionary(Dictionary aDict)

Description copied from interface: SplitterAlgorithm

Sets the dictionary for the algorithm

Specified by:

setDictionary in interface SplitterAlgorithm

Parameters:

aDict - The dictionary

setLinkingMorphemes

public void setLinkingMorphemes(LinkingMorphemes aLinkingMorphemes)

Description copied from interface: SplitterAlgorithm

Sets the linking morphemes for the algorithm

Specified by:

setLinkingMorphemes in interface SplitterAlgorithm

Parameters:

aLinkingMorphemes - the linking morphemes

setMaximalTreeDepth

public void setMaximalTreeDepth(int aDepth)

Description copied from interface: SplitterAlgorithm

Set the maximal tree depth. Default: Integer.MaxValue

Specified by:

setMaximalTreeDepth in interface SplitterAlgorithm

Parameters:

aDepth - maximal tree depth.