Package | Description |
---|---|
edu.ucla.sspace.evaluation | |
edu.ucla.sspace.graph.isomorphism | |
edu.ucla.sspace.text | |
edu.ucla.sspace.util |
Modifier and Type | Field and Description |
---|---|
protected Set<Pair<String>> |
AbstractWordPrimingTest.primeTargetPairs
A mapping from a word pair to the human association judgement for it
|
protected Map<Pair<String>,Double> |
AbstractWordAssociationTest.wordPairToHumanJudgement
A mapping from a word pair to the human association judgement for it
|
Modifier and Type | Method and Description |
---|---|
static Set<Pair<String>> |
OnePairPerLinePrimingTest.prepareRelationMap(File testPairFile)
Returns a set of prime, target word pairs that are extracted from a text
file.
|
Constructor and Description |
---|
AbstractWordAssociationTest(Map<Pair<String>,Double> wordPairToHumanJudgement) |
AbstractWordPrimingTest(Set<Pair<String>> primeTargetPairs) |
Modifier and Type | Method and Description |
---|---|
Pair<Integer> |
VF2State.nextPair(int prevN1,
int prevN2)
Returns the next candidate for isomorphic matching given these prior two
vertices that were matched.
|
Pair<Integer> |
State.nextPair(int prevN1,
int prevN2)
Returns the next candidate for isomorphic matching given these prior two
vertices that were matched.
|
Pair<Integer> |
TypedVF2State.nextPair(int prevN1,
int prevN2)
Returns the next candidate for isomorphic matching given these prior two
vertices that were matched.
|
Modifier and Type | Method and Description |
---|---|
Iterator<Map.Entry<Pair<String>,Double>> |
TermAssociationFinder.iterator()
Returns an iterator over all the bigram pairs with their corresponding
association scores
|
Modifier and Type | Method and Description |
---|---|
Pair<T> |
PairCounter.max()
Returns the pair that currently has the largest count.
|
Pair<T> |
PairCounter.min()
Returns the pair that currently has the smallest count.
|
Modifier and Type | Method and Description |
---|---|
Set<Pair<T>> |
PairCounter.items()
Returns a view of the pairs currently being counted.
|
Iterator<Map.Entry<Pair<T>,Integer>> |
PairCounter.iterator()
Returns an iterator over the pairs that have been counted thusfar and
their respective counts.
|
Modifier and Type | Method and Description |
---|---|
int |
PairCounter.count(Pair<T> obj)
Counts the pair of objects, increasing its total count by 1.
|
int |
PairCounter.count(Pair<T> obj,
int count)
Counts the pair, increasing its total count by the specified positive amount.
|
int |
PairCounter.getCount(Pair<T> obj)
Returns the number of times the specified pair of objects has been seen
by this counter.
|
double |
PairCounter.getFrequency(Pair<T> p)
Returns the frequency of this object pair relative to the counts of all other
object pair.
|
Modifier and Type | Method and Description |
---|---|
void |
PairCounter.add(Counter<? extends Pair<T>> counter)
Adds the counts from the provided
Counter to the current counts,
adding new elements as needed. |
void |
PairCounter.countAll(Collection<? extends Pair<T>> c)
Counts all the elements in the collection.
|
Constructor and Description |
---|
PairCounter(Collection<? extends Pair<T>> items)
Creates a
Counter whose initial state has counted all of the
specified items. |
Copyright © 2012. All Rights Reserved.