JPS62126460A - Answer collating device - Google Patents

Abstract

PURPOSE:To collate many answers only by the description of a simple axiom by providing an axiom input means, an inference rule storing means, an inference means, a character string input means, a character string collating means, an inference control means, and a character string collating control means. CONSTITUTION:The inference means 3 accumulated in the inference rule storing means 2 is applied to an axiom inputted from the inference means axiom input means 1 to execute the inference. When the inference succeeds, a signal indicating the success of the inference is outputted to the character string collating control means 7, the inference result is outputted to the character string collating means 5 and the inside status is held as it is. When a signal outputted from the inference control means 6 indicates the success of the character string collating, the inference is ended, and if the signal from the means 6 indicates failure, the current inference result is cancelled and the inference is continued. When the inference is failed, a signal indicating the failure of the inference is outputted to the means 7 to end the inference.

Description

DETAILED DESCRIPTION OF THE INVENTION (Industrial Application Field) The present invention is based on CAI (Computer Aided In
The present invention relates to an answer matching device used in 5 tructions, etc., and more specifically to a device that determines whether an input answer is a character string inferred from specific axioms and inference rules.

(Prior art) Methods of answer verification in conventional CAI systems include a method of checking whether an input answer and a predicted answer completely match, and a method of checking whether one or more input answers are selected from among a plurality of predicted answer items. A method for determining whether items appear in the same order as the items in the expected answer or out of order, and whether one or more items in the expected answer are included in the input answer in that order or out of order. A method to check the match with the expected answer by excluding any character string from the input answer, a method to find the value of the expression by substituting an arbitrary numerical value to the characters of the character expression in the matching of mathematical expressions. There is a known method for determining correctness or incorrectness based on the following.

(Problems with the prior art) However, among the conventional answer matching methods, there is no method that determines correctness or incorrectness by substituting arbitrary numerical values for the characters of the mathematical expression and calculating the value of the expression when comparing mathematical expressions. It has the disadvantage that formal errors in character expressions cannot be identified, and other methods have the disadvantage that if there are multiple answer examples in the predicted answer, all answer examples must be listed. There is.

(Objective of the Invention) An object of the present invention is to provide an answer matching device that eliminates the need to list all answer examples of predicted answers, and does not care whether the answers to be matched are mathematical formulas, sentences, options, etc. There is a particular thing.

(Structure of the Invention) The present invention provides an apparatus for determining whether a character string input as an answer satisfies a predetermined condition regarding the format, which includes a character string input means, an axiom input means, and an inference rule storage means. and an inference means having a function of making an inference by applying the contents of the inference rule storage means to the output from the axiom input means, and a function of comparing the output from the inference means with the output from the character string input means. and a function of returning a logical value false to an external output when the output from the inference means indicates failure of the inference, and activating the string comparison means when the output indicates success of the inference. a string matching control means having a character string matching control means; and when the output of the string matching means indicates success in string matching, a logical value true is returned to an external output, and when the output of the string matching means indicates failure in string matching, the inference means The inference control means has the function of causing the inference result to be rejected and the inference to be continued.

(Example) Next, an example of the present invention will be described with reference to FIG.

FIG. 1 is a block diagram showing one embodiment of the present invention. 1
is an axiom input means, which has a function of inputting axioms expressing the formal characteristics of an answer example of a predicted answer and outputting them to the inference means 3. The axiom input means 1 is, for example, an interface with a host computer.

2 is an inference rule storage means which stores inference rules and outputs the inference rules to the inference means 3 in response to a request from the inference means 3; 3 is an inference means which, when an axiom is input from the axiom input means 1, performs inference by applying the inference rules stored in the inference rule storage means 2, and determines the success or failure of the inference by a character string collation control means 7.
outputs the inference result to the string matching means 5, inputs the result of the matching via the inference control means 6, terminates the inference if the matching is successful, and rejects the inference result if the matching is unsuccessful. It has the ability to continue reasoning. Reference numeral 4 denotes a character string input means, which has a function of inputting the operator's answer character string and outputting it to the character string matching means 5. The character string input means 4 may be a device such as a keyboard through which an answer character string is directly input by an operator, or an interface through which a character string is input through a host computer. 5 is a character string matching means which is activated when receiving a signal of success in inference from the character string matching control means 7, and pattern-matches the inference result from the inference means 3 and the character string from the character string input means 4; It has a function of outputting the success or failure of pattern matching to the inference control means 6. In addition, the character string matching means 5
has a function of resolving supercharacters when the output from the inference means 3 includes supercharacters such as wild cards. Reference numeral 6 denotes an inference control means which outputs a logical value true to an external output when the output from the string matching means 5 indicates a success in pattern matching, returns the inference means 3 to its initial state, and controls the output from the string matching means 5. It has a function of instructing the inference means 3 to reject the inference result and to continue inference when the output indicates failure of pattern matching. 7 is a string matching control means which activates the string matching means 5 when the output from the inference means 3 indicates success of the inference, and outputs an external output when the output from the inference means 3 indicates failure of the inference. It has a function to output a logical value of false.

The functions of the inference means 3 shown in FIG. 1 will be explained in more detail by introducing the flowchart shown in FIG. The algorithm of the inference means 3 shown in FIG. 2 is as follows.

(2) Inference means The inference means stored in the inference rule storage means are applied to the axioms input from the axiom input means to perform inference. (11, 12) (11) When the inference is successful, a signal indicating the success of the inference is output to the string matching control means, and the inference result is output to the string matching means, and the internal state is maintained as it is. (13
, 14, 15) ■ Wait for a signal from the inference control means, and when the signal from the inference control means indicates success in string matching, end the inference, and when the signal from the inference control means indicates failure in string matching. , the current inference result is rejected and inference continues. (16, 17) ■ When inference is unsuccessful due to exhaustion of inference or physical constraints such as insufficient storage capacity, a signal indicating failure of inference is output to the string matching control means and inference is continued. finish. (13,18)
(Effects of the Invention) For example, suppose that the following inference rules are applied in the present invention.

1+-2-'-9 (α, 13tα (α, f3)-13 [α, p1: δ-αδp [α, p1: δ-pδα [a, p, y]: δ-a8p8y [αJ3. y]: δ-0δy813 [0, β, Y]: δ-pδαδY [α, f3.yl: δ-D8yδα [αJ3.y]: δ-Yδαδp [αJ3.yl: δ-Yδpδα However, here αf3yδ is represents the terminal symbol string, (,
) [ ]: represents a non-terminal quantity. In addition, terminal symbol strings are expressed in brackets 5' to distinguish them from non-terminal symbols.

