Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
prodrill (0) - 3 freq proil (3) - 1 freq prof'll (3) - 3 freq rodrick (3) - 21 freq drill (3) - 53 freq proddit (3) - 1 freq profile (3) - 52 freq robgill (3) - 1 freq proddie (3) - 2 freq roadkill (3) - 1 freq proile (3) - 1 freq prodigy (3) - 2 freq proddies (3) - 1 freq goodwill (3) - 3 freq prodigal (3) - 3 freq proddin (3) - 2 freq prowlin (4) - 3 freq crottils (4) - 1 freq torvill (4) - 1 freq goodhall (4) - 1 freq procuire (4) - 1 freq porin (4) - 1 freq drily (4) - 1 freq pridit (4) - 1 freq propale (4) - 1 freq |
prodrill (0) - 3 freq roadkill (5) - 1 freq prodigal (5) - 3 freq drill (5) - 53 freq prof'll (5) - 3 freq quadrille (6) - 1 freq proodly (6) - 39 freq aprill (6) - 1 freq prolly (6) - 8 freq proodlik (6) - 1 freq droll (6) - 13 freq erroll (6) - 1 freq treadmill (6) - 2 freq treidmill (6) - 1 freq primarily (6) - 2 freq €˜droll (6) - 1 freq peronall (6) - 1 freq hardhill (6) - 2 freq prodigals (6) - 1 freq proudly (6) - 12 freq properly (6) - 60 freq payroll (6) - 2 freq proudlie (6) - 1 freq bedroll (6) - 7 freq proodlie (6) - 2 freq |
SoundEx code - P636 portrait - 18 freq partridge - 7 freq portraits - 12 freq porter - 14 freq porters - 6 freq prittier - 1 freq porterfield - 1 freq porter's - 2 freq protrudin - 3 freq parturition - 1 freq portray - 1 freq portraiture - 1 freq paratrooper - 1 freq porturfeeld - 1 freq protractit - 3 freq portrayals - 1 freq portrayin - 2 freq porrtrait - 1 freq parterres - 1 freq €œporter - 1 freq pairtrick - 1 freq preterite - 2 freq pre-drinks - 1 freq pairtricks - 1 freq partricides - 1 freq protractin - 1 freq portrayed - 2 freq preterites - 2 freq pooer-hauders - 1 freq perturbation - 1 freq portrush - 1 freq prodrill - 3 freq protradeuk - 1 freq portrayal - 1 freq portrays - 1 freq prettier - 2 freq portree - 1 freq |
MetaPhone code - PRTRL prodrill - 3 freq |
PRODRILL |
Time to execute Levenshtein function - 0.218578 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.406209 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.028377 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.037719 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.000826 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. |