| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bound (0) - 57 freq mound (1) - 7 freq boud (1) - 1 freq found (1) - 220 freq round (1) - 121 freq sound (1) - 159 freq blund (1) - 1 freq boond (1) - 9 freq bounds (1) - 11 freq boued (1) - 22 freq bund (1) - 12 freq boun' (1) - 1 freq boun (1) - 10 freq bouns (1) - 1 freq abound (1) - 2 freq bount (1) - 1 freq bouned (1) - 3 freq wound (1) - 29 freq bourd (1) - 1 freq pound (1) - 127 freq bond (1) - 16 freq bou'd (1) - 5 freq baund (1) - 21 freq hound (1) - 11 freq laund (2) - 89 freq |
bound (0) - 57 freq boond (1) - 9 freq baund (1) - 21 freq bond (1) - 16 freq abound (1) - 2 freq bund (1) - 12 freq bouned (1) - 3 freq bou'd (2) - 5 freq pound (2) - 127 freq bind (2) - 20 freq band (2) - 159 freq baundy (2) - 2 freq beand (2) - 1 freq baand (2) - 13 freq bourd (2) - 1 freq boned (2) - 2 freq hound (2) - 11 freq bend (2) - 102 freq found (2) - 220 freq sound (2) - 159 freq blund (2) - 1 freq mound (2) - 7 freq round (2) - 121 freq boud (2) - 1 freq bounds (2) - 11 freq |
SoundEx code - B530 boomed - 8 freq bendie - 2 freq bendy - 3 freq bent - 104 freq bunnet - 111 freq bandy - 13 freq bend - 102 freq bound - 57 freq beneath - 33 freq band - 159 freq bind - 20 freq bonnie-die - 1 freq bounty - 10 freq behind - 246 freq beamed - 6 freq bund - 12 freq beyond - 99 freq bunnet' - 2 freq bammed - 1 freq baund - 21 freq boond - 9 freq bummed - 11 freq bonnet - 34 freq boannet - 1 freq bunt - 6 freq binweed - 1 freq beyont - 7 freq boned - 2 freq banned - 34 freq bond - 16 freq behint - 5 freq bannit - 2 freq baint - 1 freq bint - 10 freq banty - 5 freq bunty - 12 freq baundy - 2 freq bondie - 3 freq baand - 13 freq bantie - 3 freq bundie - 1 freq bumed - 1 freq bumt - 1 freq bouned - 3 freq boonty - 1 freq 'behind' - 1 freq bunnit - 1 freq behiynd - 1 freq bayonet - 6 freq bonnieheid - 1 freq beand - 1 freq binwuid - 1 freq 'beyond - 1 freq beande - 1 freq bennett - 6 freq behynde - 1 freq bonnie-ee'd - 1 freq bount - 1 freq buoyant - 2 freq bannid - 1 freq bend-o - 1 freq boyndie - 6 freq bennite - 1 freq €˜band - 2 freq bmd - 1 freq bnto - 1 freq byamat - 1 freq bannet - 1 freq bond” - 1 freq bantu - 1 freq bindie - 1 freq binned - 1 freq bunnet” - 1 freq |
MetaPhone code - BNT bendie - 2 freq bendy - 3 freq bent - 104 freq bunnet - 111 freq bandy - 13 freq bend - 102 freq bound - 57 freq band - 159 freq bind - 20 freq bonnie-die - 1 freq bounty - 10 freq bund - 12 freq bunnet' - 2 freq baund - 21 freq boond - 9 freq bonnet - 34 freq boannet - 1 freq bunt - 6 freq boned - 2 freq banned - 34 freq bond - 16 freq bannit - 2 freq baint - 1 freq bint - 10 freq banty - 5 freq bunty - 12 freq baundy - 2 freq bondie - 3 freq baand - 13 freq bantie - 3 freq bundie - 1 freq bouned - 3 freq boonty - 1 freq bunnit - 1 freq beand - 1 freq beande - 1 freq bennett - 6 freq behynde - 1 freq bonnie-ee'd - 1 freq bount - 1 freq bannid - 1 freq bend-o - 1 freq boyndie - 6 freq bennite - 1 freq €˜band - 2 freq bnto - 1 freq bannet - 1 freq bond” - 1 freq bantu - 1 freq bindie - 1 freq binned - 1 freq bunnet” - 1 freq |
BOUND |
| Time to execute Levenshtein function - 0.176573 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.362952 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.037604 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.049116 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.000930 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. |