JP2012022151A - Electronic dictionary and control method of electronic dictionary - Google Patents

Abstract

PROBLEM TO BE SOLVED: To manage an achievement state of learning about entry words and relevant words.SOLUTION: An electronic dictionary 1 includes: a wordbook data storage part 42 where entry words capable of being asked as questions are stored and a flag showing that an entry word has been memorized and flags individually showing that one or more relevant words associated with the entry word have been memorized can be stored in association with the entry word; a learning result processing part 22 which, on acceptance of an input of memorization completion, stores a flag showing that a pertinent entry word or relevant word has been memorized, into the wordbook data storage part 42; and a progress display processing part 24 which reads out learning achievement state information from a question data storage part with respect to one or more entry words and/or relevant words, obtains a proportion of entry words and/or relevant words to which learning achievement state information showing they have been memorized is added, and displays the proportion on a display part.

Description

  The present invention relates to an electronic dictionary that displays a headword or the like as a problem and a method for controlling the electronic dictionary.

  2. Description of the Related Art Conventionally, there is an electronic dictionary that stores a headword and a translation corresponding to the headword in a memory and displays the translation when the headword is input.

  Whether or not the user remembers the translation of the headword, such as displaying only the headword and displaying the translation by the user's operation, not just displaying the translation in the electronic dictionary. Some have the ability to test.

  Here, in many cases, a word includes a related phrase (related word) such as a word derived from the word, a compound word including the word, and a phrase. When performing word learning, learning efficiency is higher when learning including such related words such as derivative words, compound words, and phrases, than learning words alone. However, in a conventional electronic dictionary, it is easy to learn only words, but it is difficult to learn related words such as derivative words, compound words, and phrases.

  In addition, when learning words, it is desirable to show the user how much learning has progressed. Techniques for managing the progress of learning include the following.

  For example, Patent Document 1 describes a flexible word learning system that can use books, lyrics, and the Internet as live teaching materials, can handle multiple meanings, and can be applied to multiple languages. Specifically, the word learning system includes a word learning function that analyzes information from the sentence input function, generates a learning data by referring to a general-purpose general dictionary, and supports word learning, and a display device. The learning function registers the sentence used for learning from the input information, the sentence registration function, the word is extracted from the registered sentence, the general dictionary is searched, and the relation between the word in the sentence and the dictionary is generated The relation between the word in the sentence and the dictionary A generation function, a learning situation judgment / display data generation function that generates display data for learning by referring to a learning dictionary that accumulates and updates learning data such as relational DBs, the number of learnings, and the percentage of correct answers, and a confirmation test It includes a test function and a learning control function for grasping the progress of learning and controlling the whole.

  Patent Document 2 describes a learning system in which a learning opportunity provider can grasp and manage a learner's learning progress regardless of the learning target. Specifically, the learning system includes an education server that distributes learning data, and a terminal device that acquires and reproduces learning data. The terminal device includes a reproduction log generation unit that generates a reproduction log including information indicating that when any of the partial data of the learning data has been reproduced to the end, and a reproduction log that transmits the reproduction log to the education server Transmitting means. The education server includes log acquisition means for acquiring a reproduction log from a terminal device, and log management means for storing log information in an education progress database in association with information for identifying a learner.

JP 2002-072841 A (published March 12, 2002) JP 2007-178641 A (released July 12, 2007)

  However, in the conventional technology as described above, it is not possible to manage the achievement status of learning of not only a headword but also a related word.

  For example, the word learning system described in Patent Literature 1 learns about words in a sentence based on information such as the number of appearances of each word and how many times it is searched in a dictionary. It does not manage the progress of learning for each derivative word.

  In addition, the learning system described in Patent Literature 2 receives learning data distributed from the educational server at the terminal, transmits to the server how far the learning data has been reproduced, and a learning data reproduction log received by the server; It is possible to manage the progress of each learner based on the learner's information, but not to manage the progress by the device alone, and for each phrase, derivative, etc. It does not manage progress.

  The present invention has been made in view of the above problems, and an object thereof is to realize an electronic dictionary and the like that can manage the achievement status of learning of headwords and related words.

  In order to solve the above problem, an electronic dictionary according to the present invention stores a headword and a meaning of the headword in association with each other, and also relates a related word that is a word related to the headword and the related word. In an electronic dictionary that includes a dictionary data storage unit that stores and associates the meaning of and stores the headword and one or more of the related words in association with each other, The question data storage unit that stores headwords that can be given as the problem, the headword stored in the question data storage unit, and the related word that is associated with the headword are displayed as the problem. A question display means to be displayed on the section, and an input receiving section for receiving an input as to whether or not the user has memorized the headword or related word that has been presented, and the question data storage section includes the headword Correspondingly, it is possible to store learning achievement status information individually indicating that the headword has been memorized, and that one or more related words associated with the headword have been memorized, A learning achievement status information recording means for recording learning achievement status information indicating that the entry word or related word has been memorized in the question data storage portion when the input accepting portion accepts the memorized input; Alternatively, for a plurality of headwords and / or related words, the learning achievement status information is read from the question data storage unit, the ratio of learning achievement status information indicating that it has been memorized is obtained, and the ratio is displayed as described above And a progress display processing means to be displayed on the screen.

  In addition, the electronic dictionary control method according to the present invention stores a headword and a meaning of the headword in association with each other, a related word that is a word related to the headword and a meaning of the related word, In an electronic dictionary control method, comprising a dictionary data storage unit that stores and associates the headword and one or more related words, and displays a problem on the display unit. A question display step for displaying either a headword or the related word associated with the headword on the display unit as the problem from a question data storage section that stores headwords that can be given as the problem; When the input reception unit that accepts whether or not the user has memorized the entered headword or related word, when the memorized input is accepted, it is individually determined that the relevant headword or related word has been memorized. Learning achievement status information recording step for recording the learning achievement status information shown in the question data storage unit in association with the headword, and one or more headwords and / or related words from the question data storage unit It includes a progress display processing step of reading learning achievement status information, obtaining a ratio with learning achievement status information indicating that it has been memorized, and displaying the ratio on the display unit.

  According to the configuration or method described above, whether or not the user has memorized the headword or related word that has been presented is recorded individually in the learning achievement status information for each headword and related word. Therefore, since it is possible to manage whether or not each related word has been memorized, even if the number of related words related to one headword is not constant, the achievement status of learning can be accurately recorded. Then, for one or more headwords and / or related words, the learning achievement status information is read from the question data storage unit, the ratio of learning achievement status information indicating that it has been memorized is obtained, and the ratio is displayed. Can be displayed. Therefore, it is possible for the user to confirm the correct achievement status of learning of the headword and its related words, or to test only related words that have not been memorized as problems.

  In the electronic dictionary according to the present invention, the question data storage unit can store the learning level of the user of the headword in association with the headword, and one headword and all of the headwords associated with the headword Learning level management means for increasing a learning level associated with the headword by a predetermined number when learning achievement status information indicating that the memorized data has been memorized in the question data storage unit It may be.

  According to the above configuration, when all of one headword and related words associated with the headword are memorized, the learning level associated with the headword is increased by a predetermined number. Level up.

  As a result, the headword and the related words that the user has memorized can be given again as a problem of the next acquisition level. That is, the same headword and its related words can be repeatedly learned.

  For learning achievement status information, when the acquisition level is increased by a predetermined number, all learning achievement status information associated with the headword, that is, all the headwords and all the headwords The learning achievement status information indicating that the related words have been memorized may be cleared to enter a state indicating that they are not memorized. Alternatively, when the headword or related word is memorized at the next acquisition level without clearing, the learning level for each headword or related word may be increased by a predetermined number, for example, by adding 1 to the numerical value. .

  In the electronic dictionary according to the present invention, the progress display processing means reads learning achievement status information indicating that a related word associated with one headword has been memorized from the question data storage unit, and the headline Of all the related words associated with the word, the ratio of the related words to which the learning achievement status information indicating that it has been memorized is obtained, and the ratio may be displayed on the display unit. .

  According to said structure, the achievement status of the learning of the related word matched with the headword can be displayed correctly.

  In addition, the display form in the display unit may display the ratio of related words as a number, or may display the figure according to the ratio of related words, for example, a bar graph.

  In the electronic dictionary according to the present invention, the progress display processing means memorizes a plurality of headwords stored in the question data storage section and related words associated with the headword from the question data storage section. The learning achievement status information indicating that the learning has been completed is read out, and the ratio of the headword with the learning achievement status information indicating that it has been memorized is obtained from the headword, and the memorized of the related words is obtained. It is also possible to obtain the ratio of related words to which learning achievement status information indicating that the information is attached and to display the obtained headword ratio and related word ratio on the display unit.

  According to said structure, the achievement status of learning of a headword and the related word matched with this headword can be correctly displayed about the collection of several headwords.

  The population whose ratio is to be calculated may be all headwords and related words stored in the question data storage unit, or may be a part of headwords and related words. In addition, the display form in the display unit may display the ratio of headwords and the ratio of related words numerically, or may be displayed by a graphic such as a bar graph corresponding to the ratio of headwords and the ratio of related words. Good.

  In the electronic dictionary according to the present invention, it is preferable that the headword stored in the question data storage unit is associated with the headword stored in the dictionary data storage unit.

  According to the above configuration, since the headword determined as the subject is associated with the headword stored in the dictionary data storage unit, when the headword is determined as the subject, Related terms can also be used as questions.

  In the electronic dictionary according to the present invention, the related word may be at least one of a derivative word of the headword, a compound word including the headword, and a phrase including the headword.

  According to said structure, the derivative of a headword, the compound word containing a headword, and the phrase containing a headword can be set as a related word.

  The electronic dictionary may be realized by a computer. In this case, an electronic book control program for causing the electronic dictionary to be realized by the computer by causing the computer to operate as each of the means, and recording the same Computer-readable recording media are also within the scope of the present invention.

  As described above, the electronic dictionary according to the present invention is associated with a question data storage unit that stores headwords that can be given as questions, headwords stored in the question data storage unit, and the headwords. A problem display means for displaying any related word on the display unit as the above problem, an input receiving unit for receiving an input as to whether or not the user has memorized the headword or related word that has been asked, and the question data The storage unit individually learns that the headword has been memorized in association with the headword and that one or more related words associated with the headword have been memorized. Information can be stored, and when the input receiving unit receives a memorized input, the learning achievement status information indicating that the headword or related word has been memorized is stored in the question data. A learning achievement status indicating that learning achievement status information recording means to be recorded in the storage unit and one or more headwords and / or related words are read out from the question data storage unit and memorized. It is the structure provided with the progress display process means which calculates | requires the ratio to which the information was attached | subjected, and displays this ratio on the said display part.

  In addition, the electronic dictionary control method according to the present invention uses the headword and a related word associated with the headword as the problem from the question data storage unit that stores headwords that can be used as a question. When the memorized input is accepted by the input receiving unit that accepts the question display step to be displayed on the display unit and whether the user has memorized the entered headword or related word, the relevant word or related word is memorized. A learning achievement status information recording step for recording learning achievement status information individually indicating that the learning has been completed in association with the headword in the question data storage unit, and one or more headwords and / or related words, The learning achievement status information is read from the question data storage unit, and a ratio with learning achievement status information indicating that it has been memorized is obtained. A progress display processing step of displaying the serial display unit, the method comprising.

  Thus, since it is possible to manage whether or not each related word is memorized, even if the number of related words related to one headword is not constant, the achievement status of learning can be accurately recorded. Then, for one or more headwords and / or related words, the learning achievement status information is read from the question data storage unit, the ratio of learning achievement status information indicating that it has been memorized is obtained, and the ratio is displayed. Can be displayed. Therefore, there is an effect that the user can confirm the accurate achievement status of learning of the headword and its related words, or display only related words that have not been memorized as problems.

