Serialized Form (S-Space Package 2.0.1 API)

Package edu.ucla.sspace.basis
- Class edu.ucla.sspace.basis.AbstractBasisMapping extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - mapping
```
Map<K,V> mapping
```
      The mapping from keys to dimension indices.
    - readOnly
```
boolean readOnly
```
      Set to true when the BasisMapping should not create new dimensions for unseen keys.
- Class edu.ucla.sspace.basis.StringBasisMapping extends AbstractBasisMapping<String,String> implements Serializable
  
  serialVersionUID:
  
  1L
Package edu.ucla.sspace.clustering
- Class edu.ucla.sspace.clustering.LinkClustering extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - workQueue
```
WorkQueue workQueue
```
      The work used by all LinkClustering instances to perform multi-threaded operations.
    - mergeOrder
```
List<E> mergeOrder
```
      The merges for the prior run of this clustering algorithm
    - edgeList
```
List<E> edgeList
```
      The list of edges that were last merged. This list is maintained in the same order as the initial cluster ordering.
    - numRows
```
int numRows
```
      The number of rows in the input matrix that was last clustered.
- Class edu.ucla.sspace.clustering.Merge extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - remainingCluster
```
int remainingCluster
```
    - mergedCluster
```
int mergedCluster
```
    - similarity
```
double similarity
```
Package edu.ucla.sspace.common
- Class edu.ucla.sspace.common.VectorMapSemanticSpace extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - wordSpace
```
Map<K,V> wordSpace
```
      The mapping from words to their semantic vectors
    - dimensions
```
int dimensions
```
      The total number of dimensions in this word space.
    - spaceName
```
String spaceName
```
      The name of this semantic space.
Package edu.ucla.sspace.dependency
- Class edu.ucla.sspace.dependency.DefaultDependencyPermutationFunction extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - permFunc
```
PermutationFunction<T extends Vector> permFunc
```
      The internal PermutationFunction to use for permuting vectors.
- Class edu.ucla.sspace.dependency.RelationPermutationFunction extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - permFunc
```
PermutationFunction<T extends Vector> permFunc
```
      The internal PermutationFunction to use for permuting vectors.
- Class edu.ucla.sspace.dependency.RelationSumPermutationFunction extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - permFunc
```
PermutationFunction<T extends Vector> permFunc
```
      The internal PermutationFunction to use for permuting vectors.
Package edu.ucla.sspace.dv
- Class edu.ucla.sspace.dv.RelationBasedBasisMapping extends AbstractBasisMapping<DependencyPath,String> implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.dv.WordBasedBasisMapping extends AbstractBasisMapping<DependencyPath,String> implements Serializable
  
  serialVersionUID:
  
  1L
Package edu.ucla.sspace.graph
- Class edu.ucla.sspace.graph.AbstractGraph extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - numEdges
```
int numEdges
```
      The number of edges in this graph.
    - vertexToEdges
```
gnu.trove.map.TIntObjectMap<V> vertexToEdges
```
      A mapping from a vertex's index to the the set of Edge instances that connect it to other members of the graph.
    - subgraphs
```
Collection<E> subgraphs
```
      A collection of all the subgraphs that have been returned from this graph. This collection is necessary to inform subgraphs of any vertex changes (removals) to this graph without requiring them to constantly check for updates. We use a WeakReference in order to keep track of the canonical Subgraph instance while ensuring that it is garbage collected when it is no longer referred to (which would never happen if this list contained strong references).
- Class edu.ucla.sspace.graph.BetweennessCentrality extends Object implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.graph.ChineseWhispersClustering extends Object implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.graph.DirectedMultigraph extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - typeCounts
```
gnu.trove.map.TObjectIntMap<K> typeCounts
```
      The count of the type distribution for all edges in the graph.
    - vertexToEdges
```
gnu.trove.map.TIntObjectMap<V> vertexToEdges
```
      The set of vertices in this mutligraph. This set is maintained independently of the vertex sets in the type-specific edge graphs to provide a fast, type independent state of which vertices are in the graph.
    - subgraphs
```
Collection<E> subgraphs
```
      A collection of all the subgraphs that have been returned from this graph. This collection is necessary to inform subgraphs of any vertex changes (removals) to this graph without requiring them to constantly check for updates. We use a WeakReference in order to keep track of the canonical Subgraph instance while ensuring that it is garbage collected when it is no longer referred to (which would never happen if this list contained strong references).
    - size
```
int size
```
      The number of edges contained in this graph.
- Class edu.ucla.sspace.graph.GenericEdgeSet extends AbstractSet<T extends Edge> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - rootVertex
```
int rootVertex
```
      The vertex to which all edges in the set are connected
    - vertexToEdges
```
MultiMap<K,V> vertexToEdges
```
      A mapping from connected vertices to the edges that connect to them
