JP2016218581A - Transition conflict collecting device, method, and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To efficiently acquire a transition conflict pair using crowd sourcing.SOLUTION: An assignment sentence presentation part 18 presents a screen for making a worker input a sentence indicating a situation which is requisite for the situation shown by the assignment sentence. An input part 20 receives the sentence showing the inputted requisite situation. A negative form converter 22 converts the sentence showing the inputted requisite situation into a negative form. An output part 24 outputs a pair of the sentence showing the requisite situation which is converted into the negative form and an assignment sentence as a transition conflict pair as antecedent negation.SELECTED DRAWING: Figure 1

Description

  The present invention relates to a transition contradiction collection apparatus, method, and program, and more particularly, to a transition contradiction collection apparatus, method, and program for collecting transition contradiction pairs.

  In the field of language generation in natural language processing, it is important to generate sentences with consistent contents. However, it is not easy to determine whether a computer-generated sentence has consistent contents because it requires common sense knowledge.

  For example, inconsistency may be included in the generated sentence as a case where consistency is lacking. For example, the sentence “I have never been to Paris but climbed the Eiffel Tower” contains a contradiction. This is because “I have never been to Paris” and “I climbed the Eiffel Tower” are contradictory.

  In order to avoid the generation of a sentence containing such a contradiction, it is necessary to check using knowledge of the contradiction.

  For example, if the computer has the knowledge that "I have never been to Paris" and "I climbed the Eiffel Tower" are contradictory, a sentence like the previous example will not be generated. .

  As a methodology for acquiring such contradiction knowledge, there are a method of automatically acquiring from a corpus (see Non-Patent Document 1) and a method of using crowdsourcing (a method for requesting data creation from a user on the Internet) (Non-Patent Document 1). 2).

