| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rebelle (0) - 1 freq rebelled (1) - 1 freq rebelt (2) - 1 freq rebels' (2) - 1 freq retells (2) - 1 freq rebel (2) - 27 freq rebels (2) - 21 freq rebeild (2) - 1 freq belle (2) - 17 freq reveille (2) - 1 freq reelee (2) - 1 freq revell (2) - 1 freq jeelie (3) - 11 freq reenge (3) - 60 freq resellin (3) - 1 freq weell' (3) - 2 freq recalls (3) - 5 freq meedle (3) - 1 freq reeeally (3) - 1 freq eelie (3) - 1 freq rewable (3) - 1 freq rebuke (3) - 3 freq peeple (3) - 3 freq deedle (3) - 2 freq treetle (3) - 5 freq |
rebelle (0) - 1 freq rebelled (2) - 1 freq belle (3) - 17 freq rebeild (3) - 1 freq revell (3) - 1 freq rebels (3) - 21 freq reveille (3) - 1 freq rebelt (3) - 1 freq rebel (3) - 27 freq rebellion (4) - 36 freq raellie (4) - 18 freq really (4) - 1231 freq zabell (4) - 1 freq refill (4) - 3 freq rubble (4) - 7 freq gbell (4) - 1 freq reilly (4) - 3 freq recall (4) - 11 freq abell (4) - 1 freq belly (4) - 163 freq bell (4) - 215 freq harebell (4) - 3 freq rabble (4) - 10 freq bella (4) - 96 freq rebuild (4) - 1 freq |
SoundEx code - R140 reply - 165 freq rope-will - 2 freq raffle - 13 freq rouble - 7 freq rebel - 27 freq rifle - 24 freq rabble - 10 freq ravel - 2 freq rubble - 7 freq ripple - 7 freq rebelle - 1 freq repel - 2 freq ruffle - 5 freq reveal - 21 freq refull - 1 freq replay - 5 freq rival - 14 freq refill - 3 freq ravioli - 1 freq 'ravioli - 2 freq rifle' - 2 freq reffel - 2 freq 'rabelo' - 1 freq riffle - 1 freq revile - 3 freq raivel - 3 freq raip-haul - 1 freq rop-will - 1 freq revell - 1 freq raifall - 1 freq raphaell - 1 freq rope'll - 1 freq 'rebel - 1 freq reveille - 1 freq 'revel' - 1 freq ruefully - 3 freq revel - 2 freq rewable - 1 freq |
MetaPhone code - RBL rouble - 7 freq rebel - 27 freq rabble - 10 freq rubble - 7 freq rebelle - 1 freq 'rabelo' - 1 freq 'rebel - 1 freq |
REBELLE |
| Time to execute Levenshtein function - 0.306037 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.536682 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.031865 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.048204 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.001335 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. |