| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eaglet (0) - 14 freq haglet (1) - 1 freq eagles (1) - 11 freq eagled (1) - 1 freq eagle (1) - 20 freq pglet (2) - 5 freq boglet (2) - 1 freq hagglet (2) - 2 freq tanglet (2) - 1 freq pallet (2) - 3 freq hamlet (2) - 10 freq magnet (2) - 16 freq geeglet (2) - 1 freq eggle (2) - 2 freq easles (2) - 2 freq valet (2) - 1 freq magret (2) - 2 freq aglee (2) - 1 freq agley (2) - 44 freq ballet (2) - 4 freq easle (2) - 2 freq beagle (2) - 2 freq weeglet (2) - 1 freq eagle's (2) - 4 freq aget (2) - 1 freq |
eaglet (0) - 14 freq eagle (2) - 20 freq haglet (2) - 1 freq eagled (2) - 1 freq eagles (2) - 11 freq aget (3) - 1 freq galt (3) - 6 freq agley (3) - 44 freq glit (3) - 1 freq weeglet (3) - 1 freq aglee (3) - 1 freq gleet (3) - 8 freq gealt (3) - 3 freq glut (3) - 5 freq glt (3) - 1 freq taiglet (3) - 1 freq geeglet (3) - 1 freq pglet (3) - 5 freq boglet (3) - 1 freq valet (3) - 1 freq agent (4) - 14 freq palt (4) - 1 freq gimlet (4) - 1 freq guelt (4) - 1 freq agility (4) - 1 freq |
SoundEx code - E243 eagle-eyed - 2 freq eaglet - 14 freq ecouldnae - 1 freq equality - 34 freq escalator - 4 freq excelled - 1 freq exultation - 1 freq exhaled - 7 freq escalate - 3 freq escalates - 1 freq exalts - 1 freq excluded - 4 freq exclude - 4 freq ecaalt - 1 freq egalitarianism - 3 freq equality' - 1 freq excludet - 1 freq exiled - 6 freq ecouldna - 1 freq excludit - 7 freq equalitie - 4 freq equaility's - 1 freq excludit' - 1 freq ecalled - 1 freq easy-led - 1 freq eiggilt - 1 freq escalatit - 1 freq excludes - 1 freq egalitar-ian - 1 freq exultant - 1 freq exalted - 1 freq exaltit - 1 freq eagled - 1 freq excluding - 1 freq excludin - 1 freq eslidcmc - 1 freq |
MetaPhone code - EKLT eaglet - 14 freq equality - 34 freq ecaalt - 1 freq equality' - 1 freq equalitie - 4 freq ecalled - 1 freq eiggilt - 1 freq eagled - 1 freq |
EAGLET |
| Time to execute Levenshtein function - 0.179517 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.354962 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.031033 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.038075 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.000936 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. |