| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aggro (0) - 3 freq giro (2) - 12 freq garo (2) - 1 freq aero (2) - 1 freq agri (2) - 1 freq astro (2) - 4 freq eggo (2) - 1 freq agno (2) - 1 freq aro (2) - 1 freq aggie (2) - 49 freq agg's (2) - 1 freq afro (2) - 2 freq andro (2) - 4 freq angry (2) - 84 freq aggle (2) - 2 freq agr (2) - 1 freq gro (2) - 3 freq argo (2) - 6 freq ggrr (2) - 1 freq ahgxo (2) - 1 freq ago (2) - 397 freq agg (2) - 6 freq anglo (2) - 2 freq air' (3) - 1 freq go (3) - 1980 freq |
aggro (0) - 3 freq angry (3) - 84 freq aggle (3) - 2 freq gro (3) - 3 freq agg (3) - 6 freq ggrr (3) - 1 freq aggie (3) - 49 freq agr (3) - 1 freq giro (3) - 12 freq garo (3) - 1 freq eggo (3) - 1 freq agri (3) - 1 freq aggrege (4) - 1 freq jagger (4) - 2 freq grou (4) - 11 freq mogre (4) - 1 freq eager (4) - 27 freq uggit (4) - 1 freq guru (4) - 11 freq wager (4) - 9 freq agree (4) - 159 freq gre (4) - 4 freq aiggs (4) - 4 freq gore (4) - 5 freq egg (4) - 95 freq |
SoundEx code - A260 agree - 159 freq assure - 21 freq assuir - 2 freq aisier - 12 freq azr - 1 freq ashore - 35 freq augury - 1 freq aggro - 3 freq aesir - 4 freq aiger - 2 freq ashaor - 1 freq ashoar - 3 freq accur - 1 freq acroo - 1 freq acre - 20 freq ajar - 4 freq azor - 4 freq asher - 1 freq azariah - 2 freq aser - 1 freq aesier - 13 freq acquire - 3 freq azure - 3 freq acer - 1 freq aikeray - 2 freq a'haacro - 1 freq auskerry - 1 freq akker - 1 freq asseer - 1 freq ackir - 1 freq acair - 1 freq asseir - 1 freq augur - 1 freq €™azur - 1 freq aesyir - 1 freq acher - 1 freq agr - 1 freq augher - 1 freq agri - 1 freq ajr - 1 freq ajer - 2 freq asure - 1 freq |
MetaPhone code - AKR agree - 159 freq augury - 1 freq aggro - 3 freq acroo - 1 freq acre - 20 freq aikeray - 2 freq akker - 1 freq ackir - 1 freq acair - 1 freq augur - 1 freq agr - 1 freq agri - 1 freq |
AGGRO |
| Time to execute Levenshtein function - 0.214569 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.343961 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.028852 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.040796 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.001069 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. |