| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| kie-buirds (0) - 1 freq sign-buirds (3) - 1 freq keybuird (3) - 4 freq is-'birds (4) - 1 freq niebuhr's (4) - 2 freq kirkyairds (4) - 10 freq niebuhrs (4) - 2 freq cerbuird (4) - 1 freq keyboords (4) - 1 freq owerbuird (4) - 1 freq seabirds (4) - 4 freq keyburd (4) - 1 freq buirds (4) - 10 freq is-'burds (4) - 2 freq keyboards (4) - 3 freq kin-kinds (4) - 1 freq sidebuird (4) - 1 freq keywirds (4) - 1 freq on-buird (4) - 1 freq re-build (4) - 1 freq back-buirds (4) - 1 freq bigbirds (4) - 1 freq seaburds (4) - 1 freq kilbride (5) - 5 freq breirds (5) - 1 freq |
kie-buirds (0) - 1 freq keyboords (5) - 1 freq keybuird (5) - 4 freq keyboards (5) - 3 freq is-'burds (6) - 2 freq buirds (6) - 10 freq on-buird (6) - 1 freq bigbirds (6) - 1 freq back-buirds (6) - 1 freq keyburd (6) - 1 freq keywirds (6) - 1 freq seaburds (6) - 1 freq sign-buirds (6) - 1 freq kirkyairds (6) - 10 freq seabirds (6) - 4 freq is-'birds (6) - 1 freq kurds (7) - 1 freq luvburds (7) - 1 freq kailyairds (7) - 1 freq keyboard' (7) - 1 freq oil-yards (7) - 1 freq kebbers (7) - 1 freq 'burds (7) - 1 freq libbards (7) - 1 freq key-wurd (7) - 1 freq |
SoundEx code - K163 kivert - 4 freq kivvered - 2 freq keybrod - 1 freq keyboards - 3 freq kivered - 1 freq kivvert - 5 freq kie-buirds - 1 freq keyboord - 1 freq keyboard - 17 freq keyburd - 1 freq keybuird - 4 freq keppard - 1 freq keyboords - 1 freq keyboardist - 1 freq keyboard' - 1 freq |
MetaPhone code - KBRTS keyboards - 3 freq cubbords - 2 freq kie-buirds - 1 freq gabbards - 1 freq keyboords - 1 freq |
KIE-BUIRDS |
| Time to execute Levenshtein function - 0.589904 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 - 1.010283 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.030800 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.075987 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.000982 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. |