| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ant (0) - 8 freq gant (1) - 15 freq anq (1) - 2 freq at (1) - 20079 freq aunt (1) - 75 freq ›nt (1) - 2 freq ont (1) - 5 freq snt (1) - 1 freq ans (1) - 2 freq anw (1) - 1 freq apt (1) - 45 freq aint (1) - 13 freq ante (1) - 1 freq any (1) - 691 freq aht (1) - 27 freq sant (1) - 5 freq pant (1) - 2 freq ent (1) - 3 freq art (1) - 88 freq anet (1) - 1 freq fant (1) - 2 freq aft (1) - 67 freq unt (1) - 1 freq alt (1) - 5 freq ants (1) - 5 freq |
ant (0) - 8 freq ent (1) - 3 freq nt (1) - 34 freq ante (1) - 1 freq anet (1) - 1 freq unt (1) - 1 freq int (1) - 31 freq anto (1) - 1 freq aint (1) - 13 freq anti (1) - 11 freq ont (1) - 5 freq anat (1) - 1 freq aunt (1) - 75 freq onti (2) - 8 freq init (2) - 1 freq anoot (2) - 1 freq not (2) - 712 freq and (2) - 24890 freq yent (2) - 1 freq nat (2) - 21 freq ang (2) - 8 freq att (2) - 451 freq ano (2) - 5 freq ane (2) - 2115 freq nit (2) - 10 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 |
ANT |
| Time to execute Levenshtein function - 0.288311 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.502029 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.061076 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.037241 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.000848 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. |