| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fower-leggit (0) - 2 freq owerleggit (2) - 1 freq four-leggit (2) - 1 freq bowdy-leggit (3) - 1 freq fower-neukit (3) - 1 freq one-leggit (3) - 1 freq ower-hingit (4) - 1 freq water-loggit (4) - 1 freq fower-leaved (4) - 2 freq flae-luggit (4) - 1 freq bowdie-leggit (4) - 1 freq four-legged (4) - 1 freq fower-leafed (4) - 1 freq fower-fit (4) - 1 freq fower-letter (4) - 1 freq three-leggit (4) - 2 freq fair-fleggit (4) - 1 freq flee-luggit (4) - 1 freq forleitit (5) - 7 freq owerleukin (5) - 4 freq fower-year (5) - 2 freq three-legget (5) - 1 freq owerlookit (5) - 2 freq cross-leggit (5) - 4 freq fleggit (5) - 60 freq |
fower-leggit (0) - 2 freq four-leggit (3) - 1 freq owerleggit (4) - 1 freq bowdy-leggit (5) - 1 freq four-legged (6) - 1 freq bowdie-leggit (6) - 1 freq fair-fleggit (6) - 1 freq flae-luggit (6) - 1 freq flee-luggit (6) - 1 freq water-loggit (6) - 1 freq fower-neukit (6) - 1 freq one-leggit (6) - 1 freq three-leggit (6) - 2 freq three-legget (7) - 1 freq fower-letter (7) - 1 freq ower-hingit (7) - 1 freq fower-leaved (7) - 2 freq fower-leafed (7) - 1 freq fower-fit (7) - 1 freq ower-lang (8) - 1 freq fleggit (8) - 60 freq threeleggit (8) - 2 freq flouer-lit (8) - 1 freq hie-liggit (8) - 1 freq fower-pairt (8) - 1 freq |
SoundEx code - F642 ferlies - 61 freq ferlie's - 3 freq foreleg - 1 freq furloughed - 4 freq fearlessly - 2 freq fearless - 10 freq fareweels - 1 freq farls - 5 freq fower-leggit - 2 freq four-leggit - 1 freq frail-lookin - 1 freq frolic - 1 freq fireless - 3 freq firelichtin - 1 freq frillies - 1 freq frills - 1 freq forelegs - 1 freq firelicht - 2 freq fare-ye-weills - 1 freq fareweills - 1 freq farrels - 1 freq four-legged - 1 freq frolicking - 1 freq fairlookingforwardtoit - 1 freq frolicked - 1 freq |
MetaPhone code - FWRLKT fower-leggit - 2 freq |
FOWER-LEGGIT |
| Time to execute Levenshtein function - 0.594152 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.881212 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.028509 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.090353 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.000844 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. |