JPH10187705A - Method and device for document processing - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a method and device for document processing that can correct a KANJI (Chinese character)-KANA (Japanese syllabary) mixed character string into another KANJI-KANA mixed character string in different notation with the same reading through an easy operation. SOLUTION: When a KANJI-KANA mixed character string, which is determined once is reconverted (d1), a candidate for a KANA reading of a KANJI- KANA mixed character storing consisting of a desired indicated phrase and a candidate for KANJI-KANA mixed notation based upon one KANA reading candidate are found and displayed (d2), and when another KANA reading candidate is selected (d3), KANA-KANJI conversion is performed on the basis of the selected KANA reading to find and display a candidate for KANJI-KANA mixed notation (d4). When one of found candidates for the KANA-KANJI mixed notation is selected, the KANJI-KANA mixed character string consisting of the desired phrase is determined as the selected KANJI-KANA mixed notation (d5 and d6). Further, it is made possible to change the break of a phrase in the KANA reading.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a document processing method and apparatus, and more particularly, to a document processing method for correcting a character string mixed with kanji kana into another character string mixed with kanji kana with the same reading and different notation. It concerns the device.

[0002]

2. Description of the Related Art Conventionally, when inputting a character string mixed with kanji and kana using kana-kanji conversion, it is necessary to select a homonymous word of a kanji. However, many ordinary Japanese word processors allow you to select homonyms only immediately after Kana-Kanji conversion, and if you want to correct homonyms once the character string is determined immediately after conversion. Is
There was a problem that a kana character string had to be input again and converted.

[0003] To solve this problem, for example,
As disclosed in Japanese Patent Application Laid-Open No. 56-92676, a new Kanji-Kana conversion device is provided, and a character string mixed with Kanji-Kana is converted into a Kana character string using a word dictionary and a grammar dictionary. There is known a method of performing kana-kanji conversion on a column again.

[0004]

However, in the above conventional example, since there are generally a plurality of readings for kanji, a large number of homonyms of a character string mixed with kanji kana corresponding to the reading appear. It was not easy to obtain a character string mixed with the desired kanji kana from inside. First of the present invention
SUMMARY OF THE INVENTION It is an object of the present invention to provide a document processing method and a document processing method capable of easily modifying a character string mixed with kanji kana into another character string mixed with kanji kana with the same reading and different notation by a simple operation.

The operation of correcting homonyms performed immediately after Kana-Kanji conversion is performed when there is only one reading to be converted into Kana-Kanji. If there is more than one kana-kanji conversion target when performing kana-kanji conversion again after performing kanji-kana conversion on a column, it was impossible to make both kana-kanji conversion operations identical. . However, the frequency of the operation of correcting homonyms performed immediately after Kana-Kanji conversion is
Since the frequency of the operation of correcting the homonym for the confirmed kanji kana-mixed character string is higher than that, the operation of correcting the homonym for the confirmed kanji kana-mixed character string is performed immediately after performing the kana-kanji conversion. Preferably, it can be performed in the same manner as the operation of correcting homonyms.

A second object of the present invention is to easily convert a character string mixed with kanji kana into another character string mixed with kanji kana with the same reading and different notation, and with the same operation as kana-kanji conversion. An object of the present invention is to provide a document processing device and a document processing method that can be modified. Furthermore, if the conversion of kana to kanji is corrected by incorrectly separating the phrases, there is a need to ask for readings for a plurality of phrases, and there are many combinations of readings. Character strings become huge, and it is not easy to obtain the desired character string mixed with kanji and kana.

A third object of the present invention is to convert a kanji-kana mixed character string into another kanji-kana mixed character string with the same reading and a different notation even if the kanji-kana kana conversion is performed with an incorrect segment break. An object of the present invention is to provide a document processing apparatus and a document processing method which can be easily and easily corrected.

[0008]

In order to solve this problem, a document processing method according to the present invention provides a kanji kana for obtaining and displaying kana reading candidates for a kanji kana mixed character string comprising a designated desired phrase. A kana-kanji conversion step of performing kana-kanji conversion based on the selected kana reading and obtaining and displaying a kana-kana mixed notation candidate, and selecting one of the kana-kana mixed notation candidates, A character string determining step of determining the character string mixed with the kanji kana corresponding to the selected kana reading into the notation mixed with the selected kanji kana.

Here, the kana-kanji conversion step includes a phrase separation changing step of changing a phrase break in the selected kana reading. In addition, the method further includes a determining step of determining whether the conversion is a kana-kanji conversion after inputting a kana or a re-conversion of a character string mixed with kanji kana once determined, when an input is made from a predetermined conversion key. If it is re-conversion, the kanji-kana conversion step is executed, and if it is not re-conversion, the kanji-kana conversion step is skipped.

In the document processing method of the present invention, a kana reading candidate for a kanji kana mixed character string composed of a designated desired phrase and a kanji kana mixed notation candidate based on a certain kana reading candidate are obtained and displayed. A character string change candidate creating step, and if another kana reading candidate is selected, perform kana-kanji conversion based on the selected kana reading to obtain and display a candidate for a kana-kana mixed kana-kanji character. When one of the kanji-kana mixed notation candidates obtained in the conversion step and the character string change candidate creating step or the kana-kanji conversion step is selected, the kanji-kana mixed character string consisting of the desired phrase is converted to the selected kanji. And a character string determining step of determining the kana mixed notation.

Here, the method further includes a phrase separation changing step of changing a phrase separation in kana reading. In addition, the method further includes a determining step of determining whether the conversion is a kana-kanji conversion after inputting a kana or a re-conversion of a character string mixed with kanji kana once determined, when an input is made from a predetermined conversion key. ,
If it is a re-conversion, the above-described character string change candidate creating step is executed, and if not, the character string change candidate creating step is skipped.

Further, the document processing apparatus of the present invention comprises a kanji-kana conversion means for obtaining a kana-kana-kana conversion candidate for a kanji-kana-mixed character string composed of a designated desired phrase, and a kana-kana-kanji conversion based on the selected kana-kana reading. And selecting one of the kana-kana mixed notation candidates for obtaining the kana-kana mixed notation candidate, and selecting the kanji kana mixed character string corresponding to the selected kana reading, by selecting one of the kana-kana mixed notation candidates. A character string determining means for determining a kanji kana mixed notation, and changing a kanji kana mixed character string consisting of a designated desired phrase to another kanji kana mixed character string of a different notation with the same reading. .

[0013] Here, there is further provided candidate display means for displaying the kana reading candidate and the kanji kana mixed notation candidate in a selectable manner, and the candidate display means comprises a kana reading kana and kanji kana mixed notation. It is displayed so that it can be distinguished from the candidate. Further, the kanji kana conversion means includes a kana reading candidate search means for obtaining the kana reading candidate by referring to at least a kanji index dictionary based on a phrase including a kanji, and a kana reading candidate corresponding to the phrase including the kanji. And a first storage unit for storing a kana-kana mixed notation candidate for obtaining a candidate for the kana-kana mixed notation by referring to at least a kana heading dictionary based on the phrase of the kana reading candidate. Search means; and second storage means for storing the kanji kana-mixed notation candidates corresponding to the kana reading candidates, wherein the candidate display means includes a predetermined candidate from the first and second storage means. And a third storage unit for selecting and storing each of them in association with each other. In addition, there is further provided a phrase separation changing means for changing a phrase separation in the kana reading. Further, when an input is made from a predetermined conversion key, a determination means is further provided for determining whether the conversion is a kana-kanji conversion after inputting a kana or a re-conversion of a character string mixed with kanji kana once determined. If it is not a re-conversion, the kanji-kana conversion by the kanji-kana conversion means is stopped.

[0014]

Embodiments of the present invention will be described below in detail with reference to the drawings. <Example of Overall Configuration of Document Processing Apparatus According to Embodiment> FIG.
1 is an example of the overall configuration of a document processing apparatus according to the present embodiment.
In the configuration shown in the figure, reference numeral 11 denotes a CPU, which performs calculations for character processing, logical judgment, etc., and performs address bus AB,
Each component connected to those buses is controlled via a control bus CB and a data bus DB. The address bus AB transfers an address signal indicating a component to be controlled by the CPU 11. Control bus C
B transfers and applies a control signal of each component to be controlled by the CPU 11. The data bus DB
Data transfer between the constituent devices is performed.

The ROM 12 is a fixed read-only memory. The ROM 12 has a program area 12a in which a control procedure by the CPU 11, which will be described later with reference to FIGS. The RAM 13 stores one word 3
This is a writable random access memory having a 2-bit configuration, and is used for temporarily storing various data from each component. The RAM 13 includes a document buffer, a key buffer,
Input kana buffer, input kanji buffer, input buffer,
Buffer areas 13a such as a kana clause buffer, a kanji clause buffer, a kana clause candidate buffer, a kanji clause candidate buffer, a conversion result buffer, and a conversion candidate buffer, and dictionary areas 13 such as a kana headline dictionary, a kanji headline dictionary, and a word learning dictionary.
d, a pointer area 13c for a start position, a delimiter position, an output position, a target phrase position, etc., a control flag area for mode, conversion, and the like, and a program load area for loading and operating a program from an external storage device. It is configured.

Here, the role of each area in the RAM 13 is as follows. (Buffers) A "document buffer" is a buffer for storing and holding the contents of a document being created, and is generally used in the same type of character processing apparatus that creates a document. Is omitted. "Key Buffer"
Is a buffer for storing key codes input from the keyboard.

The "input kana buffer" is a buffer for storing a kana character string input from a keyboard when performing character input using kana-kanji conversion (conversion from a kana character string to a character string mixed with kanji kana). Yes, it is generally used in the same type of character processing device that performs kana-kanji conversion, and therefore detailed description is omitted. "Input Kanji Buffer"
Is the kanji re-conversion for the character string mixed with kanji kana in the document buffer.
When using, the character string to be re-converted
This is a buffer that stores
The structure is the same as the input kana buffer. The "input buffer" is a buffer for storing a character string of one phrase for obtaining a candidate for kana-kanji conversion or kanji-kana conversion, and has the same structure as the input kana buffer.

The "kana phrase buffer" is a buffer for storing one of the results of performing the kana-kanji conversion on the kana character string stored in the input kana buffer, and will be described later in detail with reference to FIG. The “kanji phrase buffer” stores one of the results of performing a kanji kana conversion (conversion from a kanji kana mixed character string to a kana character string) on the kanji re-conversion target character string stored in the input kanji buffer. This is a buffer, and details will be described later with reference to FIG. "Kana clause candidate buffer"
Is a buffer that stores all kana-kanji conversion candidates for the kana character string of one phrase stored in the input buffer, and will be described later in detail with reference to FIG. The "Kanji phrase candidate buffer" is a buffer for storing all the Kanji / Kana conversion candidates for the Kanji / Kana character string of one phrase stored in the input buffer, and will be described later in detail with reference to FIG.

The "conversion result buffer" is a buffer for storing a character string to be displayed in a conversion window displayed on the screen when performing kana-kanji conversion or kanji re-conversion. One conversion result of kana-kanji conversion or kanji re-conversion is displayed in the conversion window. Since the conversion result buffer is generally used in the same type of character processing device that performs kana-kanji conversion, detailed description is omitted. The "conversion candidate buffer" is a buffer for storing a character string to be displayed in a conversion candidate window that is displayed when performing kana-kanji conversion or kanji re-conversion. In the conversion candidate window, a plurality of candidates that can be selected as conversion results of kana-kanji conversion or kanji re-conversion are displayed. Since the conversion candidate buffer is generally used in the same type of character processing device that performs kana-kanji conversion, detailed description is omitted.

