| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| toonland (0) - 1 freq toonlan' (1) - 1 freq toonlan (1) - 2 freq toonlanns (2) - 1 freq woodland (2) - 1 freq ootland (2) - 5 freq moorland (2) - 3 freq doonlaid (2) - 2 freq copland (3) - 6 freq thoosand (3) - 115 freq thailand (3) - 7 freq norland (3) - 9 freq roondan (3) - 4 freq doonload (3) - 8 freq thoonsans (3) - 1 freq oonkind (3) - 1 freq copeland (3) - 1 freq toolin (3) - 1 freq zkotland (3) - 5 freq toonheid (3) - 1 freq toonsman (3) - 1 freq scorland (3) - 1 freq tomholland (3) - 1 freq toosled (3) - 2 freq tooled (3) - 3 freq |
toonland (0) - 1 freq toonlan (2) - 2 freq toonlan' (2) - 1 freq ootland (3) - 5 freq finland (4) - 7 freq inland (4) - 5 freq mainland (4) - 19 freq ootlaund (4) - 1 freq outland (4) - 2 freq tland (4) - 3 freq pounlund (4) - 1 freq vinland (4) - 2 freq tarland (4) - 4 freq woodland (4) - 1 freq moorland (4) - 3 freq doonlaid (4) - 2 freq toonlanns (4) - 1 freq thailand (4) - 7 freq ootlan (5) - 1 freq roland (5) - 2 freq poland (5) - 10 freq doonwind (5) - 1 freq lowland (5) - 32 freq moorlaand (5) - 1 freq doonload (5) - 8 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 - TNLNT toonland - 1 freq |
TOONLAND |
| Time to execute Levenshtein function - 0.249382 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.440537 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.035095 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.039370 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.000932 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. |