| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| raeler (0) - 1 freq raelee (1) - 1 freq caller (2) - 78 freq reer (2) - 1 freq dueler (2) - 1 freq traaler (2) - 3 freq rather (2) - 114 freq haeter (2) - 2 freq aeter (2) - 1 freq laeter (2) - 1 freq raelly (2) - 67 freq caler (2) - 1 freq peeler (2) - 3 freq raker (2) - 2 freq trawler (2) - 3 freq naeter (2) - 1 freq racer (2) - 1 freq gahler (2) - 1 freq rarer (2) - 8 freq ralley (2) - 2 freq waeker (2) - 1 freq roller (2) - 27 freq traller (2) - 1 freq naemer (2) - 3 freq dazler (2) - 2 freq |
raeler (0) - 1 freq raelee (2) - 1 freq ruler (2) - 10 freq ratier (3) - 1 freq rale (3) - 78 freq hauler (3) - 1 freq auler (3) - 17 freq reeled (3) - 6 freq razer (3) - 1 freq reelee (3) - 1 freq aller (3) - 1 freq railed (3) - 2 freq riever (3) - 2 freq rael (3) - 109 freq raider (3) - 1 freq raigler (3) - 4 freq trailer (3) - 13 freq parler (3) - 2 freq rayner (3) - 1 freq raver (3) - 4 freq dailer (3) - 1 freq meeler (3) - 1 freq rlr (3) - 1 freq earlier (3) - 106 freq aerlier (3) - 8 freq |
SoundEx code - R460 ruler - 10 freq roller - 27 freq rowler - 2 freq raeler - 1 freq roll-ower - 1 freq rlr - 1 freq |
MetaPhone code - RLR ruler - 10 freq roller - 27 freq rowler - 2 freq raeler - 1 freq rlr - 1 freq |
RAELER |
| Time to execute Levenshtein function - 0.183585 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.352508 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.029758 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.037303 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.000805 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. |