(Dictionaries) A “kana heading dictionary” is a word dictionary in which the reading of a word referred to when performing kana-kanji conversion is used as a heading. Therefore, detailed description is omitted. The “kanji heading dictionary” is a word dictionary whose heading is a notation of a word that is referred to when performing morphological analysis on a sentence mixed with kanji kana, and has the same structure as the kana heading dictionary. However, while the kana headline dictionary stores word readings as headwords and associates word notations, the kanji headline dictionary stores word notations as headwords and stores word readings in association. I have.

The "word learning dictionary" is a dictionary in which information of one word is stored in correspondence with reading of words, expressions, and parts of speech.
Word information is stored in the most recently used order from the beginning of the dictionary. When the capacity of the dictionary is full, the oldest word, that is, the word at the end of the dictionary is deleted from the dictionary, and the latest word is stored at the head of the dictionary. The word learning dictionary is generally used in the same type of character processing device that performs kana-kanji conversion, and a detailed description is omitted.

(Control flags) The "mode" is a flag for discriminating between a mode in which character input is performed and a mode in which kanji re-conversion is performed. In the mode in which character input is performed, "0" is stored. In the mode in which kanji re-conversion is performed, 1 is stored. "Conversion" is a flag for specifying whether to perform kana-kanji conversion or kanji-kana conversion for conversion processing described later. If 0 is stored in the conversion, the conversion processing performs kana-kanji conversion. , When 1 is stored in the conversion, the conversion process performs Kanji Kana conversion.

(Pointers) The "start position" is a variable indicating the head of a character string to be converted among character strings stored in an input kana buffer or an input kanji buffer in a conversion process described later. . The number of characters from the head of the input kana buffer or the input kanji buffer to the conversion target and the first character of the character string are stored. Therefore,
When 0 is stored at the start position, all character strings stored in the input kana buffer or the input kanji buffer are
Be subject to conversion. The “separation position” is a variable that specifies the number of characters of a character string before conversion of the first clause in the conversion processing described later. If 0 is stored in the delimiter position, it is considered that the number of characters of the first clause is not specified. If a value other than 0 is stored at the delimiter position, the conversion is performed so that the number of characters of the character string before conversion of the first clause matches the delimiter position. The “output position” is a variable that specifies the position of a kana clause buffer or a kanji conversion buffer that outputs a conversion result in a conversion process described later. When 0 is stored in the output position, the conversion result is stored from the beginning of the kana phrase buffer or the kanji phrase buffer. When a value other than 0 is stored in the output position, the conversion result is stored from the end of the phrase in the same number as the output position stored in the kana phrase buffer or the kanji phrase buffer.

The "target phrase position" is a variable indicating the position of a phrase cursor displayed in a conversion window described later. When the phrase cursor is located at the beginning of the conversion window, the value of the focused phrase position is 0. Thereafter, each time the phrase cursor position moves to the end one by one, the value of the focused phrase position is increased. Increases by one. Again, FIG.
Return to the description of A.

A keyboard 15 is provided with various function keys such as alphabet keys, hiragana keys, katakana keys, character symbol input keys such as punctuation marks, and a cursor movement key for instructing cursor movement. D
The ISK 14 is an external memory such as a floppy disk for storing document data and the like. The DISK 14 has a document data storage area 14c, in which document data and the like are stored as needed, and the stored data is called up when required by an instruction from a keyboard. The RAM 13 has a dictionary storage area 14a.
And a backup of the dictionaries stored in the database and other large-capacity dictionaries. The program storage area 14b stores the RA
The program loaded and executed in M13 is stored.

FIG. 1B shows an example of the data storage configuration of the disk 14. The dictionary storage area 14a has a grammar dictionary used for segmentation and the like in addition to the kana headline dictionary, the kanji headline dictionary, and the word learning dictionary. The program storage area 14b particularly includes a kana-kanji conversion module, a kanji-kana conversion module, a phrase separation change module, and a re-conversion control module used in the present embodiment. The document data storage area 14c stores document data to be subjected to input / conversion / edit processing.

Referring back to FIG. 1A. CR16 is a cursor register. The CPU 11 can read and write the contents of the cursor register. A CRT controller (CRTC 18) described later displays a cursor at a position on the CRT 19 with respect to the address stored here. D
BUF 17 is a display buffer memory for storing patterns of data to be displayed. CRTC18 is CR16 and D
It plays a role of displaying the contents stored in the BUF 17 on the CRT 19. The CRT 19 is a display device using a cathode ray tube or the like. Further, CG1a is a character generator for storing patterns of characters and symbols to be displayed on the CRT 18.

The document processing apparatus according to the present embodiment comprising the above components operates in response to various inputs from the keyboard KB15.
When the input from B15 is supplied, first, an interrupt signal is sent to the CPU 11, and the CPU 11
Various control signals stored in the memory 3 are read out, and various controls are performed in accordance with the control signals.

<Example of Operation of Document Processing Apparatus According to Embodiment> FIGS. 2 and 3 show an example in which a character input using kana-kanji conversion is executed in the document processing apparatus according to the present embodiment having the above configuration. This will be described below with reference to FIG. (Operation Example 1) FIG. 2 is a diagram showing an operation example of inputting a character string "Today is hot" in a document by character input using kana-kanji conversion. As the first candidate for kana-kanji conversion, the same phonetic word as “Kyo is hot.” Is incorrectly converted, and a candidate changing operation for converting a phrase candidate into another candidate is performed.

(A1) shows a display example of a part of the screen of the document processing apparatus. In the figure, aa indicates a character cursor in a document. The character cursor indicates a character in the document to be subjected to various editing operations, and various editing operations are performed on the character at the position of the character cursor in the document. (A1) indicates that no character exists at the position of the character cursor. In the state of (a1), if the kana string "Kyo wa Ato." Is input using the character keys, the screen display will be as shown in (a2).
In this example, the kana input mode may be any one of a kana input mode and a romaji mode, regardless of the invention.

In the state (a2), the input character string is not stored in the document buffer, but is stored in the input kana buffer. ab is a conversion window, which is a window for displaying an input kana buffer storing a kana character string to be subjected to kana-kanji conversion, a conversion result of kana-kanji conversion, and the like. ac is a kana input buffer character cursor indicating a character stored in the kana input buffer, and various editing is performed on the character indicated by the kana input buffer character cursor. When the conversion key is input in the state of (a2), the display on the screen is as shown in (a3).

(A3) is a state in which the kana-kanji conversion is performed on the kana character string stored in the kana input buffer in the state of (a2), and the result of the kana-kanji conversion is displayed. Even in this state, the character string mixed with kanji and kana, which is the result of the kana / kanji conversion, is not stored in the document buffer. The result of the kana-kanji conversion is composed of one or more phrases. In (a3), the result of the kana-kanji conversion is composed of two phrases, “Kyo wa” and “Hot.” ad indicates a phrase cursor. The phrase cursor indicates a phrase to be edited, and various editing operations are performed on the phrase indicated by the phrase cursor. The phrase pointed to by the phrase cursor is hereinafter referred to as a “target phrase”. This state is a state in which a phrase to be operated can be selected, and is referred to as a “phrase selection state”. When the next candidate key is input in the state of (a3), the screen is displayed as shown in (a4).

(A4) is a state where a candidate for kana-kanji conversion next to the noticeable phrase in (a3) is displayed. (A
In 4), a list of kana-kanji conversion candidates for the target phrase is displayed, and the display of the target phrase in the conversion window is as follows.
The next candidate of the kana-kanji conversion in (a3), “Today is”, is displayed. ae is a conversion candidate window;
It is a window that displays kana-kanji conversion candidates for the noticeable phrase. af is a conversion candidate cursor, which indicates a candidate for kana-kanji conversion at that point in the phrase of interest. By providing a conversion candidate cursor in the conversion candidate window, it becomes possible to know what the conversion candidate next to the noticed phrase is. This state is a state in which a candidate for a target phrase can be selected, and is referred to as a “phrase candidate selection state”. When the enter key is input in the state of (a4), the display on the screen is as shown in (a5).

In (a5), the conversion candidate window displayed in (a4) disappears and the phrase is selected. When the enter key is pressed in the state of (a5), the screen display is as shown in (a6). (A6) is a state where the character string displayed in the conversion window of (a5) is stored in the document buffer. The conversion window displayed in (a5) disappears, and the character string displayed in the conversion window is inserted before the character pointed to by the character cursor in the document buffer.

(Operation Example 2) FIG. 3 is a diagram showing an operation example of inputting a character string "during taking" into a document by character input using kana-kanji conversion. As the first candidate for the kana-kanji conversion, the word "blowing larva" is incorrectly converted into a segment break, and a segment change operation for changing the segment break is performed.

(B1) shows a display example of a part of the screen of the document processing apparatus. (B1) indicates that no character exists at the position of the character cursor. (B
In the state of 1), when the kana string "Fukuyochu." Is input using the character keys, the display on the screen is as shown in (b2). (B2) shows a state in which the input character string “Fukuyochu” is stored in the input kana buffer and is displayed in the conversion window. When the conversion key is input in the state of (b2), the state becomes (b3).

(B3) shows a state in which the result of the kana-kanji conversion performed on the character string displayed in the conversion window of (b2) is displayed. This state is a phrase selection state. As a result of the kana-kanji conversion, two of "blown" and "larva"
It is a phrase, and the phrase cursor is positioned at "blowing" of the first phrase. When the decompression / expansion key is input in the state of (b3), the state changes to (b4).

(B4) shows the state of the conversion window for specifying the segment break position. In the conversion window, a kana character string to be subjected to the kana-kanji conversion displayed in the conversion window of (b2) and "@" indicating the delimitation of the first phrase of the kana character string are displayed.
In this state, the kana character string "fuku" of the first phrase "blow" in (b3) is appended with the first kana character "yo" of the kana character string "yochu" of the next phrase "larva". "Fukuyo" is specified as the delimiter of the first clause. This state is a state in which a segment break can be selected, and is referred to as a “phrase segment selection state”. When the decompression / expansion key is input in the state of (b4), the state of (b5) is set.

(B5) also shows the state of the conversion window designating the segment break position, which is the segment break selection state. The kana character string of the head clause is extended by one character from the state of (b4) to "Fukuyo".
When the conversion key is input in the state of (b5), the state becomes (b6). (B6) shows the result of the kana-kanji conversion performed on the kana character string displayed in the conversion window of (b5) so that the first phrase is separated at the delimiter position shown in (b5). It is displayed. As a result of the kana-kanji conversion, there are two phrases, “dose” and “medium”, and the phrase cursor is positioned at the first phrase “dose”. When the enter key is input in the state of (b6), the state changes to (b7).

(B7) is a state where the character string displayed in the conversion window of (b6) is stored in the document buffer. The conversion window of (b6) disappears, and the character string displayed in the conversion window is inserted before the character pointed to by the character cursor in the document. Next, in this document processing apparatus, an example in which kanji re-conversion for changing a kanji kana mixed character string in a document buffer to another kanji kana mixed character string with the same sound (same reading) and a different notation is executed is shown in FIG. This will be described below with reference to FIGS.

