Libraries tagged by instance of

The LevenshteinDistance class provides a method to calculate the Levenshtein distance between two strings. The Levenshtein distance is a measure of the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one word into the other.

Go to Download

The Fuzzy Search package provides a simple and efficient way to perform fuzzy searches on a collection of texts using the Levenshtein distance algorithm. This package is useful when you need to search for texts that may contain typos or slight variations.

Go to Download

Compute phylogenetic trees from distance matrix using BioNJ algorithm. It produce Newick file and Weighted newick if needed. There is also a render using Equal-angle algorithm and SVG output for testing. It's recommended to use a JS render like 'phylotree.js' (demo of phylotree.js here http://phylotree.hyphy.org/).

Go to Download

The Official PHP library for Mintance

Go to Download