| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| recesses (0) - 4 freq recedes (2) - 1 freq releases (2) - 3 freq receives (2) - 3 freq recess (2) - 3 freq reeses (2) - 1 freq excesses (2) - 2 freq reverses (2) - 1 freq processes (2) - 20 freq reesel (3) - 4 freq crevasses (3) - 1 freq gresses (3) - 7 freq reenges (3) - 4 freq necessear (3) - 1 freq hernesses (3) - 1 freq realises (3) - 9 freq casses (3) - 1 freq reese (3) - 10 freq desses (3) - 1 freq rehashes (3) - 1 freq reveries (3) - 2 freq revenues (3) - 4 freq incenses (3) - 1 freq reevles (3) - 1 freq guesses (3) - 6 freq |
recesses (0) - 4 freq excesses (3) - 2 freq recess (3) - 3 freq processes (3) - 20 freq casses (4) - 1 freq reassess (4) - 1 freq recession (4) - 3 freq recessive (4) - 1 freq receives (4) - 3 freq recedes (4) - 1 freq reeses (4) - 1 freq releases (4) - 3 freq reverses (4) - 1 freq caesses (4) - 2 freq messes (5) - 1 freq recipies (5) - 1 freq decessit (5) - 1 freq successes (5) - 6 freq wirelesses (5) - 1 freq plaesses (5) - 15 freq necessar (5) - 89 freq recipes (5) - 17 freq accessed (5) - 2 freq ecosse (5) - 6 freq processed (5) - 8 freq |
SoundEx code - R222 roughcast - 2 freq recesses - 4 freq rosy-cheeked - 1 freq rough-cast - 1 freq richsauces - 1 freq rxghkhgnjm - 1 freq |
MetaPhone code - RSSS recesses - 4 freq |
RECESSES |
| Time to execute Levenshtein function - 0.310376 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.491938 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.027281 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.037272 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.000906 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. |