- Class edu.ucla.sspace.graph.GenericGraph extends AbstractGraph<T extends Edge,GenericEdgeSet<T extends Edge>> implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.graph.GraphConstructionException extends RuntimeException implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.graph.LabeledEdge extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - from
```
int from
```
    - to
```
int to
```
    - fromLabel
```
String fromLabel
```
    - toLabel
```
String toLabel
```
- Class edu.ucla.sspace.graph.LabeledGraph extends GraphAdaptor<E extends Edge> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - graph
```
Graph<E extends Edge> graph
```
    - vertexLabels
```
Indexer<T> vertexLabels
```
- Class edu.ucla.sspace.graph.LinkClustering extends Object implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.graph.SamplingSubgraphIterator extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - g
```
Graph<E extends Edge> g
```
      The graph whose subgraphs are being iterated
    - subgraphSize
```
int subgraphSize
```
      The size of the subgraph to return
    - vertexIter
```
Iterator<E> vertexIter
```
      An interator over the vertices of g.
    - nextSubgraphs
```
Queue<E> nextSubgraphs
```
      An internal queue of the next sequence of subgraphs to return. This queue is periodically filled through expanding the next series of subgraphs for a vertex.
    - traversalProbabilitiesAtDepth
```
double[] traversalProbabilitiesAtDepth
```
      An array of probabilities where each index i corresponds to the probability of expanding the subgraph at depth i. This array is the same size as the the number of desired vertices in the subgraph.
- Class edu.ucla.sspace.graph.SimpleDirectedEdge extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - from
```
int from
```
    - to
```
int to
```
- Class edu.ucla.sspace.graph.SimpleDirectedTypedEdge extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - from
```
int from
```
    - to
```
int to
```
    - type
```
Object type
```
- Class edu.ucla.sspace.graph.SimpleEdge extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - from
```
int from
```
    - to
```
int to
```
- Class edu.ucla.sspace.graph.SimpleGraphIterator extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - subgraphIterator
```
Iterator<E> subgraphIterator
```
      An interator over the (non-simple) subgraphs of the provided graphs.
    - next
```
Queue<E> next
```
      The next simple graphs to return. When a subgraph is analyzed, it will be converted into one more simple graphs, which are then enqueued in this queue.
- Class edu.ucla.sspace.graph.SimpleTypedEdge extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - from
```
int from
```
    - to
```
int to
```
    - type
```
Object type
```
- Class edu.ucla.sspace.graph.SimpleWeightedDirectedTypedEdge extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - from
```
int from
```
    - to
```
int to
```
    - type
```
Object type
```
    - weight
```
double weight
```
- Class edu.ucla.sspace.graph.SimpleWeightedEdge extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - from
```
int from
```
    - to
```
int to
```
    - weight
```
double weight
```
- Class edu.ucla.sspace.graph.SimpleWeightedTypedEdge extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - from
```
int from
```
    - to
```
int to
```
    - type
```
Object type
```
    - weight
```
double weight
```
- Class edu.ucla.sspace.graph.SparseDirectedEdgeSet extends AbstractSet<DirectedEdge> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - rootVertex
```
int rootVertex
```
      The vertex to which all edges in the set are connected
    - outEdges
```
IntSet outEdges
```
      The set of vertices to which this vertex has an edge
    - inEdges
```
IntSet inEdges
```
      The set of vertices that have an edge to the root vertex
- Class edu.ucla.sspace.graph.SparseDirectedGraph extends AbstractGraph<DirectedEdge,SparseDirectedEdgeSet> implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.graph.SparseDirectedTypedEdgeSet extends AbstractSet<DirectedTypedEdge<T>> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialization Methods
    - readObject
```
private void readObject(ObjectInputStream in)
                 throws IOException,
                        ClassNotFoundException
```
      Throws:
      
      IOException
      
      ClassNotFoundException
    - writeObject
```
private void writeObject(ObjectOutputStream out)
                  throws IOException
```
      Throws:
      
      IOException
  - Serialized Fields
    - rootVertex
```
int rootVertex
```
      The vertex to which all edges in the set are connected
    - inEdges
```
gnu.trove.map.hash.TIntObjectHashMap<V> inEdges
```
      A mapping from a type to the set of incoming edges
    - outEdges
```
gnu.trove.map.hash.TIntObjectHashMap<V> outEdges
```
      A mapping from a type to the set of outgoing edges
    - connected
```
gnu.trove.set.hash.TIntHashSet connected
```
      The set of vertices that are connected to the root vertex (its neighbors). Although this set could be computed by unioning the keyset of inEdges and outEdges, representing it as its own data structure offers significantly faster iteration over the set returned by SparseDirectedTypedEdgeSet.connected().
    - size
```
int size
```
      The number of edges in this set. Note that this is different than the size of connected, which doesn't include bidirectional connections.
- Class edu.ucla.sspace.graph.SparseTypedEdgeSet extends AbstractSet<TypedEdge<T>> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialization Methods
    - readObject
```
private void readObject(ObjectInputStream in)
                 throws IOException,
                        ClassNotFoundException
```
      Throws:
      
      IOException
      
      ClassNotFoundException
    - writeObject
```
private void writeObject(ObjectOutputStream out)
                  throws IOException
```
      Throws:
      
      IOException
  - Serialized Fields
    - rootVertex
```
int rootVertex
```
      The vertex to which all edges in the set are connected
    - edges
```
gnu.trove.map.hash.TIntObjectHashMap<V> edges
```
      A mapping from a type to the set of outgoing edges
    - size
```
int size
```
      The number of edges in this set.
    - setTypes
```
BitSet setTypes
```
      The types that are contained in this set;
- Class edu.ucla.sspace.graph.SparseUndirectedEdgeSet extends AbstractSet<Edge> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - rootVertex
```
int rootVertex
```
      The vertex that is connected to all the edges in this set
    - edges
```
gnu.trove.set.TIntSet edges
```
      The set of vertices to which the root vertex is connected
- Class edu.ucla.sspace.graph.SparseUndirectedGraph extends AbstractGraph<Edge,SparseUndirectedEdgeSet> implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.graph.SparseWeightedDirectedEdgeSet extends AbstractSet<WeightedEdge> implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.graph.SparseWeightedDirectedTypedEdgeSet extends AbstractSet<WeightedDirectedTypedEdge<T>> implements Serializable
  - Serialized Fields
    - rootVertex
```
int rootVertex
```
    - inEdges
```
MultiMap<K,V> inEdges
```
    - outEdges
```
MultiMap<K,V> outEdges
```
- Class edu.ucla.sspace.graph.SparseWeightedEdgeSet extends AbstractSet<WeightedEdge> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - rootVertex
```
int rootVertex
```
      The vertex that is connected to all the edges in this set
    - edges
```
gnu.trove.map.TIntDoubleMap edges
```
      The mapping from set of vertices to which the root vertex is connected to the weight associated with each connection.
- Class edu.ucla.sspace.graph.SparseWeightedGraph extends AbstractGraph<WeightedEdge,SparseWeightedEdgeSet> implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.graph.SubgraphIterator extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - g
```
Graph<E extends Edge> g
```
      The graph whose subgraphs are being iterated
    - subgraphSize
```
int subgraphSize
```
      The size of the subgraph to return
    - vertexIter
```
IntIterator vertexIter
```
      An interator over the vertices of g, which are each used to a seed to generate sequences of subgraphs
    - ext
```
edu.ucla.sspace.graph.SubgraphIterator.Extension ext
```
      The current pseudo-iterator for all the subgraphs that can be generated from a particular vertex
    - next
```
Graph<E extends Edge> next
```
      The next subgraph to return or null if no further subgraphs remain
- Class edu.ucla.sspace.graph.UndirectedMultigraph extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - typeCounts
```
gnu.trove.map.TObjectIntMap<K> typeCounts
```
      The count of the type distribution for all edges in the graph.
    - vertexToEdges
```
gnu.trove.map.TIntObjectMap<V> vertexToEdges
```
      The set of vertices in this mutligraph. This set is maintained independently of the vertex sets in the type-specific edge graphs to provide a fast, type independent state of which vertices are in the graph.
    - subgraphs
```
Collection<E> subgraphs
```
      A collection of all the subgraphs that have been returned from this graph. This collection is necessary to inform subgraphs of any vertex changes (removals) to this graph without requiring them to constantly check for updates. We use a WeakReference in order to keep track of the canonical Subgraph instance while ensuring that it is garbage collected when it is no longer referred to (which would never happen if this list contained strong references).
    - size
```
int size
```
      The number of edges contained in this graph.
- Class edu.ucla.sspace.graph.WeightedDirectedMultigraph extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - typeCounts
```
gnu.trove.map.TObjectIntMap<K> typeCounts
```
      The count of the type distribution for all edges in the graph.
    - vertexToEdges
```
gnu.trove.map.TIntObjectMap<V> vertexToEdges
```
      The set of vertices in this mutligraph. This set is maintained independently of the vertex sets in the type-specific edge graphs to provide a fast, type independent state of which vertices are in the graph.
    - subgraphs
```
Collection<E> subgraphs
```
      A collection of all the subgraphs that have been returned from this graph. This collection is necessary to inform subgraphs of any vertex changes (removals) to this graph without requiring them to constantly check for updates. We use a WeakReference in order to keep track of the canonical Subgraph instance while ensuring that it is garbage collected when it is no longer referred to (which would never happen if this list contained strong references).
    - size
```
int size
```
      The number of edges contained in this graph.
- Class edu.ucla.sspace.graph.WeightedLinkClustering extends LinkClustering implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - vertexToWeightVector
```
gnu.trove.map.TIntObjectMap<V> vertexToWeightVector
```
    - keepWeightVectors
