Question

C++ program: can you help create a autocorrect code using the cpp code provided and the words below using pairs, vectors and unordered map:

Objectives

• To practice using C++ std::pair, std::vector, and std::unordered_map
• To tie together what we've learned into the context of a real-world application used by millions of people every day

Instructions

For Full Credit

You're given a short list of words in known_words_short.txt that contains a handful of very different words. Assume this short list of words are all words that exist, so any word that's not in the list is assumed to be misspelled. If you were given a word that is misspelled, the program should output as such. If the misspelled word is close to one of the known words, it should also suggest that word.

For example, if the user types something completely different from any of the known words, such as "asdf", your program should output something like

> "asdf" is misspelled.

However, if "google" is one of the known words, and the user types "goggle", your program should output something like

> "goggle" is misspelled. Did you mean "google"?

Assume the misspelling is wrong in at most 1 of the characters, so words that are missing letters or have extra letters don't need to be considered. Assume the wrong letter can show up anywhere in the word.

known_word_short.txt:

apple
	bitcoin
	computer
	data
	efficient
	file
	google
	hello
	input
	java
	kernel
	latency
	memory
	net
	operator
	print
	query
	return
	stack
	type
	unsigned
	vector
	write
	xerox
	yahoo
	zip

CPP code to use:

#include <fstream>
	#include <iostream>
	#include <unordered_map>
	#include <vector>
	using namespace std;
	vector<string> GetKnownWords(string file_name) {
	vector<string> known_words;
	ifstream words_file(file_name);
	for (string word; getline(words_file, word);) {
	known_words.push_back(word);
	}
	return known_words;
	}
	int main(int argc, char* argv[]) {
	vector<string> known_words = GetKnownWords("known_words_short.txt");
	// TODO: Repeatedly prompt the user for words, and see what the spelling suggestions are.
	// You may use an infinite loop exit the program with ctrl + c, or prompt the user whether
	// they would like to enter more words after each one.
	return 0;
	}

Answer 1

All the explanations is in the code comments. Hope this helps.

Code:

#include <fstream>
#include <iostream>
#include <unordered_map>
#include <vector>

using namespace std;

vector<string> GetKnownWords(string file_name) {
  
vector<string> known_words;
ifstream words_file(file_name);
string word;
  
// read all the words in a loop
while(getline(words_file, word)) {
known_words.push_back(word);
}
  
// return vector of words
return known_words;
}

int main(int argc, char* argv[]) {
  
// call GetKnownWords() to get vetor of words
vector<string> known_words = GetKnownWords("known_words_short.txt");
  
// create an unordered_map for each word
unordered_map<string, int> map;
for(int i=0; i<known_words.size(); i++) {
map.insert(make_pair(known_words[i], 1));
}
  
// to store correct spellings corresponding to misspellings
// update it whenever a misspelled word is found
vector<pair<string, string>> misspellings;
  
string word;
// Use an infinite loop and exit the program with ctrl + c
while(true) {
  
cout << "Enter a word: ";
cin >> word;
  
// cout << map.find(word) << endl;
if(map.find(word) == map.end())
{
int flag = 0;
cout << "\"" << word << "\" is misspelled.";
  
// first check in the misspellings vector
for(int i=0; i<misspellings.size(); i++)
{
if(misspellings[i].first == word)
{
flag = 1;
cout << " Did you mean \"" << misspellings[i].second << "\"?\n";
break;
}
}
  
if(flag != 1)
{
// now search for similar words in known_words
for(int i=0; i<known_words.size(); i++)
{
// skip if length does not match
if(word.size() != known_words[i].size())
continue;
  
int count = 0;
for(int j=0; known_words[i][j]!='\0'; j++)
{
// skip if characters match
if(word[j] == known_words[i][j])
continue;
  
// increase count of different character by 1
count++;
  
// if different characters are more than 1
// then word is not similar
if(count > 1)
break;
}
// if only one character is different
if(count == 1)
{
// add it to the misspellings vector
misspellings.push_back(make_pair(word, known_words[i]));
  
// also print the output
cout << " Did you mean \"" << known_words[i] << "\"?";
break;
}
}
cout << endl;
}
}
else // correctly spelled words are found in map
{
cout << "\"" << word << "\" is spelled correctly" << endl;
}
}
  
return 0;
}

Sample run:

Code screenshots: