149 Open source projects that are alternatives of or similar to edit-distance-papers

Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support

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

No description or website provided.

Levenshtein algorithm in C

SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm

Fast approximate strings search & spelling correction

Finite state dictionaries in Java

Levenshtein edit distance

Removes most frequent words (stop words) from a text content. Based on a Curated list of language statistics.

Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.

Spokestack: give your React Native app a voice interface!

Similar string search in Levenshtein distance

Python port of SymSpell

Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.

百度云流式语音识别客户端 SDK

🎐 a python library for doing approximate and phonetic matching of strings.

Myanmar (Burmese) Language Grapheme to Phoneme (myG2P) Conversion Dictionary for speech recognition (ASR) and speech synthesis (TTS).

Python library for computing edit distance between arbitrary Python sequences.

The RWTH ASR Toolkit.

Rapid fuzzy string matching in Python using the Levenshtein Distance

Evaluate results from ASR/Speech-to-Text quickly

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

A BK tree implementation for fast fuzzy string matching

Give me a word and I’ll give you an array of words that differ by a single letter.

Suggest hubot commands when not found

A list of publically available audio data that anyone can download for ASR or other speech activities

Sørensen–Dice coefficient

String similarity metrics for Elixir

🔤 Rust implementations of string similarity metrics

Julia and Python recursion algorithm, fractal geometry and dynamic programming applications including Edit Distance, Knapsack (Multiple Choice), Stock Trading, Pythagorean Tree, Koch Snowflake, Jerusalem Cross, Sierpiński Carpet, Hilbert Curve, Pascal Triangle, Prime Factorization, Palindrome, Egg Drop, Coin Change, Hanoi Tower, Cantor Set, Fibo…

Go implementation to calculate Levenshtein Distance.

The fastest .Net Levenshtein around

On-device speech-to-text engine powered by deep learning

Abydos NLP/IR library for Python

Ruby gem (native extension in Rust) providing implementations of various string metrics

A merged version of multiple open-source German speech datasets.

SymSpellCompound: compound aware automatic spelling correction

A repo listing known open source voice tools, ordered by where they sit in the voice stack

Damerau - Levenstein distance function for node

Golang metrics for calculating string similarity and other string utility functions

🎯 String metrics and phonetic algorithms for Scala (e.g. Dice/Sorensen, Hamming, Jaccard, Jaro, Jaro-Winkler, Levenshtein, Metaphone, N-Gram, NYSIIS, Overlap, Ratcliff/Obershelp, Refined NYSIIS, Refined Soundex, Soundex, Weighted Levenshtein).

End-to-end trained speech recognition system, based on RNNs and the connectionist temporal classification (CTC) cost function.

Golang library for fuzzy matching within a set of strings 📃

Levenshtein algorithm in Rust

一些常用的java sdk和工具类（日期工具类，分布式锁，redis缓存，二叉树，反射工具类，线程池，对称/非对称/分段加解密，json序列化，http工具，雪花算法，字符串相似度，集合操作工具，xml解析，重试Retry工具类，Jvm监控等）

Golang string comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...

A Collection of Speech Corpus for ASR and TTS

Bot for checking reposts on reddit

AStarix: Fast and Optimal Sequence-to-Graph Aligner

String similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity...

Data preperation scripts, training pipeline and baseline experiment results for the Interspeech 2020 Accented English Speech Recognition Challenge (AESRC).

The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity

24-hour Automatic Speech Recognition

SpellcheckerWasm is an extrememly fast spellchecker for WebAssembly based on SymSpell

set of functions and operators for executing similarity queries

YSDA course in Speech Processing.

Open-Source Toolkit for End-to-End Korean Automatic Speech Recognition leveraging PyTorch and Hydra.

Audio-Visual Speech Recognition using Sequence to Sequence Models

A live speech recognition using Facebooks wav2vec 2.0 model.

Easy to use and powerful fuzzy string matching, port of fuzzywuzzy.