| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| anxious (0) - 56 freq enxious (1) - 4 freq unxious (1) - 1 freq invious (2) - 1 freq noxious (2) - 2 freq envious (2) - 2 freq anxiously (2) - 38 freq sairious (3) - 34 freq annoys (3) - 4 freq anits (3) - 2 freq axiom (3) - 1 freq fashious (3) - 20 freq annie's (3) - 8 freq onerous (3) - 1 freq vicious (3) - 17 freq furious (3) - 12 freq anchors (3) - 1 freq awmous (3) - 4 freq concious (3) - 4 freq axis (3) - 7 freq ancus (3) - 2 freq angus (3) - 120 freq anxiety (3) - 30 freq scrious (3) - 1 freq cairious (3) - 1 freq |
anxious (0) - 56 freq unxious (1) - 1 freq enxious (1) - 4 freq noxious (2) - 2 freq envious (3) - 2 freq anxiously (3) - 38 freq invious (3) - 1 freq aixis (4) - 3 freq inions (4) - 1 freq nicus (4) - 1 freq angus (4) - 120 freq anxiety (4) - 30 freq obnoxious (4) - 1 freq nous (4) - 9 freq unions (4) - 8 freq naxos (4) - 2 freq ancus (4) - 2 freq annies (4) - 1 freq onions (4) - 17 freq anxi (4) - 4 freq anyhoos (4) - 13 freq anits (4) - 2 freq annoys (4) - 4 freq axis (4) - 7 freq onerous (4) - 1 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 - ANKSS anxious - 56 freq |
ANXIOUS |
| Time to execute Levenshtein function - 0.201995 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.342719 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.029457 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.038660 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.000898 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. |