| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rockitet (0) - 1 freq rockies (2) - 1 freq rockit (2) - 4 freq rockster (2) - 1 freq rocketed (2) - 1 freq rackitt (2) - 1 freq rocket (2) - 43 freq pocket (3) - 94 freq socket (3) - 4 freq jockie (3) - 28 freq rocklie (3) - 1 freq recite (3) - 9 freq pockit (3) - 1 freq hockit (3) - 3 freq roukit (3) - 1 freq reckit (3) - 2 freq yockit (3) - 5 freq rickste (3) - 1 freq pocketed (3) - 2 freq rocked (3) - 6 freq dockit (3) - 4 freq roakie (3) - 5 freq rockin' (3) - 1 freq rockeen (3) - 1 freq recited (3) - 2 freq |
rockitet (0) - 1 freq rackitt (2) - 1 freq rocketed (3) - 1 freq rocket (3) - 43 freq rockit (3) - 4 freq rocketry (4) - 1 freq recitit (4) - 5 freq rickste (4) - 1 freq rackit (4) - 7 freq racket (4) - 25 freq reckit (4) - 2 freq rocketin (4) - 1 freq ricket (4) - 2 freq rockets (4) - 9 freq crockett (4) - 4 freq rockster (4) - 1 freq rockies (4) - 1 freq cockit (5) - 30 freq reunitet (5) - 1 freq mockit (5) - 11 freq rootet (5) - 1 freq excitet (5) - 6 freq rottet (5) - 1 freq pocket (5) - 94 freq nocket (5) - 1 freq |
SoundEx code - R233 rested - 12 freq reacted - 4 freq restit - 18 freq rustit - 3 freq ruistit - 1 freq ristit - 5 freq richtit - 2 freq roustit - 5 freq roasty-toastied - 1 freq rowsted - 6 freq roasted - 5 freq richted - 4 freq roastit - 13 freq recited - 2 freq rousted - 2 freq recitation - 2 freq rusted - 5 freq reestit - 11 freq roostit - 6 freq richtitie-pichtitie - 1 freq 'richtitie-pichtitie - 1 freq rowstit - 3 freq roosted - 2 freq recitit - 5 freq reistit - 2 freq receded - 1 freq rickety-tick - 2 freq rostit - 1 freq ricky-doodum-day - 1 freq richt-oot - 3 freq righted - 2 freq rectitude - 1 freq reisted - 1 freq reactit - 2 freq rockitet - 1 freq rocketed - 1 freq rcstweets - 1 freq reestitmutton - 1 freq |
MetaPhone code - RKTT reacted - 4 freq reactit - 2 freq rockitet - 1 freq rocketed - 1 freq |
ROCKITET |
| Time to execute Levenshtein function - 0.190287 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.349287 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.028336 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.037521 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.000906 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. |