JPS5931100B2 - electronic dictionary - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION The present invention relates to a data storage method for an electronic dictionary that outputs second language data corresponding to or related to first language input data. I L
The present invention relates to a data storage method for an electronic dictionary, which is realized by encoding and storing data necessary for providing dictionary functions such as phrases in a ROM, and controlling the data ROM by a microcomputer.

The data that constitutes a dictionary is enormous, and in order to fit more words into a ROM with limited capacity, data handling methods such as standardization of data compression methods and classification are important issues.

In addition, various problems occur, such as a delay in word search speed due to the increase in data. The present invention satisfactorily solves these problems. That is, an object of the present invention is to provide a data storage method for an electronic dictionary listed below. (1) In so-called electronic dictionaries that detect data corresponding to or related to input data through input operations on key input devices, data such as word part-of-speech meaning-changing phrases are encoded, and each data is assigned a predetermined delimiter code. Mnemonic method of remembering through.

(2) A storage method in which an address storing a modified word (inflected form) of the word is inserted into a storage area for storing the word, and an address storing the original form of the word is inserted into a storage area for the modified word.

(3) In (2), if the first variation and the second variation are the same, the storage method is to store them in common.

(4) A storage method in which word spellings are stored in alphabetical order, and the common part with the previous word is stored using a predetermined code.

(5) tion and im that are frequently grouped by syllables
A word spelling memorization method that memorizes syllables such as g as one code.

(6) A translation storage method in which the meaning (translation) of a word is stored as an address, and when supplementary meaning is required, the supplementary word is stored as a character code.

(7) Memorize words (Japanese) in alphabetical order, and words with the same first two letters are one block, and each word has the first two letters in common.
A word memorization method characterized by not inserting characters.

(8) A method of memorizing idioms in which the spelling of the word is set as a predetermined code and the idiom is memorized along with the character code.

First, a method of data compression, standardization, and classification according to the present invention will be explained.

(Standardization and memorization method of words) The dictionary uses the spelling, part of speech, meaning, pronunciation symbols, declensions, spellings of idioms, and meanings of idioms as elements that make up one word.

Each data is encoded by the method explained later and stored in the ROM in a standardized state as shown in Figure 1A.
is stored in. When one piece of ROM data (information that can be stored in one address) is 8 bits, it becomes possible to create 256 types of characters (one that represents one letter or symbol). Although the present invention can be configured regardless of the number of bits, the explanation will be based on an 8-bit configuration method. Table 1 shows the code assignment for each character.
As a result, there is a one-to-one correspondence between each code and a character, and by decoding the codes stored in the ROM, it is possible to express information regarding words in characters such as alphabets and katakana. Also, by making some codes special control codes, the complexity at the time of decoding can be simplified. To explain the diagram shown in FIG. 1A, the spelling of word 1 contains the spelling of the word compressed by the compression method described later.

2, the part of speech is stored in one byte (8 bits).

For example, PrOn. (pronoun) can be stored with the code (01000111), and when this code is read from the ROM, it can be determined that the part of speech of the word is a pronoun. When displaying it, select PrOn from that code. If you create the characters PrOn. Compared to the case where the characters are encoded and stored as they are, the capacity is reduced by 4 characters. 3 indicates a 2-byte address indicating the location where the meaning (translation) of the word is stored.

Therefore, when displaying the meaning of a word, specify the address indicated by the 2-byte code immediately after the part-of-speech code, and decode the katakana code stored at that location based on the method explained later. A character representing can be generated. 4 contains a code indicating a phonetic symbol, indicating that the code stored in position 5 represents a phonetic symbol.