1, showing an embodiment of the present invention, is a block diagram showing a main configuration of an electronic dictionary. FIG. It is a figure which shows the external appearance of the said electronic dictionary. It is a figure which shows the data structure of the dictionary data memorize | stored in the dictionary data storage part of the said electronic dictionary. It is a figure which shows the data structure of the word book data memorize | stored in the word book data storage part of the said electronic dictionary, (a) is a figure which shows each data structure of the word book data 1, (b) is learning The figure which shows the example of the flag which shows an achievement condition, (c) is a figure which shows the structure of the whole word book. It is a figure which shows the specific example of the said word book data. It is a flowchart which shows the flow when performing a test in the said electronic dictionary, (a) is a flowchart which shows the flow which registers the word for performing a test, (b) is a flowchart which shows the flow which performs a test. It is a figure which shows the setting screen for setting a test object. It is a flowchart which shows the flow of the process which registers a word in a word book. It is a figure which shows the registration screen when performing word registration. It is a figure for demonstrating the word extraction process in the case of extracting a word at random, (a) is a flowchart which shows the flow of a word extraction process, (b) is a figure for demonstrating initialization of a search pointer. . It is a flowchart which shows the flow of the word extraction process in the case of extracting the word with a low acquisition level. It is a figure for demonstrating extracting the word book data for a question from the word book data memorize | stored in the word book data storage part, and making it memorize | store in the word book memory part for a question. It is a figure which shows a test screen. It is a flowchart which shows the flow of a problem display process. It is a flowchart which shows the flow of a word / compound / derivative word, and a phrase tab display process. It is a flowchart which shows the flow of a header data acquisition process. It is a flowchart which shows the flow of a compound and derivative word data acquisition process. It is a flowchart which shows the flow of phrase data acquisition processing. It is a flowchart which shows the flow of the skip process of a compound and derivative word test. It is a flowchart which shows the flow of the skip process of a phrase test. It is a flowchart which shows the flow of the test in arbitrary test modes. It is a flowchart which shows the flow of the test in selection test mode. It is explanatory drawing about the case where the selected test object is 1 type, (a) is a figure which shows the state of the setting screen in which only the word was selected, (b) is a test flow when only the word is selected (C) is a diagram showing a state of a setting screen in which only compound / derivative words are selected, and (d) is a flowchart showing a test flow when only compound / derivative words are selected. It is explanatory drawing about the case where the selected test object is two or more types, (a) is a figure which shows the state where a word, a compound / derivative, and a phrase are selected, (b) is a word, a compound / derivative, and a phrase It is a flowchart which shows the test flow when is selected. It is a flowchart which shows the flow of a spelling test process. It is a figure which shows the display screen in a spelling test, (a) is a figure which shows a question display, (b) is a figure which shows an answer display. It is a flowchart which shows the flow of a process of a semantic test. It is a figure which shows the display screen in a semantic test, (a) is a figure which shows a question display, (b) is a figure which shows an answer display, (c) is a figure which shows an answer input display. It is a figure for demonstrating a learning progress preservation | save process, (a) is a flowchart which shows the flow of a learning progress preservation | save process, (b) is a figure for demonstrating initialization of a search pointer. It is a figure for demonstrating updating the word book data memorize | stored in the word book data storage part to the content of the word book data memorize | stored in the word book memory part for questions. It is an example of a display screen of a progress display in a screen for selecting a test method. It is explanatory drawing which shows the example of the graph frame of a progress graph, (a) is a figure which shows the case where all of a word, a compound and derivative word, and a phrase are checked by a word book test setting, (b) is a word book test. Figure showing the case where the words, compound / derivatives are checked in the settings, and the phrase is unchecked, (c) is only the words checked in the word book test settings, the compound / derivatives, phrases are unchecked It is a figure which shows the case. It is explanatory drawing which shows the preparation method of a progress graph, (a) is a figure which shows word book data, (b) is a figure which shows the example of a graph of a word, (c) is a figure which shows the example of a graph of a compound and derivative word, (D) is a figure which shows the example of a graph of a phrase. It is explanatory drawing which shows the change of a progress graph accompanying the progress of learning. It is explanatory drawing of the process which displays the screen which displays comprehensive learning progress, (a) is a flowchart which shows the flow of a process, (b) is explanatory drawing which shows the outline | summary of the search of word book data. It is explanatory drawing of the process which displays a problem display screen, (a) is a flowchart which shows the flow of a process, (b) is explanatory drawing which shows the outline | summary of the search of the question word word data.

