| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lowland (0) - 32 freq lawland (1) - 20 freq lowlands (1) - 5 freq lowlans (1) - 1 freq howlan (2) - 11 freq lowmond (2) - 3 freq lowlander (2) - 1 freq poland (2) - 10 freq norland (2) - 9 freq lawlands (2) - 4 freq roland (2) - 2 freq lowan (2) - 6 freq lawlans (2) - 6 freq lowpan (2) - 2 freq copland (2) - 6 freq holland (2) - 17 freq lamland (2) - 1 freq gowlan (2) - 1 freq lapland (2) - 3 freq ootland (2) - 5 freq bland (3) - 7 freq loard (3) - 244 freq lullan (3) - 1 freq loans (3) - 11 freq solaid (3) - 4 freq |
lowland (0) - 32 freq lawland (1) - 20 freq lowlans (2) - 1 freq lowlands (2) - 5 freq lawlands (3) - 4 freq lawlans (3) - 6 freq lowmond (3) - 3 freq lamland (3) - 1 freq lapland (3) - 3 freq lowlander (3) - 1 freq gowlan (4) - 1 freq legoland (4) - 2 freq lowsened (4) - 2 freq holland (4) - 17 freq lawlander (4) - 1 freq ootland (4) - 5 freq poland (4) - 10 freq howlan (4) - 11 freq copland (4) - 6 freq roland (4) - 2 freq norland (4) - 9 freq lowan (4) - 6 freq lowpan (4) - 2 freq lowein (5) - 1 freq clelland (5) - 2 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 |
LOWLAND |
| Time to execute Levenshtein function - 0.324239 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.396111 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.026989 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.037058 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.000898 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. |