| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lampposts (0) - 5 freq lamposts (1) - 1 freq lumpposts (1) - 1 freq lamppost (1) - 1 freq gateposts (3) - 1 freq bampots (3) - 8 freq lampless (3) - 1 freq lumpots (3) - 1 freq suppost (4) - 4 freq lappert (4) - 1 freq pamphlets (4) - 6 freq lamps (4) - 36 freq lamplit (4) - 1 freq passports (4) - 8 freq lampit (4) - 2 freq ootposts (4) - 1 freq goalposts (4) - 1 freq campos (4) - 1 freq compost (4) - 7 freq supposes (4) - 2 freq lamb-pot (4) - 1 freq lamont (4) - 8 freq lacoste (4) - 7 freq signposts (4) - 2 freq laments (4) - 9 freq |
lampposts (0) - 5 freq lumpposts (1) - 1 freq lamposts (2) - 1 freq lamppost (2) - 1 freq lumpots (5) - 1 freq lampless (5) - 1 freq limpits (6) - 1 freq lampstan (6) - 1 freq lempets (6) - 2 freq papists (6) - 2 freq gateposts (6) - 1 freq bampots (6) - 8 freq limpets (6) - 2 freq anapests (7) - 1 freq clampetts (7) - 1 freq posts (7) - 45 freq lappit (7) - 7 freq lamplichts (7) - 1 freq imposes (7) - 1 freq labbyists (7) - 4 freq lappers (7) - 1 freq appynts (7) - 1 freq muppets (7) - 5 freq opposites (7) - 2 freq lamp-lit (7) - 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 |
LAMPPOSTS |
| Time to execute Levenshtein function - 0.236926 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.372843 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.027348 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.037047 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.000892 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. |