The aim is to make a self sufficient application that can detect errors and suggest with precision
A spell checker is needed because, if the search query is spelled wrong, there will be no pertinent results found. Searching a database for an unrelated topic will not return useful results. We can help the user include useful search terms. The spell checker that is currently used with string matching also has many problems. First, it does not detect if two letters in the search query are switched. It would detect a switch of two letters as two errors, and not one. Also, the spelling suggestions it gives are less than stellar. For instance, the search “appel” and the best match it found was “appear,” and not “apple.” This best match is a verb, which would not be searched on much. The current spell checker also does not take similar sounding syllables into account when searching for a good match.
LIMITATION of Predictive Spell Checker only checks the spelling of the query, it does actually provide any searching functionality. It does not provide any functionality for the actual searching, and only helps the user type what they mean to type. Also, algorithm cannot be perfect because a computer can never know what a user is thinking. Biggest constraint is computational time. I might not have enough time to complete a professional grade spell checker. This time constraint poses as a larger problem, the more I create intermediate algorithms, such as the string matching algorithms. This spell checker will be implemented only to provide one word of text in the actual search engine asking if the user meant another search term.
...----....
..-:"'' ''"-..
.-' '-.
.' . . '.
.' . . . . .''.
.' . . . . . . . ..:.
.' . . . . . . .. . . ....::.
.. . . . . . . .. . ....:IA.
.: . . . . . . .. . .. .. ....:IA.
.: . . .. . . . . .. . ... ....:.:VHA.
'.. . .. . . . . .. . .. . .....:.::IHHB.
.:. . . . . . . . . . . ...:.:... .......:HIHMM.
.:.... . . ."::"'.. . . . .:.:.:II;,. .. ..:IHIMMA
':.:.. ..::IHHHHHI::. . . ...:.::::.,,,. . ....VIMMHM
.:::I. .AHHHHHHHHHHAI::. .:...,:IIHHHHHHMMMHHL:. . VMMMM
.:.:V.:IVHHHHHHHMHMHHH::..:" .:HIHHHHHHHHHHHHHMHHA. .VMMM.
:..V.:IVHHHHHMMHHHHHHHB... . .:VPHHMHHHMMHHHHHHHHHAI.:VMMI
::V..:VIHHHHHHMMMHHHHHH. . .I":IIMHHMMHHHHHHHHHHHAPI:WMM
::". .:.HHHHHHHHMMHHHHHI. . .:..I:MHMMHHHHHHHHHMHV:':H:WM
:: . :.::IIHHHHHHMMHHHHV .ABA.:.:IMHMHMMMHMHHHHV:'. .IHWW
'. ..:..:.:IHHHHHMMHV" .AVMHMA.:.'VHMMMMHHHHHV:' . :IHWV
:. .:...:".:.:TPP" .AVMMHMMA.:. "VMMHHHP.:... .. :IVAI
.:. '... .:"' . ..HMMMHMMMA::. ."VHHI:::.... .:IHW'
... . . ..:IIPPIH: ..HMMMI.MMMV:I:. .:ILLH:.. ...:I:IM
: . .'"' .:.V". .. . :HMMM:IMMMI::I. ..:HHIIPPHI::'.P:HM.
:. . . .. ..:.. . :AMMM IMMMM..:...:IV":T::I::.".:IHIMA
'V:.. .. . .. . . . 'VMMV..VMMV :....:V:.:..:....::IHHHMH
"IHH:.II:.. .:. . . . . " :HB"" . . ..PI:.::.:::..:IHHMMV"
:IP""HHII:. . . . . .'V:. . . ..:IH:.:.::IHIHHMMMMM"
:V:. VIMA:I.. . . . .. . . .:.I:I:..:IHHHHMMHHMMM
:"VI:.VWMA::. .: . .. .:. ..:.I::.:IVHHHMMMHMMMMI
:."VIIHHMMA:. . . .: .:.. . .:.II:I:AMMMMMMHMMMMMI
:..VIHIHMMMI...::.,:.,:!"I:!"I!"I!"V:AI:VAMMMMMMHMMMMMM'
':.:HIHIMHHA:"!!"I.:AXXXVVXXXXXXXA:."HPHIMMMMHHMHMMMMMV
V:H:I:MA:W'I :AXXXIXII:IIIISSSSSSXXA.I.VMMMHMHMMMMMM
'I::IVA ASSSSXSSSSBBSBMBSSSSSSBBMMMBS.VVMMHIMM'"'
I:: VPAIMSSSSSSSSSBSSSMMBSSSBBMMMMXXI:MMHIMMI
.I::. "H:XIIXBBMMMMMMMMMMMMMMMMMBXIXXMMPHIIMM'
:::I. ':XSSXXIIIIXSSBMBSSXXXIIIXXSMMAMI:.IMM
:::I:. .VSSSSSISISISSSBII:ISSSSBMMB:MI:..:MM
::.I:. ':"SSSSSSSISISSXIIXSSSSBMMB:AHI:..MMM.
::.I:. . ..:"BBSSSSSSSSSSSSBBBMMMB:AHHI::.HMMI
:..::. . ..::":BBBBBSSBBBMMMB:MMMMHHII::IHHMI
':.I:... ....:IHHHHHMMMMMMMMMMMMMMMHHIIIIHMMV"
"V:. ..:...:.IHHHMMMMMMMMMMMMMMMMHHHMHHMHP'
':. .:::.:.::III::IHHHHMMMMMHMHMMHHHHM"
"::....::.:::..:..::IIIIIHHHHMMMHHMV"
"::.::.. .. . ...:::IIHHMMMMHMV"
"V::... . .I::IHHMMV"'
'"VHVHHHAHHHHMMV:"'