Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
aground (0) - 1 freq agrund (1) - 3 freq ground (1) - 58 freq around (1) - 158 freq graund (2) - 24 freq €˜round (2) - 1 freq round (2) - 122 freq agrouf (2) - 2 freq gruund (2) - 4 freq grounds (2) - 12 freq agrun (2) - 1 freq aroond (2) - 513 freq aroun (2) - 129 freq groundr (2) - 1 freq groun' (2) - 1 freq abound (2) - 2 freq groued (2) - 7 freq groond (2) - 74 freq groun (2) - 7 freq aroun' (2) - 6 freq grund (2) - 273 freq groundet (3) - 10 freq grown (3) - 138 freq bound (3) - 58 freq almond (3) - 4 freq |
aground (0) - 1 freq ground (1) - 58 freq agrund (1) - 3 freq groond (2) - 74 freq gruund (2) - 4 freq graund (2) - 24 freq around (2) - 158 freq grund (2) - 273 freq groun (3) - 7 freq groued (3) - 7 freq graand (3) - 4 freq groun' (3) - 1 freq groaned (3) - 10 freq grind (3) - 26 freq grand (3) - 363 freq agrun (3) - 1 freq round (3) - 122 freq aroond (3) - 513 freq grounds (3) - 12 freq groundr (3) - 1 freq grunds (4) - 25 freq graun (4) - 9 freq groon' (4) - 1 freq frond (4) - 1 freq grained (4) - 4 freq |
SoundEx code - A265 assurance - 6 freq asseerin - 1 freq agreement - 36 freq assurances - 2 freq ayegreen - 3 freq agrund - 3 freq acorns-only - 1 freq acrm - 1 freq accurense - 1 freq acurren - 1 freq agrun - 1 freq accurenses - 1 freq agreein - 8 freq agreemint - 3 freq aquarium - 3 freq aground - 1 freq acquiring - 1 freq acorns - 1 freq achernar - 1 freq agreements - 2 freq agreean - 1 freq acorn - 2 freq akram - 1 freq aye-growein - 1 freq acquirin - 3 freq aswerin - 1 freq aye-growin - 1 freq ashram - 6 freq €˜ashram - 1 freq akraness - 1 freq aiajrnhh - 1 freq agreement- - 1 freq agreeing - 2 freq askramsey - 1 freq acrimonious - 1 freq agrandadathome - 6 freq agri-env - 1 freq |
MetaPhone code - AKRNT agrund - 3 freq aground - 1 freq |
AGROUND |
Time to execute Levenshtein function - 0.239967 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.377898 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.034774 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.038740 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.000955 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. |