| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bunting (0) - 8 freq buntings (1) - 1 freq wunting (1) - 1 freq hunting (1) - 10 freq buntin (1) - 4 freq busking (2) - 1 freq ranting (2) - 4 freq biting (2) - 1 freq bulking (2) - 1 freq dunning (2) - 1 freq bounding (2) - 1 freq renting (2) - 2 freq duncing (2) - 3 freq buying (2) - 13 freq bontine (2) - 2 freq haunting (2) - 3 freq bundling (2) - 1 freq putting (2) - 15 freq wuntin (2) - 9 freq bungin (2) - 3 freq cutting (2) - 16 freq lusting (2) - 1 freq daunting (2) - 1 freq cunning (2) - 1 freq buzzing (2) - 11 freq |
bunting (0) - 8 freq hunting (2) - 10 freq buntin (2) - 4 freq wunting (2) - 1 freq buntings (2) - 1 freq pinting (3) - 1 freq daunting (3) - 1 freq pynting (3) - 1 freq booting (3) - 2 freq bending (3) - 2 freq wanting (3) - 18 freq panting (3) - 3 freq penting (3) - 1 freq binding (3) - 1 freq belting (3) - 2 freq banning (3) - 2 freq counting (3) - 4 freq haunting (3) - 3 freq bouncing (3) - 5 freq bonding (3) - 1 freq biting (3) - 1 freq ranting (3) - 4 freq tenting (3) - 1 freq bounding (3) - 1 freq renting (3) - 2 freq |
SoundEx code - B535 bendin - 14 freq bending - 2 freq bindin - 6 freq bunting - 8 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 - BNTNK bending - 2 freq bunting - 8 freq bonding - 1 freq bounding - 1 freq binding - 1 freq |
BUNTING |
| Time to execute Levenshtein function - 0.198540 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.334422 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.027283 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.036821 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.000863 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. |