Package | Description |
---|---|
de.tudarmstadt.ukp.dkpro.core.decompounding.ranking |
Contains ranking algorithm.
|
de.tudarmstadt.ukp.dkpro.core.decompounding.splitter |
Contains splitting algorithm.
|
de.tudarmstadt.ukp.dkpro.core.decompounding.trie |
Some base classes for trees and a simple Trie implementation
|
Modifier and Type | Method and Description |
---|---|
abstract DecompoundedWord |
AbstractRanker.highestRank(ValueNode<DecompoundedWord> aParent,
List<DecompoundedWord> aPath) |
DecompoundedWord |
CompoundProbabilityRanker.highestRank(ValueNode<DecompoundedWord> aParent,
List<DecompoundedWord> aPath)
Searches a a path throw the tree
|
DecompoundedWord |
DummyRanker.highestRank(ValueNode<DecompoundedWord> aParent,
List<DecompoundedWord> aPath) |
DecompoundedWord |
FrequencyGeometricMeanRanker.highestRank(ValueNode<DecompoundedWord> aParent,
List<DecompoundedWord> aPath)
Searches a a path throw the tree
|
DecompoundedWord |
MutualInformationRanker.highestRank(ValueNode<DecompoundedWord> aParent,
List<DecompoundedWord> aPath)
Searches a a path throw the tree
|
Modifier and Type | Method and Description |
---|---|
ValueNode<DecompoundedWord> |
DecompoundingTree.getRoot() |
Modifier and Type | Method and Description |
---|---|
protected void |
BananaSplitterAlgorithm.bananaSplit(ValueNode<DecompoundedWord> aParent,
int aDepth)
Recursively creates the split tree
|
protected void |
DecompoundingTree.getAllSplitsRecursive(Set<DecompoundedWord> aSplits,
ValueNode<DecompoundedWord> aNode,
boolean aAddNode) |
protected void |
LeftToRightSplitterAlgorithm.ltrSplit(ValueNode<DecompoundedWord> aParent,
int aDepth)
The basic split algorithm.
|
void |
DecompoundingTree.setRoot(ValueNode<DecompoundedWord> aRoot) |
protected void |
DataDrivenSplitterAlgorithm.splitIt(ValueNode<DecompoundedWord> aParent,
int aDepth)
Builds a splitting tree
|
Modifier and Type | Method and Description |
---|---|
List<ValueNode<V>> |
ValueNode.getChildren()
Returns a children for this node
|
Modifier and Type | Method and Description |
---|---|
void |
ValueNode.addChild(ValueNode<V> node)
Adds a child object to this node
|
Modifier and Type | Method and Description |
---|---|
void |
ValueNode.setChildren(List<ValueNode<V>> aChildren)
Sets the children for this node
|
Copyright © 2007–2018 Ubiquitous Knowledge Processing (UKP) Lab, Technische Universität Darmstadt. All rights reserved.