| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| reacted (0) - 4 freq reached (1) - 135 freq redacted (1) - 3 freq reisted (2) - 1 freq readied (2) - 3 freq reared (2) - 24 freq acted (2) - 8 freq rented (2) - 4 freq rated (2) - 3 freq recked (2) - 4 freq rejected (2) - 7 freq reactit (2) - 2 freq raced (2) - 14 freq recited (2) - 2 freq roasted (2) - 5 freq reaches (2) - 21 freq reactin (2) - 6 freq erected (2) - 3 freq rescued (2) - 17 freq refected (2) - 1 freq preached (2) - 3 freq reamed (2) - 1 freq hearted (2) - 5 freq related (2) - 28 freq feasted (2) - 2 freq |
reacted (0) - 4 freq erected (2) - 3 freq recited (2) - 2 freq reached (2) - 135 freq redacted (2) - 3 freq refected (3) - 1 freq reeted (3) - 4 freq reactin (3) - 6 freq react (3) - 17 freq related (3) - 28 freq ranted (3) - 4 freq racked (3) - 5 freq reacts (3) - 1 freq reisted (3) - 1 freq refuted (3) - 1 freq reactor (3) - 2 freq rated (3) - 3 freq rented (3) - 4 freq acted (3) - 8 freq reeched (3) - 1 freq recked (3) - 4 freq rejected (3) - 7 freq rested (3) - 11 freq roasted (3) - 5 freq raced (3) - 14 freq |
SoundEx code - R233 rested - 11 freq reacted - 4 freq restit - 18 freq rustit - 3 freq ruistit - 1 freq ristit - 5 freq richtit - 2 freq roustit - 4 freq roasty-toastied - 1 freq rowsted - 6 freq roasted - 5 freq richted - 4 freq roastit - 13 freq recited - 2 freq rousted - 2 freq recitation - 2 freq rusted - 5 freq reestit - 11 freq roostit - 6 freq richtitie-pichtitie - 1 freq 'richtitie-pichtitie - 1 freq rowstit - 3 freq roosted - 2 freq recitit - 5 freq reistit - 2 freq receded - 1 freq rickety-tick - 2 freq rostit - 1 freq ricky-doodum-day - 1 freq richt-oot - 3 freq righted - 2 freq rectitude - 1 freq reisted - 1 freq reactit - 2 freq rockitet - 1 freq rocketed - 1 freq rcstweets - 1 freq reestitmutton - 1 freq |
MetaPhone code - RKTT reacted - 4 freq reactit - 2 freq rockitet - 1 freq rocketed - 1 freq |
REACTED |
| Time to execute Levenshtein function - 0.187846 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.351229 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.027208 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.037577 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.000861 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. |