| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fu-growed (0) - 2 freq furrowed (2) - 5 freq growed (3) - 47 freq fou-grown (3) - 1 freq man-growed (3) - 1 freq burrowed (3) - 1 freq up-growen (3) - 1 freq unrowed (3) - 2 freq hungower (4) - 1 freq rowed (4) - 73 freq trowed (4) - 3 freq fur-yowe (4) - 1 freq growes (4) - 31 freq upgraded (4) - 3 freq furrow (4) - 12 freq meun-growen (4) - 1 freq growd (4) - 1 freq furrows (4) - 4 freq flowed (4) - 9 freq funged (4) - 2 freq groped (4) - 1 freq nerrowed (4) - 1 freq mangroved (4) - 1 freq outgrown (4) - 1 freq full-grown (4) - 1 freq |
fu-growed (0) - 2 freq fou-grown (4) - 1 freq furrowed (4) - 5 freq up-growen (5) - 1 freq man-growed (5) - 1 freq growed (5) - 47 freq grouwed (6) - 1 freq unrowed (6) - 2 freq burrowed (6) - 1 freq growd (6) - 1 freq followed (7) - 142 freq fugged (7) - 1 freq narrowed (7) - 5 freq groued (7) - 7 freq furraed (7) - 2 freq borrowed (7) - 6 freq growled (7) - 14 freq throwed (7) - 12 freq hauf-grown (7) - 1 freq €˜growe (7) - 1 freq glowed (7) - 5 freq strowed (7) - 1 freq a-grade (7) - 1 freq hie-groond (7) - 1 freq aye-growin (7) - 1 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 - FKRWT fu-growed - 2 freq |
FU-GROWED |
| Time to execute Levenshtein function - 0.266867 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.382391 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.031652 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.041522 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.001294 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. |