JP5295576B2 - Natural language analysis apparatus, natural language analysis method, and natural language analysis program - Google Patents

Description

  The present invention relates to a technique for analyzing a natural language sentence such as Japanese, which can be divided into phrases and has a dependency relationship between phrases.

In the analysis of Japanese sentences, it is the mainstream to summarize the word (morpheme) strings that have been subjected to morphological analysis as clauses and to express the analysis results by the dependency relationship (dependency relationship) between the clauses. In this case, as a method of dependency analysis, it is necessary to collect morpheme strings into clauses as a previous process for performing dependency relationship analysis (see, for example, Patent Document 1 and Non-Patent Document 1). ).
JP 2004-310638 A Manabu Sassano. 2004. "Linear-time dependency analysis for Japanese", COLING 2004. Manabu Sugano. 2007. "Linear time algorithm for Japanese dependency analysis", Natural language processing, Vol.14, No.1, pp 3-18.

As described above, conventionally, in addition to morphological analysis processing, processing in two steps, that is, processing for grouping into clauses and dependency analysis processing, is required, and the following problems have been pointed out.
(1) A processing module for grouping clauses and a processing module for analyzing dependency relations between clauses are separately required, and program development and maintenance become difficult.
(2) It is necessary to scan (read) a sentence many times in the process of grouping it into phrases and the dependency analysis process, which slows down the process.

  The present invention has been proposed in view of the above-described conventional problems, and the object of the present invention is to simultaneously perform the processing of grouping into clauses and dependency analysis processing with a single processing module. It is an object of the present invention to provide a natural language analysis apparatus, a natural language analysis method, and a natural language analysis program capable of speeding up the processing by performing one scan only.

In order to solve the above-described problem, in the present invention, as described in claim 1, a natural language that analyzes a natural language sentence that can be divided into phrases and has a dependency relationship between phrases exists. a analyzer clauses performed decomposing morphological analysis means statements analyzed into morphemes, in Kukoto has determined the dependencies between each word morpheme strings, and a receiving dependency collectively raise clause analysis A grouping dependency analysis unit, and the phrase grouping dependency analysis unit pushes an initial value “0” to the dependency destination pending stack at the start of processing, and sets the dependency destination candidate word ID to an initial value “1”. Then, as an end condition determination process, it is determined whether or not the dependence destination candidate word ID is larger than the word ID at the end of the sentence. If it is determined to be large, the process is terminated. From pending stack If the dependency source word ID is NULL as a dependency source word ID determination process, and it is determined that the dependency source word ID is not NULL, Type B indicating that the dependency source word and the dependency destination candidate word constitute the same clause by analyzing the dependency relationship of the destination candidate word, and the clause whose dependency source word is the end, the clause whose dependency destination candidate word is the end It is determined whether it is type D indicating that it is related to the above, or type O indicating that it is a case other than the above, and then, as a type determination process, whether the determination result is either type B or D If it is determined that it is either type B or D, the dependency destination candidate word ID is set to the dependency destination of the dependency source word, the determination result is set to the type of the dependency source word, and the dependency source word ID is set to From the dependency pending stack When the dependence source word ID judgment process determines that the dependence source word ID is NULL, the dependence destination candidate word is added to the dependence destination pending stack. Push the ID, increment the dependence destination candidate word ID, proceed to the end condition judgment processing, and when the judgment result is type O in the type judgment processing, push the dependence source word ID to the dependence destination pending stack, The gist of the invention is a natural language analyzer that pushes a dependence destination candidate word ID to the dependence destination pending stack, increments the dependence destination candidate word ID, and proceeds to the end condition determination processing .

  Also, as described in claim 2, in the natural language analysis apparatus according to claim 1, the determination of the dependency relationship in the phrase grouping dependency analysis unit is performed by determining the part of speech of the dependency source and dependency destination candidate words, It can be performed based on a grammar definition table in which types of determination results corresponding to conditions such as positional relationships are associated.

  Also, as described in claim 3, in the natural language analysis device according to claim 1, the determination of the dependency in the phrase grouping dependency analysis unit is based on a grammar rule machine-learned by SVM. Can be done.

According to a fourth aspect of the present invention, there is provided a natural language analysis method for executing a natural language analysis apparatus for analyzing a natural language sentence that can be divided into phrases and has a dependency relationship between phrases. a method, clause collectively performing a morphological analysis decomposing the sentence to be analyzed into morphemes, in Kukoto has determined the dependencies between each word morpheme strings, and a receiving dependency collectively raise clause analysis And the clause grouping dependency analysis step pushes the initial value “0” onto the dependency destination pending stack at the start of processing, and sets the dependency destination candidate word ID to the initial value “1”. Then, as an end condition determination process, it is determined whether or not the dependency destination candidate word ID is larger than the word ID at the end of the sentence. If it is determined to be larger, the process is terminated. Stack When the popped value is set as the dependency source word ID, and then, as the dependency source word ID determination process, it is determined whether or not the dependency source word ID is NULL, and when it is determined that the dependency source word ID is not NULL, the dependency source word and the dependency destination Analyzing the dependency relationship of the candidate word, type B indicating that the dependency source word and the dependency destination candidate word constitute the same phrase, and the phrase having the dependency source word at the end become the phrase having the dependency destination candidate word at the end It is determined whether it is type D indicating that it is related or type O indicating that it is a case other than the above, and then determining whether the determination result is either type B or D as type determination processing If it is determined that the type is either type B or D, the dependency destination candidate word ID is set as the dependency destination of the dependency source word, the determination result is set as the type of the dependency source word, and the dependency source word ID is dependent. Is it a pending stack? Update with the popped value, move to the dependency source word ID determination process, and when the dependency source word ID determination processing determines that the dependency source word ID is NULL, the dependency destination candidate word ID is added to the dependency destination pending stack , Increments the dependency destination candidate word ID, proceeds to the end condition determination processing, and when the determination result is type O in the type determination processing, pushes the dependency source word ID to the dependency destination pending stack, It can be configured as a natural language analysis method that pushes the dependence destination candidate word ID to the first pending stack, increments the dependence destination candidate word ID, and proceeds to the end condition determination processing .

