| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| usbf (0) - 14 freq ussf (1) - 2 freq usb (1) - 2 freq ussr (2) - 3 freq us (2) - 3687 freq usp (2) - 1 freq usefu (2) - 10 freq swf (2) - 1 freq sf (2) - 6 freq usit (2) - 4 freq usta (2) - 1 freq usty (2) - 1 freq zsb (2) - 1 freq uf (2) - 1 freq tsb (2) - 1 freq ubg (2) - 4 freq sbt (2) - 6 freq ub (2) - 3 freq usd (2) - 1 freq usefy (2) - 1 freq gsf (2) - 1 freq sef (2) - 1 freq szf (2) - 1 freq use (2) - 466 freq wsf (2) - 1 freq |
usbf (0) - 14 freq usb (2) - 2 freq ussf (2) - 2 freq fibf (3) - 1 freq sb (3) - 4 freq isbn (3) - 23 freq sef (3) - 1 freq bf (3) - 6 freq szf (3) - 1 freq asbo (3) - 1 freq sif (3) - 4 freq obf (3) - 1 freq saf (3) - 1 freq sbd (3) - 2 freq spf (3) - 1 freq usefy (3) - 1 freq sbc (3) - 1 freq tbf (3) - 3 freq sf (3) - 6 freq usefu (3) - 10 freq sbt (3) - 6 freq swf (3) - 1 freq baif (4) - 4 freq seaf (4) - 1 freq sfaf (4) - 1 freq |
SoundEx code - U210 uissfu - 18 freq usefu - 10 freq usefy - 1 freq uisefu - 7 freq 'usquebae' - 1 freq usp - 1 freq usquebae - 1 freq ukip - 13 freq uissfae - 16 freq ussf - 2 freq usb - 2 freq usbf - 14 freq uisfu - 2 freq uzp - 1 freq ugb - 1 freq uujp - 1 freq ukszf - 1 freq uggf - 1 freq uqwve - 1 freq usvbwi - 1 freq |
MetaPhone code - USBF usbf - 14 freq |
USBF |
| Time to execute Levenshtein function - 0.488681 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.996790 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.092266 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.104181 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.000963 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |