Homework Help Question & Answers

Write a French/English dictionary lookup program. Read a list of pairs of English and French words...

Write a French/English dictionary lookup program. Read a list of pairs of English and French words from a file specified by the user. English/French words should be exact matches (don't try to find partial matches).
Use the supplied EnglishFrenchDictionary.java class as your main class. Fill in the missing code in the DictionaryTable.java class to read the input file and perform the searches.
Add code to the DictionaryTable read() method to:

read pairs of lines (English word is on the first line, and the corresponding French word is on the second line), and for each pair of lines:

create an Item object for the English word and French word to store in the byEnglish array list

create an Item object for the French word and corresponding English word to store in the byFrench array list.

After reading all the words, sort the byEnglish and byFrench array lists so we can use binary search on them.

Add code to the DictionaryTable’s findFrench() method to:

Create an Item object with the specified English word and null for the French word (because we don’t know it yet)

Use the Collections.binarySearch() method to search for the matching Item in the byEnglish array list

If a matching Item is found, return the item’s value which is the corresponding French word (hint: use getValue()).

Add similar code to the DictionaryTable’s findEndlish() method to:

Create an Item object with the specified French word and null for the English word (because we don’t know it yet)

Use the Collections.binarySearch() method to search for the matching Item in the byFrench array list

If a matching Item is found, return the item’s value which is the corresponding English word (hint: use getValue()).


Two files have been supplied for testing your program: shortdictionary.txt and longdictionary.txt. shortdictionary.txt has just a few words in it for quick testing, and longdictionary.txt has over 500 entries for more extensive testing. The files have the format of an English word on one line, followed by the French word on the next line:

eight

huit

Amazon

amazone

april

avril

Arctic

arctique

British

britannique

. . .

A sample run of the program:

Enter the name of the dictionary file:

shortdictionary.txt

Lookup by E)nglish word, F)rench word, Q)uit?

F

Enter French word:

huit

English word: eight

Lookup by E)nglish word, F)rench word, Q)uit?

E

Enter English word:

eight

French word: huit

Lookup by E)nglish word, F)rench word, Q)uit?

Java Files Needed:

DictionaryTable:

package Homework6;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

/**
A table for lookups and reverse lookups
*/
public class DictionaryTable
{
private ArrayList<Item> byEnglish;
private ArrayList<Item> byFrench;

/**
Constructs a DictionaryTable object.
*/
public DictionaryTable()
{
byEnglish = new ArrayList<Item>();
byFrench = new ArrayList<Item>();
}

/**
Reads English and French word pairs from the Scanner
and adds them to the byEnglish and byFrench array lists.
@param in -- Scanner for reading the input
*/
public void read(Scanner in)
{
   // TODO:
   // Read pairs of lines - English word on one line and French on the next - until
   // no more lines are in the input file.
   // Create new Item object from the English - French word and add to byEnglish list.
   // Create new Item object from the French - English word and add to byFrench list.

   // When finished, be sure to sort the byEnglish and byFrench lists!

}

/**
Looks up an item in the table.
@param english the key to find
@return the value with the given key, or "Not Found" if no
such item was found.
*/
public String findFrench(String english)
{
   // TODO: Search the byEnglish array list for an Item with a matching english word,
   // and returns its value.

   // This is the default result:
   return "Not Found";
}

/**
Looks up an item in the table.
@param french the value to find
@return the key with the given value, or "Not Found" if no
such item was found.
*/
public String findEnglish(String french)
{
   // TODO: Search the byFrench array list for an Item with a matching french word,
   // and returns its value.


   // This is the default result:
   return "Not Found";
}
}

EnglishFrenchDictionary:

package Homework6;
import java.io.IOException;
import java.io.FileReader;
import java.util.Scanner;

