| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uissfae (0) - 16 freq uissfu (2) - 18 freq uissage (2) - 3 freq uissan (2) - 3 freq uipsfme (2) - 1 freq dissae (2) - 1 freq uiswal (3) - 6 freq uisses (3) - 2 freq ustae (3) - 2 freq uisfu (3) - 2 freq uissed (3) - 4 freq sofae (3) - 3 freq uisage (3) - 9 freq fissle (3) - 3 freq his'nae (3) - 1 freq tissue (3) - 6 freq wisnae (3) - 999 freq missile (3) - 6 freq pishae (3) - 2 freq yuissfu (3) - 3 freq issue (3) - 99 freq unsafe (3) - 2 freq sissie (3) - 1 freq isnae (3) - 544 freq usetae (3) - 1 freq |
uissfae (0) - 16 freq uissfu (2) - 18 freq ussf (3) - 2 freq yuissfu (3) - 3 freq yissfu (3) - 2 freq uissan (3) - 3 freq uissage (3) - 3 freq unsafe (4) - 2 freq aisse (4) - 4 freq sissie (4) - 1 freq yaisefae (4) - 1 freq uissis (4) - 1 freq uisefu (4) - 7 freq uiss (4) - 130 freq uisst (4) - 1 freq issue (4) - 99 freq uissed (4) - 4 freq uisfu (4) - 2 freq uisses (4) - 2 freq dissae (4) - 1 freq sofae (4) - 3 freq uipsfme (4) - 1 freq assay (5) - 5 freq aiss (5) - 3 freq sfaf (5) - 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 - USF uissfu - 18 freq usefu - 10 freq usefy - 1 freq uisefu - 7 freq uissfae - 16 freq ussf - 2 freq uisfu - 2 freq |
UISSFAE |
| Time to execute Levenshtein function - 0.254448 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.419617 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.028574 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.039687 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.000836 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. |