Uses of Interface
edu.ucla.sspace.util.SortedMultiMap

Packages that use SortedMultiMap

Package	Description
edu.ucla.sspace.common
edu.ucla.sspace.matrix
edu.ucla.sspace.util

Uses of SortedMultiMap in edu.ucla.sspace.common

Methods in edu.ucla.sspace.common that return SortedMultiMap

Modifier and Type	Method and Description
SortedMultiMap<Double,String>	WordComparator.getMostSimilar(String word, SemanticSpace sspace, int numberOfSimilarWords, Similarity.SimType similarityType) Compares the provided word to all other words in the provided SemanticSpace and return the specified number of words that were most similar according to the specified similarity measure.

Uses of SortedMultiMap in edu.ucla.sspace.matrix

Methods in edu.ucla.sspace.matrix that return SortedMultiMap

Modifier and Type	Method and Description
SortedMultiMap<Double,Integer>	RowComparator.getMostSimilar(Matrix m, int row, int kNearestRows, Similarity.SimType similarityType) Compares the specified row to all other rows, returning the k-nearest rows according to the similarity metric.
SortedMultiMap<Double,Integer>	RowComparator.getMostSimilar(Matrix m, int row, int kNearestRows, SimilarityFunction simFunction) Compares the specified row to all other rows, returning the k-nearest rows according to the similarity metric.

Uses of SortedMultiMap in edu.ucla.sspace.util

Classes in edu.ucla.sspace.util that implement SortedMultiMap

Modifier and Type	Class and Description
class	BoundedSortedMultiMap<K,V> A MultiMap implementation that grows to a fixed size and then retains only a fixed number of either keys or mappings.
class	TreeMultiMap<K,V> A Red-Black tree SortedMultiMap implementation.

Methods in edu.ucla.sspace.util that return SortedMultiMap

Modifier and Type	Method and Description
SortedMultiMap<Double,String>	NearestNeighborFinder.getMostSimilar(Set<String> terms, int numberOfSimilarWords) Finds the k most similar words in the semantic space according to the cosine similarity, returning a mapping from their similarity to the word itself.
SortedMultiMap<Double,String>	SimpleNearestNeighborFinder.getMostSimilar(Set<String> terms, int numberOfSimilarWords) Finds the k most similar words in the semantic space according to the cosine similarity, returning a mapping from their similarity to the word itself.
SortedMultiMap<Double,String>	PartitioningNearestNeighborFinder.getMostSimilar(Set<String> terms, int numberOfSimilarWords) Finds the k most similar words in the semantic space according to the cosine similarity, returning a mapping from their similarity to the word itself.
SortedMultiMap<Double,String>	NearestNeighborFinder.getMostSimilar(String word, int numberOfSimilarWords) Finds the k most similar words in the semantic space according to the cosine similarity, returning a mapping from their similarity to the word itself.
SortedMultiMap<Double,String>	SimpleNearestNeighborFinder.getMostSimilar(String word, int numberOfSimilarWords) Finds the k most similar words in the semantic space according to the cosine similarity, returning a mapping from their similarity to the word itself.
SortedMultiMap<Double,String>	PartitioningNearestNeighborFinder.getMostSimilar(String word, int numberOfSimilarWords) Finds the k most similar words in the semantic space according to the cosine similarity, returning a mapping from their similarity to the word itself.
SortedMultiMap<Double,String>	NearestNeighborFinder.getMostSimilar(Vector v, int numberOfSimilarWords) Finds the k most similar words in the semantic space according to the cosine similarity, returning a mapping from their similarity to the word itself.
SortedMultiMap<Double,String>	SimpleNearestNeighborFinder.getMostSimilar(Vector v, int numberOfSimilarWords) Finds the k most similar words in the semantic space according to the cosine similarity, returning a mapping from their similarity to the word itself.
SortedMultiMap<Double,String>	PartitioningNearestNeighborFinder.getMostSimilar(Vector v, int numberOfSimilarWords) Finds the k most similar words in the semantic space according to the cosine similarity, returning a mapping from their similarity to the word itself.
SortedMultiMap<K,V>	TreeMultiMap.headMap(K toKey) Returns a view of the portion of this map whose keys are less than toKey.
SortedMultiMap<K,V>	SortedMultiMap.headMap(K toKey) Returns a view of the portion of this map whose keys are less than toKey.
SortedMultiMap<K,V>	TreeMultiMap.subMap(K fromKey, K toKey) Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive.
SortedMultiMap<K,V>	SortedMultiMap.subMap(K fromKey, K toKey) Returns a view of the portion of this map whose keys range from fromKey, inclusive, to toKey, exclusive.
SortedMultiMap<K,V>	TreeMultiMap.tailMap(K fromKey) Returns a view of the portion of this map whose keys are greater than or equal to fromKey.
SortedMultiMap<K,V>	SortedMultiMap.tailMap(K fromKey) Returns a view of the portion of this map whose keys are greater than or equal to fromKey.