| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lawland (0) - 20 freq lamland (1) - 1 freq lowland (1) - 32 freq lawlands (1) - 4 freq lapland (1) - 3 freq lawlans (1) - 6 freq fawkland (2) - 1 freq lowlands (2) - 5 freq lallan (2) - 6 freq tarland (2) - 4 freq laand (2) - 69 freq lowlans (2) - 1 freq pauland (2) - 1 freq lawlander (2) - 1 freq garland (2) - 5 freq farland (2) - 1 freq flawsand (2) - 1 freq lallans (2) - 136 freq mawlana (2) - 1 freq falkland (3) - 6 freq lawns (3) - 3 freq lawless (3) - 4 freq lamban (3) - 2 freq gangand (3) - 1 freq blaand (3) - 1 freq |
lawland (0) - 20 freq lowland (1) - 32 freq lawlans (2) - 6 freq lapland (2) - 3 freq lawlands (2) - 4 freq lamland (2) - 1 freq lawlander (3) - 1 freq lowlans (3) - 1 freq lowlands (3) - 5 freq farland (4) - 1 freq lallans (4) - 136 freq mawlana (4) - 1 freq lowlander (4) - 1 freq legoland (4) - 2 freq lowmond (4) - 3 freq flawsand (4) - 1 freq tarland (4) - 4 freq lallan (4) - 6 freq laand (4) - 69 freq fawkland (4) - 1 freq garland (4) - 5 freq pauland (4) - 1 freq plewlands (5) - 2 freq waylaid (5) - 2 freq wand (5) - 14 freq |
SoundEx code - L453 lawlands - 4 freq lowland - 32 freq lowlands - 5 freq lowlanders - 1 freq lawland - 20 freq lawlander - 1 freq lawlanders - 1 freq lowlands-l - 5 freq lowlander - 1 freq €œlowlands - 1 freq lilianedwards - 2 freq |
MetaPhone code - LLNT lowland - 32 freq lawland - 20 freq |
LAWLAND |
| Time to execute Levenshtein function - 0.201160 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.344133 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.027650 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.037476 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.000941 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. |