0.0
No release in over a year
Use String#levenshtein(other_str) to get the levenshtein distance between 2 strings. Useful for measuring approximate string similarity, and fuzzy matching.
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
 Dependencies

Development

 Project Readme

String#levenshtein

Gem Version

A performant Ruby gem for getting the levenshtein distance between 2 strings, with the leg work done in Crystal.

Installation:

System Requirements

  • crystal
  • MacOS (untested in Linux)
# Gemfile
gem "levenshtein_str"

then

bundle install

Usage:

# app.rb
require 'levenshtein_str'

puts "hello".levenshtein("world")

then

ruby app.rb # => 4

Benchmarks

A pure Ruby implementation vs this crystal gem. See ./benchmark file for full details. Run them with

./benchmark

Note it takes a while to run the full set, especially the memory ones.

Iterations Per Second

  • "" and "" Same-ish, often Ruby ~1.08x quicker (no type conversion overheads)
  • "abd" and "abc" Crystal ~2x quicker
  • "abcdefghi" and "0123456789" Crystal ~2.25x quicker
  • [whole alphabet] vs "012345" Crystal ~2.37x quicker

Memory

  • "" and "" Same
  • "abd" and "abc" Ruby 25.2x more
  • "abcdefghi" and "0123456789" Ruby 141.5x more
  • [whole alphabet] vs "012345" Ruby 212x more

See ./benchmark file for full detailed results.

Template

Based on this template for writing Ruby gems in Crystal.

Contributions && Testing

Testing for now can just be done using Ruby:

rspec

Contributions are welcome.

License

MIT