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
You Might Also Like
As your users rely more and more on Cloud and Internet-based technologies, reliable internet connectivity becomes more and more important to your business. With Bigleaf’s proven SD-WAN architecture, groundbreaking AI, and DDoS attack mitigation, you can finally deliver the reliable internet connectivity your business needs without the limitations of traditional networking platforms. Bigleaf’s Cloud Access Network and plug-and-play router allow for limitless control to and from anywhere your traffic needs to go. Bigleaf’s self-driving AI automatically identifies and adapts to any changing circuit conditions and traffic needs—addressing issues before they impact your users. Bigleaf puts you in the driver’s seat of every complaint and support call with full-path traffic and network performance data, delivered as actionable insights, reports, and alerts.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Extended Levenshtein algorithm!