| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laptap (0) - 1 freq laptoap (1) - 1 freq laptop (1) - 25 freq claptrap (2) - 4 freq taptip (2) - 1 freq a-tap (2) - 1 freq lappan (2) - 1 freq lapsan (2) - 1 freq uptap (2) - 1 freq laptops (2) - 1 freq atap (2) - 23 freq lapt (2) - 3 freq clapp (3) - 1 freq apt (3) - 45 freq lepp (3) - 2 freq plap (3) - 2 freq ta-ta (3) - 2 freq laan (3) - 9 freq lappin (3) - 20 freq uptak (3) - 14 freq kaftan (3) - 1 freq wanhap (3) - 1 freq lapel (3) - 3 freq fptp (3) - 7 freq liltan (3) - 1 freq |
laptap (0) - 1 freq laptoap (1) - 1 freq laptop (1) - 25 freq lapt (3) - 3 freq laptops (3) - 1 freq taptip (3) - 1 freq uptap (3) - 1 freq leapt (4) - 11 freq lept (4) - 2 freq lipton (4) - 8 freq fptp (4) - 7 freq toptip (4) - 1 freq lipt (4) - 1 freq lepp (4) - 2 freq lopp (4) - 1 freq lappan (4) - 1 freq a-tap (4) - 1 freq claptrap (4) - 4 freq atap (4) - 23 freq lapsan (4) - 1 freq kepta (5) - 1 freq liftan (5) - 3 freq laep (5) - 2 freq lustan (5) - 1 freq latter (5) - 25 freq |
SoundEx code - L131 laptop - 25 freq luvvy-duvvy - 1 freq laptops - 1 freq luftwafe - 1 freq lovey-dovey - 1 freq lift-pod - 2 freq liftoff - 2 freq leftovers - 3 freq leftpeggers - 106 freq lbtppuaftn - 1 freq lptpyuk - 1 freq lowpitbower - 1 freq laptoap - 1 freq luftwaffe - 1 freq leftover - 1 freq laptap - 1 freq |
MetaPhone code - LPTP laptop - 25 freq laptoap - 1 freq laptap - 1 freq |
LAPTAP |
| Time to execute Levenshtein function - 1.078177 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 - 1.907345 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.027936 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.090466 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.273799 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. |