https://github.com/oleander/levenshteinish
An average distance implementation of the Levenshtein algorithm
https://github.com/oleander/levenshteinish
Last synced: 12 months ago
JSON representation
An average distance implementation of the Levenshtein algorithm
- Host: GitHub
- URL: https://github.com/oleander/levenshteinish
- Owner: oleander
- License: mit
- Created: 2011-01-30T04:11:33.000Z (over 15 years ago)
- Default Branch: master
- Last Pushed: 2017-01-14T00:22:51.000Z (over 9 years ago)
- Last Synced: 2024-04-25T01:21:02.561Z (about 2 years ago)
- Language: Ruby
- Homepage: https://github.com/oleander/levenshteinish
- Size: 7.81 KB
- Stars: 2
- Watchers: 2
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# Levenshteinish
[](https://rubygems.org/gems/levenshteinish) [](https://travis-ci.org/oleander/levenshteinish) [](http://oleander.io)
An _average distance_ implementation of the [hintable_levenshtein](https://github.com/joshbuddy/hintable_levenshtein) gem.
## How to use
```ruby
Levenshtein.distance("first", "last") # => 0.6
```
The `distance` method returns a value between `0.0` and `1.0`, where `0.0` is spot on.
## How do install
```
[sudo] gem install levenshteinish
```
## Requirements
_Levenshteinish_ is tested on _OS X 10.6.7_ using Ruby _1.8.7_, _1.9.2_.
## License
_Levenshteinish_ is released under the _MIT license_. See `LICENSE` file for details.