| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lamposts (0) - 1 freq lampposts (1) - 5 freq bampots (2) - 8 freq lumpposts (2) - 1 freq lamppost (2) - 1 freq lumpots (2) - 1 freq limpets (3) - 2 freq amost (3) - 1 freq goalposts (3) - 1 freq lampstan (3) - 1 freq ramparts (3) - 2 freq compost (3) - 7 freq lacoste (3) - 7 freq lempets (3) - 2 freq amoonts (3) - 10 freq ootposts (3) - 1 freq imports (3) - 2 freq papists (3) - 2 freq samosas (3) - 1 freq lamplit (3) - 1 freq laists (3) - 1 freq lampit (3) - 2 freq pasports (3) - 1 freq lamont (3) - 8 freq imposes (3) - 1 freq |
lamposts (0) - 1 freq lampposts (2) - 5 freq lumpposts (3) - 1 freq lumpots (3) - 1 freq lempets (4) - 2 freq limpits (4) - 1 freq lampstan (4) - 1 freq limpets (4) - 2 freq bampots (4) - 8 freq lamppost (4) - 1 freq lamps (5) - 36 freq posts (5) - 45 freq lasts (5) - 17 freq imposes (5) - 1 freq clampetts (5) - 1 freq lambast (5) - 1 freq laments (5) - 9 freq lampless (5) - 1 freq campsites (5) - 1 freq lampit (5) - 2 freq gateposts (5) - 1 freq ootposts (5) - 1 freq compost (5) - 7 freq ramparts (5) - 2 freq goalposts (5) - 1 freq |
SoundEx code - L512 lamps - 36 freq limbs - 41 freq lambs - 57 freq lumps - 24 freq line-ups - 1 freq lambies - 4 freq lamb-stew - 1 freq lambeg - 5 freq lump's - 2 freq lamppost - 1 freq lambs' - 3 freq lumbs - 1 freq lumpposts - 1 freq lampposts - 5 freq lampstan - 1 freq lamb's - 2 freq lambegs - 1 freq lambie-sheep - 1 freq lamposts - 1 freq laumps - 1 freq lambikie - 1 freq lampshade - 1 freq limps - 1 freq lewmpgxkiz - 1 freq lmubkyb - 1 freq lanpaisleymp - 2 freq lambast - 1 freq llmvc - 1 freq lnwfj - 1 freq lampjaded - 1 freq |
MetaPhone code - LMPSTS lumpposts - 1 freq lampposts - 5 freq lamposts - 1 freq |
LAMPOSTS |
| Time to execute Levenshtein function - 0.253497 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.386232 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.028089 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.047233 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.001049 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. |