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.uima.resource |
This package contains UIMA resources classes.
|
Modifier and Type | Method and Description |
---|---|
static List<DecompoundedWord> |
AbstractRanker.filterAndSort(List<DecompoundedWord> aSplits)
Expects that the splits list contains at least one element and that this is the unsplit word.
|
List<DecompoundedWord> |
FrequencyGeometricMeanRanker.rank(List<DecompoundedWord> aSplits) |
List<DecompoundedWord> |
MutualInformationRanker.rank(List<DecompoundedWord> aSplits) |
List<DecompoundedWord> |
CompoundProbabilityRanker.rank(List<DecompoundedWord> aSplits) |
List<DecompoundedWord> |
RankerList.rank(List<DecompoundedWord> aSplits)
Ranks all splits and returns a order list
|
Modifier and Type | Method and Description |
---|---|
static List<DecompoundedWord> |
AbstractRanker.filterAndSort(List<DecompoundedWord> aSplits)
Expects that the splits list contains at least one element and that this is the unsplit word.
|
DecompoundedWord |
FrequencyGeometricMeanRanker.highestRank(List<DecompoundedWord> aSplits) |
DecompoundedWord |
MutualInformationRanker.highestRank(List<DecompoundedWord> aSplits) |
DecompoundedWord |
CompoundProbabilityRanker.highestRank(List<DecompoundedWord> aSplits) |
DecompoundedWord |
RankerList.highestRank(List<DecompoundedWord> aSplits)
Ranks the given splits and returns the split with highest rank
|
abstract DecompoundedWord |
AbstractRanker.highestRank(ValueNode<DecompoundedWord> aParent,
List<DecompoundedWord> aPath) |
abstract DecompoundedWord |
AbstractRanker.highestRank(ValueNode<DecompoundedWord> aParent,
List<DecompoundedWord> aPath) |
DecompoundedWord |
FrequencyGeometricMeanRanker.highestRank(ValueNode<DecompoundedWord> aParent,
List<DecompoundedWord> aPath)
Searches a a path throw the tree
|
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
|
DecompoundedWord |
MutualInformationRanker.highestRank(ValueNode<DecompoundedWord> aParent,
List<DecompoundedWord> aPath)
Searches a a path throw the tree
|
DecompoundedWord |
DummyRanker.highestRank(ValueNode<DecompoundedWord> aParent,
List<DecompoundedWord> aPath) |
DecompoundedWord |
DummyRanker.highestRank(ValueNode<DecompoundedWord> aParent,
List<DecompoundedWord> aPath) |
DecompoundedWord |
CompoundProbabilityRanker.highestRank(ValueNode<DecompoundedWord> aParent,
List<DecompoundedWord> aPath)
Searches a a path throw the tree
|
DecompoundedWord |
CompoundProbabilityRanker.highestRank(ValueNode<DecompoundedWord> aParent,
List<DecompoundedWord> aPath)
Searches a a path throw the tree
|
List<DecompoundedWord> |
FrequencyGeometricMeanRanker.rank(List<DecompoundedWord> aSplits) |
List<DecompoundedWord> |
MutualInformationRanker.rank(List<DecompoundedWord> aSplits) |
List<DecompoundedWord> |
CompoundProbabilityRanker.rank(List<DecompoundedWord> aSplits) |
List<DecompoundedWord> |
RankerList.rank(List<DecompoundedWord> aSplits)
Ranks all splits and returns a order list
|
Modifier and Type | Method and Description |
---|---|
protected DecompoundedWord |
BananaSplitterAlgorithm.compoundToSplit(de.drni.bananasplit.Compound aCompound)
Converts the banana split compound to a split
|
DecompoundedWord |
DecompoundedWord.createCopy()
Creates a copy of this element.
|
static DecompoundedWord |
DecompoundedWord.createFromString(String aSplit)
Create a split from a string
The string has the structure: word1(morpheme)+word2(morpheme)+...+word3
For example: "Aktion(s)+plan" or "Verbraucher+zahlen"
|
protected DecompoundedWord |
BananaSplitterAlgorithm.makeSplit(String aWord)
Split a word with the banana splitter
|
Modifier and Type | Method and Description |
---|---|
protected List<DecompoundedWord> |
DataDrivenSplitterAlgorithm.checkForMorphemes(DecompoundedWord aSplit) |
List<DecompoundedWord> |
DecompoundingTree.getAllSplits()
Converts the tree to a list.
|
ValueNode<DecompoundedWord> |
DecompoundingTree.getRoot() |
List<DecompoundedWord> |
DecompoundingTree.getSplits()
Converts the tree to a list.
|
protected List<DecompoundedWord> |
DataDrivenSplitterAlgorithm.makeSplit(String aWord)
Makes a single split on a given word.
|
protected List<DecompoundedWord> |
LeftToRightSplitterAlgorithm.makeSplit(String aWord)
Splits a word in two word.
|
Modifier and Type | Method and Description |
---|---|
protected List<DecompoundedWord> |
DataDrivenSplitterAlgorithm.checkForMorphemes(DecompoundedWord aSplit) |
int |
DecompoundedWord.compareTo(DecompoundedWord aOtherSplit) |
boolean |
DecompoundedWord.equalWithoutMorpheme(DecompoundedWord aOtherSplit)
Similar to the equals method, but combines morpheme and word
|
void |
DecompoundedWord.replaceSplitElement(int aIndex,
DecompoundedWord aSplit)
Replace one split element with a split.
|
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 |
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
|
Constructor and Description |
---|
DecompoundingTree(DecompoundedWord aSplit) |
Modifier and Type | Method and Description |
---|---|
DecompoundedWord |
MutualInformationRankerResource.highestRank(DecompoundingTree aSplitTree) |
DecompoundedWord |
FrequencyRankerResource.highestRank(DecompoundingTree aSplitTree) |
DecompoundedWord |
ProbabilityRankerResource.highestRank(DecompoundingTree aSplitTree) |
Copyright © 2007–2016 Ubiquitous Knowledge Processing (UKP) Lab, Technische Universität Darmstadt. All rights reserved.