| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| foghradh (0) - 1 freq foghar (3) - 1 freq samhradh (3) - 2 freq forrad (3) - 5 freq garadh (3) - 1 freq ogham (4) - 2 freq apgrade (4) - 3 freq bodhran (4) - 2 freq footpath (4) - 2 freq fqbwtadh (4) - 1 freq comrade (4) - 9 freq fleadh (4) - 1 freq fowerth (4) - 6 freq feerach (4) - 3 freq dorado (4) - 1 freq eoghan (4) - 1 freq geograph (4) - 2 freq fogged (4) - 1 freq foarth (4) - 1 freq forrid (4) - 1 freq grado (4) - 1 freq fora (4) - 3 freq fords (4) - 1 freq thrash (4) - 9 freq o'trade (4) - 1 freq |
foghradh (0) - 1 freq garadh (5) - 1 freq samhradh (5) - 2 freq foghar (5) - 1 freq foghorn (6) - 4 freq figured (6) - 11 freq highroad (6) - 6 freq hearadh (6) - 1 freq forrad (6) - 5 freq eggheads (7) - 1 freq farrach (7) - 1 freq nightah (7) - 1 freq thrade (7) - 1 freq digraph (7) - 3 freq farah (7) - 1 freq fradi (7) - 1 freq baghdad (7) - 1 freq a-grade (7) - 1 freq forsh (7) - 1 freq fightan (7) - 3 freq fourth (7) - 34 freq degrade (7) - 1 freq eoggudh (7) - 1 freq upgrade (7) - 1 freq ford (7) - 13 freq |
SoundEx code - F263 figured - 11 freq fichert - 1 freq fuskered - 1 freq fissured - 1 freq fjords - 2 freq fu-growed - 2 freq figuratif - 1 freq fiegured - 1 freq figuratively - 7 freq figurative - 3 freq fjord - 2 freq focherty - 1 freq fause-hertit - 1 freq foghradh - 1 freq feigurative - 2 freq fasert - 1 freq faizart - 1 freq fawkert - 2 freq fichertie - 1 freq fichered - 1 freq fogarty - 1 freq |
MetaPhone code - FFRT favourt - 5 freq favourite - 234 freq fauvrit - 1 freq favoured - 12 freq fevered - 2 freq faivourit - 1 freq favourit - 7 freq fav'rite - 2 freq 'favourite - 1 freq favorit - 2 freq faavourt - 1 freq fivert - 2 freq favorite - 2 freq favrit - 6 freq favert - 1 freq foghradh - 1 freq |
FOGHRADH |
| Time to execute Levenshtein function - 0.422280 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.595286 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.027685 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.071057 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.000888 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. |