wu-diff-js
Sequence comparer
Compares two sequences of characters using the Wu-Levenshtein distance algorithm to identify differences.
Compute differences between two slices using wu(the O(NP)) algorithm.
17 stars
2 watching
0 forks
Language: TypeScript
last commit: almost 2 years agoLinked from 1 awesome list
Related projects:
| Repository | Description | Stars |
|---|---|---|
| A Ruby library for generating differences between sequences using the McIlroy-Hunt LCS algorithm | 289 | |
| A pure Swift library for calculating differences between two sets of data. | 122 | |
| A Swift library for calculating differences and generating patches between collections. | 664 | |
| A comparison tool for two optimization algorithms | 66 | |
| A small library that calculates the differences between two objects with nested structures, such as arrays and objects. | 1,073 | |
| A framework for comparing and updating data in Swift applications with high performance and customizable diffing. | 123 | |
| An implementation of the Jaro-Winkler distance algorithm to compare strings | 195 | |
| An implementation of the Fletcher_16 sum computation algorithm in Ada. | 0 | |
| A Java application that displays differences between two responses using color-coded formatting. | 0 | |
| A Pure OCaml implementation of a differential file diffing algorithm | 20 | |
| An implementation of an algorithm to calculate the diff between two arrays | 241 | |
| A language and data processing framework designed to balance control, readability, and scalability with a syntax inspired by Rust. | 473 | |
| A comprehensive collection of algorithms and data structures implemented in multiple programming languages | 1,944 | |
| Tools for analyzing and processing sequence data from the Online Encyclopedia of Integer Sequences. | 46 | |
| An efficient data structure for fast insertions and queries on sequences of values | 63 |