(Overall configuration)
One embodiment of the present invention will be described below with reference to FIGS. The electronic dictionary 1 according to the present embodiment is an electronic dictionary that can search for translations of headwords, and can perform tests such as translation of words selected by a user from headwords and tests of words from translations. Is.

  More specifically, the electronic dictionary 1 can test a word selected by the user, a compound / derivative of the word, and a phrase. Further, the test can be performed with only a word, only a compound / derivative word, and only a phrase, or a word, a compound / derivative word of this word, and a phrase can be sequentially performed. In addition, by performing a test, it is possible to record whether or not it was remembered and display the learning progress state. Furthermore, the test can be performed by displaying English or Japanese sentences, or by outputting sound.

  FIG. 2 shows the appearance of the electronic dictionary 1. As shown in FIG. 2, the electronic dictionary 1 includes a display unit 12 and a key operation unit 11. The key operation unit 11 is used by a user to perform operations on the electronic dictionary 1. The electronic dictionary 1 includes a main display unit 12 (12A) and a sub display unit 12 (12B) on the same surface as the key operation unit 11. In addition, the display unit 12 may be configured by a touch panel to receive an operation on the electronic dictionary 1 together with the key operation unit 11. In the case of a touch panel, a touch pen may be provided. Further, the display unit 12B is not an essential configuration and may not be provided.

  Next, the configuration of the electronic dictionary 1 will be described with reference to FIG. FIG. 1 is a block diagram showing a main configuration of an electronic dictionary 1 according to the present embodiment. As shown in FIG. 1, the electronic dictionary 1 includes a key operation unit (input reception unit) 11, a display unit 12, a control unit 13, a storage unit 14, and a speaker unit 15. The control unit 13 includes a word book data registration unit 21, a learning result processing unit (learned information recording unit, learning level management unit) 22, and a question processing unit 23. The question processing unit 23 includes a question word book The configuration includes an extraction unit 31, a problem output processing unit 32, an answer reception unit (learning achievement status information recording unit) 33, and a question word book storage unit 34. The storage unit 14 includes a dictionary data storage unit 41 and a word book data storage unit (question data storage unit) 42.

  The key operation unit 11 is used by the user to perform operations on the electronic dictionary 1, and includes a keyboard, scroll keys, numeric keys, a “search / decision” key, a “return” key, a “switch” key, and the like. It is.

  The display unit 12 displays headwords, translations, and the like, and is realized by a liquid crystal display, an organic EL (Electro Luminescence) display, a plasma display, or the like.

  The speaker unit 15 is a speaker that outputs sound and the like.

  The storage unit 14 is a storage unit that stores data used in the electronic dictionary 1, and includes a dictionary data storage unit 41 and a word book data storage unit 42.

  The dictionary data storage unit 41 stores data such as headwords and their translations. The dictionary data stored in the dictionary data storage unit 41 will be described with reference to FIG. FIG. 3 is a diagram illustrating a data structure of the dictionary data 301.

  As shown in FIG. 3, the data structure of the dictionary data 301 includes a type 302 and data 303 indicating the contents. The type 302 includes a heading 311, a body text 312, a compound / derivative word 313, and an example sentence 314. , Phrase 315 is included. The heading 311 is data indicating a heading word, and is “apple” in the example illustrated in FIG. 3. The body 312 includes data such as part of speech and translation of the headword. The compound / derivative word 313 includes data of a headword compound word / derivative word. The example sentence 314 includes example sentence data using compound words and derivative words. The phrase 315 includes phrase data using a headword.

  As described above, the data structure of the dictionary data 301 is such that the headline 311, the body 312, the compound / derivative word 313, the example sentence 314, and the phrase 315 can be identified. In addition, for each compound / derivative word or phrase, there is one corresponding compound / derivative word 313 or phrase 315, and when there are a plurality of compound / derivative words or phrases, each compound / derivative word 313 is combined. Or the phrase 315 exists. Further, the data 303 column of the compound / derivative word 313 and the phrase 315 includes the compound / derivative word or phrase and the Japanese translation thereof, and the compound / derivative word or phrase and these Japanese translations are separated from each other by a separator (line feed code). ).

  The word book data storage unit 42 stores the word data selected by the user as the word book data 401 among the dictionary data stored in the dictionary data storage unit 41. The word book data 401 stored in the word book data storage unit 42 will be described with reference to FIG. FIG. 4 is a diagram for explaining the data structure of the word book data 401, FIG. 4 (a) is a diagram showing each data structure of the word book data 401, and FIG. 4 (b) is a learning diagram. It is a figure which shows the example of the flag which shows an achievement condition, and FIG.4 (c) is a figure which shows the structure of the whole word book.

  As shown in FIG. 4A, the data structure of the word book data 401 includes a headword 410, a word number 411, an acquisition level 412, a number of data (composite / derived words) 413, a number of data (phrase) 414, and learning achievement. Situation flag (word) (learning achievement status information) 415, learning achievement status flag (compound / derivative word) (learning achievement status information) 416, learning achievement status flag (spoken) (learning achievement status information) 417, and learned flag (Learned information) 418 is included. In the present embodiment, the learning achievement status flag and the learned flag will be described as an example included in the word book data 401 stored in the word book data storage unit 42. As long as it is associated, it is not limited to the so-called flag form, and for example, it may be stored in an area different from the word book data 401.

  The word number 411 records the number of the entry word recorded in the word book data 401. This number is also included in the dictionary data 301, and is associated with the dictionary data 301 of the word by referring to the word number 411. The acquisition level 412 records the acquisition level of headwords. The number of data (composite / derived word) 413 records the number of data of the compound / derived word corresponding to the headword. The number of data (sung phrase) 414 records the number of phrase data corresponding to the headword. The learning achievement status flag (word) 415 records the learning achievement status of the word as a flag. The learning achievement status flag (compound / derivative word) 416 records the learning achievement status of the compound / derivative word as a flag. The learning achievement status flag (phrase) 417 records the learning achievement status of the phrase as a flag. The learned flag 418 is a flag that records whether or not the question has been given. This is used to discriminate which words are given and which are not given when questions are randomly given from the word book. The learned flag 418 is cleared when all the words stored in the word book are presented.

  Next, with reference to FIG. 4B, flag examples in the learning achievement status flag (word) 415, the learning achievement status flag (compound / derivative word) 416, and the learning achievement status flag (spoken phrase) 417 will be described. The example shown in FIG. 4B shows a case where there are four compound / derivative words and five compound phrases for a headword (word). In the present embodiment, each word, compound / derivative, and phrase is set to “1” when it is memorized and “0” when it is not memorized.

  When there are a plurality of compound / derivative words or phrases, the memorized or unmemorized information is stored by the flag in the order of the dictionary data 301. As described above, when there are a plurality of compound / derivative words and phrases, each memorized or not memorized is memorized, so that the memorized words / phrases can not be given again in the test.

  Next, the word book will be described with reference to FIG. The word book records words selected by the user from the dictionary data. One word book data is created for each word, and word book data for the number of words selected by the user is collected. It has become a word book. Therefore, as shown in FIG. 4 (c), if there are N words selected by the user, N wordbook data such as wordbook data A, wordbook data B,. A word book is formed.

  Next, a specific example of word book data will be described with reference to FIG. FIG. 5 is a diagram showing a specific example of word book data. FIG. 5A shows a case where the headword is “apple”, and FIG. 5B shows a case where the headword is “take”. FIG. 4C shows the case where the headword is “wave”, and FIG. 4D shows the end of the data.

  In the example shown in FIG. 5A, the headword is “apple”, the word number 411 is “29101”, the acquisition level 412 is “1”, the number of data (composite / derivative) 413 is “6”, and the number of data ( Phrase) 414 is “7”, learning achievement status flag (word) 415 is “1”, learning achievement status flag (compound / derivative) 416 is “100100”, learning achievement status flag (phrase) 417 is “1110111”, The learned flag 418 is “1”.

  As a result, for “apple”, the acquisition level is “1”, there are 6 compound / derivative words and 7 phrases, the word is stored, and one of the 6 compounds / derivatives is stored. It can be seen that the third and fourth words have been stored, and the phrase has been stored except for the fourth of the seven phrases, and the questions have already been given.

  The same applies to “take” in FIG. 5B and “wave” in FIG. Further, as shown in FIG. 5D, only the word number 411 indicating the end is stored at the end of the data in the word book.

  Next, the control unit 13 of the electronic dictionary 1 will be described. The control unit 13 is for realizing various functions of the electronic dictionary 1. In addition, since the function as a dictionary in the electronic dictionary 1 is realizable using a well-known technique, the description is abbreviate | omitted here.

  When the user performs an operation of registering a word using the key operation unit 11, the word book data registration unit 21 creates word book data from the dictionary data of the word stored in the dictionary data storage unit 41, and creates The word book data thus stored is stored in the word book data storage unit 42.

  When the user performs an operation to end the test using the key operation unit 11, the learning result processing unit 22 uses the test result stored in the question word storage unit 34 as the word book data in the word book data storage unit 42. It is reflected in.

  When the user performs a test operation using the key operation unit 11, the question processing unit 23 performs question processing and answers, and includes a question word extraction unit 31, a problem output processing unit 32, The answer receiving unit 33 and the question word storage unit 34 are included.

  When the user performs an operation to perform a test using the key operation unit 11, the question word book extraction unit 31 includes 10 words as question questions in the word book data stored in the word book data storage unit 42. Word book data of individual words is extracted and stored in the question word book storage unit 34. The extraction of words may be random or may depend on the acquisition level.

  The question output processing unit 32 creates a question from the word book data stored in the question word book storage unit 34, displays a test question on the display unit 12, and outputs a sound from the speaker unit 15. The display switching unit 35, the question display unit (problem display unit) 36, and the progress display processing unit 24 (progress display processing unit) are included.

  The display switching unit 35 switches the question display to be displayed on the display unit 12. For example, only “headword” is displayed as a question, only “composite / derivative” is displayed as a question, only “spoken” is displayed as a question, or these three are displayed as questions.

  The question display unit 36 causes the display unit 12 to display the problem of the word to be asked.

  The progress display processing unit 24 causes the display unit 12 to display a learning progress state according to an instruction from the problem output processing unit 32. Details of the progress display processing unit 24 will be described later.

  The answer receiving unit 33 receives an answer made by the user using the key operation unit 11 and stores the content in the question word storage unit 34.

  The question word book storage unit 34 is a temporary memory that stores word book data of ten words extracted by the question word book extraction unit 31. Further, the word book data is updated by the user's answer received by the answer receiving unit 33.

  Next, with reference to FIG. 6, the flow when performing a test in the electronic dictionary 1 will be described. FIG. 6 is a flowchart showing a flow when a test is performed in the electronic dictionary 1, FIG. 6A is a flowchart showing a flow of registering a word for the test, and FIG. 6B is a test flow. It is a flowchart which shows the flow which performs.

  As shown in FIG. 6A, when registering a word to be tested, the word book data registration unit 21 is stored in the dictionary data storage unit 41 by operating the key operation unit 11. Word book data is created from the word dictionary data to be stored and stored in the word book data storage unit 42 (S601). The above is the processing for registering a word.

  Next, the case of performing a test will be described with reference to FIG. When performing the test, first, the problem output processing unit 32 displays the progress state on the display unit 12 (S611, progress display processing step). Next, the question word extraction unit 31 extracts the word book data of the questions, from the word book data storage unit 42 and stores it in the question word storage unit 34 (S612). Then, the question output processing unit 32 creates a question from the word book data stored in the question word storage unit 34 and displays it on the display unit 12 (S613, question display step). Then, when there is a switching instruction by operating the key operation unit 11, the display switching unit 35 switches the problem displayed on the display unit 12 (S614). Thereafter, when the user's answer is accepted, the word book data stored in the question word storage unit 34 is updated (S615, learning achievement status information recording step). Finally, the learning result processing unit 22 updates the word book data stored in the word book data storage unit 42 based on the updated word book data stored in the question word storage unit 34. (S616, learning achievement status information recording step). The above is the processing when performing the test.

  Next, a display screen for setting an object to be tested will be described with reference to FIG. FIG. 7 is a diagram showing a setting screen 701 for setting a test target. As described above, the test can be performed using only words, only compound / derivative words, only phrases, or a combination thereof. Also, both English → Japanese and Japanese → English are possible. Therefore, these settings can be selected on the setting screen 701. Specifically, a test target, a test item, and a test method can be selected.

  When the box 711 on the setting screen 701 is checked, the word is selected as a test target. When the box 712 is checked, a compound / derived word is selected as a test target. When the box 713 is checked, the phrase is tested. Selected as a target. When the box 714 is checked, the test method becomes a spelling test. The spelling test is to output English voice from the speaker unit 15 and test the spelling. If the box 715 is checked, the test method becomes a semantic test. In the meaning test, English words are displayed on the display unit 12, and the meaning is tested. Further, when the box 716 is selected, the test method (selection test mode) for testing all the selected objects is selected, and when the box 717 is selected, the test method (optional test mode) for testing only an arbitrary test object is selected.

  In the example shown in FIG. 7, since all the boxes 711 to 715 are checked and the box 716 is selected, the spelling test and the semantic test are performed in the selection test mode for the word, compound / derivative, and phrase. It becomes.