Next, the following axioms are input to the present invention as expected answers.

WX', 'Y', '-Z']:''+2 Then, in the present invention, a logical value true is output when the following answer examples are input.

wx+y−z WX−Z+Y y+wx−z y−z+wx −Z+WX+Y −z+y+wx A mathematically equivalent character expression as described above can be derived from one axiom.

Furthermore, if Wx is allowed to become XW, the following axioms can be used by nesting the syntax rules.

[[W', IXl], +1. IY1. (-21], +
+ 1 or the following axiom that gives the same result as the above axiom.

[('WX','XW'),'Y','-Z']:'
+ 'From the above two axioms, the following example answers can be derived.

wx + y-z XW + Y-Z WX-Z + Y w-z-y y + wx-z y + xw-z y-z + wx Y-Z + Well then In the past, it was necessary to list all answer examples of predicted answers, but according to the present invention, a large number of answer examples can be collated by simply writing a simple axiom.

[Brief explanation of drawings]

FIG. 1 is a diagram showing the basic configuration of the present invention, and FIG. 2 is a flowchart showing the operation of the inference means shown in FIG. In the figure, 1...Axiom input means, 2...Inference rule storage means, 3...Inference means, 4...Character string input means, 5...Character string matching means, 6...Inference control means, 7
. . . indicates a character string collation control means, respectively.

Claims (1)

[Claims] A device for determining whether a character string input as an answer satisfies a predetermined condition regarding a format, the device comprising: a character string input means, an axiom input means, an inference rule storage means;
an inference means having a function of inferring by applying the contents of the inference rule storage means to the output from the axiom input means, and a function of comparing the output from the inference means with the output from the character string input means. a character string matching means, and a character having a function of returning a logical value false to an external output when the output from the inference means indicates failure of the inference and activating the string matching means when the output from the inference means indicates success of the inference; When the outputs of the column matching control means and the string matching means indicate success in string matching, a logical value true is returned to the external output, and when the outputs of the string matching means indicate failure, the inference result is sent to the inference means. An answer matching device characterized by having an inference control means having a function of rejecting the question and continuing the inference.