| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| buzlakd (0) - 1 freq buzzard (2) - 3 freq bladd (3) - 5 freq blaad (3) - 2 freq bollard (3) - 3 freq blak (3) - 85 freq blakk (3) - 2 freq but-and (3) - 1 freq bulged (3) - 4 freq bussard (3) - 1 freq uplaid (3) - 1 freq bumbard (3) - 1 freq bunlan (3) - 1 freq jutland (3) - 2 freq bulk (3) - 8 freq blad (3) - 15 freq bulla (3) - 32 freq bullied (3) - 20 freq blaud (3) - 11 freq ballad (3) - 30 freq blawd (3) - 1 freq bizzard (3) - 1 freq blake (3) - 9 freq outland (3) - 2 freq bulky (3) - 2 freq |
buzlakd (0) - 1 freq buzzard (4) - 3 freq bizzard (5) - 1 freq blake (5) - 9 freq blawd (5) - 1 freq blaud (5) - 11 freq bullied (5) - 20 freq bulky (5) - 2 freq buzzed (5) - 1 freq blak' (5) - 1 freq baulked (5) - 1 freq build (5) - 74 freq burled (5) - 2 freq blad (5) - 15 freq bland (5) - 7 freq ballad (5) - 30 freq bulged (5) - 4 freq blak (5) - 85 freq bollard (5) - 3 freq blaad (5) - 2 freq blakk (5) - 2 freq bulk (5) - 8 freq bladd (5) - 5 freq blamed (6) - 12 freq flaked (6) - 2 freq |
SoundEx code - B242 bauchles - 4 freq bassless - 1 freq bogles - 23 freq bessie-like - 1 freq big-league - 1 freq buikless - 1 freq backless - 1 freq buccleuch - 9 freq buckles - 2 freq bos'll's - 1 freq boggles - 3 freq bushels - 1 freq beaujolais - 1 freq bugles - 1 freq bugloss - 1 freq bacillus - 1 freq boswells - 1 freq bogils - 2 freq beiklik - 1 freq bucolic - 1 freq backlash - 1 freq bjlyq - 1 freq bowieglastonbury - 1 freq bikelists - 1 freq buzlakd - 1 freq bagels - 1 freq bglsxg - 1 freq bscglasgowfc - 1 freq |
MetaPhone code - BSLKT buzlakd - 1 freq |
BUZLAKD |
| Time to execute Levenshtein function - 0.269553 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.422299 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.034160 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.042063 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.000987 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. |