Uploaded image for project: 'Commons Lang'
  1. Commons Lang
  2. LANG-591

A more complex Levenshtein distance would be useful

    XMLWordPrintableJSON

Details

    • New Feature
    • Status: Closed
    • Major
    • Resolution: Won't Fix
    • 3.0
    • Review Patch
    • lang.*
    • None

    Description

      For some applications, it is necessary to get insert/delete/substitution counts from the distance algorithm. I am attaching a patch that provides this.

      Attachments

        1. LANG-591.patch
          7 kB
          Benson Margulies

        Issue Links

          is a clone of

          Improvement - An improvement or enhancement to an existing feature or task. TEXT-10 A more complex Levenshtein distance

          • Minor - Minor loss of function, or other problem where easy workaround is present.
          • Closed

          Activity

            People

              Unassigned Unassigned
              bmargulies Benson Margulies
              Votes:
              0 Vote for this issue
              Watchers:
              2 Start watching this issue

              Dates

                Created:
                Updated:
                Resolved: