| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| agreein (0) - 8 freq agreeit (1) - 2 freq greein (1) - 3 freq agreean (1) - 1 freq agreeing (1) - 2 freq 'greein (1) - 2 freq ageen (2) - 111 freq agreet (2) - 17 freq angreen (2) - 1 freq grenein (2) - 1 freq greenin (2) - 7 freq preein (2) - 11 freq agreemint (2) - 3 freq agree (2) - 159 freq greyin (2) - 2 freq airsein (2) - 1 freq argeein (2) - 2 freq grekin (2) - 1 freq geein (2) - 42 freq dreein (2) - 1 freq agein (2) - 13 freq agreed (2) - 106 freq freein (2) - 3 freq agrees (2) - 13 freq arreevin (2) - 1 freq |
agreein (0) - 8 freq agreean (1) - 1 freq greein (1) - 3 freq green (2) - 644 freq greyin (2) - 2 freq grein (2) - 4 freq 'greein (2) - 2 freq agreeing (2) - 2 freq agreeit (2) - 2 freq greenie (3) - 3 freq greene (3) - 2 freq groin (3) - 3 freq greetin (3) - 366 freq greeny (3) - 3 freq grin (3) - 137 freq grain (3) - 78 freq ayegreen (3) - 3 freq grouin (3) - 10 freq agrees (3) - 13 freq grien (3) - 3 freq agrun (3) - 1 freq gren (3) - 1 freq graen (3) - 1 freq grekin (3) - 1 freq preein (3) - 11 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 - AKRN acurren - 1 freq agrun - 1 freq agreein - 8 freq agreean - 1 freq acorn - 2 freq |
AGREEIN |
| Time to execute Levenshtein function - 0.199565 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.366876 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.027061 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.044350 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.001166 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. |