| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uissfu (0) - 18 freq uisefu (1) - 7 freq yissfu (1) - 2 freq yuissfu (1) - 3 freq uisfu (1) - 2 freq ussf (2) - 2 freq uisses (2) - 2 freq uissed (2) - 4 freq uissin (2) - 1 freq uisst (2) - 1 freq uissan (2) - 3 freq uissis (2) - 1 freq yisfu (2) - 7 freq fistfu (2) - 1 freq uiss (2) - 132 freq wishfu (2) - 1 freq blissfu (2) - 1 freq usefu (2) - 10 freq uissfae (2) - 16 freq wilfu (3) - 1 freq wiss (3) - 72 freq iss (3) - 1 freq kissie (3) - 1 freq hissel (3) - 371 freq uises (3) - 36 freq |
uissfu (0) - 18 freq yuissfu (1) - 3 freq yissfu (1) - 2 freq uisefu (2) - 7 freq uissfae (2) - 16 freq ussf (2) - 2 freq uisfu (2) - 2 freq yisfu (3) - 7 freq usefu (3) - 10 freq uissis (3) - 1 freq uiss (3) - 132 freq uissan (3) - 3 freq uissed (3) - 4 freq uisses (3) - 2 freq uissin (3) - 1 freq uisst (3) - 1 freq eiss' (4) - 1 freq yaisfu (4) - 1 freq issue (4) - 100 freq iss' (4) - 1 freq yisfi (4) - 2 freq ussr (4) - 3 freq yisses (4) - 2 freq yuisst (4) - 5 freq sinfu (4) - 3 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 - USF uissfu - 18 freq usefu - 10 freq usefy - 1 freq uisefu - 7 freq uissfae - 16 freq ussf - 2 freq uisfu - 2 freq |
UISSFU |
| Time to execute Levenshtein function - 0.191575 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.345030 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.030001 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.041181 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.000907 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. |