Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
angus (0) - 117 freq argus (1) - 1 freq agus (1) - 3 freq ancus (1) - 2 freq rangs (2) - 2 freq agg's (2) - 1 freq dangul (2) - 1 freq nus (2) - 5 freq tangs (2) - 1 freq langs (2) - 1 freq lang's (2) - 32 freq agun (2) - 1 freq angst (2) - 3 freq augur (2) - 1 freq gangs (2) - 147 freq ang'r (2) - 2 freq tangue (2) - 1 freq ane's (2) - 11 freq gus (2) - 19 freq anyun (2) - 1 freq nous (2) - 9 freq mingus (2) - 1 freq langue (2) - 2 freq angel (2) - 113 freq bangs (2) - 13 freq |
angus (0) - 117 freq ancus (2) - 2 freq ngs (2) - 1 freq agus (2) - 3 freq argus (2) - 1 freq pangs (3) - 2 freq angry (3) - 79 freq mangos (3) - 1 freq anas (3) - 9 freq kangas (3) - 2 freq nghs (3) - 1 freq anger (3) - 68 freq anns (3) - 1 freq langues (3) - 1 freq magus (3) - 1 freq hangs (3) - 3 freq angles (3) - 25 freq anits (3) - 2 freq ags (3) - 1 freq anes (3) - 218 freq ranges (3) - 2 freq hogus (3) - 2 freq aiggs (3) - 4 freq anglo (3) - 2 freq fngs (3) - 1 freq |
SoundEx code - A522 anxiously - 38 freq anxious - 54 freq anzacs - 1 freq anguished - 2 freq angus - 117 freq ancestor - 16 freq ancestral - 14 freq anguish - 4 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 aonghas - 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 - ANKS anxi - 4 freq angus - 117 freq ancus - 2 freq annexe - 1 freq annex - 4 freq |
ANGUS |
Time to execute Levenshtein function - 0.551613 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 - 1.086043 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.078567 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.096197 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.001374 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. |