| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fjords (0) - 2 freq fords (1) - 1 freq fjord (1) - 2 freq fronds (2) - 3 freq foras (2) - 3 freq forss (2) - 3 freq boords (2) - 8 freq words (2) - 811 freq swords (2) - 36 freq chords (2) - 10 freq 'words (2) - 1 freq forms (2) - 113 freq fores (2) - 1 freq foods (2) - 6 freq forde (2) - 3 freq folds (2) - 8 freq jordy (2) - 4 freq forks (2) - 15 freq flodds (2) - 1 freq fonds (2) - 1 freq fiord (2) - 1 freq floods (2) - 13 freq forts (2) - 3 freq joris (2) - 1 freq fiorda (2) - 1 freq |
fjords (0) - 2 freq fords (2) - 1 freq fjord (2) - 2 freq forts (4) - 3 freq fiorda (4) - 1 freq floods (4) - 13 freq fonds (4) - 1 freq flodds (4) - 1 freq foonds (4) - 11 freq fiord (4) - 1 freq flores (4) - 1 freq lords (4) - 27 freq futrads (4) - 2 freq for's (4) - 1 freq cords (4) - 5 freq forks (4) - 15 freq ford (4) - 13 freq joris (4) - 1 freq boords (4) - 8 freq swords (4) - 36 freq forss (4) - 3 freq foras (4) - 3 freq fronds (4) - 3 freq jordy (4) - 4 freq chords (4) - 10 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 - FJRTS fjords - 2 freq |
FJORDS |
| Time to execute Levenshtein function - 0.228153 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.426722 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.065023 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.084093 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.012282 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. |