Search results
26 packages found
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
Standalone package designed as helper for on-lang. Fetches catalog from SchemStore (www.schemastore.org) and categorises it into different entities based on similarity.
- onlang
- onlang-schema
- json
- onl
- schemastore
- natural
- similarity
- search
- schema
- cli
- onst-schemastore
- onst
- levenshtein
A blazing-fast semantic search React component. Match by meaning, not just by letters. Search as you type without waiting (no debounce needed). Rank by cosine similarity.
A lightweight and efficient vector database for storing and searching text embeddings in the browser's local storage. The package uses OpenAI's API to generate embeddings for text documents and provides functionality for similarity search, filtering, and
Fastest SIMD-Accelerated Vector Similarity Functions for x86 and Arm
React Hook for [`indexed-vector-store`](https://github.com/danielivanovz/indexed-vector-store) package. Used for [demo](https://github.com/danielivanovz/indexed-vector-store-demo) and deployed at my [website](https://app.danielivanov.me/vector-database/).
- natural-language-processing
- indexeddb
- vector-store
- vector-database
- embeddings
- word-embeddings
- semantic-search
- similarity-search
- embeddings-search
- similarity
- semantic
- search
- nlp
Fastest SIMD-Accelerated Vector Similarity Functions for x86 and Arm
A React hook that allows you to use similarity search in a react-select component
A lightweight and efficient vector database for storing and searching text embeddings in the browser's local storage. The package uses OpenAI's API or Transformer.js models to generate embeddings for text documents and provides functionality for similarit
- vector
- semantic
- store
- storage
- database
- db
- local
- localstorage
- browser
- embeddings
- text
- search
- similarity
- OpenAI
- View more
Fuzzy Matching Library with Levenshtein Edit Distance, Tailored for Korean Language Support
A lightweight and efficient vector database for storing and searching text embeddings in the browser's local storage. The package uses Transformers.js to generate embeddings for text documents and provides functionality for similarity search, filtering, a
- vector
- semantic
- store
- storage
- database
- db
- local
- localstorage
- browser
- embeddings
- text
- search
- similarity
- transformers
A lightweight and efficient vector database for storing and searching text embeddings in the browser's local storage. The package uses OpenAI's API to generate embeddings for text documents and provides functionality for similarity search, filtering, and
JavaScript client for txtai
A vector search utility written purely in javascript with no dependencies. Allows for the searching/ranking of a list of javascript objects with 'embedding' field defined.
Simple neural sentence search.
- tensorflow
- sentence
- search
- similarity
- one shot learning
- knn
- embeddings
- chatbot
- intent
- classification
- ai
- machine learning
- semantic
this package lets you compare two strings and give you how much percent they are similar
- strings
- similar
- difference
- similarity
- compare
- comparison
- degree
- match
- matching
- dice
- levenshtein
- percentage
- score
- algorithm
- View more
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
A collection of string matching algorithms built with React Select in mind
- distance
- filter
- fuzzy
- Jaro-Winkler
- Levenshtein
- match
- options
- proximity
- search
- similar
- similarity
- string
- subsequence
- substitutions
- View more
Finds degree of similarity between strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
- strings
- similar
- difference
- similarity
- compare
- comparison
- degree
- match
- matching
- dice
- levenshtein
- percentage
- score
- algorithm
- View more
Given a name and a list of names that are not equal to the name, return a spelling suggestion if there is one that is close enough.
- spelling-suggestion
- spelling
- suggestion
- levenshtein
- leven
- compare
- algorithm
- match
- matching
- search
- comparison
- similarity
- similar
- diff