JPS60117366A - System for accessing dictionary file - Google Patents

Abstract

PURPOSE:To improve conversion efficiency of Kana (Japanese syllabary)-Kanji Chinese character) conversion in such a way that the conversion process of words with affix can be performed without making any affixation process, by providing an area in which Kanji data from a Kanji dictionary file are stored in a memory. CONSTITUTION:When an operator inputs Kana by operating a keyboard 1, a Kanji corresponding to the Kana is retrieved out from an ROM4 through a control section 2, processing section 3, etc., and stored in the dictionary area 6 of a memory 5. At the same time, the Kanji is displayed in a display section 7. When the displayed Kanji is not desired one and the displayed Kanji is changed to the desired one by depressing a conversion key B, the data are stored in a learning word area 8. When Kana is again inputted from the keyboard 1 thereafter, the processing section 3 first accesses the area 8 and, if no corresponding Kanji data exist in the area 8, accesses a Kanji dictionary file 9 in the ROM4. Moreover, words with affix which are composed of plural words are also stored in the area 8 and, therefore, the conversion efficiency can be improved in such a way that the conversion process can be performed without making any affixation process.

Description

DETAILED DESCRIPTION OF THE INVENTION (JL) Technical Field of the Invention The present invention relates to a dictionary file access method for accessing a dictionary file in a word processor or the like.

(b) Prior Art and Problems One of the input means for Japanese word processors is the Kana-Kanji conversion method. In this system, after inputting kana characters by key operation, when a conversion key is pressed, the inputted ``kana characters'' are converted into the desired kanji. For this conversion, the word processor is equipped with a kanji dictionary file, which is stored in ROM (Memory exclusively for M output).
By using ``Kanji Dictionary'', you can reduce the size of the kanji dictionary file and also reduce the access time. However, ROM
Since the kanji code within is fixed, it is not possible to change or add answers. In word processing work, kanji that appear in sentences are not only used as words, but also the affixed single @ (for example, "scientific") is often used. Jin's word ``scientific'' is a compound word of the words ``science'' and ``target'' in the dictionary (ROM)1, a word with such an affix, or a word read from ROM and used in a sentence. Conversion efficiency can be improved by securing 1 in a predetermined area and then accessing this predetermined area first and then accessing the ROM (Kanji dictionary file) when converting Kana to Kanji. .

(C) Object of the Invention The present invention focuses on the above points, and aims to provide a dictionary file access method that facilitates kana-kanji conversion.

(d) Structure of the Invention The present invention provides a system that includes an input section, a kanji dictionary file, and an output section, and converts kana character data from the input section into kanji data and outputs the converted data, wherein the kanji data is read-only. The kanji dictionary file stored in a memory, a storage section for storing kanji data retrieved from the kanji dictionary file, and a means for searching the kanji data in the storage section; When character data is input,
The kanji data corresponding to the cough kana character data is retrieved from the continuous memory and outputted to the output section and stored in the storage section, and when second character data is subsequently input from the input section, The present invention constructs a kanji dictionary file in a ROM (read-only memory) so that after accessing the section, the kanji dictionary file is stored in the read-only memory, and when converting between kana and kanji, the kanji data retrieved from the ROM is stored in the read-only memory. It is stored in a storage unit (for example, a predetermined area of RAM). When performing the next kana to kanji conversion, the storage section is first accessed, and if the storage section does not contain the required kanji data, the ROM (kanji dictionary file) is accessed. In addition, the present invention provides a third kanji (word) synthesized from a first kanji (word) and a second kanji (word) successively retrieved from the ROM.
It also includes means for storing data) in the iVC.

(el) Examples of the Invention The present invention will be explained below with reference to the drawings. FIG. 1 is a block diagram illustrating one embodiment of the present invention.

3- In FIG. 1, when the operator operates the kana key A on the keyboard 1 to input a kana character, for example "sen",
This kana code C for "sen" is sent from the control section 2 to the processing section 3 and set in the register R. Next, when the operator presses the conversion key B on the keyboard 1, the resulting conversion command T is sent to the processing section 3, and the processing program P is started.

