| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| inland (0) - 5 freq island (1) - 119 freq vinland (1) - 2 freq ingland (1) - 50 freq irland (1) - 6 freq finland (1) - 6 freq inlan (1) - 1 freq inlaid (1) - 3 freq i'lane (2) - 1 freq inglann (2) - 1 freq ireland (2) - 142 freq i'band (2) - 2 freq mainland (2) - 19 freq islans (2) - 5 freq tland (2) - 3 freq inla (2) - 1 freq indaed (2) - 3 freq poland (2) - 10 freq ingang (2) - 21 freq islands (2) - 58 freq inhad (2) - 1 freq inglan (2) - 9 freq bland (2) - 7 freq i'lang (2) - 1 freq islan (2) - 13 freq |
inland (0) - 5 freq finland (2) - 6 freq inlan (2) - 1 freq irland (2) - 6 freq inlaid (2) - 3 freq ingland (2) - 50 freq island (2) - 119 freq vinland (2) - 2 freq annand (3) - 10 freq iceland (3) - 42 freq eyland (3) - 2 freq roland (3) - 2 freq eland (3) - 1 freq upland (3) - 5 freq onand (3) - 1 freq intend (3) - 10 freq bland (3) - 7 freq england (3) - 224 freq 'land (3) - 1 freq inleid (3) - 1 freq land (3) - 340 freq airland (3) - 2 freq hieland (3) - 16 freq tland (3) - 3 freq ireland (3) - 142 freq |
SoundEx code - I545 in-lyins - 1 freq inland - 5 freq inlan - 1 freq inalienable - 1 freq inhalin - 3 freq |
MetaPhone code - INLNT inland - 5 freq |
INLAND |
| Time to execute Levenshtein function - 0.196189 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.363348 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.027316 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.037577 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.000789 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. |