Chikara Hashimoto, Kentaro Torisawa, Stijn De Saeger, Jong-Hoon Oh, and Jun'ichi Kazama.Excitatory or inhibitory: A new semantic orientation extracts contradiction and causality from the web.In Proceedings of EMNLP2012, pp. 619-630, 2012. Takamine, Hajime Morita, Daisuke Kawahara, Ikuo Kurohashi, Ryuichiro Higashinaka, Yoshihiro Matsuo. Analysis and classification of conflicts between situations using crowdsourcing, 21st Annual Meeting of the Language Processing Society, pp.305-308,2015 .

  Non-Patent Document 2 classifies contradictions into simultaneous contradictions and transitional contradictions. A simultaneous contradiction is a contradiction about a situation that does not happen at the same time, for example, <eat rice, do not eat rice>, <full stomach, eighth stomach>.

  Transition contradiction is a contradiction between two situations that have a time relationship and an order relationship. The situation where time and order are before is called antecedent A, and the situation behind is called consequent B. When A and B have such a relationship, if A or B is denied in the following cases, the pair becomes contradictory.

  State the negative of the antecedent. Consider the case where A is a precondition for B. For example, as a precondition for <going overseas trip>, such as <having a passport, going overseas trip>, a relationship such as <must have passport>. At this time, the negation of A, that is, the denial of the precondition and B is a contradiction pair. In this example, <I do not have a passport, go abroad>.

  Describes the denial of the consequent. If A, generally consider B. For example, “entering a restaurant, ordering something” and “entering a restaurant” generally have a relationship of “ordering something”. At this time, A and the denial of B become a contradiction pair. In this example, <enter the restaurant, do not order anything>.

  It is known that transition contradiction is difficult to obtain by crowdsourcing, both for the antecedent denial and the consequent denial. This is because simultaneous contradiction can be created to some extent by reversing the meaning of words, whereas transition contradiction is not such an easy operation. In fact, in Non-Patent Document 2, no transition contradiction in the negative of the antecedent has been collected. Further, even in Non-Patent Document 1, since a pattern focusing on the anomaly relationship is used, even if simultaneous contradiction can be automatically acquired, transition contradiction cannot be automatically acquired.

  The present invention has been made in view of the above circumstances, and an object thereof is to provide a transition contradiction collection apparatus, method, and program capable of efficiently acquiring a transition contradiction pair using crowdsourcing.

  In order to achieve the above object, the transition contradiction collection apparatus according to the first invention includes a task sentence presentation unit that presents a screen for causing a worker to input a sentence representing a situation that is a premise of a situation represented by the task sentence, An input unit that accepts an input sentence representing the presupposed situation; and the input sentence that represents the presupposed situation is converted to a negative form, and represents the presupposed situation converted to the negative form A negative conversion unit that outputs a pair of a sentence and the task sentence as a transition contradiction pair that is an antecedent negative.

  A transition contradiction collection method according to a second invention is a transition contradiction collection method in a transition contradiction collection apparatus including a task sentence presentation unit, an input unit, and a negative form conversion unit, wherein the task sentence presentation unit Presenting a screen for a worker to input a sentence representing a situation that is a premise of the situation to be represented, the input unit accepts the sentence representing the presupposed situation, and the negative form conversion unit is configured to input the input The sentence representing the presupposed situation is converted into a negative form, and the pair of the sentence representing the presupposed situation and the task sentence converted into the negative form is defined as a transition contradiction pair that is antecedent negative. Output.

  According to the first invention and the second invention, a worker is allowed to input a sentence representing a situation that is a premise of the situation represented by the task sentence, and the inputted sentence representing the premise situation is converted into a negative form. , By outputting the pair of the sentence representing the presupposed situation converted to the negative form and the task sentence as a transition contradiction pair that is negative in the antecedent, the transition contradiction pair is efficiently generated using crowdsourcing. Can be earned.

  The transition contradiction collection device according to the third invention is a task sentence presentation unit that presents a screen for causing a worker to input a sentence that represents a situation that normally occurs after a situation represented by the problem sentence, and a sentence that represents the inputted situation. The input unit that accepts the sentence, the sentence that represents the situation that has been input is converted into a negative form, and the pair of the task sentence and the sentence that represents the situation that has been converted to the negative form becomes a consequent negative transition And a negative conversion unit that outputs as a contradictory pair.

  A transition contradiction collection method according to a fourth invention is a transition contradiction collection method in a transition contradiction collection apparatus including a task sentence presentation unit, an input unit, and a negative form conversion unit, wherein the task sentence presentation unit Presenting a screen for allowing a worker to input a sentence indicating a situation that normally occurs after the situation to be expressed, the input unit accepts a sentence indicating a situation that normally occurs after the input, and the negative form conversion unit includes the input A sentence representing a situation that normally occurs after being converted into a negative form, and a pair of the task sentence and a sentence representing a situation that normally occurs after being converted into the negative form is a transition contradiction pair that becomes a consequent negation Output as.

  According to the third and fourth aspects of the invention, a sentence representing a situation that normally occurs after the situation represented by the subject sentence is input to the worker, and the sentence that represents the situation that usually occurs after the input is converted into a negative form. , And output a pair of the task sentence and the sentence that normally occurs after the conversion into the negative form as a transition contradiction pair that becomes a consequent negation, thereby making it possible to efficiently generate a transition contradiction pair using crowdsourcing. Can be earned.

  The transition contradiction collection device according to a third aspect of the present invention further includes a past tense conversion unit that converts the task sentence into a past tense, and the task sentence presentation unit converts the task sentence into a past tense by the past tense conversion unit. It is possible to present a screen for allowing the worker to input a sentence representing a situation that usually occurs after the situation represented by the sentence.

  According to a fourth aspect of the present invention, the past contradiction collecting method further includes a past tense conversion unit converting the task sentence into a past tense, wherein the past sentence conversion is performed by presenting the screen by the task sentence presenting unit. It is possible to present a screen for allowing the worker to input a sentence representing a situation that usually occurs after the situation represented by the task sentence converted into the past form by the section.

  A program according to the fifth invention is a program for causing a computer to function as each unit constituting the transition contradiction collection apparatus.

  As described above, according to the transition contradiction collection apparatus, method, and program of the present invention, it is possible to effectively obtain a transition contradiction pair using crowdsourcing.

It is a block diagram which shows the structure of the transition contradiction collection apparatus which concerns on embodiment of this invention. It is an image figure which shows an example of the screen showing teaching. It is an image figure which shows an example of the screen showing teaching. It is a flowchart which shows the content of the transition contradiction collection process routine in embodiment of this invention.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.

<Outline of the present embodiment>
Consider collecting the contradiction about the situation represented by a certain sentence using crowdsourcing. A task sentence is a sentence that represents a certain situation such as <winning the election>. Note that a situation consists of a predicate and zero or more terms.

  Antecedent denial is the relationship between a certain situation and a situation in which the preconditions for that situation are denied. However, since it is considered a simple task for a worker (a user of crowdsourcing) rather than simply considering a contradiction, that is, denial of a precondition, the worker writes the precondition. In the case of <winning the election>, the prerequisites for winning the election will be <candidate for election> and <have the right to be elected>. Ask a worker to write such a sentence. Then, the precondition is automatically converted into a negative form. If it is <candidate for election>, it will be converted to <do not stand for election>, and if it has <election right>, <do not have eligibility for election>. Finally, the sentence converted into the negative form and the task sentence are paired as an antecedent negative contradiction. In other words, it is possible to obtain a contradiction of the negatives of the antecedents: <no candidate for election>, <winning for election>, <not eligible for election>, and <winning for election>.

  Subsequent denial is the relationship between a certain situation and a situation that denies what would normally happen after the situation occurred. However, as with the antecedent denial, it is considered a simple task for workers to simply think about what happens in the normal case rather than considering contradiction, ie, denial of what would normally happen. Therefore, the worker presents the task sentence, and then asks the worker to write what normally happens. At this time, the task sentence is automatically converted into the past tense. This is to make it easier for workers to consider the transition. If the assignment sentence is <Go to hot spring>, it will be converted to <Go to hot spring>. Workers are asked to write what normally happens for this task statement. For example, it is assumed that <wash body> or <soak in hot spring> is input. Then, these input sentences are automatically converted into negative forms. <Do not wash your body> or <Do not immerse yourself in hot springs>. By doing this, it is possible to acquire the contradiction of the negative of the consequent of <going to the hot spring>, <do not wash the body>, <going to the hot spring>, and <do not soak in the hot spring>.

<System configuration>
The transition contradiction collection apparatus 10 according to the embodiment of the present invention stores a CPU (Central Processing Unit), a RAM (Random Access Memory), and a transition contradiction collection program for executing a transition contradiction collection processing routine described later. It is comprised with the computer provided with ROM (Read Only Memory). The CPU functions as the transition contradiction collection apparatus 10 when the CPU reads and executes the transition contradiction collection program from the ROM which is an internal storage device.

  As shown in FIG. 1, the transition contradiction collection apparatus 10 includes a task sentence set 12, a task sentence acquisition unit 14, a past form conversion unit 16, a task sentence presentation unit 18, an input unit 20, a negative form conversion unit 22, and an output unit. 24.

  The task sentence set 12 stores a set of task sentences representing the situation.

  The assignment sentence acquisition unit 14 acquires one or more assignment sentences from the assignment sentence set 12.

  The past tense conversion unit 16 converts the task sentence acquired by the task sentence acquiring unit 14 into a past tense when the transition contradiction pair to be collected is a transition contradiction pair with no consequent. If the transition contradiction pair to be collected is negative in the antecedent, the assignment sentence acquired by the assignment sentence acquisition unit 14 is sent to the assignment sentence presentation unit 18 as it is.

  Here, expressions to be converted are verbs, adjectives, useful suffixes, and determiners at the end of the sentence.

  The morpheme analysis processing is performed on the task sentence using the conventionally known morphological analyzer JUMAN, and the processing is performed for each part of speech, the usage type, and the usage type based on the dictionary of the morphological analyzer JUMAN. Basically, if it can be used in a shape, it is converted to a shape.

  For example, the following is the result of morpheme analysis for “run” by morphological analyzer JUMAN.

  Run Hashiru Run Verb 2 * 0 Consonant Verb La Line 10 Basic Form 2 "Representative: Run / Hashiru"

  The fourth column is the part of speech, the eighth column is the conjugation type (N adjectives, adjectives), and the tenth column is the conjugation form. Based on the result of morphological analysis, “run” is obtained by acquiring the “run” shape from the dictionary of the morphological analyzer.

  The dictionary has the following entries as a pattern.

  Ran hashes run verbs 2 * 0 consonant verbs la line 10 form 10 "representative notation: run / hashiru"

  In this embodiment, JUMAN is used for the morphological analyzer, but Chasen, Mecab, etc., which are free software, may be used.

  The past tense conversion is exceptionally performed only in the following cases (1) to (4).

(1) If the conversion source expression is an instruction form (for example, “run”), the expression cannot be converted to the past form and is output as it is.

(2) If the expression of the conversion source is the adjective “good”, if it is converted as it is based on the dictionary, it will become “good”, and it is unnatural, so it is replaced with “good”.

(3) If the expression of the conversion source is the verb “I”, it is ambiguous which “I” should be converted, such as “I was” or “Fried”, so it is fixedly converted to “I”.

(4) When the conversion source expression is a judgment word or a nadic adjective, there are two conversion candidates of a da string form and a dual string form, so the data is fixed and converted into the da string form.

  With this process, if the subject sentence is “go to hot spring”, “go to hot spring” is obtained. Then, the converted task sentence is sent to the task sentence presentation unit 18.

  The task sentence presentation unit 18 presents to the worker a screen that displays the task sentence obtained from the task sentence acquisition unit 14 or the task sentence converted into the past form sent from the past form conversion unit 16 together with the teaching. The teaching is an instruction that tells the worker what kind of sentence the worker wants to input. When collecting antecedent denial and when collecting antecedent denial, different teachings are used. In addition, in order to improve the quality of the collected sentences, a precaution to avoid inputting less relevant sentences is also presented.

  When collecting the antecedent denial, as shown in FIG. 2, when presenting a screen for allowing the worker to input a sentence representing the situation that is the premise of the situation represented by the task sentence, and collecting the antecedent denial, As shown in Fig. 5, a screen is displayed for allowing the worker to input a sentence that represents a situation that usually occurs after the situation represented by the task sentence.

  The input unit 20 presents a screen having an input field to the worker after the task sentence presentation unit 18 presents a screen representing the task sentence and the teaching, and waits for input from the worker. When the worker finishes input and the input end button is indicated by pressing the input end button, the input sentence is accepted and sent to the negative form conversion unit 22.

  The negative form conversion unit 22 converts the input sentence received by the input unit 20 into a negative form.

  Here, the expressions to be converted are verbs, adjectives, some suffixes, and determiners at the end of the sentence. The morpheme analyzer JUMAN is used to perform morpheme analysis on the input sentence. Based on the dictionary of the morpheme analyzer JUMAN, as shown in the following (1) to (5), Performs conversion processing for each utilization form.

(1) When the end of the input sentence is a verb, the conversion process is performed as follows.

