Examples of programming5.strings.StringEditDistanceFunction

programming5.arrays.SubsetGenerator
Implements a family of functions for strings that finds a distance by optimizing their alignment in terms of the aggregate cost of edit operations (replacing one character for another, i.e. aligning them, and inserting or deleting characters, i.e. shifting alignment). The class implements the classical dynamic programming algorithm for finding the minimum string edit distance, and has parameterizable cost functions (using function interfaces defined in programming5.math). Currently, there are three pre-defined modes:
DEFAULT: By default, all edit operations cost one unit (1) each; the distance will thus be the total count of edit operations (e.g. "assert" and "dessert" have a distance of 2, for one insertion and one replacement). This mode is case sensitive.
ALPHABETIC_REPLACE: Reduces the cost of character replacements between alphabetic characters, relative to the inverse distance between them in the alphabet. Insertions and deletions have an average cost with respect to the distribution of replacement costs (this ensures that these operations are favored over replacements for "far" character pairs). This mode will produce distances that are not well defined for strings containing non-alphabetic characters, and is not case sensitive.
KEYBOARD_REPLACE: Reduces the cost of character replacements for pairs that are "close" in terms of their distance on the keyboard (uses the @link{programming5.strings.KeyboardCharDistanceFunction}). "Far" replacements, as well as insertions and deletions, are still given a unit (1) cost. This mode is case sensitive. @author Andres Quiroz Hernandez @version 6.9

  /**
         *Creates an empty set
         */
        public MathSet() {
    super();
    sampleOrderGen = new RandomOrderGenerator(System.currentTimeMillis());
    singleOrderGen = new RandomOrderGenerator(System.currentTimeMillis());
    viewRand = new Random(System.currentTimeMillis());
  }

View Full Code Here

        public <T extends E> MathSet(T[] array) {
    super();
    for (T elem : array) {
      this.add(elem);
    }
    sampleOrderGen = new RandomOrderGenerator(System.currentTimeMillis());
    singleOrderGen = new RandomOrderGenerator(System.currentTimeMillis());
    viewRand = new Random(System.currentTimeMillis());
  }

View Full Code Here

  /**
         *Creates a new set out of the collection elements. Any repeated elements in the collection will only be inserted once.
         */
        public MathSet(Collection<? extends E> c) {
    super(c);
    sampleOrderGen = new RandomOrderGenerator(System.currentTimeMillis());
    singleOrderGen = new RandomOrderGenerator(System.currentTimeMillis());
    viewRand = new Random(System.currentTimeMillis());
  }

View Full Code Here

  /**
         *Creates an empty set initialized to the given size
         */
        public MathSet(int size) {
    super(size);
    sampleOrderGen = new RandomOrderGenerator(System.currentTimeMillis());
    singleOrderGen = new RandomOrderGenerator(System.currentTimeMillis());
    viewRand = new Random(System.currentTimeMillis());
  }

View Full Code Here

  /**
         *Creates an empty set initialized to the given size with the given growth percentage
         */
        public MathSet(int size, float pctGrowth) {
    super(size, pctGrowth);
    sampleOrderGen = new RandomOrderGenerator(System.currentTimeMillis());
    singleOrderGen = new RandomOrderGenerator(System.currentTimeMillis());
    viewRand = new Random(System.currentTimeMillis());
  }

View Full Code Here

  /**
   *Seeds the random objects used to generate random samples to the given value. If this method is not called, the 
   *seed used is the current system time.
   */
  public void seedRandom(long seed) {
    sampleOrderGen = new RandomOrderGenerator(System.currentTimeMillis());
    singleOrderGen = new RandomOrderGenerator(System.currentTimeMillis());
    viewRand = new Random(System.currentTimeMillis());
  }

View Full Code Here

    /**
     *Creates an iterator object to randomly traverse the given collection (can be traversed cyclically, in a new order each time)
     */
    public RandomOrderIterator(Collection<T> myCollection) {
        array = myCollection.toArray();
        rog = new RandomOrderGenerator();
        rog.generate(array.length);
    }

View Full Code Here

    /**
     *Creates an iterator object to randomly traverse the given collection (can be traversed cyclically, in a new order each time) using the given seed for the random order generator
     */
    public RandomOrderIterator(Collection<T> myCollection, long seed) {
        array = myCollection.toArray();
        rog = new RandomOrderGenerator(seed);
        rog.generate(array.length);
    }

View Full Code Here

   *@return the set of all subsets of this set, except for the empty set
   */
  public MathSet<Set<E>> parts() {
    MathSet<Set<E>> result = new MathSet<Set<E>>();
    E[] elements = (E[])this.toArray();
    SubsetGenerator subsetGen = new SubsetGenerator(this.size());
    int[] subsetIndices;
    while ((subsetIndices = subsetGen.nextSet()) != null) {
      MathSet<E> subset = new MathSet<E>();
      for (int index : subsetIndices) {
        subset.add(elements[index]);
      }
      result.add(subset);

View Full Code Here

   *@return the set of all subsets of the given set, except for the empty set
   */
  public static <T> Set<Set<T>> parts(Set<T> set) {
    MathSet<Set<T>> result = new MathSet<Set<T>>();
    T[] elements = (T[])set.toArray();
    SubsetGenerator subsetGen = new SubsetGenerator(set.size());
    int[] subsetIndices;
    while ((subsetIndices = subsetGen.nextSet()) != null) {
      MathSet<T> subset = new MathSet<T>();
      for (int index : subsetIndices) {
        subset.add(elements[index]);
      }
      result.add(subset);

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of programming5.strings.StringEditDistanceFunction

programming5.arrays.ArrayOperationsTest

programming5.arrays.RandomOrderGenerator

programming5.arrays.SubsetGenerator

programming5.code.RandomIndexGenerator

programming5.code.ReplicableObject

programming5.collections.MathSet

programming5.collections.RandomOrderIterator

programming5.concurrent.BackoffTestThread

programming5.io.ArgHandler

programming5.io.ExecutionProgressEvent

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.