```
boolean keepWeightVectors
```
Package edu.ucla.sspace.graph.isomorphism
- Class edu.ucla.sspace.graph.isomorphism.IsomorphicGraphCounter extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - isoTest
```
IsomorphismTester isoTest
```
      The isomorphism tester used to find graph equality
    - orderAndSizeToGraphs
```
Map<K,V> orderAndSizeToGraphs
```
    - sum
```
int sum
```
    - allowNewMotifs
```
boolean allowNewMotifs
```
- Class edu.ucla.sspace.graph.isomorphism.IsomorphicSet extends AbstractSet<G extends Graph<? extends Edge>> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - graphs
```
List<E> graphs
```
      The list of graphis in this set. Note that this is a list and not a set, since this class relies on isomorphism for equality, rather than object equivalence.
    - tester
```
IsomorphismTester tester
```
      The tester used to measure isomorphism
- Class edu.ucla.sspace.graph.isomorphism.TypedIsomorphicGraphCounter extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - isoTest
```
IsomorphismTester isoTest
```
      The isomorphism tester used to find multigraph equality
    - typesToGraphs
```
Map<K,V> typesToGraphs
```
    - sum
```
int sum
```
    - allowNewMotifs
```
boolean allowNewMotifs
```
- Class edu.ucla.sspace.graph.isomorphism.TypedIsomorphicGraphIndexer extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - isoTest
```
IsomorphismTester isoTest
```
      The isomorphism tester used to find multigraph equality
    - graphIndices
```
Map<K,V> graphIndices
```
Package edu.ucla.sspace.gws
- Class edu.ucla.sspace.gws.GenericWordSpace extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - wordToSemantics
```
Map<K,V> wordToSemantics
```
      A mapping from each word to the vector the represents its semantics
    - windowSize
```
int windowSize
```
      The number of words to view before and after each focus word in a window.
    - semanticFilter
```
Set<E> semanticFilter
```
      An optional set of words that restricts the set of semantic vectors that this instance will retain.
    - basisMapping
```
BasisMapping<T,E> basisMapping
```
      A mapping from a word an position to a specific dimension. Note that if word ordering is not being used, the dimension information is expected to do nothing.
- Class edu.ucla.sspace.gws.WordBasisMapping extends AbstractBasisMapping<Duple<String,Integer>,String> implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.gws.WordOrderBasisMapping extends AbstractBasisMapping<Duple<String,Integer>,String> implements Serializable
  
  serialVersionUID:
  
  1L
Package edu.ucla.sspace.index
- Class edu.ucla.sspace.index.DefaultPermutationFunction extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - permutationToReordering
```
gnu.trove.map.TIntObjectMap<V> permutationToReordering
```
      A mapping from a distance to a corresponding permutation.
- Class edu.ucla.sspace.index.GaussianVectorGenerator extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - stdev
```
double stdev
```
      The standard deviation used for generating a new index vector for terms.
    - indexVectorLength
```
int indexVectorLength
```
    - mean
```
double mean
```
      The mean used each element in an generated Vector.
    - randomGenerator
```
Random randomGenerator
```
      A random number generator which produces values for index vectors.
- Class edu.ucla.sspace.index.RandomIndexVectorGenerator extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - numVectorValues
```
int numVectorValues
```
      The number of values to set in an TernaryVector.
    - variance
```
int variance
```
      The variance in the number of values that are set in an TernaryVector.
    - indexVectorLength
```
int indexVectorLength
```
- Class edu.ucla.sspace.index.RandomOrthogonalVectorGenerator extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - mean
```
double mean
```
      The mean of random values to generate.
    - std
```
double std
```
      The std in the number of values that are set in an DoubleVector
    - vectorLength
```
int vectorLength
```
      The length for each vector to generate. This also limits the number of vectors that can be generated.
    - generatedVectors
```
List<E> generatedVectors
```
      The list of orthogonal vectors already generated by this generator.
- Class edu.ucla.sspace.index.TernaryPermutationFunction extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - permutationToReordering
```
Map<K,V> permutationToReordering
```
      A mapping from a distance to a corresponding permutation.
Package edu.ucla.sspace.matrix
- Class edu.ucla.sspace.matrix.MatrixIOException extends IOException implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.matrix.SparseSymmetricMatrix extends AbstractMatrix implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - backing
```
SparseMatrix backing
```
- Class edu.ucla.sspace.matrix.SvdlibDenseBinaryFileIterator extends Object implements Serializable
- Class edu.ucla.sspace.matrix.SvdlibDenseTextFileIterator extends Object implements Serializable
- Class edu.ucla.sspace.matrix.SymmetricMatrix extends AbstractMatrix implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - values
```
double[][] values
```
    - rows
```
int rows
```
    - columns
