ZLOOKUP VS fuzzball.js

Compare ZLOOKUP vs fuzzball.js and see what are their differences.

ZLOOKUP

Google Sheet Fuzzy String Matching Function (by nyanlynntherazi)
Our great sponsors
  • SurveyJS - Open-Source JSON Form Builder to Create Dynamic Forms Right in Your App
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
ZLOOKUP fuzzball.js
1 2
25 502
- -
0.0 4.1
over 2 years ago 7 days ago
JavaScript JavaScript
GNU General Public License v3.0 only GNU General Public License v3.0 only
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.

ZLOOKUP

Posts with mentions or reviews of ZLOOKUP. We have used some of these posts to build our list of alternatives and similar projects.

fuzzball.js

Posts with mentions or reviews of fuzzball.js. We have used some of these posts to build our list of alternatives and similar projects.
  • Unlocking Advanced RAG: Citations and Attributions
    1 project | dev.to | 29 Jan 2024
    import { ratio, } from 'fuzzball'; import { SequenceMatcher } from 'difflib'; // modified from: https://github.com/nol13/fuzzball.js/blob/773b82991f2bcacc950b413615802aa953193423/fuzzball.js#L942 function partial_ratio(str1: string, str2: string) { if (str1.length <= str2.length) { var shorter = str1 var longer = str2 } else { var shorter = str2 var longer = str1 } var m = new SequenceMatcher(null, shorter, longer); var blocks = m.getMatchingBlocks(); let bestScore: number = 0; let bestMatch: string | null = null let bestStartIdx: number = -1 for (var b = 0; b < blocks.length; b++) { var long_start = (blocks[b][1] - blocks[b][0]) > 0 ? (blocks[b][1] - blocks[b][0]) : 0; var long_end = long_start + shorter.length; var long_substr = longer.substring(long_start,long_end); var r = ratio(shorter,long_substr); if (r > bestScore) { bestScore = r; bestMatch = long_substr; bestStartIdx = long_start; } if (r > 99.5) { break; } } return { bestMatch, bestScore, bestStartIdx, } }
  • I'm thinking of making a search tool to find Dunkey quotes. Here is a very early prototype. More details in comment.
    1 project | /r/videogamedunkey | 15 Apr 2022
    I’ve been using the fuzzball package for the search algorithm in my current project. It might be able to help with matching non-exact strings

What are some alternatives?

When comparing ZLOOKUP and fuzzball.js you can also consider the following projects:

form-to-google-sheets - Store HTML form submissions in Google Sheets.

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

IMPORTJSONAPI - Use JSONPath to selectively extract data from any JSON or GraphQL API directly into Google Sheets.

wildflower - Efficient wildcard matching against strings

Luckysheet - Luckysheet is an online spreadsheet like excel that is powerful, simple to configure, and completely open source.