/* The input file has the format of English word on one line
* followed by French word on the next line. The pairs continue
* until the end of the file.
*/
public class EnglishFrenchDictionary
{
public static void main(String[] args) throws IOException
{
Scanner in = new Scanner(System.in);
System.out.println("Enter the name of the dictionary file: ");
String fileName = in.nextLine();

DictionaryTable table = new DictionaryTable();
FileReader reader = new FileReader(fileName);
table.read(new Scanner(reader));
  
boolean more = true;
while (more)
{
System.out.println("Lookup by E)nglish word, F)rench word, Q)uit?");
String cmd = in.nextLine();

if (cmd.equalsIgnoreCase("Q"))
more = false;
else if (cmd.equalsIgnoreCase("E"))
{
System.out.println("Enter English word:");
String n = in.nextLine();
System.out.println("French word: " + table.findFrench(n));
}
else if (cmd.equalsIgnoreCase("F"))
{
System.out.println("Enter French word:");
String n = in.nextLine();
System.out.println("English word: " + table.findEnglish(n));
}
}
}
}

Item:

package Homework6;
/**
An item with a key and a value.
*/
public class Item implements Comparable<Item>
{
private String key;
private String value;

/**
Constructs an Item object.
@param k the key string
@param v the value of the item
*/
public Item(String k, String v)
{
key = k;
value = v;
}

/**
Gets the key.
@return the key
*/
public String getKey()
{
return key;
}

/**
Gets the value.
@return the value
*/
public String getValue()
{
return value;
}

public int compareTo(Item otherObject)
{
Item other = (Item) otherObject;
return key.compareTo(other.key);
}
}

Two Files Associated With Program:

longdictionary:

