| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rubble (0) - 7 freq dubble (1) - 2 freq rabble (1) - 10 freq trubble (1) - 2 freq bubble (1) - 30 freq rumble (1) - 8 freq rubbled (1) - 1 freq hubble (1) - 3 freq kibble (2) - 1 freq gibble (2) - 1 freq cobble (2) - 5 freq rumblet (2) - 1 freq bobble (2) - 1 freq bubbles (2) - 23 freq wabble (2) - 3 freq rumbly (2) - 1 freq cubbie (2) - 2 freq ruffle (2) - 5 freq dubbie (2) - 7 freq mumble (2) - 2 freq rubbit (2) - 49 freq rubbage (2) - 4 freq gabble (2) - 1 freq rumbles (2) - 3 freq gobble (2) - 3 freq |
rubble (0) - 7 freq rabble (1) - 10 freq hubble (2) - 3 freq rumble (2) - 8 freq rubbled (2) - 1 freq bubble (2) - 30 freq trubble (2) - 2 freq dubble (2) - 2 freq robbie (3) - 61 freq sibble (3) - 1 freq ebble (3) - 1 freq tribble (3) - 31 freq drebble (3) - 1 freq rubber (3) - 54 freq rubban (3) - 3 freq ramble (3) - 2 freq tibble (3) - 18 freq pebble (3) - 9 freq bubbly (3) - 10 freq jabble (3) - 2 freq nibble (3) - 8 freq yibble (3) - 3 freq dribble (3) - 3 freq rubbed (3) - 42 freq dabble (3) - 2 freq |
SoundEx code - R140 reply - 159 freq rope-will - 2 freq raffle - 13 freq rouble - 7 freq rebel - 26 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 - 26 freq rabble - 10 freq rubble - 7 freq rebelle - 1 freq 'rabelo' - 1 freq 'rebel - 1 freq |
RUBBLE |
| Time to execute Levenshtein function - 0.214275 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.689407 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.084523 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.086991 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.000923 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. |