| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| beachedbirdsurvey (0) - 1 freq heathermorven (9) - 1 freq seabirdsaturday (9) - 1 freq estherasprey (9) - 1 freq badbirdart (9) - 1 freq bairddavey (9) - 2 freq blakbirds (10) - 1 freq bracheid (10) - 2 freq blackbird (10) - 4 freq heatherdunnn (10) - 2 freq benchpresses (10) - 1 freq teachers- (10) - 1 freq weatherindoric (10) - 1 freq back-burden (10) - 1 freq beheided (10) - 7 freq bacheleir (10) - 1 freq backburner (10) - 1 freq realkenbruce (10) - 1 freq eacrobertburns (10) - 1 freq teacher's (10) - 24 freq learnincurve (10) - 1 freq teachers' (10) - 5 freq braeheids (10) - 1 freq back-burdeen (10) - 1 freq treacherously (10) - 1 freq |
beachedbirdsurvey (0) - 1 freq badbirdart (13) - 1 freq back-buirds (14) - 1 freq back-burden (15) - 1 freq backwirds (15) - 2 freq backburner (15) - 1 freq beechgrove (15) - 3 freq back-burdeen (15) - 1 freq chairs've (15) - 1 freq blaikbirds (15) - 1 freq badbirdphoto (15) - 2 freq seabirdsaturday (15) - 1 freq bairddavey (15) - 2 freq blakbirds (15) - 1 freq heicher-order (15) - 1 freq bachelor's (15) - 1 freq seabirders (16) - 2 freq bawheids (16) - 3 freq bank-burds (16) - 1 freq teachers (16) - 227 freq grave-birds (16) - 1 freq blackberries (16) - 1 freq beaches (16) - 12 freq bigbirds (16) - 1 freq beached (16) - 9 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 - BXTBRTSR |
BEACHEDBIRDSURVEY |
| Time to execute Levenshtein function - 0.223911 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.430949 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.029122 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.037340 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.000857 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. |