| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| lo-an-behaud (0) - 1 freq loan-heid (5) - 1 freq oor-an-a-hauf (5) - 2 freq twa-an-a-hauf (6) - 2 freq tae-haud (6) - 1 freq stranghaud (6) - 1 freq behaud (6) - 9 freq oak-beam (6) - 1 freq mile-an-a-hauf (6) - 1 freq hoosehaud (6) - 62 freq nae-baud (6) - 1 freq 'behaud (6) - 1 freq dounhaud (6) - 1 freq orange-and (6) - 1 freq broon-beard (6) - 1 freq lanabanana (7) - 6 freq lochead (7) - 3 freq loangest (7) - 1 freq lopingted (7) - 1 freq anywhaur (7) - 2 freq dab-haun (7) - 1 freq lounged (7) - 2 freq doun-hauden (7) - 2 freq tounbraid (7) - 1 freq angelauk (7) - 4 freq |
lo-an-behaud (0) - 1 freq loan-heid (7) - 1 freq oor-an-a-hauf (8) - 2 freq linn-heid (9) - 1 freq mile-an-a-hauf (9) - 1 freq broon-beard (9) - 1 freq nae-baud (9) - 1 freq pan-breid (10) - 2 freq laanched (10) - 1 freq ianbhood (10) - 2 freq bairn-bed (10) - 1 freq london-based (10) - 1 freq on-buird (10) - 1 freq toun-bred (10) - 3 freq whun-hud (10) - 1 freq sun-bed (10) - 4 freq lang-baked (10) - 1 freq behaud (10) - 9 freq tae-haud (10) - 1 freq dounhaud (10) - 1 freq 'behaud (10) - 1 freq twa-an-a-hauf (10) - 2 freq lip-read (11) - 1 freq sun-baked (11) - 1 freq launched (11) - 18 freq |
SoundEx code - L513 limbed - 1 freq lamb-pot - 1 freq lambed - 2 freq lempets - 2 freq limpet - 5 freq lampit - 2 freq lamped - 2 freq limpets - 2 freq limpits - 1 freq lumped - 2 freq lumpots - 1 freq lempit - 2 freq lumpit - 1 freq limped - 1 freq lo-an-behaud - 1 freq limpit - 1 freq |
MetaPhone code - LNBHT lo-an-behaud - 1 freq |
LO-AN-BEHAUD |
| Time to execute Levenshtein function - 0.368179 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.393388 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.028303 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.037250 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.000852 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. |