| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iper (0) - 7 freq ier (1) - 1 freq ipe (1) - 1 freq iwer (1) - 5 freq piper (1) - 31 freq per (1) - 70 freq liper (1) - 1 freq sper (1) - 1 freq iver (1) - 312 freq viper (1) - 1 freq riper (1) - 4 freq veer (2) - 1 freq geer (2) - 16 freq ieed (2) - 1 freq pep (2) - 3 freq pecr (2) - 1 freq ise (2) - 2 freq reer (2) - 1 freq aiver (2) - 3 freq 'pey (2) - 1 freq aider (2) - 2 freq fier (2) - 6 freq niver (2) - 851 freq gcer (2) - 2 freq ner (2) - 53 freq |
iper (0) - 7 freq per (1) - 70 freq pur (2) - 5 freq pir (2) - 31 freq pear (2) - 9 freq peur (2) - 28 freq puer (2) - 1 freq poer (2) - 1 freq upr (2) - 2 freq par (2) - 10 freq pyr (2) - 1 freq peer (2) - 199 freq opera (2) - 11 freq peir (2) - 3 freq paer (2) - 3 freq pero (2) - 1 freq pere (2) - 1 freq por (2) - 2 freq peri (2) - 2 freq pr (2) - 21 freq pier (2) - 38 freq peru (2) - 3 freq ipe (2) - 1 freq iver (2) - 312 freq piper (2) - 31 freq |
SoundEx code - I160 ivver - 276 freq iver - 312 freq ivvery - 74 freq ivry - 124 freq ivvry - 20 freq ivery - 188 freq iviry - 56 freq ivir - 33 freq iverie - 73 freq ivrie - 5 freq ivory - 8 freq iveree - 7 freq ivverie - 25 freq iper - 7 freq i'very - 1 freq iv'ry - 1 freq iwver - 1 freq ivverrie - 1 freq ivor - 19 freq i'beer - 1 freq i'bear - 1 freq i'braw - 1 freq ivur - 2 freq ivvri - 9 freq iverywye - 1 freq iberia - 1 freq iverrie - 1 freq ivvir - 6 freq €œivery - 1 freq iffer - 1 freq iffery - 1 freq ivree - 1 freq ivr - 1 freq ivrey - 1 freq |
MetaPhone code - IPR iper - 7 freq |
IPER |
| Time to execute Levenshtein function - 0.404036 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.690494 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.027257 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.091244 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.000894 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. |