Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
aunt (0) - 75 freq aunty (1) - 42 freq jaunt (1) - 15 freq taunt (1) - 2 freq vaunt (1) - 1 freq ant (1) - 8 freq haunt (1) - 28 freq bunt (1) - 6 freq saunt (1) - 14 freq alunt (1) - 1 freq munt (1) - 14 freq cunt (1) - 438 freq unt (1) - 1 freq gaunt (1) - 8 freq daunt (1) - 3 freq auct (1) - 1 freq aint (1) - 13 freq lunt (1) - 5 freq aunte (1) - 1 freq awnt (1) - 1 freq aund (1) - 2 freq aunts (1) - 10 freq hunt (1) - 62 freq runt (1) - 7 freq wunt (1) - 4 freq |
aunt (0) - 75 freq aint (1) - 13 freq aunte (1) - 1 freq ant (1) - 8 freq unt (1) - 1 freq aunty (1) - 42 freq ent (2) - 3 freq yent (2) - 1 freq unto (2) - 8 freq nut (2) - 127 freq unyt (2) - 7 freq dunt (2) - 92 freq unit (2) - 41 freq auntie (2) - 157 freq unty (2) - 4 freq anat (2) - 1 freq nt (2) - 34 freq ante (2) - 1 freq anet (2) - 1 freq ayont (2) - 272 freq ont (2) - 5 freq nuyt (2) - 1 freq int (2) - 31 freq yont (2) - 14 freq junt (2) - 1 freq |
SoundEx code - A530 and - 24890 freq ahint - 743 freq ayont - 272 freq 'and - 179 freq aneth - 177 freq aneath - 105 freq ahent - 100 freq aimed - 15 freq andy - 151 freq annoyed - 45 freq aunt - 75 freq amid - 9 freq 'aneth - 1 freq aunty - 42 freq auntie - 157 freq awned - 27 freq 'andy' - 1 freq ained - 19 freq ane-eed - 1 freq awnt - 1 freq ahind - 11 freq ahin't - 2 freq annuity - 2 freq aneath' - 1 freq andie - 1 freq aeneid - 8 freq aneith - 8 freq anneith - 3 freq aunte - 1 freq amn't - 1 freq 'auntie - 1 freq anyday - 3 freq ain't - 9 freq awnit - 2 freq annoyt - 5 freq aint - 13 freq anyd - 2 freq aimeth - 1 freq ant - 8 freq a'waant - 1 freq amd - 2 freq 'aunty - 4 freq anddy - 1 freq aaind - 1 freq aind - 1 freq an'the - 1 freq aintae - 4 freq amdee - 1 freq anaeth - 1 freq aund - 2 freq anti - 11 freq ande - 4 freq aaned - 1 freq 'annoyed - 1 freq anaith - 6 freq ane-twa - 4 freq €˜aunt - 1 freq €˜and - 14 freq anet - 1 freq €”and - 8 freq €œayont - 1 freq €œand - 15 freq €¦and - 2 freq ahmed - 6 freq aand - 1 freq and-aa - 1 freq anotha - 1 freq aantie - 2 freq €˜annoyed - 1 freq €˜ayont - 1 freq amitie - 5 freq amity - 2 freq €™and - 2 freq annette - 1 freq anto - 1 freq “and - 1 freq ando - 1 freq aaaaaand - 1 freq anoot - 1 freq annewitha - 1 freq 'aunty' - 1 freq anaht - 1 freq anat - 1 freq andyh - 1 freq ante - 1 freq andÂ… - 1 freq ainÂ’t - 1 freq |
MetaPhone code - ANT and - 24890 freq 'and - 179 freq andy - 151 freq aunt - 75 freq aunty - 42 freq auntie - 157 freq awned - 27 freq 'andy' - 1 freq ained - 19 freq ane-eed - 1 freq awnt - 1 freq annuity - 2 freq andie - 1 freq aunte - 1 freq 'auntie - 1 freq anyday - 3 freq ain't - 9 freq awnit - 2 freq annoyt - 5 freq aint - 13 freq anyd - 2 freq ant - 8 freq 'aunty - 4 freq anddy - 1 freq aaind - 1 freq aind - 1 freq aintae - 4 freq aund - 2 freq anti - 11 freq ande - 4 freq aaned - 1 freq €˜aunt - 1 freq €˜and - 14 freq anet - 1 freq €”and - 8 freq €œand - 15 freq €¦and - 2 freq aand - 1 freq and-aa - 1 freq aantie - 2 freq €™and - 2 freq annette - 1 freq anto - 1 freq “and - 1 freq ando - 1 freq aaaaaand - 1 freq anoot - 1 freq 'aunty' - 1 freq anaht - 1 freq anat - 1 freq andyh - 1 freq ante - 1 freq andÂ… - 1 freq ainÂ’t - 1 freq |
AUNT |
Time to execute Levenshtein function - 0.181826 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.310734 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.027772 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.036680 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.000968 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. |