(registration process)
Next, a registration process for registering a word in the word book (word book data storage unit 42) will be described with reference to FIGS. First, the flow of registration processing will be described with reference to FIG. FIG. 8 is a flowchart showing the flow of processing for registering a word in the word book.

  When registering a word in the word book, the word book data registration unit 21 first determines whether or not a word to be registered is already registered in the word book data storage unit 42 (S801). If registered (YES in S801), it is not necessary to register the same word again, and the process ends.

  On the other hand, if not registered (NO in S801), the word book data registration unit 21 initializes the search pointer, sets the word count to “1”, the compound / derived word count to “0”, and the phrase count to “ 0 "is set (S802). Initializing the search pointer means positioning the search pointer at the beginning of dictionary data of a word to be registered. Specifically, the search pointer is positioned at the “heading” portion of the dictionary data 301 shown in FIG.

  Next, the word book data registration unit 21 determines whether or not the search target is a compound / derivative word (S803). If it is not a compound / derivative word (NO in S803), the search pointer is counted up (S805). Counting up the search pointer means moving the search pointer to the next type. Specifically, in the dictionary data 301 of FIG. 3, when the search pointer is present in the “heading” portion, counting up causes the search pointer to be positioned at the next type “text”.

  On the other hand, if the search target is a compound / derivative word (YES in S803), the compound / derivative word count is incremented by "1". Then, the search pointer is counted up (S805).

  Thereafter, when the search is performed up to the end of the dictionary data (YES in S806), the search pointer is initialized again (S807). Whether or not it is the end of data can be determined, for example, by detecting that the word number is a predetermined value “0xFFFFFFFF” (FIG. 5D). Then, the word book data registration unit 21 determines whether or not the search target is a phrase (S808). If the search target is not a phrase (NO in S808), the search pointer is counted up (S801). On the other hand, if the search target is a phrase (YES in S808), the phrase count is incremented by “1” (S809), and the search pointer is incremented (S810).

  When the search is completed up to the end of the dictionary data (YES in S811), the word book data registration unit 21 registers the word number (S812). Thereafter, the acquisition level is initialized (S813), the learning achievement status flag (word) is initialized (S814), the learning achievement status flag (composite / derived word) is initialized (S815), and the learning achievement status flag (phrase) is set. Initialization is performed (S816). Then, the word book data is stored in the word book data storage unit 42 (S817), and the registration process ends.

  Next, with reference to FIG. 9, a display screen when performing word registration will be described. FIG. 9 is a diagram showing a registration screen 901 when word registration is performed. The registration screen 901 is a screen showing the result of dictionary search in the electronic dictionary 1, and in the example shown in FIG. 9, the result of searching for “take” is displayed. In this state, by performing a word registration operation, the word book data “take” is stored in the word book data storage unit 42.

(Learning process)
Next, the learning process will be described. The learning process includes a progress display process, a word extraction process, a problem display process, a test process, and a learning result storage process, and will be described separately. In the present embodiment, the learning process first displays the progress state, accepts the selection of the all-word mode or the low acquisition level mode in the progress state display, and extracts the corresponding word according to the accepted mode. The extracted word is tested and the test result is saved.

(Word extraction process)
The word extraction process will be described with reference to FIGS. The word extraction process is a process of extracting a question word from words stored in the word book data storage unit 42. In the present embodiment, ten words (word book data) are extracted. First, the flow of word extraction processing will be described with reference to FIGS. FIG. 10A is a flowchart showing the flow of word extraction processing when words are randomly extracted (all word mode), and FIG. 10B is a diagram for explaining search pointer initialization. is there. FIG. 11 is a flowchart showing a word extraction process when a word with a low acquisition level is extracted (low acquisition level mode).

  When extracting words at random, as shown in FIG. 10A, the question word extraction unit 31 first initializes a search pointer (S1001). Here, the initialization of the search pointer means that the search pointer is positioned at the first word book data among the word book data stored in the word book data storage unit 42 to be searched. That is, as shown in FIG. 10B, when there are a plurality of word book data, the search pointer is positioned at the word book data A which is the first word book data.

  The question word extraction unit 31 determines whether the search target word has been learned, that is, whether the learned flag is “1” (S1002). If it has been learned (YES in S1002), the search pointer is counted up (S1004). Counting up the search pointer means positioning the search pointer to the next word book data. In the example shown in FIG. 10B, the search pointer corresponding to the word book data A is positioned to the word book data B. To do.

  On the other hand, if not learned (NO in S1002), the word is registered as a test candidate (S1003). Then, the search pointer is counted up (S1004).

  When the search is performed up to the end of the data in the word book (YES in S1005), the question word book extraction unit 31 determines whether there are 10 or less words registered as test candidates (S1006). If the number is 10 or less (YES in S1006), the words registered as test candidates are stored in the question word book storage unit 34 as question words (S1008). On the other hand, if there are more than 10 words registered as test candidates (NO in S1006), 10 words are extracted as random numbers from the words registered as test candidates (S1007). Then, the extracted ten words are stored in the question word book storage unit 34 as question words (S1008). Thus, the word extraction process for extracting words at random is completed.

  Next, word extraction processing for extracting words with low learning levels will be described with reference to FIG. Even when a word with a low learning level is extracted, the process flow is the same up to step S1006 in FIG. 10, and thus the description thereof will be omitted, and description will be made from step S1106 (step S1006 in FIG. 10).

  The question word book extraction unit 31 determines whether the number of words registered as test candidates is 10 or less (S1106). If the number is 10 or less (YES in S1106), the words registered as test candidates are stored in the question word book storage unit 34 as question words (S1109). On the other hand, if there are more than 10 words registered as test candidates (NO in S1106), the question word extraction unit 31 sorts the words registered in the test candidates in the order of acquisition level (S1107). Then, the 10 items from the bottom are extracted in order from the lowest learning level (S1108). In addition, when a plurality of words are at the same learning level, and if all of them exceed 10 words, an appropriate number of words are randomly selected from the words at the same learning level so that the number of extracted words is 10 Select with. Thereafter, the extracted 10 words are stored in the question word book storage unit 34 as question words (S1009). Thus, the word extraction process for extracting words with a low learning level is completed.

  Next, with reference to FIG. 12, a description will be given of extracting the question word book data from the word book data stored in the word book data storage unit 42 and storing it in the question word book storage unit 34. . Since the word book data used for the questions needs to be updated according to the answer of the user, it is stored in the question word book storage unit 34 which is a rewritable temporary memory.

  In the example shown in FIG. 12, among the word book data included in the word book 1201 stored in the word book data storage unit 42, the word book data AA, BC, CD, EF, EG, EH, IJ, KL, KM , And LL are extracted and stored in the question word storage unit 34.

