@types/fast-levenshtein

What is @types/fast-levenshtein?

@types/fast-levenshtein provides TypeScript type definitions for the fast-levenshtein package, which is a fast implementation of the Levenshtein distance algorithm. This algorithm calculates the edit distance between two strings, which is useful for applications like spell checking, DNA sequencing, and natural language processing.

What are @types/fast-levenshtein's main functionalities?

Calculate Levenshtein Distance

This feature allows you to calculate the Levenshtein distance between two strings. In this example, the distance between 'kitten' and 'sitting' is calculated to be 3.

const levenshtein = require('fast-levenshtein');
const distance = levenshtein.get('kitten', 'sitting');
console.log(distance); // Outputs: 3

Find Closest Match

This feature helps in finding the closest match to a given string from an array of strings. In this example, 'flitting' is the closest match to 'fitting' from the array ['kitten', 'sitting', 'flitting'].

const levenshtein = require('fast-levenshtein');
const words = ['kitten', 'sitting', 'flitting'];
const closest = words.reduce((a, b) => levenshtein.get('fitting', a) < levenshtein.get('fitting', b) ? a : b);
console.log(closest); // Outputs: 'flitting'

Other packages similar to @types/fast-levenshtein

levenshtein

The 'levenshtein' package is another implementation of the Levenshtein distance algorithm. It is known for its simplicity and ease of use. Compared to 'fast-levenshtein', it may not be as optimized for performance but is still a reliable choice for calculating edit distances.

js-levenshtein

The 'js-levenshtein' package is a highly optimized Levenshtein distance algorithm implementation in JavaScript. It is known for its speed and efficiency, making it a strong competitor to 'fast-levenshtein'.

README

Installation

npm install --save @types/fast-levenshtein

Summary

This package contains type definitions for fast-levenshtein (https://github.com/hiddentao/fast-levenshtein).

Details

Files were exported from https://www.github.com/DefinitelyTyped/DefinitelyTyped/tree/types-2.0/fast-levenshtein

Additional Details

• Last updated: Tue, 04 Oct 2016 17:46:23 GMT
• File structure: ProperModule
• Library Dependencies: none
• Module Dependencies: none
• Global values: none

Credits

These definitions were written by Mizunashi Mana https://github.com/mizunashi-mana.