| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ferriers (0) - 1 freq terriers (1) - 1 freq ferrier (1) - 6 freq ferries (1) - 5 freq ferlie's (2) - 3 freq ferried (2) - 2 freq kerries (2) - 8 freq fergie's (2) - 4 freq ferlies (2) - 61 freq werrers (2) - 1 freq merries (2) - 6 freq fermers (2) - 90 freq harriers (2) - 2 freq furrier (2) - 1 freq terrier (2) - 13 freq carriers (2) - 2 freq herries (2) - 4 freq barriers (2) - 6 freq berries (2) - 26 freq furriners (2) - 2 freq merrier (2) - 4 freq ferrer (2) - 8 freq jerries (2) - 11 freq cerries (2) - 3 freq verrier's (2) - 1 freq |
ferriers (0) - 1 freq ferrier (2) - 6 freq ferries (2) - 5 freq terriers (2) - 1 freq ferrer (3) - 8 freq barriers (3) - 6 freq carriers (3) - 2 freq forriners (3) - 1 freq farrier (3) - 2 freq ferrero (3) - 1 freq furrier (3) - 1 freq ferris (3) - 1 freq ferrets (3) - 10 freq furriners (3) - 2 freq fermers (3) - 90 freq werrers (3) - 1 freq harriers (3) - 2 freq ferry's (4) - 1 freq furreners (4) - 1 freq forivers (4) - 1 freq farrer (4) - 27 freq ferrari (4) - 3 freq warriors (4) - 20 freq forrits (4) - 17 freq firrits (4) - 3 freq |
SoundEx code - F662 fireworks - 11 freq firework - 9 freq friars - 4 freq firewurks - 1 freq firewark - 2 freq firewirks - 8 freq free-warkin - 1 freq freirs - 2 freq frieryke - 6 freq fire-raisin - 1 freq firewirk - 2 freq firewirkssae - 1 freq ferriers - 1 freq fryers - 1 freq 'fireworks - 2 freq |
MetaPhone code - FRRS friars - 4 freq freirs - 2 freq verrier's - 1 freq vyryrz - 1 freq ferriers - 1 freq frères - 2 freq |
FERRIERS |
| Time to execute Levenshtein function - 0.248642 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.394518 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.028937 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.038757 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.000934 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. |