Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
gowd-tappit (0) - 3 freq mop-toppit (4) - 1 freq owerlappit (4) - 1 freq clood-happit (4) - 1 freq owertappin (4) - 1 freq good-naturt (5) - 2 freq gowpit (5) - 10 freq oot-tapped (5) - 1 freq gowd-reid (5) - 1 freq tappit (5) - 6 freq wrappit (5) - 10 freq wappit (5) - 13 freq snaw-happit (5) - 2 freq owerlappin (5) - 3 freq on-stapp't (5) - 1 freq shawl-wappit (5) - 1 freq unwrappit (5) - 2 freq bed-happin (5) - 1 freq stappit (5) - 117 freq weel-happit (5) - 3 freq bowel-crappit (5) - 1 freq swappit (5) - 11 freq fit-tappin (5) - 1 freq unstappit (5) - 2 freq dappit (5) - 1 freq |
gowd-tappit (0) - 3 freq mop-toppit (7) - 1 freq clood-happit (7) - 1 freq weel-happit (8) - 3 freq owertappin (8) - 1 freq owerlappit (8) - 1 freq dappit (9) - 1 freq fit-tappin (9) - 1 freq god-damnt (9) - 1 freq bowel-crappit (9) - 1 freq swappit (9) - 11 freq untappit (9) - 1 freq red-tipped (9) - 1 freq teep-tappin (9) - 1 freq stappit (9) - 117 freq hauf-happit (9) - 2 freq drappit (9) - 93 freq unstappit (9) - 2 freq tappit (9) - 6 freq wrappit (9) - 10 freq gowd-reid (9) - 1 freq oot-tapped (9) - 1 freq good-naturt (9) - 2 freq bed-happin (9) - 1 freq wappit (9) - 13 freq |
SoundEx code - G313 godfaither - 2 freq guidfaither - 1 freq goodbodie - 1 freq gowd-tappit - 3 freq gadaboot - 1 freq godfaithers - 1 freq guid-faither - 1 freq guidobot - 1 freq gitfiddle - 1 freq gitupti - 1 freq goodboythisyear - 1 freq gtfdfb - 1 freq godfather - 1 freq goodfoodgal - 1 freq |
MetaPhone code - KTTPT gowd-tappit - 3 freq |
GOWD-TAPPIT |
Time to execute Levenshtein function - 0.253400 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.395801 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.030872 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.039893 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.001003 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. |