issues Search Results · repo:aceakash/string-similarity language:JavaScript
Filter by
37 results
(271 ms)37 results
inaceakash/string-similarity (press backspace or delete to remove)Warning: [some/module.ts] depends on string-similarity . CommonJS or AMD dependencies can cause optimization bailouts.
Is it possible to have an es6 version? It would be nice to avoid this kind of thing: ...
TheGameKnave
- Opened on Jan 4, 2023
- #128
The package.json reports the license to be ISC, while the LICENSE file reports it to be MIT.
It s quite important that this is fixed as license reporting tools will rightfully report this as problematic. ...
mcollina
- Opened on Jul 13, 2022
- #127
Hello!
If I try to compare two strings like compareTwoStrings( set , st ); the result is always 0. Strings with length lower
than 3 cannot be compared.
Is this normal?
Greatings!
Flo0806
- 1
- Opened on Jul 1, 2022
- #126
Use case: Instead of wanting to compare [ foo , bar , baz ], it can be useful to pass in an array of objects for which
you want to compare one property, i.e.
[
{ name: foo , otherProperty: 23 }, ...
chrissyast
- 1
- Opened on May 26, 2022
- #125
I am pretty sure I did it correctly I have the first as a string and the second as an array the code is
const pokemons = require( ../../arrays/pokemons.js )
const poss = stringSimilarity.findBestMatch(args, ...
DancingPotatoes
- 3
- Opened on Nov 18, 2021
- #123
I need to compare two strings completely, that means it should also detect spaces and caps.
I have read the relase notes, and I don t understand why you decided to disregard spaces from version 3.0.0, ...
airda2895
- Opened on Aug 27, 2021
- #122
Your algorithm is not the Dice coefficient. It counts all bigram duplicates, whereas the Dice coefficient only counts
distinct bigrams (as defined in Wikipedia).
As an example, let s compare two versions ...
vibl
- 1
- Opened on Jun 26, 2021
- #114
stringSimilarity.findBestMatch( wall e , [ wall·e , wall ]);
stringSimilarity.findBestMatch( wall-e , [ wall·e , wall ]);
stringSimilarity.findBestMatch( wall_e , [ wall-e , wall ]);
These all return ...
enunez
- Opened on Mar 31, 2021
- #100
I just tryed the example:
stringSimilarity.compareTwoStrings( healed , sealed );
//0.8
= 80% for a 1 letter change.
stringSimilarity.compareTwoStrings( healed , ehaled );
//0.6
= 60% for 2 letter ...
oom-
- 1
- Opened on Feb 21, 2021
- #91
ghost
Learn how you can use GitHub Issues to plan and track your work.
Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub IssuesProTip!
Press the /
key to activate the search input again and adjust your query.Learn how you can use GitHub Issues to plan and track your work.
Save views for sprints, backlogs, teams, or releases. Rank, sort, and filter issues to suit the occasion. The possibilities are endless.Learn more about GitHub IssuesProTip!
Restrict your search to the title by using the in:title qualifier.