| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tomholland (0) - 1 freq holland (3) - 17 freq toonland (3) - 1 freq thousand (4) - 16 freq homeland (4) - 1 freq toonlan' (4) - 1 freq toonlan (4) - 2 freq thoosand (4) - 115 freq tomlang (4) - 3 freq thailand (4) - 7 freq timberland (4) - 2 freq hollande (4) - 1 freq tombola (4) - 2 freq woodland (4) - 1 freq thowsand (4) - 3 freq moorland (4) - 3 freq ootland (4) - 5 freq compellin (5) - 5 freq pechtland (5) - 2 freq cumberland (5) - 6 freq corollary (5) - 2 freq wonderland (5) - 8 freq tourscotland (5) - 3 freq complenand (5) - 1 freq shatland (5) - 1 freq |
tomholland (0) - 1 freq holland (5) - 17 freq hollande (6) - 1 freq timberland (6) - 2 freq thailand (6) - 7 freq toonland (6) - 1 freq tummelled (7) - 2 freq thowsand (7) - 3 freq ootland (7) - 5 freq gauchalland (7) - 1 freq moorland (7) - 3 freq thousand (7) - 16 freq thoosand (7) - 115 freq camellando (7) - 1 freq tomlang (7) - 3 freq homeland (7) - 1 freq towellin (8) - 1 freq sutherland (8) - 12 freq tinhalla (8) - 1 freq mullan (8) - 2 freq hallan (8) - 1 freq trolling (8) - 3 freq tholyd (8) - 1 freq hieland (8) - 16 freq trellan (8) - 2 freq |
SoundEx code - T545 tummlin - 26 freq toonlan - 2 freq toonland - 1 freq toonlan' - 1 freq toonlanns - 1 freq timeline - 14 freq tummlan - 1 freq tim'line - 1 freq tomlinson - 1 freq tummelin - 1 freq tumlin - 1 freq tinlin - 1 freq tmlewin - 1 freq teamleon - 1 freq tomlang - 3 freq tomholland - 1 freq |
MetaPhone code - TMHLNT tomholland - 1 freq |
TOMHOLLAND |
| Time to execute Levenshtein function - 0.221122 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.400861 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.028510 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.038448 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.000902 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. |