(Problem display processing)
Next, the problem display process will be described with reference to FIGS. First, an example of a problem display screen will be described with reference to FIG. FIG. 13 shows a display screen 1301 that is a screen for testing headwords (words), a display screen 1302 that is a screen for testing compound / derivative words, and a display screen 1303 that is a screen for testing phrases. It is shown.

  The display screen 1301 displays the headword “Apple” as a problem, displays that the current level of the headword “Apple” is “level 1”, and further displays the headword “Apple”. The progress status of is displayed. The display screen 1302 displays “Apple brandy”, which is a compound / derivative word of the headword “Apple”, as a problem, and displays that the current level of the headword “Apple” is “level 1”. In addition, the progress status of the headword “Apple” is displayed. The display screen 1303 displays “A bad [rotten] apple”, which is a phrase of the headword “Apple”, as a problem, and displays that the current level of the headword “Apple” is “level 1”. In addition, the progress status of the headword “Apple” is displayed. Note that the display screen 1301, the display screen 1302, and the display screen 1303 can be switched to each other by a “switch” key included in the key operation unit 11.

  Next, the flow of the problem display process will be described with reference to FIGS. 14 to 20 are flowcharts showing the flow of the problem display process.

  As shown in FIG. 14, the problem output processing unit 32 first acquires word book data to be given from a plurality of word book data stored in the question word storage unit 34 (S1401). Then, the problem output processing unit 32 refers to the word number 411 of the acquired word book data (S1402), and acquires dictionary data of the word number from the dictionary data storage unit 41 (S1403). Thereafter, a word, compound / derivative word, and phrase tab display process is performed (S1404). The word, compound / derivative word, and phrase tab display processing will be described later.

  If the problem to be displayed is a headword (YES in S1405), the problem output processing unit 32 performs headword data acquisition processing (S1406). The headword data acquisition process will be described later. When the headword data acquisition process is completed, the problem output processing unit 32 displays a headword problem (S1411). On the other hand, if the problem to be displayed is not a headword (NO in S1405), the problem output processing unit 32 determines whether or not the problem to be displayed is a compound / derivative word (S1407). If the displayed problem is a compound / derivative word (YES in S1407), the problem output processing unit 32 performs a compound / derivative word data acquisition process (S1408). The compound / derivative word data acquisition process will be described later. When the compound / derivative word data acquisition process is completed, the problem output processing unit 32 displays a problem of the compound / derivative word (S1411).

  On the other hand, if the displayed problem is not a compound / derivative word (NO in S1407), the problem output processing unit 32 determines whether or not the display problem is a phrase (S1409). If the displayed problem is a phrase (YES in S1409), the problem output processing unit 32 performs a phrase data acquisition process (S1410). The phrase data acquisition process will be described later. When the phrase data acquisition process ends, the problem output processing unit 32 displays a phrase problem display (S1411). If the displayed problem is not a phrase (NO in S1409), the problem output processing unit 32 displays an error (S1412). Thus, the problem display process ends.

  Next, with reference to FIG. 15, the word, compound / derivative word, and phrase phrase display processing will be described. First, the problem output processing unit 32 performs word (headword) tab display (S1501). If the word has a compound / derivative word (YES in S1502), the problem output processing unit 32 displays a compound / derivative word tab (S1503). Furthermore, if there is a phrase in the word (NO in S1504), the problem output processing unit 32 displays a phrase tab display (S1505). If there is no compound / derivative word or phrase (NO in S1502, NO in S1504), the process proceeds as it is. This completes the word, compound / derivative word, and phrase tab display processing.

  Next, the headword data acquisition process will be described with reference to FIG. First, the problem output processing unit 32 sets a search pointer in the dictionary data of the word to be asked (S1601). Then, the type data of the dictionary data is acquired (S1602), and it is determined whether or not the type is “Heading” (S1603). If the type is “Heading” (YES in S1603), “Heading” data is acquired as a problem (S1604). Thereafter, “text” data is acquired as an answer (S1605). On the other hand, if the type is not “Heading” (NO in S1603), the process ends. This completes the entry word data acquisition process.

  Next, the compound / derivative word data acquisition process will be described with reference to FIG. First, the problem output processing unit 32 sets a search pointer in the dictionary data of the word to be asked (S1701). Then, the type data of the dictionary data is acquired (S1702), and it is determined whether the type is “heading” (S1703). If the type is “Heading”, the problem number N of the compound / derivative word is set to “0” (S1704).

  Then, the search pointer is counted up (S1705). If the search pointer after counting up is not positioned at the end of the data (NO in S1706), the type data is acquired (S1707). Then, it is determined whether or not the type is “derivative / compound word” (S1708). If the type is “composite / derivative” (YES in S1708), whether or not the learning achievement status flag (composite / derivative) corresponding to the composite / derivative in the word book data is “0” (not memorized). Is determined (S1709).

  If the learning achievement status flag (composite / derivative word) is “0” (YES in S1709), the part before the separator of the “composite / derivative word” data is acquired as the Nth problem (S1710). Subsequently, the portion after the separator of the “composite / derived word” data is acquired as the Nth answer (S1711). Then, the problem number N of compound / derivative words is counted up by “1” (S1712), and the process returns to step S1705 to increment the search pointer.

  On the other hand, if the type is not “entry word” in step S1703 (NO in S1703), the process ends. If the search pointer after the count-up is at the end of the data in step S1706 (YES in S1706), the process ends. If the type is not “composite / derivative” in step S1708 (NO in S1708), the process returns to step S1705. If the learning achievement status flag (compound / derivative) is not “0” in step S1709 (NO in S1709), the process returns to step S1705. The above is the compound / derivative word data acquisition processing.

  Next, phrase data acquisition processing will be described with reference to FIG. First, the problem output processing unit 32 sets a search pointer in the dictionary data of the word to be asked (S1801). Then, the type data of the dictionary data is acquired (S1802), and it is determined whether the type is “heading” (S1803). If the type is “Heading”, the number N of question phrases is set to “0” (S1804).

  Then, the search pointer is counted up (S1805). If the search pointer after counting up is not located at the end of the data (NO in S1806), the type data is acquired (S1807). Then, it is determined whether or not the type is “song phrase” (S1808). If the type is “sung phrase” (YES in S1808), it is determined whether or not the learning achievement status flag (sung phrase) corresponding to the phrase in the word book data is “0” (not memorized) (S1809).

  If the learning achievement status flag (phrase) is “0” (YES in S1809), the portion before the separator of the “phrase” data is acquired as the Nth problem (S1810). Subsequently, the part after the separator of the “sung phrase” data is acquired as the Nth answer (S1811). Then, the number N of question phrases is counted up by “1” (S1812), and the process returns to step S1805 to count up the search pointer.

  On the other hand, if the type is not “entry word” in step S1803 (NO in S1803), the process ends. If the search pointer after the count-up is at the end of the data in step S1806 (YES in S1806), the process is terminated as it is. If the type is not “success” in step S1808 (NO in S1808), the process returns to step S1805. If the learning achievement status flag (phrase) is not “0” in step S1809 (NO in S1809), the process returns to step S1805. The above is the phrase data acquisition process.

  Next, processing for skipping the compound / derivative test will be described with reference to FIG. The process of skipping the compound / derivative word test is a process of advancing the question to the next word when the compound / derivative word does not exist in the question target word.

  First, the problem output processing unit 32 sets a search pointer in the word book data of the next word for which the question has been completed, which is stored in the question word storage unit 34 (S1901). If the next word book data is not the end of the data (NO in S1902), the number of data (composite / derivative word) is acquired from the word book data (S1903). Then, it is determined whether or not the number of data (composite / derived word) is “0” (S1904). If the number of data (composite / derived word) is “0” (YES in S1904), the process returns to step S1901; A search pointer is set for the next word book data. On the other hand, if the number of data (composite / derivative) is not “0” (NO in S1904), composite / derivative-word data acquisition processing is performed (S1905). In step S1902, if the position where the search pointer is set is the end of the data (YES in S1902), the process ends. The above is the process for skipping the compound / derivative test.

  Next, a process for skipping the phrase test will be described with reference to FIG. The process of skipping the phrase test is a process of advancing the question to the next word when there is no phrase in the question target word.

  First, the question output processing unit 32 sets a search pointer in the word book data of the next word that has been given a question, which is stored in the question word storage unit 34 (S2001). If the next word book data is not the end of the data (NO in S2002), the number of data (phrase) is acquired from the word book data (S2003). Then, it is determined whether or not the number of data (phrase) is “0” (S2004). If the number of data (phrase) is “0” (YES in S2004), the process returns to step S2001, and the next word book data is stored. Set the search pointer. On the other hand, if the number of data (phrase) is not “0” (NO in S2004), phrase data acquisition processing is performed (S2005). If the position where the search pointer is set is the end of the data in step S2002 (YES in S2002), the process is terminated. The above is the process of skipping the phrase test.

  Next, a test flow in an arbitrary test mode in which an arbitrary test is performed will be described with reference to FIG. FIG. 21 is a flowchart showing a test flow in the arbitrary test mode.

  First, the problem output processing unit 32 displays a wordbook test menu for selecting a word to be tested (S2101). When the all word mode or the low learning level mode is selected, a display for testing the first word is performed (S2102, word test-1). Here, the set test is performed. In other words, if both the spelling test and the semantic test are set, the test is performed in the order of spelling test → semantic test. If any setting is to be tested, the set test is performed. If the test is completed and no switching instruction is received, the next word is tested (S2103, word test-2). On the other hand, when the test is completed and an instruction to switch from the word test to the compound / derivative word test is received, the problem output processing unit 32 displays the compound / derivative word test screen for the word (S2111, compound / derivative word test). -1). Similarly to the word test, the compound / derived word test is also tested in the order of spelling test → semantic test. When receiving the instruction to switch to the phrase test, the problem output processing unit 32 displays the phrase test screen (S2121, phrase test-1). The phrase test does not have a spelling test, only a semantic test.

  Then, after completion of the compound / derivative word test or phrase test, if no switching instruction is received, each test is performed on the next word. That is, after the compound / derivative word test-1 is completed, the question output processing unit 32 displays a compound / derivative word test screen for the next word (S2112, compound / derivative word test-2). Similarly, after the phrase test-1 is completed, the question output processing unit 32 displays a phrase test screen for the next word (S2122, phrase test-2).

  When the test of the ten words extracted for the question is completed in this way, the process returns to step S2101. The above is the test flow in the arbitrary test mode.

  Next, with reference to FIG. 22, a test flow in the selected test mode in which all selected test targets are performed will be described. FIG. 22 is a flowchart showing a test flow in the selection test mode.

  First, the question output processing unit 32 displays a wordbook test menu for selecting a word to be tested as in the case of the arbitrary test mode (S2201). When the all word mode or the low learning level mode is selected, a display for testing the first word is performed (S2202, word test-1). Here, the set test is performed. In other words, if both the spelling test and the semantic test are set, the test is performed in the order of spelling test → semantic test. If any setting is to be tested, the set test is performed. When the test is completed, the compound / derivative word test screen for the word is displayed (S2203, compound / derivative word test-1). Similarly to the word test, the compound / derived word test is also tested in the order of spelling test → semantic test. Next, the question output processing unit 32 displays a phrase test screen (S2204, phrase test-1). The phrase test does not have a spelling test, only a semantic test.

  When the word test-1, compound / derivative word test-1 of the word, and phrase test-1 are completed, the problem output processing unit 32 displays a word test screen for the next word (S2205, word test-2). ). After that, the compound / derivative test (S2206, compound / derivative test-2) and the phrase test (S2207, phrase test-2) of the word are performed, and the word test, compound / derivation of all ten extracted words. When the word test and the phrase test are completed (S2210), the process returns to step S2201. The above is the test flow in the selective test mode.

  Next, with reference to FIG. 23, a case where the selected test target is one type will be described. FIG. 23 is an explanatory diagram for the case where one type of test target is selected. FIG. 23A is a diagram showing the state of the setting screen 701 in which only words are selected, and FIG. FIG. 23C is a flowchart showing a test flow when only a word is selected, and FIG. 23C is a diagram showing a state of the setting screen 701 in which only a compound / derivative word is selected, and FIG. ) Is a flowchart showing a test flow when only a compound / derivative word is selected.

  As shown in FIG. 23 (a), when only a word is selected as a test target, as shown in FIG. 23 (b), the problem output processing unit 32 first tests the first word, word-1. The screen is displayed (S2301), then the test screen for word-2 is displayed (S2302), and only the test screen for words is displayed in order. In this manner, the extracted ten words are tested, and the process ends.

  Further, as shown in FIG. 23C, when only a compound / derivative word is selected as a test target, the problem output processing unit 32 is the first word as shown in FIG. 23D. The test screen of the compound / derivative word 1-1, which is the first compound / derivative word of the word-1, is displayed (S2311). Next, the problem output processing unit 32 displays a test screen for the compound / derivative word 1-2, which is the next compound / derivative word of the word (S2312). In this way, when all compound / derivative tests for the word are completed, the process proceeds to the next word. If there is no compound / derivative word in the next word, the process proceeds to the next word. Then, a test screen for the compound / derivative word 3-1 of the word is displayed (S2314). In this manner, all the compound / derivative words of the extracted ten words are tested, and the process ends.

  Next, a case where there are a plurality of types of selected test targets will be described with reference to FIG. FIG. 24 is an explanatory diagram for a case where a plurality of types of test targets are selected, and FIG. 24 (a) is a diagram illustrating a state in which words, compound / derived words, and phrases are selected, and FIG. b) is a flowchart showing a test flow when a word, compound / derivative, or phrase is selected.

  As shown in FIG. 24A, when a word, compound / derivative, or phrase is selected as a test target, the problem output processing unit 32 first displays the first word as shown in FIG. The test screen for the word -1 is displayed (S2401). Next, the problem output processing unit 32 displays a test screen for the compound / derivative word 1-1 that is the first compound / derivative word of the word-1 (S2402). When all the compound / derivative tests for word-1 are completed (S2404), the problem output processing unit 32 displays a test screen for phrase 1-1, which is the first phrase of word-1. (S2405). Then, when the test of all phrases of the word-1 is completed (S2406), the problem output processing unit 32 displays a test screen for the next word, word-2 (S2407). Since there are no compound / derivative words and phrases in the word-2, the problem output processing unit 32 then displays the test screen for the word-3 (S2408). Thereafter, the compound / derivative word and phrase test of word-3 are performed, and the test is completed when the word test, compound / derivative word test, and phrase test of all ten extracted words are performed.

  In the arbitrary test mode, when switching between the word test, the compound / derivative word test, and the phrase test, the test is performed from the beginning of the switching destination after the switching.

  In FIG. 24B, there are three compound / derivative words, two compound phrases for word 1, two compound phrases, no compound / derivative words, and none for word 2, and two compound / derivative words for word 3. This shows a case where there are three phrases.

(Test processing)
Next, the test process will be described with reference to FIGS. First, processing in the spelling test will be described with reference to FIGS. FIG. 25 is a flowchart showing a spelling test process. FIG. 26 shows a display screen in the spelling test, FIG. 26 (a) shows a question display, and FIG. 26 (b) shows an answer display.

  When performing the spelling test, first, the question output processing unit 32 displays a question display screen (S2501), and outputs the voice of the question target word or compound / derivative word (S2502). As shown in FIG. 26 (a), the question display screen 2601 displays "Please listen to the voice and think of the spelling." And when the "voice" key is selected, the voice is output again. However, when the “search / decision” key is selected, an answer is displayed.

  Next, the problem output processing unit 32 determines whether or not the “voice” key has been selected (S2503), and if selected (YES in S2503), outputs the voice again (S2502). On the other hand, if the “voice” key is not selected (NO in S2503), the problem output processing unit 32 determines whether the “search / decision” key is selected (S2504), and the “search / decision” key is determined. When selected (YES in S2504), an answer is displayed (S2505). As shown in FIG. 26 (b), the answer display screen 2602 displays "Answer is displayed. Was the spelling memorized?" And the correct spelling is displayed. If it is possible to memorize, the “↑” key is selected, and if not, the “↓” key is selected to display the memorized / unmemorized information of the user.

  When the answer receiving unit 33 receives an input of the “↑” key or the “↓” key (YES in S2506), the answer receiving unit 33 updates the wordbook data stored in the question word storage unit 34 (S2507). . This completes the spelling test process.

  Next, processing in the semantic test will be described with reference to FIGS. FIG. 27 is a flowchart showing the flow of the semantic test process. FIG. 28 shows a display screen in the semantic test, FIG. 28 (a) shows a question display, FIG. 28 (b) shows an answer display, and FIG. 28 (c) shows a question display. It is a figure which shows an answer input display.

  When performing a semantic test, first, the question output processing unit 32 displays a question display screen (S2701), and outputs the voice of the question target word or compound / derivative word (S2702). On the question display screen 2801, as shown in FIG. 28 (a), “Remember the meaning of the next spell” is displayed, and an answer is displayed when the “Search / Determination” key is selected. Is displayed.

  Next, the question output processing unit 32 determines whether or not the “search / decision” key is selected (S2504). When the “search / decision” key is selected (YES in S2504), an answer display is performed. (S2505). On the answer display screen 2802, as shown in FIG. 28 (b), the meanings of the questions are displayed. In the example shown in FIG. 28B, “apple” or the like that means “Apple” is displayed.

  Further, the question output processing unit 32 determines whether or not the “search / decision” key has been selected (S2705). When the “search / decision” key is selected (YES in S2705), an answer input display is performed. (S2706). On the answer input display screen 2803, as shown in FIG. 28 (c), “Would the meaning of the spelling be memorized?” Is displayed, the spelling is displayed, and the user can memorize it. For example, the “↑” key is selected, and if not, the “↓” key is selected to display the memorized / unmemorized information of the user.

  When the answer receiving unit 33 receives an input of the “↑” key or the “↓” key (YES in S2707), the answering unit 33 updates the word book data stored in the question word storage unit 34 (S2708, Learning achievement status information recording step). Specifically, when an input of the “↑” (remembered) key is received, a learning achievement status flag (word) 415 corresponding to the headword, compound / derivative, or phrase, a learning achievement status flag (composite / The flag of the derived word) 416 or the learning achievement status flag (phrase) 417 is set to “1”. This completes the semantic test process.

