| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| agree (0) - 159 freq agee (1) - 1 freq gree (1) - 102 freq agrees (1) - 13 freq agreet (1) - 17 freq aglee (1) - 1 freq agreed (1) - 106 freq 'gree (1) - 2 freq -tree (2) - 1 freq 'tree (2) - 1 freq oagre (2) - 1 freq magret (2) - 2 freq aren (2) - 3 freq gwee (2) - 1 freq zagreb (2) - 1 freq agr (2) - 1 freq gren (2) - 1 freq agate (2) - 2 freq grae (2) - 4 freq arne (2) - 1 freq ayres (2) - 1 freq abreed (2) - 5 freq grene (2) - 15 freq agrun (2) - 1 freq greer (2) - 6 freq |
agree (0) - 159 freq gree (1) - 102 freq agr (2) - 1 freq gre (2) - 4 freq grei (2) - 1 freq grae (2) - 4 freq agri (2) - 1 freq grue (2) - 56 freq grye (2) - 1 freq grey (2) - 349 freq oagre (2) - 1 freq aglee (2) - 1 freq agreet (2) - 17 freq agrees (2) - 13 freq agee (2) - 1 freq agreed (2) - 106 freq 'gree (2) - 2 freq grie (2) - 6 freq ogre (2) - 1 freq free (3) - 649 freq aggie (3) - 49 freq greh (3) - 1 freq tree (3) - 612 freq agen (3) - 12 freq 'grey (3) - 1 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 |
AGREE |
| Time to execute Levenshtein function - 0.361354 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.600849 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.028400 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.077112 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.001330 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. |