JPS60246472A - Character string processor - Google Patents

Abstract

PURPOSE:To attain a high correct conversion rate in a solid write converting system by adding information for showing a delimiter between words to a converting character string, and executing a processing which is different from that on the way of a sentence based on reading corresponding to said information, in case of reconversion. CONSTITUTION:When an input character string is inputted by an input device 20, it is accumulated temporarily in an input temporary buffer 26, when an input data of a prescribed quantity is accumulated, a KANA (Japanese syllabary)/KANJI (Chinese character) converting algorithm converts it to a KANJI/KANA mixed sentence. As a result of the conversion, in case it is converted erroneously, the part concerned is derived by operating a cursor key in order to correct the erroneously converted character string, and an operation for instructing its reconversion is executed by depressing a converting key. Subsequently, by shifting to a step 204, connecting information is instructed to a converting algorithm as a sentence head, namely, the beginning of the sentence. Also, selection of a candidate example by the longest coincidence method is instructed to the converting algorithm, and among the words converted from the subsequent input character string, a candidate example having the longest reading is selected by the first priority.

Description

[Detailed Description of the Invention] The present invention relates to a character string processing device, particularly a character string processing device, such as a [1-language word processor or translation machine, which derives another character string corresponding to it from a character string including +J]. It relates to a processing device.

For example, in the "kana-kanji conversion" method widely adopted in Japanese word processors, a converted sentence is generated from an input character string on a word-by-word or segment-by-segment basis. This has the disadvantage that since word processing such as confirmation and correction of Kanji words is performed in word units or segmental type (Q), the frequency of operator intervention, that is, the frequency of keystrokes, is high.

On the other hand, in a method called ``solid writing conversion,'' the word breaks are extracted from a string of consecutive reading characters input in kana or romaji notation, and the reading of the word is converted to kanji. Because the character string processing is performed on a sentence-by-sentence basis, there is no need to press the "conversion" key that indicates the break between idioms or segments, as in conventional idioms and segment-cut kana-kanji conversion. It has the advantage that operations can be performed continuously and the operations are simple.

When inputting text using a keyboard, it may be necessary to correct the input character string due to an input error or a change of intention.

Furthermore, when the conversion result differs from the intended one, it is advantageous to be able to correct it with a simple operation. For example, such a correction operation is also required when a conversion algorithm incorrectly extracts a word break. However, in the conventional solid-letter conversion method, even if you move the cursor back to the first character of the incorrectly converted character string and try to reconvert it, as long as the same conversion algorithm is used, the same conversion will be performed again. In most cases, correct conversion results cannot be obtained, so a solid conversion method that achieves a high correct conversion rate is required.

1-'' In view of such demands, an object of the present invention is to provide a character string processing device that has a high correct conversion rate in a solid writing conversion method.

Structure The structure of the present invention will be described below based on one embodiment.

Referring to FIG. 1, an embodiment in which the present invention is applied to a Japanese word processor is shown in a conceptual functional block diagram. As shown in the figure, this embodiment includes an input device 20 such as a keyboard, a display device 22, and a kana-kanji conversion algorithm 24 that performs solid kana-kanji conversion by referring to a kanji dictionary, a grammar dictionary, etc. have

In this embodiment, the input device 20 includes a reading character key for inputting reading (phonetic) characters such as kana or alphabets;
It has a cursor key for moving the cursor +2 (FIG. 3) displayed on the display screen of the display device 22, and a "conversion" key for manually inputting an instruction to convert an input character string into a kanji character.

Of course, the input device 120 has other function keys, but since these are not directly relevant to understanding the present invention, their explanation will be omitted. Note that in this specification, the term "character" includes not only kana or the alphabet, but also punctuation marks and other symbols.

Display device 22 may be, for example, a CRT character display device;
The reading strings input into this system and the strings resulting from kana-kanji conversion are visually displayed. On the display screen, as shown in FIG. 3, the converted character string, which is the conversion result, is displayed on the 22nd line. In addition, in the 24th line, an indication that the conversion mode is automatic kana-kanji conversion mode is displayed in the first half, and the input character string and cursor 12 are displayed inside the parentheses []100 in the second half. Is displayed. Note that herein, the character string after conversion will be referred to as a converted character string.

