| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| irois (0) - 1 freq trois (1) - 1 freq irons (1) - 3 freq iris (1) - 3 freq rois (1) - 4 freq kris (2) - 1 freq gris (2) - 1 freq dois (2) - 3 freq qois (2) - 1 freq probs (2) - 8 freq cros (2) - 1 freq ivors (2) - 1 freq gross (2) - 6 freq ibis (2) - 1 freq bro's (2) - 1 freq roid (2) - 1 freq drogs (2) - 2 freq roks (2) - 1 freq croys (2) - 1 freq icons (2) - 9 freq ions (2) - 3 freq ros (2) - 1 freq trots (2) - 3 freq broos (2) - 44 freq iron (2) - 103 freq |
irois (0) - 1 freq rois (1) - 4 freq iris (1) - 3 freq reis (2) - 1 freq ros (2) - 1 freq irs (2) - 1 freq airis (2) - 1 freq ris (2) - 41 freq trois (2) - 1 freq irons (2) - 3 freq roos (2) - 2 freq eros (2) - 16 freq gros (3) - 8 freq bris (3) - 1 freq aries (3) - 3 freq roiz (3) - 1 freq ironie (3) - 1 freq ios (3) - 2 freq araise (3) - 1 freq rouse (3) - 14 freq ious (3) - 1 freq arose (3) - 15 freq iools (3) - 1 freq eres (3) - 1 freq roi (3) - 1 freq |
SoundEx code - I620 irish - 140 freq 'irish - 2 freq irks - 1 freq ihere's - 5 freq irois - 1 freq irs - 1 freq iraq - 8 freq 'ir's - 3 freq i'rice - 1 freq irk - 2 freq iraqi - 3 freq Éire's - 2 freq iris - 3 freq €˜irish - 2 freq €™irs - 1 freq €œirish - 2 freq irrx - 1 freq iirc - 1 freq |
MetaPhone code - IRS irois - 1 freq irs - 1 freq 'ir's - 3 freq i'rice - 1 freq Éire's - 2 freq iris - 3 freq €™irs - 1 freq |
IROIS |
| Time to execute Levenshtein function - 0.247443 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.389578 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.029687 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.037029 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.000786 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. |