JPH0424759A - Document processor - Google Patents

Abstract

PURPOSE:To register a reading KANA (Japanese syllabary) and to improve the efficiency of a reading KANA input processing from the second time by providing a dictionary for the reading KANA other than a normal dictionary for KANA/KANJI (Chinese character) conversion. CONSTITUTION:The document processor is equipped with dictionaries 41, 42 for KANA/KANJI conversion which outputs a word corresponding to the inputted KANA which is KANJI or a mixture of KANA or KANJI, dictionaries 44-1 to 44-M for the reading KANA which output the reading KANA corresponding to each word, and a reading KANA registering means 49 which registers the reading KANA into the dictionary for the reading KANA when it is added to a specific word. Then, the reading KANA can be registered in the dictionaries 44-1 to 44-M for the reading KANA. Thus, when newly adding a reading KANA to the difficult word, etc., it becomes unnecessary to execute the KANA input for the reading KANA when such a word comes up for the second time, and the efficiency of the reading KANA input processing can be improved.

Description

[Detailed Description of the Invention] "Industrial Application Field" The present invention relates to a document processing device that performs kana-kanji conversion to create and edit documents, and in particular adds rubies to difficult-to-read words and kanji in a predetermined format. The present invention relates to a document processing device capable of processing documents.

``Prior Art'' Particularly in general books that use kanji, the pronunciations of words that are difficult to read are displayed using relatively small kana characters. Furthermore, in many documents, the pronunciation is also displayed where a person's name and address are displayed. In order to display such a display, many document processing devices are capable of performing ruby input.

For example, assume that ruby is added above the kanji ``Shiranui'' as follows.

``Shiranui'' Conventional document processing devices with a kana-kanji conversion function performed the following operations in such cases.

(i) Enter the kana name 'L Ranui'.

(ii) Convert this into kanji to obtain the word "Shiranui."

(ji) Switch to ruby input mode, specify its display position, and enter "Shiranui". In this conventional document processing apparatus, in which the ruby ``Shira 岨'' is written in the corresponding display location, the operator has to input the same kana twice for the word or phrase to which the ruby is to be added.

Therefore, when the operator inputs a kana with the device set to ruby automatic input mode, this kana is converted into a sentence containing kanji and kana, and the input kana is displayed in ruby accordingly. A document processing device has also been proposed.

``Problem to be Solved by the Invention'' With this document processing device, for example, if the word ``Shiranui'' is registered in a dictionary for kana-kanji conversion, you can simply input the kana ``Shiranui'' to convert the corresponding kanji. and its ruby are displayed at the same time.

However, even if a kana is input, the corresponding word may not be registered in the dictionary. Even in this case, if the pronunciation of each kanji of a phrase made up of a plurality of kanji matches the pronunciation of the whole phrase, ruby can be added in the same way. For example, even if the word ``Atsushi'' is not registered in the dictionary, inputting the kana ``ton'' will output the single kanji ``atsu'', and inputting the kana ``kou'' will output the single kanji ``atsu''. If the single kanji ``smoke'' is output, the ruby ``tonkou'' can be added to the phrase ``kyodan'' without causing any problems.

However, in the previous example, if the word "Shiranui" was not registered in the dictionary, it would be changed to "fu",
If you obtain the desired kanji by breaking it down into the respective readings of ``chi'' and ``hi'', the furigana will become ``fuchhi''. Therefore, the operator cancels ruby's automatic input mode and selects
It became necessary to input the kana ``Shiranui'' and add ruby characters to the phrase ``Shiranui.''

In addition, in document processing devices equipped with this automatic input mode,
If you set the mode for automatic ruby input, all kanji would be marked with ruby, so if you applied this to general text, it would actually make the page structure difficult to read. Of course, you can turn the automatic input mode on and off each time, but this is a tedious process, and if you neglect to switch it, you may have to input ruby later or delete it. It also required a lot of effort.

Therefore, the first object of the present invention is to provide a document processing method that eliminates the need to input kana for the ruby when such a word appears for the second time, when a new ruby is added to a difficult-to-understand word or phrase. The goal is to provide equipment.

A second object of the present invention is to provide a document processing device that can limit the words and phrases to which rubies are added.

"Means for Solving the Problem" The invention according to claim 1 provides a kana-to-kanji conversion dictionary that outputs words containing kanji or kana-kanji for input kana, and a ruby dictionary corresponding to each word. A document processing device is provided with a ruby dictionary outputting a ruby dictionary and a ruby registration means for registering ruby when a specific word is attached to the ruby dictionary.