The kana-kanji conversion algorithm 24 is a functional block that converts an input character string into a kanji-kana mixed character string using a commonly available kana-kanji conversion method. Broadly speaking, this has a word extraction function that extracts words from input reading character data, and a kanji conversion function that converts portions of the extracted words that correspond to kanji into kanji. When a predetermined amount of input character strings is accumulated in the input temporary data buffer 26, the kana-kanji conversion algorithm 24 takes in data indicating a manually read character string, indexes the kanji dictionary and grammar dictionary, and performs the kana-kanji conversion process. Execute. Since the specific processing in these functions is not directly related to the understanding of the present invention, a description thereof will be omitted.

Kana-Kanji conversion algorithm 24 and other blocks are:
It is advantageously realized by a processing system, such as a microprocessor, and is shown in blocks according to its functions in the figure. For example, the input device 20 is associated with a temporary input buffer 26 that temporarily stores input signals generated in response to operations of these keys.

The input data buffer 28 contains a converted character string converted into a mixed kanji-kana sentence by the kana-kanji conversion algorithm 24;
That is, they are bars and fa that temporarily store data indicating the conversion results. This conversion result includes, for each word, data indicating the delimiter (for example, "/" shown in FIG. 4D),
Conversion result data and data indicating its reading are stored in code in association with each other. The input string that has been converted is
The data is deleted from the input temporary buffer 26, and the remaining portions are sequentially set in the kana-kanji conversion algorithm 24.

The display circuit 30 is a circuit that controls the display device 22,
The display data is stored in the display memory 32. The display memory 32 has two storage areas: a conversion line area and a reading area. The contents of the input data bar 28 are transferred to the conversion row area under the control of the display circuit 30. This is displayed by the display circuit 30 on the conversion line, ie, the 22nd line, of the display screen of the display device 22 shown in FIG. Also, in the reading area, there is an input temporary buffer 2.
The contents of B are transferred under the control of the display circuit 30. This is displayed by the display circuit 30 in the input display section of the display screen, that is, in parentheses on the 24th line.

In this embodiment, in order to improve the correct conversion rate in solid writing conversion, the following modification process is performed. That is, basically, (]) When modifying a converted character string that has been converted, the same processing as at the beginning of the sentence is performed without referring to the connection information for the words before and after the word to be modified.

(2) When making corrections, if necessary, select conversion word candidates for the pronunciation character string using the longest match method. That is, words with a large number of characters are selected with priority over words with a small number of characters.

The processing flow executed by the Kana-Kanji conversion algorithm 24 to correct the above-described input character string is shown in FIG. 2, as shown in FIG. 4A and FIG. 3.

For example, the input character string "Kabushikigaishiichitorishimariyakushiichicho" is converted to the intended conversion character string "
An example of a case where the name is amended to ``Director and President of Co., Ltd.'' will be explained.

When the input character string ``Kabushikigaishi◆Torishimariyakushachono'' is input using the input device 20.

This input character string data is temporarily stored in the input temporary buffer γ2B. This is performed by the display circuit 30 in the display memory 3.
2 reading area and displayed on the 24th line of the display screen.

When a predetermined amount of input data is accumulated in the buffer 2B,
The kana-kanji conversion algorithm 24 converts this into, for example, the fourth
The result of this conversion is stored in the input data buffer 28, which converts the sentence into a mixed sentence of kanji and kana, ``Corporation and interest rate manager'' as shown in Figure C. This is because the conversion algorithm determines that the next reading character ``to'' in ``corporate company'' is a case particle that follows the noun, as shown in Figure 4D with ``/'' separating those words. The reading was determined to be significantly incorrect.

In order to correct the erroneously converted character string shown in FIG. (Fig. 3), perform an operation to instruct reconversion, such as pressing the "convert" key.

However, if we refer to the connection information before and after the pronunciation character string "Torishimari", the character "to" will be determined to be a case particle of the noun located before it, and the same incorrectly converted character string (fourth
Figure C) will be obtained.

When it is not a correction process, the "conversion" key is usually not operated, and the control returns to step 2 in response to, for example, the accumulated amount of input character strings in the input temporary buffer 2B reaching a predetermined amount.
Move to 06. In that case, the conversion algorithm 24 is instructed to use the previous part of speech information to refer to the connection information,
It also instructs selection of candidates without using the longest match method.

