| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| boundary (0) - 2 freq boondary (1) - 5 freq foundry (2) - 4 freq bounded (3) - 7 freq dounward (3) - 1 freq boundin (3) - 7 freq founder (3) - 3 freq bounty (3) - 10 freq voluntary (3) - 7 freq soundan (3) - 3 freq founders (3) - 1 freq boundaries (3) - 6 freq boundit (3) - 1 freq munday (3) - 1 freq pounders (3) - 2 freq 'sunday (3) - 2 freq bounds' (3) - 1 freq poundan (3) - 3 freq binary (3) - 4 freq boulder (3) - 9 freq sounders (3) - 2 freq moanday (3) - 1 freq laundry (3) - 10 freq ornary (3) - 1 freq baundy (3) - 2 freq |
boundary (0) - 2 freq boondary (1) - 5 freq bandara (3) - 11 freq bunder (3) - 1 freq foundry (3) - 4 freq boulder (4) - 9 freq binary (4) - 4 freq sundry (4) - 5 freq bound (4) - 58 freq bender (4) - 5 freq bounds (4) - 11 freq baundy (4) - 2 freq rounder (4) - 1 freq laundry (4) - 10 freq bouncer (4) - 24 freq boundit (4) - 1 freq founder (4) - 3 freq boundin (4) - 7 freq sounder (4) - 2 freq bounded (4) - 7 freq blunder (4) - 3 freq bunkery (4) - 2 freq binder (4) - 23 freq boundaries (4) - 6 freq bondage (4) - 2 freq |
SoundEx code - B536 banter - 43 freq bane-thirl - 1 freq benidorm - 6 freq bunter - 8 freq benders - 1 freq bonders' - 1 freq boundaries - 6 freq banterin - 1 freq bender - 5 freq binder - 23 freq bantered - 1 freq bentowre - 1 freq bandeira - 1 freq boondary - 5 freq boondaries - 6 freq boundary - 2 freq bunder - 1 freq binder-twine - 1 freq bandara - 11 freq bandaras - 2 freq bandara's - 9 freq binders - 1 freq benthorn - 1 freq banterous - 1 freq bendorisrobert - 4 freq |
MetaPhone code - BNTR banter - 43 freq bunter - 8 freq bender - 5 freq binder - 23 freq bentowre - 1 freq bandeira - 1 freq boondary - 5 freq boundary - 2 freq bunder - 1 freq bandara - 11 freq |
BOUNDARY |
| Time to execute Levenshtein function - 0.231121 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.394186 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.028465 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.038881 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.000934 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. |