https://github.com/jloveric/sentencesimilarity
Javascript/Nodejs sentence similarity. Produces several measures of similarity based on fuzzy matching and a similarity matrix.
https://github.com/jloveric/sentencesimilarity
Last synced: 6 months ago
JSON representation
Javascript/Nodejs sentence similarity. Produces several measures of similarity based on fuzzy matching and a similarity matrix.
- Host: GitHub
- URL: https://github.com/jloveric/sentencesimilarity
- Owner: jloveric
- License: mit
- Created: 2017-04-29T19:36:31.000Z (about 8 years ago)
- Default Branch: master
- Last Pushed: 2023-01-09T09:33:57.000Z (over 2 years ago)
- Last Synced: 2024-04-14T21:49:23.526Z (about 1 year ago)
- Language: JavaScript
- Homepage:
- Size: 756 KB
- Stars: 21
- Watchers: 3
- Forks: 6
- Open Issues: 6
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
[](https://travis-ci.org/jloveric/SentenceSimilarity)
# SentenceSimilarity
Javascript/Nodejs sentence similarity. Although this was designed for sentences, it will work for other sequences as long as the user provides
a scoring function for for comparing 2 elements of the sequence.
This algorithm computes 4 sentence similarity scores that can be used for choosing best matched scores based
on multiple criteria. The 4 similarities are 'exact' which is the number of words that match exactly regardless of order. 'score' which is the score of the words that match either partially or exactly. Partial matches are determined by the a user selected word similarity measure, Levenshtein or Metaphone for example. 'order' is score provided based on the order of
the words in the two sentences. 'size' is the score determined by comparing the number of words to match to the number of
words that exist in the compared sentence. The matches between words are unique so no word in sentence 1 is matched with more than one word in sentence 2. If the same word exists twice in sentence 2, but not sentence 1 then preference is given to the
left most word during matching.
By multiplying score\*order\*size or exact\*order\*size, one will get a score between 0 and 1. In addition, the user can
supply wildcards that appear in parentheses 'Your name is (name)' where the wildcard '(name)' is ignored in the comparison. This allows the similarity score to be used in slot filling.
# Installing
```bash
npm install sentence-similarity
```
and for the examples, you'll also need to install similarity-score
```
npm install similarity-score
```
# Example 1
```javascript
"use strict"
let similarity = require('sentence-similarity')
let similarityScore = require('similarity-score')
let s1 = ['how','close','is','this','to','that']
let s2 = ['these','two','are','not','that','close']
let winkOpts = { f: similarityScore.winklerMetaphone, options : {threshold: 0} }
console.log(similarity(s1,s2,winkOpts))
```
gives
```json
{ matched: [ 3, 5, -1, 0, 1, 4 ],
matchScore:
[ 0.27777777777777773,
1,
0,
0.9133333333333333,
0.32499999999999996,
1 ],
exact: 2,
score: 3.516111111111111,
order: 0.06666666666666687,
size: 0.16666666666666666 }
```
"matched" tells you which index of s2 best matches the corresponding word in s1. And matchScore give you the corresponding score for the matches determined in "matched". In this case, the algorithm suggests that
0. 'how=not' with score (0.277)
1. 'close=close' with score (1)
2. 'is=' doesn't have a match, score(0)
3. 'this=these' with score (0.91)
4. 'to=two' with score (0.325)
5. 'that=that' with score (1.0)
The third parameter (opts) to the similarity(s1,s2,opts) call is an object containing the similarity measure for comparing words in a sentence as well as a option object which can be used to define additional parameters. someFunc should return a value between 0 and 1
defining how similar the two "words" are, where 1 means they are exactly the same and 0 means the are not at all the same. I often use a threshold parameter that sets the similarity to 0 if the similarity is below that threshold.
```javascript
let opts = { f: someFunc, options : {threshold: 0.1} }
```
where
```javascript
let someFunc = function(a,b,options) {
let a = levenshtein(a,b);//for example
if(a