DownloadA 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
Categories
Test and MeasurementLicense
GNU General Public License version 3.0 (GPLv3)Follow Extended Levenshtein algorithm
Other Useful Business Software
Easily engage and manage non-desk employees with Connecteam’s mobile-first platform that helps improve communication, enhance daily processes and increase productivity with custom checklists, forms, and reports.
Schedule shifts and track accurate work hours with Connecteam’s automated GPS time clock and easily export approved timesheets to payroll. Connecteam helps you keep your employees sharp thanks to knowledge base centers and advanced training courses. Raise morale with employee recognition rewards and keep the entire company updated through the main news feed.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Extended Levenshtein algorithm!