| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bontine (0) - 2 freq boatin (2) - 1 freq bootin (2) - 2 freq bovine (2) - 2 freq bonkin (2) - 1 freq booting (2) - 2 freq online (2) - 143 freq boitie (2) - 2 freq bantie (2) - 3 freq routine (2) - 35 freq bowtie (2) - 1 freq buntin (2) - 4 freq bondin (2) - 1 freq bodine (2) - 1 freq contined (2) - 4 freq fontaine (2) - 1 freq boatie (2) - 124 freq rootine (2) - 1 freq bootie (2) - 1 freq bowtin (2) - 1 freq contint (2) - 1 freq bonnie (2) - 811 freq bunting (2) - 8 freq montie (2) - 1 freq bonie (2) - 13 freq |
bontine (0) - 2 freq buntin (2) - 4 freq bunting (3) - 8 freq bondin (3) - 1 freq continue (3) - 71 freq bowtin (3) - 1 freq fontaine (3) - 1 freq bonnie (3) - 811 freq bantie (3) - 3 freq boltin (3) - 3 freq bootin (3) - 2 freq boatin (3) - 1 freq bonkin (3) - 1 freq boontifu (4) - 1 freq pintin (4) - 17 freq bolton (4) - 2 freq binkin (4) - 1 freq wuntin (4) - 9 freq mintin (4) - 20 freq botany (4) - 3 freq gantin (4) - 23 freq mountin (4) - 5 freq mantin (4) - 1 freq fintin (4) - 1 freq bayonetin (4) - 1 freq |
SoundEx code - B535 bendin - 15 freq bending - 2 freq bindin - 6 freq bunting - 8 freq bandmates - 1 freq bnitam - 1 freq boondin - 1 freq bondin - 1 freq bonnetmaker - 3 freq buntin - 4 freq binnatoon - 1 freq bonding - 1 freq bendan - 1 freq bunden - 1 freq bentham - 1 freq boundin - 7 freq bontemps - 6 freq bontemps' - 1 freq buntings - 1 freq bounding - 1 freq bayonetin - 1 freq bantams - 1 freq bntton - 1 freq bontine - 2 freq binding - 1 freq bindins - 1 freq buntinrobert - 1 freq bonnyton - 18 freq |
MetaPhone code - BNTN bendin - 15 freq bindin - 6 freq boondin - 1 freq bondin - 1 freq buntin - 4 freq binnatoon - 1 freq bendan - 1 freq bunden - 1 freq boundin - 7 freq bntton - 1 freq bontine - 2 freq bonnyton - 18 freq |
BONTINE |
| Time to execute Levenshtein function - 0.314924 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.720414 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.063966 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.069420 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.000927 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. |