| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gruyère (0) - 1 freq gruyère' (1) - 1 freq gunfire (4) - 3 freq gunfre (4) - 1 freq gruggie (4) - 2 freq gruinard (4) - 2 freq guerre (4) - 1 freq grushie (4) - 3 freq gryter (4) - 2 freq gruche (4) - 1 freq grunders (4) - 2 freq argyre (4) - 1 freq grylle (4) - 1 freq grumlie (4) - 1 freq grumphie (4) - 367 freq gryce (4) - 1 freq grunter (4) - 1 freq grunge (4) - 1 freq grungers (4) - 1 freq frères (4) - 2 freq grurh (4) - 1 freq grye (4) - 1 freq valère (4) - 1 freq gregoire (4) - 1 freq brucre (4) - 1 freq |
gruyère (0) - 1 freq gruyère' (2) - 1 freq première (6) - 1 freq molière (6) - 22 freq gramaire (6) - 1 freq frères (6) - 2 freq guidèrs (6) - 1 freq grunter (6) - 1 freq bergère (6) - 1 freq gryter (6) - 2 freq guerre (6) - 1 freq gregoire (6) - 1 freq greyer (6) - 1 freq guldèr (6) - 1 freq valère (6) - 1 freq grocery (7) - 4 freq gret'r (7) - 1 freq unnèr (7) - 27 freq grimmer (7) - 1 freq gretter (7) - 2 freq groomer (7) - 1 freq gramarye (7) - 1 freq murdèr (7) - 4 freq grower (7) - 2 freq grigory (7) - 2 freq |
SoundEx code - G660 greyer - 1 freq greer - 6 freq gruyère - 1 freq gruyère' - 1 freq grower - 2 freq grory - 1 freq grurh - 1 freq |
MetaPhone code - KRR career - 65 freq courier - 6 freq cairrier - 13 freq crier - 2 freq corer - 1 freq carrier - 15 freq greer - 6 freq carer - 10 freq gruy̬re - 1 freq gruy̬re' - 1 freq grory - 1 freq queirer - 1 freq 'career - 1 freq queerer - 2 freq cairier - 1 freq ۪career - 1 freq grurh - 1 freq corrour - 1 freq 'krrraaar' - 1 freq |
GRUYÈRE |
| Time to execute Levenshtein function - 0.404322 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 - 1.032783 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.089609 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.093968 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.001056 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. |