| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| re-biggit (0) - 2 freq rebiggit (1) - 2 freq rejiggit (2) - 2 freq rebiggin (2) - 4 freq newbiggit (2) - 1 freq in-biggit (2) - 6 freq re-kinnit (3) - 1 freq weel-biggit (3) - 3 freq hie-liggit (3) - 1 freq erk-biggin (3) - 1 freq air-biggit (3) - 1 freq inbiggit (3) - 7 freq biggit (3) - 245 freq up-biggin (3) - 1 freq resignit (3) - 1 freq 'biggit (3) - 1 freq rebigg (3) - 1 freq riggit (3) - 48 freq upbiggit (3) - 3 freq repintit (4) - 1 freq riggin (4) - 20 freq relievit (4) - 1 freq reunitit (4) - 1 freq baggit (4) - 4 freq bersuggit (4) - 1 freq |
re-biggit (0) - 2 freq rebiggit (2) - 2 freq air-biggit (3) - 1 freq in-biggit (3) - 6 freq rejiggit (4) - 2 freq newbiggit (4) - 1 freq rebiggin (4) - 4 freq up-biggin (5) - 1 freq 'biggit (5) - 1 freq riggit (5) - 48 freq biggit (5) - 245 freq rebigg (5) - 1 freq upbiggit (5) - 3 freq inbiggit (5) - 7 freq hie-liggit (5) - 1 freq weel-biggit (5) - 3 freq erk-biggin (5) - 1 freq a-beggin (6) - 2 freq hauf-biggit (6) - 2 freq raggit (6) - 9 freq baggit (6) - 4 freq boggit (6) - 1 freq one-leggit (6) - 1 freq re-kinnit (6) - 1 freq resignit (6) - 1 freq |
SoundEx code - R123 repositorie - 1 freq refused - 41 freq repost - 1 freq robust - 10 freq ravaged - 2 freq refusit - 6 freq revokit - 1 freq rhapsody - 1 freq refuised - 1 freq reveesitin - 1 freq repast - 1 freq rebukit - 3 freq reveesit - 1 freq rebiggit - 2 freq revisitit - 1 freq refected - 1 freq reveisitit - 1 freq reveisit - 1 freq refaised - 1 freq ripest - 1 freq re-biggit - 2 freq refectory - 1 freq revised - 2 freq re-passed - 1 freq reposeetion - 1 freq revisit - 3 freq revsitied - 1 freq revstu - 1 freq rfjtdh - 1 freq refyoozed - 1 freq raiphsadventcalandur - 1 freq rpxjzttv - 2 freq |
MetaPhone code - RBKT rebukit - 3 freq rebiggit - 2 freq re-biggit - 2 freq |
RE-BIGGIT |
| Time to execute Levenshtein function - 0.247847 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.359471 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.027554 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.038307 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.000946 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. |