```
int columns
```
Package edu.ucla.sspace.svs
- Class edu.ucla.sspace.svs.AdditionCombinor extends Object implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.svs.PointWiseCombinor extends Object implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.svs.SelectionalPreference extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - lemmaVector
```
SparseDoubleVector lemmaVector
```
    - selPreferences
```
Map<K,V> selPreferences
```
    - inverseSelPreferences
```
Map<K,V> inverseSelPreferences
```
    - combinor
```
VectorCombinor combinor
```
- Class edu.ucla.sspace.svs.StructuredVectorSpace extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - termBasis
```
StringBasisMapping termBasis
```
      A mapping from terms to dimensions in a co-occcurence space.
    - preferenceVectors
```
Map<K,V> preferenceVectors
```
      A mapping from terms to their lemma co-occurrence vectors. These vectors simply represent the number of times other words have occurrend with the key word using any relation link with a distance of one relation.
    - combinor
```
VectorCombinor combinor
```
      The VectorCombinor responsible for merging features between two SparseDoubleVectors. This is used when computing the relational preference vectors for each word and for computing the contextualized vectors.
Package edu.ucla.sspace.text
- Class edu.ucla.sspace.text.TermAssociationFinder extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - termCounts
```
Counter<T> termCounts
```
    - bigramCounts
```
Counter<T> bigramCounts
```
    - contexts
```
int contexts
```
    - test
```
SignificanceTest test
```
    - leftTerms
```
Set<E> leftTerms
```
    - rightTerms
```
Set<E> rightTerms
```
      The set of terms that may appear with of the focus term
Package edu.ucla.sspace.tools
- Class edu.ucla.sspace.tools.SemEval2010Cleaner extends Object implements Serializable
- Class edu.ucla.sspace.tools.SenseEvalCleaner extends Object implements Serializable
Package edu.ucla.sspace.util
- Class edu.ucla.sspace.util.ArrayMap extends AbstractMap<Integer,T> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - array
```
Object[] array
```
    - size
```
int size
```
      The number of mappings in this Map or -1 if the number of mappings has yet to be calculated. The latter condition occurs when an array is initially passed in and hasn't been checked for null elements, which are considered non-existant mappings.
- Class edu.ucla.sspace.util.BoundedCache extends LinkedHashMap<K,V> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - maxSize
```
int maxSize
```
      The maximum number of elements to retain in the map
- Class edu.ucla.sspace.util.BoundedSortedMap extends TreeMap<K,V> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - bound
```
int bound
```
      The maximum number of mappings to retain.
- Class edu.ucla.sspace.util.BoundedSortedMultiMap extends TreeMultiMap<K,V> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - bound
```
int bound
```
      The maximum number of keys or values to key, depending on how the bound is applied.
    - isKeyBound
```
boolean isKeyBound
```
      true if the bound should apply to the number of keys, or false if the number of value
    - isFair
```
boolean isFair
```
      If the map is value bound, true if the map should pick a random mapping to remove, which ensures fairness, rather than an arbitrary mapping.
- Class edu.ucla.sspace.util.CharMap extends AbstractMap<Character,V> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - keyIndices
```
char[] keyIndices
```
      The keys stored in this map, in sorted order. The index at which a key is found corresponds to the index at which its value is found.
    - values
```
Object[] values
```
      The values stored in this map.
- Class edu.ucla.sspace.util.CombinedSet extends AbstractSet<T> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - sets
```
List<E> sets
```
      The sets that back this set combination
- Class edu.ucla.sspace.util.DisjointSets extends AbstractSet<T> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - sets
```
List<E> sets
```
      The disjoint sets that back this view.
- Class edu.ucla.sspace.util.Duple extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - x
```
Object x
```
    - y
```
Object y
```
- Class edu.ucla.sspace.util.GeneratorMap extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - generator
```
Generator<T> generator
```
      The Generator for generating new map values.
    - termToItem
```
Map<K,V> termToItem
```
      A mapping from terms to their instance
- Class edu.ucla.sspace.util.GrowableArrayList extends ArrayList<E> implements Serializable
  
  serialVersionUID:
  
  1L
- Class edu.ucla.sspace.util.HashBiMap extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialization Methods
    - readObject
```
private void readObject(ObjectInputStream in)
                 throws IOException,
                        ClassNotFoundException
```
      Throws:
      
      IOException
      
      ClassNotFoundException
    - writeObject
```
private void writeObject(ObjectOutputStream out)
                  throws IOException
```
      Throws:
      
      IOException
  - Serialized Fields
    - originalMap
```
Map<K,V> originalMap
```
      The original mapping.
    - reverseMap
```
Map<K,V> reverseMap
```
      An inverse mapping from values to keys.
- Class edu.ucla.sspace.util.HashIndexer extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - indices
```
gnu.trove.map.hash.TObjectIntHashMap<K> indices
```
      A mapping from each item to its index.
