| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| buntin (0) - 4 freq puntin (1) - 5 freq wuntin (1) - 9 freq luntin (1) - 1 freq bunting (1) - 8 freq duntin (1) - 24 freq huntin (1) - 66 freq buttin (1) - 6 freq cuntin (1) - 1 freq muntin (1) - 11 freq bungin (1) - 3 freq dauntin (2) - 4 freq gustin (2) - 1 freq wunting (2) - 1 freq bannin (2) - 5 freq bumin (2) - 1 freq buryin (2) - 6 freq cuntain (2) - 1 freq lundin (2) - 1 freq tunkin (2) - 1 freq bastin (2) - 1 freq funtain (2) - 6 freq buzzin (2) - 39 freq buttir (2) - 2 freq muttin (2) - 3 freq |
buntin (0) - 4 freq buttin (2) - 6 freq cuntin (2) - 1 freq bungin (2) - 3 freq huntin (2) - 66 freq muntin (2) - 11 freq bontine (2) - 2 freq duntin (2) - 24 freq puntin (2) - 5 freq wuntin (2) - 9 freq luntin (2) - 1 freq bunting (2) - 8 freq sauntin (3) - 1 freq bindin (3) - 6 freq buistin (3) - 1 freq intin (3) - 2 freq duntn (3) - 1 freq battin (3) - 1 freq bunter (3) - 8 freq bingin (3) - 1 freq bunty (3) - 12 freq cantin (3) - 4 freq bitin (3) - 27 freq gauntin (3) - 2 freq bowtin (3) - 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 |
BUNTIN |
| Time to execute Levenshtein function - 0.296119 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.492817 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.029962 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.041731 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.004256 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. |