| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bitsun (0) - 1 freq datsun (2) - 3 freq bison (2) - 2 freq whitsun (2) - 1 freq bitin (2) - 27 freq birsen (2) - 1 freq kitson (2) - 1 freq situn (2) - 1 freq bissum (2) - 2 freq bits' (2) - 1 freq i'sun (2) - 12 freq birsin (2) - 4 freq bitten (2) - 7 freq bits (2) - 322 freq ritson (2) - 1 freq bitan (2) - 1 freq toun (3) - 379 freq tissue (3) - 6 freq tisen (3) - 1 freq stun (3) - 2 freq aitin (3) - 21 freq bisque (3) - 1 freq blasin (3) - 1 freq mitton (3) - 1 freq sittin (3) - 737 freq |
bitsun (0) - 1 freq bitten (3) - 7 freq birsin (3) - 4 freq ritson (3) - 1 freq bitan (3) - 1 freq datsun (3) - 3 freq bits' (3) - 1 freq bits (3) - 322 freq bitin (3) - 27 freq kitson (3) - 1 freq birsen (3) - 1 freq bison (3) - 2 freq bets (4) - 8 freq buts (4) - 2 freq bunsen (4) - 28 freq watson (4) - 46 freq bats (4) - 34 freq bossin (4) - 4 freq itsna (4) - 1 freq busan (4) - 1 freq but-in (4) - 1 freq baitin (4) - 1 freq tisan (4) - 2 freq bertson (4) - 1 freq ibsen (4) - 2 freq |
SoundEx code - B325 botswana - 9 freq botswana's - 1 freq budgin - 3 freq beautician - 8 freq bedchaumers - 3 freq bedchaumer - 5 freq bewitchin - 1 freq bed-chaumer - 1 freq buddhism - 7 freq beauticians - 1 freq beautician's - 1 freq bits-on-the-side - 1 freq bodie-kyn - 1 freq betoken - 1 freq bitchin - 2 freq botswanan - 1 freq baudkin - 1 freq betokened - 1 freq body-snatchers - 2 freq body-snatcher - 1 freq bedeckin - 1 freq bitsun - 1 freq buits-on-the-street - 1 freq bitching - 1 freq bitsnbobs - 1 freq btywgnclxf - 1 freq batesmoira - 6 freq budsmam - 1 freq botcoin - 1 freq bidixm - 1 freq |
MetaPhone code - BTSN bitsun - 1 freq |
BITSUN |
| Time to execute Levenshtein function - 0.204257 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.371550 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.028186 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.041214 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.001240 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. |