| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bowieglastonbury (0) - 1 freq glastonbury (5) - 4 freq beglamourt (8) - 1 freq beglamour (8) - 3 freq brigadoonery (8) - 2 freq oactobur (9) - 1 freq bog-standard (9) - 1 freq miltonburgh (9) - 1 freq belystorkert (9) - 1 freq beglamourin (9) - 5 freq conservatory (9) - 1 freq wollaston's (9) - 6 freq belfastbhoy (9) - 1 freq biglarry (9) - 1 freq brigstones (9) - 1 freq weaponry (9) - 2 freq horsemasonry' (9) - 1 freq wollaston (9) - 30 freq signatory (9) - 1 freq outglamour (9) - 1 freq 'wollaston (9) - 3 freq glasgowburns (9) - 4 freq revelatory (9) - 1 freq lowrenburn (9) - 1 freq obligatory (9) - 3 freq |
bowieglastonbury (0) - 1 freq glastonbury (7) - 4 freq brigstones (13) - 1 freq 'wollaston (13) - 3 freq wollaston's (13) - 6 freq wollaston (13) - 30 freq bilston (13) - 14 freq brigadoonery (13) - 2 freq beglamour (13) - 3 freq bog-standard (13) - 1 freq blustery (14) - 15 freq bogie-eatin (14) - 1 freq battlestone (14) - 3 freq glistery (14) - 1 freq belabour (14) - 1 freq westburn (14) - 4 freq bigtonfarm (14) - 1 freq bolster (14) - 4 freq blaster (14) - 3 freq bangstry (14) - 4 freq briggiestanes (14) - 1 freq blasting (14) - 2 freq blastin (14) - 11 freq dubhglasturner (14) - 1 freq jowel-stanes (14) - 1 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 - BWKLSTNB |
BOWIEGLASTONBURY |
| Time to execute Levenshtein function - 0.897299 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 - 1.515912 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.092490 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.109129 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.000875 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. |