| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| akimbo (0) - 1 freq bimbo (2) - 1 freq akim (2) - 2 freq aitbo (2) - 1 freq crimbo (2) - 6 freq skibo (2) - 1 freq jimbo (2) - 1 freq akio (2) - 1 freq alamo (3) - 2 freq aim (3) - 51 freq apio (3) - 1 freq timpo (3) - 1 freq vimeo (3) - 2 freq nimmo (3) - 7 freq hatimo (3) - 3 freq skim's (3) - 2 freq aaib (3) - 1 freq citbo (3) - 1 freq aikido (3) - 1 freq skim (3) - 38 freq simba (3) - 1 freq crambo (3) - 1 freq skimpy (3) - 1 freq edimbro (3) - 2 freq skime (3) - 4 freq |
akimbo (0) - 1 freq akim (3) - 2 freq jimbo (3) - 1 freq bimbo (3) - 1 freq caimb (4) - 9 freq gambo (4) - 1 freq lambo (4) - 1 freq simba (4) - 1 freq kirb (4) - 1 freq kirby (4) - 3 freq jambo (4) - 5 freq dumbo (4) - 2 freq jumbo (4) - 13 freq mumbo (4) - 5 freq rambo (4) - 1 freq akio (4) - 1 freq skibo (4) - 1 freq crimbo (4) - 6 freq aitbo (4) - 1 freq symbo (4) - 1 freq kim (4) - 10 freq combo (4) - 5 freq kumbh (4) - 3 freq limb (4) - 14 freq kam (5) - 24 freq |
SoundEx code - A251 accompanit - 1 freq assembly - 26 freq accomplice - 3 freq accomplishments - 1 freq accompaniment - 6 freq assembled - 15 freq again-baith - 1 freq accompli - 1 freq assumptions - 6 freq assemble - 3 freq assemblie - 2 freq assumption - 12 freq accompanied - 22 freq accompany - 8 freq assembelt - 1 freq accompt - 2 freq accompts - 1 freq akimbo - 1 freq accomplishment - 1 freq auchinblae - 1 freq auchenfairlie - 1 freq assemblin - 1 freq accomplished - 2 freq accompanyin - 8 freq assembles - 1 freq auchenbinnie - 1 freq accomplist - 1 freq accumplished - 1 freq assumption¬ - 1 freq assemblan - 1 freq accomplisht - 3 freq accompong - 2 freq assembledin - 1 freq assemblet - 1 freq aknovh - 1 freq ahoajmfrwq - 1 freq accompanying - 1 freq aconfedofdunces - 1 freq |
MetaPhone code - AKM akim - 2 freq akimbo - 1 freq agm - 2 freq agam - 1 freq acum - 1 freq |
AKIMBO |
| Time to execute Levenshtein function - 0.190280 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.357260 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.027611 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.045682 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.004380 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. |