mnemonist - Curated collection of data structures for the JavaScript language.

•    Javascript

---

Mnemonist is a curated collection of data structures for the JavaScript language. It gathers classic data structures (think heap, trie etc.) as well as more exotic ones such as Buckhard-Keller trees etc.

data-structure bag bimap bit-array bit-set bit-vector bitset bk-tree burkhard-keller-tree circular-buffer counter data-structures disjoint-set fibonacci-heap fuzzy-map hashed-array-tree heap interval-tree inverted-index linked-list multimap multiset queue sparse-set stack structures suffix-tree symspell trie union-find vantage-point-tree vector vp-tree

SymSpell - SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm

•    CSharp

---

The Symmetric Delete spelling correction algorithm reduces the complexity of edit candidate generation and dictionary lookup for a given Damerau-Levenshtein distance. It is six orders of magnitude faster (than the standard approach with deletes + transposes + replaces + inserts) and language independent. Lookup provides a very fast spelling correction of single words.

levenshtein fuzzy-search approximate-string-matching edit-distance spellcheck spell-check levenshtein-distance damerau-levenshtein spelling fuzzy-matching word-segmentation chinese-text-segmentation chinese-word-segmentation text-segmentation spelling-correction symspell

WordSegmentationTM - Fast Word Segmentation with Triangular Matrix

•    CSharp

---

Fast Word Segmentation using a Triangular Matrix approach. Faster 2x, lower memory consumption constant O(1) vs. linear O(n), better scaling, more GC friendly. For a Word Segmentation using a Dynamic Programming approach have a look at WordSegmentationDP.

word-segmentation text-segmentation symspell spelling-correction spelling-corrector spellcheck spellchecker spell-check spell-checker spell-corrector spelling-checker