Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bunsen (0) - 28 freq bunden (1) - 1 freq bursen (1) - 6 freq bursten (2) - 1 freq unken (2) - 4 freq funsee (2) - 1 freq sunken (2) - 4 freq bunsen's (2) - 4 freq bunn (2) - 1 freq bungee (2) - 1 freq jensen (2) - 1 freq burneen (2) - 2 freq unseen (2) - 28 freq bussed (2) - 2 freq burssen (2) - 1 freq bunder (2) - 1 freq buses (2) - 45 freq busin (2) - 1 freq bunnel (2) - 1 freq aunser (2) - 2 freq dungen (2) - 1 freq bunker (2) - 22 freq butnben (2) - 1 freq buises (2) - 1 freq birsen (2) - 1 freq |
bunsen (0) - 28 freq bunden (2) - 1 freq benson (2) - 1 freq bursen (2) - 6 freq birsen (3) - 1 freq binmen (3) - 1 freq hunsin (3) - 3 freq busan (3) - 1 freq bunion (3) - 1 freq unseen (3) - 28 freq busin (3) - 1 freq jensen (3) - 1 freq buns (3) - 22 freq bunlan (3) - 1 freq buntin (3) - 4 freq bensel (3) - 1 freq bunn (3) - 1 freq bungin (3) - 3 freq boonsin (3) - 1 freq bruisin (4) - 6 freq bans (4) - 35 freq blasin (4) - 1 freq bounin (4) - 1 freq danson (4) - 1 freq bonn (4) - 2 freq |
SoundEx code - B525 b'makkin - 1 freq banging - 9 freq bouncing - 5 freq bankin - 19 freq bankins - 2 freq bouncin - 11 freq bangin - 40 freq benjamin - 7 freq bungin - 3 freq banishment - 3 freq bainishment - 1 freq bannisment - 1 freq bemusement - 2 freq booncin - 10 freq binkin - 1 freq bunsen - 28 freq bunsen's - 4 freq bonkin - 1 freq bone-joints - 1 freq bangan - 1 freq bingin - 1 freq bankeen - 1 freq benign - 2 freq benchmairkin - 1 freq boonsin - 1 freq boonsin' - 1 freq baneshanks - 1 freq benisoun - 1 freq benchmark - 1 freq benson - 1 freq bunchin - 1 freq bmxing - 2 freq bankin' - 1 freq banks-wint - 1 freq banking - 3 freq benzema - 1 freq benjynthemonkey - 2 freq bunkum - 1 freq bingowings - 1 freq banknockb - 1 freq benmcgowan - 1 freq bonessunited - 2 freq bonessunitedcfc - 1 freq bencanteach - 1 freq |
MetaPhone code - BNSN bouncin - 11 freq booncin - 10 freq bunsen - 28 freq boonsin - 1 freq boonsin' - 1 freq benisoun - 1 freq benson - 1 freq |
BUNSEN |
Time to execute Levenshtein function - 0.217691 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.404276 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.027729 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.038365 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.000869 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. |