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
Categories
Test and MeasurementFollow Extended Levenshtein algorithm
Other Useful Business Software
Verity by VRC Insurance Systems is an all-in-one policy administration system for property and casualty insurance markets. Designed to help meet the business needs of program administrators, managing general agents, and carriers, Verity helps streamline processes, and bridge the gap for the remote workforce. Core features include quoting, policy issuance, automated renewals, claims administration, ad hoc reporting, surplus lines, fiduciary accounting, agent/insured/carrier portals, task management, API access, third-party integrations, hosted and self-hosted solutions, and more. Additionally, VRC specializes in custom software development and onboarding services like training, data conversion, and system configuration that are all designed to make your transition as smooth as possible. Contact VRC today to schedule and introductory call and free demo.
Rate This Project
Login To Rate This Project
User Reviews
Be the first to post a review of Extended Levenshtein algorithm!