| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| expeckin (0) - 21 freq expeckit (1) - 31 freq expectin (1) - 64 freq peckin (2) - 16 freq expeck (2) - 53 freq expeckin's (2) - 1 freq expecktit (2) - 1 freq expecting (2) - 12 freq expecks (2) - 3 freq expellin (2) - 1 freq expectin' (2) - 1 freq expectan (2) - 7 freq expekkit (2) - 5 freq expectit (2) - 34 freq expecktint (2) - 2 freq expecit (2) - 2 freq expecin' (2) - 1 freq respeckin (2) - 2 freq expeckin't (2) - 1 freq neckin (3) - 3 freq exceedin (3) - 1 freq expek (3) - 1 freq wreckin (3) - 3 freq packin (3) - 20 freq speekin (3) - 1 freq |
expeckin (0) - 21 freq expectin (2) - 64 freq expeckit (2) - 31 freq expecks (3) - 3 freq expeck (3) - 53 freq peckin (3) - 16 freq expectan (3) - 7 freq packin (4) - 20 freq unpickin (4) - 1 freq expeckin't (4) - 1 freq pickin (4) - 108 freq puckin (4) - 10 freq spickin (4) - 58 freq respeckin (4) - 2 freq speckan (4) - 2 freq unpackin (4) - 1 freq expecit (4) - 2 freq expellin (4) - 1 freq expectin' (4) - 1 freq expecting (4) - 12 freq expecktit (4) - 1 freq expeckin's (4) - 1 freq expecin' (4) - 1 freq expekkit (4) - 5 freq spackin (4) - 5 freq |
SoundEx code - E212 expects - 6 freq expectin - 64 freq expeck - 53 freq espeecially - 9 freq especial - 6 freq expectit - 34 freq eeksie-peeksie - 4 freq exposed - 30 freq especially - 215 freq expected - 41 freq expect - 118 freq equipoise - 2 freq expeckin - 21 freq expeckit - 31 freq expectation - 11 freq easy-peasy - 4 freq expecit - 2 freq expectations - 14 freq expose - 7 freq eispeshially - 1 freq expoased - 1 freq expecin' - 1 freq easy-peesie - 1 freq espeeshully - 8 freq ex-page - 1 freq exposure - 17 freq especailly - 1 freq expecting - 12 freq expectan - 7 freq escapes - 4 freq expectet - 2 freq ex-boss - 1 freq expeckin't - 1 freq expecktint - 2 freq expecktations - 3 freq expec - 8 freq equivocation - 1 freq expositor - 1 freq espeicially - 1 freq exposion - 1 freq 'expectan' - 1 freq exposin - 6 freq expekkit - 5 freq eeksiepeeksie - 1 freq expeckin's - 1 freq espheeshully - 1 freq echo-vyces - 1 freq expecktit - 1 freq exposé - 1 freq essibag - 2 freq essibags - 1 freq expect' - 1 freq expository - 24 freq expeckit's - 1 freq egg-box - 1 freq exposeetions - 2 freq exposeitions - 1 freq 'eeksi-peeksie - 1 freq exposeetion - 2 freq espeeshilly - 1 freq espeeshally - 1 freq expecks - 3 freq expectancy - 2 freq expositioun - 1 freq expek - 1 freq espaecially - 1 freq espaicial - 2 freq expcect - 1 freq exposing - 1 freq expectantly - 6 freq expectin' - 1 freq €˜exposin - 1 freq easy-peasie - 1 freq esps - 2 freq espaiciallie - 1 freq ex-howpasley - 1 freq essybags - 1 freq escapist - 1 freq espece - 1 freq especialy - 1 freq espeshlee - 1 freq ecxipsjog - 1 freq eucbs - 1 freq expected- - 1 freq eeaeuqvga - 1 freq ecfcpodcast - 1 freq exposur - 1 freq espicially - 2 freq exufc - 1 freq eqfqo - 1 freq eugfwzfdhe - 1 freq exposhur - 1 freq ewwyghbscs - 1 freq ecbqv - 1 freq ehegxpxm - 1 freq expuqpv - 1 freq ezjapsmjvy - 1 freq especia - 1 freq eacchiefexec - 1 freq |
MetaPhone code - EKSPKN expeckin - 21 freq |
EXPECKIN |
| Time to execute Levenshtein function - 0.184145 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.330251 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.027460 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.036818 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.000864 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. |