| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| upreeted (0) - 1 freq prented (2) - 3 freq reeted (2) - 4 freq upheezed (2) - 2 freq preeved (2) - 2 freq preened (2) - 14 freq preetea (2) - 1 freq preesed (2) - 1 freq preented (2) - 1 freq greeted (2) - 28 freq unreined (3) - 1 freq surpreesed (3) - 7 freq petted (3) - 2 freq reesed (3) - 12 freq prettea (3) - 1 freq reeled (3) - 6 freq dreeded (3) - 2 freq peeped (3) - 10 freq sprooted (3) - 4 freq created (3) - 27 freq prevented (3) - 2 freq preceded (3) - 2 freq teeted (3) - 1 freq peeved (3) - 4 freq pree'd (3) - 4 freq |
upreeted (0) - 1 freq preetea (3) - 1 freq preented (3) - 1 freq greeted (3) - 28 freq preened (3) - 14 freq preesed (3) - 1 freq preeved (3) - 2 freq reeted (3) - 4 freq prented (3) - 3 freq operated (4) - 5 freq peered (4) - 26 freq pented (4) - 4 freq pleated (4) - 5 freq preed (4) - 4 freq pelted (4) - 5 freq parted (4) - 1 freq preyed (4) - 1 freq treated (4) - 44 freq preined (4) - 1 freq preten (4) - 2 freq traeted (4) - 2 freq pairted (4) - 5 freq printed (4) - 12 freq sprouted (4) - 1 freq peetied (4) - 3 freq |
SoundEx code - U163 upwards - 12 freq upforret - 1 freq uppertoon - 5 freq upward - 5 freq upairt - 1 freq upreeted - 1 freq upwarts - 2 freq upwardly - 1 freq uprooting - 1 freq upwart - 8 freq upwords - 1 freq |
MetaPhone code - UPRTT upreeted - 1 freq |
UPREETED |
| Time to execute Levenshtein function - 0.355993 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.482082 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.068415 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.074622 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.000892 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. |