| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ansible (0) - 2 freq aible (2) - 2 freq risible (2) - 1 freq faisible (2) - 3 freq sinsible (2) - 1 freq tangible (2) - 4 freq visible (2) - 25 freq audible (2) - 4 freq anbile (2) - 1 freq sensible (2) - 34 freq disable (3) - 1 freq cansilt (3) - 1 freq annie (3) - 108 freq onsite (3) - 1 freq ainle (3) - 2 freq aside (3) - 474 freq anvils (3) - 1 freq aisle (3) - 27 freq ensemble (3) - 4 freq apsire (3) - 1 freq angle (3) - 22 freq unvisible (3) - 1 freq tarrible (3) - 7 freq oanside (3) - 1 freq ible (3) - 1 freq |
ansible (0) - 2 freq visible (3) - 25 freq sensible (3) - 34 freq sinsible (3) - 1 freq anbile (3) - 1 freq risible (3) - 1 freq faisible (3) - 3 freq invisible (4) - 44 freq unstable (4) - 1 freq enable (4) - 4 freq nimble (4) - 1 freq noble (4) - 32 freq poasible (4) - 1 freq visibly (4) - 9 freq yaisable (4) - 1 freq paesable (4) - 1 freq veisible (4) - 1 freq visable (4) - 1 freq unable (4) - 19 freq sable (4) - 2 freq unviable (4) - 1 freq nuisle (4) - 1 freq nibble (4) - 8 freq sensibly (4) - 2 freq enviable (4) - 1 freq |
SoundEx code - A521 ansible - 2 freq anchovies - 3 freq amicable - 2 freq an'spoarts - 1 freq awe-inspirin - 1 freq amyspineapple - 1 freq aimeespalds - 1 freq anghyflawn - 4 freq amcphersonafc - 4 freq annecb - 2 freq annesavage - 1 freq amgove - 1 freq amjvdz - 1 freq anasforleader - 1 freq amgeever - 1 freq |
MetaPhone code - ANSBL ansible - 2 freq |
ANSIBLE |
| Time to execute Levenshtein function - 0.250702 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.501698 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.028780 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.038070 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.002306 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. |