| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blawhards (0) - 1 freq blawhard (1) - 3 freq slawards (2) - 1 freq bawheids (3) - 3 freq blakbirds (3) - 1 freq blewarts (3) - 2 freq bakwards (3) - 2 freq rawyards (3) - 1 freq blizzards (3) - 1 freq lawlords (3) - 1 freq placards (3) - 2 freq clawmarks (3) - 1 freq lawlands (3) - 4 freq blawearie (3) - 2 freq seawards (3) - 1 freq blathers (3) - 2 freq awards (3) - 35 freq blaggard (3) - 3 freq bastards (3) - 33 freq tawards (3) - 7 freq barmaids (4) - 2 freq unawares (4) - 5 freq 'tawards' (4) - 1 freq bashans (4) - 1 freq laads (4) - 7 freq |
blawhards (0) - 1 freq blawhard (2) - 3 freq slawards (4) - 1 freq blizzards (5) - 1 freq blathers (5) - 2 freq bakwards (5) - 2 freq lawlords (5) - 1 freq blakbirds (5) - 1 freq bawheids (5) - 3 freq blewarts (5) - 2 freq billboards (6) - 1 freq billiards (6) - 2 freq blaitherd (6) - 1 freq blowers (6) - 1 freq tawards (6) - 7 freq blushers (6) - 1 freq blaikbirds (6) - 1 freq bollards (6) - 2 freq blethers (6) - 63 freq bastards (6) - 33 freq seawards (6) - 1 freq blawearie (6) - 2 freq lawlands (6) - 4 freq placards (6) - 2 freq clawmarks (6) - 1 freq |
SoundEx code - B463 bleert - 1 freq bleart - 5 freq billiards - 2 freq blawhard - 3 freq blurted - 6 freq blurred - 6 freq bollard - 3 freq blirt - 8 freq blurtet - 3 freq blurten - 1 freq blurts - 8 freq blirted - 1 freq blared - 3 freq bleared - 7 freq blewarts - 2 freq bleered - 1 freq bleirit - 2 freq billiart - 1 freq bleary-eyed - 1 freq ballarat - 1 freq bollards - 2 freq bullert - 2 freq blaewort-fu - 1 freq blawhards - 1 freq bleerie-eed - 1 freq billiard - 1 freq blurt - 1 freq blurtit - 2 freq blear-eyed - 1 freq blirtin - 2 freq blairite - 1 freq blairites - 1 freq blairdaff - 1 freq boilyirheed - 1 freq |
MetaPhone code - BLHRTS blawhards - 1 freq |
BLAWHARDS |
| Time to execute Levenshtein function - 0.224850 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.423458 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.028102 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.041283 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.000844 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. |