| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anguish (0) - 5 freq anglish (1) - 1 freq ang'uish (1) - 1 freq english (2) - 1469 freq langish (2) - 1 freq inglish (2) - 156 freq anguished (2) - 2 freq angus (2) - 120 freq angieh (2) - 1 freq panglish (2) - 1 freq engish (2) - 2 freq inglesh (3) - 3 freq linguist (3) - 7 freq asquith (3) - 1 freq aneugh (3) - 15 freq biggish (3) - 2 freq augist (3) - 1 freq agust (3) - 1 freq gush (3) - 2 freq anglais (3) - 2 freq an-ugh (3) - 1 freq arguin (3) - 16 freq inglisch (3) - 4 freq engurlish (3) - 3 freq spluish (3) - 1 freq |
anguish (0) - 5 freq engish (2) - 2 freq ang'uish (2) - 1 freq anglish (2) - 1 freq angus (3) - 120 freq angieh (3) - 1 freq anguished (3) - 2 freq inglish (3) - 156 freq english (3) - 1469 freq langish (3) - 1 freq nourish (4) - 2 freq angst (4) - 4 freq angleesh (4) - 7 freq englishy (4) - 1 freq engliesh (4) - 9 freq rogueish (4) - 1 freq engisl (4) - 1 freq notish (4) - 2 freq inrush (4) - 2 freq aneugh (4) - 15 freq endish (4) - 1 freq ngist (4) - 2 freq inglesh (4) - 3 freq panglish (4) - 1 freq gush (4) - 2 freq |
SoundEx code - A522 anxiously - 38 freq anxious - 56 freq anzacs - 1 freq anguished - 2 freq angus - 120 freq ancestor - 16 freq ancestral - 14 freq anguish - 5 freq aonghas - 59 freq aonghas' - 8 freq anzac - 1 freq ancus - 2 freq ancestors - 54 freq ancestor's - 1 freq ang'uish - 1 freq anxious-lookin - 1 freq anxious-wye - 1 freq amazes - 3 freq ancestirs - 1 freq ancestry - 6 freq angicised - 1 freq aneuch's - 1 freq ah'mjist - 1 freq angusglens - 1 freq ane-saxt - 1 freq amigos - 2 freq ane-question - 1 freq ancestrial - 1 freq ancestor-warld - 1 freq ankshis - 2 freq angusmacneilsnp - 15 freq ancestor- - 1 freq anyexcuseforanip - 1 freq angusrobertson - 1 freq angiesliverpool - 2 freq aonghasmacleoid - 1 freq |
MetaPhone code - ANKX anguish - 5 freq ang'uish - 1 freq |
ANGUISH |
| Time to execute Levenshtein function - 0.188196 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.375060 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.027515 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.037319 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.000952 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. |