(Operation Example 3) FIG. 4 is a diagram showing an operation example of changing a phrase candidate by kanji reconversion. FIG. 4 shows an operation example in which “Today is hot.” In the document is changed to “Kyoto is hot.” (C1) illustrates a display example of a part of the screen of the document processing apparatus. (C1) indicates that the character cursor is positioned after the character string “It is hot today.” In the document. When the previous sentence key is opened twice in the state of (c1), the state becomes (c2).

(C2) is a state in which the character cursor has moved two sentences before (in the direction of the beginning of the sentence) with respect to the state of (c1), and the character cursor is at the “now” position. When the next candidate key is input in the state of (c2), the state becomes (c3). (C3) is a state in which, for the character string starting from the position of the character cursor in the state of (c2), the next candidate of the kanji re-conversion for the first phrase and other candidates are displayed. (C3) is a phrase candidate selection state in which a candidate for the target phrase can be selected. Since the character string in the document buffer starting from the character cursor position in the state of (c2) is a character string to be re-converted to a kanji, it is referred to as a “re-conversion target character string”. In (c3), “Today is hot.” Is the character string to be converted again. In (c3), the head clause of the character string to be reconverted is determined to be “today”. Then, the phrase “Today is” is a featured phrase,
Character strings to be re-converted other than the focused phrase are displayed in the conversion window. The display of the noticeable phrase in the conversion window is
"Kyoha" is the next candidate for Kanji reconversion. Furthermore, the reading of the noticeable phrase is “Kyoha”, and the kana-kanji conversion candidates “Kyou wa”, “Kyoha”, and “Kyoha” for the reading of the noticeable phrase are displayed in the conversion candidate window. The first candidate of the conversion candidate window is the first phrase of the character string to be re-converted, and the conversion candidate cursor is positioned at “Kyoha”, which is the next candidate for kanji re-conversion. In addition, at the end of the conversion candidates window, reading relative to the beginning of the clause of the re-conversion object character string "Today" candidate "Hello ..." is displayed. At the end of "Hello ...", "..." is an identification symbol indicating that it is a candidate for the reading of attention clause of the re-conversion target string. "Kyowa" is also a candidate for reading, but "Kyoha" is not displayed as a candidate for reading because it is a reading of a noteworthy phrase. (C
When the enter key is input in the state of 3), the state becomes (c4).

In (c4), the conversion candidate window displayed in (c3) disappears and the phrase is selected.
When the enter key is input in the state of (c4), the state changes to (c5). (C5) is a state where the character string to be re-converted in the document buffer is replaced with the character string displayed in the conversion window of (c4). The conversion window of (c4) disappears, and the character string to be re-converted “Today is hot” in the document buffer is replaced with the character string “Kyo is hot” displayed in the conversion window.

(Example of Operation 4) FIG. 5 is a diagram showing an example of an operation of converting a phrase reading candidate by kanji re-conversion and then re-converting the kanji. FIG. 5 shows an operation example in which “Today is hot.” In the document is changed to “Kyoto is hot.” (D
1) shows a display example of a part of the screen of the document processing apparatus. (D1) indicates that the character cursor is located at the position of the first character "now" in the character string "Today is hot." When the next candidate key is input in the state of (d1), the state becomes (d2).

In (d2), for the character string to be reconverted starting from the position of the character cursor in the state of (d1), the next candidate of the kanji reconversion for the first phrase and other candidates are displayed. State. (D2) is a phrase candidate selection state in which a candidate for the target phrase can be selected. (D
In 2), “Today is hot.” Is the character string to be reconverted, and the first phrase of the character string to be reconverted is determined to be “Today is”. Then, the phrase “Today is” is a featured phrase,
Character strings to be re-converted other than the focused phrase are displayed in the conversion window. The display of the noticeable phrase in the conversion window is
Is the next candidate of Kanji re-conversion is "Hello". In addition, reading of attention clause is "Hello", the conversion candidate window, candidate "today" of the kana-to-kanji conversion for a reading of interest clause, "Hello" is displayed. The head of the candidate of the conversion candidate window is the beginning of the clause of the re-conversion object character string, conversion candidates cursor is located in the next candidate of Kanji re-conversion "Hello".
Also, at the end of the conversion candidate window, a reading candidate “Kyoha…” for the first phrase “Today is” of the character string to be reconverted is displayed. "Hello" is also a candidate for reading but, "Hello", so are reading of attention clause, it does not appear as a candidate for reading. When the next candidate key is input in the state of (d2), the state becomes (d3).

(D3) is a state in which the conversion candidate cursor is moved to the next conversion candidate in the state of (d2), which is a conversion candidate selection state. The conversion candidate cursor is moved to the next candidate "Kyowa ..." in the conversion candidate window, and the display of the noticeable phrase in the conversion window is also the next candidate "Kyowa ...". When the enter key is pressed in the state of (d3), the state changes to (d4).

In (d4), the reading of the phrase of interest is changed to "Kyowa", and the conversion candidate is selected. The character string to be re-converted for the noticed phrase is the same as in the case of (d3), and remains “today”. The display of the noticeable phrase in the conversion window is “Kyoha”, which is the next candidate for kanji re-conversion when the reading of the noticeable phrase is “Kyowa”. In addition, in the conversion candidate window, kana-kanji conversion candidates for today's phrase reading, "Kyou wa", "Kyo wa",
"Today" is displayed. The first candidate of the conversion candidate window is the character string to be reconverted for the phrase of interest, and the conversion candidate cursor is positioned at “Kyoha”, which is the next candidate for kanji reconversion. In addition, at the end of the conversion candidates window, reading relative to the beginning of the clause of the re-conversion object character string "Today" candidate "Hello ..." is displayed.
"Today" is also a candidate for reading, but "Today"
Since it is a reading of the noticed phrase, it is not displayed as a reading candidate. When the enter key is input in the state of (d4), the state becomes (d5).

In (d5), the conversion candidate window displayed in (d4) disappears and the phrase is selected.
When the enter key is input in the state of (d5), the state changes to (d6). (D6) is a state where the character string to be re-converted in the document buffer is replaced with the character string displayed in the conversion window of (d5). The conversion window in (d5) disappears, and the character string to be re-converted “Today is hot.” In the document buffer is replaced with the character string “Kyo is hot.” Displayed in the conversion window.

(Operation Example 5) FIG. 6 is a diagram showing an operation example of changing a segment break for reading in kanji re-conversion. FIG. 6 shows an operation example in which the character string “blowing larva” in the document is changed to “during taking”. (E1) shows a display example of a part of the screen of the document processing apparatus of the present invention.
(E1) indicates that the character cursor is located at the position of the first character "blow" of the character string "blowing larva" in the document. When the decompression / expansion key is input in the state of (e1), the state changes to (e2).

(E2) is a state in which candidates for segment breaks are displayed in the conversion window and the conversion candidate window for the character string to be re-converted starting from the character cursor position in (e1), and a segment break is selected. This is the state of selecting a segment break. The conversion candidate window displays a delimiter candidate obtained by extending the delimiter of the phrase of the reading candidate for the character string to be reconverted by one character, and a delimiter candidate obtained by extending the delimiter of the first phrase of the character string to be reconverted by one character. . The conversion candidate cursor points to the first delimiter candidate obtained by extending the delimiter of the phrase as a reading candidate for the character string to be reconverted by one character. In the conversion window, delimiter candidates indicated by the conversion candidate cursor are displayed. (E2)
In the example, “blowing larva” is the character string to be reconverted, and the first phrase of the character string to be reconverted is determined to be “blown”.
Then, only "Fukuyochu" is required as a candidate for reading the character string to be reconverted. Therefore, in the conversion candidate window, a delimiter candidate “Fukuyo Chuu” for reading the character string to be reconverted and a delimiter candidate “Blowing Juvenile” for the character string to be reconverted are displayed.
Here, “‖” is an identifier indicating a segment break position. “@” Is an identifier indicating that the character string is a delimiter candidate for the character string to be reconverted. Then, the conversion candidate cursor points to the first candidate “Fukuyo Daiyu” in the conversion window, and this candidate is displayed in the conversion window. When the decompression / expansion key is input in the state of (e2), the state changes to (e3).

(E3) is a delimiter candidate selection state in which the delimiter position of the phrase is further extended by one character with respect to the delimiter displayed in (e2). Therefore, in the conversion candidate window, a delimiter candidate “Fukuyochu” for reading the reconversion target character string and a delimiter candidate “Blowing larva” for the reconversion target character string are displayed. The conversion candidate cursor points to the first candidate “Fukuyochu” in the conversion candidate window, and this candidate is displayed in the conversion window. When the conversion key is input in the state of (e3), the state becomes (e4).

(E4) is a state in which the segment break has been changed in accordance with the clause break specified in (e3). This state is a phrase selection state. In (e3), the phrase segmentation of the reading of the character string to be converted is specified, so that the kana character string displayed in the conversion window is
The result of the kana-kanji conversion is displayed so that the leading phrase is separated at the delimiter position shown in (e3).
In (e4), as a result of the kana-kanji conversion, “dose” and “middle”
And the phrase cursor is the first phrase “Take”
It is located in. When the enter key is input in the state of (e4), the state changes to (e3).

(E5) shows a state in which the character string to be reconverted in the document buffer has been replaced with the character string displayed in the conversion window of (e4). The conversion window of (e4) disappears, and the character string to be reconverted “blowing larva” in the document buffer is replaced by the character string “during taking” displayed in the conversion window. (Operation Example 6) FIG. 7 is a diagram showing an operation example of changing a segment break of a character string to be reconverted in kanji reconversion. FIG. 7 shows an operation example in which the character string “today's book” in the document is changed to “today's book”.

(F1) shows a display example of a part of the screen of the document processing apparatus. (F1) indicates that the character cursor is located at the position of the first character "now" of the character string "today's book" in the document. When the next candidate key is input in the state of (f1), the state becomes (f2). (F
2) is a state in which, with respect to the character string to be re-converted starting from the position of the character cursor in the state of (f1), the next candidate of the kanji re-conversion for the first phrase and other candidates are displayed. (F2) is a phrase candidate selection state in which a candidate for the target phrase can be selected. In (f2), “today's book” is the character string to be re-converted, and the first phrase of the character string to be re-converted is determined to be “now”. Then, the phrase “now” is set as the target phrase, and the character string to be re-converted other than the target phrase is displayed in the conversion window. The display of the noticeable phrase in the conversion window is “now”, which is the next candidate for kanji reconversion. Furthermore, the reading of the noticeable phrase is “now”, and the kana-kanji conversion candidates “now” and “now” for the reading of the noticeable phrase are displayed in the conversion candidate window. The first candidate of the conversion candidate window is the first phrase of the character string to be re-converted, and the conversion candidate cursor is positioned at “now”, which is the next candidate for kanji re-conversion. Since the reading for the phrase "now" at the beginning of the character string to be reconverted is only "now", no other reading candidates for the character string to be reconverted are displayed. When the partitioning extension key is input in the state of (f2), the state changes to (f3).