eight
huit
Amazon
amazone
april
avril
Arctic
arctique
British
britannique
Cinderella
Cendrillon
Denmark
Danemark
Englishman
Anglais
Germany
Allemagne
India
Inde
Ireland
Irlande
Italy
Italie
January
janvier
July
juillet
June
juin
London
Londres
Mexico
Mexique
Miss
demoiselle
Mister
monsieur
North
nord
Pacific
Pacifique
Saturday
samedi
September
septembre
Spain
Espagne
Sunday
dimanche
Thursday
jeudi
Tuesday
mardi
Wednesday
mercredi
abdicate
abdiquer
aberration
erreur
ablaze
ardant
abscissa
abscisse
absolve
absoudre
abstinence
abstention
accept
accepter
acceptance
abord
accidental
accidentel
accompany
accompagner
accuracy
exactitude
acrobat
acrobate
actor
acteur
actress
actrice
adjective
adjectif
affluence
richesse
agoraphobia
agoraphobie
allergy
allergie
analysis
analyse
analyst
analyste
ancient
antique
and
et
angel
ange
anguish
angoisse
ankle
cheville
anniversary
anniversaire
annotation
note
announce
annoncer
annual
annuel
antelope
antilope
antibiotic
antibiotique
apiary
rucher
apple
pomme
apricot
abricot
architect
architecte
astronaut
astronaute
atom
atome
atomic
atomique
attractive
affriolant
authorize
autoriser
aware
conscient
away
loin
awkward
maladroit
bacon
lard
baker
boulanger
bakery
boulangerie
banker
banquier
barley
orge
beard
barbe
bee
abeille
believe
croire
beverage
boisson
bird
oiseau
blanket
couverture
boat
barque
bronze
airain
bucket
seau
cabbage
chou
cabinet
armoire
candidate
candidat
candle
bougie
carpet
tapis
caution
alerter
cautious
prudent
ceiling
plafond
cellar
cave
cheese
fromage
cherry
cerise
chocolate
chocolat
cider
cidre
cigar
cigare
coal
charbon
community
commune
commute
aiguiller
companion
accompagnateur
competition
concours
complexion
teint
conceited
frivole
conceive
concevoir
conflict
conflit
connection
ligue
costume
complet
cougar
puma
countryside
campagne
courage
abattage
cow
vache
crawl
ramper
dad
papa
daughter
fille
deaf
sourd
deal
dispenser
death
mort
debt
dette
deep
profond
deer
cerf
delicious
savoureux
deliver
fournir
dentist
dentiste
dictionary
dictionnaire
difficult
difficile
dog
chien
dolphin
dauphin
door
porte
downstairs
dessous
drip
goutte
driver
chauffeur
eagle
aigle
election
choix
enemy
ennemi
engrave
graver
expect
attendre
fabric
textile
family
famille
feast
banqueter
feather
plume
fight
batailler
filter
filtrer
five
cinq
fog
brouillard
forest
bois
forget
oublier
forgive
excuser
fork
fourchette
forty
quarante
four
quatre
fourteen
quatorze
fox
renard
fresh
frais
garden
jardin
glove
gant
golf
golfe
guest
convive
guilty
coupable
handkerchief
mouchoir
handlebars
gouvernail
handsome
beau
heavy
lourd
home
domicile
house
maison
identical
identique
imposter
charlatan
include
contenir
inconvenient
difficile
incredible
invraisemblable
index
liste
infant
enfant
integer
entier
interrupt
interrompre
interval
intervalle
interview
entrevue
jacket
veste
jewel
bijou
kettle
chaudron
keyboard
clavier
kingdom
royaume
kitchen
cuisine
laboratory
laboratoire
lake
lac
large
grand
lawyer
avocat
learn
apprendre
lemon
citron
lettuce
laitue
life
vie
loaf
pain
magician
sorcier
management
administration
manure
engrais
massage
masser
massive
massif
matrimony
mariage
mattress
matelas
mild
doux
mint
menthe
money
argent
month
mois
moon
lune
morning
matin
mountain
mont
music
musique
name
nom
nephew
neveu
nine
neuf
nitrogen
azote
no
non
north
nord
odor
odeur
oil
huile
open
ouvrir
orchestra
orchestre
ordinary
ordinaire
owl
chouette
pain
douleur
paradox
paradoxe
parrot
perroquet
patrolman
gendarme
peanut
arachide
pear
poire
pencil
crayon
perfect
accompli
permanent
continuel
permission
autorisation
physician
docteur
plastic
plastique
pocket
poche
policy
politique
polite
courtois
prepay
affranchir
prescription
recette
previously
auparavant
price
prix
printer
imprimeur
proof
preuve
proud
altier
pull
tirer
purple
pourpre
quickly
rapidement
quietly
paisiblement
quilt
coudre
radish
radis
radius
rayon
rapid
prompt
raspberry
framboise
raw
brut
reach
aboutir
recipe
recette
recommend
recommander
referee
arbitre
regal
royal
rent
loyer
request
demander
rescue
sauver
reverse
inverse
rhythm
rythme
ribbon
ruban
rigid
raide
rinse
rincer
riot
bagarre
river
fleuve
rope
corde
salary
appointements
salmon
saumon
scar
balafre
scissors
ciseaux
screwdriver
tournevis
search
recherche
season
saison
secret
arcane
sell
vendre
send
adresser
seven
sept
shallow
superficiel
shirt
chemise
shore
bord
sick
malade
silent
silencieux
sixteen
seize
sixty
soixante
sky
ciel
slow
lent
small
petit
soldier
soldat
sort
acabit
space
espace
sparrow
moineau
speak
parler
split
fendre
springtime
printemps
spy
espion
stain
salir
standard
drapeau
statute
statut
steak
bifteck
steel
acier
stomach
estomac
stone
pierre
strawberry
fraise
street
rue
strong
fort
sturdy
robuste
succeed
abouter
sugar
sucre
swan
cygne
swine
cochon
syrup
sirop
talent
aptitude
ten
dix
thirteen
treize
thirty
trente
three
trois
threshold
seuil
tickle
chatouiller
tiger
tigre
tile
carreau
tiny
miniscule
today
aujourd'hui
tomato
tomate
tomorrow
demain
tooth
dent
topical
actuel
towel
serviette
treasure
cassette
tree
arbre
trip
voyage
tuna
thon
turkey
dindon
twelve
douze
twenty
vingt
twin
jumeau
uncle
oncle
understand
comprendre
unhappy
malheureux
unimportant
mineur
unintelligible
abracadabrant
universe
univers
unkind
maussade
unlock
ouvrir
upstairs
dessus
vehicle
bagnole
verb
verbe
very
bien
vinegar
vinaigre
visitor
visiteur
vocabulary
dictionnaire
voice
voix
vowel
voyelle
waist
taille
wash
laver
we
nous
weapon
arme
weather
temps
week
semaine
whale
baleine
wheat
froment
wheel
roue
wine
vin
wire
fil
wireless
radio
wolf
loup
woman
femme
wonderful
merveilleux
wood
bois
word
mot
worker
ouvrier
world
monde
writer
auteur
yellow
jaune
yes
oui

