| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ngaeki (0) - 1 freq laek' (3) - 1 freq gael (3) - 2 freq gaem (3) - 1 freq gki (3) - 1 freq gai (3) - 1 freq vgahi (3) - 1 freq taekit (3) - 4 freq gaets (3) - 4 freq laeks (3) - 18 freq gaey (3) - 1 freq taeks (3) - 1 freq gaet (3) - 22 freq ongaens (3) - 2 freq gaskin (3) - 1 freq gaskit (3) - 1 freq nekid (3) - 1 freq nyaakit (3) - 4 freq haekin (3) - 1 freq agae (3) - 2 freq brakki (3) - 1 freq naet (3) - 3 freq ngugi (3) - 2 freq spaek' (3) - 1 freq gaen' (3) - 1 freq |
ngaeki (0) - 1 freq geeky (4) - 2 freq noak (4) - 3 freq ongaein (4) - 4 freq ngugi (4) - 2 freq niki (4) - 1 freq ingaed (4) - 5 freq nikki (4) - 10 freq unlaek (4) - 3 freq nak (4) - 1 freq neek (4) - 1 freq nagasaki (4) - 1 freq geek (4) - 3 freq ongaed (4) - 2 freq nark (4) - 1 freq neglek (4) - 2 freq gki (4) - 1 freq ingaen (4) - 1 freq nek (4) - 2 freq narky (4) - 1 freq intake (5) - 4 freq ungat (5) - 1 freq naigs (5) - 3 freq engage (5) - 40 freq nck (5) - 1 freq |
SoundEx code - N220 noses - 20 freq noises - 33 freq noxious - 2 freq nice-guy - 1 freq nieces - 4 freq nukes - 2 freq nessie's - 1 freq na-says - 3 freq neesick - 1 freq niches - 1 freq nazis - 3 freq nickie's - 1 freq niseach - 1 freq nashous - 1 freq neice's - 1 freq ngugi - 2 freq nikies - 1 freq nice's - 2 freq neesik - 2 freq nazis' - 1 freq naxos - 2 freq nauseous - 1 freq nazis - 1 freq nachos - 1 freq nngakh - 1 freq naequeues - 1 freq ngaeki - 1 freq nghs - 1 freq ncis - 4 freq neiges - 1 freq nicus - 1 freq nikki's - 1 freq nhxgas - 1 freq njesi - 1 freq neesiks- - 1 freq neesiks - 1 freq nizjex - 1 freq nkazxz - 1 freq nzyk - 1 freq nikkis - 1 freq neesicks - 1 freq |
MetaPhone code - NKK nngakh - 1 freq ngaeki - 1 freq |
NGAEKI |
| Time to execute Levenshtein function - 0.219600 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.367651 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.031821 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.042488 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.000938 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. |