| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lowlands-l (0) - 5 freq lowlands (2) - 5 freq lowlanders (3) - 1 freq lowland (3) - 32 freq lowlans (3) - 1 freq lowlander (3) - 1 freq lawlands (3) - 4 freq lawlander (4) - 1 freq newlands (4) - 2 freq plewlands (4) - 2 freq €œlowlands (4) - 1 freq lawlans (4) - 6 freq lawlanders (4) - 1 freq boglands (4) - 1 freq prowlandson (4) - 1 freq lawland (4) - 20 freq lochlands (4) - 1 freq wetlands (5) - 1 freq wands (5) - 7 freq commands (5) - 4 freq loard'll (5) - 2 freq poland (5) - 10 freq scotlands (5) - 2 freq comaands (5) - 1 freq sowans (5) - 1 freq |
lowlands-l (0) - 5 freq lowlands (4) - 5 freq lawlands (5) - 4 freq lowlander (6) - 1 freq lowlans (6) - 1 freq lowlanders (6) - 1 freq lowland (6) - 32 freq lawlanders (7) - 1 freq lawlans (7) - 6 freq lawland (7) - 20 freq lawlander (7) - 1 freq newlands (7) - 2 freq plewlands (7) - 2 freq €œlowlands (8) - 1 freq lawlords (8) - 1 freq lochlands (8) - 1 freq prowlandson (8) - 1 freq boglands (8) - 1 freq waands (9) - 1 freq uplands (9) - 2 freq lowns (9) - 1 freq lands (9) - 59 freq lapland (9) - 3 freq garlands (9) - 2 freq midlands (9) - 3 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 - LLNTSL lowlands-l - 5 freq |
LOWLANDS-L |
| Time to execute Levenshtein function - 0.350055 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.546766 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.030688 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.043393 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.001091 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. |