(F3) is a state in which candidates for segment breaks are displayed in the conversion window and the conversion candidate window for the character string to be re-converted after the target phrase in (f2).
This is a phrase segment selection state in which a segment segment can be selected. The conversion candidate window displays a delimiter candidate obtained by extending the delimiter of the phrase of the reading candidate for the character string to be reconverted by one character, and a delimiter candidate obtained by extending the delimiter of the first phrase of the character string to be reconverted by one character. . The conversion candidate cursor points to the first delimiter candidate obtained by extending the delimiter of the phrase as a reading candidate for the character string to be reconverted by one character. In the conversion window, delimiter candidates indicated by the conversion candidate cursor are displayed. In (f3), “Ima-ni-hon-wo” and “Ima-nippon-wo” are required as candidates for reading the character string to be reconverted. Therefore, in the conversion candidate window, the delimiter candidates for reading the character string to be re-converted, "Ima Nippon" and "Ima Nippon",
Delimiter candidate for today's string to be reconverted
Is displayed. Then, the conversion candidate cursor points to the first candidate “I'm here” in the conversion candidate window, and is displayed in this conversion window.
When the previous candidate key is input in the state of (f3), (f4)
State.

(F4) is also a phrase segment selection state in which phrase segment candidates are displayed. In (f3), the candidate before the delimiter candidate pointed to by the conversion candidate cursor does not exist in the conversion candidate window. Therefore, in (f4), the conversion candidate cursor is the last delimiter candidate of the conversion candidate window. ”, And the conversion window displays the last segment candidate“ Today: This is a book ”.
When the conversion key is input in the state of (f4), the state changes to (f5).

(F5) is a state in which the segment break is changed according to the phrase segment candidate specified in (f4). In (f4), since a segment break candidate for the character string to be reconverted is specified, the segment break for the character string to be reconverted is changed. In (f5), as a result of changing the delimiter of the phrase with respect to the character string to be re-converted, the phrase is changed to “today” and “book”, and the phrase cursor is positioned at “today”. When the next candidate key is input in the state of (f5), the state becomes (f6).

(F6) is a phrase candidate selection state in which the next candidate for kanji reconversion and other candidates are displayed for the character string to be reconverted for the target phrase in the state of (f5). In (f6), the character string to be reconverted for the phrase of interest is “today”. The display of the noticeable phrase in the conversion window is “K”, which is the next candidate for kanji reconversion. Furthermore, the reading of the noticeable phrase is “Kyoto”, and the kana-kanji conversion candidates “Kyoto”, “Kyo”, and “Kyo” for the reading of the noticeable phrase are displayed in the conversion candidate window. The first candidate in the conversion candidate window is the character string to be re-converted,
The conversion candidate cursor is located at “K”, which is the next candidate for kanji re-conversion. At the end of the conversion candidate window, a reading candidate "Hello ..." for the re-conversion target character string "Today" is displayed. "Kyo" is also a candidate for reading, but "Kyo" is not displayed as a candidate for reading because it is a reading of a noteworthy phrase. (F6)
When the next candidate key is input in the state of (1), the state becomes (f7).

(F7) is a state in which the conversion candidate cursor is moved to the next conversion candidate in the state of (f5), and is a conversion candidate selection state. The conversion candidate cursor moves to the next candidate in the conversion candidate window, “Kyoto”, and the display of the noticeable phrase in the conversion window also becomes “Kyoto”, the next candidate. When the enter key is pressed in the state of (f7), the state changes to (f8).

At (f8), the conversion candidate window displayed at (f7) disappears and the phrase is selected.
When the enter key is pressed in the state of (f8), the state changes to (f9). (F9) is a state in which the character string to be reconverted in the document buffer is replaced with the character string displayed in the conversion window of (f8). The conversion window of (f8) disappears, and the character string to be re-converted “Kyoto wo” in the document buffer is replaced with the character string “Kyou wo” displayed in the conversion window.

<Configuration Example of Buffer> FIG. 8 is a diagram showing a configuration example and a usage example of a kana clause buffer, a kanji clause buffer, a kana clause candidate buffer, and a kanji clause candidate buffer. The kana clause buffer, the kanji clause buffer, the kana clause candidate buffer, and the kanji clause candidate buffer have the same configuration, although the purpose of use is different.

(G1) shows a configuration example of a kana phrase buffer, a kanji phrase buffer, a kana phrase candidate buffer, and a kanji phrase candidate buffer. The kana bunsetsu buffer, the kanji bunsetsu buffer, the kana bunsetsu candidate buffer, and the kanji bunsetsu candidate buffer are composed of a bunsetsu number and a bunsetsu information group. The clause information group is composed of an array of a predetermined number of clause information. The number of clauses stores the number of valid clause information stored in the clause information. In the clause information group, valid clause information is stored from the beginning of the array. Information of one clause is stored in the clause information. The phrase information includes a source character string, a destination character string, the number of words, and a word information group.

The conversion source character string stores an input character string for kana-kanji conversion or morphological analysis. In the conversion destination character string, a character string resulting from the kana-kanji conversion or the kanji-kana conversion is stored. The conversion source character string and the conversion destination character string have a fixed length, and can store up to a predetermined number of characters. The number of characters in the stored character string can be determined by the character string terminator.
Such a data structure for storing a character string is generally used in the same type of document processing apparatus, and a detailed description thereof will be omitted.

The word information group has a predetermined number (for example, 3
) Word information. As the effective word information stored in the word information group, information of words constituting a phrase is stored from the beginning of the array, and the number of effective word information is stored as the number of words. The word information stores grammatical information such as word reading, notation, and part of speech. Word information is generally used in the same type of document processing apparatus that performs morphological analysis, and a detailed description thereof will be omitted.

(G2) shows an example of using a kana clause buffer. The kana phrase buffer is used to store one conversion result of the kana-kanji conversion. (G2) shows an example in which a kana-kanji conversion is performed on a kana character string “Kyo wa Atsu” and the result of conversion into two phrases “Kyou wa” and “Hot” is stored. Since the conversion result is composed of two phrases, “2” is stored in the number of phrases. "Today is" in the conversion source string of the phrase information of the phrase "Today is" and "Today is" in the conversion destination string.
Are respectively stored. The phrase “today” is composed of two words “today” and “ha”, “2” is stored as the number of words in the phrase information, and “today” and “ha” Word information is stored. The conversion source character string of the phrase information “Hot” stores “Aut” and the conversion destination character string stores “Hot”. The phrase “hot” is composed of one word “hot”, “1” is stored in the number of words of the phrase information, and the word information of “hot” is stored in the word information group. The kanji phrase buffer is also used to store one conversion result of the kanji kana conversion, like the kana phrase buffer, so that the usage example of the kanji phrase buffer is omitted.

(G3) shows a usage example of the kana clause candidate buffer. The kana-segment candidate buffer stores a plurality of kana-kanji conversion result candidates for one phrase character string. (G3) shows an example in which a plurality of conversion result candidates for the kana-kanji conversion for the kana character string “Kyoha” are stored. Since there are three conversion result candidates, “3” is stored in the number of phrases.

In the first phrase information, information of "today" as a conversion candidate is stored. “Today” is stored in the conversion source character string, and “today is” is stored in the conversion destination character string. The phrase “today” is two words “today”
The word information of the phrase information stores “2”, and the word information group stores word information of “today” and “ha”.

In the second phrase information, information on the conversion candidate “Kyoha” is stored. “Kyoha” is stored in the conversion source character string, and “Kyoha” is stored in the conversion destination character string. The phrase "Kyoha" is composed of two words "Kyo" and "Ha", "2" is stored in the number of words of the phrase information, and the words "Kyo" and "Ha" are included in the word information group. Information is stored.

In the third phrase information, information on "Kyohyo" as a conversion candidate is stored. “Today” is stored in the conversion source character string, and “today” is stored in the conversion destination character string. The phrase “Kyoha” is composed of one word “Kyoha”, “1” is stored in the number of words of the phrase information, and the word information of “Kyoha” is stored in the word information group. .

Since the kanji phrase candidate buffer is also used to store a plurality of conversion results, like the kana phrase candidate buffer, a usage example of the kanji phrase candidate buffer is omitted. <Example of Operation Procedure of Document Processing Apparatus According to Embodiment> The operation procedure of the document processing apparatus according to the above-described embodiment will be described with reference to a flowchart.

(Overall Flow) FIG. 9 is a flowchart showing the entire operation of the document processing apparatus. In (A1), the process waits until a key is pressed from the keyboard and an interrupt occurs. When a key is input, the key code is stored in the key buffer, and the process proceeds to (A2). In (A2), the key stored in the key buffer is determined, and the process branches to one of (A3), (A4), (A5), and (A6) according to the type of key.

(A3) is a process when a character key is determined in (A2), and is a process for inputting a character to a document. This processing will be described in detail with reference to FIG. (A4) is processing in the case where it is determined as the next phrase key or the previous phrase key in (A2), and the character cursor in the document is moved by the phrase unit to the next (end of sentence) or previous (end of sentence).
This is the processing to move to the beginning of the phrase. If it is the next phrase key, it moves toward the end of the sentence, if it is the previous phrase key, it moves toward the beginning of the sentence. An example in which the previous phrase key is input is shown in (c1) and (c2) of FIG. The determination of a segment break is made based on the character type. If the character types of two adjacent characters are different, it is determined that the character is a segment break. However, if the character type of the character at the beginning of the sentence is a kanji and the character type of the character at the end of the sentence is a hiragana, it is not used as a segment break. Punctuation is determined to be of the same character type as the preceding (initial) character. If there is no adjacent character, it is determined that it is a segment break. (C1) in FIG.
When the previous phrase key is input in the state of, the adjacent characters "ha" and "hot" satisfy this condition, and are thus determined to be a phrase break. Therefore, the character cursor moves to the position of “Hot”. Thereafter, when the previous phrase key is further input, there is no character in front of (now) (at the beginning of the sentence), so that "now" is determined to be the beginning of the phrase, and the character cursor is moved to the position of "now". Go to The process of moving the character cursor in units of phrases using the character type is a process generally performed in the same type of document processing apparatus, and is well-known, so that a more detailed description will be omitted.

(A5) is a process in the case where it is determined in (A2) that the key is the next candidate key, the previous candidate key, the delimiter expansion key, or the delimiter shortening key. This is a kanji re-conversion process for changing to a notation character string. This processing will be described in detail with reference to FIG.
(A6) is a process in the case where it is determined in (A2) that the key is other than the character key, the next clause key, the previous clause key, the next candidate key, the previous candidate key, the delimiter expansion key, and the delimiter shortening key. This processing is generally performed in the document processing apparatus described above, and is well-known and will not be described in detail.

(A7) is a display process for displaying a portion changed as a result of the above process. This is a widely used process in which data to be displayed is read, developed into a pattern, and output to a display buffer. ((Detailed Flow of Character Input A3)) FIG. 10 is a detailed flowchart of the process of (A3).

In (B1), (B2), (B3), and (B2) correspond to the type of key stored in the key buffer.
4) Branch to any one of steps (B5), (B6) and (B7). (B2) is a process performed when a character key is determined in (B1), in which a character code stored in a key buffer is added to the end of a character string stored in an input kana buffer. This is storage processing. The contents of the input kana buffer are also copied to the conversion result buffer. When a character is stored in the input kana buffer, the key buffer is cleared. Character storage processing
This is a process generally performed in the same type of document processing device that performs kana-kanji conversion, and is well-known and therefore will not be described. Upon completion of the process, the process advances to (B9).

