| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bonnieburgh (0) - 9 freq lononburgh (4) - 1 freq bonnier (4) - 24 freq lunnonburgh (4) - 1 freq edenburgh (5) - 3 freq monsieur (5) - 3 freq bleurgh (5) - 1 freq bonnie (5) - 811 freq bonniely (5) - 1 freq meikleburgh (5) - 18 freq bonnieheid (5) - 1 freq mussilburgh (5) - 1 freq roxburgh (5) - 1 freq vanedenburgh (5) - 1 freq bonnie's (5) - 6 freq bonniest (5) - 48 freq bonnielike (5) - 1 freq bonnie-ee'd (5) - 1 freq bonnybrig (5) - 1 freq edinburgh (5) - 349 freq newburgh (5) - 1 freq bonnieness (5) - 5 freq bonnie-like (5) - 1 freq cunningsburgh (5) - 1 freq horsburgh (5) - 2 freq |
bonnieburgh (0) - 9 freq lononburgh (5) - 1 freq lunnonburgh (6) - 1 freq bonnybrig (6) - 1 freq edinburgh (7) - 349 freq vanedenburgh (7) - 1 freq edenburgh (7) - 3 freq newburgh (7) - 1 freq bonnier (7) - 24 freq roxburgh (8) - 1 freq horsburgh (8) - 2 freq bleurgh (8) - 1 freq bonnyrigg (8) - 23 freq meikleburgh (8) - 18 freq edinburghy (8) - 1 freq edinbugh (9) - 1 freq helensburgh (9) - 3 freq binnert (9) - 1 freq bonnymuir (9) - 1 freq litedinburgh (9) - 3 freq borough (9) - 1 freq hburgh (9) - 1 freq amcedinburgh (9) - 3 freq emburgh (9) - 1 freq sumburgh (9) - 16 freq |
SoundEx code - B516 bombers - 7 freq bonfires - 8 freq bonfire - 28 freq banefire - 3 freq bumper - 4 freq bonnieburgh - 9 freq bonaparte - 2 freq bambrick - 1 freq bumper's - 1 freq 'bombardment - 1 freq bomber's - 1 freq bombardments - 1 freq bombardment - 1 freq bonefire - 1 freq bonaparty - 1 freq bomber - 3 freq bonfrost - 1 freq bombards - 1 freq bumbard - 1 freq bonnybrig - 1 freq bamber - 2 freq bonfire-bit - 1 freq bombardit - 1 freq binfire - 1 freq beanieforindy - 1 freq |
MetaPhone code - BNBR bonnieburgh - 9 freq |
BONNIEBURGH |
| Time to execute Levenshtein function - 0.243746 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.490398 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.060971 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.042797 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.004847 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. |