GitXplorerGitXplorer
b

ScoreSharp

public
12 stars
1 forks
0 issues

Commits

List of commits on branch master.
Unverified
9a29e8dbedfea939100edd20ccd9823c4b4fc64d

Fixed a README typo on the examples

bbltavares committed 14 years ago
Unverified
0f11841770ffec144d77d8c19d4380e3535a95bf

Added a check if current position isn't 0 for Acronyms

bbltavares committed 14 years ago
Unverified
cee9fab50d762db7e7b15cb855adaeacc57519da

Solved issue with fuzziness. Better fuzzy matches now.

bbltavares committed 14 years ago
Unverified
4f71899c9c3055edc4269fffa55f19cb2d3aed51

Formated the README

bbltavares committed 14 years ago
Unverified
f50ff691744579732d2a1dc56082fb4bddacb50a

Formated the README

bbltavares committed 14 years ago
Unverified
6178ab343c161edd40af25da37861c4654b8960a

Formated the README

bbltavares committed 14 years ago

README

The README file for this repository.

ScoreSharp

ScoreSharp is a fuzzy string search algorithm.

What it does

  • It tells how much a string matches another one
  • It can sort your string arrays from the the best scored 'til the end
  • It can't bring you a beer

How to use it

It's simple:

  • Call it like:

ScoreSharp.score("I want to find something here", "something") // => Shows the percentage score

ScoreSharp.score("I want to use some fuzzy", "som fuzy", 0.12) // => Shows the percentage, even with some mistakes

  • Or use it to sort:

string[] myList = new string[] { "Hi!","Hello","Hi and Hello", "Hello there!" }; myList = ScoreSharp.sorter(myList, "Hello");

Credits

It's based on the string_score from Joshaven Potter.