Popularity

3.5

Declining

Activity

6.0

Stars 16

Watchers 1

Forks 0

Last Commit 3 months ago

Programming language: Crystal

License: MIT License

Tags: Algorithms And Data Structures

Latest version: v0.7.0

edits.cr alternatives and similar shards

Based on the "Algorithms and Data structures" category.
Alternatively, view edits.cr alternatives based on common mentions on social networks and blogs.

crystalline

9.1 0.0 edits.cr VS crystalline

A collection of containers & algorithms for the Crystal programming language
radix

8.7 3.6 edits.cr VS radix

Radix Tree implementation for Crystal

Scout APM: A developer's best friend. Try free for 14-days

Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.

Promo scoutapm.com

CrOTP

7.8 3.2 edits.cr VS CrOTP

CrOTP - One Time Passwords for Crystal
crystalg

6.5 3.0 edits.cr VS crystalg

Algorithm Library for Crystal
bitfields

6.0 0.0 edits.cr VS bitfields

Bit Fields for Crystal Language
crystaledge

5.9 0.0 edits.cr VS crystaledge

A pure Crystal Vector Math library
fzy

5.7 2.4 edits.cr VS fzy

A Crystal port of awesome Fzy project fuzzy finder algorithm.
graphlb

5.0 0.5 edits.cr VS graphlb

graphlb is a crystal library which contains all the graph Data-Structures and Algorithms implemented in crystal-lang.
markov

4.6 0.8 edits.cr VS markov

⛓ A Crystal library for building Markov Chains and running Markov Processes.
text

4.5 0.0 edits.cr VS text

A collection of phonetic algorithms for Crystal. Including; Porter-Stemmer, Soundex, Metaphone, Double Metaphone & White Similarity
blurhash.cr

4.4 1.2 edits.cr VS blurhash.cr

A pure Crystal implementation of BlurHash algorithm
crystal-linked-list

4.4 0.0 edits.cr VS crystal-linked-list

Simple linked list implementation in Crystal
qr-code

4.2 2.4 edits.cr VS qr-code

a QR Code implementation written in crystal lang
kd_tree

4.1 0.4 edits.cr VS kd_tree

Crystal implementation of "K-Dimensional Tree" and "N-Nearest Neighbors"
crie

4.1 2.4 edits.cr VS crie

Compile-time Trie in Crystal
haversine

4.0 0.4 edits.cr VS haversine

Crystal implementation of the Haversine formula to calculate distances between two points given their latitudes and longitudes
delimiter_tree

3.8 0.0 edits.cr VS delimiter_tree

A crystal-lang tree structure that is built using a delimiter.
ksuid.cr

3.8 0.0 edits.cr VS ksuid.cr

Crystal implementation of K-Sortable Globally Unique IDs
murmur3

3.7 0.0 edits.cr VS murmur3

Crystal implementation of Murmur3 hash algorithm used by Cassandra
ternary_search_tree

3.1 0.0 edits.cr VS ternary_search_tree

A Crystal implementation of a Ternary Search Tree
bisect

3.0 0.0 edits.cr VS bisect

Library for maintaining sorted Arrays
splay_tree_map

2.7 5.7 edits.cr VS splay_tree_map

This is a Crystal implementation of a Splay Tree; which is a type of binary search tree that is semi-balanced and that tends to self-optimize so that the most accessed items are the fastest to retrieve.
hash_ring

2.7 0.0 edits.cr VS hash_ring

Implementation of Consistent Hash Ring for Crystal
miller_rabin

2.6 0.0 edits.cr VS miller_rabin

Miller-Rabin algorithm for prime checking
ranger

2.1 0.0 edits.cr VS ranger

Range object operation in Crystal
aho_corasick

2.1 0.0 edits.cr VS aho_corasick

aho_corasick for crystal-lang
multiset.cr

1.9 5.4 edits.cr VS multiset.cr

Multiset (bag) implementation in Crystal
s2_cells

1.9 0.8 edits.cr VS s2_cells

maps latitude and longitude to S2 Cells https://s2geometry.io/
heap.cr

1.7 0.0 edits.cr VS heap.cr

data structure heap for crystal-lang
primes

1.5 0.0 edits.cr VS primes

Library for testing primality and factoring integers in Crystal

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

Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment