About Extended Levenshtein algorithm
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...
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
Previous Versions
Here you can find the changelog of Extended Levenshtein algorithm since it was posted on our website on 2015-04-25 03:00:00.
The latest version is and it was updated on 2024-04-22 16:04:31. See below the changes in each version.
Extended Levenshtein algorithm version files
Updated At: 2011-01-19
Changes: Several fixes and updates
Extended Levenshtein algorithm version
Updated At: 2011-01-19
Disclaimer
External Download
We do not host Extended Levenshtein algorithm on our servers. We did not scan it for viruses, adware, spyware or other type of malware. This app is hosted by the software publisher and passed their terms and conditions to be listed there. We recommend caution when installing it.
The external download link for Extended Levenshtein algorithm is provided to you by apps112.com without any warranties, representations or guarantees of any kind, so access it at your own risk.
If you have questions regarding this particular app contact the publisher directly. For questions about the functionalities of apps112.com contact us.
