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

A more complex Levenshtein distance would be useful

    XMLWordPrintableJSON

    Details

    • Type: New Feature
    • Status: Closed
    • Priority: Major
    • Resolution: Won't Fix
    • Affects Version/s: 3.0
    • Fix Version/s: Review Patch
    • Component/s: lang.*
    • Labels:
      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

            Activity

              People

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

                Dates

                • Created:
                  Updated:
                  Resolved: