JPH07200571A - Document processing method and device therefor - Google Patents

Abstract

PURPOSE:To provide a document processing method and device capable of improving a conversion rate and improving operability by increasing the accuracy of the specifying position of sections and reducing erroneous conversion due to section position specifying data. CONSTITUTION:Section data search for searching the section position specifying data is performed, clauses are decided based on the result of the section data search and section positions are stored when the section positions are changed. The section positions are stored with an object clause as first independent part section data (S41), as attachment part section data when the object clause is the clause of an attachment word and the clause in front is an attachment word clause (S45) and as second independent part section data when the object clause is the clause of the attachment word and the clause in front is an independent word clause (S44). The clause is decided by sectioning a character string based on the section data in the case of coinciding with the first and second independent part section data or in the case of coinciding with the attachment part section data.

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 its apparatus.

[0002]

2. Description of the Related Art In a conventional document processing apparatus, when converting an input kana character string into a kana-kanji mixed sentence, when a conversion candidate is changed to a candidate desired by an operator, whether or not the delimiter position is changed is determined. If it is determined that the break position is changed, the break position is stored as learning information, and the break position at the time of subsequent conversion is determined. in this case,
As a storage process of the delimiter position, it judges whether the target phrase is an adjunct word or an independent word, and if it is an independent word, creates independent part delimiter data that applies only from the beginning of the input character string, and if it is an adjunct word, in the middle of the input character string. Even if they match, the appendix delimiter data that can be applied was created.

That is, as shown in FIG. 5, the input character string "I tried to do so" was "Kan / Mr.
When it is converted into, delimiter learning data is created as attached part delimitation data “/ shi / you”. Next time the same character string is converted, the delimiter data is searched, and the specified position of the delimiter is found before the first "shi" and between that "shi" and the following "yo". Originally, the phrase determination process was performed, and as a result, the same candidates as when the conversion candidates were changed previously were obtained.

[0004]

However, in the processing method of the above-mentioned prior art, when the input character string is matched in the middle, the clause is cut at the learned delimiter position in any case. If so, it will be cut even where you do not want it cut. For example, as shown in FIG.
Type "I tried to do so" and then click "Operation / Try /
If you want to convert it to "it", or if you want to convert it to "candy" for "kasou"
Since the specified position of the delimiter was found in front of and between the "shi" and the following "you", it caused an erroneous conversion.

As described above, if the delimiter position designation data is used by mistake, it has a great influence on the conversion, and also has a great influence on the conversion rate and operability.

The present invention eliminates the above-mentioned conventional drawbacks, increases the accuracy of the designated position of the delimiter, reduces the erroneous conversion due to the delimiter position designation data, and realizes an improved conversion rate and improved operability. A processing method and an apparatus thereof are provided.

[0007]

In order to solve this problem, the document processing method of the present invention uses a delimiter data search process for searching delimiter position designation data and a clause based on the result of the delimiter data search. The phrase determination step for determining, a candidate changing process for changing the determined phrase, and a delimiter position storing process for storing the delimiter position when the delimiter position is changed, and the delimiter position storing process is , The process of storing the target bunsetsu as the first independent part delimiter data, and the process of storing the target bunsetsu as the adjunct part delimiter data when the target bunsetsu is the bunsetsu of the adjunct word and the preceding bunsetsu is the adjunct word bunsetsu, The clause is the clause of the attached word,
And the preceding clause is a self-supporting word clause, and a process stored as second independent part delimiter data, and the phrase determining process is identical to the first and second independent part delimiter data, or A character string delimitation step of delimiting a character string based on the delimiter data when the character string matches the attached part delimiter data is included.

