| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| italians (0) - 8 freq italiens (1) - 2 freq italiani (1) - 1 freq italian (1) - 62 freq italiano (1) - 2 freq italia (2) - 1 freq staans (3) - 4 freq palins (3) - 8 freq vitamins (3) - 3 freq €˜taliani (3) - 1 freq stations (3) - 10 freq arabians (3) - 1 freq asians (3) - 4 freq catalans (3) - 3 freq stallions (3) - 1 freq indians (3) - 11 freq natalia's (3) - 1 freq walins (3) - 2 freq taliban (3) - 3 freq starlins (3) - 1 freq ettlins (3) - 26 freq littlins (3) - 25 freq tartans (3) - 4 freq 'lallans (3) - 1 freq idaias (3) - 6 freq |
italians (0) - 8 freq italiens (1) - 2 freq italiano (2) - 2 freq italiani (2) - 1 freq italian (2) - 62 freq talons (3) - 5 freq aliens (4) - 5 freq outlins (4) - 2 freq takins (4) - 2 freq ettlins (4) - 26 freq dealins (4) - 5 freq alans (4) - 2 freq aalins (4) - 2 freq yealins (4) - 1 freq italys (4) - 1 freq walins (4) - 2 freq kitlins (4) - 6 freq healins (4) - 1 freq italy's (4) - 1 freq islans (4) - 5 freq eytalian (4) - 1 freq palins (4) - 8 freq catalans (4) - 3 freq ootlins (4) - 3 freq italia (4) - 1 freq |
SoundEx code - I345 italian - 62 freq italians - 8 freq idling - 1 freq i'atlantic - 1 freq 'idalawn' - 1 freq italiens - 2 freq italiani - 1 freq italiano - 2 freq |
MetaPhone code - ITLNS italians - 8 freq italiens - 2 freq |
ITALIANS |
| Time to execute Levenshtein function - 0.397736 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.689622 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.039975 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.074671 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.000922 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. |