JPH02277170A - Electronic dictionary - Google Patents

Abstract

PURPOSE:To prevent the reduction of the spelling check processing speed by discriminating a storage area of the word information from a storage area of the hyphen information and storing both information via a storage part. CONSTITUTION:The word information received from an input device 1 is inputted to a storage 2, and the storage 2 stores the word information and the hyphen information in different areas. A dictionary 4 stores the spelling information on the words stored in the storage 2 and the hyphenation information on the words of 6 letters. A controller 5 controls the transmission of signals among component elements, and an output device 3 outputs the result held and edited in the storage 2. In such a constitution, the retrieval is attained for each byte or bit among the hyphen information, the word information, and the input information stored in different areas when the spelling check is carried out between the input information and the stored word information.

Description

[Detailed description of the invention] <Industrial application field> The present invention relates to an electronic word dictionary.

<Prior art> When printing or displaying a document consisting of many words, if the words in the document are in the right margin,
If it becomes necessary to enter a hyphen in the middle of a word to express it in multiple lines without moving the word to the next line, conventional methods include checking the position of the hyphen in the word using a dictionary, etc. It is very troublesome because you have to enter a hyphen.

Therefore, it is convenient to equip a printing device or the like with an electronic dictionary and store various word information and information on the hyphen position of the word in the storage section of the electronic dictionary at the same time.

That is, by inputting the characters of a necessary word, a stored word corresponding to the character information (word) can be searched, and the hyphen position of the search word can be displayed at the same time.

<Problems to be Solved by the Invention> The electronic dictionary as described above is useful when knowing the position of a hyphen. However, just a word search,
For example, when checking the spelling of input characters (words), processing of stored hyphen information becomes troublesome, lengthens the search time, and requires a very complex circuit.

SUMMARY OF THE INVENTION Therefore, the present invention provides an electronic dictionary that does not reduce the processing speed of spell checking or the like even when hyphen information is stored together with word information.

<Means for Solving the Problems> The electronic dictionary of the present invention stores word information and hyphen information indicating the hyphen position of the word in the storage unit, and the hyphen information and the word information are stored separately. It is characterized in that it is stored in the storage section by distinguishing it into areas.

According to the electronic dictionary of the present invention, when spell checking input information with stored word information, there is no difference between hyphen information and word information stored in another area and the input information. , you can directly search in bytes or bits.

In other words, word information corresponding to input information can be searched for without considering hyphen information at all, and processing similar to that of an electronic dictionary when hyphen information is not stored can be performed. Therefore, there is no need for a circuit configuration to take hyphen information into consideration.

Translation of the specification (no change in content) Kei 4 or Yuka β 1 <Example> The configuration of the present invention will be described below along with Examples.

The electronic word dictionary according to the embodiment of the present invention is
It has word information for ticking and hyphen position information only for words consisting of six or more characters.

FIG. 2 is a block diagram of a word search system having an electronic dictionary according to this embodiment.

In the figure, 1 is an input device, 2 is a storage device, 8 is an output device, 4 is a dictionary, and 5 is a control device.

Next, each of the above components will be explained.

Input device 1: A device for inputting character/word information into the storage device 2, specifically a keyboard device, a tablet device, an OCR, etc.

Storage device 2: A device for storing character information input from the input device 1, specifically a core memory, IC memory, etc.

Output device 8: A device for outputting the results saved and edited in the storage device 2. Specifically, they are printers, display devices, etc.

Dictionary 4: A device that stores spelling information for words and hyphen position information for words with six or more characters stored in the storage device 2. Specifically, it is ROM (read only memory) and the like.

Control device 5: A device for controlling the transmission of signals between the above components.

The structure of the dictionary 4 described above is as shown in FIG.

In the same figure, ■ is the index part, and the index I first classifies all words into the number of spelling characters, that is, 1 character, 2 characters, ... 8 characters, etc., and then classifies the initial character type. That is, A, B, C,... x, y.

The words are classified into categories and the number of words after the classification is registered. In the same figure, from the top, one-letter words, two-letter words, etc.
, becomes an 8-letter word, and the letter "A".

"B" - "C", ... rXJ, r
yJ and rZJ represent the initial letters of words. Each inch box stores the number of registered words.

Further, in the figure, J is a memory for spelling data and hyphonate data of words, and memories 11, J*, . . . corresponding to index I for each number of words are stored.
Consists of J8.

In addition, information from the first letter of each word to the second letter below is 1.
It is converted and stored in units of 5 bits per character.

The pit conversion is as shown in Table 1 below. The character "," in the same table is an apostrophe.

Here are some specific examples.