However, in the case of this example, as shown in FIG.
2, and it is determined that it is a correction process. In the case of correction processing, the process moves to step 204 and the conversion algorithm 24 is executed.
The connection information is specified as the "beginning of the sentence", that is, the "beginning of the sentence". That is, it instructs "same processing as at the beginning of the sentence" in the processing concept (1) described above. Therefore, algorithm 2
4 does not determine the character "to" as a case particle.

In addition to this, appeasement is to instruct the conversion algorithm 24 to select candidates by the longest match method shown in the above-mentioned processing idea (2). This is done by setting the candidate select flag to the longest match method.Other setting conditions may be the same as in normal conversion processing.The conversion algorithm 24 thereby Among them, the candidate with the longest reading, in this case, "control", is selected as the second priority. When the conversion algorithm 24 executes re-conversion under the conversion conditions set in this way (208), ! The intended conversion result as shown in Figure J4B is obtained.

This conversion result is sent to the display memory 32 by the display circuit 30.
is transferred to the conversion line area and displayed on the 22nd line of the display screen. The input character string that has been converted is deleted from the reading area of the memory 32, and the remaining characters are sequentially shifted to the left and displayed on the 24th line, aligned to the left. At this time, the cursor 12 is displayed at the end of the input character string.

Note that the embodiments described here are for explaining the present invention, and the present invention is not necessarily limited thereto, and modifications and variations that can be made by those skilled in the art without departing from the spirit of the present invention. Modifications are within the scope of this invention. For example, in the illustrated embodiment, the conversion line and reading area are configured separately;
However, it is also possible to have a separate reading area, or to store and display the reading characters in the conversion line. It may also be due to the operation of other keys.

肱-1 In this way, the character string processing device according to the present invention adds information indicating the break between words to the converted character string, and when re-converting by correction processing, the character string processing device according to the present invention The processing is different from that in . As a result, a high positive conversion rate is achieved in the solid writing conversion method.

[Brief explanation of drawings]

FIG. 1 is a functional block diagram conceptually showing an embodiment in which the present invention is applied to a Japanese word processor. FIG. 2 is a functional block diagram conceptually showing an embodiment in which the present invention is applied to a Japanese word processor. FIG. 3 is an explanatory diagram showing an example of display in the embodiment shown in FIG. 1; FIGS. 48 to 4D are diagrams showing the operation of the embodiment shown in FIG. 1. FIG. 2 is an explanatory diagram showing an example of an input character string and its converted character string. = 9 of lightning 20, input device 22, display device 24, heta-gaki kana-kanji conversion algorithm 2B,
, Input temporary buffer 28 , Input data buffer 30 , Display circuit 32 , Display memory Patent applicant Ricoh Co., Ltd. Board of Directors and Company Committee Figure 4C Figure 4D of Stock Company and Interests and Titles / Stocks / Company / To / Setsuko / Yasushi / Ri / Us / Table of Procedures Amendment August 18, 1980 Mr. Kazuo Wakasugi, Commissioner of the Patent Office 1. Indication of the case Patent Application No. 101689 filed in 1982 2. Name of the invention Character string processing device 3. Person making the amendment Relationship with the case Patent applicant address 1-3-6 Nakamagome, Ota-ku, Tokyo Name (
No. 74) Ricoh Co., Ltd.-4, Agent address: 1-13-4 Toranomon, Minato-ku, Tokyo 105 5. Subject of amendment: “Drawings” 6. Contents of amendment The drawings submitted at the time of application are the official drawings as shown in the attached sheet. (7 inside the book)
, Attachment + 1 document catalog official drawing 1 copy

Claims (1)

[Scope of Claims] Input means having a reading character key for inputting a first character string in reading character notation, storage means for storing characters, and display means for displaying characters stored in the storage means. , conversion means for sequentially converting the input first character string into a corresponding second character string, and the conversion means is configured to convert the first character string into a corresponding second character string when the first character string is input by the input means. The data is sequentially temporarily stored in the storage means and displayed on the display means, and is sequentially converted into the second character string. A character string processing device, characterized in that the character string processing device stores a character string in association with a character string in the storage means.