| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| joaker (0) - 1 freq jouker (1) - 2 freq joakey (1) - 1 freq joker (1) - 7 freq joak's (2) - 1 freq joiner (2) - 14 freq jake (2) - 71 freq locker (2) - 3 freq jooked (2) - 8 freq jokers (2) - 2 freq soaked (2) - 11 freq teaker (2) - 1 freq maaker (2) - 1 freq shaker (2) - 1 freq boaked (2) - 3 freq yorker (2) - 1 freq joked (2) - 11 freq hoker (2) - 1 freq joke (2) - 145 freq taaker (2) - 1 freq jockey (2) - 3 freq poker (2) - 22 freq weaker (2) - 4 freq joke' (2) - 1 freq cooker (2) - 21 freq |
joaker (0) - 1 freq jouker (1) - 2 freq joker (1) - 7 freq joakey (2) - 1 freq sooker (3) - 2 freq raker (3) - 2 freq toker (3) - 1 freq jakey (3) - 6 freq jokes (3) - 50 freq joyner (3) - 1 freq hooker (3) - 4 freq faker (3) - 3 freq jooder (3) - 1 freq jinker (3) - 2 freq jakes (3) - 3 freq beaker (3) - 7 freq japer (3) - 1 freq joukerie (3) - 3 freq jouked (3) - 23 freq looker (3) - 8 freq maker (3) - 18 freq cooker (3) - 21 freq waaker (3) - 1 freq joak (3) - 1 freq joke' (3) - 1 freq |
SoundEx code - J260 joukerie - 3 freq juicier - 1 freq jouker - 2 freq jagger - 2 freq joker - 7 freq joaker - 1 freq joukery- - 1 freq jaguar - 2 freq jagwar - 1 freq jogger - 1 freq jazzer - 1 freq juicer - 1 freq jigger' - 1 freq jigger - 1 freq |
MetaPhone code - JKR joukerie - 3 freq hjckrrh - 5 freq jckrrh - 1 freq jouker - 2 freq jagger - 2 freq joker - 7 freq joaker - 1 freq joukery- - 1 freq jaguar - 2 freq jogger - 1 freq geggery - 1 freq geekery - 1 freq jigger' - 1 freq jigger - 1 freq |
JOAKER |
| Time to execute Levenshtein function - 0.319440 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.486957 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.035963 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.046682 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.001150 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. |