| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vigeland (0) - 1 freq 'vigeland (1) - 2 freq 'iceland (2) - 2 freq hieland (2) - 16 freq vagaland (2) - 1 freq vinland (2) - 2 freq highland (2) - 30 freq vigilant (2) - 3 freq ireland (2) - 142 freq iceland (2) - 42 freq england (3) - 224 freq hameland (3) - 7 freq 'iceland' (3) - 1 freq raceland (3) - 1 freq zeeland (3) - 1 freq cleland (3) - 7 freq mirrland (3) - 2 freq inland (3) - 5 freq lifelang (3) - 2 freq faireland (3) - 1 freq hielands (3) - 11 freq ingland (3) - 50 freq highlands (3) - 10 freq gigglan (3) - 1 freq copeland (3) - 1 freq |
vigeland (0) - 1 freq vagaland (2) - 1 freq 'vigeland (2) - 2 freq vigilant (3) - 3 freq vinland (3) - 2 freq ingland (4) - 50 freq england (4) - 224 freq vigilante (4) - 1 freq legoland (4) - 2 freq ireland (4) - 142 freq hieland (4) - 16 freq iceland (4) - 42 freq highland (4) - 30 freq 'iceland (4) - 2 freq yreland (5) - 1 freq finland (5) - 6 freq heeland (5) - 1 freq airland (5) - 2 freq vagabond (5) - 2 freq visand (5) - 1 freq eland (5) - 1 freq homeland (5) - 1 freq widland (5) - 10 freq island (5) - 119 freq hicland (5) - 1 freq |
SoundEx code - V245 vigilante - 1 freq vigilant - 3 freq vaclensi - 1 freq vagaland - 1 freq 'vigeland - 2 freq vigeland - 1 freq |
MetaPhone code - FJLNT vigilante - 1 freq vigilant - 3 freq 'vigeland - 2 freq vigeland - 1 freq |
VIGELAND |
| Time to execute Levenshtein function - 0.222220 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.376617 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.028865 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.045905 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.001082 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. |