(B3) is a process when the deletion key is determined in (B1), and is a process of deleting the last character of the character string stored in the input kana buffer. If no character string is stored in the input kana buffer, it will not be deleted. The contents of the input kana buffer are also copied to the conversion result buffer. Then clear the key buffer. This process is generally performed in the same type of document processing device that performs kana-kanji conversion, and is well-known and therefore will not be described. After finishing the process,
Proceed to (B9).

(B4) is a process when it is determined in (B1) that the key is other than a character key, a delete key, a conversion key, a decision key, and a cancel key. It simply clears the key buffer. Upon completion of the process, the process advances to (B9). (B5) is
In (B1), a process in the case where it is determined that the character is a conversion key, a process of performing a kana-kanji conversion on a kana character string stored in an input kana buffer and determining a kana-kanji mixed character string to be input to a document Is. For more information on this process,
It will be described later in FIG. Upon completion of the process, the process proceeds to (B8).

(B6) is a process in the case where it is determined in (B1) that the input key is a decision key. This is a pseudonym confirmation process for outputting to a document. Clear input kana buffer and key buffer. Upon completion of the process, the process proceeds to (B11). (B7)
Is a process when it is determined in (B1) that the key is a cancel key, and is a cancel process for canceling the character input. The input kana buffer, the conversion result buffer, and the key buffer are cleared, and the character input processing ends.

(B8) is a process for judging whether or not the conversion has been canceled in (B5). If the key exists in the key buffer, it is determined that the conversion has been canceled, and the key buffer is cleared. If no key exists in the key buffer, it is determined that the conversion has not been canceled, and the process proceeds to (B11). (B
9) is a display process for displaying a portion changed as a result of the above process. The character string stored in the conversion result buffer is displayed in the conversion window. This is a widely used process in which data to be displayed is read, developed into a pattern, and output to a display buffer. Upon completion of the process, the process proceeds to (B11).

(B10) is a process for receiving a key input. Wait for a key to be pressed from the keyboard to generate an interrupt. When a key is input, the key code is stored in the key buffer, and the process proceeds to (B1). (B11)
This is a process of inserting the character string stored in the conversion result buffer at the position of the character cursor in the document. When the insertion is completed, the conversion result buffer is cleared. This processing is generally performed in the same type of document processing apparatus that creates a document, and is not particularly described. When the processing ends, the character concentration processing ends.

(((Detailed Flow of Kanji Conversion Confirmation B5))) FIG. 11 is a detailed flowchart of the process (B5). In (C1), 0 is stored in the conversion. Thereby, in the conversion processing of (C5), it is instructed to perform the kana-kanji conversion on the character string stored in the input kana buffer and store the conversion result in the kana clause buffer. In (C2), 0 is stored in the start position. Thus, in the conversion process of (C5), it is instructed to perform the conversion process from the head of the input kana buffer. (C
In 3), 0 is stored in the output position. Thus, in the conversion process (C5), it is instructed to output the phrase information of the conversion result from the head of the phrase information array in the kanji phrase buffer. In (C4), 0 is stored in the break position. Thereby, in the conversion processing of (C5), it is instructed not to specify a segment break position.

(C5) is a conversion process in which a character string is analyzed using a dictionary, and the character string is converted into a character string stored in correspondence with a dictionary entry word. In (C1), since 0 is stored in the conversion, the kana character string stored in the input kana buffer is converted into a character string mixed with kanji kana, and the converted result is output to the kana clause buffer.
Details of this processing will be described later with reference to FIG.

At (C6), 0 is stored in the mode. Thereby, in the conversion candidate determination of (C7),
Indicates the character input mode. (C7)
This is a process of correcting the kana-kanji conversion result obtained in (C5) as necessary, and determining the kana-kanji conversion result. Details of this processing will be described later with reference to FIG. ((Detailed Flow of Kanji Reconversion A5)) FIG. 12 is a flowchart showing the details of the process of (A5).

At (D1), the character string to be re-converted to be converted into kanji is copied to the input kanji buffer.
The character string to be reconverted is a character string starting from the position of the character cursor in the document. (D
In 2), 1 is stored in the transformation. by this,
In the conversion process of (D6), the kanji-kana conversion is performed on the character string stored in the input kanji buffer, and the conversion result is stored in the kanji phrase buffer. (D
In 3), 0 is stored in the start position. Thereby, in the conversion process of (D6), it is instructed to perform the conversion process from the head of the input kanji buffer. In (D4), 0 is stored in the output position. This gives (D
In the conversion process of 6), it is instructed to output the phrase information of the conversion result from the head of the phrase information array in the kanji phrase buffer. In (D5), 0 is stored in the break position. Thereby, in the conversion processing of (D6), it is instructed not to specify a segment break position.

(D6) is a conversion process of analyzing a character string using a dictionary and converting the character string into a character string stored in correspondence with a dictionary entry word. In (D2), since 1 is stored in the conversion, the character string mixed with kanji kana stored in the input kanji buffer is converted into a kana character string, and the conversion result is output to the kanji clause buffer.
Details of this processing will be described later with reference to FIG.

At (D7), 1 is stored in the mode. Thereby, in the conversion candidate confirmation of (D9),
Indicates that it is in Kanji reconversion mode. In (D8), the contents of the kanji phrase buffer obtained in (D6) are copied to the kana phrase buffer. At that time, the source character string of the kanji clause buffer is replaced with the destination character string of the kana clause buffer, and the destination character string of the kanji clause buffer is replaced with the source character string of the kana clause buffer, respectively, and copied.
The word information is copied as it is. (D9) is a process of determining candidates for Kanji reconversion using the Kanji phrase buffer and the Kana phrase buffer. Details of this processing will be described later with reference to FIG.

(D10) is a process of replacing the character string to be re-converted in the document buffer with the character string of the result of the kanji re-conversion determined in the conversion candidate determination of (D9).
Deletes the character string to be re-converted starting from the character cursor position in the document buffer, and inserts the character string stored in the conversion result buffer at the character cursor position in the document buffer.

(((Detailed Flow of Conversion Candidate Determination C7 / D9))) FIG. 13 is a flowchart detailing the processing of (C7) and (D9). In (E1), 0 is stored in the focused phrase position. This brings the clause cursor to the beginning. At (E2), it is determined whether or not a character exists in the key buffer. If a character exists, the process proceeds to (E4). If no character exists, the process proceeds to (E3).

(E3) is a process for capturing a key input. Wait for an interrupt to occur when a key is pressed on the keyboard. When the key is entered, enter the key code
Store in the buffer and proceed to (E4). In (E4), according to the type of key stored in the key buffer,
(E5), (E6), (E7), (E8), (E9),
The process branches to one of the steps (E10).

(E5) is a process when it is determined in (E4) that it is the next phrase key or the previous phrase key, and is a process of moving the phrase cursor. When the key stored in the key buffer is the next phrase key, 1 is added to the noticed phrase position. As a result, the phrase cursor moves one sentence toward the end of the sentence. However, if the value of the target phrase position is equal to the value obtained by subtracting 1 from the number of phrases in the kana phrase buffer, the value of the target phrase position is not changed. This is when the clause cursor is at the end, and in this case, the clause cursor does not move even if the next clause key is input. If the key stored in the key buffer is the previous phrase key, 1 is subtracted from the target phrase position. As a result, the phrase cursor moves to the beginning of the sentence by one. However, when the value of the focused phrase position is 0, the value of the focused phrase position is not changed. This is when the clause cursor is at the beginning, and in this case the clause cursor does not move even if the previous clause key is entered. When the processing is completed, the key buffer is cleared and the process goes to (E11).

(E6) is a process in the case where it is determined in (E4) that the key is the next candidate key or the previous candidate key, and is a process of converting the candidate into the next or previous candidate of the phrase indicated by the phrase cursor. Upon completion of the process, the key buffer is cleared, and the process proceeds to (E11). Details of this processing are shown in FIG. 1 below.
4 will be described later. (E7) is a process in the case where it is determined in step (E4) that the key is a decompression / expansion key or a delimitation / shortening key, and is a process of changing the delimiter position of the phrase indicated by the phrase cursor. Upon completion of the process, the key buffer is cleared, and the process proceeds to (E11). Details of this processing will be described later with reference to FIG.

(E8) is the same as in (E4), except that the next clause key, previous clause key, next candidate key, previous candidate key,
This processing is performed when it is determined that the key is a key other than the cancel key. The key buffer is cleared, and the process proceeds to (E11). (E9)
Is a process in the case where it is determined in (E4) that the key is a determination key, and is a process for determining a conversion candidate as a candidate stored in the kana phrase buffer. The word information stored in the kana phrase buffer is extracted one by one from the beginning and stored in the word learning dictionary. The process of storing words in the word learning dictionary is generally performed in the same type of document processing device that performs kana-kanji conversion, and is well-known, so that further description is omitted. When the processing is completed, the key buffer is cleared, and the conversion candidate determination processing ends.

(E10) is a process when it is determined that the key is the cancel key in (E4). This processing differs depending on the mode. When the value of the mode is 0, that is, in the character input mode, the character string stored in the input kana buffer is copied to the conversion result buffer, the kana clause buffer is cleared, and the key buffer is cleared. Then, the conversion candidate confirmation process ends. Thereby, the kana-kanji conversion performed in (C5) is canceled, and the state before the kana-kanji conversion can be returned.

When the value of the mode is 1, that is, in the kanji reconversion mode, the character string stored in the input kanji buffer is copied to the conversion result buffer, the key buffer is cleared, and the conversion is performed. The candidate determination processing ends. As a result, the reconversion performed in (E6) or (E7) can be canceled. (E11) is a display process of displaying a portion changed as a result of the processes of (E5) to (E8). The character string stored in the conversion result buffer is displayed in the conversion window. This is a widely used process in which data to be displayed is read, developed into a pattern, and output to a display buffer. After finishing the process,
Proceed to (E3).

((((Details flow of candidate change E6)))) FIG.
Is a detailed flowchart of the process (E6). (F1) is a process of creating conversion candidates to be displayed in the conversion candidate window. When the processing is completed, the process proceeds to (F2). Details of this processing will be described later with reference to FIG. In (F2), (F3), (F4), (F5),
The process branches to any one of (F8), (F10), and (F11).

(F3) is a process when the next candidate key is determined in (F2), and the conversion candidate cursor is moved to the next candidate in the conversion candidate buffer. If the conversion candidate cursor points to the last candidate in the conversion candidate buffer, the cursor moves to the first candidate in the conversion candidate buffer. After that, the character string corresponding to the target phrase in the conversion result buffer is
Replace with the character string indicated by the conversion candidate cursor. Upon completion of the process, the key buffer is cleared, and the process proceeds to (F6).

(F4) is a process in the case where it is determined in (F2) that the key is the pre-processing key, and the conversion candidate cursor is moved to the previous candidate in the conversion candidate buffer. If the conversion candidate cursor points to the first candidate in the conversion candidate buffer, the cursor moves to the last candidate in the conversion candidate buffer. Then, the character string corresponding to the target phrase in the conversion result buffer is
Replace with the character string indicated by the conversion candidate cursor. Upon completion of the process, the key buffer is cleared, and the process proceeds to (F6).

