Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
nikkigate (0) - 1 freq kirkgate (3) - 4 freq navigate (3) - 7 freq mitigate (3) - 1 freq nominate (4) - 1 freq withgate (4) - 2 freq imitate (4) - 4 freq nikkis (4) - 1 freq dissipate (4) - 7 freq walligate (4) - 1 freq ingate (4) - 4 freq negate (4) - 2 freq nidebate (4) - 1 freq irritate (4) - 1 freq liquidate (4) - 2 freq castigate (4) - 1 freq wikkit (4) - 5 freq nick-name (4) - 1 freq pikkilt (4) - 1 freq eimitate (4) - 1 freq nitrate (4) - 1 freq likkit (4) - 2 freq nikita (4) - 1 freq nikki (4) - 10 freq nickname (4) - 15 freq |
nikkigate (0) - 1 freq navigate (5) - 7 freq kirkgate (5) - 4 freq pikkit (6) - 1 freq nickit (6) - 4 freq nikki (6) - 10 freq nikita (6) - 1 freq likkit (6) - 2 freq sikkit (6) - 1 freq kikkit (6) - 1 freq nyakkit (6) - 2 freq nokket (6) - 2 freq nikki's (6) - 1 freq pikkilt (6) - 1 freq nikkin (6) - 1 freq rikkit (6) - 3 freq onigate (6) - 1 freq mitigate (6) - 1 freq nikkis (6) - 1 freq negate (6) - 2 freq ingate (6) - 4 freq wikkit (6) - 5 freq wakkint (7) - 1 freq snekkit (7) - 4 freq wakkit (7) - 2 freq |
SoundEx code - N223 newcastle - 24 freq nicest - 6 freq necessitie - 1 freq necessity - 7 freq necessities - 2 freq no-questions - 2 freq newscaster - 1 freq no-sae-kittle - 1 freq necessitats - 1 freq necessitate - 1 freq necessitat - 2 freq newcastle-upo-tyne - 1 freq newcastle-upon-tynne - 1 freq newskesters - 1 freq nguistics - 1 freq neccesities - 1 freq niexecutive - 1 freq nosuchthingasgermsinthe - 1 freq nicestafftho - 1 freq ngist - 2 freq nikkigate - 1 freq newcastle-upon-tyne - 1 freq |
MetaPhone code - NKKT nikkigate - 1 freq |
NIKKIGATE |
Time to execute Levenshtein function - 0.200308 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.393575 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.027699 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.040381 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.000921 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. |