| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| iwo (0) - 1 freq ino (1) - 2 freq io (1) - 7 freq iw (1) - 2 freq pwo (1) - 1 freq lwo (1) - 1 freq iko (1) - 1 freq awo (1) - 1 freq iho (1) - 1 freq ifo (1) - 1 freq ywo (1) - 1 freq iws (1) - 1 freq ioo (1) - 1 freq iwq (1) - 1 freq two (1) - 773 freq wo (1) - 2 freq imo (1) - 44 freq iwa (1) - 3 freq iio (1) - 1 freq ipo (1) - 56 freq ibo (1) - 1 freq ihe (2) - 2 freq itn (2) - 2 freq nuo (2) - 1 freq i'v (2) - 7 freq |
iwo (0) - 1 freq wo (1) - 2 freq iwa (1) - 3 freq ywo (1) - 1 freq awo (1) - 1 freq iw (1) - 2 freq yw (2) - 3 freq wi (2) - 21330 freq ow (2) - 12 freq wao (2) - 1 freq awi (2) - 1 freq owe (2) - 26 freq ewe (2) - 3 freq wy (2) - 11 freq aw (2) - 8237 freq owa (2) - 1 freq we (2) - 10460 freq awy (2) - 13 freq awe (2) - 396 freq wa (2) - 148 freq awyo (2) - 1 freq wu (2) - 9 freq iaw (2) - 1 freq awa (2) - 4217 freq woo (2) - 19 freq |
SoundEx code - I000 i - 18870 freq 'i - 538 freq ii - 73 freq ih' - 1 freq iii - 34 freq i' - 347 freq ioo - 1 freq ihe - 2 freq -i - 1 freq i- - 1 freq -'i - 1 freq io - 7 freq iae - 5 freq i'we - 1 freq ie - 40 freq iho - 1 freq ih - 81 freq iwa - 3 freq «i - 1 freq ia - 5 freq i¢ - 1 freq iowa - 3 freq i-a - 1 freq éi - 1 freq 'ie - 1 freq iwo - 1 freq 'i' - 3 freq i'wee - 1 freq i'wa - 1 freq i'wie - 10 freq i'waa - 1 freq iy - 3 freq i - 1 freq -ie - 8 freq þið - 1 freq i - 99 freq i - 193 freq iye - 10 freq i - 1 freq i - 1 freq i - 1 freq i - 12 freq i - 1 freq i - 6 freq i - 1 freq iya - 1 freq i - 1 freq i - 1 freq ihy - 1 freq ieh - 1 freq iaw - 1 freq iu - 2 freq iio - 1 freq iyuyh - 1 freq iw - 2 freq |
MetaPhone code - IW i'we - 1 freq iwa - 3 freq iowa - 3 freq iwo - 1 freq i'wee - 1 freq i'wa - 1 freq i'wie - 10 freq i'waa - 1 freq |
IWO |
| Time to execute Levenshtein function - 0.196863 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.381489 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.032585 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.038140 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.001102 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. |