https://github.com/dasch/levenshtein

An Elm implementation of the Levenshtein distance algorithm.
https://github.com/dasch/levenshtein

Last synced: about 20 hours ago
JSON representation

An Elm implementation of the Levenshtein distance algorithm.

• Host: GitHub
• URL: https://github.com/dasch/levenshtein
• Owner: dasch
• License: apache-2.0
• Created: 2019-01-08T14:47:09.000Z (almost 6 years ago)
• Default Branch: master
• Last Pushed: 2021-03-29T12:18:13.000Z (almost 4 years ago)
• Last Synced: 2024-12-23T08:22:05.146Z (12 days ago)
• Language: Elm
• Size: 31.3 KB
• Stars: 4
• Watchers: 2
• Forks: 2
• Open Issues: 2
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Levenshtein

Levenshtein distance is a metric for measuring the difference between two strings. Specifically, it is the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one string into the other.

## Example

```elm

import Levenshtein

Levenshtein.distance "kitten" "sitting" --> 3

```