Further, the document processing apparatus of the present invention includes a phrase determination means for performing a segment data search for searching the segment position designation data and determining a segment based on the result of the segment data search, and a segment position change. In this case, the delimiter position storage means stores the delimiter position, and the delimiter position storage means stores the target phrase as the first independent part delimiter data, and the target phrase is a phrase of an adjunct word and When the bunsetsu is an adjunct word bunsetsu, it is stored as adjunct part delimiter data, and when the target bunsetsu is a bunsetsu of an adjunct word and the preceding bunsetsu is an independent word bunsetsu, it is stored as second independent part delimiter data, The phrase determining means determines a character string based on the delimiter data when it matches the first and second independent part delimiter data or when it matches the attached part delimiter data. Characterized in that it comprises a string delimiter means off.

[0009]

An embodiment of the present invention will be described in detail below with reference to the drawings.

FIG. 1 is a block diagram showing the configuration of an information processing system of an embodiment in which the document processing method of the present invention is implemented.

In FIG. 1, an input device 1 such as a keyboard
The character string input from is based on the dictionary 3b containing the word information stored in the storage device 3 such as a hard disk (HD), a floppy disk (FD), or a memory,
The processing program 3a is executed by the central processing unit 2, and the processing result is output to the output device 4 such as a CRT.

The flow of processing in this embodiment will be described with reference to the flowcharts of FIGS. 2, 3 and 4 stored as the processing program 3a. In this example as well, a case will be described in which a character string “trying to do so” is input as in the conventional example.

In step S21 of FIG. 2, as shown in FIG. 7, the data at the delimiter designated position is searched. In step S21, as shown in FIG. 3, the independent section break search is performed in step S31. As a result, when the break of the independent portion is found, the process proceeds to step S35 to specify the break position. Here, it is assumed that the division of the independent section is found only when the divisions of the preceding and following independent sections match. If the delimiter of the independent section is not found, the process proceeds to step S33, and the delimiter search of the attached section is performed. In step S34, if the division of the attached part is found, step S35.
Proceed to, and if no appendix delimiter is found, end. In step S35, a delimiter position is designated and the process ends.

In step S22, as shown in the phrase determination diagram of FIG. 8, when data matching the designated delimiter position is stored, the phrase position is determined according to the data. If not found, a dictionary or the like is searched to determine a phrase that is likely to be one phrase. In the present embodiment, since "play / attempt / do" is stored, this is output as a conversion candidate.

In step S23, it is determined whether or not the phrase is desired by the operator, and if it is not the desired phrase, the process of step S24 is performed. In step S24, as shown in the candidate change diagram of FIG. 9, the conversion candidate is changed to a candidate desired by the operator. In the present embodiment, it is assumed that, as in the conventional example, it is changed to "play / person / use / do".

In step S25, it is determined whether or not the break position is changed. If the break position is changed, the break position is stored in step S26. If there is no change in the break position, step S27 is executed. Perform processing. In the storage of the delimiter position in step S26, the delimiter position is stored according to the delimiter designated position, as shown in FIG. In the present embodiment, "shi / you" and "so / shi" are stored as the independent part delimitation data according to the flowchart of FIG. 4 described later.

In step S27, it is determined whether or not there is an unprocessed clause, and if there is an unprocessed clause, the processing from step S25 is repeated.

In the delimiter position storing process in step S26, as shown in the flowchart of FIG. 4, the target phrase is registered as independent part delimitation learning data ("shi / you" in this example) in step S41. In step S42, it is determined whether the target phrase is an adjunct word, in step S43 it is determined whether the preceding phrase is an adjunct word, and if the preceding phrase is an independent word, in step S44 it is applied only from the beginning of the input character string. Copy separation data (“Yes / No” in this example) is created.

If the preceding clause is an adjunct word, adjunct part delimiter data that can be applied even if they match from the middle of the input character string is created in step S45. Therefore, the attached part delimiter data “/ shi / you” is not created.

As described above, the separation learning data is created,
Next, when the same character string is converted, step S21 in FIG.
When the delimiter data is searched by, as shown in the delimiter data search diagram of FIG. 10, the independent section delimiter data is found between “yes” and “shi”, and further the independent section is found between “shi” and “you”. Since delimiter data can be found, specify each position as a delimiter. The phrase determination process shown in step S22 is performed on the basis of the position of the independent section delimiter data, and as a result, as shown in the phrase determination diagram of FIG. 11, the same candidate as the previous conversion can be obtained.

Here, as in the case of the conventional example, even if the character string "try to do" or "try to do" is input, it does not match both "yes / yes" and "shi / you". Therefore, unlike the conventional example, it is not separated from “/Mr./use”. If the input character string is also learned, it can be converted as desired, as shown in FIG.

In the present embodiment, a specific input character string has been described as an example, but it is obvious to those skilled in the art that this conversion method is not effective only for the input character string of this example.

The present invention may be applied to a system composed of a plurality of devices or an apparatus composed of one device. Further, it goes without saying that the present invention can be applied to the case where it is achieved by supplying a program to a system or an apparatus.

[0024]

EFFECTS OF THE INVENTION By making the conditions for the delimiter data of the attached part stricter, and processing the independent part delimiter data so that there is no delimitation effect unless the conditions of the two preceding and following data are the same, It is possible to improve accuracy, reduce erroneous conversion due to delimiter position designation data, improve conversion rate, and improve operability.

[Brief description of drawings]

FIG. 1 is a block diagram showing the configuration of an information processing system according to an embodiment.

FIG. 2 is a flowchart of the overall processing of this embodiment.

FIG. 3 is a flowchart of a delimiter data search process of this embodiment.

FIG. 4 is a flowchart of a delimiter position storage process of this embodiment.

FIG. 5 is a diagram showing an example of a candidate changing process according to a conventional technique.

FIG. 6 is a diagram showing an example of an influence on conversion of delimiter data in the conventional technique.

FIG. 7 is a diagram showing an example of delimiter data search processing in the present embodiment.

FIG. 8 is a diagram illustrating an example of phrase determination processing according to the present exemplary embodiment.

FIG. 9 is a diagram showing an example of a candidate changing process in the present embodiment.

FIG. 10 is a diagram showing an example of delimiter data search processing in the present embodiment.

FIG. 11 is a diagram illustrating an example of phrase determination processing according to the present embodiment.

FIG. 12 is a diagram showing an example of a conversion result in the present embodiment.

[Explanation of symbols]

 1 Input Device 2 Central Processing Unit 3 Storage Device 3a Processing Program 3b Dictionary 4 Output Device

Claims (2)

[Claims] 1. A delimiter data search process for searching delimiter position designation data, a phrase determination process for determining a phrase based on a result of the delimiter data search, and a candidate changing process for changing the determined phrase. And a delimiter position storage step of storing the delimiter position when the delimiter position is changed. The delimiter position storage step includes a step of storing the target phrase as first independent section delimiter data and a target phrase. When the clause is an adjunct word and the preceding clause is an adjunct word clause, the process of storing as adjunct delimiter data and the target clause is an adjunct word clause and the preceding clause is an independent word clause ,
And a step of storing as second independent part delimiter data, wherein the phrase determination step is a delimiter when it matches the first and second independent part delimiter data, or when it matches the attached part delimiter data. A document processing method comprising a character string delimitation step of delimiting a character string based on data. 2. A delimiter data search for searching delimiter position designation data, and a phrase determining means for determining a phrase based on a result of the delimiter data search; and a delimiter position stored when the delimiter position is changed. Delimiter position storage means, wherein the delimiter position storage means stores the target bunsetsu as the first independent part delimiter data, and when the target bunsetsu is a bunsetsu of an adjunct word and the preceding bunsetsu is an adjunct word bunsetsu , Is stored as attached part delimiter data, and the target phrase is the phrase of the attached word,
And when the preceding phrase is an independent word phrase, it is stored as second independent part delimiter data, and the phrase determining means matches the first and second independent part delimiter data, or the adjunct part delimiter. A document processing apparatus comprising a character string delimiter that delimits a character string based on delimited data when the data matches.