shortdictionary:

twelve
douze
twenty
vingt
ten
dix
thirteen
treize
thirty
trente
three
trois
four
quatre
fourteen
quatorze
five
cinq
sixteen
seize
sixty
soixante
seven
sept
nine
neuf
eight
huit

0 0
Add a comment
Answer #1

Please find program with working test case and sample output screenshot.

//DictionaryTable.java
package Homework6;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

/**
A table for lookups and reverse lookups
*/
public class DictionaryTable
{
private ArrayList<Item> byEnglish;
private ArrayList<Item> byFrench;

/**
Constructs a DictionaryTable object.
*/
public DictionaryTable()
{
byEnglish = new ArrayList<Item>();
byFrench = new ArrayList<Item>();
}

/**
Reads English and French word pairs from the Scanner
and adds them to the byEnglish and byFrench array lists.
@param in -- Scanner for reading the input
*/
public void read(Scanner in)
{
    // TODO:
    // Read pairs of lines - English word on one line and French on the next - until
    // no more lines are in the input file.
    // Create new Item object from the English - French word and add to byEnglish list.
    // Create new Item object from the French - English word and add to byFrench list.

   // When finished, be sure to sort the byEnglish and byFrench lists!
  
   while(in.hasNext()){
     String english = in.nextLine().trim();
     String french = in.nextLine().trim();
     Item englishItem = new Item(english, french);
     byEnglish.add(englishItem);
     Item frenchItem = new Item(french, english);
     byFrench.add(frenchItem);
    
    
     Collections.sort(byEnglish);
     Collections.sort(byFrench);
   }

}

/**
Looks up an item in the table.
@param english the key to find
@return the value with the given key, or "Not Found" if no
such item was found.
*/
public String findFrench(String english)
{
    // TODO: Search the byEnglish array list for an Item with a matching english word,
    // and returns its value.
  
   Item key = new Item(english, null);
   String value = byEnglish.get(Collections.binarySearch(byEnglish, key)).getValue();

   // This is the default result:
    return value!=null ? value:"Not Found";
}

/**
Looks up an item in the table.
@param french the value to find
@return the key with the given value, or "Not Found" if no
such item was found.
*/
public String findEnglish(String french)
{
    // TODO: Search the byFrench array list for an Item with a matching french word,
    // and returns its value.
   Item key = new Item(french, null);
   int index = Collections.binarySearch(byFrench, key);
   String value = byFrench.get(Collections.binarySearch(byFrench, key)).getValue();

    // This is the default result:
   return value!=null ? value:"Not Found";
}
}

//EnglishFrenchDictionary.java
package Homework6;
import java.io.IOException;
import java.io.FileReader;
import java.util.Scanner;

