| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gwfqioihlb (0) - 1 freq nbioiwlb (5) - 1 freq fooils (6) - 1 freq faimily (6) - 189 freq awfill (6) - 1 freq gllaihcb (6) - 1 freq garrioch (6) - 1 freq foil (6) - 9 freq zwqil (6) - 1 freq official (6) - 148 freq officials (6) - 5 freq awfil (6) - 4 freq gloriously (6) - 1 freq garishly (6) - 1 freq definitly (6) - 1 freq fairisle (6) - 2 freq graciously (6) - 5 freq wheipil (6) - 3 freq wzroqhl (6) - 1 freq wheipils (6) - 1 freq glaikitly (6) - 1 freq offeicial (6) - 17 freq offeicials (6) - 2 freq ewfoiibbw (6) - 1 freq garioch (6) - 19 freq |
gwfqioihlb (0) - 1 freq wqhab (9) - 1 freq wzroqhl (10) - 1 freq zwqil (10) - 1 freq garishly (10) - 1 freq awfil (10) - 4 freq gllaihcb (10) - 1 freq nbioiwlb (10) - 1 freq awfill (10) - 1 freq owyfwiib (10) - 1 freq fuhl (11) - 1 freq wheils (11) - 1 freq umquhile (11) - 18 freq withal (11) - 1 freq awfle (11) - 1 freq fairhill (11) - 1 freq wifely (11) - 2 freq gàidhlig (11) - 71 freq qwhilk (11) - 1 freq withheld (11) - 1 freq awfy-like (11) - 1 freq grief'll (11) - 1 freq foothold (11) - 2 freq weechil (11) - 2 freq gaidhlig (11) - 8 freq |
SoundEx code - G124 gippsland - 1 freq gsfwswljwd - 1 freq goevaazcld - 1 freq gbqlw - 1 freq gwfqioihlb - 1 freq |
MetaPhone code - KFKLB gwfqioihlb - 1 freq |
GWFQIOIHLB |
| Time to execute Levenshtein function - 0.190756 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.359332 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.028497 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.037625 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.000938 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. |