Giter Site home page Giter Site logo

Comments (5)

dangh avatar dangh commented on May 24, 2024 1

Hey @18672786357 It's 6 months old and you might found the answer yourself but I like to post my answer here for the future me 😛

The Sørensen–Dice algorithm is calculate the number of matching items in 2 sets using the formular DSC = 2(𝚇⋂𝚈)/(|𝚇|+|𝚈|) where |𝚇| and |𝚈| are the number of items in each set.

This library convert each strings to multiple bigrams (2 characters substring) and apply the formular above. If you break the string manually you will see that the number of items is the length of string minus 1.

"abide" -> ['ab', 'bc', 'cd', 'de']

We have two strings so |𝚇|+|𝚈| will be (s1.length - 1) + (s2.length - 1). That's where the number 2 come from.

from string-similarity.

18672786357 avatar 18672786357 commented on May 24, 2024

return (2.0 * intersectionSize) / (first.length + second.length - 2);,,,,Why is this line of code minus 2

from string-similarity.

Rabbitzzc avatar Rabbitzzc commented on May 24, 2024
let str = '12345'  // len = 5
let set = {'12', '23', '34', '45'} len =4
// so one string represents the denominator that needs to:
X = len - 1 = str.length - 1

from string-similarity.

zscaiosi avatar zscaiosi commented on May 24, 2024

Hey @18672786357 It's 6 months old and you might found the answer yourself but I like to post my answer here for the future me stuck_out_tongue

The Sørensen–Dice algorithm is calculate the number of matching items in 2 sets using the formular DSC = 2(𝚇⋂𝚈)/(|𝚇|+|𝚈|) where |𝚇| and |𝚈| are the number of items in each set.

This library convert each strings to multiple bigrams (2 characters substring) and apply the formular above. If you break the string manually you will see that the number of items is the length of string minus 1.

"abide" -> ['ab', 'bc', 'cd', 'de']

We have two strings so |𝚇|+|𝚈| will be (s1.length - 1) + (s2.length - 1). That's where the number 2 come from.

@dangh the bigrams are applied to the Map structure (firstBigram), not to the variables first and second !
first.substring(i, i + 2); and second.substring(i, i + 2); DO NOT modify the objects (strings), but return new strings (substrings).

It does not make any sense to subtract 2!

from string-similarity.

aceakash avatar aceakash commented on May 24, 2024

@dangh has the right explanation and the link that I used the formula from.
The result is as expected, 'night' and 'nacht' are similar to a degree of 0.25
https://jsbin.com/kidibosato/edit?js,console

from string-similarity.

Related Issues (20)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.