A Java package that provides several computations related to the edit distance of strings. Other than the basic Levenshtein, this algorithm can rearange words when comparing. The class can also provide details of how words could be transformed.

Features

  • compares two strings
  • compares two sequences of words (word to word, with respect to the position in the sequence)
  • offers string comparison objects for long term storage and precomputation
  • gives detailed information on the transformation process
  • allows comparison of XSAMPA sequences
  • allows useage of individual phonetic mappings
  • offers many user flags that alter the transformation process
  • offers individual setting of transformation costs

Project Activity

See All Activity >

Categories

Test and Measurement

License

GNU General Public License version 3.0 (GPLv3)

Follow Extended Levenshtein algorithm

Extended Levenshtein algorithm Web Site

You Might Also Like
Red Hat Ansible Automation Platform on Microsoft Azure Icon
Red Hat Ansible Automation Platform on Microsoft Azure

Red Hat Ansible Automation Platform on Azure allows you to quickly deploy, automate, and manage resources securely and at scale.

Deploy Red Hat Ansible Automation Platform on Microsoft Azure for a strategic automation solution that allows you to orchestrate, govern and operationalize your Azure environment.
Learn More
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of Extended Levenshtein algorithm!

Additional Project Details

Languages

English

Intended Audience

Advanced End Users, Developers

User Interface

Console/Terminal, Command-line

Programming Language

Java

Related Categories

Java Test and Measurement Software

Registered

2010-10-31
Report inappropriate content