Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
lang-staunin (0) - 3 freq langstaunin (1) - 1 freq lang-staundin (1) - 1 freq lang-suffrin (4) - 1 freq free-staunin (4) - 2 freq lang-lastin (4) - 1 freq lang-rinnin (4) - 1 freq up-staunin (4) - 1 freq lang-taim (4) - 1 freq lang-grain (4) - 1 freq lang-shankit (4) - 2 freq lang-tail (4) - 1 freq bane-stabbin (4) - 1 freq unnerstaunin (4) - 32 freq lengthnin (5) - 2 freq unnerstaunnin (5) - 4 freq lang-shillit (5) - 1 freq flaik-staun (5) - 1 freq lang-lestin (5) - 1 freq lang-tint (5) - 1 freq link-stanes (5) - 1 freq lang-sufferin (5) - 1 freq lananin (5) - 1 freq abstainin (5) - 1 freq lang-tairm (5) - 1 freq |
lang-staunin (0) - 3 freq lang-staundin (2) - 1 freq langstaunin (2) - 1 freq lang-rinnin (6) - 1 freq lang-lastin (6) - 1 freq lang-lestin (7) - 1 freq unnerstaunin (7) - 32 freq lang-tint (7) - 1 freq link-stanes (7) - 1 freq lang-syne (7) - 1 freq lang-distance (7) - 1 freq lang-tail (7) - 1 freq up-staunin (7) - 1 freq lang-taim (7) - 1 freq free-staunin (7) - 2 freq lang-suffrin (7) - 1 freq lang-shankit (7) - 2 freq lang-grain (7) - 1 freq understaunin (8) - 3 freq lang-fatit (8) - 1 freq unnerstaunan (8) - 1 freq lang-hained (8) - 1 freq lang-awaitit (8) - 1 freq longstone (8) - 1 freq lang-shanked (8) - 1 freq |
SoundEx code - L523 lingth - 2 freq lang-heiditness - 1 freq longitude - 11 freq longed - 5 freq length - 68 freq langed - 12 freq lang-deef - 1 freq lencht - 4 freq lunchtime - 42 freq lance-teeth - 1 freq linseed - 3 freq lang-heidit - 15 freq launside - 1 freq langt - 2 freq launched - 18 freq lengths - 14 freq lang-deid - 3 freq langside - 15 freq lounged - 2 freq launchit - 8 freq limestane - 1 freq lang-tint - 1 freq lang-tails - 1 freq linked - 19 freq linkit - 15 freq lang-settled - 1 freq longtime - 3 freq lunged - 3 freq lang-distance - 1 freq lang-term - 13 freq lang-widge - 3 freq lang-widges - 1 freq langitude - 2 freq languid - 2 freq linkt - 2 freq lunchtimes - 2 freq lunchtin - 1 freq lang-tairm - 1 freq lengthnin - 2 freq lammas-tide - 1 freq lang-telt - 1 freq lemniscate - 1 freq long-deid - 1 freq 'lang-heidit - 1 freq lengthy - 2 freq 'langside - 4 freq lang-tim' - 6 freq lenght - 2 freq lengtht - 1 freq lumsden's - 1 freq langtoun - 1 freq languedoc - 1 freq languedociens - 1 freq lunshtiym - 1 freq langtime - 1 freq lungawater - 2 freq link-stanes - 1 freq lang-droont - 1 freq langstentit - 1 freq langth - 1 freq langwidge - 4 freq lang-delayed - 1 freq lungatou - 1 freq lang-tail - 1 freq laanched - 1 freq lang-awaitit - 1 freq lenched - 2 freq langstaunin - 1 freq longside - 1 freq lang-division - 1 freq lang-stemmed - 1 freq lang-staunin - 3 freq lunch-tim - 1 freq launcht - 1 freq langsider - 1 freq lang-tholed - 2 freq langed-fir - 2 freq lumsden - 2 freq lanced - 3 freq langheidit - 2 freq long-term - 1 freq langdelayed - 1 freq lang-staundin - 1 freq lang-taim - 1 freq leensterfbsi - 3 freq lynseydiva - 3 freq longstaff - 1 freq linkedhd - 1 freq lunastarra - 1 freq linktree - 1 freq longtermdata - 1 freq long-tailed - 1 freq langton - 1 freq lmsoyd - 1 freq longstonefc - 2 freq longstone - 1 freq |
MetaPhone code - LNKSTNN langstaunin - 1 freq lang-staunin - 3 freq |
LANG-STAUNIN |
Time to execute Levenshtein function - 0.209978 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.371698 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.027576 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.037060 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.000859 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. |