Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/dwbutler/levenshtein-jruby
Levenshtein gem that runs in JRuby
https://github.com/dwbutler/levenshtein-jruby
Last synced: about 2 months ago
JSON representation
Levenshtein gem that runs in JRuby
- Host: GitHub
- URL: https://github.com/dwbutler/levenshtein-jruby
- Owner: dwbutler
- License: mit
- Created: 2013-11-19T19:34:47.000Z (about 11 years ago)
- Default Branch: master
- Last Pushed: 2013-11-19T20:33:43.000Z (about 11 years ago)
- Last Synced: 2024-10-27T22:46:14.098Z (3 months ago)
- Language: Ruby
- Size: 402 KB
- Stars: 0
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE.txt
Awesome Lists containing this project
README
# Levenshtein (JRuby)
[![Build Status](https://travis-ci.org/dwbutler/levenshtein-jruby.png)](https://travis-ci.org/dwbutler/levenshtein-jruby)Calculates the Levenshtein distance between two strings. Uses the
[Apache Commons](http://commons.apache.org/proper/commons-lang/apidocs/org/apache/commons/lang3/StringUtils.html#getLevenshteinDistance\(java.lang.CharSequence, java.lang.CharSequence\)) Java implementation.## Installation
Add this line to your application's Gemfile:
gem 'levenshtein-jruby'
And then execute:
$ bundle
Or install it yourself as:
$ gem install levenshtein-jruby
## Usage
```ruby
require 'levenshtein'# Basic usage
Levenshtein.distance("string1", "string2") # => 1# With threshold
Levenshtein.distance("string1", "String2", 2) # => 2
```## Contributing
1. Fork it
2. Create your feature branch (`git checkout -b my-new-feature`)
3. Commit your changes (`git commit -am 'Add some feature'`)
4. Push to the branch (`git push origin my-new-feature`)
5. Create new Pull Request