| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| baund-practice (0) - 1 freq hauf-price (6) - 2 freq tranentpractice (6) - 1 freq unattractive (6) - 3 freq practice (6) - 112 freq caur-racin (7) - 1 freq bdantarctica (7) - 1 freq launderette (7) - 1 freq lauraalice (7) - 1 freq practick (7) - 9 freq radioactive (7) - 3 freq radio-active (7) - 1 freq practices (7) - 6 freq practise (7) - 18 freq bourachie (7) - 1 freq haund-drawn (7) - 1 freq bulderation (7) - 1 freq practiced (7) - 6 freq mind-pictirs (7) - 2 freq bandparts (7) - 1 freq haund-wrocht (7) - 1 freq bairn-prince (7) - 1 freq saund-pit (7) - 6 freq attractive (7) - 11 freq saund-kelpie (7) - 1 freq |
baund-practice (0) - 1 freq bdantarctica (10) - 1 freq practice (10) - 112 freq bandparts (10) - 1 freq tranentpractice (10) - 1 freq haund-wrocht (11) - 1 freq bairn-prince (11) - 1 freq mind-pictirs (11) - 2 freq antarctic (11) - 1 freq sound-proofing (11) - 1 freq saund-pit (11) - 6 freq haund-wrutten (11) - 1 freq hauf-price (11) - 2 freq unattractive (11) - 3 freq cut-price (12) - 1 freq practices (12) - 6 freq apprentice (12) - 22 freq haundwritin (12) - 1 freq blood-brick (12) - 1 freq undemocratic (12) - 2 freq hand-rearit (12) - 1 freq underproductive (12) - 1 freq soond-pruif (12) - 1 freq haun-operated (12) - 1 freq bluid-plicht (12) - 1 freq |
SoundEx code - B531 bountifae - 1 freq baund-practice - 1 freq bountifou - 1 freq boontiefil - 1 freq bane-deep - 3 freq bunnet-fou - 1 freq boontifu - 1 freq bye-and-bye - 1 freq bentaps - 1 freq bound-up - 1 freq behindthefolk - 1 freq bindvdn - 1 freq bandparts - 1 freq |
MetaPhone code - BNTPRKTS baund-practice - 1 freq |
BAUND-PRACTICE |
| Time to execute Levenshtein function - 0.240555 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.470493 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.033852 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.041141 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.000876 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. |