| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| oor-an-a-hauf (0) - 2 freq twa-an-a-hauf (3) - 2 freq mile-an-a-hauf (4) - 1 freq lo-an-behaud (5) - 1 freq fore-a-haun (5) - 1 freq oan-and-aff (6) - 1 freq eleven-an-a-hauf (6) - 1 freq seeven-an-a-hauf (6) - 1 freq out-and-out (7) - 1 freq orange-and (7) - 1 freq oot-an-oot (7) - 3 freq rat-a-tat (7) - 7 freq raip-haul (7) - 1 freq stranghaud (7) - 1 freq born-again (7) - 1 freq work-a-day (7) - 1 freq cranachan (7) - 3 freq oot-o'-e-way (7) - 2 freq eleeven-an-a-hauf (7) - 1 freq crannachan (7) - 4 freq near-at-haun (7) - 2 freq oot-and-oot (7) - 1 freq ootlin-shapit (8) - 1 freq mean-ah (8) - 1 freq gransha (8) - 1 freq |
oor-an-a-hauf (0) - 2 freq twa-an-a-hauf (5) - 2 freq mile-an-a-hauf (6) - 1 freq lo-an-behaud (8) - 1 freq seeven-an-a-hauf (9) - 1 freq eleven-an-a-hauf (9) - 1 freq oan-and-aff (9) - 1 freq fore-a-haun (9) - 1 freq eleeven-an-a-hauf (10) - 1 freq oot-o'-e-way (11) - 2 freq fou---fou (11) - 1 freq oot-and-oot (11) - 1 freq rin-aff (11) - 1 freq near-at-haun (11) - 2 freq raip-haul (11) - 1 freq rat-a-tat (11) - 7 freq orange-and (11) - 1 freq oot-an-oot (11) - 3 freq out-and-out (11) - 1 freq airn-hard (12) - 1 freq airn-baur (12) - 1 freq richt-haun (12) - 6 freq on-an-on (12) - 1 freq one-aff (12) - 1 freq ran-dan (12) - 2 freq |
SoundEx code - O651 oor-an-a-hauf - 2 freq owre-informal - 1 freq ornpjfqadc - 1 freq orawhimbrel - 1 freq ormifootball - 5 freq |
MetaPhone code - ORNHF oor-an-a-hauf - 2 freq |
OOR-AN-A-HAUF |
| Time to execute Levenshtein function - 0.265449 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.487858 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.032638 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.041881 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.000962 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. |