Question

In C++ and not Java:

Implement a spelling checker by using a hash table. Assume that the dictionary comes from two sources: an existing large dictionary and a second file containing a personal dictionary. Output all misspelled words and the line numbers on which they occur. Also, for each misspelled word, list any words in the dictionary that are obtainable by applying any of the following rules:

1. Add one character.

2. Remove one character.

3. Exchange adjacent characters

The dictionary file to be used can be found here: use words.txt from https://github.com/dwyl/english-words.

Answer 1

`Hey,

Note: Brother in case of any queries, just comment in box I would be very happy to assist all your queries

#include <iostream> #include <string> #include <fstream> using namespace std; enum errorType { CORRECT, SUB, DEL, INS, TRANS, MANY}; void count( errorType error, int& correct, int& ins, int& del, int& sub, int& trans, int& many ) { switch( error ) { case CORRECT: correct++; break; case INS: ins++; break; case DEL: del++; break; case SUB: sub++; break; case TRANS: trans++; break; case MANY: many++; break; } } // SUBSTITUTION bool isSub( string cw, string bw ) { int i; for( i = 0; i < cw.length(); i++ ) if( cw.at( i ) != bw.at( i ) ) break; return ( cw.substr( i+1 ) == bw.substr( i+1 ) ); } // TRANSPOSITION bool isTrans( string cw, string bw ) { int i; for( i = 0; i < cw.length(); i++ ) if( cw.at( i ) != bw.at( i ) ) break; if( bw.at( i ) == cw.at( i+1 ) && bw.at( i+1 ) == cw.at( i ) ) return ( cw.substr( i+2 ) == bw.substr( i+2 ) ); } // DELETION bool isDel( string cw, string bw ) { int i; for( i = 0; i < cw.length(); i++ ) if( cw.at( i ) != bw.at( i ) ) break; return ( cw.substr( i+1 ) == bw.substr( i ) || cw.substr( 0, cw.length()-1 ) == bw ); } // INSERTION bool isIns( string cw, string bw ) { int i; for( i = 0; i < cw.length(); i++ ) if( cw.at( i ) != bw.at( i ) ) break; return ( cw.substr( i ) == bw.substr( i+1 ) ); } int main() { ifstream fin; errorType error; string cWord, bWord; // SUBSTITUTION, TRANSPOSITION, DELETION, INSERTION int correct, sub, trans, del, ins, many; correct = 0; sub = 0; trans = 0; del = 0; ins = 0; many = 0; char ch; fin.open( "mp5spelling.txt" ); if( !fin ) { cout << "mp5spelling.txt could not be found." << endl; return 1; } // GET FIRST WORD AS CORRECT WORD fin >> cWord; while( !fin.eof() ) { cout << "The correct word is " << cWord << endl; cout << "************************" << endl; // GET NEXT CHARACTER fin.get( ch ); // CHECK IF NEXT CHARACTER IS NOT A NEW LINE while( ch != '\n' ) { // GET NEXT BAD WORD fin >> bWord; cout << bWord << '\t'; // PERFORM ERROR CHECK if( cWord == bWord ) { cout << " No Error" << endl; error = CORRECT; } else if( cWord.length() == bWord.length() ) { // SUBSTITUTION if( isSub( cWord, bWord ) ) { cout << " Substitution Error" << endl; error = SUB; } // TRANSPOSITION else if( isTrans( cWord, bWord ) ) { cout << " Transposition Error" << endl; error = TRANS; } // TOO MANY ERRORS else { cout << " Too many Errors" << endl; error = MANY; } } else { // DELETION if( isDel( cWord, bWord ) ) { cout << " Deletion Error" << endl; error = DEL; } // INSERTION if( isIns( cWord, bWord ) ) { cout << " Insertion Error" << endl; error = INS; } } cout << endl; fin.get( ch ); } cout << "************************" << endl; fin >> cWord; } fin.close(); return 0; }

Kindly revert for any queries

Thanks.