According to a fifth aspect of the present invention, there is provided a natural language analysis program that analyzes a natural language sentence that can be divided into phrases and that has a dependency relationship between phrases, and constitutes a natural language analysis apparatus. the computer, morpheme degrade morphological analysis means statements analyzed, in Kukoto has determined the dependencies between each word morpheme string, receiving clauses collectively raised relates performing a receiving dependency collectively raise clause analysis The clause grouping dependency analysis unit functions as an analysis unit, pushes the initial value “0” to the dependency destination pending stack at the start of processing, sets the dependency destination candidate word ID to the initial value “1”, Next, as an end condition determination process, it is determined whether or not the dependence destination candidate word ID is larger than the word ID at the end of the sentence. If it is determined to be larger, the process is terminated. When the value popped from the stack is set as the dependency source word ID, and then, as the dependency source word ID determination process, it is determined whether or not the dependency source word ID is NULL. Analyzing the dependency relationship of the dependency destination candidate word, type B indicating that the dependency source word and the dependency destination candidate word constitute the same phrase, the phrase having the dependency source word at the end, and the dependency destination candidate word at the end It is determined whether it is type D indicating that it is related to a phrase or type O indicating a case other than the above, and then, as a type determination process, whether the determination result is either type B or D If it is determined that it is either type B or D, the dependence destination candidate word ID is set as the dependence destination of the dependence source word, the judgment result is set as the type of the dependence source word, and the dependence source word ID Dependent not yet Update with the value popped from the stack, shift to the dependency source word ID determination process, and when the dependency source word ID determination processing determines that the dependency source word ID is NULL, the dependency destination candidate is added to the dependency destination pending stack Pushes the word ID, increments the dependence destination candidate word ID, proceeds to the end condition judgment processing, and pushes the dependence source word ID to the dependence destination pending stack when the judgment result is type O in the type judgment processing The dependence destination candidate word ID is pushed onto the dependence destination undecided stack, the dependence destination candidate word ID is incremented, and the program can be configured as a natural language analysis program that shifts to the end condition determination process .

  In the natural language analysis apparatus, the natural language analysis method, and the natural language analysis program of the present invention, the sentence grouping and dependency analysis can be performed at the same time, so it is only necessary to scan the sentence once. This eliminates the need for independent modules for sentence grouping and dependency analysis, and speeds up the processing.

  Hereinafter, preferred embodiments of the present invention will be described.

  FIG. 1 is a diagram showing a configuration example of a natural language analyzing apparatus according to an embodiment of the present invention. In the following, an example for Japanese will be described. However, the present invention can be similarly applied to any language that can be divided into phrases and has a dependency relationship between phrases.

  In FIG. 1, the natural language analyzing apparatus 1 performs an morphological analysis on an analysis target sentence input unit 101 that inputs a sentence to be analyzed, a sentence input by the analysis target sentence input unit 101, and an analysis result Is stored in the analysis sentence storage unit 103 in a sentence unit. The data structure of the analysis sentence storage unit 103 will be described later.

  The natural language analyzing apparatus 1 also includes a one-sentence reading unit 104 that reads information in units of one sentence from the analysis sentence storage unit 103, and a grouping of phrases and a dependency relationship between phrases based on the information read by the one-sentence reading unit 104. And a phrase grouping dependency analysis unit 105 that stores the processing results in the analysis statement storage unit 103 each time.

  Further, the natural language analyzing apparatus 1 includes a dependency source word ID storage area 106, a dependency destination candidate word ID storage area 107, and a dependency destination undecided stack 108 that are used as a work data area by the phrase grouping dependency analysis unit 105. A dependency determination unit 109 used for determining a dependency relationship between words in the processing of the phrase grouping dependency analysis unit 105 and an analysis result output unit 111 that outputs an analysis result are provided. The dependence source word ID storage area 106 holds the word ID that becomes the dependence source in the processing process, the dependence destination candidate word ID storage area 107 holds the word ID that becomes the dependence destination candidate in the processing process, and the dependence destination pending stack 108 Holds the dependency source word ID for which the dependency destination has not been determined, in a last-in first-out (LIFO) format.

  The dependency relationship determination unit 109 has a grammar definition table 110. However, the grammar definition table 110 is held as a data structure in the IF-THEN format or the like, and also includes a case where it is held as a model generated by machine learning using SVM (Support Vector Machine). An example of the grammar definition table 110 will be described later.

  FIG. 2 is a diagram illustrating a configuration example of the dependency relationship determination unit 109 when SVM is used.

  In FIG. 2, a dependency relationship determination unit 109 inputs teacher data for machine learning, and a machine that performs machine learning using SVM based on teacher data input by the teacher data input unit 1091. A learning unit 1092 and a grammar rule storage unit 1093 that holds a model generated by machine learning are provided.

  In addition, the dependency determination unit 109 receives a dependency determination request reception unit that receives the dependency source word ID, the dependency destination candidate word ID, and the morpheme string as arguments from the phrase grouping dependency analysis unit 105 (FIG. 1). 1094 and the dependency relationship determination request received by the dependency relationship determination request receiving unit 1094, the dependency relationship is determined using the grammar rule storage unit 1093, and the determination result is returned to the phrase grouping dependency analysis unit 105 A determination execution unit 1095.

  FIG. 3 is a diagram illustrating an example of the analysis sentence storage unit 103. For each word (morpheme) constituting one sentence, a “word ID” field for identifying a word, a “word” field indicating a character string of the word, A “part of speech” field indicating a part of speech, a “dependence destination” field indicating a dependency destination word ID, and a “type” field indicating a type of a dependency relationship with the dependency destination word are included. In the state immediately after the parsing, the “word ID”, “word”, and “part of speech” fields are filled, and the “dependence destination” and “type” fields are blank.

  FIG. 4 is a diagram showing an example of the grammar definition table 110, in which types of determination results corresponding to conditions such as part of speech and positional relationship of words of dependence source and dependence destination candidates are associated. Here, when the source word is a noun (common noun, personal name, etc.) AND the destination candidate word is a case particle AND the destination candidate word immediately after the source word, etc. When the type “B” indicating that “the same phrase is composed” is “the dependent word is a case particle AND the dependent candidate word is a verb” or “the dependent word is a conjunction particle and the dependent candidate word is a case particle”, etc. Type “D” indicating that “the clause whose dependency source word ends is related to the clause whose dependency destination candidate word ends”, in cases other than the above (for example, the dependency source word is a case particle AND the dependency destination candidate word is A type “O” is set to indicate a case particle.

  FIG. 5 is a flowchart showing a processing example of the phrase grouping dependency analysis unit 105.

  In FIG. 5, steps S1 and S2 are initial value setting processing for the dependency destination pending stack 108 and the dependency destination candidate word ID storage area 107, and step S3 is end condition determination processing. In step S3, when the dependence destination candidate word ID is larger than the word ID at the end of the sentence, the sentence grouping dependency analysis process is terminated as it is processed up to the end of the sentence.

  Step S4 is a process of setting the dependence source word ID from the dependence destination pending stack 108 to the dependence source word ID storage area 106. When no word ID is stacked on the dependence-destination pending stack 108, the dependence-source word ID is NULL (“−1” in the following example).

  Step S5 is a branching process depending on whether or not the dependency source word ID of the dependency source word ID storage area 106 popped from the dependency destination pending stack 108 is NULL. When the dependence source word ID is NULL, the dependence destination candidate word ID of the dependence destination candidate word ID storage area 107 is pushed onto the dependence destination pending stack 108 in step S13, and the dependence destination candidate word ID storage area 107 is pushed in step S14. Is incremented (added by 1), and the process returns to step S3.

  Step S 6 is a dependency determination process performed by the dependency determination unit 109. The dependency relationship determination unit 109 determines the dependency relationship between the dependency source word and the dependency destination candidate word based on the grammar definition table 110 (including the case based on the model of the grammar rule storage unit 1093), and returns the determination result type.

  Step S7 is a branching process depending on the type of the dependency determination result. In the case of types “B” and “D”, it is assumed that the dependency is determined, and “S” corresponds to the dependency source word in the analysis sentence storage unit 103 in step S8. The dependency destination candidate word ID is set in the “dependence destination” field, the type of the determination result is set in the “type” field in step S9, and the dependency source word ID in the dependency source word ID storage area 106 is set in the dependency destination pending stack in step S10. Update with the value popped from 108, and return to step S5.

  In cases other than the types “B” and “D”, it is determined that the dependency relationship has not been determined. In step S11, it is determined whether or not the dependency source word ID in the dependency source word ID storage area 106 is other than NULL. If there is, the dependence source word ID of the dependence source word ID storage area 106 is pushed onto the dependence destination pending stack 108 in step S12. Thereafter, in step S13, the dependency destination candidate word ID in the dependency destination candidate word ID storage area 107 is pushed onto the dependency destination pending stack 108, and in step S14, the dependency destination candidate word ID in the dependency destination candidate word ID storage area 107 is incremented. Return to step S3.

  In the following, a specific example of the morphological analysis result “ken / ga / her / ni / that / book / lifted” (FIG. 3) will be described with reference to FIGS.

  In FIG. 5, when starting the processing, the phrase grouping dependency analysis unit 105 pushes “0” as an initial value to the dependency destination pending stack 108 (step S1), and the dependency destination candidate in the dependency destination candidate word ID storage area 107 is pushed. The word ID is set to an initial value “1” (step S2). This state is shown in FIG.

  Returning to FIG. 5, the phrase grouping dependency analysis unit 105 determines whether or not the dependence destination candidate word ID in the dependence destination candidate word ID storage area 107 is larger than the word ID at the end of the sentence in the analysis sentence storage unit 103 (step S3). At this time, the dependence destination candidate word ID is “1” and the word ID at the end of the sentence is “7”, so it is determined that the dependence destination candidate word ID is not larger than the word ID at the end of the sentence (No in step S3).

  Next, the phrase grouping dependency analysis unit 105 sets the value “0” popped from the dependency destination pending stack 108 as the dependency source word ID in the dependency source word ID storage area 106 (step S4). By popping, the dependency-destination pending stack 108 becomes blank. This state is shown in FIG.

  Returning to FIG. 5, the phrase grouping dependency analysis unit 105 determines whether or not the dependency source word ID in the dependency source word ID storage area 106 is NULL (step S5). Since it is “0”, it is determined that it is not NULL (No in step S5).

  Next, the phrase grouping dependency analysis unit 105 causes the dependency relationship determination unit 109 to analyze the dependency relationship between the dependency source word and the dependency destination candidate word (step S6). For the dependence source word “word ID: 0, word: health, part of speech: personal name” and the dependence destination candidate word “word ID: 1, word: but part of speech: case particle”, the dependency relationship determination unit 109 uses the grammar definition table 110 ( Based on FIG. 4, the type “B” is determined.

  Next, the phrase grouping dependency analysis unit 105 determines whether the determination result is any of the types “B” and “D” (step S7). However, since the type is “B” here, the type “B” is determined. "D" is determined (Yes in step S7).

  Next, the phrase grouping dependency analysis unit 105 sets the dependency destination candidate word ID “1” of the dependency destination candidate word ID storage area 107 in the “dependency destination” field corresponding to the dependency source word of the analysis sentence storage unit 103 ( In step S8), the determination result type “B” is set in the “type” field (step S9). Also, the dependency source word ID in the dependency source word ID storage area 106 is updated with the value popped from the dependency destination pending stack 108 (step S10), but the dependency source word ID is “−” because the dependency destination pending stack 108 is blank. 1 ". This state is shown in FIG.

  Returning to FIG. 5, the phrase grouping dependency analysis unit 105 determines whether or not the dependency source word ID in the dependency source word ID storage area 106 is NULL (step S5). -1 ", it is determined to be NULL (Yes in step S5). As a result, the phrase grouping dependency analysis unit 105 pushes the dependence destination candidate word ID “1” of the dependence destination candidate word ID storage area 107 to the dependence destination pending stack 108 (step S13). This state is shown in FIG.

  Returning to FIG. 5, the phrase grouping dependency analysis unit 105 increments the dependence destination candidate word ID in the dependence destination candidate word ID storage area 107 to “2” (step S14). This state is shown in FIG.

  Returning to FIG. 5, the phrase grouping dependency analysis unit 105 determines whether or not the dependence destination candidate word ID in the dependence destination candidate word ID storage area 107 is larger than the word ID at the end of the sentence in the analysis sentence storage unit 103 (step S3). At this time, the dependence destination candidate word ID is “2” and the word ID at the end of the sentence is “7”, so it is determined that the dependence destination candidate word ID is not larger than the word ID at the end of the sentence (No in step S3).

  Next, the phrase grouping dependency analysis unit 105 sets the value “1” popped from the dependence-destination pending stack 108 as the dependence source word ID in the dependence source word ID storage area 106 (step S4). By popping, the dependency-destination pending stack 108 becomes blank. This state is shown in FIG.

  Returning to FIG. 5, the phrase grouping dependency analysis unit 105 determines whether or not the dependency source word ID in the dependency source word ID storage area 106 is NULL (step S5). Since it is “1”, it is determined that it is not NULL (No in step S5).

  Next, the phrase grouping dependency analysis unit 105 causes the dependency relationship determination unit 109 to analyze the dependency relationship between the dependency source word and the dependency destination candidate word (step S6). For the dependency source word “word ID: 1, word: but part of speech: case particle” and the dependency destination candidate word “word ID: 2, word: girlfriend, part of speech: pronoun”, the dependency relationship determination unit 109 uses the grammar definition table 110 ( The type is determined as “O” based on FIG.

  Next, the phrase grouping dependency analysis unit 105 determines whether the determination result is any of the types “B” and “D” (step S7). Here, since the type is “O”, the type “B” is determined. "D" is determined (No in step S7).

  Next, the phrase grouping dependency analysis unit 105 determines whether or not the dependency source word ID in the dependency source word ID storage area 106 is other than NULL (step S11). At this time, the dependency source word ID is “1”. Therefore, it is determined that it is other than NULL (Yes in step S11).

  Next, the phrase grouping dependency analysis unit 105 pushes the dependency source word ID “1” of the dependency source word ID storage area 106 to the dependency destination pending stack 108 (step S12), and then continues to the dependency destination pending stack 108. The dependence destination candidate word ID “2” in the candidate word ID storage area 107 is pushed (step S13). This state is shown in FIG.

  Returning to FIG. 5, the phrase grouping dependency analysis unit 105 increments the dependence destination candidate word ID in the dependence destination candidate word ID storage area 107 to “3” (step S14). This state is shown in FIG.

  Returning to FIG. 5, the phrase grouping dependency analysis unit 105 proceeds in the same manner thereafter, and the dependence destination candidate word ID in the dependence destination candidate word ID storage area 107 is determined from the word ID at the end of the sentence in the analysis sentence storage unit 103. FIG. 8C shows a state at the time when it is determined that the value is larger (Yes in step S3) and the phrase grouping dependency analysis process is ended. At this time, fields other than the word at the end of the sentence in the analysis sentence storage unit 103 are filled in the “dependence destination” and “type” fields.

  FIG. 9 is a diagram showing an example of recognition of a phrase head and a phrase break from the value in the analysis sentence storage unit 103. As a general rule, the word “D” is followed by a phrase break. For each clause delimited immediately after a word of type “D”, the clause to which the dependency destination word of the word having type “D” belongs within that clause (end of the clause) becomes the related clause of the clause.

  At this time, the relation destination of the phrase “kenga” is represented by the dependency destination word of the word “ga” having the type “D” in the phrase (end). The dependence destination word of “GA” is “raised” with the word ID “7”, and it can be seen that this is related to this phrase. Similarly, it can be seen that the relationship destination of the phrase “that” becomes “book” in which “that” is the dependency destination word of “that”.

  Note that even when the dependence destination word of the word of type “D” is not at the end of the clause, it may be interpreted that it is related to the clause to which the dependence destination word belongs.

As described above, the contents of the analysis sentence storage unit 103 at the time when the phrase grouping dependency analysis process ends indicate the dependency relation between the phrases. In other words, the phrase “Ken / ga” is related to the phrase “raised”, the phrase “she / ni” is related to the phrase “raised”, and the phrase “that / hon / ga” is related to the phrase “raised”. Show. As described above, the present embodiment has the following advantages.
(1) There is no need to separately prepare a processing module for grouping clauses and a processing module for analyzing dependency between clauses, and program development and maintenance can be facilitated.
(2) It is not necessary to scan (read) the sentence many times by the process of grouping it into clauses and the dependency analysis process, and the process can be speeded up.

  The present invention has been described above by the preferred embodiments of the present invention. While the invention has been described with reference to specific embodiments, various modifications and changes may be made to the embodiments without departing from the broad spirit and scope of the invention as defined in the claims. Obviously you can. In other words, the present invention should not be construed as being limited by the details of the specific examples and the accompanying drawings.

It is a figure which shows the structural example of the natural language analyzer concerning one Embodiment of this invention. It is a figure which shows the structural example of the dependence relationship determination part at the time of using SVM. It is a figure which shows the example of an analysis sentence storage part. It is a figure which shows the example of a grammar definition table. It is a flowchart which shows the example of a process of a phrase grouping dependency analysis part. It is FIG. (The 1) which shows the specific example of a process of the phrase grouping dependency analysis part. It is FIG. (2) which shows the specific example of a process of the phrase grouping dependency analysis part. It is FIG. (The 3) which shows the specific process example of a phrase grouping dependency analysis part. It is a figure which shows the example of recognition of a phrase head and a phrase delimiter from the value of an analysis sentence storage part.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Natural language analyzer 101 Analysis object sentence input part 102 Morphological analysis part 103 Analytical sentence storage part 104 Single sentence reading part 105 Phrase grouping dependency analysis part 106 Dependent word ID storage area 107 Dependent candidate word ID storage area 108 Dependent Undecided stack 109 Dependency determination unit 1091 Teacher data input unit 1092 Machine learning unit 1093 Grammar rule storage unit 1094 Dependency determination request reception unit 1095 Dependency determination execution unit 110 Grammar definition table 111 Analysis result output unit

Claims (5)

A natural language analysis device that analyzes a natural language sentence that can be divided into clauses and has a dependency relationship between clauses,
Morphological analysis means for decomposing the sentence to be analyzed into morphemes;
In Kukoto has determined the dependencies between each word morpheme string, and a clause Summary up dependency parsing means for performing a receiving dependency collectively raise clause analysis,
The sentence grouping dependency analysis means is:
At the start of processing, the initial value “0” is pushed onto the dependency destination pending stack, the dependency destination candidate word ID is set to the initial value “1”,
Next, as an end condition determination process, it is determined whether or not the dependency destination candidate word ID is larger than the word ID at the end of the sentence.
If it is determined that it is not large, the value popped from the dependency destination pending stack is set as the dependency source word ID,
Next, as the dependency source word ID determination process, it is determined whether the dependency source word ID is NULL,
When it is determined that it is not NULL, the dependency relationship between the dependence source word and the dependence destination candidate word is analyzed, and the dependence source word and the dependence destination candidate word form the same phrase. Determine whether the phrase is a type D indicating that the dependence destination candidate word is related to the last sentence, or a type O indicating a case other than the above,
Next, as a type determination process, it is determined whether the determination result is either type B or D,
If it is determined that the type is either B or D, the dependency destination candidate word ID is set as the dependency destination of the dependency source word, the determination result is set as the type of the dependency source word, and the dependency source word ID is determined as the dependency destination undecided. Update with the value popped from the stack, move to the dependence source word ID determination process,
When it is determined in the dependency source word ID determination process that the dependency source word ID is NULL, the dependency destination candidate word ID is pushed onto the dependency destination pending stack, the dependency destination candidate word ID is incremented, and the end condition determination processing To
When the determination result is type O in the type determination process, the dependency source word ID is pushed to the dependency destination pending stack, the dependency destination candidate word ID is pushed to the dependency destination pending stack, and the dependency destination candidate word ID is incremented. The natural language analysis apparatus is characterized in that the process proceeds to the end condition determination process . The natural language analysis apparatus according to claim 1,
Dependency determination in the phrase grouping dependency analysis means is performed based on a grammar definition table that associates types of determination results corresponding to conditions such as part of speech and positional relationship of words of dependency source and dependency destination candidates. Natural language analyzer characterized by The natural language analysis apparatus according to claim 1,
The natural language analysis apparatus according to claim 1, wherein the determination of dependency in the phrase grouping dependency analysis unit is performed based on a grammar rule machine-learned by SVM. A method performed by a natural language analyzer,
A natural language analysis method for analyzing a natural language sentence that can be divided into clauses and has a dependency relationship between clauses,
A morphological analysis process for decomposing the sentence to be analyzed into morphemes;
In Kukoto has determined the dependencies between each word morpheme string, and a clause Summary up dependency parsing step of performing a receiving dependency collectively raise clause analysis,
The sentence grouping dependency analysis process is as follows.
At the start of processing, the initial value “0” is pushed onto the dependency destination pending stack, the dependency destination candidate word ID is set to the initial value “1”,
Next, as an end condition determination process, it is determined whether or not the dependency destination candidate word ID is larger than the word ID at the end of the sentence.
If it is determined that it is not large, the value popped from the dependency destination pending stack is set as the dependency source word ID,
Next, as the dependency source word ID determination process, it is determined whether the dependency source word ID is NULL,
When it is determined that it is not NULL, the dependency relationship between the dependence source word and the dependence destination candidate word is analyzed, and the dependence source word and the dependence destination candidate word form the same phrase. Determine whether the phrase is a type D indicating that the dependence destination candidate word is related to the last sentence, or a type O indicating a case other than the above,
Next, as a type determination process, it is determined whether the determination result is either type B or D,
If it is determined that the type is either B or D, the dependency destination candidate word ID is set as the dependency destination of the dependency source word, the determination result is set as the type of the dependency source word, and the dependency source word ID is determined as the dependency destination undecided. Update with the value popped from the stack, move to the dependence source word ID determination process,
When it is determined in the dependency source word ID determination process that the dependency source word ID is NULL, the dependency destination candidate word ID is pushed onto the dependency destination pending stack, the dependency destination candidate word ID is incremented, and the end condition determination processing To
When the determination result is type O in the type determination process, the dependency source word ID is pushed to the dependency destination pending stack, the dependency destination candidate word ID is pushed to the dependency destination pending stack, and the dependency destination candidate word ID is incremented. The natural language analysis method is characterized in that the process proceeds to the end condition determination process . A natural language analysis program that analyzes a natural language sentence that can be divided into clauses and has a dependency relationship between clauses,
The computer that constitutes the natural language analyzer
Morphological analysis means for decomposing the sentence to be analyzed into morphemes,
In Kukoto has determined the dependencies between each word morpheme string, to function as a clause Summary up dependency parsing means for performing a receiving dependency collectively raise clause analysis,
The sentence grouping dependency analysis means is:
At the start of processing, the initial value “0” is pushed onto the dependency destination pending stack, the dependency destination candidate word ID is set to the initial value “1”,
Next, as an end condition determination process, it is determined whether or not the dependency destination candidate word ID is larger than the word ID at the end of the sentence.
If it is determined that it is not large, the value popped from the dependency destination pending stack is set as the dependency source word ID,
Next, as the dependency source word ID determination process, it is determined whether the dependency source word ID is NULL,
When it is determined that it is not NULL, the dependency relationship between the dependence source word and the dependence destination candidate word is analyzed, and the dependence source word and the dependence destination candidate word form the same phrase. Determine whether the phrase is a type D indicating that the dependence destination candidate word is related to the last sentence, or a type O indicating a case other than the above,
Next, as a type determination process, it is determined whether the determination result is either type B or D,
If it is determined that the type is either B or D, the dependency destination candidate word ID is set as the dependency destination of the dependency source word, the determination result is set as the type of the dependency source word, and the dependency source word ID is determined as the dependency destination undecided. Update with the value popped from the stack, move to the dependence source word ID determination process,
When it is determined in the dependency source word ID determination process that the dependency source word ID is NULL, the dependency destination candidate word ID is pushed onto the dependency destination pending stack, the dependency destination candidate word ID is incremented, and the end condition determination processing To
When the determination result is type O in the type determination process, the dependency source word ID is pushed to the dependency destination pending stack, the dependency destination candidate word ID is pushed to the dependency destination pending stack, and the dependency destination candidate word ID is incremented. Then, the program proceeds to the end condition determination process .

Images