| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| randan (0) - 5 freq fandan (1) - 7 freq ran-dan (1) - 2 freq rannan (1) - 1 freq landan (1) - 2 freq raedan (1) - 1 freq rantan (1) - 1 freq ranin (2) - 1 freq rashan (2) - 2 freq addan (2) - 3 freq rwanda (2) - 2 freq bendan (2) - 1 freq raesan (2) - 1 freq canaan (2) - 3 freq lahndan (2) - 1 freq bangan (2) - 1 freq haedan (2) - 3 freq pantan (2) - 3 freq grandas (2) - 3 freq ravan (2) - 2 freq findan (2) - 6 freq lankan (2) - 2 freq raisan (2) - 3 freq vannan (2) - 1 freq aidan (2) - 5 freq |
randan (0) - 5 freq fandan (2) - 7 freq roondan (2) - 4 freq rantan (2) - 1 freq raedan (2) - 1 freq ran-dan (2) - 2 freq rannan (2) - 1 freq landan (2) - 2 freq rainan (3) - 1 freq ranown (3) - 1 freq myndan (3) - 4 freq landon (3) - 2 freq jandin (3) - 1 freq runan (3) - 1 freq fandin (3) - 1 freq andean (3) - 1 freq sendan (3) - 3 freq ronda (3) - 1 freq raiden (3) - 2 freq readan (3) - 10 freq brandin (3) - 1 freq ringan (3) - 3 freq tendan (3) - 1 freq handen (3) - 1 freq brendan (3) - 5 freq |
SoundEx code - R535 random-rooble - 1 freq rantin - 9 freq renton - 4 freq rantan - 1 freq random - 35 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 - RNTN rantin - 9 freq renton - 4 freq rantan - 1 freq rentin - 2 freq randan - 5 freq ran-dan - 2 freq run-doon - 2 freq rin-doon - 1 freq roondan - 4 freq roondin - 1 freq reunitin - 1 freq |
RANDAN |
| Time to execute Levenshtein function - 0.255216 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.658963 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.079339 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.097811 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.000807 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. |