/* The input file has the format of English word on one line
* followed by French word on the next line. The pairs continue
* until the end of the file.
*/
public class EnglishFrenchDictionary
{
public static void main(String[] args) throws IOException
{
Scanner in = new Scanner(System.in);
System.out.println("Enter the name of the dictionary file: ");
String fileName = in.nextLine();

DictionaryTable table = new DictionaryTable();
FileReader reader = new FileReader(fileName);
table.read(new Scanner(reader));
  
boolean more = true;
while (more)
{
System.out.println("Lookup by E)nglish word, F)rench word, Q)uit?");
String cmd = in.nextLine();

if (cmd.equalsIgnoreCase("Q"))
more = false;
else if (cmd.equalsIgnoreCase("E"))
{
System.out.println("Enter English word:");
String n = in.nextLine();
System.out.println("French word: " + table.findFrench(n));
}
else if (cmd.equalsIgnoreCase("F"))
{
System.out.println("Enter French word:");
String n = in.nextLine();
System.out.println("English word: " + table.findEnglish(n));
}
}
}
}

// Item.java
package Homework6;
/**
An item with a key and a value.
*/
public class Item implements Comparable<Item>
{
private String key;
private String value;

/**
Constructs an Item object.
@param k the key string
@param v the value of the item
*/
public Item(String k, String v)
{
key = k;
value = v;
}

/**
Gets the key.
@return the key
*/
public String getKey()
{
return key;
}

/**
Gets the value.
@return the value
*/
public String getValue()
{
return value;
}

public int compareTo(Item otherObject)
{
Item other = (Item) otherObject;
return key.compareTo(other.key);
}
}

SelfDev-Debug-test src/main/java/Homework6/EnglishFrenchDictionary java-Eclipse File Edit Source Refactor Navigate Search Pro

