JPS63137289A - Electronic type learning machine - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

[Detailed description of the invention] [Industrial application field] The present invention relates to an electronic learning machine.

[Summary of the Invention] This invention determines whether an answer is correct or incorrect when inputting an answer to a question in an electronic learning machine, and updates the difficulty level of the question according to the determination result, thereby specifying the question. This allows the questions to be asked according to the level of difficulty given.

[Prior Art] Conventionally, when a question key on a keyboard is operated, a kanji (question) is displayed one space at a time on a liquid crystal display panel each time the question key is operated, and then the question is answered by operating a kana character key. An electronic learning machine is known that, when inputting the decipherment (reading) of a word, determines whether it is correct or incorrect and displays the determination result.

[Problem to be solved by the invention] However, in this type of electronic learning machine, when an answer to a question is input, it only determines whether the answer is correct or not and displays the result. The students often made mistakes by respelling the pronunciation of the words over and over again, making it impossible to improve the learning effect step by step.

This invention was made against the background of the above-mentioned circumstances, and its purpose is to provide an electronic learning machine that can improve learning effects step by step.

[Means for Solving the Problems] Fig. 1 is a block diagram of the machine part of the present invention. 1 in Fig. 1 is a problem information storage means for storing questions and answers in correspondence. It consists of dictionaries and dictionaries for converting Japanese to foreign languages. 2 is a display means such as a liquid crystal display panel, and the question 8 read out from the question information storage means 1 is displayed.
(for example, kanji). 3 is an input means such as a keyboard, and the answer to the question displayed on the display means 2 (for example,
For kanji, enter the reading.

Reference numeral 4 denotes a determining means for determining the correctness or wrongness of an answer input to a question, which reads out the answer to the question displayed on the display means 2 from the question information storage means 1 and compares it with the answer input from the input means 3. , determine whether the input answer is correct or incorrect. Reference numeral 5 denotes an updating means for updating the difficulty level information of the question according to the judgment result of the judging means 4. For example, the difficulty level of the question is determined by subtracting the initial value every time a correct answer is given. Reference numeral 6 denotes a difficulty level information storage means for storing the difficulty level information updated by the updating means 5 in correspondence with each question in the question information storage means 1. 7
is a specifying means for specifying the difficulty level, for example, a numerical value indicating the difficulty level is entered by key operation.

Next, the correspondence between each element for solving one problem and each element of the embodiment will be listed.

Question information storage means 1... Predetermined storage area in the learning dictionary Display means 2... Display section 21 Input means 3... Input section 11 Judgment means 4. Updating means 5... CPU 12 Difficulty level information storage means 6... Predetermined storage area designation means 7 in the learning dictionary 17... Input section 11. Made by CPU12
First, the questions in the question information storage means 1 are read out by operating a question key or the like and displayed on the display means 2. Check the displayed content and enter the answer to the displayed question using input means 3.
1, the determining means 4 compares the input answer with the answer to the applied question and determines whether the input answer is correct or incorrect. In accordance with this determination result, the updating means 5 updates the difficulty level information of the question stored in the difficulty level information storage means 60. When assigning a question, the difficulty level of the question is updated so that if a correct answer is obtained, the numerical value is decreased, and if an incorrect answer is obtained, the numerical value is increased.

If you input the answer to each question several times in this way, the past correct/wrong status for each question will be accumulated as the person's difficulty level, so by specifying the difficulty level with the specifying means 7, you can You can ask questions according to the specified difficulty level.

[Example] Hereinafter, the present invention will be specifically described based on an example shown in FIGS. 2 to 6. Note that this embodiment shows an example applied to a Japanese word processor.

Figure 2 shows the basic block circuit diagram of a Japanese word processor that can also be used as a kanji learning machine.11 in the figure is the input section of this word processor, which is usually provided on the keyboard. In addition to the character keys KA and function keys KB, question keys KC1 and answer keys KD are provided. Here, the question key KC displays the question (
The answer key KD is a key for specifying the input of an answer, and is used when this word processor functions as a learning machine. Thus, key human power signals outputted from the input section 11 corresponding to the operation keys are taken into the CPU (central processing circuit) 12 and processed according to the input processing program.

The CPU 12 executes normal document creation processing when used as a word processor, and executes question answering processing when used as a kanji learning machine. The CPU 12 is usually equipped with a kana-kanji conversion dictionary 13, a text memory 14, and a work RAM 15. ROM1B
In addition, a learning dictionary @17 is connected.

As shown in Figure 3, the kana-kanji conversion dictionary 13 stores the pronunciations of kanji, and the zero-sentence memory 14, which is used when converting kana input during document creation into kanji, is used to store the readings of kanji. In this embodiment, an external storage device (for example, a floppy disk drive 21) 18 can be used for storing one document. Note that the external storage device t18 is connected to the CPU 12 via the interface section 19, so that data writing and reading operations are controlled. Further, the work RAM 15 is a memory configured with address pointers, transfer registers, etc., and the ROM 16 is a memory that configures a character generator and stores program data for system control.

Reference numeral 17 is composed of a RAM, and has a memory configuration as shown in FIG. That is.

The learning dictionary 17 is used when this word processor is used as a kanji learning machine, and in addition to memorizing readings and kanji (including idioms) in correspondence, it also stores the corresponding readings and kanji (including idioms). An area is provided to store "true/false" and "difficulty level" of the question. That is, the memory ml stores the reading as the answer to the question, the memory m2 stores the kanji as the question, and the memory m3 stores the "correct/incorrect" value corresponding to the kanji (question). The "difficulty level" of each question is also stored in the memory m4. Here, the "correct/incorrect" memory m3 each has 2
Bit configuration: decimal numbers “0”, “1”, “2”, '
3" is stored as a binary number. "θ" is the initial state, that is, when the power is turned on or when the problem is restarted from the beginning, "1" is the reading input by the operator as an answer. ``2'' indicates that the answer to the question is correct; ``3'' indicates that the question is already posed as a question.

In addition, each memory m4 of "difficulty level" consists of 2 bits,
It stores data from decimal numbers "0" to "3" in binary numbers, and the larger the number, the more difficult it is.The "difficulty level" is initially set to "3". However, the value is updated according to the correct/incorrect determination result for the question, so that the value decreases each time a correct answer is given and the value increases each time an incorrect answer is given.

Note that the CPU 12 drives the printing unit 20 configured with a thermal printer to print the created document data on recording paper, or reads only questions, only answers, or questions and answers from the learning dictionary 17 and prints them on recording paper. Controls printing operations such as printing a list. Further, the CPU 12 drives a display unit 21 constituted by a liquid crystal display device to display created document data, questions, input answers, etc.

I - Process of registering kanji into the learning dictionary 17〉 First, in order to use this word processor as a kanji learning machine, register the necessary kanji and their pronunciations from the contents of the kana-kanji conversion dictionary 13 into the learning dictionary 17. I'll keep it.

In this case, a mode key (not shown) provided on the input unit 11 is operated to set the mode to "registration mode to learning dictionary 17." In this state, when a display key (not shown) provided on the input section 11 is operated, kanji and their readings are sent from the kana-kanji conversion dictionary 13 to the display section 21 and displayed in sequence.

Visually check this display content, and display the learning dictionary 17 on the display section 21.
When a registration key (not shown) provided in the input section 11 is operated when the kanji and reading that you wish to register are displayed, the displayed content at that time is transferred to the learning dictionary 17 and stored. be done.

When a kanji as a question is registered in the learning dictionary 17 in this way, the learning dictionary 17 correspondingly has a storage area that constitutes a "correct/incorrect" memory m3 and a 'difficulty level' memory m4. At the same time, "O" is set as the initial value of "correct/incorrect" in memory m3, and "3" is set as the initial value of "difficulty level" in memory m4. etc. are displayed, the operator can sequentially register the required kanji and their readings into the learning dictionary 17 by operating the registration key.

Question and answer processing for kanji learning> Next, a case will be described in which kanji learning is performed using the learning dictionary 17 in which necessary kanji are selected from the kana-kanji conversion dictionary 13 and registered. In this case, first, the mode key of the input unit 11 is operated to select the "use mode (learning mode) of the learning dictionary 17".

In this learning mode, the difficulty level and number of questions to be asked are entered by key operation from the input section 11.0 For example, questions with difficulty level "3", that is, the most difficult questions, are given for 20 periods. Specify the to-do by inputting "3" and "20", and then operate the 1 question key KC. FIG. 5 is a diagram showing a question processing flow executed each time the question key KC is operated.

First, when the question key KC is operated for the first time after setting the learning mode (step AI), the work RAM 15
Learning dictionary 17 for the previous exam questions held in
The location address of is read out, and the learning dictionary specified by this location address! The difficulty level of the question is read out from 7 (steps A2, A3), and the difficulty level just read out from the learning dictionary 17 is compared with the inputted difficulty level (step A4), and as a result, it is determined that the two match. If it is not obtained, the location address of the learning dictionary 17 is plus "
1'' and the address is updated (step A6).
), in this case, in order to cyclically address the contents of the learning dictionary 17, the address after the last address is returned to the first address when updating this address. By updating the address in this way, if the updated address becomes the position address of the previous question, then if one copy of the contents of the study seat s17 is re-addressed, that is, the address of the study dictionary 17 This is a case where the designation has been made once, but if it is before then, it is detected in step A7 and the process returns to step A3. Such actions are repeated until the difficulty level equivalent to the input designation is retrieved from the learning dictionary 17. As a result, if the corresponding difficulty level is retrieved from the learning dictionary 17 (step A5),
The corresponding correct/incorrect flag is read from the learning dictionary 17, and it is checked whether it is "0" or not. Here, if the correct/incorrect flag is not "0", it means that the question has already been asked or the answer has been answered, so the process returns to step A6 and the above-mentioned search operation continues, but if the correct/incorrect flag is
If so, proceed to step 88, and the corresponding kanji is read out from the learning dictionary 17 and displayed (asked) as a question. Thereafter, the learning dictionary 17 corresponding to the kanji that has been asked is read out from the learning dictionary 17 and displayed as a question.
The correct/incorrect flag within is set to 3".

It is shown that the question has been asked (Step A9)
, When one question is asked in this way, rlJ is subtracted from the input 8 number "20" and the number of questions for one becomes "19" (step Al0). As a result, the next step All
Then, it is checked whether the number of questions is "0", that is, whether the specified number of questions have been asked. Here, if the specified number of questions have not been asked, the process advances to the next step A12, and the display area 21 is checked to see if there is a remaining display area where questions can be displayed. In this embodiment, it is checked whether kanji for five subjects are displayed. In this way, in this embodiment, 58 worth of Kanji characters can be displayed simultaneously on the display section 21, but at first, only the Kanji characters for one title are displayed on the display section 21, so the process returns from Step A12 to Step A6. If, for example, a maximum of five kanji characters are displayed on the display section 21 in the display section, this is detected in step Ai2'j, and the display section 21 displays "Next". After the guidance message "There is a problem" is displayed (step A13) and the guidance message "please enter the answer" (step A14) is displayed, the process exits from this flow.

After confirming the guidance display of 'Please enter your answer', input the reading of the displayed kanji as the answer to the question from the input section 11, and operate the execution key.The following 1 is displayed. Then, after inputting the last answer to the displayed question, if you operate the answer key KD, the operation according to the flow shown in Figure 6 will be executed. be done.

That is, the input answer and the pronunciation of the question are compared, and a determination is made as to whether it is correct or incorrect (step B1). If the result of this determination is that the input answer is incorrect, a corresponding action is taken. After the correct/incorrect flag is set to "2", the correct pronunciation is displayed (steps B3 and B4), and if the answer is correct, "1" is set as the corresponding correct/incorrect flag. (Step B2), so if the answer is incorrect as a result of the correct/incorrect determination, the correct reading will be displayed in parallel with the incorrectly input reading, so the operator can By checking the displayed content, it is possible to identify whether the answer is correct or incorrect. Such processing is performed in the same way for all displayed problems. and the correct/correct answer for all the displayed problems.
When an erroneous determination is made and processing according to the determination result is completed, this is detected in step A5 and the process proceeds to step A6, where the presence or absence of an all-questions-completed flag, which will be described later, is checked. This all-questions-completed flag indicates the number of questions (20 questions) that were input before the question key KC was operated as described above.
This is set when the last question is asked, and the all-question completion flag is currently turned off, so we exit from this flow for now. For example, 5 displayed like this
When the answers to each of the 1i11 questions are input in sequence, a determination is made as to whether the answer is correct or incorrect, and the result of the determination is set in the corresponding correct/incorrect flag of the learning dictionary 17.

However, to display the next question, press the question key KC again.
operate. Then, in response to the operation of the 1 question key KC, the flow shown in FIG. 5 is started again.

In this case, since this is the second question key KC operation, this is detected in step A1 and the process proceeds to step A6.
The location address of the learning dictionary 17 is updated. Then, the learning dictionary 17 is searched for 58 unfiled questions having a difficulty level similar to the input difficulty level and displayed on the display unit 21. and.

After entering the answers to this question in sequence, use the answer key KD.
When is operated, the flow shown in FIG. 6 is started again, and the input answers are sequentially judged as correct or incorrect.

In this way, each time the question key KC is operated, questions are displayed for 5 minutes, so if the number of questions is set to 20 minutes as described above, you only need to operate the question key KC 4 times. In this case, if the designated number of problems with the designated difficulty level "3" is not registered in the learning dictionary 17, if the number is less than 20, then that number of problems are displayed, and then the process starts from step A7. Proceed to step A15, work RA
The all problem completion flag in M15 is set. and,
The current position address of the learning dictionary 17 is saved to the learning dictionary 17 as the previous position and address (step A16);
Thereafter, in step A14, a no-sign message "Please enter your answer" is displayed. In addition, the specified difficulty level “3”
Even if 21 or more questions of H have been registered in the learning dictionary 17, this will be detected in step All after the specified number of questions have been displayed, and as in the case above, Set all problem completion flag (step A1
5), address saving (step A16) and guidance display (step A17) are performed.

After the all-problem completion flag is set in the work RAM 15 in this way, when the flow shown in FIG. 6 is entered by operating the answer key KD, the step At B6, the presence of the all-questions-completed flag is detected. Then, in step B7, the correct/
The correct answer rate is calculated based on the error flag (step B7
), and the correct answer rate is calculated by dividing the total number of questions answered by the number of questions answered correctly. Then, in the next step B8, a score is determined and displayed based on the correct answer rate determined in this manner. Next, the next step B9
The difficulty level of the question is updated according to the correct/incorrect determination result. If the correct/incorrect flag corresponding to each question is “l” (correct), the corresponding difficulty is minus “1”, and if it is “2” (incorrect), the corresponding difficulty is The difficulty level is increased by +rlJ. Note that the difficulty level is updated so that 0≦difficulty≦3.

In other words, if it is larger than 03", it is "3", and
If it becomes smaller than "0", it remains "O".

Therefore, in the next step BIO, the contents of the learning dictionary 17 are printed. For example, only the questions asked, only the answers,
Questions and answers, correct questions and answers.

By specifying incorrect questions and answers, the specified contents are printed in a list. Then, in the next step Bll, all correct/incorrect flags corresponding to the question that has just been asked are set to "3", thereby indicating that the question has already been asked. Finally, the all-problem completion flag in the work RAM 1S is cleared.

If, as a result of answering a question with difficulty level "3", the user does not get a very good score, the difficulty level is lowered and an easier question (for example, difficulty level "2") is specified.

In this case, if you answer a question with difficulty level ``3'' and the answer is correct, the difficulty level of the question will change from ``3'' to ``.
2", but since the correct/incorrect flag for this question is set to 3", it will not be asked this time.

In addition, if you want to restart the problem from the beginning, input section 1
When a question reset key (not shown) provided at 1 is operated, all correct/incorrect flags for each question are cleared.

In this case, the difficulty level is not cleared and remains as it is.

In this way, in this embodiment, when an answer is input to a question, the difficulty level is updated according to the correct/incorrect determination result, so that the question is asked according to the specified difficulty level. be able to. As a result, kanji learning can be
Since it can be done according to the situation of the error, that is, the past level, the learning effect is extremely high. In addition, in this embodiment, by learning kanji using a kana-kanji conversion dictionary provided in a Japanese word processor,
It is possible to effectively utilize the huge Kana-Kanji conversion dictionary.

In addition, in the above example, the difficulty level is set to "θ" to "3".
Although the number of stages can be increased further, the difficulty level is updated by +/-1 for each correct/incorrect answer. If there are consecutive correct/incorrect results, the rate of updating the difficulty level may be increased.

Further, in the above embodiment, the learning dictionary 17 is created by reading arbitrary contents from the kana-kanji conversion dictionary 13, but the kana-kanji conversion dictionary 13 may be provided with an area for storing the difficulty level and stored in this area.

Furthermore, in the above example, kanji are displayed as questions and readings are input as answers, but readings may be displayed as questions and kanji as answers. In a translation machine that has a dictionary for word conversion,
The questions may be in Japanese and the answers may be in English, or the questions may be in English and the answers may be in Japanese.

[Effects of the Invention] As described in detail above, according to the present invention, in an electronic learning machine, when an answer to a question is input, it is determined whether the answer is correct or incorrect, and the difficulty or difficulty of the question is determined according to the determination result. By updating the level, questions can be asked according to the specified difficulty level.

It has the effect of greatly increasing the learning effect.

[Brief explanation of the drawing]

FIG. 1 is a functional block diagram of this invention, FIGS. 2 to 6 show an embodiment of this invention, and FIG. 2 is a basic block circuit diagram of a Japanese word processor to which this invention is applied.
3rg is a configuration diagram of the Kana-Kanji conversion dictionary 13 shown in Figure 2, Figure 4 is a configuration diagram of the learning dictionary 17 shown in Figure 2, and Figure 5 shows the operation when the question key KC is operated. Flowchart FIG. 6 is a flowchart showing the operation when answer key KD is operated. 11...Input section, 12...CPU, 1
3...Kana-Kanji conversion dictionary, 15...Work RAM, 17...Learning dictionary. Patent applicant: Casio Computer Co., Ltd.

Claims (1)

[Scope of Claims] Question information storage means for storing questions and answers in correspondence; display means for displaying the questions read from the question information storage means; and display means for displaying the questions displayed on the display means. an input means for inputting an answer; and a determination device for reading out the answer to the question displayed on the display means from the question information storage means and comparing it with the answer input from the input means to determine whether the input answer is correct or incorrect. means, updating means for updating the difficulty level information of a question according to the determination result of the determining means, and difficulty level information for storing the difficulty level information updated by the updating means in correspondence with each problem in the problem information storage means. a difficulty level information storage means, and a designation means for designating a difficulty level, and the problem corresponding to the difficulty level designated by the designation means is read from the problem information storage means and displayed on the display means. An electronic learning machine characterized by: