string_similarity 1.0.1 copy "string_similarity: ^1.0.1" to clipboard
string_similarity: ^1.0.1 copied to clipboard

outdated

Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

example/string_similarity_example.dart

import 'package:string_similarity/string_similarity.dart';

void main() {
  StringSimilarity.compareTwoStrings('french', 'quebec'); // -> 0

  StringSimilarity.compareTwoStrings('healed', 'sealed'); // → 0.8

  StringSimilarity.findBestMatch('Olive-green table for sale, in extremely good condition.', <String>[
    'For sale: green Subaru Impreza, 210,000 miles',
    'For sale: table in very good condition, olive green in colour.',
    'Wanted: mountain bike with at least 21 gears.'
  ]);
/* ->
{ ratings:
   [ { target: 'For sale: green Subaru Impreza, 210,000 miles',
       rating: 0.2558139534883721 },
     { target: 'For sale: table in very good condition, olive green in colour.',
       rating: 0.6060606060606061 },
     { target: 'Wanted: mountain bike with at least 21 gears.',
       rating: 0.1411764705882353 } ],
  bestMatch:
   { target: 'For sale: table in very good condition, olive green in colour.',
     rating: 0.6060606060606061 },
  bestMatchIndex: 1 
}
*/
}
101
likes
0
pub points
96%
popularity

Publisher

verified publisherjeremylandon.com

Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

Repository (GitHub)
View/report issues

License

unknown (LICENSE)

More

Packages that depend on string_similarity