JPH01196660A - electronic dictionary - 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 [Field of Industrial Application] The present invention relates to an electronic dictionary that is implemented in, for example, electronic typewriters and word processors and used as a spell checker for checking the spelling of words.

[Prior Art] In the conventional spell checker (hereinafter referred to as SC), the words that can be checked are limited to one language, and therefore the Jli words included in the electronic dictionary are only in one language. For example, it was sufficient to have a single-language dictionary, such as an English dictionary for an English SC and a French dictionary for a French SC.

[Problems to be Solved by the Invention] However, recently, spell checkers have been developed that can perform spell checks in multiple languages using one piece of rough l-ware. Additionally, the performance of devices that memorize word spellings has improved, and so has their storage capacity.

Under these circumstances, it is possible to implement a multilingual spell checker that has dictionaries for multiple languages in one software and can check the spelling of words in multiple languages with one SC. Tegiru. In this multilingual SC, it is essential to have information about which part of a dictionary that includes multiple languages corresponds to which language.

In view of this point, an object of the present invention is to provide an electronic dictionary in which a plurality of languages are recorded for multilingual SCs.

[Means for Solving the Problems] In order to achieve such an object, the present invention provides an electronic dictionary that stores the spellings of words. The electronic dictionary includes first fjJ means for collectively storing information, and second storage means for storing information indicating in which part of the electronic dictionary the language is stored.

[Function] According to the present invention, in an electronic dictionary for multilingual SCs in which multiple languages are stored, data indicating which word hli is stored where in the electronic dictionary is provided in a specific area of the electronic dictionary. By doing so, it is possible to perform spell checking in multiple languages with one electronic dictionary, and it is also possible to configure an electronic dictionary that combines dictionaries with two or more desired languages.

[Fruit color example] Hereinafter, the present invention will be described in detail with reference to the drawings.

As shown in FIG. 1, the electronic dictionary according to the present invention is an electronic dictionary that stores the spellings of words, and the emblems of T-words of a plurality of languages stored in the electronic dictionary are collectively stored for each language. The electronic dictionary includes a first storage means 101 for storing information, and a second storage means 102 for storing information indicating in which part of the electronic dictionary the language is stored.

FIG. 2 shows the configuration of a multilingual spell checker to which the present invention is applied. Here, l is a connector for connecting the spell checker to an electronic typewriter, word processor, or the like.

Reference numeral 2 denotes a gate array (hereinafter referred to as GΔ), which exchanges data between the electronic typewriter and the spell checker via the connector 1. From the gate array 2, a chip select signal 204. The chip select signal 205 and the gate signal 206 are respectively stored in the program ROM 5.
．． It is sent to RAM 6 and decoder 8.

3 is a microprocessor unit (central processing unit)
(hereinafter referred to as MPU), controls the entire spell checker. 4 is a clock, which provides the operation timing of MPII3.

Reference numeral 5 denotes a read-only memory (hereinafter referred to as program ROM) in which instructions for controlling the operation of Ml'U3 are stored. 6 is a memory that can be read and written freely (
(hereinafter referred to as 11AM), and provides a work area necessary when MPIJ3 operates according to instructions in program ROM4. 7 is a read-only mesori (hereinafter referred to as dictionary RO)
M) and remembers the correct spellings of words in at least one language.

8 is a decoder which sends chip select signals 207 and 208 to the dictionary ROM 7 to address Pi! 9 and sends it to the dictionary ROM 7.

A control bus 10 sends control signals to the gate array 2 via a connector l. 11 is connect 1
This is a bidirectional data bus between the gate array 2 and the gate array 2. 1
2 is a gate array, MPU3. Program ll0M5
．． 118M6 and the dictionary nov7. 13 is a gate array 2. MPt13. Address bus between RAM 6 and dictionary It OM 7.

14 is a port for address extension between the MPU 3 and the dictionary 110M7.

The multilingual SC shown in FIG. 2 receives commands 1- from an electronic typewriter or word processor via connector 1. One of these commands is set as a command for switching the m classes of languages in the dictionary ROM 7. When the Marginal SC receives this switching command from an electronic typewriter or word processor, the MPU
3, by using the data recorded in a specific area of the dictionary 110M7, it is possible to know in which area of the dictionary ROM 7 the dictionary of the target language exists.

