Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
random (0) - 36 freq 'random (1) - 1 freq ransom (1) - 6 freq fandom (1) - 1 freq easdom (2) - 1 freq ransome (2) - 1 freq ando (2) - 1 freq rander (2) - 2 freq randan (2) - 5 freq aidom (2) - 1 freq adom (2) - 1 freq hansom (2) - 3 freq lando (2) - 1 freq randit (2) - 1 freq ransomt (2) - 1 freq landon (2) - 2 freq faddom (2) - 8 freq condom (2) - 1 freq randomly (2) - 3 freq rand (2) - 2 freq brandon (2) - 2 freq randy (2) - 15 freq randie (2) - 8 freq tandem (2) - 4 freq panda (3) - 1 freq |
random (0) - 36 freq fandom (2) - 1 freq ransom (2) - 6 freq 'random (2) - 1 freq rand (3) - 2 freq randomly (3) - 3 freq tandem (3) - 4 freq condom (3) - 1 freq randie (3) - 8 freq randy (3) - 15 freq randit (3) - 1 freq randan (3) - 5 freq rander (3) - 2 freq ransome (3) - 1 freq ronda (4) - 1 freq rend (4) - 2 freq rinder (4) - 1 freq ryndit (4) - 1 freq nondum (4) - 1 freq randies (4) - 2 freq render (4) - 8 freq rademe (4) - 2 freq grandma (4) - 5 freq uranium (4) - 2 freq bairndom (4) - 1 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 - RNTM random - 36 freq 'random - 1 freq |
RANDOM |
Time to execute Levenshtein function - 0.211368 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.364554 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.030022 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.038711 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.003971 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. |