public class MutualInformationRanker extends AbstractRanker implements RankerList
INDEX_OPTION, LIMIT_OPTION
Constructor and Description |
---|
MutualInformationRanker()
Empty constructor
Use
AbstractRanker.setFinder(Finder) before using this class |
MutualInformationRanker(Finder aFinder) |
Modifier and Type | Method and Description |
---|---|
DecompoundedWord |
highestRank(List<DecompoundedWord> aSplits)
Ranks the given splits and returns the split with highest rank
|
DecompoundedWord |
highestRank(ValueNode<DecompoundedWord> aParent,
List<DecompoundedWord> aPath)
Searches a a path throw the tree
|
List<DecompoundedWord> |
rank(List<DecompoundedWord> aSplits)
Ranks all splits and returns a order list
|
filterAndSort, freq, freq, freq, getFinder, getIndexPathOption, getLimitOption, highestRank, setFinder
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
highestRank, setFinder
public MutualInformationRanker()
AbstractRanker.setFinder(Finder)
before using this classpublic MutualInformationRanker(Finder aFinder)
public DecompoundedWord highestRank(List<DecompoundedWord> aSplits)
RankerList
highestRank
in interface RankerList
aSplits
- The highest ranked splitpublic List<DecompoundedWord> rank(List<DecompoundedWord> aSplits)
RankerList
rank
in interface RankerList
aSplits
- the splits to rank.public DecompoundedWord highestRank(ValueNode<DecompoundedWord> aParent, List<DecompoundedWord> aPath)
highestRank
in class AbstractRanker
Copyright © 2007–2018 Ubiquitous Knowledge Processing (UKP) Lab, Technische Universität Darmstadt. All rights reserved.