| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| banesair (0) - 1 freq banksia (3) - 1 freq banes' (3) - 2 freq bonsais (3) - 1 freq bynear (3) - 2 freq lanesame (3) - 1 freq desair (3) - 1 freq iantsaoir (3) - 1 freq baestie (3) - 1 freq anymair (3) - 33 freq ansir (3) - 1 freq bangster (3) - 4 freq ansar (3) - 1 freq aesir (3) - 4 freq bawhair (3) - 1 freq banzai (3) - 1 freq banister (3) - 2 freq bonsai (3) - 1 freq caesar (3) - 17 freq banefire (3) - 3 freq aesyir (3) - 1 freq banes (3) - 205 freq naemair (3) - 1 freq mestir (4) - 2 freq namesake (4) - 4 freq |
banesair (0) - 1 freq banes (4) - 205 freq banefire (4) - 3 freq ansir (4) - 1 freq banister (4) - 2 freq bonsai (4) - 1 freq banes' (4) - 2 freq bonsais (4) - 1 freq ansar (4) - 1 freq bynear (4) - 2 freq banter (5) - 43 freq bangor (5) - 9 freq banner (5) - 19 freq banshee (5) - 15 freq bines (5) - 1 freq baines (5) - 1 freq bones (5) - 61 freq jonsar (5) - 588 freq bynes (5) - 1 freq bandara (5) - 11 freq obsair (5) - 11 freq bans (5) - 35 freq banger (5) - 5 freq boksir (5) - 1 freq ansuer (5) - 1 freq |
SoundEx code - B526 bouncer - 24 freq bouncers - 5 freq bouncer's - 2 freq bangor - 9 freq bancouris - 1 freq bunker - 23 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 - BNSR bouncer - 24 freq banesair - 1 freq |
BANESAIR |
| Time to execute Levenshtein function - 0.224752 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.359734 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.028195 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.037269 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.000947 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. |