| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lrouthie (0) - 1 freq drouthie (1) - 12 freq droothie (2) - 1 freq couthie (2) - 70 freq fouthie (2) - 15 freq ruthie (2) - 4 freq growthie (2) - 9 freq roushie (2) - 17 freq youthie (2) - 1 freq rowthie (2) - 9 freq froathin (3) - 1 freq louie (3) - 4 freq uncouthie (3) - 3 freq brounie (3) - 4 freq foothie (3) - 3 freq moothie (3) - 4 freq stoushie (3) - 3 freq drousie (3) - 1 freq loutin (3) - 3 freq crouslie (3) - 1 freq loathit (3) - 2 freq grottie (3) - 1 freq forthie (3) - 1 freq crouchit (3) - 1 freq touchie (3) - 30 freq |
lrouthie (0) - 1 freq drouthie (2) - 12 freq ruthie (3) - 4 freq droothie (3) - 1 freq loathe (4) - 2 freq crathie (4) - 1 freq lenthie (4) - 1 freq lathie (4) - 1 freq drouth (4) - 49 freq routh (4) - 3 freq worthie (4) - 5 freq forthie (4) - 1 freq drouthy (4) - 17 freq froathe (4) - 1 freq rowthie (4) - 9 freq growthie (4) - 9 freq roushie (4) - 17 freq youthie (4) - 1 freq fouthie (4) - 15 freq couthie (4) - 70 freq luthrie (5) - 1 freq groattie (5) - 1 freq rooshie (5) - 1 freq trophie (5) - 1 freq braethe (5) - 6 freq |
SoundEx code - L630 lairdie - 3 freq laird - 172 freq lord' - 3 freq 'lord - 8 freq lord - 396 freq lourdie - 2 freq laired - 8 freq lowert - 1 freq lowered - 25 freq lard - 4 freq lourd - 11 freq leered - 1 freq leart - 4 freq lyart - 7 freq lairt - 5 freq loured - 4 freq leared - 1 freq lowerit - 1 freq lrouthie - 1 freq lart - 1 freq loard - 244 freq 'loard - 10 freq loardo - 1 freq loard' - 2 freq 'loard' - 1 freq lured - 2 freq lurid - 1 freq 'lord' - 1 freq layert - 2 freq leirit - 24 freq lowurd - 1 freq layered - 3 freq loert - 2 freq laureate - 3 freq lairit - 1 freq lorde - 4 freq learit - 3 freq €˜laird - 1 freq leired - 1 freq lerrit - 2 freq €œlaird - 2 freq lawert - 1 freq €œlord - 2 freq ‘lurredÂ’ - 1 freq lurredÂ’ - 1 freq lurred - 1 freq “lord - 1 freq |
MetaPhone code - LR0 lrouthie - 1 freq |
LROUTHIE |
| Time to execute Levenshtein function - 0.205755 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.394173 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.027851 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.040593 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.000864 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. |