(Learning progress saving process)
Next, the learning progress saving process will be described with reference to FIGS. First, the flow of the learning progress saving process will be described with reference to FIG. FIG. 29 is a diagram for explaining the learning progress saving process, FIG. 29A is a flowchart showing the flow of the learning progress saving process, and FIG. 29B shows the initialization of the search pointer. It is a figure for doing.

  First, the learning result processing unit 22 initializes a search pointer for searching word book data stored in the question word storage unit 34. Here, the initialization of the search pointer means positioning the search pointer to the first word book data among the word book data stored in the question word storage section 34, as shown in FIG. 29 (b). That means. Then, the learning result processing unit 22 checks the learning status achievement flag of the word book data (S2902), the learning achievement status flag (word), the learning achievement status flag (composite / derivative word), and the learning achievement status flag (spoken phrase). Whether all the flags are “1” or not is determined (S2903). If all the flags are “1” (YES in S2903), the learning result processing unit 22 sets the learning level of the word book data to “+1” (S2904).

  Thereafter, the learning achievement status flag (word), learning achievement status flag (composite / derivative word), and learning achievement status flag (phrase) in the word book data are initialized (S2905), and the learned flag 418 is set to "1" ( In step S2906, the search pointer is counted up (S2907). If the position of the search pointer after counting up is the end of the data (YES in S2908), the contents of the word book data stored in the question word storage unit 34 are stored in the word book data storage unit 42. The written word book data is updated (S2909).

  On the other hand, if the flag is not “1” for all in step S2903 (NO in S2903), the search pointer is counted up (S2907). This completes the learning progress saving process.

  Next, with reference to FIG. 30, the update of the word book data stored in the word book data storage unit 42 to the contents of the word book data stored in the question word storage unit 34 will be described. . As shown in FIG. 30, when wordbook data AA, BC, CD, EF, EG, EH, IJ, KL, KM, and LL are stored in the question word storage 34, the wordbook data is stored. These word book data stored in the unit 42 are updated. That is, the word book data AA, BC, CD, EF, EG, EH, IJ, KL, KM, and LL stored in the question word storage unit 34 are stored in the word book data storage unit 42. The word book data AA, BC, CD, EF, EG, EH, IJ, KL, KM, and LL are overwritten.

(Progress display process)
Hereinafter, the progress display process will be described with reference to FIGS.

  Here, the progress display in the present embodiment means that the user's learning progress is displayed in a graph by word, compound / derivative, and phrase. Specifically, first, on the screen for selecting a test method (step S611 in FIG. 6B), the progress of learning so far is comprehensively displayed for words registered in the word book. (FIG. 31). Second, on the screen displaying each question during the execution of the test (step S613 in FIG. 6B), the progress status of the words, compound / derivative words, and phrases that are presented on the screen are displayed (FIG. 13). ).

  The progress display process is executed under the control of the problem display processing unit 32. Of the display contents displayed by the problem display processing unit 32, the progress graph of each word, compound / derivative word, and phrase is generated by the progress display processing unit 24 to define the display contents, and based on this, a predetermined form is generated. To display the progress graph.

  The progress graph may be displayed in different colors for each word, compound / derivative, and phrase. Further, in the present embodiment, an example of displaying with a bar graph will be described, but the display form is not limited to a bar graph, and a display with a figure of another shape or a character such as a number indicating a ratio may be used. .

  First, the progress display on the screen for selecting a test method will be described with reference to FIG. FIG. 31 is a display screen example of a progress display on a screen for selecting a test method.

  As shown in FIG. 31, when selecting a test method (step S611 in FIG. 6B), a screen 3101 for displaying the overall learning progress of each word, compound / derivative, and phrase, A screen 3102 for displaying the learning progress can be switched and displayed by a “switch” key. The screen may be switched by selecting the [All words] tab or the [Wordbook test] tab at the top of the screen instead of the “Switch” key.

  Specifically, on the screen 3101, from the top of the screen, in the order of word, compound / derivative, and phrase, the ratio of those registered in the word book that are correct in the past test, that is, those that have been memorized, It is displayed as a bar graph along the horizontal direction of the screen. For example, in the top word graph, the percentage of the number of words that have been answered correctly in the past test, that is, the number of words that have been memorized, with respect to the total number of words registered in the word book is a bar graph along the horizontal direction of the screen. It is displayed as.

  Furthermore, on the screen 3101, the wordbook test mode can be selected. In the present embodiment, the word book test mode includes all word modes for testing all words registered in the word book, and a low learning level among the words registered in the word book. There is a low acquisition level mode that tests for words. The question processing unit 23 starts the word book test when the user selects the word book test mode on the screen 3101.

  Further, on the screen 3102, from the upper part of the screen, for each word registered in the word book, a bar graph indicating the ratio of words, compound / derivatives, and phrases that have been correctly answered in past tests, that is, memorized ones, It is displayed in a graph frame connected along the horizontal direction of the screen. Then, for each word, there is a graph display area in which the frame area of three bar graphs is connected in the horizontal direction to the right of the headword display, and the learning level of the headword is displayed to the right of that. Yes. The three bar graphs are a word graph indicating the progress status of the word, a composite / derivative graph indicating the progress status of the compound / derivative, and a phrase graph indicating the progress status of the phrase, respectively, from the left.

  Also, as shown in FIG. 13, on the question display screen, the progress status of the words, compound / derivative words, and phrases that are presented on the screen are displayed in the same form as the screen 3102 (FIG. 31).

  Next, the graph frame of the progress graph will be described. FIG. 32 is an explanatory diagram illustrating an example of a graph frame of a progress graph.

  The progress display processing unit 24 determines whether to display a graph frame (graph display area) of words, compound / derived words, and phrases according to the word book test setting. Specifically, for example, when all of words, compound / derivatives, and phrases are checked in the word book test setting, all graph frames of words, compounds / derivatives, and phrases, that is, graphs are displayed (see FIG. 32 (a)). Also, if the word, compound / derivative word is checked in the word book test settings, and the check of the phrase is removed, the graph frame of the word, compound / derivative is displayed, and the graph frame of the phrase is not displayed ( FIG. 32 (b)). In addition, if only the word is checked in the word book test setting, and the compound / derivative and phrase phrases are unchecked, only the word graph frame is displayed and the compound / derivative and phrase phrases are not displayed. (FIG. 32 (c)).

  Similarly, the progress display processing unit 24 does not display the graph frame, that is, the graph, even in the case of a word that does not have a compound / derivative word or phrase. Whether or not a compound / derivative word or phrase is present can be confirmed by the number of data in the word book data (compound / derivative word) 413 and the number of data (song phrase) 414 (FIG. 4A).

  Next, a method for creating a progress graph will be described. FIG. 33 is an explanatory diagram showing a progress graph creation method. Here, a method of creating a graph of words, compound / derivative words, and phrases will be described based on the data example shown in FIG.

  As for the word graph, since only one word can be registered in one word book data, the inside of the word graph frame is painted in accordance with the state of the learning achievement flag (word) 415 (FIG. 4A). That is, in the case of the example of FIG. 33A, “learning achievement status flag (word) = 1” and the word has already been learned, and therefore, the entire region in the graph frame of the word is painted in green. (FIG. 33 (b)).

  For compound / derivative words and phrases, the number of data of compound / derivative words and phrases that can be registered in one word book data differs depending on the entry word (word). Therefore, each graph frame (drawing area) is divided according to the number of compound / derivative words and phrase data, and the number of learning achievement status flags “1 (learned)” is filled from the left of the graph frame. That is, in the case of the example of FIG. 33A, the compound / derivative word is “number of data (composite / derivative word) = 3” and “learning achievement status flag (composite / derivative word) 101”. Since two of the compound / derivative words have been learned, the area of the two thirds from the left of the graph frame of the compound / derivative word is painted in blue (FIG. 33C). As for the phrase, “the number of data (phrase) = 4” and “learning achievement status flag (phrase) 1101”, and since three of the four phrases have been learned, 4 from the left of the graph frame of the phrase The three-minute area is painted orange (FIG. 33 (d)).

  Next, how the progress graph changes as learning progresses will be described. FIG. 34 is an explanatory diagram showing changes in the progress graph accompanying the progress of learning. An example shown in FIG. 34 is a case of a headword (word book data) including one word, three compound / derivative words, and four phrases.

  As shown in FIG. 34, since the word book test is not performed immediately after the start of learning, the learning achievement status flags 415, 416, and 417 for words, compound / derived words, and phrases are all “0”. Therefore, the inside of the graph frame is not filled, and the learning level 412 is also “1”, so “level 1” is displayed.

  After that, when learning progresses and corrects in the word book test, the learning achievement status flags 415, 416, and 417 of the corresponding word, compound / derivative, and phrase are rewritten to “1”, and the word, compound / derivative The area corresponding to the number of data that has been memorized in the graph frame of the phrase is filled.

  When the learning achievement status flags 415, 416, and 417 of the word, compound / derived word, and phrase are all “1” in the learning of “level 1”, the learning level 412 is “1”. In addition to being rewritten as “2”, the learning achievement status flags 415, 416, and 417 of the word, compound / derivative, and phrase are cleared to “0” for all data. As a result, in the progress graph immediately after the start of “level 2”, the inside of the graph frame is not filled and “level 2” is displayed.

  Thereafter, the same is true, and the correct word list test corrects the corresponding word, compound / derivative, and phrase learning achievement status flag 415/416/417 to “1”. Each graph frame of the phrase is filled with an area corresponding to the number of data memorized for the total number of data. When all of the learning achievement status flags 415, 416, and 417 of the word, the compound / derivative word, and the phrase are “1” for all the data, the learning level 412 is incremented by 1, and the word, Since the learning achievement status flags 415, 416, and 417 of the compound / derivative word and phrase are cleared to “0” for all the data, the progress graph is also initialized to a state without filling.

  In this way, whether or not each data is memorized by the learning achievement status flag is recorded, and the acquisition level indicating the level of acquisition is recorded for each headword, and acquired when learning of the word, compound / derivative, and phrase is completed. As the level is raised, the learning achievement status flag is cleared. As a result, the wordbook test can be performed with priority given to poorly learned words, compound / derivative words, and phrases.

  In the above description, since the learning achievement status for each headword and related words is recorded in the form of a flag (learning achievement status flag), all learning achievements associated with the headword when the learning level is increased. The status flag, that is, the learning achievement status flag for the headword and all related words associated with the headword is cleared to indicate that it is not memorized. However, the learning achievement status for each headword and related word may be recorded in a data format that can manage a plurality of stages, not a flag. In this case, when raising the acquisition level, without clearing the information (learning achievement status information) indicating the learning achievement status for each headword and related word, the headword or related word is memorized at the next learning level. At this time, the learning level for each headword or related word may be increased by a predetermined number, for example, by adding 1 to the numerical value. In this way, for example, the learning achievement status information for each headword and related word is numerical information added as 1 → 2 → 3, and if it is memorized three times (that is, associated with the headword) When all the learning achievement status information obtained is “3”), the acquisition level management such as increasing the acquisition level by 1 becomes possible.

  Next, the details of the process of displaying the screen 3101 for displaying the overall learning progress will be described with reference to FIG. FIG. 35 is an explanatory diagram of processing for displaying a screen 3101 for displaying the overall learning progress, (a) is a flowchart showing the flow of processing, and (b) is an explanatory diagram showing an outline of word book data search. It is.

  First, when displaying the screen 3101 (FIG. 31), the problem output processing unit 32 displays a progress graph based on all the word book data stored in the word book data storage unit 42 on the progress display processing unit 24. Instructs to generate the data.

  In response to this instruction, the progress display processing unit 24 initializes the data of the total number and the achievement number of each word, compound / derivative word, and phrase (S3501, S3502, and S3503).

  Next, the progress display processing unit 24 moves the search pointer to the head of the word book data stored in the word book data storage unit 42 (S3504; FIG. 35 (b)).

  Then, the progress display processing unit 24 learns the number of data 413 and 414 (FIG. 4A) for each of the compound / derivative word and the phrase and the word, the compound / derivative word and the phrase from the word book data pointed to by the search pointer. The achievement status flags 415, 416, and 417 (FIG. 4A) are acquired (S3505).

  Then, the progress display processing unit 24 adds 1 to the total number of words. This is because only one word can be registered in one word book data. If the acquired learning achievement status flag (word) 415 is “1”, the achievement number of words is incremented by 1 (S3506).

  Further, the progress display processing unit 24 adds the acquired number of data (composite / derivative word) 413 to the total number of composite / derivative words. Further, the number of “1” included in the acquired learning achievement status flag (compound / derivative word) 416 is counted and added to the achievement number of the composite / derivative word (S3507).

  In addition, the progress display processing unit 24 adds the acquired number of data (phrase) 414 to the total number of phrases. Further, the number of “1” included in the acquired learning achievement status flag (phrase) 417 is counted and added to the number of achievements of the phrase (S3508).

  Thereafter, the progress display processing unit 24 repeats the above processing (S3505 to S3508) until the end of data is reached (NO in S3510) while advancing the search pointer (S3509). Whether or not it is the end of data can be determined, for example, by detecting that the word number is a predetermined value “0xFFFFFFFF” (FIG. 5D).

  The progress display processing unit 24 calculates when the search pointer reaches the end of the data, that is, when the processing of all the word book data stored in the word book data storage unit 42 is finished (YES in S3510). Based on the total number of words, compound / derivative words, and phrases, and the number of achievements, the ratio of the number of achievements to the total number is calculated for each word, compound / derivative word, and phrases, and in a shape according to the ratio A progress graph is displayed (S3511, S3512, S3513 (progress display processing step); screen 3101 in FIG. 31).

  Next, the details of the process of displaying the question display screen (FIG. 13) during the word book test will be described with reference to FIG. FIG. 36 is an explanatory diagram of a process for displaying a question display screen, where (a) is a flowchart showing the flow of the process, and (b) is an explanatory diagram showing an outline of a search for word book data for questions.

  First, when starting the word book test, the question output processing unit 32 moves the search pointer to the head of the question word data stored in the question word data storage unit 34 (S3601; FIG. 36 (b) )).

  Then, the problem output processing unit 32 acquires the headword 410 from the word book data pointed to by the search pointer, and displays the character string on the question screen (S3602).

  Next, the progress display processing unit 24 acquires a learning achievement status flag (word) 415 (FIG. 4A) from the word book data pointed to by the search pointer (S3603). Then, a word graph is displayed according to the value of the learning achievement status flag (word) 415 (S3604). Specifically, if the learning achievement status flag (word) 415 is “1”, the entire region in the word graph frame is filled, and if it is “0”, the word graph frame is not filled. .

  Further, the progress display processing unit 24 calculates the number of data (composite / derivative word) 413 (FIG. 4 (a)) and the learning achievement status flag (composite / derivative word) 416 (FIG. a)) is acquired (S3605). Then, the number of “1” (number of memorized) included in the acquired learning achievement status flag (composite / derivative word) 416 is counted, the ratio to the number of data (composite / derivative word) 413 is calculated, and the ratio is calculated. The compound / derivative word graph is displayed in a corresponding shape (S3506). Specifically, the graph frame of the compound / derivative word is displayed in the above ratio.

  Further, the progress display processing unit 24 obtains the number of data (phrase) 414 (FIG. 4A) and the learning achievement status flag (phrase) 417 (FIG. 4A) from the word book data pointed to by the search pointer. (S3607). Then, the number of “1” (number of memorized) included in the acquired learning achievement status flag (phrase) 414 is counted, the ratio to the number of data (phrase) 417 is calculated, and the phrase graph is formed in a shape according to the ratio. Is displayed (S3508). Specifically, the graph frame of the phrase is filled and displayed by the above ratio (S3603 to S3608, progress display processing step).

  Next, the progress display processing unit 24 acquires the acquisition level 412 (FIG. 4A) from the word book data pointed to by the search pointer (S3609) and displays it in the vicinity of the progress graph (S3610).

  Thereafter, the problem output processing unit 32 and the progress display processing unit 24 perform the above processing (S3602-S3610) while advancing the search pointer (S3611) until the end of the data is reached, that is, the question word storage unit 34. The process is repeated until the process of 10 questions read in is completed (NO in S3612). Whether or not it is the end of data can be determined, for example, by detecting that the word number is a predetermined value “0xFFFFFFFF” (FIG. 5D).

  In addition, the display method of the progress graph on the screen 3102 (FIG. 31) can also be displayed by the same process as the above process.

  The present invention is not limited to the above-described embodiments, and various modifications can be made within the scope shown in the claims. That is, embodiments obtained by combining technical means appropriately modified within the scope of the claims are also included in the technical scope of the present invention.

