edits.cr Alternatives - Crystal Algorithms and Data structures

Popularity

4.1

Growing

Activity

5.2

Stars 13

Watchers 2

Forks 0

Last Commit 2 months ago

Programming language: Crystal

Tags: Algorithms And Data Structures

Latest version: v0.6.0

edits.cr alternatives and similar shards

Based on the "Algorithms and Data structures" category

crystalline

9.2 0.3 edits.cr VS crystalline

A collection of containers and algorithms
radix

8.7 0.0 edits.cr VS radix

Radix Tree implementation
CrOTP

7.5 4.2 edits.cr VS CrOTP

HOTP and TOTP implementation for two factor authentication
crystalg

6.4 7.9 edits.cr VS crystalg

A Generic Algorithm Library
crystaledge

6.2 1.2 edits.cr VS crystaledge

A pure Vector Math library
bitfields

5.6 1.2 edits.cr VS bitfields

Pure Crystal implementation of BitFields. Handles encoding/decoding of bytes.
fzy

5.1 6.3 edits.cr VS fzy

A Crystal port of awesome Fzy project fuzzy finder algorithm
text

4.9 0.0 edits.cr VS text

A collection of phonetic algorithms
markov

4.7 0.0 edits.cr VS markov

Build Markov Chains and run Markov Processes
delimiter_tree

4.2 0.0 edits.cr VS delimiter_tree

A tree structure that is built using a delimiter
blurhash.cr

4.1 4.6 edits.cr VS blurhash.cr

BlurHash implementation
murmur3

4.1 0.0 edits.cr VS murmur3

Implementation of Murmur3 hash algorithm used by Cassandra
crystal-linked-list

4.1 2.6 edits.cr VS crystal-linked-list

Implementation of Linked List
graphlb

3.8 1.3 edits.cr VS graphlb

Collection of graph datastructure and algorithms
kd_tree

3.7 4.6 edits.cr VS kd_tree

An implementation of "K-Dimensional Tree" and "N-Nearest Neighbors"
haversine

3.6 4.2 edits.cr VS haversine

An Implementation of the Haversine formula
ksuid.cr

3.4 2.7 edits.cr VS ksuid.cr

K-Sortable Globally Unique IDs
ternary_search_tree

3.0 0.0 edits.cr VS ternary_search_tree

Ternary Search Tree
miller_rabin

3.0 0.0 edits.cr VS miller_rabin

Implements Miller-Rabin algorithm to check if a number is prime
bisect

2.9 0.5 edits.cr VS bisect

Inserting values into a sorted array
hash_ring

2.7 0.0 edits.cr VS hash_ring

An Implementation of Consistent Hash Ring
aho_corasick

2.5 0.0 edits.cr VS aho_corasick

AhoCorasick algorithm
ranger

2.5 0.0 edits.cr VS ranger

Range object operation library
crie

2.5 2.0 edits.cr VS crie

Compile-time Trie
heap.cr

1.8 0.0 edits.cr VS heap.cr

Implementation of heap data structure
primes

1.8 0.0 edits.cr VS primes

Library for testing if a number is prime and finding its prime factorization
multiset.cr

1.2 3.1 edits.cr VS multiset.cr

Implementation of a multiset

Do you think we are missing an alternative of edits.cr or a related project?

Add another 'Algorithms and Data structures' Shard

Popular Comparisons

README

edits

A collection of edit distance algorithms in Crystal.

Includes Levenshtein, Restricted Edit (Optimal Alignment) and Damerau-Levenshtein distances, and Jaro and Jaro-Winkler similarity.

Installation

Add this to your application's shard.yml:

dependencies:
  edits:
    github: tcrouch/edits.cr

Usage

require "edits"

Levenshtein

Edit distance, taking into account deletion, addition and substitution.

Edits::Levenshtein.distance "raked", "bakers"
# => 3
Edits::Levenshtein.distance "iota", "atom"
# => 4
Edits::Levenshtein.distance "acer", "earn"
# => 4

# Max distance
Edits::Levenshtein.distance "iota", "atom", 2
# => 2
Edits::Levenshtein.most_similar "atom", ["atlas", "tram", "rota", "racer"]
# => "atlas"

Restricted Edit (Optimal Alignment)

Edit distance, accounting for deletion, addition, substitution and transposition (two adjacent characters are swapped). This variant is restricted by the condition that no sub-string is edited more than once.

Edits::RestrictedEdit.distance "raked", "bakers"
# => 3
Edits::RestrictedEdit.distance "iota", "atom"
# => 3
Edits::RestrictedEdit.distance "acer", "earn"
# => 4

# Max distance
Edits::RestrictedEdit.distance "iota", "atom", 2
# => 2
Edits::RestrictedEdit.most_similar "atom", ["iota", "tome", "mown", "tame"]
# => "tome"

Damerau-Levenshtein

Edit distance, accounting for deletions, additions, substitution and transposition (two adjacent characters are swapped).

Edits::DamerauLevenshtein.distance "raked", "bakers"
# => 3
Edits::DamerauLevenshtein.distance "iota", "atom"
# => 3
Edits::DamerauLevenshtein.distance "acer", "earn"
# => 3

Jaro & Jaro-Winkler

Edits::Jaro.similarity "information", "informant"
# => 0.90235690235690236
Edits::Jaro.distance "information", "informant"
# => 0.097643097643097643

Edits::JaroWinkler.similarity "information", "informant"
# => 0.94141414141414137
Edits::JaroWinkler.distance "information", "informant"
# => 0.05858585858585863

Contributing

Fork it
Create your feature branch (git checkout -b my-new-feature)
Commit your changes (git commit -am 'Add some feature')
Push to the branch (git push origin my-new-feature)
Create a new Pull Request

Contributors

[tcrouch] Tom Crouch - creator, maintainer

edits.cr

Collection of edit distance algorithms