| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rebel (0) - 27 freq rebelt (1) - 1 freq revel (1) - 2 freq tebel (1) - 1 freq rebels (1) - 21 freq reel (1) - 44 freq repel (1) - 2 freq 'rebel (1) - 1 freq riel (2) - 1 freq robe (2) - 5 freq reely (2) - 9 freq sobel (2) - 1 freq rebat (2) - 5 freq ravel (2) - 2 freq desel (2) - 4 freq geel (2) - 2 freq reer (2) - 1 freq nobel (2) - 9 freq rese (2) - 1 freq seel (2) - 1 freq rebeild (2) - 1 freq hegel (2) - 2 freq reken (2) - 1 freq reesel (2) - 4 freq rebs (2) - 3 freq |
rebel (0) - 27 freq reel (2) - 44 freq repel (2) - 2 freq rebels (2) - 21 freq 'rebel (2) - 1 freq rebelt (2) - 1 freq revel (2) - 2 freq tebel (2) - 1 freq recl (3) - 1 freq mabel (3) - 91 freq abel (3) - 7 freq rebs (3) - 3 freq regal (3) - 2 freq rael (3) - 110 freq rel (3) - 1 freq reveal (3) - 21 freq reesel (3) - 4 freq reeb (3) - 1 freq rebelle (3) - 1 freq rabels (3) - 1 freq label (3) - 57 freq real (3) - 592 freq babel (3) - 7 freq ravel (3) - 2 freq rebat (3) - 5 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 |
REBEL |
| Time to execute Levenshtein function - 0.497413 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 - 1.007721 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.087275 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.097624 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.000912 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. |