Add a comment
Know the answer?
Add Answer to:
Write a French/English dictionary lookup program. Read a list of pairs of English and French words...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coin

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Modification of original code so it can include 1) at least one array 2)*New English words...

    Modification of original code so it can include 1) at least one array 2)*New English words that are written/saved to the .txt file(s) must be in alphabetical order* (e.g, Apple cannot be in a lower line than Orange). This is what I'm really struggling with as I don't know how to organize alphabetically only the english word translation without the spanish equivalent word also getting organized. The only idea I have right now is to recreate the code using two...

  • write a program which include a class containing an array of words (strings).The program will search...

    write a program which include a class containing an array of words (strings).The program will search the array for a specific word. if it finds the word:it will return a true value.if the array does not contain the word. it will return a false value. enhancements: make the array off words dynamic, so that the use is prompter to enter the list of words. make the word searcher for dynamic, so that a different word can be searched for each...

  • Write a program that can read XML files for customer accounts receivable, such as <ar>        <customerAccounts>...

    Write a program that can read XML files for customer accounts receivable, such as <ar>        <customerAccounts>               <customerAccount>                       <name>Apple County Grocery</name>                       <accountNumber>1001</accountNumber>                       <balance>1565.99</balance>               </customerAccount>               <customerAccount>                       <name>Uptown Grill</name>                       <accountNumber>1002</accountNumber>                       <balance>875.20</balance>               </customerAccount>        </customerAccounts>        <transactions>               <payment>                       <accountNumber>1002</accountNumber>                       <amount>875.20</amount>               </payment>               <purchase>                       <accountNumber>1002</accountNumber>                       <amount>400.00</amount>               </purchase>               <purchase>                       <accountNumber>1001</accountNumber>                       <amount>99.99</amount>               </purchase>               <payment>                       <accountNumber>1001</accountNumber>                       <amount>1465.98</amount>               </payment>        </transactions>     </ar> Your program should construct an CustomerAccountsParser object, parse the XML data & create new CustomerAccount objects in the CustomerAccountsParser for each of the products the XML data, execute all of...

  • Starting out with Java 1st chapter 16 problem 6

    This program is suppose to take in names.txt file save it to an array. Use quicksort to sort the names in ascending order. then allow the user to search for a name inthe array using binary search. But my program compiles but doesnt actual do anything HELP!//names.txtMARYPATRICIALINDABARBARAELIZABETHJENNIFERMARIASUSANMARGARETDOROTHYLISANANCYKARENBETTYHELENSANDRADONNACAROLRUTHSHARONMICHELLELAURASARAHKIMBERLYDEBORAHJESSICASHIRLEYCYNTHIAANGELAMELISSABRENDAAMYANNAREBECCAVIRGINIAKATHLEENPAMELAMARTHADEBRAAMANDASTEPHANIECAROLYNCHRISTINEMARIEJANETCATHERINEFRANCESANNJOYCEDIANEALICEJULIEHEATHERTERESADORISGLORIAEVELYNJEANCHERYLMILDREDKATHERINEJOANASHLEYJUDITHROSE/** QUICKSORT SEARCH PROGRAM*//*The QuickSort class provides a public staticmethod for performing a QuickSort on a string array.*/public class QuickSort{/*The quickSort method calls the qSort methodto sort a string [email protected] array The array to...

  • Trying to practice this assignment Argument list: the *yahoonews.txt Data file: yahoonews.txt Wr...

    Trying to practice this assignment Argument list: the *yahoonews.txt Data file: yahoonews.txt Write a program named WordCount.java, in this program, implement two static methods as specified below: public static int countWord(Sting word, String str) this method counts the number of occurrence of the word in the String (str) public static int countWord(String word, File file) This method counts the number of occurrence of the word in the file. Ignore case in the word. Possible punctuation and symbals in the file...

  • Java File

    In JavaCreate a file using any word processing program or text editor.Write an application that displays the file's name, containingfolder size and time of last modification.Save as FileStatisticsThis is what I have with errors, am i going down the right path?Thanks<code>import java.nio.file.*;import java.io.*;import java.nio.file.attribute.*;import java.util.Scanner;public class FileStatistics{private static Object Attributes;public static void main(String[] args){Scanner kb = new Scanner(System.in);String filename;System.out.print("Enter name of file to use>>");filename = kb.nextLine();String fileName = "C:\Java\FileStatistics.txt";Path file = Paths.get(fileName);Paths.get("C:\Java\FileStatistics.txt");String s = "ABCDF";byte[] data = s.getBytes();OutputStream output =...

  • I am currently using eclipse to write in java. A snapshot of the output would be...

    I am currently using eclipse to write in java. A snapshot of the output would be greatly appreciated to verify that the program is indeed working. Thanks in advance for both your time and effort. Here is the previous exercise code: /////////////////////////////////////////////////////Main /******************************************* * Week 5 lab - exercise 1 and exercise 2: * * ArrayList class with search algorithms * ********************************************/ import java.util.*; /** * Class to test sequential search, sorted search, and binary search algorithms * implemented in...

  • I need to write a program in java that reads a text file with a list...

    I need to write a program in java that reads a text file with a list of numbers and sorts them from least to greatest. This is the starter file. import java.util.*; import java.io.*; public class Lab3 { static final int INITIAL_CAPACITY = 5; public static void main( String args[] ) throws Exception { // ALWAYS TEST FOR REQUIRED INPUT FILE NAME ON THE COMMAND LINE if (args.length < 1 ) { System.out.println("\nusage: C:\\> java Lab3 L3input.txt\n"); System.exit(0); } //...

  • Summary You will write an application to build a tree structure called Trie for a dictionary...

    Summary You will write an application to build a tree structure called Trie for a dictionary of English words, and use the Trie to generate completion lists for string searches. Trie Structure A Trie is a general tree, in that each node can have any number of children. It is used to store a dictionary (list) of words that can be searched on, in a manner that allows for efficient generation of completion lists. The word list is originally stored...

  • Write in JAVA Get Familiar with the Problem Carefully read the program description and look at...

    Write in JAVA Get Familiar with the Problem Carefully read the program description and look at the data file to gain an understanding of what is to be done. Make sure you are clear on what is to be calculated and how. That is, study the file and program description and ponder! Think! The Storm Class Type Now concentrate on the Storm class that we define to hold the summary information for one storm. First, look at the definition of...

Free Homework App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.