Apache Mahout has implementations of a wide range of machine learning and data mining algorithms: clustering, classification, collaborative filtering and frequent pattern mining.
machine-learning classification data-mining fuzzyFast SublimeText-like fuzzy search for JavaScript. Sublime's fuzzy search is... sublime. I wish everything used it. So here's an open source js version.
fuzzy search filter sublimeTNTSearch is a full-text search (FTS) engine written entirely in PHP. A simple configuration allows you to add an amazing search experience in just minutes. Its features include Fuzzy search, Geo-search, Text classification, Stemming, Bm25 ranking algorithm, Result highlighting, Boolean search and lot more.
fulltext search search-engine full-text-search fuzzy-search geo-search fuzzy fuzzy-matching tntsearch laravel-scoutThis plugin is mainly used for locating files, buffers, mrus, tags in large project. To install this plugin just put the plugin files in your ~/.vim (Linux) or ~/vimfiles (Windows). For Vundle user, just add Plugin 'Yggdroot/LeaderF' to your .vimrc.
fuzzy-search fuzzy-matching fuzzyfinder mru ctags vim fuzzyJump integrates with the shell and learns about your navigational habits by keeping track of the directories you visit. It strives to give you the best directory for the shortest search term. Once integrated, jump will automatically directory changes and start building an internal database.
fish zsh bash autojump fuzzyThe library's full documentation can be found here. Be sure to lint & pass the unit tests before submitting your pull request.
natural-language-processing machine-learning fuzzy-matching clustering record-linkage bayes bloom-filter canberra caverphone chebyshev cologne cosine classifier daitch-mokotoff dice fingerprint fuzzy hamming k-means jaccard jaro lancaster levenshtein lig metaphone mra ngrams nlp nysiis perceptron phonetic porter punkt schinke sorensen soundex stats tfidf tokenizer tversky vectorizer winklerA simple single player game similar to Pacman. Developed using XNA game framework and C#. Game demonstrates usage of fuzzy logic for controlling the AI ghosts. This game is developed to test the effect of fuzzy logic AI in Pacman game.
fuzzy pacman xna-game-studioLibrary for calculating context triggered piecewise hashes (CTPH) also called fuzzy hashes.
fuzzy fuzzy-hash hash hashing libraryMeasure the difference between two strings using the fastest JS implementation of the Levenshtein distance algorithm
leven levenshtein distance algorithm algo string difference diff fast fuzzy similar similarity compare comparison edit text match matchingFuzzy filtering and string scoring.This library is used by Atom and so its focus will be on scoring and filtering paths, methods, and other things common when writing code. It therefore will specialize in handling common patterns in these types of strings such as characters like /, -, and _, and also handling of camel cased text.
fuzzy filter stringscoreThe TRIE data structure and search algorithm, on top of leveldb.Create a new Trie that stores its data in db.
trie tree leveldb levelup level search fuzzy suffix-tree suffix radix-tree radix digitalA fuzzer for testing. This implements mutation fuzzing, in which an expect input is mutated (changed) many times in order to trigger unexpected behavior or crashes.Generate a mutated version of an object. This does not modify the object directly, but returns a modified copy. This mutation will increment and decrement numbers, randomize arrays, remove properties, and more.
fuzzer fuzzy testing mutationGo package that provides fuzzy string matching optimized for filenames and code symbols in the style of Sublime Text, VSCode, IntelliJ IDEA et al. This library is external dependency-free. It only depends on the Go standard library.Here is a demo of matching various patterns against ~16K files from the Unreal Engine 4 codebase.
fuzzy-search fuzzyfinder fuzzyMeasure the difference between two strings using the Levenshtein distance algorithm
cli-app cli leven levenshtein distance algorithm algo string difference diff fast fuzzy similar similarity compare comparison edit text match matchingA React component that quacks like an HTML <input> but which includes a selectable list of suggestions for filling in its value. As you type text into the input field, a list of suggestions will be displayed in a selectable overlay just below. The suggestions are an array of strings given to the component as a prop and are compared to the ever-changing query string that you are typing. The "closer" a suggestion is to what you have typed, the higher in the list it will appear.
react-component react component suggestions input fuzzy search autocomplete suggestible suggest typeaheadTenuki is a web-based board and JavaScript library for the game of go/baduk/weiqi. The JavaScript engine is not dependent on the renderer and works stand-alone. You can use it by itself as part of a larger JavaScript application.
game board board-game baduk weiqi igo web html goban fuzzy cssFuzzy.js is a library for approximate (fuzzy) string matching. Fuzzy.js is aimed at providing an experience which you may know from editors such as Sublime Text, Atom, TextMate and others. The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
fuzzy string matching approximate sublime searching sortingA collection of string matching algorithms built with React Select in mind. They're well documented in main.js.
distance filter fuzzy jaro-winkler levenshtein match options proximity search similar similarity string subsequence substitutions text typeahead variationsGolang implementation based on the paper and implementation by Jesse Kornblum. See the example in the app directory for the usage.
ssdeep fuzzy hashTLSH is a fuzzy matching library. Given a byte stream with a minimum length of 256 bytes, TLSH generates a hash value which can be used for similarity comparisons. Similar objects will have similar hash values which allows for the detection of similar objects by comparing their hash values. Note that the byte stream should have a sufficient amount of complexity. For example, a byte stream of identical bytes will not generate a hash value. The computed hash is 35 bytes long (output as 70 hexidecimal charactes). The first 3 bytes are used to capture the information about the file as a whole (length, ...), while the last 32 bytes are used to capture information about incremental parts of the file.
tlsh hashing fuzzy locality-sensitive-hashing
We have large collection of open source products. Follow the tags from
Tag Cloud >>
Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
Add Projects.