| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ranting (0) - 4 freq rantins (1) - 2 freq granting (1) - 1 freq renting (1) - 2 freq rating (1) - 1 freq rantin (1) - 9 freq wanting (1) - 19 freq panting (1) - 3 freq rantan (2) - 1 freq raing (2) - 1 freq rinning (2) - 7 freq tasting (2) - 5 freq rowting (2) - 1 freq darting (2) - 1 freq rentin (2) - 2 freq waning (2) - 1 freq roasting (2) - 1 freq banking (2) - 3 freq tanning (2) - 3 freq dancing (2) - 31 freq cantin (2) - 4 freq raining (2) - 5 freq grafting (2) - 2 freq farting (2) - 3 freq hantin (2) - 6 freq |
ranting (0) - 4 freq renting (1) - 2 freq panting (2) - 3 freq rantins (2) - 2 freq rantin (2) - 9 freq wanting (2) - 19 freq granting (2) - 1 freq rating (2) - 1 freq haunting (3) - 3 freq running (3) - 47 freq pinting (3) - 1 freq hunting (3) - 10 freq pynting (3) - 1 freq painting (3) - 9 freq penting (3) - 1 freq daunting (3) - 1 freq wunting (3) - 1 freq tenting (3) - 1 freq bunting (3) - 8 freq resting (3) - 4 freq raining (3) - 5 freq ringing (3) - 4 freq rentin (3) - 2 freq rowting (3) - 1 freq rinning (3) - 7 freq |
SoundEx code - R535 random-rooble - 1 freq rantin - 9 freq renton - 4 freq rantan - 1 freq random - 36 freq rantins - 2 freq rentin - 2 freq 'random - 1 freq run-o-the-mill - 1 freq randan - 5 freq ran-dan - 2 freq randomly - 3 freq run-doon - 2 freq rin-doon - 1 freq roondness - 1 freq roondan - 4 freq 'rum-tum-tum-tiddle-um - 1 freq rum-tum-tum-tiddle-um - 1 freq ruinaetion - 1 freq ranting - 4 freq randiness - 1 freq roondin - 1 freq reunitin - 1 freq rain-daunce - 1 freq room-temperature-runny - 1 freq renationalisin - 1 freq renting - 2 freq renton'll - 1 freq rhymetime - 1 freq reuniting - 1 freq rantinrovin - 1 freq rhondamckenna - 2 freq |
MetaPhone code - RNTNK ranting - 4 freq renting - 2 freq reuniting - 1 freq |
RANTING |
| Time to execute Levenshtein function - 0.361255 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.642944 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.060619 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.039322 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.000902 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. |