Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
prime-rib (0) - 1 freq primarie (3) - 3 freq primer (3) - 10 freq priestis (4) - 1 freq preferit (4) - 1 freq pierie (4) - 8 freq promeuvin (4) - 1 freq primarily (4) - 2 freq priorie (4) - 7 freq primed (4) - 3 freq palmerio (4) - 1 freq rimer (4) - 1 freq priouris (4) - 1 freq time-in (4) - 1 freq rid-rid (4) - 1 freq criteria (4) - 7 freq priservin (4) - 1 freq primark (4) - 6 freq rose-rid (4) - 1 freq primpin (4) - 1 freq rite-in (4) - 2 freq rimers (4) - 1 freq haimerin (4) - 1 freq pre-fab (4) - 1 freq príe-in (4) - 1 freq |
prime-rib (0) - 1 freq primer (5) - 10 freq primarie (5) - 3 freq pre-fab (6) - 1 freq proverb (6) - 7 freq primary (6) - 173 freq primark (6) - 6 freq primaries (6) - 4 freq primar (6) - 1 freq primarily (6) - 2 freq prizery (7) - 1 freq primpit (7) - 1 freq preferrin (7) - 5 freq prime (7) - 36 freq primsie (7) - 1 freq premier (7) - 7 freq primrose (7) - 13 freq prescribe (7) - 2 freq premiered (7) - 1 freq preferrit (7) - 5 freq perimeter (7) - 10 freq pre-oil (7) - 1 freq craimerie (7) - 1 freq palmerio (7) - 1 freq priouris (7) - 1 freq |
SoundEx code - P656 primary - 173 freq primrose - 13 freq premièred - 1 freq première - 1 freq primaries - 4 freq 'primary - 1 freq prime-rib - 1 freq primar - 1 freq primark - 6 freq primroses - 3 freq primordial - 1 freq premier - 7 freq primer - 10 freq pre-norse - 1 freq paramour - 1 freq primarie - 3 freq paranormal - 1 freq premiered - 1 freq preemary - 1 freq primarily - 2 freq premiership - 2 freq premiersportstv - 3 freq |
MetaPhone code - PRMRB prime-rib - 1 freq |
PRIME-RIB |
Time to execute Levenshtein function - 0.263886 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.527801 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.059032 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.074456 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.000916 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. |