If the final verb is a blank form (when the input is a negative form), convert it to the basic form and delete the suffixes after that (do not run → run).
If the last verb is a tag form, convert it to the form of the original form + “not” (run → did not run).
If the last verb is imperative, convert it to the basic form + "na" (run → don't run).
As an exception, if the last verb is “I”, “A”, or “Sa”, it is converted to the corresponding negative form.
In all other cases, convert it to the form of the original form + "not" (run → do not run).

(2) If the input sentence ends with a na-adjective, the conversion process is performed as follows.

If the last adjective is a te form / ja form + “not”, convert it to a basic form and delete the rest (not clean, not clean → clean).
If the last adjective is a te form / ja form + “not”, it is converted to a ta form (not clean, not clean → clean).
If the last adjective is a Ta-form, it is converted to the Te form + "Not".
In other cases, it is converted to a "te" + "no" form.

(3) If the input sentence ends with an adjective, the conversion process is performed as follows.

If the last adjective is "no", replace it with the corresponding form of "yes" (no method → there is a method).
If the last adjective is a continuous form, convert it to the basic form and delete the rest (I don't want it → I want it).
If the adjective at the end is a combined form + "I didn't", convert it to a T-form (I didn't want it → I wanted it).
In other cases, convert to continuous form + "no" form (want → not wanted).

(4) If the input sentence ends with a suffix (excluding “none”), the conversion process is performed as follows.

If the suffix at the end is the combined form + "not", convert it to the basic form (I do not want to run → I want to run).
If the suffix at the end is continuous + “not”, it is converted to a tag.
If the suffix at the end is a basic form, convert it to the form of the original form + "None" (I want to run → I don't want to run).
If the suffix at the end is a T-shape, it is converted to a continuous shape + “not”.

(5) When the end of the input sentence is a judgment word, the conversion process is performed as follows.

If the last terminator is a tag, replace it with "not" (rain was not rain).
If the last judgment is Te / Ja + “None”, replace it with the basic form (not rain → rain).
If the last judgment is Te / Ja + “Not”, replace it with a Ta (it was not rain → it was rain).
Otherwise, convert it to the shape of “Te” + “None” (rainy → not rainy).

  The input sentence converted into the negative form as described above is sent to the output unit 24.

  The output unit 24 outputs a pair of the task sentence acquired by the task sentence acquiring unit 14 and the input sentence converted into a negative form as a transition contradiction pair. When obtaining the negative of the antecedent, the input sentence and the task sentence converted into the received negative form are paired in this order. When acquiring the consequent negation, the task sentence and the input sentence converted into the received negative form are paired in this order.

<Operation of transition contradiction collector>
Next, the operation of the transition contradiction collection apparatus 10 according to this embodiment will be described. First, when an instruction to collect a transition contradiction pair with an antecedent negative or a transition contradiction pair with a negative consequent is input, the transition contradiction collection apparatus 10 executes a transition contradiction collection processing routine shown in FIG.

  First, in step S100, an assignment sentence is acquired from the assignment sentence set 12. In step S <b> 102, it is determined whether to collect a transition contradiction pair in which the consequent is negative. When collecting a contradiction negative contradiction pair, the process proceeds to step S104. On the other hand, when collecting a contradiction negative contradiction pair, the process proceeds to step S106.

  In step S104, the task sentence acquired in step S100 is converted into a past tense.

  In step S106, the task sentence acquired in step S100 and a screen representing teaching for inputting antecedent denial or consequent denial are presented to the worker.

  In step S108, a screen having an input field is presented, and it is determined whether or not a sentence input by the worker has been accepted. When the worker inputs a sentence that is negative or negative in the input field, the process proceeds to step S110.

In step S110, the input sentence received in step S108 is converted into a negative form. Then, in step S112, it is determined whether or not the antecedent negative transition contradiction pair is collected. In the case of collecting the transition contradiction pairs in which the antecedent is negative, the process proceeds to step S114, and the pair of the input sentence converted into the negative form in step S110 and the assignment sentence acquired in step S100 is determined as the antecedent negative. The transition contradiction pair is output, and the transition contradiction collection processing routine is terminated.
On the other hand, in the case of collecting a transition contradiction pair in which the consequent is negative, the process proceeds to step S116, and a pair of the task sentence acquired in step S100 and the input sentence converted into a negative form in step S110 is changed to the following. A negative contradictory transition contradiction pair is output, and the transition contradiction collection processing routine is terminated.

<Collecting experiment>
As a result of evaluating whether or not the transition contradiction can be collected by the present invention using a general crowdsourcing service, 20 workers each write two or more preconditions for the situation represented by the problem sentence to be negated. By converting, we were able to obtain 48 contradictory transition contradictory pairs. In addition, it is possible to obtain 44 contradictory negative transition contradictions by having 20 workers each write two or more sentences and performing a negative conversion that happens after the situation that the task sentence represents. It was. This collection experiment showed that the present invention can acquire a transition contradiction that cannot be obtained simply by having a worker write a contradiction.

  As described above, according to the transition contradiction collection device according to the present embodiment, a sentence that represents a situation that is the premise of the situation represented by the task sentence is input to the worker, and a sentence that represents the premise that has been entered. Is converted into a negative form, and the sentence that represents the precondition that has been converted to the negative form and the task sentence are output as a transition contradiction pair that is negative in the antecedent, so that the transition using crowdsourcing Efficiently obtain contradictory pairs.

  In addition, let the worker input a sentence that represents the situation that normally occurs after the situation that the task sentence represents, convert the sentence that normally occurs after being input to a negative form, converted to a task sentence and a negative form, By outputting a pair with a sentence representing a situation that normally occurs later as a transition contradiction pair that is a consequent negation, a transition contradiction pair can be efficiently obtained using crowdsourcing.

  In addition, by using the collected transition contradiction pairs, in the language generation system, it is possible to generate utterances that are not inconsistent and to generate sentences that are easy for the user to understand. Thereby, human intellectual activity can be promoted.

  The present invention is not limited to the above embodiment, and various modifications and applications can be made without departing from the gist of the present invention.

  For example, the case of collecting the transition contradiction pair that becomes the antecedent negation and the transition contradiction pair that becomes the consequent denial was explained as an example, but it is not limited to this, only the transition contradiction pair that becomes the antecedent denial, Or you may make it collect only the transition contradiction pair which becomes a consequent negation.

  Further, in the present specification, the embodiment in which the program is preinstalled has been described. However, the program stored in an external storage device or recording medium is read as needed, and is downloaded and executed via the Internet. You may make it do. In addition, the program can be provided by being stored in a computer-readable recording medium.

DESCRIPTION OF SYMBOLS 10 Transition contradiction collection apparatus 12 Problem sentence set 14 Problem sentence acquisition part 16 Past form conversion part 18 Problem sentence presentation part 20 Input part 22 Negative form conversion part 24 Output part

Claims (7)

An assignment sentence presenting section that presents a screen for allowing a worker to input a sentence representing a situation that is a premise of the situation represented by the assignment sentence;
An input unit for receiving a sentence representing the input presupposed situation;
The input sentence that represents the presupposed situation is converted to a negative form, and the pair of the sentence that represents the presupposed situation and the task sentence that has been converted to the negative form is a transition contradiction that results in a negative of the antecedent A negative conversion unit that outputs as a pair;
Transition contradiction collector including An assignment sentence presenting section that presents a screen for allowing a worker to input a sentence representing a situation that normally occurs after the situation represented by the assignment sentence;
An input unit for receiving a sentence representing a situation that normally occurs after the input;
The input sentence that represents a situation that normally occurs after the conversion is converted into a negative form, and the pair of the task sentence and the sentence that normally occurs after the conversion is converted to the negative form, a transition that becomes a consequent negative A negative conversion unit that outputs as a contradictory pair;
Transition contradiction collector including It further includes a past tense conversion unit for converting the task sentence into a past tense,
The transition according to claim 2, wherein the task sentence presentation unit presents a screen for allowing a worker to input a sentence representing a situation that normally occurs after the situation represented by the task sentence converted into the past form by the past form conversion unit. Contradiction collector. A transition contradiction collection method in a transition contradiction collection device including an assignment sentence presentation unit, an input unit, and a negative form conversion unit,
The assignment sentence presentation unit presents a screen for causing a worker to input a sentence representing a situation that is a premise of the situation represented by the assignment sentence,
The input unit accepts a sentence representing the input presupposed situation,
The negative form conversion unit converts the input sentence representing the presupposed situation into a negative form, and a pair of a sentence representing the presupposed situation converted into the negative form and the task sentence, Transition contradiction collection method to output as a transition contradiction pair that is negative for the antecedent. A transition contradiction collection method in a transition contradiction collection device including an assignment sentence presentation unit, an input unit, and a negative form conversion unit,
The task sentence presenting unit presents a screen for causing a worker to input a sentence representing a situation that normally occurs after the situation represented by the task sentence,
The input unit accepts a sentence representing a situation that normally occurs after the input,
The negative form conversion unit converts the input sentence that normally occurs after the sentence into a negative form, and converts the task sentence and the sentence that normally occurs after the conversion into the negative form. , A transition contradiction collection method that outputs as a transition contradiction pair that is a negative of the consequent. The past tense conversion unit further includes converting the task sentence into a past tense,
Presenting the screen by the task sentence presentation unit presents a screen for allowing a worker to input a sentence representing a situation that normally occurs after the situation represented by the task sentence converted to the past form by the past form conversion unit. The transition contradiction collection method according to claim 5.   The program for functioning a computer as each part which comprises the transition contradiction collection apparatus of any one of Claims 1-3.

Images