(F5) is a process performed when it is determined in (F2) that the key is other than the next candidate key, the previous candidate key, the delimiter expansion key, the delimiter shortening key, the cancel key, and the decision key. Clear the buffer and proceed to (F6). (F6) is a result of the processing from (F3) to (F5),
This is a display process for displaying a changed portion. The character string stored in the conversion result buffer is displayed in the conversion window, and the character string stored in the conversion candidate buffer is displayed in the conversion candidate window. This is a widely used process in which data to be displayed is read, developed into a pattern, and output to a display buffer. Upon completion of the process, the process proceeds to (F7). (F7) is a process for capturing a key input. Wait for an interrupt to occur when a key is pressed on the keyboard. When the key is input, the key code is stored in the key buffer, and the process proceeds to (F2).

(F8) is a process in the case where it is determined in (F2) that the key is a decompression / expansion key or a delimitation / shortening key.
(F9) is a process of changing the delimiter position of the target phrase. When the processing is completed, the key buffer is cleared and the candidate change is completed. Details of this processing will be described later with reference to FIG.

(F10) is a process in the case where it is determined in (F2) that the key is a cancel key. The conversion destination character string stored in the kana clause buffer is copied to the conversion result buffer, and the conversion candidate buffer is Clear, clear the conversion candidate window, and end the candidate change. As a result, the state returns to the state before the candidate conversion was performed. (F11)
Is a process in the case where it is determined in (F2) that the key is a decision key, and branches depending on whether or not the candidate pointed to by the conversion candidate cursor is a kana candidate. Whether it is a kana candidate is determined by whether or not the last character of the candidate character string indicated by the conversion candidate cursor is "...". If the last character is "...", it is determined that the character is a kana candidate, and (F
Proceed to 12). If the last character is "...", it is determined that the character is not a kana candidate, and the process proceeds to (F13).

(F12) is a process of replacing the conversion source kana character string for the target phrase in the kana phrase buffer with the candidate character string pointed to by the conversion candidate cursor. However,
"..." at the end of the candidate character string pointed to by the conversion candidate cursor
And then replace. In addition, the key buffer is cleared and the space key is stored in the key buffer. This is for branching to (F6) after (F2). Upon completion of the process, the process proceeds to (F1). (F13)
Is the phrase information for the interesting phrase in the kana phrase buffer,
This is a process of replacing with the phrase information in the kana phrase candidate buffer corresponding to the candidate indicated by the conversion candidate cursor. When the processing ends, the candidate conversion processing ends.

(((((Detailed Flow of Conversion Candidate Creation F1)))))) FIG. 15 is a flowchart showing the processing of (F1) in detail. In (G1), 0 is stored in the conversion. Thereby, in the conversion candidate acquisition of (G3),
Kana-Kanji conversion is performed on the character string stored in the input buffer, and conversion result candidates for the character string are stored in the Kana phrase candidate buffer. In (G2), the conversion source character string of the kana phrase buffer for the target phrase is stored in the input buffer.

(G3) analyzes the phrase using the dictionary for the phrase character string stored in the input buffer,
This is a process of acquiring all candidates that can be converted into a character string stored in association with a dictionary entry word. In (G1), since 0 is stored in the conversion, the kana character string stored in the input buffer is converted into a character string mixed with kanji kana, and the conversion candidate is output to the kana phrase candidate buffer. Details of this processing will be described later with reference to FIG. 20 below.

At (G4), the process branches depending on whether the mode is the reconversion mode. If the value of the mode is 1, it is determined that the mode is the reconversion mode, and the process proceeds to (G5).
If the mode value is not 1, it is determined that the mode is not the reconversion mode, and the process proceeds to (G8). In (G5), 1 is stored in the conversion. Thus, in the conversion candidate acquisition of (G7), it is instructed to perform the kanji kana conversion on the character string stored in the input buffer and store the conversion result candidate for the character string in the kanji phrase candidate buffer. (G
In 6), the conversion source character string of the kanji phrase buffer for the target phrase is stored in the input buffer. (G7) is
This is a process in which a phrase is analyzed for a phrase character string stored in an input buffer using a dictionary, and all candidates that can be converted into a character string stored corresponding to a dictionary entry word are acquired. In (G5), since 1 is stored in the conversion, the character string mixed with the kanji kana stored in the input buffer is converted into the kana character string, and the conversion candidate is output to the kanji phrase candidate buffer. Details of this processing will be described later with reference to FIG. 20 below.

In (G8), the conversion candidate buffer
Stores the character string of the conversion candidate for the target phrase. Therefore, first, the conversion destination character string of the kana phrase buffer for the target phrase is stored at the beginning of the conversion candidate buffer. Next, the conversion destination character strings in the kana clause candidate buffer are sequentially taken out and added to the conversion candidate buffer. By putting a line feed character between each conversion destination character string, it becomes a delimiter of conversion candidates. However, if it matches the first candidate character string in the conversion candidate buffer, it is not stored. Next, the following processing is performed only when the mode is the reconversion mode. The conversion destination character strings in the Kanji clause candidate buffer are sequentially fetched and added to the conversion candidate buffer. By putting a line feed character between each conversion source character string, it becomes a delimiter of conversion candidates. However,
If it matches the conversion source character string in the kana phrase buffer for the target phrase, it is not stored. At the end of each conversion destination character string, "...", which is an identification symbol of a candidate for reading the target phrase, is added. When the processing ends, the conversion candidate creation processing ends.

(((((Detailed flow of partitioning change E7 / F9))))) FIG. 16 is a flowchart showing details of the processing of (E7) and (F9). (H1) is a process of creating a partition candidate to be displayed in the conversion candidate window. Upon completion of the process, the process advances to (H2). Details of this processing will be described later with reference to FIG. At (H2), (H3), (H3) depending on the type of the key stored in the key buffer.
4), (H5), (H6), (H9), or (H10).

(H3) is a process in the case where it is determined in (H2) that the key is a decompression / expansion key. The delimiter position of the delimiter stored in the conversion result buffer and the conversion candidate buffer is shifted to the end of the sentence by one character. Processing. The delimiter "@" existing in the character string of each delimiter is replaced with the next character. When the processing is completed, the key buffer is cleared and the process proceeds to (H7).

(H4) is a process when it is determined to be a delimiter shortening key in (H2), and the delimiter position of the delimiter candidates stored in the conversion result buffer and the conversion candidate buffer is shifted toward the beginning of the sentence by one character. Processing. The delimiter “‖” existing in the character string of each delimiter is replaced with the preceding character. When the processing is completed, the key buffer is cleared and the process proceeds to (H7).

(H5) is a process in the case where it is determined as the next candidate key or the previous candidate key in (H2). If it is the next candidate key, the conversion candidate cursor is moved to the next candidate key in the conversion candidate buffer. Go to If the conversion candidate cursor points to the last candidate in the conversion candidate buffer, the cursor moves to the first candidate in the conversion candidate buffer. If it is the previous candidate key, the conversion candidate cursor is moved to the previous candidate in the conversion candidate buffer. If the conversion candidate cursor points to the first candidate in the conversion candidate buffer, it moves to the last candidate in the conversion candidate buffer. Then, the character string pointed to by the conversion candidate cursor is stored in the conversion candidate buffer. When the processing is completed, the key buffer is cleared and the process proceeds to (H7).

(H6) is a process in the case where it is determined in (H2) that the key is other than the partition expansion key, partition reduction key, next candidate key, previous candidate key, conversion key, and cancel key. Clear the buffer and proceed to (F7). (H7) is the result of the processing from (H3) to (H6),
This is a display process for displaying a changed portion. The character string stored in the conversion result buffer is displayed in the conversion window, and the character string stored in the conversion candidate buffer is displayed in the conversion candidate window. However, when the mode is the character input mode, the conversion candidate buffer is not displayed. This is a widely used process in which data to be displayed is read, developed into a pattern, and output to a display buffer.
When the processing is completed, the process proceeds to (H8). (H8) is a process for capturing a key input. Wait for an interrupt to occur when a key is pressed on the keyboard. When a key is input, the key code is stored in the key buffer, and the process proceeds to (H2).

(H9) is a process of changing the delimiter according to the delimiter stored in the conversion result buffer.
When the processing is completed, the key buffer is cleared and the delimiter change is completed. Details of this processing will be described later with reference to FIG. (H10) is a process when it is determined to be a cancel key in (H2). The conversion destination character string stored in the kana clause buffer is copied to the conversion result buffer,
Further, the conversion candidate buffer is cleared, the conversion candidate window is deleted, and the partition change is completed.

((((((Detailed flow of creation of partition candidate H1))))))) FIG. 17 is a flowchart showing the process of (H1) in detail. In (I1), the process branches depending on whether the mode is the reconversion mode. Mode value is 1
If so, it is determined that the mode is the reconversion mode, and the process proceeds to (I2). If the mode value is not 1, it is determined that the mode is not the reconversion mode, and the process proceeds to (I10).

(I2) is a process for acquiring the kana character string of the target phrase. The conversion candidate buffer is cleared, and the conversion source character string of the kana phrase buffer corresponding to the target phrase is stored at the beginning of the conversion candidate buffer. Further, the same value as the target phrase position is stored in the phrase pointer. In (I3),
Store 1 in the transformation. Thereby, in the conversion candidate acquisition of (I7), the Kanji-Kana conversion is performed on the character string stored in the input buffer, and the conversion result candidate for the character string is stored in the Kanji clause candidate buffer.

In (I4), the value of the clause pointer is 1
Add. In (I5), the process branches depending on whether or not the phrase indicated by the phrase pointer exists. If the value of the phrase pointer is smaller than the value of the number of phrases in the Kanji phrase buffer, it is determined that a phrase exists and the process proceeds to (I6).
If the value of the phrase pointer is equal to the value of the number of phrases in the kanji phrase buffer, it is determined that the phrase does not exist, and the process proceeds to (I9).

In (I6), the conversion source character string in the Kanji clause buffer corresponding to the conversion pointer is stored in the input buffer. (I7) performs a phrase analysis using a dictionary with respect to a phrase character string stored in the input buffer, and obtains all candidates that can be converted to a character string stored corresponding to the dictionary entry word. This is the processing to be performed. In (I3), since 1 is stored in the conversion, the character string mixed with the kanji kana stored in the input buffer is converted into the kana character string, and the conversion candidate is output to the kanji phrase candidate buffer. Details of this processing will be described later with reference to FIG. 20 below.

(I8) is a process of combining the character string stored in the conversion candidate buffer and the conversion destination character string stored in the Kanji clause candidate buffer, and storing the kana candidate in the conversion candidate buffer. It is. For this purpose, first, candidate character strings stored in the conversion candidate buffer are extracted one by one from the beginning. Then, for each candidate character string, the conversion destination character string stored in the Kanji clause candidate buffer is set to 1
Take out each one and create a character string in which the conversion destination character string is overlaid after the candidate character string. If there are n candidate character strings and m conversion destination character strings, nxm character strings will be created. Finally, the character string stored in the conversion candidate buffer is replaced with the newly created character string. Separate each character string with a line feed character. When the processing is completed, the process proceeds to (I4).

