Lab9Unit5

docx

School

University of the People *

*We aren’t endorsed by this school

Course

1103

Subject

Computer Science

Date

Jan 9, 2024

Type

docx

Pages

Uploaded by CommodoreBeePerson881

James Johnson Lab 9 Unit 5 December 20th 2023 CS 1103 import java.io.*; import java.util.*; import javax.swing.JFileChooser; public class Dictionary { public static void main(String args[]) throws FileNotFoundException{ try { // Reading the words.txt file. Scanner filein = new Scanner(new File ("words.txt")); // Create new dictionary data structure HashSet<String> hash = new HashSet(); while (filein.hasNext()) { String tk = filein.next(); //Adding words into dictionary from "words.txt" hash.add(tk.toLowerCase()); } Scanner userFile = new Scanner(getInputFileNameFromUser()); userFile.useDelimiter("[^a-zA-Z]+"); while (userFile.hasNext()){ String two = userFile.next(); String two1 = two.toLowerCase(); if(!hash.contains(two1)){ System.out.println(two1 + ":" + corrections(two1, hash)); } } } catch (IOException e) {

System.out.println("File not found - words.txt"); } } //** Stores the variations in a TreeSet, then * Returns the possible variations on the misspelled word. * Since the corrections are stored in a tree set, they are automatically * printed out in alphabetical order with no repeats. * The corrections that the program considers are as follows:* * Delete any one of the letters from the misspelled word. * Change any letter in the misspelled word to any other letter. * Insert any letter at any time in the misspelled word. * Switch any two neighboring characters in the misspelled word. * Insert space at any point in the misspelled word (check that both words that are produced are in the dictionary)// static TreeSet corrections(String badWord, HashSet dictionary){ TreeSet<String> tree = new TreeSet<String>(); //Delete any one of the letters from the misspelled word, then check if exist in the dictionary.// for (int i=0; i<badWord.length(); i++){ String s = badWord.substring(0,i) + badWord.substring(i+1); if(dictionary.contains(s)){ tree.add(s); } } //Change any letter in the misspelled word to any other letter , then check if the word exists in the dictionary.// for (int i=0; i<badWord.length(); i++){ for (char ch = 'a'; ch <= 'z'; ch++) { String s = badWord.substring(0,i) + ch + badWord.substring(i+1); if(dictionary.contains(s)){ tree.add(s); } }

} //Insert any letter at any point in the misspelled word ,then check if the word exists in the dictionary.// for (int i=0; i<=badWord.length(); i++){ for (char ch = 'a'; ch <= 'z'; ch++) { String s = badWord.substring(0,i) + ch + badWord.substring(i); if(dictionary.contains(s)){ tree.add(s); } } } //Change any two neighboring characters in the misspelled word, then check if the word exists in the dictionary.// for(int i=0; i< badWord.length()-1; i++){ String s = badWord.substring(0,i)+ badWord.substring(i+1, i+2) + badWord.substring(i,i+1)+ badWord.substring(i+2); if(dictionary.contains(s)){ tree.add(s); } } //Insert a space at any point in the misspelled word (and check that //both are words that are produced are in the dictionary) for (int i=1; i<badWord.length(); i++){ String stringInput = badWord.substring(0,i) + " " + badWord.substring(i); String tempString = ""; //break a string into tokens and add it to tempWords StringTokenizer tempWords = new StringTokenizer(stringInput); //Loop over all words in tempWords. while(tempWords.hasMoreTokens()){ //Store each word in a temp string String stringWord1 = tempWords.nextToken(); String stringWord2 = tempWords.nextToken(); //Check if temporary words exist in the dictionary otherwise break

Your preview ends here

Eager to read complete document? Join bartleby learn and gain access to the full version

Access to all documents
Unlimited textbook solutions
24/7 expert homework help

if(dictionary.contains(stringWord1) && dictionary.contains(stringWord2)){ tempString = stringWord1 + " " + stringWord2; } else break; tree.add(tempString); } } if(tree.isEmpty()){ tree.add("no suggestions"); } return tree; } //Allow the user select an input file using a standard file selection dialog box. If the user cancels the dialog without selecting a file, the return value is null.// static File getInputFileNameFromUser() { JFileChooser fileDialog = new JFileChooser(); fileDialog.setDialogTitle("Select File for Input"); int option = fileDialog.showOpenDialog(null); if (option != JFileChooser.APPROVE_OPTION) return null; else return fileDialog.getSelectedFile(); } }

Related Documents

SYLLABUS- COMS 2200.docx

SU_NSG6601_W2_A3_Sornoza_S.docx

SU_NSG6601_W4_A2_Sornoza_S.docx

C207 Task 2 Jones.docx

practiceProblems-2.pdf

Module 6_ Logic Model.docx

Analyzing a Network Issue.docx

Homework Balanced Trees (1).docx

Week 8 SAFMEDS Assignment copy.pdf

Week5_SAFMEDS Assignment copy.pdf

Week 8 SAFMEDS Assignment copy.docx

IT-FP2280 Assessment 2.docx

Recommended textbooks for you

EBK JAVA PROGRAMMING

Computer Science

ISBN:9781337671385

Author:FARRELL

Publisher:CENGAGE LEARNING - CONSIGNMENT

C++ Programming: From Problem Analysis to Program...

Computer Science

ISBN:9781337102087

Author:D. S. Malik

Publisher:Cengage Learning

Programming Logic & Design Comprehensive

Computer Science

ISBN:9781337669405

Author:FARRELL

Publisher:Cengage

Microsoft Visual C#

Computer Science

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Cengage Learning,

C++ for Engineers and Scientists

Computer Science

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Course Technology Ptr

Systems Architecture

Computer Science

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Cengage Learning

SEE MORE TEXTBOOKS

Recommended textbooks for you

EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning