A simple and lightweight fuzzy search engine that works in memory, searching for similar strings

simsearch A simple and lightweight fuzzy search engine that works in memory, searching for similar strings (a pun here). Documentation Usage Add the f

Information

Category: Rust / Text search
Watchers: 4
Star: 140
Fork: 23
Last update: Dec 5, 2023

Resource links

https://github.com/andylokandy/simsearch-rs

README
Issues 6

`simsearch`

A simple and lightweight fuzzy search engine that works in memory, searching for similar strings (a pun here).

Documentation

Usage

Add the following to your Cargo.toml:

[dependencies]
simsearch = "0.2"

Example

use simsearch::SimSearch;

let mut engine: SimSearch<u32> = SimSearch::new();

engine.insert(1, "Things Fall Apart");
engine.insert(2, "The Old Man and the Sea");
engine.insert(3, "James Joyce");

let results: Vec<u32> = engine.search("thngs");

assert_eq!(results, &[1]);

Also try the interactive demo by:

$ cargo run --release --example books

Contribution

All kinds of contribution are welcomed.

Issus. Feel free to open an issue when you find typos, bugs, or have any question.
Pull requests. New collection, better implementation, more tests, more documents and typo fixes are all welcomed.

License

Licensed under MIT license (LICENSE-MIT or http://opensource.org/licenses/MIT)

0 Open More issues

Closed

Added SIMD-accelerated Levenshtein distance support based on the `triple_accel` library

I added support for Levenshtein distance by using the triple_accel library. Levenshtein distance can be optionally enabled by the user by using SearchOptions. I also edited the readme, documentation, and benchmarks to reflect this change. I tried to follow the existing code style. The code passes all tests on my laptop, and for reference, here is an overview of the benchmark results:

add books: ~1.4 ms
search_jaro_winkler: ~212 us
search_levenshtein: ~131 us

SIMD Levenshtein distance should be even faster with longer strings.

opened Jun 6, 2020 by Daniel-Liu-c0deb0t 3

Closed

Use criterion for benches

Hi Andy and thanks for you crate!

I wanted to implement a fuzzy search in rust for some time, and thanks to your post on reddit I've discovered that the work is already done ;)

I looked at your benches and found out that you're not using criterion, which can draw fancy plots for you and provide a comparison with a previous run (very helpful when you're trying to improve the performance), so here's a PR that migrates the benches. The only other thing apart from just migrating I've also made the add 100 bench to insert items into an empty engine on each benchmark iteration, which I believe made the bench to be more fair.

opened Apr 15, 2019 by mexus 2

Closed

[feature req] tokenization of other languages

simsearch-rs totally fails on Korean text. How involved would it be to have it tokenize hangeul?

searching 던지(요) should match id 866 (name: -던지(요), but gives a top result of id 1527 (name: 에게로 【너에게로 다가간다】).

raw json

use std::{error::Error, fs};

use serde::{Deserialize, Serialize};
use simsearch::SimSearch;

#[derive(Debug, Deserialize, Serialize)]
struct Entry {
    id: i64,
    name: String,
    typical_example: String,
    translation: String,
    category_eng: String,
    category_kor: String,
}

fn main() -> Result<(), Box<dyn Error + 'static>> {
    let mut engine: SimSearch<i64> = SimSearch::new();

    let data = fs::read_to_string("./output.json")?;
    let entries: Vec<Entry> = serde_json::from_str(&data)?;

    for entry in &entries {
        engine.insert(entry.id, &entry.name);
    }

    let results = engine.search("던지(요)");
    let top_match = results[1];

    let entry = entries.iter().filter(|e| e.id == top_match).collect::<Vec<_>>();

    Ok(())
}

opened Aug 18, 2019 by azah 2

Closed

Incorporating Levenshtein distance as another option in addition to Jaro-Winkler

Hey, Thanks for your work on this library. I was wondering whether you would be interested in adding Levenshtein distance as an option? I am recently working on accelerating bounded Levenshtein distance calculations with SIMD, which is around 20-30x faster than a normal scalar Levenshtein distance algorithm for medium length strings, and I thought that it would be nice and beneficial to use it in your library. The library is on crates.io: https://crates.io/crates/triple_accel.

However, there are some tradeoffs though: my library cannot handle unicode strings and null bytes due to the SIMD implementation. This could be addressed by allowing the user to opt in to using the SIMD implementation explicitly. Of course, my library supports automatically falling back to a scalar version if SIMD is not supported as a CPU feature.

If you are interested, we could discuss a little more about the implementation. I am probably able to work on this in the future.