In this case as well, the phonetic symbol (A
u. An attempt has been made to reduce the ROM capacity by indicating one code (such as ts). A variation code is stored at 6, and the code stored at 7 immediately after that indicates the address indicating the location where the spelling of the modified form of the word is stored.

This change code includes the first figure force, Cl shown in K, and 2 of C2.
There are several types, and when C1 is a case where the spelling of the past participle is the same, the address code indicating the location where the spelling is stored may be one, that is, two bytes. When C2 was in the past,
When past participles have different spellings, it is necessary to specify the address where each spelling is stored, so the first 2 bytes of the 4 bytes immediately after the C2 code specify the address where the past tense spelling was stored. The next two bytes indicate the address where the spelling of the past participle form is stored. An idiom code is stored at 8, indicating that the alphanumeric code stored at 9 forms an idiom.

10 also stores the meaning of the idiom as a katakana code.

The separation between 9 and 10 is determined by a code indicating alpha alphabets or a code indicating katakana, and there is no need to provide a special separation code.

The phrase spelling stored in 9 is composed of a * code and an alphanumeric code, and the spelling of the word searched in 1 is inserted at the * code search position.

This allows the data capacity to be reduced. When the spelling of word 1 is in the past tense or past participle form of the verb 癲u, the positions of 2 and 3 take the form of i, u, or aku in Figure 1.

In this case, P is placed in position 2 instead of the part of speech code. (The spelling of 1 indicates past tense) PP. (The spelling of 1 indicates the past participle form) WP. (The spelling of 1 indicates the past/past participle form) is stored, and 3 contains the address where the original form of this verb is stored. (At this time, the original form of the verb is stored in position 1.) If any of these three codes is detected during the search, the original form of the word and the distinction between past and past participle are displayed. With this method, spellings that have the original form of the word in 1 can be used, making it possible to compress the capacity. Next, when indicating the meaning of a word, if the meaning stored in the address specified in 3 is not sufficient and it is necessary to supplement the meaning, add 1 code after the address code and then List supplementary meanings.

By doing this, it is possible to enrich the meanings and to use the meanings stored in alphabetical order for Japanese-English searches. Figure 2 shows how to memorize word meanings. 21
is memorized by a code that has a one-to-one correspondence with katakana in meaning.

In 23, an address indicating the location where the spelling of the word corresponding to the meaning is stored is stored in 2 bytes.

As mentioned above, RO separates the spelling and meaning of a word.
The words are stored in the M area in alphabetical order, and the meaning is 5.
By arranging them in alphabetical order and connecting them with address codes, both English-Japanese and Japanese-English search functions can be realized in a sufficiently short time. (Compression mnemonic method for word spelling and meaning) (a) The method shown in Table 2 is used as a method for compressing word spelling.

Table 2 shows words whose spellings begin with the letter "S" and whose second spelling is 1a.゛S
a” heading (in this case, Sac
refice) is converted into the code shown in the character table in Table 1 and stored as is (in this case, it is 9 bytes).

When memorizing the spelling of the next word, compare it with the spelling of the previous word, compare how many words match from the beginning of the spelling, and replace the matching words with $n codes. . (n in the Sn code indicates the number of matching words.) Words that cannot be replaced with the $n code are also stored as alphanumeric codes. In the case of “Sad” in Table 2, the previous word is “3sacrif”
ice” and the two letters Sa match.
The word ``ad'' is stored in the form of 2 bytes called S2d. By doing this, 3 bytes are required to store ``Sad'', but only 2 bytes are required if stored as ``S2d''. In 4sad1y'' that appears next, the three characters of Sad match, and it is possible to replace even the three bytes of S3ly.

By doing this, it is only necessary to memorize the word in its original form only the word that appears first in the classification based on the first two letters of the word. All words other than this can be compressed using the above method. A specific method for retrieving English-Japanese and Japanese-English from data compressed by this method will be explained later. (b) Create a set of syllables and consider them as one chord to reduce the capacity.

For example, "InstructiOn"
Comparing the words On゛, the syllable ``TiOn'' is shared. In other words, the syllable ``TiOn'' is also frequently used, so ``TiOn'' is commonly used.
By converting ``On'' into one code and storing it, the capacity is compressed. In this way, frequently used syllables such as ``TiOn'' and ``Ing'' are treated as one code. Conversely, when searching in Japanese and English, When such a code is detected, the spelling of the word can be generated by decoding it into characters such as ``TiOn'' and ``Img.'' It is stored in a standardized state as shown in the figure.

In Figure 2 21, the meaning is memorized, and 22 shows the meaning of 21 and 2.
A code is included to distinguish between addresses 3 and 23, and to indicate the length (number) of address codes 23. 23 contains an address where the spelling of the word indicated by the meaning is stored.

One address is generated using 2 bytes.
If multiple words exist for one meaning, specify the length with code 2 and add address code 3.

For example, when the meaning of 1 is "spider", there are two words that correspond to this meaning: "ClOud" and "Spider".

Since the spellings of ``ClOud'' and ``Spider'' are stored in different addresses, two types of addresses for 3 are required, resulting in 4 bytes of data. (
(See Figures 14 and 15) The code 2 stores Y2 in Table 1 and indicates that there are two types of addresses that come next. Specific examples of meanings are shown in FIGS. 3A and 3B. 4 shown in A now
When we memorize the meaning of two words, it is realized in form B. The meaning is that the first two letters in common are considered to be one block, and the common words are stored together at the 匍 ((ro) position of B. The first character of B is the common word of A's ゛ide. By Y2, the words corresponding to the meaning of ``6 items'' are 6c0mpani0n'' and ``Partner''.
It shows that there are two words, ``, and the following address 1 shows the address where the former spelling is stored, and address 2 shows the address where the latter spelling is stored. ) The reason is A's ``eye minor'' minus the common word.The E1 code shows that the common word ``ai'' is the last in this sense, so the word ``eye minor'' is one type.E1 code The two bytes after ``Ai Minor'' indicate the address where the spelling of the word corresponding to ``Ai Minor'' is stored, and the ``Ai'' in the next (Ct position indicates that this one block is the ``Ai'' block. By compressing the first two letters of the meaning, it is possible to reduce the capacity.The specific search method will be explained in a later section.(Search method) (a) Enter the spelling of the word in alphanumeric characters and enter the spelling of the word. This section explains how to search for the meaning of words.

The words stored in 1R0M are arranged in alphabetical order and stored sequentially after performing the standardization described above.

All words are broadly classified according to which letter of the alphabet A-Z they begin with. Furthermore, if the second character is also taken into consideration, the blocks can be classified into 676 blocks. (Here, we will explain the search for classifying by the first two letters, but it does not necessarily have to be two letters and can also be classified by three or four letters.) First, the first letter of the input word is used for spelling. , the upper eight bits of the ROM address where the meaning, etc. are stored. Here, a is (
00000000)b is (00000001)...
...Assign the code (00011001) to z and put it in the upper 8 bits of the address. Next, the lower 8 bits of the address are determined by the second character, which can be realized as follows. Generate the code for the second character in the same way as when determining the upper digits of the address, double it, and put the lower 6 bits into the lower 8 bits of the address.

By doing this, 676 address areas are determined by the first two characters. Table 3 shows address areas designated by this method. For example, when the first character of the input word is "S", (00010010) is entered in the upper 8 bits of the ROM address. When the second character is "a", (000000) is entered in the lower 6 bits of the ROM address.

Therefore, the part (a) of the ROM area shown in Table 3 is selected depending on the first two characters. An address code in which the first spelling of a word block starting with the letters 1Sa' is stored is stored in the selected ROM area and the next address area. In this case, since the word Sacrifice゛゛, which is not shown in Table 2, is the first spelling of the prok of Sa, the letter ゛C゛ of the spelling of the word ``6sacrifice'' is memorized in Table 3 (A) and (口). By specifying the first address of a block in this way, you can easily and quickly search for a single word from a large number of words.Next, A method of searching for meaning variations, idioms, etc. by inputting the spelling of a word will be explained with reference to the flowchart shown in FIG.

First, enter the spelling of the word you want to look up using alphanumeric characters. The input alphabet is converted into the alphabet code shown in Table 1, and the code is sequentially input from the first digit of the X register starting from the first character. The X register is a temporary storage area for input words that utilizes the RAM built into the control LS.

When you operate a key to check the meaning or change of an input word, the character code in the first and second digits of the X register specifies a specific address in the ROM area shown in Table 3, as explained above. , the address code stored there specifies the ROM location where the third character from the beginning of the spelling of the first word of the word block starting in the first and second digits of the X register is stored. The following description will be made using the flow diagram shown in FIG. When the ROM address is specified, the program jumps to the English->Japanese entrance shown in Figure 4. 41
Specify the third digit of the PaX register in .

This searches for the spelling of the block selected in the first and second digits of the X register, so in the state of 41, the spellings of the words in the first and second digits clearly match. The next step is to check whether the third digit matches. J in 42 is a counter for counting how many words from the beginning match the word spelling in the X register and the word spelling stored in the data ROM.

In the state of 42, the 1st and 2nd digits of X register 1 are ROM.
Since it matches the spelling stored in , set J to 2.

At 43, the code in the designated digit of the X register is compared with the alpha code stored at the currently designated address in the data ROM.

If the two match, the process goes to 44 and the number of matching words from the beginning of the word is increased by one, so 1 is added to J. At step 45, the designated digit of the X' register is incremented by 1 to designate the next character, at step 46 the data ROM address is incremented by 1, and at step 4, the area in which the next character is stored is designated.

At step 47, it is determined whether there is data in the X register.

If there is data, return to 43 and add X register and R
I'm going to check the match with OM. If there is no data, the process advances to step 48 and it is determined whether the data at the currently designated ROM address is a part-of-speech code.

If it is a part-of-speech code, this means that the spelling of the word has ended, and the word in the X register matches the spelling of the word at this ROM location. It becomes clear that various data related to the input word are stored after this address. RO if it is not a part of speech code in 48
The continued spelling of the M word indicates that the entered word is not in the ROM.

43, if the data in the X register and ROM are different,
It is necessary to step through the ROM address and compare the match with the next occurrence of the word spelling to find the ROM address where information about the word in the X register is stored.

ROM data' (lζ is stored in the format shown in Figure 1A, and if the spelling of the word 1 does not completely match, 2
It is necessary to skip ~10 data and select 11 word spellings. At 49 in FIG. 4, it is determined whether the part of speech shown in FIG. 1 and 2 has been specified, and the ROM address is incremented until the part of speech can be specified. Since the two bytes after the part-of-speech code are address codes, the ROM address is incremented by two in FIG. 450. At 51, the ROM address is incremented by one step, and at 52, a change 1 code is determined.

Since the 2 bytes after this change 1 code are address codes, they are returned to 50 and the ROM address is advanced by 2 steps. 5
3, the change 2 code C2 is determined.

As shown in Fig. 1K, the 4 bytes after the change 2 code are address codes, so in Fig. 4 54, the ROM address is incremented by 2 steps, returned to 50, and the ROM address is incremented by 2 steps, making the entire ROM address Take four steps forward. At 55, the $ code is determined.

As shown in Table 2, the $ code indicates the beginning of the word spelling and the number of characters in common with the previously stored word. The first words in a block classified by the first two letters of the word are all composed of alphabetic codes and no S code is used. Fourth
When the part-of-speech code is determined in FIG. 56, the process moves to the next block word, indicating that the input word is not in the ROM. If the part-of-speech code is not determined, the process returns to step 51 and repeats the operation of finding the beginning of the spelled word. 55
If you judge the $ code and find the beginning of the word spelling, it will be 57.
Go to and compare the value of J and the $ code.

If both values are equal, the spelling of the word that is being replaced with the S code among the new word spellings to be matched and the X
The spelling of the registers will match. So I go back to 43 and check the remaining spelling matches for the word. If the J and S codes do not match, the process proceeds to step 59 and the sizes of the $ code and J are compared. ζX when the $ code is large
The number of shared words is greater than the number of matching words among the words in the register, indicating that the input word is not in the ROM. If the S code is greater than J, the spelling does not match the spelling in the X register, so the process returns to step 49 to detect the beginning of the next spelled word. After passing through the flow shown in Figure 4 in this way, the R
This means that the OM area has been searched. When you operate a key to search the meaning of an input word, after going through the flow shown in Figure 4, import the 2 bytes after the part-of-speech code in Figure 1 and 2 into LS[, specify the ROM address with that code, and then use that code to specify the ROM address. The code representing the meaning stored in the area is taken in, decoded into characters representing the meaning, and displayed. Further, after passing through the flow shown in FIG. 4, the inflection codes and compound words codes 6 and 8 in FIG. This allows it to be determined that the input word has inflections or idioms. For words that have inflections or idioms, operate the keys to look up each word. Specify an address using the two bytes after the inflection code, take in the spelling code of that area, and display the inflected word. In the case of an idiom, the idiom is generated from the spelling code after the idiom code, and the meaning of the idiom is generated from the subsequent meaning code. In the case of phonetic symbols, this can also be realized by detecting the phonetic code at the time a key is operated, and generating and displaying the phonetic symbol based on the subsequent code. (b) Explain how to enter a Japanese meaning using the katakana (hiragana can be used in the same way) keys and search for the spelling of a word that corresponds to that meaning.

The meanings of Japanese words are stored in the ROM in alphabetical order as shown in FIG. First, when the meaning is entered in katakana, each character is converted into a code corresponding to katakana shown in Table 1 and entered in the X register. The first digit of the X register (corresponding to the first character of a word) specifies the first address of the block classified by that character. In other words, specify the beginning of a block in which the first digit character is classified into 50 syllabaries. The meaning code of the X register and the code of the designated ROM area are compared one byte at a time.

If there is a match, R assigned to the input meaning
This means that the OM area has been detected, and if they do not match, the addresses are uploaded and a matching area is searched for.
Once a matching area is found, the address code after the ¥ code and E code is transferred to the LSI as shown in Figure 3B.
Incorporate into.

Then jump into the flow entrance shown in Figure 5. At step 60, the address of the data ROM is specified using the address code taken into the LSI (one character at the end of the spelled word).

n in 61 is a counter that stores the number of matching words stored in the S code shown in Table 2.

Since the S code is not detected in the state shown in FIG. 561, n is cleared. At step 62, the character data constituting the word spelling is taken into the spelling generation register of the LSI.

At step 63, the ROM address is reversed by one address to designate the area where the next character code is stored.

At 64, the $ code is determined.

When the $ code is detected, it is necessary to generate the characters that have been replaced by the S code, so the required character data is taken from the previously stored word spelling. In step 67, the number of S codes is entered into n.

This allows you to remember how many more words need to be replaced with character codes. At 68, 69, and 70, the area where the previous word spelling is stored is searched.

Words are stored in ROM in blocks classified by their first two letters. The spelling of the word at the beginning of a block is all memorized as an alpha code without using an S code. The first letter of this first spelling is stored as an uppercase alphabetic code, which makes it possible to distinguish between prots and prots. 70
If the uppercase letter is determined in , it can be determined that the position is the boundary of the block in which the word to be generated now exists.

Therefore, in 71, the ROM address is advanced by the number of data that has not yet been incorporated into LS as a spell code.6
Go back to step 2 and import the spell data. When the $ code is determined in 69, the number of S codes and n are determined in 72.
Compare with the number of .

If the $code is greater than n, the currently selected spelling word does not have any spelling data to be imported into the LSI, and the process returns to 68 to proceed to the next word.

If you need to import spell data, go to 73 and advance the ROM address by the number of times you need to import it.
62, the data will be taken in. If a capital letter is not detected at 65, the process returns to 62 and the operation of importing data is repeated. When a capital letter is detected, the data is imported at 65 and spell creation is completed.

By decoding the word spelling code introduced in this way and displaying it as an alpha alphabet, it is possible to search for a word that corresponds to the Japanese meaning entered using Katakana. (Apparatus for Carrying Out the Method of the Invention) Next, an example of a basic apparatus for use as an English-Japanese or Japanese-English dictionary using the compressed data as described above will be described.

FIG. 6 shows a circuit block diagram of an apparatus for carrying out the method of the present invention.

In the figure, K is a key input device, KE is a key encoder, IC is an input gate for X, CO is an input word counter, and C
is the designated character counter for 0C, JZ is the C(1)O detector,
X is the input word register, 0C is the output control circuit of X, TB
is the double circuit, GAl is the input gate of AM, AMl is the AM
AM2 is the lower 6 bits of AM, AS is the adder/subtractor of AM, AMD is the address decoder of MU, M
U is word data storage unit, 0B is MU output buffer, D
C is a decoder, GO is 0B, DC output switching gate, D
SC is the display control circuit, DSP is the display, GW is the input gate of WA, WA is the word address register, and WAl is WA
The upper 8 bits of WA2 are the lower 6 bits of WA, GA2 is the output gate of WA, AM is the address register of MU, A
MB is an address buffer register, GA3 is an output gate of AMB, GJ is an input switching gate of JDl and JC,
JD is a match detector for the character code in X and the output of GO, J
C is a coincidence detector between the code output from D and the GD output;
RO is the instruction network processing unit, ARD is the RO address decoder, AR is the RO address register, GR is the AR input gate, AC is the AR adder, IS is the instruction word selection circuit, D
is a command decoder, FC is a flip-flop, SMl, $
M2 is a $code storage register, $J is a magnitude comparator for SMl and $M2, SS is a subtraction circuit between SMl and SM2, and SD
is the subtraction circuit of SS, GSl and G$2 are the input gates of $Ml and SM2, and GM2 is the output gate of SM2.

The overall operation is that the instruction word storage unit RO stores several types of instruction words in a predetermined order, and the data input to the register X using the key input device and the data stored in the word data storage unit MU in advance A match is detected with the word data currently displayed, and the desired data is displayed on the display DSP.

FIG. 7 shows a flowchart when the English-Japanese search shown in FIG. 4 is performed using the apparatus shown in FIG. 6.

In the figure, the numbers inside O marks indicate micro orders in the apparatus of FIG. If you press the Japanese translation key, Nl, n2
Proceed to Yes, input 1 to the specified character counter C at N3, and 0C specifies the first character stored in X, and at N4 transfer the code X1 of the first character to AMl via GAl. .

By setting the content of C to 12" in N5, 0C specifies the second character in X. In N6, the character code of the second character is X.
2 is doubled (shifted to the left by 1 bit) by TB and transferred to AM2 via GAl. As a result, the MU specifies the address input to the AM and outputs its contents to the 0B. The data output to 0B is 8 bits, and is 0 at N7.
The contents of B are transferred as they are to WAl via GO and GW.

At N8,n, the contents of the next address are transferred to WA2.
NlO'(: Sends the start address of the word extracted to WA to AM, and outputs the contents of that address to 0B. For example, if the word input to register X is [Safe], it is temporarily stored in WA. The address is Sac in Table 2.
This is the position of the third character "C" of rifice.

-Nll adds 1 to C, and Nl2 adds [[
f" to JD, and sends the contents of 0B, that is, "C], to JD in Nl3.
The data is sent to D and a match is detected by JD. In this case, there is a mismatch, but if they match, specify the fourth character in Nl5, and similarly specify the address of the next character in the word data storage unit in Nl6. Compare C and CO in Nl7. .
CO is a counter that counts the number of characters input to X, and Nl7 determines whether the character currently being searched is the last character input to X. If it is not the last character, the process returns to Nl2 and matches the characters specified in Nl5 and nl6. This process is repeated, and if there are any characters that do not match, proceed to NO at Nl4. If there is a match up to the end, Nl8→Nl9→N2O, and if the address is part-of-speech code Hc, it means that the address of the MU corresponding to the word input to the X register has been detected. If the spellings do not match during match detection, proceed from 014 to N2l0n
By repeating 21-n22 ken24n21→..., the address of MU is uploaded until the part-of-speech code is detected, and if the part-of-speech code is output to 0B, N25,n
At 26, two addresses are uploaded, and at N27, the translation address after the part-of-speech code is specified. (Refer to Figure 1 A) N28 → N29 → N3O is to detect whether the data output to 0B is a C1 code (Figure 1 power), and if there is a C1 code, change the address by N25 → N26. rise. Also, if the C2 code is detected at N3l→N32→N33, four addresses are upped at N34→N35→N25→N26. N36 → N37 → N38 is for detecting S code, and if it is S code, N42 →
Proceeding to N43→N44, a match between the number (size) of the $ code and the specified position C of the character is detected. FIG. 8 shows the procedure for displaying the translation (meaning) and part of speech of a word after the spelling entered from the key input device K in FIG. 6 matches the spelling stored in the MU. be.

First, at 80, the part-of-speech code is decoded and output to the display control circuit, and at 81, the storage address of the translated word address (3 in Figure 1 A) is saved and the translated word address is specified, which corresponds to word 1 in Figure 1 A. For example, if the translated word is "Ai Minor", the position of "ma" in FIG. 3 is designated.

Then, the character is output to the display control circuit, and the ROM is stored at 84.
The address is incremented by one and "I" is specified. 85, 86,
98 and 99 are for detecting whether the character data of the translated word has ended. If an E1 code is detected, the ROM address is advanced by 2 steps at 88, and if it is an E2 code ZU code, it is R at 87 and 88.
Advance the OM address by 4 steps.

Also, if it is ¥1, the last two bytes are the address of the spelled word, so if it is 100, the ROM address is advanced by two steps, and if it is ¥2, the last four bytes are the address of the spelled word. Therefore, the ROM address is advanced by 4 steps at 100 and 101. When the E1 or E2 code is detected, the first two characters of the translated word "Ai" are output to the display control circuit using the 89 at the back. With the above steps, the translated word corresponding to the word input using the keys can be displayed. From 92 onwards, It is used to display additional explanations, and at 90, the address (2nd byte) of the ROM that stores the translated word address is specified, and it is determined whether 1 code is inserted at the next address. If inserted, the character codes after the first code are output to the display control circuit.

If a pronunciation code (4 in FIG. 1A) or a variation code (6 in FIG. 1A) is detected at 95, the code is decoded and output to the display leg circuit. CC of 95 means the codes 4, 6, 8, etc. in Figure 1 A. For example, if there is no phonetic symbol data and the change code is stored immediately after the character code of the explanation added after the target word address, 8. The change code is detected in FIG. 95.

In addition, if the spelling of the word immediately after the character code of the additional explanation is stored, the process advances to ``Yes'' in FIG. 896 to complete the search for the translated word. FIG. 9 is a flowchart for realizing the operation shown in FIG. 8 using the process shown in FIG. 6, and shows FIG. 8 in more detail.

n1→N2 corresponds to 80 in Figure 8, and the part of speech code is DC.
and outputs the decoded signal Dc to the display control circuit.

N3→N4→N5→N6→N7 corresponds to FIG.
evacuate to. The translated word address is designated with N8, and the translated word (one character) is outputted to the display control circuit with N. Nll→N,2
→Nl3 corresponds to FIG. 85, Nl4→Nl5→Nl
6 becomes 86, and Nl7→Nl8→Nl9 becomes 98.
N2O→N2l and n22 are 0n23 corresponding to 99 respectively
n24→N25n26n27 corresponds to 100→101, and N28n29→N3On3ln32 corresponds to 87→88. N33→N34→N35 becomes 89, N36 becomes 9
Corresponds to 0, and the corresponding ones thereafter are N38 → N39 → N4
O becomes 92, N4l becomes 93, N42 becomes 94・N43
On44, n45 to 95, N46n47 to 96, N
48n49 correspond to 97, respectively. FIG. 10 is a flowchart for searching for an address that stores addresses of English words, such as when the dictionary is used as a so-called Japanese-English dictionary that displays English words corresponding to Japanese words input using keys.

11 due to the first two characters input to the X register at 111
2 determines the first address of the word that starts with those two characters.

For example, if you enter "Ai Minor", "item 2" in Figure 3.
Specify. Specify the third character of the X register with 113,
At 114, compare the character in the X register with the character in the ROM (1 character), 114 → 115 → 116 → 117 → 114 →・
By repeating ・・・・・・・・・, the word in the X register is detected as a match starting from the 3rd character.
If it matches up to the last character of the input data, it will be 118,119
If the word is a ¥ code or an E code, the desired word has been detected.

Further, even if the input data is completed, if there are still characters in the ROM, it means that the input word is not stored in the ROM and cannot be searched. If the input data does not match until the end and the characters in the middle do not match, proceed to 120 and RO.
Start searching for a match with the next word in M.

However, if the E code is detected at 120, the input word is R.
This means that it is not stored in the OM and cannot be searched.
If it is a ¥1 code, then the next word starts from the third byte, so the ROM address is incremented by three steps at 124 and 125, and the process returns to 113, where the match detection is performed again from the third character. If the ¥ code is detected, the next word starts from the 5th byte, so the ROM address is advanced by 5 steps at 123, 124, 125 and returns to 113. If it is neither ¥1 nor ¥2, the ROM address is incremented by one step at 116, and the process returns to 120, where the beginning of the next word (in reality, the third character) is detected. FIG. 11 is a flowchart for realizing the method of FIG. 10 using the apparatus of FIG. 6, and represents FIG. 10 in more detail.

n1 → N2 → N3 → N4 is shown in Figure 10 111, N5 is 1
13, N6 → N7 → N8 corresponds to 114, and N9 corresponds to 1
15 and NlO correspond to 116, respectively.

Nll is a comparison between CO, which stores the number of characters input into the becomes n134n of 0n12 and proceeds to Nl2
14, n15, n16, n17, in Figure 10, 118, N
l8→Nl91n2OOn2l1n22→N23 is 11
Corresponds to 9. Similarly, N241n25 corresponds to n26 120, N3OOn3l→N32 becomes 121, N33
→N34→N35 correspond to 122, respectively.

Also, n4O is 123 in N36→N37→n384n39
1246125, and N4l corresponds to 126. 1st
FIG. 2 is a flowchart for realizing the method of FIG. 5 using the apparatus of FIG. 6, and represents FIG. 5 in more detail.

Specify the address of the last character of the desired spelling of the English word using n1→N2→N3→N4→N5.

N6 → N7 corresponds to 62 → 63 in Fig. 5, and similarly N
8→N9→NlO becomes 64, Nll→Nl2 becomes 67→6
8, Nl3Onl44nl5 is 69, Nl6 is 70
, Nl7 → Nl8 → Nl9 → N2O becomes 71, N2l
→N22 corresponds to 72, N23→N24→N25→N26 corresponds to 73, N27 corresponds to 65, and N28 corresponds to 66. Next, in addition to displaying translated words and parts of speech, display of other data shown in FIG. 1A will be explained. First, in the case of phonetic symbols, the phonetic symbols can be displayed by detecting phonetic code 4 and decoding subsequent codes.

A variation word of word spelling 1 can be displayed by detecting variation word 6 and specifying a 2-byte or 4-byte address after it. For example, if the word is the verb 'Break', the change code 136 is C2 as shown in Fig. 13, and the address of the past tense form 'BrOke' and the address of the past participle form 'BrOken' are both stored. If you specify the type address, ``BrO
ke″″ can be displayed. Also, conversely, 8br0k
When searching for e"", the data of 132 and 133 can indicate that it is the past tense of Break". In the case of idioms, it is sufficient to display the idiom spelling and meaning after idiom code 8, but in this case, the word is displayed as a + code as shown in Figure 16, so this +
If the code is detected, it can be displayed as ``BeabOuttO'' by reversing the ROM address and inserting the spelling of the word.

According to the present invention, there are the following effects.

Data such as one word, part of speech, meaning, idiomatic idioms, etc. can be encoded and each data can be stored via a predetermined delimiter code.

An address storing a modified word (example) of the two words can be inserted into the storage area, and an address storing the original form of the word can be inserted into the storage area for the modified word.

3 In the preceding item 2, if the first variation and the second variation are the same, they can be stored in common.

The spelling of four words can be stored in alphabetical order, and the spelling of the word can be stored using a predetermined code for the common part with the previous word.

``TiOn'' and ``I'' are frequently grouped into groups of five syllables.
Syllables such as "ng゜" can be stored as one code.

The meanings (translations) of the 16 words are stored as addresses, and if supplementary meanings are required, the supplementary words can be stored as character codes.

It is possible to memorize the words of the 7th grade Japanese in alphabetical order, and to set words with the same first two letters as one block, so that each word can be memorized without inserting its first two letters.

By using the 8-word spelling as a predetermined code, phrases can be stored together with character codes.

[Brief explanation of the drawing]

FIG. 1 is a diagram showing the data structure of words according to the present invention.

Claims (1)

[Claims] 1. An electronic dictionary that notifies data corresponding to or related to input data through input operations on a key input device, etc., comprising a memory means for storing words and their translations, a word input means, a translation instruction means, and the above-mentioned Based on the translation instruction by the translation instruction means after the word input by the word input means,
means for reading the translation of the input word from the memory means;
and means for externally informing the translated word read by the means, the memory means storing a specific syllable in the word or the translated word as one code corresponding one-to-one to the syllable. and means for storing the correspondence between each of the codes and syllables.