The next search is performed by the processing unit 3 executing the processing program P. Kanji data "1000" corresponding to kana code C (rsen]) in register R.

"Sen" and "Zen" are read from the ROM (read only memory) 4 and stored in the dictionary area 6 of the memory 5, and
The first kanji data "1000" is sent to the display section 7, and the kanji (1000) is displayed. If this kanji sen) is not the desired character, the operator presses the conversion key B, and the kanji (sen),
(money) are sequentially displayed on the display section 7. If the kanji "sen" is the desired kanji, the data for "sen" and the kanji "sen" in the dictionary area 6 are stored in the learning word area 8. Next, when kana characters (codes) are input again from the keyboard 1, the processing section 3 first accesses the New Year's card area 8.

If there is no kanji data corresponding to the kana character code input in this area, the kanji dictionary file 9 in ROMJ is accessed.

FIGS. 2 and 3 are block diagrams illustrating the flow of the above processing. First, in Figure 1g2, ■ Input the kana character "ka" from the keyboard l O ■ This will change j) the kanji code with the kana character "ka" as the key in the kanji dictionary file 9 of ROM4 to 1~! is taken out to the dictionary area 6 of the memory 5.

(2) By operating the transformation key B on the keyboard 1, the kanji code in the dictionary area 6 is sent to the display section 7, and the kanji is displayed.

(2) At the same time, the kana character code "ka" and the kanji code in the dictionary area 6 are stored in the learning area 8.

In FIG. 3, (1) When the kana character "ka" is input again from the keyboard 1, the learning word area 8 is first accessed.

■ If there is no kana character code (ka) corresponding to the input kana character in the learning word area 8, access the kanji dictionary file 9 in the ROM 4.

Note that the learning word area 8 stores not only the Kanji code of a word but also the Kanji code of a compound word composed of a plurality of words. For example, the kanji dictionary file 9 of ROM4 contains the kanji ``
The kanji codes for ``scientific'' and ``target'' are stored separately, but when the term ``scientific 1'' is used, the kanji code for this compound word ``scientific'' is stored in the learning word area 8.

Further, post-processing in the dark region 8 is performed as follows. When data as shown in FIG. 4(a) is stored in the learning word area 8 and a search is performed with the input of the kana character ``ka'', post-processing is performed and the data is placed at the last position of the learning word. Replaced. In addition, if the learning word area 8 is insufficient,
The first character data (the kana character "na" and the kanji code N4 in FIG. 4) is shifted out, and the data after the next character data (the character "wa" and the kanji code W2) are shifted out in sequence.

(f) Effects of the Invention As described above, the present invention can convert words with affixes without affix processing in kana-kanji conversion, and can also be used in storage units other than kanji dictionary files. Since it has a means to store and search frequently occurring words, it can significantly improve conversion efficiency.

[Brief explanation of drawings]

1, 2, 3, and 4 are block diagrams illustrating an embodiment of the present invention, and the reference numerals used in the figures are as follows. 1 is a keyboard, 2 is a control unit, 3 is a processing unit, 4 is a ROM
, 5 is memory, 6 is dictionary area, 7 is display section, 8 is science 11
1 word area, 9 is Kanji dictionary file, 10 is printer, A
is the input key-1B is the conversion key, A. Kn 1M2. Nt, Sm 1% indicates a kanji code, C a kana character code, P a processing program, and T a conversion command. Dream 4 drunkenness (no <b+ suO0

Claims (1)

[Claims] In a system that has an input section, a kanji dictionary file, and an output section, and converts kana character data from the input section into kanji data and outputs the converted kanji data, the kanji dictionary file stores the kanji data in a memory dedicated for reprinting. and a storage section for storing kanji data retrieved from a chained kanji dictionary file, and means for searching the kanji data in the storage section, and when kana character data is input from the input section, F! & Retrieve the kanji data corresponding to the cough kana character data from the memory exclusively for recording and outputting it to the output section, storing it in the storage section, and subsequently inputting the second character data from the input section 1III. A dictionary file access method characterized in that character data is sometimes converted by accessing the read-only memory after accessing the storage section.