(I9) is at the end of the conversion candidate buffer,
This is a process of storing a character string in which the conversion source character strings in the Kanji phrase buffer after the focused phrase are connected. An identifier “◆” indicating that the character string is a delimiter candidate for the reconversion target character string is added to the end of the character string. Further, the character string after the phrase corresponding to the target phrase in the conversion result buffer is replaced with the first candidate character string in the conversion candidate buffer. After finishing the process,
Proceed to (I11).

(I10) is a process of replacing the character string after the phrase corresponding to the target phrase in the conversion result buffer with the conversion source character string after the target phrase in the kana phrase buffer.
Also clear the conversion candidate buffer. When the processing is completed, the process proceeds to (I11). (I11) is a process of inserting a phrase-separated identifier “$” into the character strings stored in the conversion result buffer and the conversion candidate buffer. For each character string stored in the conversion result buffer and the conversion candidate buffer, “‖” is inserted immediately after the character string for the target phrase. Upon completion of the processing, the creation of the partition candidates ends.

((((((Detailed flow of delimitation change conversion H9)))))) FIG. 18 is a detailed flowchart of the processing of (H9). In (J1), the number of characters of the partial character string existing before the character string corresponding to the target phrase in the conversion result buffer is stored in the start position. By this, (J
In the conversion process of 7), the conversion process is instructed to be performed for a partial character string subsequent to the character string corresponding to the target phrase in the character strings stored in the input kana buffer or the input kanji buffer. In (J2), the value of the target phrase position is stored in the output position. Thus, in the conversion processing of (J7), it is instructed to output the phrase information of the conversion result from the phrase information corresponding to the target phrase in the array of phrase information in the kana phrase buffer or the kanji phrase buffer. (J
In 3), the number of characters of the partial character string from the head of the conversion result buffer to "@" is stored. By this, (J
In the conversion process of 7), the phrase is instructed to be separated at the delimiter position designated in the conversion result buffer.

At (J4), the process branches depending on whether or not a delimiter change has been made to the character string to be reconverted. If the last character of the character string in the conversion result buffer is "◆",
Judge that it is a delimiter change for the character string to be reconverted,
Proceed to (J5). If it is not "◆", it is determined that the delimiter for the reconverted character string is not changed, and the process proceeds to (J6).

At (J5), 1 is stored in the conversion.
In this way, in the conversion process (J7), a kanji-kana conversion is performed on the character string stored in the input kanji buffer, and the conversion result is stored in the kanji phrase buffer. When the processing is completed, the process proceeds to (J7). (J6)
At, store 0 in the transform. By this, (J
In the conversion process of 7), Kana-Kanji conversion is performed on the character string stored in the input Kana buffer, and the conversion result is instructed to be stored in the Kana clause buffer. afterwards,
The character string corresponding to the phrase after the target phrase in the input kana buffer is replaced with the character string after the target phrase in the conversion result buffer. However, “‖” in the conversion candidate buffer is replaced after being removed. Upon completion of the processing, the flow advances to (J7).

(J7) is a conversion process for analyzing a character string using a dictionary and converting the character string into a stored character string corresponding to the entry word of the dictionary. In (J5), when 1 is stored in the conversion, the character string mixed with the kanji kana stored in the input kanji buffer is converted into a kana character string, and the conversion result is output to the kanji clause buffer. In (J6), if 0 is stored in the conversion, the kana character string stored in the input kana buffer is converted into a character string mixed with kanji kana, and the converted result is output to the kana clause buffer. Details of this processing will be described later with reference to FIG.

At (J8), the process branches depending on whether or not the delimiter is changed for the re-conversion target character string. If the last character of the character string in the conversion result buffer is "◆",
Judge that it is a delimiter change for the character string to be reconverted,
Proceed to (J9). If it is "◆", it is determined that the delimiter change for the re-conversion target character string is not changed, and the delimiter change conversion process is terminated. In (J9), the contents after the target phrase in the kanji phrase buffer obtained in (J7) are copied to the target phrase and subsequent parts in the kana phrase buffer. At this time, the conversion source character string of the kanji phrase buffer is replaced with the conversion destination character string of the kana phrase buffer, and the conversion destination character string of the kanji phrase buffer is replaced with the conversion source character string of the kana phrase buffer. The word information is copied as it is. When the processing ends, the delimiter change conversion processing ends.

(((((((Detailed flow of conversion processing C5 / D6 / J7))))))) FIG. 19 shows (C5), (D6) and (J
It is a flowchart which detailed the process of 7). (K
1) searches the kana heading dictionary or kanji heading dictionary for the character string specified at the start position of the character strings stored in the input kana buffer or the input kanji buffer and finds all word candidates. This is the required process. The conversion value is 0
, Search the kana heading dictionary for the character string stored in the input kana buffer, and if the conversion value is 1, specify the kanji name for the character string stored in the input kanji buffer. Search the headline dictionary. This processing is generally performed by a kana-kanji conversion or a document processing device of the same type that performs kanji-kana conversion, and is well known.
Further description will be omitted.

(K2) is a process of combining the word candidates retrieved in (K1), performing grammatical analysis such as morphological analysis and syntactic analysis, and obtaining a combination of interpretable analysis results. This process is generally performed by a kana-kanji conversion or a similar document processing device that performs kanji-kana conversion, and is well known, so a further description will be omitted.

(K3) is a process for determining a segment break for the analysis result candidates obtained in (K2). If the value of the segmentation position is 0, the segmentation of the phrase is determined by the most probable candidate of the analysis result candidates. If the value of the break position is other than 0, the break of the phrase is determined by the most probable candidate among the candidates having the same number of characters as the break position at the beginning of the analysis result. This process is generally performed by a kana-kanji conversion or a similar document processing device that performs kanji-kana conversion, and is well known, so a further description will be omitted.

(K4) is a process for determining the structure of each bunsetsu, that is, the words forming the bunsetsu, by using the analysis result obtained in (K2) and the bunsetsu delimiter obtained in (K3). Is. A word learning dictionary is searched for a word constituting each phrase candidate, and a word constituting the phrase is determined by giving priority to a new word among words stored in the word learning dictionary. This process is generally performed by a kana-kanji conversion or a similar document processing device that performs kanji-kana conversion, and is well known, so a further description will be omitted.

(K5) is a process for outputting the structure of the clause determined in (K4) to the kana clause buffer or the kanji clause buffer. If the conversion value is 0, it is output to the kana clause buffer, and if the conversion value is 1, it is output to the kanji clause buffer. If the value of the output position is 0, the phrase information is stored from the beginning of the phrase information group in the kana phrase buffer or the kanji phrase buffer, but if the value of the output position is not 0, the phrase in the kana phrase buffer or the kanji phrase buffer is stored. The number of pieces of phrase information specified by the output position from the head of the information group is retained, and the conversion result is output to the subsequent clause information. This process is generally performed by a kana-kanji conversion or a similar document processing device that performs kanji-kana conversion, and is well known, so a further description will be omitted. When the processing ends, the conversion processing ends.

((((((Detailed flow of conversion candidate acquisition G3, G6, I7)))))) FIG. 20 shows (G3), (G7) and (I
It is a flowchart which detailed the process of 7). (L
1) is a process of searching the kana heading dictionary or the kanji heading dictionary for the character string stored in the input buffer to obtain all word candidates. If the conversion value is 0, the kana heading dictionary is searched, and if the conversion value is 1, the kanji name heading dictionary is searched. This process is Kana-Kanji conversion,
Alternatively, since it is generally performed in a document processing apparatus of the same type that performs Kanji / Kana conversion and is known, further description is omitted.

(L2) is a process of combining the word candidates retrieved in (L1), performing grammatical analysis such as morphological analysis or syntactic analysis, and obtaining a combination of interpretable analysis results. This process is generally performed by a kana-kanji conversion or a similar document processing device that performs kanji-kana conversion, and is well known, so a further description will be omitted.

(L3) is a process of outputting all the analysis results analyzed as one phrase among the analysis result candidates obtained in (L2) to a kana phrase candidate buffer or a kanji phrase candidate buffer. If the value of the conversion is 0, it is output to the kana clause candidate buffer, and if the value of the conversion is 1,
Output to Kanji phrase candidate buffer. This processing is generally performed by a kana-kanji conversion or a document processing device of the same type that performs kanji-kana conversion, and is well known.
Further description will be omitted. When the processing is completed, the conversion candidate acquisition ends.

[0132]

[Other Embodiments] In the above description, other candidates of the target phrase for kana-kanji conversion or kanji re-conversion are displayed in the conversion candidate window. However, the candidate indicated by the conversion candidate cursor in the conversion candidate window is the conversion window. Is not necessarily displayed in the conversion candidate window. Also, when changing the segment break in kanji re-conversion, the candidate for the break is displayed in the conversion candidate window, but the candidate indicated by the conversion candidate cursor in the conversion candidate window is also displayed in the conversion window. Display in the candidate window is not always necessary.

In the operation example of converting the kanji re-conversion phrase candidate described in FIG. 4, if the next candidate key is input in the state of (c2) and there are a plurality of kanji-kana conversion candidates, The operator decided the kana conversion candidate without selecting it, and the kana-kanji conversion candidate for that candidate was displayed in the state of (c3), but the operator decided the kana kana conversion candidate. Good. In that case, when the next candidate key is input in the state of (c2), the state once becomes the state shown in FIG. 21, and in this state, the operator selects a candidate for kanji kana conversion by the next candidate key, the candidate key, When the enter key is input for the selected candidate, the state of FIG. 4C3 may be set.

In the operation example of changing the kanji re-conversion phrase delimiter described in FIG. 7, in order to change the phrase delimiter for the re-conversion target character string delimited by the kanji kana conversion, (f3) is shown. The character string to be re-converted was displayed in the conversion candidate window as "Today ‖ Book ◆",
Instead of displaying the character string to be reconverted, (h) in FIG.
As shown in 1), candidates for the result of Kanji-to-kana conversion (“Kyo‖Hon-o” and “Konhi‖Hon-o”), so that the bunsetsu delimiter for the re-converted character string is delimited by the expanded bunsetsu May be displayed. That is, when the decompression / expansion key is input in the state of (f2), the state becomes (h1) of FIG. 22, and in this state, the operator selects the next candidate key, the previous candidate key, the decompression / expansion key, or the decompression / shortening key. By selecting the kana reading and phrase separation for the target reconversion target character string with the phrase candidate cursor and inputting the conversion key, the kana kanji conversion for the specified kana reading and phrase separation is performed,
The state of (f5) may be set. Candidates for the result of Kanji Kana conversion so that the clauses for the re-converted character strings are separated by extended clauses
And “Hello!” Can be easily obtained by using the delimiter change conversion shown in FIG. 18 and the delimiter candidate creation shown in FIG.

In FIG. 17, kana character string candidates for the character string mixed with the kanji kana after the target phrase are created as delimiter candidates. However, if there are many phrases after the target phrase, the kana character string candidates are To increase the number of kana character string candidates, kana character string candidates may be created only for the specified number of phrases after the target phrase. To do so, after checking whether there is a bunsetsu in (I5), if there is a bunsetsu, the number of bunsetsus from the focused bunsetsu to the bunsetsu pointed to by the bunsetsu pointer is counted, and If it is larger than the number,
What is necessary is just to go to (I9). For example, if 2 is specified as the number of clauses, and if the decompression / expansion key is input in the state of (h2) in FIG. 22, the result is as shown in FIG. 22 (h3). Not created as a candidate.