opened Jun 1, 2020 by Daniel-Liu-c0deb0t 2

Closed

[example] books.rs, put search within timing start/end

From what I can see, the timing in the books example only times the pattern replace, and not the search itself.

opened Apr 15, 2019 by hwchen 1

Closed

strip whitespace from user input in example

The standard behavior of read_line leaves the newline from the user pressing the enter key. This PR strips that newline before performing the search.

opened Apr 18, 2019 by JoshMcguigan 1

A JavaScript plugin to find exact and fuzzy matches in a library of strings.

Fuzzy search tool for IDA Pro.

An efficient fuzzy finder that helps to locate files, buffers, mrus, gtags, etc. on the fly for both vim and neovim.

React hook for client side fuzzy search using Fuse.js

Tiny and blazing-fast fuzzy search in JavaScript

🔍 simple and fast fuzzy string matching in Swift

This plugin makes it easy to search text in strings resources.

A lightweight fuzzy-search library, with zero dependencies

Fast SublimeText-like fuzzy search for JavaScript.

easier than regex string matching patterns for urls and other strings. turn strings into data or data into strings.

Fuzzy C-Means is clustering algorithm (クラスタリング分類) combined fuzzy theory (ファジー理論) on Machine Learning.

hackers-grep is a utility to search for strings in PE executables including imports, exports, and debug symbols

A very simple Chrome extension that enables fuzzy search of browsing histories.

A Windows virtual memory editing library with support for pattern scanning.

Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.

🔍NEW ultra fast grep with interactive query UI: search file systems, source code, text, binary files, archives (cpio/tar/pax/zip), compressed files (gz/Z/bz2/lzma/xz/lz4), documents, fuzzy search, and more. A faster, user-friendly replacement for GNU/BSD grep.

Memory Debugger for Windows, Linux, Mac, and Android

Fuzzy and semantic search for captioned YouTube videos.

Convert strings between different cases.

vue-fuse - A lightweight plugin for fuzzy search library, Fuse.js

Golang library for fuzzy matching within a set of strings :page_with_curl:

Share this repo

Related Repos

Text search

Browser tab search provider for GNOME

What is this ? This is repository provides browser tab search provider for GNOME Screenshot Installation Installl all 3 components for tab search to w

Text search

Roogle is a Rust API search engine, which allows you to search functions by names and type...

Roogle is a Rust API search engine, which allows you to search functions by names and type signatures.

Text search

Like grep, but uses tree-sitter grammars to search

tree-grepper Works like grep, but uses tree-sitter to search for structure instead of strings. Installing This isn't available packaged anywhere. That

Text search

⚡ Insanely fast, 🌟 Feature-rich searching. lnx is the adaptable deployment of the tantivy...

✨ Feature Rich | ⚡ Insanely Fast An ultra-fast, adaptable deployment of the tantivy search engine via REST. 🌟 Standing On The Shoulders of Giants lnx

Text search

genx provides modular building blocks to run simulations of optimization and search proble...

genx provides modular building blocks to run simulations of optimization and search problems using Genetic Algorithms (GA).

Text search

328

Rapidly Search and Hunt through Windows Event Logs

Text search

A Smart & Powerful Bookmark Search Engine Tool in Rust 🦀 and Rocket 🚀!

Rusty Skywalker A Powerful Bookmark Search Tool Powering Firefox & Chrome! Prerequisites Make sure you have Rust installed. $ curl --proto '=https' --

Text search

2.5k

🔍 Tiny, full-text search engine for static websites built with Rust and WASM

Text search

Tantivy is a full text search engine library written in Rust.

Tantivy is a full text search engine library written in Rust. It is closer to Apache Lucene than to Elasticsearch or Apache Solr in the sense it is no

Text search

perlin perlinCurrySoftware/perlin [perlin]

Table of Contents 1. Perlin Perlin Perlin is a free and open-source document search engine library build on top of perlin-core. Since the first releas

Text search

357

minsql — High-performance log search engine.

NOTE: This project is under development, please do not depend on it yet as things may break. MinSQL MinSQL is a log search engine designed with simpli

Text search

40.2k

MeiliSearch — Ultra relevant, instant and typo-tolerant full-text search API.

Text search

1.6k

This crate provides a fast implementation of ordered sets and maps using finite state mach...

fst This crate provides a fast implementation of ordered sets and maps using finite state machines. In particular, it makes use of finite state transd

Text search

140

A simple and lightweight fuzzy search engine that works in memory, searching for similar s...

simsearch A simple and lightweight fuzzy search engine that works in memory, searching for similar strings (a pun here). Documentation Usage Add the f