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 >

License

GNU General Public License version 3.0 (GPLv3)

Follow Extended Levenshtein algorithm

Extended Levenshtein algorithm Web Site

Other Useful Business Software
$300 Free Credits for Your Google Cloud Projects Icon
$300 Free Credits for Your Google Cloud Projects

Start building on Google Cloud with $300 in free credits. No commitment, no credit card required until you're ready to scale.

Launch your next project with $300 in free Google Cloud credits—no strings attached. Test, build, and deploy without risk. Use your credits across the entire Google Cloud platform to find what works best for your needs. After your credits are used, continue with always-free tier services. Only pay when you're ready to scale. Sign up in minutes and start exploring.
Start Free Trial
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

Command-line, Console/Terminal

Programming Language

Java

Related Categories

Java Test and Measurement Software

Registered

2010-10-31