In FIG. 4 and FIG. 5, an identification symbol “...” is added to the end of the candidate of the noticeable phrase to distinguish between the kanji reconversion candidate for the noticeable phrase and the candidate of the noticeable phrase. Change the display color of suggestions,
The area of the conversion candidate window may be divided into two parts to be distinguished depending on the display location, or may be distinguished by another method.

Further, in FIG. 6 and FIG. 7, in order to distinguish between the phrase delimiter candidates for the kana reading of the re-conversion target character string and the phrase delimiter candidates for the re-conversion target character string, the re-conversion target character The identification symbol "@" is added at the end of the phrase segmentation candidate for the column, but the display color of the candidate is changed, and the area of the conversion candidate window is divided into two areas to distinguish them according to the display location. , May be distinguished by other methods.

The present invention may be applied to a system composed of a plurality of devices (for example, a host computer, an interface device, a reader, a printer, etc.) or an apparatus composed of one device. Further, an object of the present invention is to provide a storage medium storing a program code of software for realizing the functions of the above-described embodiments to a system or an apparatus, and a computer (or CPU or MPU) of the system or apparatus to store the storage medium. It is needless to say that it is achieved by reading and executing the program code stored in. In this case, the program code itself read from the storage medium implements the functions of the above-described embodiment, and the storage medium storing the program code constitutes the present invention.

As a storage medium for supplying the program code, for example, a floppy disk, hard disk, optical disk, magneto-optical disk, CD-ROM, CD
-R, magnetic tape, non-volatile memory card, ROM, etc. can be used. In addition, by executing the program code read by the computer, not only the functions of the above-described embodiments are realized, but also an OS (operating system) running on the computer is executed based on the instructions of the program code. It goes without saying that a case where some or all of the actual processing is performed and the functions of the above-described embodiments are realized by the processing is also included.

Further, after the program code read from the storage medium is written in the memory provided in the function expansion board inserted into the computer or the function expansion unit connected to the computer, based on the instruction of the program code, It goes without saying that the CPU included in the function expansion board or the function expansion unit performs part or all of the actual processing, and the processing realizes the functions of the above-described embodiments.

When the present invention is applied to the storage medium, the storage medium stores program codes corresponding to the above-described flowcharts. Each module shown will be stored in a storage medium. That is, at least a kana-kanji conversion module, a kanji kana conversion module,
What is necessary is just to store the program code of each module of the phrase division change module and the reconversion control module in the storage medium.

[0142]

As described above, according to the present invention, it is possible to easily modify a character string mixed with kanji and kana into another character string mixed with kanji and kana with the same reading but different notation by a simple operation. And a document processing method and apparatus therefor.
In addition, a document processing apparatus and a document which can easily modify a character string mixed with kanji kana into another character string mixed with kanji kana with the same reading and different notation by the same operation as kana-kanji conversion A processing method can be provided.

Also, even when the kanji kana conversion is performed by converting the punctuation of the phrase incorrectly, the character string mixed with the kanji kana can be easily and easily corrected to another character string mixed with the different kanji kana with the same reading. A document processing apparatus and a document processing method that can perform the processing.

[Brief description of the drawings]

FIG. 1A is a block diagram showing an overall configuration of an information processing apparatus according to the present embodiment.

FIG. 1B is a diagram showing an example of a storage structure of the DISK 14 of FIG. 1A.

FIG. 2 is a block diagram showing an example of an operation of changing a candidate for kana-kanji conversion.

FIG. 3 is a diagram showing an example of an operation of changing a segment break of kana-kanji conversion.

FIG. 4 is a diagram showing an example of an operation for changing a candidate for re-conversion of a target phrase in Kanji conversion.

FIG. 5 is a diagram showing an example of an operation of changing the kana reading of the re-conversion target character string of the target phrase in the kanji re-conversion.

FIG. 6 is a diagram illustrating an example of an operation of changing a delimiter of a kana reading phrase of a character string to be reconverted in kanji reconversion.

FIG. 7 is a diagram illustrating an example of an operation of changing a segment break of a character string to be reconverted in kanji reconversion.

FIG. 8 is a diagram showing an example of the configuration of a kana phrase buffer, a kanji late buffer, a kana phrase candidate buffer, and a kanji phrase candidate buffer.

FIG. 9 is a flowchart showing an example of the processing procedure of the entire operation of the present embodiment.

FIG. 10 is a flowchart showing an example of a character input processing procedure according to the present embodiment.

FIG. 11 is a flowchart illustrating an example of a processing procedure for kanji conversion determination according to the present embodiment.

FIG. 12 is a flowchart showing an example of a processing procedure of Kanji reconversion according to the present embodiment.

FIG. 13 is a flowchart showing an example of a processing procedure for determining a conversion candidate according to the present embodiment.

FIG. 14 is a flowchart showing an example of a candidate change processing procedure according to the present embodiment.

FIG. 15 is a flowchart illustrating an example of a processing procedure for creating a conversion candidate according to the present embodiment.

FIG. 16 is a flowchart illustrating an example of a processing procedure of a partition change according to the present embodiment;

FIG. 17 is a flowchart illustrating an example of a processing procedure for creating a partition candidate according to the present embodiment;

FIG. 18 is a flowchart showing an example of a processing procedure of a division change conversion according to the present embodiment.

FIG. 19 is a flowchart showing an example of a processing procedure of conversion processing of the present embodiment.

FIG. 20 is a flowchart illustrating an example of a processing procedure for acquiring a conversion candidate according to the present embodiment.

FIG. 21 is a diagram showing another example of the operation of changing the kana reading of the character string to be reconverted of the target phrase in the kanji reconversion.

FIG. 22 is a diagram showing another example of the operation of changing the delimiter of the bunsetsu of the re-conversion target character string in the Kanji re-conversion.

Claims (14)

[Claims] 1. A kanji-kana conversion step for obtaining and displaying kana-kana reading candidates for a character string mixed with kanji-kana composed of a designated desired phrase, and performing kana-kanji conversion based on the selected kana reading. A kana-kanji conversion step of obtaining and displaying mixed kana notation candidates; and selecting one of the kana-kana kana mixed notation candidates, the kana-kana kana mixed character string corresponding to the selected kana reading is selected by the selected kana-kana kana. A character string determining step of determining mixed notation. 2. The document processing method according to claim 1, wherein the kana-kanji conversion step includes a phrase separation changing step of changing a phrase break in the selected kana reading. 3. A determination step of determining whether conversion is kana-kanji conversion after kana input or re-conversion of a once-fixed kanji-kana mixed character string when input is made from a predetermined conversion key. 3. The document processing method according to claim 1, further comprising the step of: executing the kanji-kana conversion step if the conversion is a re-conversion, and skipping the kanji kana conversion step if the re-conversion is not performed. 4. A character string change candidate creation step of obtaining and displaying candidates for kana-kanji reading for a kanji-kana mixed character string consisting of a desired desired clause and candidates for kanji-kana mixed notation based on a certain kana reading candidate. If another Kana-Yomi reading candidate is selected, Kana-Kanji conversion is performed based on the selected Kana-Yomi reading, and a Kana-Kanji conversion process for displaying candidates for Kanji-Kana mixed notation is displayed, and the character string is changed. When one of the candidates for mixed kanji kana notation obtained in the candidate creation step or the kana kanji conversion step is selected, a character string that determines the mixed kanji kana mixed notation consisting of the desired clauses is selected as the selected kanji kana mixed notation. A document processing method comprising: a determination step. 5. The document processing method according to claim 4, further comprising a phrase break changing step of changing a break of a phrase in kana reading. 6. A discrimination step of discriminating whether conversion is kana-kanji conversion after kana input or re-conversion of a character string mixed with kana-kana once fixed, when an input is made from a predetermined conversion key. 6. The document processing according to claim 4 or 5, further comprising: wherein the character string change candidate creation step is executed in the case of re-conversion, and the character string change candidate creation step is skipped in the case of non-re-conversion. Method. 7. A kanji / kana conversion means for obtaining candidates for kana / kana reading for a kanji / kana mixed character string consisting of designated desired clauses, and kana / kanji conversion based on the selected kana / kanji reading to display kanji / kana mixed notation. A kana-kanji conversion means for obtaining a candidate, and a character which, when one of the kanji-kana mixed notation candidates is selected, determines a kanji-kana mixed character string corresponding to the selected kana reading to the selected kanji kana mixed notation. A document processing device, comprising: a column determining means, wherein a character string mixed with kanji and kana composed of a designated desired clause is changed to another character string mixed with kanji and kana of different notation with the same reading. 8. The document processing apparatus according to claim 7, further comprising candidate display means for selectively displaying the kana reading candidate and the kanji kana mixed notation candidate. 9. The document processing apparatus according to claim 8, wherein the candidate display means displays the kana reading candidate and the kanji kana mixed notation candidate so as to be distinguishable from each other. 10. The kanji-kana conversion means, based on a phrase containing a kanji, refers to at least a kanji heading dictionary to obtain the kana-reading candidate, and a kana-reading candidate search means, which corresponds to the phrase containing the kanji. First storage means for storing kana reading candidates, wherein the kana kanji means refers to at least a kana heading dictionary based on a phrase of the kana reading candidate to obtain a candidate for the kanji kana mixed notation. Mixed notation candidate searching means, and second storage means for storing the candidate for the kanji kana mixed notation corresponding to the kana reading candidate, and the candidate display means is provided from the first and second storage means. 9. The document processing apparatus according to claim 8, further comprising a third storage unit that selects a predetermined candidate and stores each in association with each other. 11. The document processing apparatus according to claim 7, further comprising a phrase separation changing means for changing a phrase separation in the kana reading. 12. When there is an input from a predetermined conversion key, a determination means for determining whether the conversion is a kana-kanji conversion after inputting a kana or a re-conversion of a character string mixed with kanji kana once determined. 12. The document processing apparatus according to claim 7, further comprising: stopping kanji / kana conversion by the kanji / kana conversion unit if the conversion is not re-conversion. 13. A computer readable memory for storing a computer readable program code for changing a kanji kana mixed character string consisting of a designated desired phrase to another kanji kana mixed character string of the same reading and a different notation. The program code includes at least a Kanji-Kana conversion module that displays a Kana-Kana reading candidate for a Kanji-Kana mixed character string consisting of specified desired clauses and a Kana-Kanji conversion based on the selected Kana-Kanji reading. And a kana-kanji conversion module for displaying candidates for kanji and kana mixed notation and displaying, a bunsetsu delimiter changing module for changing bunsetsu demarcation in the selected kana reading, and a desired instructed by controlling each of the modules. A kanji-kana mixed character string consisting of bunsetsu is converted to another kanji-kana mixed character string with the same reading. A computer-readable memory, characterized in that it comprises a re-conversion control module further. 14. A kana heading dictionary that stores kanji readings corresponding to kana readings, a kanji heading dictionary that stores kana readings corresponding to kanji readings, and a newly used word is a kana reading and a kanji or kanji reading. A word learning dictionary to be stored as a mixed kana character string and a kanji searched from the kana heading dictionary are selected to create a kanji kana mixed character string, and the kana reading searched from the kanji heading dictionary is selected to read a kana. 14. A computer-readable memory according to claim 13, including a grammar dictionary used to create a reading string.