- Class edu.ucla.sspace.util.HashMultiMap extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - map
```
Map<K,V> map
```
      The backing map instance
    - range
```
int range
```
      The number of values mapped to keys
- Class edu.ucla.sspace.util.IndexedCounter extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - objectIndices
```
Indexer<T> objectIndices
```
      A mapping from an object to the number of times it has been seen
    - indexToCount
```
gnu.trove.map.TIntIntMap indexToCount
```
      The mapping from object indices to their counts
    - allowNewIndices
```
boolean allowNewIndices
```
      A flag for whether to add objects that aren't mapped to indices to the objectIndices Indexer.
    - sum
```
int sum
```
      The total number of objects that have been counted
- Class edu.ucla.sspace.util.IteratorDecorator extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - iter
```
Iterator<E> iter
```
      The backing iterator
    - cur
```
Object cur
```
      The element that was just returned or null if no elements have been returned yet or if the current element was removed via IteratorDecorator.remove().
- Class edu.ucla.sspace.util.ObjectCounter extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - counts
```
gnu.trove.map.TObjectIntMap<K> counts
```
      A mapping from an object to the number of times it has been seen
    - sum
```
int sum
```
      The total number of objects that have been counted
- Class edu.ucla.sspace.util.ObjectIndexer extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - indices
```
BiMap<K,V> indices
```
      A mapping from each item to its index.
- Class edu.ucla.sspace.util.OpenIntSet extends AbstractSet<Integer> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - buckets
```
int[] buckets
```
      The buckets that store the non-negative values in this set.
    - isEmptyMarkerValuePresent
```
boolean isEmptyMarkerValuePresent
```
      True if a value equal to the EMPTY_MARKER has been stored in this set.
    - isDeletedMarkerValuePresent
```
boolean isDeletedMarkerValuePresent
```
      True if a value equal to the DELETED_MARKER has been stored in this set.
    - size
```
int size
```
      The number of elements in this set
- Class edu.ucla.sspace.util.Pair extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - x
```
Object x
```
      The first object in the pair
    - y
```
Object y
```
      The second object in the pair
- Class edu.ucla.sspace.util.PairCounter extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - counts
```
gnu.trove.map.TLongIntMap counts
```
      A mapping from the concatenated IDs of the pair's objects to the number of times that pair has been seen
    - elementIndices
```
Indexer<T> elementIndices
```
      A mapping from each element of a pair to the a corresponding index. This indexing scheme avoids mapping each Pair instance to an index, and instead maps the concatenation of the pair's elements' IDs to a count, which minizes the space required.
    - sum
```
int sum
```
      The total number of objects that have been counted
- Class edu.ucla.sspace.util.PartitioningNearestNeighborFinder extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialization Methods
    - readObject
```
private void readObject(ObjectInputStream ois)
                 throws ClassNotFoundException,
                        IOException
```
      Deserializes this finder, restarting the work queue as necessary.
      
      Throws:
      
      ClassNotFoundException
      
      IOException
    - writeObject
```
private void writeObject(ObjectOutputStream out)
                  throws IOException
```
      Writes the state of the finder to the stream, handling the case where the backing SemanticSpace is not serializable.
      
      Throws:
      
      IOException
  - Serialized Fields
    - principleVectorToNearestTerms
```
MultiMap<K,V> principleVectorToNearestTerms
```
      A mapping from principle vector to the terms that are closest to it
- Class edu.ucla.sspace.util.SetDecorator extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - set
```
Set<E> set
```
- Class edu.ucla.sspace.util.SparseDoubleArray extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - maxLength
```
int maxLength
```
      The maximum length of this array
    - indices
```
int[] indices
```
      A list of all the non-zero indices
    - values
```
double[] values
```
      A list of all the values that correspond to the indices in the indices array.
- Class edu.ucla.sspace.util.SparseHashArray extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - maxLength
```
int maxLength
```
      The maximum length of this array
    - indexToValue
```
Map<K,V> indexToValue
```
      A mapping from an array index to its value
    - indices
```
int[] indices
```
      A memoized array of the non-zero indices that is only set after a call to SparseHashArray.getElementIndices() and is set back to null if any mutating operation occur subsequently.
- Class edu.ucla.sspace.util.SparseIntArray extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - maxLength
```
int maxLength
```
      The maximum length of this array
    - indices
```
int[] indices
```
      A list of all the non-zero indices
    - values
```
int[] values
```
      A list of all the values that correspond to the indices in the indices array.
- Class edu.ucla.sspace.util.SparseIntHashArray extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - maxLength
```
int maxLength
```
      The maximum length of this array
    - indexToValue
```
Map<K,V> indexToValue
```
      A mapping from an array index to its value
- Class edu.ucla.sspace.util.SparseLongArray extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - maxLength
```
int maxLength
```
      The maximum length of this array
    - indices
