https://github.com/aosync/levenshtein

Deno module to compute the Levenshtein distance between two strings
https://github.com/aosync/levenshtein

Last synced: about 1 year ago
JSON representation

Deno module to compute the Levenshtein distance between two strings

• Host: GitHub
• URL: https://github.com/aosync/levenshtein
• Owner: aosync
• License: mit
• Created: 2020-05-15T21:31:17.000Z (about 6 years ago)
• Default Branch: master
• Last Pushed: 2020-05-20T19:33:05.000Z (about 6 years ago)
• Last Synced: 2025-04-03T09:41:35.455Z (over 1 year ago)
• Language: TypeScript
• Size: 3.91 KB
• Stars: 6
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# levenshtein

Implementation of the Wagner-Fischer algorithm to compute the Levenshtein distance between two strings.

## Usage

```typescript

import levenshtein from "https://deno.land/x/levenshtein/mod.ts";

levenshtein("kitten", "sitting"); // 3

```