FIG. 3 shows a first embodiment of the present invention, in which a dictionary 110M7
Indicates the content of As shown in FIG. 3, 16 areas A (2 bytes each) are secured at the beginning of the dictionary 110M7,
Starting from address 0, the areas are American, English, French, German, Italian, Spanish, Portuguese, Swedish, Norwegian, Danish, and Finnish. When the content of the area is 0, the corresponding language is not stored in this dictionary ROM 7, and when it is not 0, it indicates the address where the dictionary of the corresponding language starts. That is, in this figure, $20. $1249 and $3678, and the starting address is 2011 respectively.
．． 124911 and 3678+1.

Next, the operation of the first embodiment will be explained according to the flowchart shown in FIG. FIG. 5 shows a legend regarding the embodiment of the present invention.

First, in step Sl, the receiver receives command C113 of the commands shown in the legend of FIG. 5, that is, a command to switch to the German dictionary.

Next, in steps S2 and S3, address 2011 included in the fifth byte from the beginning of area A is obtained. That is, in step S2, command C31
Subtract command l;f;011 from 1 to create work area ad
In step S3, addr is set to 2-H3 and stored in addr again to obtain address 2011.

Next, in step S4, it is determined from the address 2011 that a German dictionary exists. The German dictionary is the part indicated by the reference numeral 38 in FIG. Then, in step S5, the address 2011 is added to the work area Topadd.
Store in r.

On the other hand, when the command C5H is received in step Sl, command C31! In the same way as when receiving , the value of the 9th byte from the beginning of the area is obtained. However, since this value is 0, it is determined in step S4 that there is no Spanish dictionary for this word Wll0M7. Therefore, the dictionary is not switched and the process returns to step SL.

Next, a second embodiment of the present invention will be described. FIG. 6 shows the contents of the dictionary 110M7. In this case, the start addresses of each language that this dictionary inOM7 has are stored in the specific area A, starting from the beginning of the area, and the end of the data is indicated by O.

At the beginning of each language dictionary is data B indicating the number of words. This data B is 0 American, 1 English, 2 French, 3 German, 4 Italian, 5 Japanese Spanish, 6 Portuguese, 7 Swedish, 8 Norwegian, 9 Danish, and A: It's Finnish. Note that this data is an example, and the types of languages and the correspondence between data and languages are not limited to this.

The dictionary +10M7 shown in FIG. 6 includes French, Portuguese, and Swedish.

Next, the operation of the second embodiment will be explained according to the flowchart shown in FIG.

In the initial process from step 5lrl to step 57/, it is checked how many words exist in this dictionary n0M7. In step S1, the storage area PI
and stores O in P2. In steps S2 and S3, data indicating the type of language is searched for, and in step S4 this is stored in addr. and,
This data is stored in a separate area in step S5.
It is stored in country[P1].

In step S6, P1+1 is stored in area P1 and P2+1 is stored in area P2, and in step S7,
If I"1 is 17 or more, the process moves to step S8; otherwise, the process returns to step S2 to search again for data indicating the type of language.

In step S8, when the MPIJ 3 receives a command as shown in FIG. 5 using a key or the like, step S9. In step 519 and step Sll, an area (country[Pl]) in which data indicating the type of language is stored is searched. If the key has been found, the process moves to step 514; otherwise, the process moves to step 51.
2.

In step 514, the language is switched to the one corresponding to the command received in step S8.

Then, in step 515, the start address of that language is stored in the work area Topaddr.

In step 512, P2+1 is stored in area P2, and in the next step 513, P2 and PI are compared, and if P2 is larger than Pi, the process returns to step S8; otherwise, the process returns to step S10. The area where data indicating the type of language is recorded (cou
repeat[P1]).

Next, a third embodiment of the tree invention will be described. FIG. 8 shows the contents of the dictionary ItOM7. This ROM 7 stores a code indicating a language and a start address in 16 specific areas A (3 bytes each). 1$30 stored in specific area A represents that an English dictionary is stored in area 88 from address 3011, and 7$1371 represents that a Swedish dictionary is stored in area 8B from address 137111.

