Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bonaccordcentre (0) - 3 freq joabcentre (7) - 2 freq accordance (7) - 3 freq scotstorycentre (7) - 4 freq concordance (7) - 3 freq accidently (8) - 1 freq bombardments (8) - 1 freq blackcurrent (8) - 1 freq bombardment (8) - 1 freq concurrence (8) - 3 freq accordian (8) - 4 freq camcorder (8) - 1 freq accorded (8) - 1 freq boarders (8) - 1 freq accidents (8) - 1 freq concrete (8) - 56 freq occurence (8) - 1 freq accidence (8) - 1 freq accordain (8) - 2 freq accordit (8) - 4 freq accurense (8) - 1 freq accordion (8) - 24 freq accordin' (8) - 3 freq accident (8) - 74 freq €˜accordingly (8) - 1 freq |
bonaccordcentre (0) - 3 freq concordance (12) - 3 freq accordance (12) - 3 freq accordion (13) - 24 freq according (13) - 26 freq accordit (13) - 4 freq accordain (13) - 2 freq accordin' (13) - 3 freq €˜accordingly (13) - 1 freq accordingly (13) - 2 freq callcentre (13) - 1 freq accordinly (13) - 3 freq inaccurate (13) - 1 freq concurrently (13) - 1 freq accident (13) - 74 freq accidents (13) - 1 freq bombardments (13) - 1 freq blackcurrent (13) - 1 freq accidently (13) - 1 freq scotstorycentre (13) - 4 freq joabcentre (13) - 2 freq bombardment (13) - 1 freq accidental (13) - 7 freq concordances (13) - 2 freq 'accident' (13) - 2 freq |
SoundEx code - B526 bouncer - 22 freq bouncers - 5 freq bouncer's - 2 freq bangor - 9 freq bancouris - 1 freq bunker - 22 freq 'banks're - 1 freq banker - 12 freq bonkers - 5 freq bunkery - 2 freq baungarrif - 1 freq bunkers - 12 freq 'bankrupt' - 1 freq bankers - 4 freq banchory - 6 freq bonjoor - 2 freq bankrupt - 8 freq banger - 5 freq bangers - 3 freq bin-cairt - 1 freq banesair - 1 freq ben-gurion - 1 freq buncher - 1 freq booncers - 2 freq bunchrew - 1 freq bangordub - 1 freq bomscare - 1 freq bin-hoker's - 1 freq bunchry - 1 freq bonaccordcentre - 3 freq bunker' - 1 freq banjorennie - 1 freq bankruptit - 1 freq |
MetaPhone code - BNKKRTSN |
BONACCORDCENTRE |
Time to execute Levenshtein function - 0.302530 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.488517 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.033549 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.042891 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.000928 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. |