```
int[] indices
```
      A list of all the non-zero indices
    - values
```
long[] values
```
      A list of all the values that correspond to the indices in the indices array.
- Class edu.ucla.sspace.util.TreeMultiMap extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - map
```
SortedMap<K,V> map
```
      The backing map instance
    - range
```
int range
```
      The number of values mapped to keys
    - recalculateRange
```
boolean recalculateRange
```
      Whether the current range needs to be recalcuated before the next TreeMultiMap.range() call can return the correct result. An invalid range is the result of a submap being created.
    - parent
```
TreeMultiMap<K,V> parent
```
      The super-map of this instance if it is a sub map, or null if this is the original map.
- Class edu.ucla.sspace.util.TrieMap extends AbstractMap<String,V> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - rootNode
```
edu.ucla.sspace.util.TrieMap.RootNode<V> rootNode
```
      The root node of this trie
    - size
```
int size
```
      The size of this trie
Package edu.ucla.sspace.util.primitive
- Class edu.ucla.sspace.util.primitive.CompactIntSet extends AbstractIntSet implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - bitSet
```
BitSet bitSet
```
      The bitset that contains the non-negative intergers in this set (include 0).
- Class edu.ucla.sspace.util.primitive.TroveIntSet extends AbstractIntSet implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - set
```
gnu.trove.set.TIntSet set
```
      The backing set for this instance
Package edu.ucla.sspace.vector
- Class edu.ucla.sspace.vector.AmortizedSparseVector extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - values
```
List<E> values
```
      An arraylist of non zero values for this row, stored in the correct delta order.
    - comp
```
edu.ucla.sspace.vector.AmortizedSparseVector.CellComparator comp
```
      The comparator for a IndexValue.
    - maxLength
```
int maxLength
```
      The maximum length this vector can take on.
    - knownLength
```
int knownLength
```
      The maximum known length of this vector.
- Class edu.ucla.sspace.vector.AtomicSparseVector extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - vector
```
SparseDoubleVector vector
```
      The original SparseDoubleVector that this AtomicSparseVector decorates.
    - readLock
```
Lock readLock
```
      Read lock for non-mutating access to the backing vector.
    - writeLock
```
Lock writeLock
```
      Write lock for mutating access to the backing vector.
- Class edu.ucla.sspace.vector.AtomicVector extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - vector
```
DoubleVector vector
```
      The original Vector that this AtomicVector decorates.
    - readLock
```
Lock readLock
```
      Read lock for non-mutating access to the backing vector.
    - writeLock
```
Lock writeLock
```
      Write lock for mutating access to the backing vector.
- Class edu.ucla.sspace.vector.CompactSparseIntegerVector extends AbstractIntegerVector implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - intArray
```
SparseIntArray intArray
```
      The sparse array whose data backs this vector
    - magnitude
```
double magnitude
```
      The magnitude of the vector or -1 if the value is currently invalid needs to be recomputed
- Class edu.ucla.sspace.vector.CompactSparseVector extends AbstractDoubleVector implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - vector
```
SparseDoubleArray vector
```
      The SparseDoubleArray which provides most of the functionality in this class.
    - magnitude
```
double magnitude
```
      The magnitude of the vector or -1 if the value is currently invalid and needs to be recomputed.
- Class edu.ucla.sspace.vector.DenseDynamicMagnitudeVector extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - vector
```
double[] vector
```
      The values of this DenseDynamicMagnitudeVector.
    - magnitude
```
double magnitude
```
      The magnitude of the vector or -1 if the value is currently invalid and needs to be recomputed
- Class edu.ucla.sspace.vector.DenseIntVector extends AbstractIntegerVector implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - vector
```
int[] vector
```
      The array that contains the values of this vector
- Class edu.ucla.sspace.vector.DenseVector extends AbstractDoubleVector implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - vector
```
double[] vector
```
      The values of this DenseVector.
    - magnitude
```
double magnitude
```
      The magnitude of the vector or -1 if the value is currently invalid and needs to be recomputed
- Class edu.ucla.sspace.vector.MaskedDoubleVectorView extends edu.ucla.sspace.vector.VectorView<Double> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - doubleVector
```
DoubleVector doubleVector
```
      A DoubleVector reference to the backing vector
    - columnMask
```
int[] columnMask
```
      The mapping from new indices to old indices.
    - updated
```
boolean updated
```
      Set to true whenever the vector's values have been modified.
- Class edu.ucla.sspace.vector.MaskedSparseDoubleVectorView extends MaskedDoubleVectorView implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - sparseVector
```
SparseVector<T extends Number> sparseVector
```
      A SparseVector reference to the DoubleVector data backing this view.
    - reverseColumnMask
```
Map<K,V> reverseColumnMask
```
      The mapping from new indices to old indices.
    - nonZeroIndices
