Please enable JavaScript.
Coggle requires JavaScript to display documents.
misspelled word - Coggle Diagram
misspelled word
scenario 4 (mixed up three letters in the word?)
Possible solutions
Solution 1: find the 3 letters that are mixed up then rearrange them till a potential fit is found
Solution 2: using similarity you could file through all the words until a potential fit is found
Solution 3: break the word into groups of 3 and rearrange each groups until a potential fit is found
Feasibility of solution
Solution 1: how would you determine which 3 letters are mixed up,
Solution 3 seems the most viable to preform but will not be considered a scenario
Solution 2: this seems like it will also take a while to compute, also unsure how you would determine similarity in python
Solution 3: this seems simple but would take a long time to compute especially for words that aren't the length of the multiple of 3
scenario 7 (hit a key adjacent on the keyboard to the one they intended?)
Possible solutions
Solution 1: you can go through each letter of the input word and add the letters adjacent to each letter and then delete each letter that was originally in the input word until a fit is found
Solution 2: using similarity you could go through each word in the dictionary and print all the potential fits
Feasibility of Solutions
Solution 1: you would need to determine what is considered adjacent as well as this would be hard to code, this would also take a while to compute especially as you need to go through each letter
Solution 2:this seems like it will also take a while to compute, also unsure how you would determine similarity in python
Solution 1 seems the most viable but won't be considered a scenario
scenario 1 (missed a character out):
Possible solutions
Solution 3: you could go through each letter of the text and add one letter to it either
Solution 2: go through each word in the dictionary and base possible solutions to words that are similar to the input word
feasibility of solutions
Solution 3: this would take a while to compute as well as I am unsure how you would do this
Solution 1 seems the most viable but won't be considered a scenario
Solution 2: this seems like it will also take a while to compute, also unsure how you would determine similarity in python
Solution 1: this seems the easiest to do but in order to do this you would have to list all the rules, and as English is a complex language there are would be a lot of rules
Solution 1: a rule system that looks at words and determine what to add based on rules i.e if it was queen but it was spelt qeen you could have the rule to be after any q a u is added directly after it
scenario 5 (hit the same key twice?):
Possible solutions
Solution 1: find the letters that are the same and then delete one until a potential fit is found
Solution 2: filter through each letter and delete each one and check with the spell check until a potential fit is found
Feasibility of solutions
Solution 1: Easy to understand and code, only would take a long time to compute if the word has a lot of double letters
Solution 3: this seems like it will take a while to compute, also unsure how you would determine similarity in python
Solution 1 seems the most viable to preform and will be considered a scenario
Solution 2: this is also easy to understand and code, but would take longer to compute as you need to go through every single letter
Solution 3: using a similarity system you can filter through all words int he dictionary until a potential fit is found
scenario 3 (swapped two letters around?)
Possible solutions
Solution 1: break the word into numbers and every second word and swap each group of letters until a potential fit is found. Break the word into odd number and reverse each group until a fit is found
Feasibility of solution
Solution 1: this is a simple concept however I am unsure how to code this as well as it would take a while to compute for very long
Solution 2: This is a similar concept but shortens the process by half as it only goes through the input word once, and the concept seems easier to code
Solution 2 seems the most viable to perform and will be one of the scenarios
Solution 2: take the 1st and 2nd letter of a word to make a 3rd letter and swap them round, then print the 1st and 3rd letter and the rest of the word, then you keep doing this until a potential match is found.
scenario 6 (failed to hit the key a second time when typing a double letter?)
Possible solutions
Solution 1: using similarity you could filter through all the words in the dictionary and print all the potential fits
Solution 2: you can go through each letter of the input word and double up each letter and check with the spell check until a fit is found
Feasibility of solutions
Solution 1: this seems like it will take a while to compute, also unsure how you would determine similarity in python
Solution 2 seems the most viable but won't be considered a scenario
Solution 2: easy to understand and seems easy to code, but might take a while to compute especially if the word is long
scenario 2 (included an additional character?)
Possible solutions
Solution 1: delete each letter from the input word and check with spell check
Feasibility of solution
Solution 1:This is probably the easiest to do, it might take a long time to compute if the word is long but for more short and common words it seems very doable
Solution 1 seems the most viable to perform and will be one of the scenarios
Solution 2:this seems like it will take a while to compute, also unsure how you would determine similarity in python
Solution 3; this would take the longest time to make since English is a complex language there are a lot rules which you would have to research
Solution 2:using similarity you could file through all the words from the dictionary and find words similar to the input words and those words could be label as a potential fits
solution 3: using a rule based system you could delete letters that don't match with the rules i.e is the words is happy but is spelt happye it doesn't follow the rule that they shouldn't be an e after the y