When storing the 8 words in Table 2 below, the words to be memorized in Table 2 are [J in AMJ, rNJ in kNJ, LL in word 1'-ALLJ, and LL in word [A RMl]. Then, "RMJ,""LANJ" for the first table word "PLANj,""LAY" for word 1'-PLAYJ, "LAY" for the word rDELI
CATEJ UEr-I CATEJ, word “I)E
LIVERYJ is ``ELIVERYJ.''

Then, meaningless data X (bit off) is added in order to match 1 byte = 8 bits of the memory.

That is, "MJ-)01101 XXX →68 H(Hexadecimal)rNJ→011
10XXX →70H 1'-L LJ→0110001100XXXXXX→
6 a OOH “RMJ-+1001001101XXXXXX→1(
40H “LANJ→0I100OOOOIOIIIOX→60
5CH 1'-LAYJ→OI100OOOOII100IX→
6 0 7 2H rELIcATEJ→001010110001011
00 XXXXXXX →2B1210DOA600 rELIVERYJ-+00101011000110
010XXXXXXX →2B1862C82900 Among the above words, words with 6 or more letters are 1'-DELICATEJ and l'-DEL I VE
RYJ There is.

In this embodiment, the hyphenation information is put together after the spelling υ character in bit units. That is, if there is a haiphon, it is "1", and if there is no haiphon, it is "0".

In addition, in this embodiment, as a general rule, no hyphen is added before the first letter (initial letter) or the last letter of one word, so the hyphenation information is (number of characters - 2)
) Requires bi-ft.

In the case of the above word rDELICATEJ, if the character separation is represented by "○", it becomes DQEQLQIQCQAQTQE, but since the hyphen setting position is 1'-DEL-1-CATEJ, the hyphenation information is Assuming "O" and the non-hyphen setting position as "・", it becomes DQEQL・■・CQAQTE, so (this is the above rELICATEJ memory view =
) is the 6-bit information before the X mark).

In addition, the above word "DELIVERYJ" (In the case of D, if the character separation is represented by "○", it becomes DQEQLQIQVQEQRQY, but the possible positions for setting a hyphen are rDE-LIV-ER-YJ, so the hyphenation information is) If the setting position is "○" and the non-hyphen setting position is "・", it becomes DQE@LOIOV@EQRY, so it is 10QIQ (this is the G beat information before the X mark of the memory bit of [ELIVERYJ] above) ).

Here, the dictionary index storing the words in Table 2 is shown in FIG. 3, and its data memory is shown in FIG. 4.

As an additional note, hyphonate information can be configured by storing the presence or absence of a hyphen for each character that makes up a word, but in that case, the word rDELICATEJ, the word rDELI VERYJ (like iD, the same characters are lined up halfway) However, if the hyphen is set at a different position, the detection efficiency will be reduced, so we adopted a processing method that first grasps the entire word and then detects the hyphen information.

Inserting hyphen information between the letters of a word will impede the speed of the word spelling check, so the hyphen information is stored separately from the word information area after the corresponding word information. Stored. This makes it possible to check the spelling of input information only on word information without considering hyphen information at all.

The reason why the word spell check is performed byte by byte even though one character is converted into 5 bits is that the processing speed is faster than checking by bit.

For this reason, a free area was provided in the unit information.

Effects> According to the electronic dictionary of the present invention, even if word information and information indicating the hyphen position of the word are stored in the storage unit, the processing time for spell checking etc. will not be reduced at all, and the processing time for spell checking etc. will not be reduced at all. Since search processing can be performed regardless of hyphen information, the circuit configuration does not become complicated.

[Brief Description of the Drawings] Fig. 1 is a block diagram of the electronic dictionary of the present invention, Fig. 2 is a block diagram of a word search system equipped with the electronic dictionary of the invention, and Fig. 3 is a block diagram of a specific word dictionary. FIG. 4 is a memory configuration diagram of the unit dictionary. I: Input device, 4: Electronic dictionary, 5: Control device J: Data and hyphen storage section. Agent Patent attorney Takeshi Sugiyama (and 1 other person) Figure 1 Procedural amendment c method) % formula % Electronic dictionary of title of invention 3゜4゜Relationship with person making the amendment/19 cases Patent applicant address 8545 111122-2 Nagaike, Abeno-ku, Osaka
2 Name (504) Sharp Corporation Representative Haruo Tsuji Masato

Claims (1)

[Scope of Claims] 1. In order to search for a word according to input information from pre-stored words, the storage unit stores the word information, and the storage unit stores the word information and the hyphen of the word. What is claimed is: 1. An electronic dictionary that stores hyphen information indicating a position, wherein the storage section stores a storage area for word information and a storage area for hyphen information separately.