(Processing by software)
Finally, each block of the electronic dictionary 1, particularly the word book data registration unit 21, the learning result processing unit 22, the question processing unit 23, the progress display processing unit 24, the question word extraction unit 31, question output processing of the control unit 13 The unit 32, the answer receiving unit 33, the display switching unit 35, and the question display unit 36 may be realized in hardware by a logic circuit formed on an integrated circuit (IC chip), or may be a central processing unit (CPU). unit) may be implemented in software.

  In the latter case, the electronic dictionary 1 includes a CPU that executes instructions of a control program that realizes each function, a ROM (read only memory) that stores the program, a RAM (random access memory) that expands the program, the program, A storage device (recording medium) such as a memory for storing various data is provided. An object of the present invention is to provide a recording medium in which a program code (execution format program, intermediate code program, source program) of a control program of the electronic dictionary 1 which is software that realizes the above-described functions is recorded so as to be readable by a computer. This can also be achieved by supplying the electronic dictionary 1 and reading and executing the program code recorded on the recording medium by the computer (or CPU or MPU (microprocessor unit)).

  Examples of the recording medium include tapes such as a magnetic tape and a cassette tape, a magnetic disk such as a floppy (registered trademark) disk / hard disk, a CD-ROM (compact disc read-only memory) / MO (magneto-optical) / Disks including optical discs such as MD (Mini Disc) / DVD (digital versatile disk) / CD-R (CD Recordable), cards such as IC cards (including memory cards) / optical cards, mask ROM / EPROM (erasable) Uses semiconductor memory such as programmable read-only memory (EEPROM) / EEPROM (electrically erasable and programmable read-only memory) / flash ROM, or logic circuits such as PLD (Programmable logic device) and FPGA (Field Programmable Gate Array) be able to.

  The electronic dictionary 1 may be configured to be connectable to a communication network, and the program code may be supplied via the communication network. The communication network is not particularly limited as long as it can transmit the program code. For example, the Internet, intranet, extranet, LAN (local area network), ISDN (integrated services digital network), VAN (value-added network), CATV (community antenna television) communication network, virtual private network (virtual private network), A telephone line network, a mobile communication network, a satellite communication network, etc. can be used. The transmission medium constituting the communication network may be any medium that can transmit the program code, and is not limited to a specific configuration or type. For example, infra-red data association (IrDA) or remote control such as IEEE (institute of electrical and electronic engineers) 1394, USB, power line carrier, cable TV line, telephone line, ADSL (asynchronous digital subscriber loop) line, etc. , Bluetooth (registered trademark), IEEE 802.11 wireless, HDR (high data rate), NFC (Near Field Communication), DLNA (Digital Living Network Alliance), mobile phone network, satellite line, terrestrial digital network, etc. Is possible.

  Since it is possible to manage whether or not it has been memorized for each headword and each related word, it is suitable for a device for testing a word or the like, for example, an electronic dictionary with a test function.

1 Electronic dictionary 11 Key operation part (input acceptance part)
12 Display part 22 Acquisition result processing part (Acquisition level management means)
24 progress display processing unit (progress display processing means)
33 Answer receiving part (learning achievement status information recording means)
36 Question display section (problem display means)
41 Dictionary data storage unit 42 Word book data storage unit (question data storage unit)

Claims (7)

The headword and the meaning of the headword are stored in association with each other, the related word that is a word related to the headword and the meaning of the related word are stored in association with each other, and the headword and In an electronic dictionary that includes a dictionary data storage unit that stores one or more related words in association with each other, and displays a problem on a display unit,
A question data storage unit for storing headwords that can be given as the above problem;
Problem display means for displaying either the headword stored in the question data storage section and the related word associated with the headword on the display section as the problem;
An input receiving unit that receives an input as to whether or not the user has memorized the headword or related word that has been presented,
The question data storage unit individually indicates that the headword has been memorized in association with the headword, and that one or more related words associated with the headword have been memorized. Learning achievement status information can be stored,
When the input accepting unit accepts memorized input, learning achievement status information recording means for recording learning achievement status information indicating that the headword or related word is memorized in the question data storage unit;
For one or a plurality of headwords and / or related words, the learning achievement status information is read from the question data storage unit, the ratio of learning achievement status information indicating that it has been memorized is obtained, and the ratio is calculated as described above. An electronic dictionary comprising progress display processing means for displaying on a display unit. The question data storage unit can store the learning level of the user of the headword in association with the headword,
When learning achievement status information indicating that a headword and all related words associated with the headword have been memorized are stored in the question data storage unit, they are associated with the headword. The electronic dictionary according to claim 1, further comprising learning level management means for increasing the acquired learning level by a predetermined number.   The progress display processing means reads out learning achievement status information indicating that the related words associated with one headword have been memorized from the question data storage unit, and all the progress words are associated with the headword. The ratio of the related words to which the learning achievement status information indicating memorization is added among the related words is obtained, and the ratio is displayed on the display unit. The electronic dictionary described.   The progress display processing means achieves learning indicating that a plurality of headwords stored in the question data storage section and related words associated with the headword have been memorized from the question data storage section. The situation achievement is read out by reading out the situation information and obtaining the ratio of the entry word with the learning achievement situation information indicating that it has been memorized among the entry words and indicating that it has been memorized among the related words. 3. The electronic dictionary according to claim 1, wherein a ratio of related words to which information is added is obtained, and the obtained ratio of head words and related words are displayed on the display unit.   5. The headword stored in the question data storage unit is associated with a headword stored in the dictionary data storage unit. Electronic dictionary.   6. The related word according to claim 1, wherein the related word is at least one of a derivative of the headword, a compound word including the headword, and a phrase including the headword. Electronic dictionary described in. The headword and the meaning of the headword are stored in association with each other, the related word that is a word related to the headword and the meaning of the related word are stored in association with each other, and the headword and In a method for controlling an electronic dictionary, comprising a dictionary data storage unit that stores one or more related words in association with each other, and displaying a problem on a display unit,
From the question data storage unit that stores headwords that can be given as the question, a question display step for displaying either the headword or the related word associated with the headword on the display unit as the question;
Learning achievement that individually indicates that the headword or related word has been memorized when the input reception unit that accepts whether or not the user has memorized the headword or related word that has been questioned is accepted A learning achievement status information recording step for recording status information in association with the headword in the question data storage unit;
For one or a plurality of headwords and / or related words, the learning achievement status information is read from the question data storage unit, the ratio of learning achievement status information indicating that it has been memorized is obtained, and the ratio is calculated as described above. A method for controlling an electronic dictionary, comprising: a progress display processing step displayed on a display unit.

Images