| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yrfyyujirw (0) - 1 freq gyrfyimx (6) - 1 freq requirt (6) - 1 freq fyirs (6) - 1 freq royhair (6) - 3 freq treasuir (6) - 1 freq fluirs (6) - 4 freq ruairi (6) - 1 freq keybuird (6) - 4 freq safeguaird (6) - 1 freq rayburn (6) - 1 freq fuirs (6) - 1 freq fyshirs (6) - 6 freq yfjial (6) - 1 freq fyur (6) - 2 freq truiro (6) - 1 freq ryanair (6) - 3 freq fzyji (6) - 1 freq treysure (6) - 4 freq craituir (6) - 1 freq fwsuji (6) - 1 freq procuire (6) - 1 freq fuji (6) - 1 freq yilmuir (6) - 1 freq yugir (6) - 2 freq |
yrfyyujirw (0) - 1 freq affuird (9) - 5 freq fuirt (9) - 1 freq cfjrs (9) - 1 freq ryanair (9) - 3 freq frw (9) - 1 freq fluir (9) - 40 freq retuirn (9) - 1 freq rfairnie (9) - 12 freq fjord (9) - 2 freq unfilrw (9) - 1 freq require (9) - 10 freq urafirt (9) - 1 freq ardifuir (9) - 2 freq fuji (9) - 1 freq fyur (9) - 2 freq fuirs (9) - 1 freq rayburn (9) - 1 freq safeguaird (9) - 1 freq ruairi (9) - 1 freq furrow (9) - 12 freq fyirs (9) - 1 freq requirt (9) - 1 freq royhair (9) - 3 freq fluirs (9) - 4 freq |
SoundEx code - Y612 yearbeuk - 1 freq yerbs - 2 freq yearbuik - 1 freq yerbaws - 1 freq yrwuvgvi - 1 freq yrfyyujirw - 1 freq yyyurhuifc - 1 freq yrviq - 1 freq |
MetaPhone code - RFJR yrfyyujirw - 1 freq |
YRFYYUJIRW |
| Time to execute Levenshtein function - 0.357841 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.410604 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.028060 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.039041 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.000864 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. |