| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| laptop (0) - 25 freq laptap (1) - 1 freq laptoap (1) - 1 freq laptops (1) - 1 freq lapdog (2) - 2 freq taptoo (2) - 1 freq raptor (2) - 1 freq taptip (2) - 1 freq captor (2) - 1 freq lipton (2) - 8 freq lapt (2) - 3 freq atop (2) - 6 freq lalor (3) - 8 freq cantor (3) - 1 freq aston (3) - 4 freq claptrap (3) - 4 freq santo (3) - 1 freq lutton (3) - 1 freq apo (3) - 150 freq manto (3) - 1 freq laubor (3) - 1 freq labeo (3) - 1 freq laits (3) - 2 freq laebor (3) - 1 freq lateh (3) - 1 freq |
laptop (0) - 25 freq laptoap (1) - 1 freq laptap (1) - 1 freq laptops (2) - 1 freq lipton (3) - 8 freq taptip (3) - 1 freq lapt (3) - 3 freq lept (4) - 2 freq lepp (4) - 2 freq leapt (4) - 11 freq lopp (4) - 1 freq toptip (4) - 1 freq raptor (4) - 1 freq fptp (4) - 7 freq atop (4) - 6 freq lipt (4) - 1 freq lapdog (4) - 2 freq captor (4) - 1 freq uptap (4) - 1 freq taptoo (4) - 1 freq watp (5) - 1 freq lappin (5) - 20 freq pop (5) - 82 freq lat (5) - 555 freq hapt (5) - 5 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 |
LAPTOP |
| Time to execute Levenshtein function - 0.242164 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.528244 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.038669 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.050911 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.001329 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. |