| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jarvie (0) - 5 freq arvie (1) - 1 freq garvie (1) - 1 freq harvie (1) - 3 freq javvie (1) - 1 freq sarvin (2) - 22 freq marnie (2) - 3 freq jassie (2) - 3 freq jamie (2) - 118 freq marie (2) - 212 freq darkie (2) - 2 freq markie (2) - 2 freq jackie (2) - 38 freq jargle (2) - 1 freq sarve (2) - 10 freq jirvine (2) - 4 freq carsie (2) - 1 freq parrie (2) - 4 freq jaanie (2) - 1 freq jadie (2) - 4 freq jaurie (2) - 1 freq jardine (2) - 29 freq lavvie (2) - 18 freq barbie (2) - 3 freq caavie (2) - 2 freq |
jarvie (0) - 5 freq jarv (2) - 15 freq harvie (2) - 3 freq javvie (2) - 1 freq garvie (2) - 1 freq arvie (2) - 1 freq jirvine (3) - 4 freq sarve (3) - 10 freq carve (3) - 5 freq jorvik (3) - 1 freq jaurie (3) - 1 freq jervis (3) - 1 freq jerrie (3) - 5 freq larvae (3) - 1 freq joris (4) - 1 freq warie (4) - 1 freq warkie (4) - 1 freq juve (4) - 2 freq warlie (4) - 2 freq provie (4) - 2 freq jxauvi (4) - 1 freq cairve (4) - 1 freq jars (4) - 21 freq tarrie (4) - 2 freq davie (4) - 229 freq |
SoundEx code - J610 jarvie - 5 freq jrb - 3 freq jarv - 15 freq |
MetaPhone code - JRF giraffe - 12 freq jarvie - 5 freq geraff - 1 freq jarv - 15 freq |
JARVIE |
| Time to execute Levenshtein function - 0.218874 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.359913 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.035296 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.043164 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.000932 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. |