| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rosebeds (0) - 1 freq rosebuds (1) - 1 freq rosebed (1) - 1 freq rose-bed (2) - 1 freq rosebush (3) - 1 freq rosie's (3) - 4 freq robbed (3) - 16 freq rossies (3) - 1 freq seeds (3) - 47 freq rosies (3) - 2 freq robes (3) - 7 freq proceeds (3) - 8 freq rebels (3) - 21 freq robbers (3) - 7 freq roses (3) - 102 freq rose's (3) - 2 freq roeses (3) - 1 freq reeds (3) - 16 freq rosehips (3) - 1 freq rosines (3) - 1 freq noseyers (3) - 1 freq sexes (4) - 5 freq jostled (4) - 3 freq grossets (4) - 1 freq useless (4) - 36 freq |
rosebeds (0) - 1 freq rosebuds (1) - 1 freq rosebed (2) - 1 freq rose-bed (4) - 1 freq rose's (5) - 2 freq roses (5) - 102 freq robbers (5) - 7 freq roeses (5) - 1 freq resides (5) - 1 freq rebels (5) - 21 freq rosines (5) - 1 freq rosehips (5) - 1 freq reeds (5) - 16 freq rosebush (5) - 1 freq rosie's (5) - 4 freq resounds (5) - 2 freq robbed (5) - 16 freq rossies (5) - 1 freq robes (5) - 7 freq rosies (5) - 2 freq seeds (5) - 47 freq beds (6) - 92 freq lazybeds (6) - 3 freq reserves (6) - 4 freq roonds (6) - 8 freq |
SoundEx code - R213 received - 48 freq reception - 29 freq risped - 1 freq receipt - 18 freq recaptured - 3 freq receivit - 3 freq rose-fite - 1 freq reeseeved - 1 freq respite - 4 freq rose-bed - 1 freq receptionist - 10 freq rasped - 3 freq resaived - 2 freq receptacles - 1 freq receipts - 5 freq respiyt - 1 freq rosebuds - 1 freq rispit - 1 freq receptautioun - 1 freq recapturin - 1 freq receptioun - 1 freq receptive - 4 freq receptacle - 1 freq re-shaped - 1 freq rosebed - 1 freq receptionists - 2 freq rikfyddljv - 1 freq recipt - 1 freq rugbyaid - 1 freq rosebeds - 1 freq rsbatxdve - 1 freq rspbdandg - 1 freq |
MetaPhone code - RSBTS rosebuds - 1 freq rosebeds - 1 freq |
ROSEBEDS |
| Time to execute Levenshtein function - 0.210280 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.404177 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.028480 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.039189 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.000769 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. |