| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| uisge-beatha (0) - 1 freq wife-beater (5) - 1 freq wing-beat (5) - 1 freq cowdenbeath (6) - 8 freq unnerneath (6) - 25 freq base-baa (6) - 1 freq underneath (6) - 22 freq beatha (6) - 5 freq uigeach (6) - 1 freq bible-bearif (6) - 1 freq dis-health (6) - 1 freq unnernathe (7) - 1 freq spreath (7) - 2 freq gingerboab (7) - 5 freq basketbaa (7) - 1 freq life-mate (7) - 1 freq i'geets (7) - 2 freq i'bath (7) - 1 freq undefeated (7) - 1 freq sensethe (7) - 1 freq i'beach (7) - 1 freq eisboatie (7) - 1 freq is-the (7) - 1 freq uisge (7) - 5 freq fire-bells (7) - 1 freq |
uisge-beatha (0) - 1 freq wing-beat (8) - 1 freq wife-beater (8) - 1 freq saubbath (9) - 1 freq is-'the (9) - 1 freq is-but (9) - 1 freq sabbath (9) - 109 freq mud-bath (9) - 1 freq sawbath (9) - 1 freq is-the (9) - 1 freq beatha (9) - 5 freq eg-bater (9) - 1 freq us-but (9) - 1 freq dis-the (10) - 1 freq seeventh (10) - 6 freq seiventh (10) - 2 freq off-beat (10) - 1 freq steeth (10) - 1 freq seempathy (10) - 2 freq seethe (10) - 2 freq sheath (10) - 3 freq again-baith (10) - 1 freq osteopathy (10) - 1 freq asgairth (10) - 17 freq sawbith (10) - 4 freq |
SoundEx code - U213 us-but - 1 freq uisge-beatha - 1 freq uzgfdi - 1 freq uyqgppeead - 1 freq ukphotoshow - 1 freq |
MetaPhone code - USJB0 uisge-beatha - 1 freq |
UISGE-BEATHA |
| Time to execute Levenshtein function - 0.389884 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.433316 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.031687 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.042711 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.000859 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. |