Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bestpainterinhawick (0) - 2 freq stpatrick (10) - 1 freq bencanteach (11) - 1 freq sister-inlaw (11) - 1 freq westmaister (11) - 3 freq betterin (11) - 3 freq scaiterin (11) - 1 freq wintershaw (11) - 1 freq splenterin (11) - 2 freq dematerialise (11) - 4 freq better-hauf's (11) - 2 freq blinterin (11) - 8 freq banterin (11) - 1 freq sittinback (11) - 1 freq better-maist (11) - 1 freq stoiterinly (11) - 2 freq festinence (11) - 1 freq bertswattermain (11) - 11 freq spahlterin (11) - 1 freq weatherindoric (11) - 1 freq clatterinshaws (11) - 1 freq portpatrick (11) - 2 freq estaiblishit (11) - 1 freq bettermaist (11) - 5 freq spalterin (11) - 2 freq |
bestpainterinhawick (0) - 2 freq stpatrick (15) - 1 freq bestcanton (17) - 1 freq sittinback (17) - 1 freq btinternet (17) - 12 freq portpatrick (17) - 2 freq blathewick (17) - 3 freq interdick (18) - 1 freq projecthawick (18) - 6 freq saunterin (18) - 5 freq pairtrick (18) - 1 freq stoiterin (18) - 1 freq maisterstick (18) - 1 freq interack (18) - 1 freq intrinsic (18) - 1 freq starstruck (18) - 1 freq bairntrock (18) - 1 freq borthwick (18) - 1 freq braeth-thick (18) - 1 freq skittery-dick (18) - 1 freq paitrick (18) - 1 freq santerin (18) - 1 freq bespattered (18) - 1 freq etterick (18) - 1 freq bettering (18) - 1 freq |
SoundEx code - B231 back-tae-front - 4 freq bowsied-app - 1 freq bus-stap - 2 freq backed-up - 1 freq bucketfu - 1 freq backstabbins - 1 freq basketball - 4 freq basketbaw - 5 freq bus-stop - 1 freq back-step - 1 freq boozed-up - 2 freq basketbaa - 1 freq boastful - 1 freq bucketfaes - 1 freq bqdv - 1 freq bestbehaviour - 1 freq bestpainterinhawick - 2 freq bctv - 1 freq bestbehavedbat - 1 freq besutiful - 1 freq beachedbirdsurvey - 1 freq bbcoutofdoors - 3 freq bbcdebatenight - 2 freq bpgtbkn - 1 freq bgtbhlub - 1 freq backstabbers - 1 freq bestford - 1 freq |
MetaPhone code - BSTPNTRN |
BESTPAINTERINHAWICK |
Time to execute Levenshtein function - 0.268236 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.450497 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.027870 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.037241 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.000861 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. |