| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| padlock (0) - 5 freq wadlock (1) - 1 freq pauldock (2) - 1 freq warlock (2) - 43 freq wedlock (2) - 4 freq headlock (2) - 1 freq pollock (2) - 3 freq paddick (2) - 1 freq puddock (2) - 34 freq parrock (2) - 2 freq aclock (2) - 1 freq deadlock (2) - 1 freq haddock (2) - 13 freq paycock (2) - 5 freq block (3) - 55 freq walloch (3) - 1 freq willock (3) - 1 freq patrick (3) - 32 freq plouk (3) - 11 freq haimlock (3) - 7 freq €˜lock (3) - 1 freq madlove (3) - 3 freq pollocks (3) - 1 freq plutock (3) - 17 freq alick (3) - 1 freq |
padlock (0) - 5 freq wadlock (2) - 1 freq puddock (3) - 34 freq deadlock (3) - 1 freq paddick (3) - 1 freq pollock (3) - 3 freq wedlock (3) - 4 freq headlock (3) - 1 freq plack (4) - 3 freq pluck (4) - 11 freq playock (4) - 1 freq paycock (4) - 5 freq publick (4) - 20 freq haddock (4) - 13 freq warlock (4) - 43 freq pauldock (4) - 1 freq aclock (4) - 1 freq parrock (4) - 2 freq pyock (5) - 8 freq palak (5) - 1 freq gullock (5) - 3 freq i'dock (5) - 1 freq hillock (5) - 8 freq 'slock (5) - 1 freq plook (5) - 21 freq |
SoundEx code - P342 petals - 22 freq padlock - 5 freq puddles - 12 freq podlie's - 1 freq pitlochory - 1 freq pathologically - 1 freq peitiless - 2 freq pitlochry - 7 freq paiddles - 2 freq pitiless - 1 freq peetiless - 1 freq piddles - 4 freq pedals - 3 freq pot-holes - 1 freq pathologist - 1 freq pathological - 1 freq paddles - 1 freq potlicht - 1 freq ptlz - 1 freq padlocks” - 1 freq |
MetaPhone code - PTLK padlock - 5 freq |
PADLOCK |
| Time to execute Levenshtein function - 0.201142 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.334748 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.055651 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.037107 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.000818 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. |