In the invention according to claim 2, characterized in that the first object is achieved by preparing a ruby dictionary in addition to the dictionary for kana-kanji conversion, and registering ruby in this dictionary, the input kana A kana-kanji conversion dictionary that outputs words with kanji or kana-kanji mixed in them, and multiple ruby dictionaries that output the ruby corresponding to each word depending on the difficulty of reading the word. , a ruby dictionary selection means for selecting one or more of these ruby dictionaries, and a ruby dictionary selection means for selecting one or more of these ruby dictionaries, and a ruby dictionary selection means for selecting one or more of these ruby dictionaries; The document processing device is provided with ruby registration means for registering ruby.

Then, for example, the range of words to which rubies are added is changed between texts read by junior high school students and texts read by high school students and above, thereby achieving the second purpose.

"Example" The present invention will be described in detail with reference to Examples below.

External Appearance of Apparatus FIG. 2 shows the external appearance of the document processing apparatus used in this embodiment. This document processing device includes a box-shaped control unit 11 that houses a CPU (central processing unit), a display unit 12 placed on the control unit, and a keyboard 13 for inputting text and performing various operations. , and a laser printer 14 for recording created sentences.

The control section 11 has two floppy disk insertion slots 15 and 16 arranged on its front surface. A floppy disk (dictionary floppy) storing a user dictionary is set in the floppy disk insertion slot 15 on the left in the figure, and a floppy disk (document floppy) for storing documents to be created is set in the floppy disk insertion slot 6 on the right. It is now set.

Device Configuration FIG. 1 shows an outline of the circuit configuration of this document processing device. As described above, this device is equipped with a CPU 21, and is connected to various circuit devices through a bus 22 such as a data bus.

Of these, the RAM 23 is a random access memory that stores predetermined programs and necessary work data.

The keyboard 13 is used for inputting data, but a mouse as a pointing device can be connected if necessary. The printer control unit 24 is the laser printer 14
This is a control circuit for connecting. The first disk control section 25 is a circuit for controlling data input/output to a node disk 29 stored inside the control section 11. The hard disk 26 stores programs for controlling various aspects of the document processing apparatus, as well as various dictionaries. The second and third disk controllers 28 and 29 each include a dictionary floppy disk 3
1 and the document floppy 32 is set.=The display control unit 33 is a circuit that performs control to display necessary data on the display unit 12.

FIG. 3 is for explaining the types of various dictionaries used in this embodiment and the outline of their processing.

The dictionaries used in the document processing device of this embodiment include a system dictionary 41, a person name/place name dictionary 42, first to Nth user dictionaries 43-1 to 43-N, and first to Mth ruby dictionaries 4.
4-1 to 44-M.

Of these, the system dictionary 41 is a dictionary that associates basic words with kana and kanji, or words with a mixture of kana and kanji. The person name/place name dictionary 42 is a dictionary containing detailed personal names and place names. 1st to Nth user dictionaries 43-1
-43-N are dictionaries registered and used by users, and among these, the first to (N-1) dictionaries are stored on the hard disk 2 together with the system dictionary 41 and the person name/place name dictionary 42.
It is stored in 6. The Nth user dictionary 43-N can be selected when the dictionary 170 and the dictionary 31 are set, and the user dictionary stored in this dictionary floppy 31 can be used. 1st to Mth ruby dictionary 44-1~
44-M is a dictionary that associates words to which ruby is attached with ruby contents. In this embodiment, the first to third ruby dictionaries 44
-1 to 44-3 constitute these. Among these, the first ruby dictionary 44-1 has registered reading kana for kanji learned at elementary school level, and the second ruby dictionary 44-2 has registered reading kana for kanji learned at junior high school level. is registered. In the third ruby dictionary 44-3, reading kana for kanji that are learned or acquired in high school or thereafter are registered.

These various dictionaries 41 to 44 are arbitrarily connected to a kana-kanji conversion processing section 47, a general dictionary registration processing section 48, and a ruby registration processing section 49 by a selection means 46. For example, when the operator selects the system dictionary 41 and the first user dictionary 43-1 when performing kana-kanji conversion, a search is performed within the range of these two dictionaries, and kana-kanji conversion is performed. The reason why the contents of the dictionary for performing kana-kanji conversion can be selected in this way is to enable appropriate conversion depending on the contents of the document to be created or edited.

The general dictionary registration processing unit 48 includes the first to Mth ruby dictionaries 4
This is the part that performs registration for general dictionaries other than 4-1 to 44-M. The user dictionary 43 is managed for each user, and it goes without saying that a user cannot register in a user dictionary managed by anyone other than himself.

The ruby registration processing unit 49 includes the first to Mth ruby dictionaries 44-
By selectively specifying 1 to 44-M, pairs of ruby and corresponding words are registered.

Kana-Kanji Conversion and Ruby Processing Next, the kanji conversion process for the document processing apparatus of this embodiment will be explained, including ruby processing. When performing such document input processing, an environment setting process is performed to input the following items.

(b) First, the user dictionary 4 used in the kana-kanji conversion process.
3 and the ruby dictionary 44. - When editing a document that has been created twice, the file name is usually registered in the previous process, so unless you specifically change this, you can omit entering the file name. be able to. In the document processing apparatus of this embodiment, a plurality of file names can be input into both the user dictionary 43 and the ruby dictionary 44, respectively.

(b) Start a program for document input.

(c) Instruct the device whether or not to automatically add ruby.

FIG. 4 shows the flow of kana-kanji conversion processing in the document processing apparatus of this embodiment.

The CPU 21 shown in FIG. 1 monitors the input of kana characters from the keyboard 13 (step ■ in FIG. 4).
. If a kana is input, it is sequentially displayed on a display section 12 consisting of a CRT.

- When an instruction to convert a unit kana, for example, "Shiranui" is given from the keyboard I3 (
Step 2; Y>, the kana (search kana character string) that has been input so far is transferred to a predetermined character string storage area in the RAM 23 (step 2). Then, a dictionary search process is performed for this transcribed search kana character string (step ■).

By the way, in this embodiment, the system dictionary 41, the first user dictionary 43-1, and the second and third ruby dictionaries 44-2 and 44-3 shown in FIG. 3 are selected by the selection means 46. . This selection by the selection means 46 is performed, for example, by operating keys on the keyboard 13, prior to the start of the kana-kanji conversion work of the apparatus.

In the dictionary search process for the search kana character string, the second and third ruby dictionaries 44-2 and 44-3 are placed in the first order, the first user dictionary 43-1 is placed in the second order, and the system The dictionary 41 is ranked third. In other words, if the kana stored in the second or third ruby dictionary 44-2 or 44-3 is the same as the search kana character string, this is preferentially selected as the search result and displayed on the display section 12. will be displayed (step ■). When the operator confirms this search result by starting an input operation for the next character (step 2; Y), the work shifts to the next step.

On the other hand, if the search result is not the desired one, skip step (2); N), return to step (2), and search for the next rank. For example, if the same kana character string as the search kana character string exists in either the second or third ruby dictionary 44-2 or 44-3, and the corresponding kanji or other conversion destination word is displayed. Even if this is the case, if this is not the desired one, the first user dictionary 43-1 of the second rank is searched and the result is displayed. First user dictionary 4
If the phrase corresponding to 3-1 does not exist, the third
A search of the system dictionary 41 will be performed based on the ranking.

When the word/phrase of the variable test light for the search kana character string is determined as described above (step ■; Y), the CPU 21 checks whether the automatic ruby mode is set (
Step ■). Here, the automatic ruby mode is a mode in which ruby is automatically added. The operator uses the keyboard 13 to set in advance whether or not the automatic ruby mode is available.

If this document processing device is not set to automatic ruby mode (N), processing for this search kana string ends at this stage after kana-kanji conversion and returns), and then processing for the next search kana string will be started (Ste knob ■~) On the other hand, if the device is set to automatic ruby mode (step ■; Y), the search kana string will be changed to the second or third ruby Dictionary 44-2
．． 44-3, it is checked whether it has been searched.

And if it is not searched in these dictionaries, then (N
), if the operator does not input an instruction that rubies are required from the keyboard 13 (step 2; N), the process ends without adding rubies (return). For example, regarding the search kana character string "Kakkou", since it can be read before entering junior high school, the pair of this character string and the word "school" to which the ruby is added is registered in the first ruby dictionary 44-1. Suppose that it had been done. In this case, the second and third ruby dictionaries 44-2 selected in this embodiment
．． The search kana character string "Kakko" is not registered in 44-3. Therefore, even if automatic ruby mode is selected, if you are creating a document intended for middle school students and above, ruby will not be added to the word "school."

On the other hand, when a search is made using either of these dictionaries 44-2 or 44-3, it is assumed that the reader is a junior high school student or older and does not know how to read it, so it is necessary to add the ruby to the converted word. . Therefore, the search kana characters stored in the character string storage area are displayed as ruby in the corresponding conversion destination phrase (step 0). For example, the search kana character string "Shiranui" is in the third ruby dictionary 44-
If it is registered in 3, the converted word "Shiranui"
, the phrase "Shiranui" stored in the character string storage area will be added as ruby.

The above theory is explained in the first to third ruby dictionaries 44-1 to 44-
This assumes that 3 is complete.

It may also be necessary to add ruby to words that are not registered in the second and third ruby dictionaries 44-2 and 44-3. In such a case, (step 0; Y
), the ruby is registered in any one of the first to third ruby dictionaries 44-1 to 44-3 (step 0). In some cases, ruby is added to the corresponding word or phrase.