Next, the operation of the third embodiment of the tree invention will be explained according to the flowchart of FIG.

In step St, when a command as shown in FIG. 5 is received, step S2. The address stored at the beginning of area A is obtained through the processing in steps S3 and S4. j and S are in step S5, and this]'
When it is determined that the content of the dress is O, it means that no language is stored in this dictionary 110M7, and the process returns to step Sl.

In step S5, if the first floor of the address is not O, the process moves to step S6. If it is determined in step S6 that the corresponding dictionary exists, the process moves to step S9, and the start address of the dictionary for that language is added to the work area Top.
Store in addr.

If it is determined in step S6 that the corresponding dictionary does not exist, the process returns to step S4 via step S7 and step S8, and searches for a dictionary of the language corresponding to the received command. If the corresponding dictionary is not found even after repeating this operation, the process returns from step S8 to step Sl.

The third embodiment has been described above, but in the second and third embodiments, the start addresses of the dictionary are stored in a fixed order such as ascending order as shown in FIGS. 6 and 8. There's no need to do it. Furthermore, in the second and third embodiments, there is no need to fix the size of the specific area, and the number of languages may be determined in advance or termination data may be inserted at the end of the specific area.

Since the second and third embodiments have the above-mentioned characteristics, the meaning of the command can be changed from "switch to a dictionary of any language" to "
You can still use these dictionaries even if you change to "Switch to which dictionary." For example, command C011
Command C311 means switching to the first dictionary, and command C311 means switching to the fourth dictionary.

Next, the operation when the meaning of the command is changed in the second and third embodiments will be explained according to the flowchart shown in FIG. 1O.

First, when command C211 is received in step S1, address 3678+1 is obtained from the third area through the processing in step S2 and step S3.

This indicates that the third dictionary starts at address 1336, address 811. Then, in step S4, this value is stored in Topaddr.

If command C711 is received in step 51, the eighth area is checked in step S3. Since 0 is stored in that area, it can be seen that the eighth dictionary does not exist.

In the process shown in FIG. 1O, there is no need to store the language code shown in FIG. 6 as B or the language code shown in area A in FIG. 8 in the work area.

[Effects of the Invention] As explained above, in the present invention, since the electronic dictionary has information indicating which language is stored where, it is possible to realize a spell checker that supports multiple languages. It has the effect of being able to do things.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of an electronic dictionary according to the present invention, FIG. 2 is a block diagram of a multilingual spell checker to which the present invention is applied, and FIG. 3 is a diagram showing a first embodiment of the present invention. Fig. 4 is a flowchart of the first embodiment of the invention, Fig. 5 is a diagram showing a legend for the embodiment of the invention, Fig. 6 is a diagram showing the second embodiment of the invention, Fig. 7 is a flowchart of the second embodiment of the present invention, FIG. 8 is a diagram showing the third embodiment of the present invention, FIG. 9 is a flowchart of the third embodiment of the tree invention, and FIG. 1O is a flowchart of the third embodiment of the present invention. 12 is a flowchart when the meanings of commands are changed in the second and third embodiments. 1...Connector, 2...Gate array, 3...Microprocessor, 4...Clock, 5...Program nOM (read only memory), 6...1 (8M (random access memory) ), 7...
・Dictionary 110M (leat-only mesori), 8... Decoder, 9... Address line, lO... Control bus, 11... Bidirectional data bus, 12... Data bus, 13... Address bus , 14...Boat. Minobu BAr4s electronic dictionary l Maki Hitomi Figure 1 Nejimei 0 recruitment 1f) Diagram showing the row of forks No. 31 l Nej Auspicious day of the moon, No. ILf')! Figure 6 shows the sequence of earthquakes. Figure 8 Heather tone 58 month 0 lacquer 30 request 1a A row θ flowchart No. 9
Figure CnH (COH-CFH): To the n-4'th slope
Warto Sand Top Figure 10

Claims (1)

[Scope of Claims] 1) In an electronic dictionary that stores the spellings of words, a first storage means that collectively stores the spellings of words in a plurality of languages stored in the electronic dictionary for each language; an electronic dictionary comprising second storage means for storing information indicating in which part of the electronic dictionary the electronic dictionary is stored.