```
int[] nonZeroIndices
```
      A cache of the non zero indices for this masked sparse vector. This will be updated anytime MaskedSparseDoubleVectorView.getNonZeroIndices() is called and some value has been modified in the base vector.
- Class edu.ucla.sspace.vector.SparseHashDoubleVector extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - vector
```
gnu.trove.map.hash.TIntDoubleHashMap vector
```
    - nonZeroIndices
```
int[] nonZeroIndices
```
    - maxLength
```
int maxLength
```
    - magnitude
```
double magnitude
```
- Class edu.ucla.sspace.vector.SparseHashIntegerVector extends AbstractIntegerVector implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - map
```
gnu.trove.map.TIntIntMap map
```
    - length
```
int length
```
- Class edu.ucla.sspace.vector.SparseHashVector extends AbstractVector<T extends Number> implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - vector
```
SparseHashArray<T> vector
```
      The backing array that holds the vector values
    - magnitude
```
double magnitude
```
      The magnitude of the vector or -1 if the value is currently invalid needs to be recomputed
- Class edu.ucla.sspace.vector.TernaryVector extends Object implements Serializable
  
  serialVersionUID:
  
  1L
  - Serialized Fields
    - positiveDimensions
```
int[] positiveDimensions
```
      The indices which are all set to +1.
    - negativeDimensions
```
int[] negativeDimensions
```
      The indices which are all set to -1.
    - length
```
int length
```
      The length of the created FixedTernaryVector.
- Class edu.ucla.sspace.vector.ViewIntegerAsIntegerSparseView extends Object implements Serializable

Serialized Form

Package edu.ucla.sspace.basis

Class edu.ucla.sspace.basis.AbstractBasisMapping extends Object implements Serializable

Serialized Fields

mapping

readOnly

Class edu.ucla.sspace.basis.StringBasisMapping extends AbstractBasisMapping<String,String> implements Serializable

Package edu.ucla.sspace.clustering

Class edu.ucla.sspace.clustering.LinkClustering extends Object implements Serializable

Serialized Fields

workQueue

mergeOrder

edgeList

numRows

Class edu.ucla.sspace.clustering.Merge extends Object implements Serializable

Serialized Fields

remainingCluster

mergedCluster

similarity

Package edu.ucla.sspace.common

Class edu.ucla.sspace.common.VectorMapSemanticSpace extends Object implements Serializable

Serialized Fields

wordSpace

dimensions

spaceName

Package edu.ucla.sspace.dependency

Class edu.ucla.sspace.dependency.DefaultDependencyPermutationFunction extends Object implements Serializable

Serialized Fields

permFunc

Class edu.ucla.sspace.dependency.RelationPermutationFunction extends Object implements Serializable

Serialized Fields

permFunc

Class edu.ucla.sspace.dependency.RelationSumPermutationFunction extends Object implements Serializable

Serialized Fields

permFunc

Package edu.ucla.sspace.dv

Class edu.ucla.sspace.dv.RelationBasedBasisMapping extends AbstractBasisMapping<DependencyPath,String> implements Serializable

Class edu.ucla.sspace.dv.WordBasedBasisMapping extends AbstractBasisMapping<DependencyPath,String> implements Serializable

Package edu.ucla.sspace.graph

Class edu.ucla.sspace.graph.AbstractGraph extends Object implements Serializable

Serialized Fields

numEdges

vertexToEdges

subgraphs

Class edu.ucla.sspace.graph.BetweennessCentrality extends Object implements Serializable

Class edu.ucla.sspace.graph.ChineseWhispersClustering extends Object implements Serializable

Class edu.ucla.sspace.graph.DirectedMultigraph extends Object implements Serializable

Serialized Fields

typeCounts

vertexToEdges

subgraphs

size

Class edu.ucla.sspace.graph.GenericEdgeSet extends AbstractSet<T extends Edge> implements Serializable

Serialized Fields

rootVertex

vertexToEdges

Class edu.ucla.sspace.graph.GenericGraph extends AbstractGraph<T extends Edge,GenericEdgeSet<T extends Edge>> implements Serializable

Class edu.ucla.sspace.graph.GraphConstructionException extends RuntimeException implements Serializable

Class edu.ucla.sspace.graph.LabeledEdge extends Object implements Serializable

Serialized Fields

from

to

fromLabel

toLabel

Class edu.ucla.sspace.graph.LabeledGraph extends GraphAdaptor<E extends Edge> implements Serializable

Serialized Fields

graph

vertexLabels

Class edu.ucla.sspace.graph.LinkClustering extends Object implements Serializable

Class edu.ucla.sspace.graph.SamplingSubgraphIterator extends Object implements Serializable

Serialized Fields

g

subgraphSize

vertexIter

nextSubgraphs

traversalProbabilitiesAtDepth

Class edu.ucla.sspace.graph.SimpleDirectedEdge extends Object implements Serializable

Serialized Fields

from

to