Class PseudoDamerauLevenshtein


  • public class PseudoDamerauLevenshtein
    extends java.lang.Object
    Pseudo-Damerau-Levenshtein (aka "Optimal String Distance") implementation which allows some non-adjacent transpositions(?) Computes the edit distance with insertions/deletions/substitutions/transpositions. Optionally the edit distance of a semi-global alignment is computed which allows the search term to be shifted free-of-cost (i.e. dist("file", "a file is")==0). Some properties are explained in the unit test, org.freeplane.features.filter.EditDistanceStringMatchingStrategiesTest. TODO: use unicode code points instead of chars !!
    • Constructor Detail

      • PseudoDamerauLevenshtein

        public PseudoDamerauLevenshtein()
    • Method Detail

      • distance

        public int distance()
      • matchProb

        public float matchProb()
      • init

        public void init​(java.lang.String searchTerm,
                         java.lang.String searchText,
                         boolean subStringMatch,
                         boolean caseSensitive)