https://github.com/kseo/edit_distance

Implementation of string distance algorithms in Dart
https://github.com/kseo/edit_distance

jaccard jarowinkler levenshtein

Last synced: 10 days ago
JSON representation

Implementation of string distance algorithms in Dart

• Host: GitHub
• URL: https://github.com/kseo/edit_distance
• Owner: kseo
• License: bsd-3-clause
• Created: 2016-09-28T18:32:41.000Z (about 8 years ago)
• Default Branch: master
• Last Pushed: 2021-01-07T13:22:08.000Z (almost 4 years ago)
• Last Synced: 2024-10-11T23:22:17.912Z (26 days ago)
• Topics: jaccard, jarowinkler, levenshtein
• Language: Dart
• Homepage: https://pub.dartlang.org/packages/edit_distance
• Size: 25.4 KB
• Stars: 26
• Watchers: 3
• Forks: 12
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGELOG.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# edit_distance

[![Build Status](https://travis-ci.org/kseo/edit_distance.svg?branch=master)](https://travis-ci.org/kseo/edit_distance)

Implementation of string distance algorithms.

# Description

Edit distances algorithms for fuzzy matching. Specifically, this library provides:

* [Levenshtein distance][Levenshtein]

* [Restricted Damerau-Levenshtein distance][Damerau]

* [Longest Common Subsequence][LongestCommonSubsequence]

* [Jaro–Winkler distance][JaroWinkler]

* [Jaccard N-gram distance][Jaccard]

[Levenshtein]: https://en.wikipedia.org/wiki/Levenshtein_distance

[Damerau]: https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance

[LongestCommonSubsequence]: https://en.wikipedia.org/wiki/Longest_common_subsequence_problem

[JaroWinkler]: https://en.wikipedia.org/wiki/Jaro%E2%80%93Winkler_distance

[Jaccard]: https://en.wikipedia.org/wiki/Jaccard_index

# Examples

```dart

Levenshtein d = new Levenshtein();

print(d.distance('witch', 'kitsch')); // 2

```