In this way, in the document processing device of this embodiment, by appropriately selecting the first to third ruby dictionaries 44-1 to 44-3, it is possible to attach ruby only to difficult-to-read words, or to attach ruby to all words. It becomes possible to select the range to add ruby, such as adding .

Ruby Registration FIG. 5 specifically represents the ruby registration process explained in step O of FIG. 4, and shows the function of the ruby registration processing section shown in FIG. 3.

In the ruby registration process, the operator first presses the keyboard 13
Using the cursor keys (not shown) above, specify the first character of the character string to which ruby is to be added (Step 2 in Figure 5). FIG. 6 shows the cursor 51 when adding ruby to the converted kanji "shiranui" displayed on the display section 12.
This shows how the first character is indicated by.

Note that if the operator does not specify the first character of the character string and instead presses the unillustrated cancel key on the keyboard 13, the ruby registration operation is canceled in step As a result, the registration process is completed (end).

Once the first character of the string is specified, the last character of the string is specified using a similar operation (step ■). In this case as well, the operator can use the cancellation key to end the registration work (step ■).

Once the character string to be registered in ruby is specified in the above steps,
This character string designated for adding ruby among the character strings stored in the character string storage area described in step (2) in FIG. 4 is stored in the registered character storage area of the RAM 23 (step (2)). Then, it waits for the operator's ruby input (step ■).

When the operator inputs ruby using the keyboard 13 (step ■; Y), the ruby is displayed on the display unit 12 from the beginning of the specified character string (step ■). The display size of ruby may be, for example, 1/4 of the area of a normal character size. Ruby input and correction are continued until the operator confirms the completion of ruby input.

When the ruby input is completed, the CPU 21 displays a selection display in which of the first to third ruby dictionaries 44-1 to 44-3 should the ruby be registered (step ■), and requests the operator to make a selection (step 0).

The operator considers the difficulty of the word and uses the ruby dictionary 4.
Select from 4-1 to 44-3 (Y). Then CPU2
1 registers the ruby determined in step ① and the character string stored in the registered character storage area as a pair in the selected ruby dictionary 44 (step 0).

As a result, from the next time onwards, when the same kana as this ruby is input, the character string registered in this ruby dictionary 44 will be the character string with the highest priority and will be converted.

In the example described above, the operator selected the ruby dictionary in which ruby is registered, but a table containing the difficulty of the kanji that make up the word and special idioms is prepared, and the device uses this to refer to the table. You may select a dictionary using .

"Effect of the Invention" As described above, according to the invention described in claim 1, since a ruby dictionary is prepared in addition to the usual kana-kanji conversion dictionary, ruby can be registered in this latter dictionary. This makes it possible to improve the efficiency of ruby input processing from the second time onward.

Furthermore, according to the invention set forth in claim 2, a plurality of ruby dictionaries are prepared according to the difficulty level of reading the words, and these can be selected and used. This has the advantage that ruby processing can be carried out extremely easily.

[Brief explanation of the drawing]

The drawings are for explaining one embodiment of the present invention. Among them, FIG. 1 is a block diagram showing the main part of the circuit configuration of the document processing device, FIG. 2 is a perspective view showing the external appearance of the device, and FIG. The figure is an explanatory diagram showing various dictionaries and their selection process, Figure 4 is a flowchart showing the flow of kana-kanji conversion process, Figure 5 is a flowchart showing the flow of ruby registration process, and Figure 6 is a flowchart showing the flow of ruby registration process. FIG. 3 is a plan view of the main part of the display section showing a state in which the beginning of a character string to which is attached is indicated with a cursor; 11..., 12...display section, 13...
...Keyboard, 21...CPU. 23...RAM. 26...Hard disk, 1...Dictionary floppy, 1...System dictionary, 2...Person name/place name dictionary, 3...User dictionary, 4...Ruby dictionary, 9...Ruby registration processing section. Applicant Fuji Xerox Co., Ltd. Agent Patent attorney Umeo Yamauchi and one other person Figure 2, ? -) Figure 3'3fL36〉Figure-5

Claims (1)

[Claims] 1. A kana-kanji conversion dictionary that outputs words containing kanji or kana-kanji for input kana, and a ruby dictionary that outputs ruby corresponding to each word. A document processing device comprising: a ruby registration means for registering a ruby added to a specific word in the ruby dictionary. 2. A kana-kanji conversion dictionary that outputs kanji or words containing kana-kanji for the input kana, and a ruby corresponding to each word, which is set according to the difficulty of reading the word. a plurality of ruby dictionaries arranged in such a manner; a ruby dictionary selection means for selecting one or more of these ruby dictionaries; and a ruby dictionary selection means for selecting one or more of these ruby dictionaries; 1. A document processing device comprising: ruby registration means for registering ruby in a corresponding dictionary among the dictionaries for use.