| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| rose-hip (0) - 1 freq rosehips (2) - 1 freq rose-rid (2) - 1 freq rose-fite (3) - 1 freq somethip (3) - 1 freq rose-bed (3) - 1 freq rosehill (3) - 3 freq nosewhit (3) - 1 freq rishi (4) - 4 freq toshie (4) - 15 freq rose (4) - 216 freq unship (4) - 1 freq woarship (4) - 4 freq rosetree (4) - 1 freq joseph (4) - 64 freq hosepipe (4) - 1 freq nose-bag (4) - 1 freq roch-lik (4) - 1 freq rosit (4) - 1 freq rosie (4) - 73 freq roseanna (4) - 2 freq ship (4) - 186 freq rostit (4) - 1 freq rose's (4) - 2 freq rosewood (4) - 1 freq |
rose-hip (0) - 1 freq rose-rid (4) - 1 freq rosehips (4) - 1 freq rose-bed (5) - 1 freq rose-fite (5) - 1 freq reeshie (6) - 1 freq rose-tree (6) - 18 freq worship (6) - 35 freq rosyth (6) - 4 freq schip (6) - 1 freq rushin (6) - 16 freq rushit (6) - 1 freq house-heid (6) - 1 freq roon-up (6) - 1 freq moose-hol (6) - 1 freq re-bop (6) - 1 freq ship (6) - 186 freq erse-hole (6) - 1 freq rashis (6) - 1 freq erse-deep (6) - 1 freq rishi (6) - 4 freq woarship (6) - 4 freq reshape (6) - 1 freq rashie (6) - 1 freq roushie (6) - 17 freq |
SoundEx code - R210 recipe - 33 freq rugby - 46 freq receive - 21 freq rasp - 11 freq 'rugby - 1 freq 'recipe' - 1 freq rosscoff - 1 freq recoop - 1 freq recipie - 2 freq rock-a-bye - 1 freq rspb - 11 freq rspba - 6 freq risp - 2 freq resaif - 2 freq rose-hip - 1 freq rougvie - 1 freq recoup - 3 freq raspy - 2 freq rokeby - 1 freq reshape - 1 freq rkwp - 1 freq rcf - 1 freq rrrxb - 1 freq rzyebw - 1 freq rxjfb - 1 freq rgwip - 1 freq rqp - 1 freq royxf - 1 freq rwowzp - 1 freq rgohev - 1 freq |
MetaPhone code - RSHP rose-hip - 1 freq |
ROSE-HIP |
| Time to execute Levenshtein function - 0.225716 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.379172 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.029397 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.041235 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.003358 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. |