| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lowlander (0) - 1 freq lowlanders (1) - 1 freq lawlander (1) - 1 freq lowlands (2) - 5 freq lowland (2) - 32 freq colander (2) - 1 freq loulauder (2) - 1 freq ootlander (2) - 2 freq lawlanders (2) - 1 freq doolander (2) - 1 freq coriander (3) - 1 freq englander (3) - 1 freq callander (3) - 2 freq colanders (3) - 1 freq hollande (3) - 1 freq hielander (3) - 2 freq lander (3) - 13 freq slander (3) - 3 freq lowlans (3) - 1 freq icelander (3) - 3 freq waander (3) - 5 freq lawland (3) - 20 freq islander (3) - 1 freq allander (3) - 1 freq cowlder (3) - 1 freq |
lowlander (0) - 1 freq lawlander (1) - 1 freq lowlanders (2) - 1 freq lawlanders (3) - 1 freq lowland (3) - 32 freq lowlands (3) - 5 freq allander (4) - 1 freq lawlands (4) - 4 freq doolander (4) - 1 freq lawland (4) - 20 freq ootlander (4) - 2 freq loulauder (4) - 1 freq colander (4) - 1 freq cowlder (5) - 1 freq islander (5) - 1 freq wander (5) - 41 freq owlder (5) - 14 freq swaander (5) - 1 freq waander (5) - 5 freq outlander (5) - 3 freq englander (5) - 1 freq hielander (5) - 2 freq icelander (5) - 3 freq callander (5) - 2 freq lander (5) - 13 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 - LLNTR lawlander - 1 freq lowlander - 1 freq |
LOWLANDER |
| Time to execute Levenshtein function - 0.279771 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.444406 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.030016 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.037696 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.000869 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. |