JPH01284922A - Matching check device - Google Patents

Abstract

PURPOSE:To shorten the data retrieving time by reading out the data to be retrieved for each block to store them into a memory and retrieving these data at one time. CONSTITUTION:When the base address value is set to a base pointer 5 from a CPU 16, the data 11 equal to one block set based on the base address value are read out of a knowledge base 17 and stored in each work memory 9. Then the data corresponding to the item numbers set to an offset value register 6 are read out among those storage contents of the memories 9 and supplied to a comparator 2. Then the data supplied to the comparator 2 are compared simultaneously with the values stored in a comparison value register 7.

Description

DETAILED DESCRIPTION OF THE INVENTION (Field of Industrial Application) The present invention relates to a matching inspection device used in computers and the like.

(Prior art) In artificial intelligence composed of computers,
Data matching the conditions is extracted while accessing the knowledge base based on manually entered conditions, and inference processing is performed based on the extraction results.

FIG. 3 is a schematic diagram showing an example of a search method used in such artificial intelligence.

In the search method shown in this figure, search processing is performed as described below.

First, when a search command is input manually, a search control unit (not shown) generates a base address value corresponding to this search command, sets this in the base pointer 105, and becomes the search target. Item contents (search conditions) are set in the condition section 101.

Next, data 106 (data to be searched) located at the position specified by the base address value is read from the knowledge base 102 and transferred to the working memory 103.

Thereafter, the item contents of the data 106 stored in this working memory 103 and the item contents of the search condition set in the condition section 101 are read out sequentially from the first item, and
Comparison is performed by the comparison unit 104.

When the comparison process between the item contents of the data stored in these working memories 103 and the item contents of the search conditions set in the condition section 101 is completed, based on the comparison result, these working memories 103 It is checked whether the item contents of the data stored in the search condition section 101 match all the item contents of the search conditions set in the condition section 101.

And if these all match, this data 10
The value of the base pointer 105 used when reading 6 is returned to the search control unit as a search result.

Further, if the item contents of the data stored in the working memory 103 and the item contents of the search condition set in the condition section 101 do not match even one item, the link of the currently processed data 106 is made. Based on pointer 107,
The next data address is required.

After this, the next data 10 is based on this data address.
6 is read out and stored in working memory 103.

Thereafter, the same process as described above is repeated to search for data 106 that matches the search conditions.

By the way, in such a data search method, the number of data 106 to be inspected is "n", and the condition part 101 is
If the number of items set in is "m", at least
Comparison operations must be performed nXm times.

For this reason, in an inference engine that searches data many times, it takes too much time to search, making it impossible to perform inference processing in real time.

(Object of the Invention) In view of the above-mentioned circumstances, an object of the present invention is to provide a matching inspection device that can significantly shorten search time and thereby speed up inference processing.

(Summary of the Invention) In order to solve the above-mentioned problems, the matching inspection device according to the present invention fetches data in blocks from a knowledge base, etc., and stores the data in parallel in multiple working memories in units of data. . After that, the contents stored in each of these working memories are read in parallel, and the read results are compared with the search target data specified in advance, and pattern matching is performed based on the comparison results. Determine pass/fail.

(Embodiment) FIG. 1 is a block diagram showing an embodiment of a matching inspection device according to the present invention.

The matching inspection device shown in this figure has a working memory circuit l.
, a comparison circuit 2 , a determination section 3 , and a register circuit 4 . When a search condition is set in the register circuit 4 by the CPU 16 , the knowledge base 17 is searched based on this condition.
The data 11 is loaded in block units from , and data matching this search condition is extracted.

In this case, data in l block units is N pieces of data 1
1, and each of these data 11 describes M item contents.

The register circuit 4 includes a base pointer 5 in which the address value (base address value) of the search target block in the knowledge base 17 is stored, and an offset value register 6 in which the number of the item to be compared (item number) is stored. , a comparison value register 7 in which contents of items to be compared (item contents) are stored, and a comparison command register 8 in which comparison control instructions are stored.

When the base address value, item number, item content, and comparison control command are supplied from the CPU 16, these are held by the base pointer 5 to the comparison command register 8, and are sent to the working memory circuit 1 and the comparison circuit 2. and the determination unit 3 are controlled.

The working memory circuit 1 has N
It is provided with (N-1') working memories 9 and (N-1') offset adders 18.

When a base address value is set in the base pointer 5, 11,099 pieces of data 11 based on the base address value are read from the knowledge base 17, and these are stored in each work memo IJ 9. . Thereafter, among the contents stored in each of the working memories 9, the contents of the item area 10 corresponding to the item number set in the offset value register 6 are read out, and these are supplied to the comparison circuit 2. .

The comparison circuit 2 includes N comparators 12, and when a comparison command is set in the comparison command register 8, the item contents output from each of the work memories 9 by each comparator 12, and the The item contents set in the comparison value register 7 are compared with each other. If these match, the comparator 12 that detects this outputs a bit "1", and if they do not match,
The comparator 12 detecting this outputs a bit "O".

The determination unit 3 includes first and second register groups 13.14 having a capacity of N bits, and these first and second register groups 13.1.
and N logical product operation circuits 15 that perform four-bit operations.

In the initial state, each bit of the second register group 14 is set to "1".

Next, each bit signal is stored in each bit of the first register group 13 each time a bit signal is output from the comparator circuit 2.

After this, each AND operation circuit 15
3 and each bit forming the second register group 14 are ANDed, and the results of these operations are stored in the corresponding bits of the second register group 14.

Next, the operation of this embodiment will be explained with reference to the flowchart shown in FIG.

First, when a base address value is set in the base pointer 5 by the CPU 16 (step 5Tl), 11,099 pieces of data 11 are read out from the knowledge base 17 based on this base address value.
It is stored in each working memory 9 (step 5T2).

Thereafter, the item contents are set in the comparison value register 17 by the CPol 6 (step 5T3).

The offset value register 6 is then set by the CPU 16.
If the item number is set to (step 5T4), the contents of the item area 10 corresponding to the item number of each work area 9 are read out, and these are read out from each comparator 1 of the comparison circuit 2.
2 (step 5T5).

Next, when a comparison command is set in the comparison command register 8 by the CPU 16 (step 5T6), each comparator 12 corresponds to the item contents outputted from each of the working memories 9 and the comparison value register 7. Compare the item contents set in , and if they match,
A bit "1" is generated, and if they do not match, a bit "0" is generated and supplied to each bit of the first register group 13 (step 5T7).

Then, when the bit data is written to each of these comparators 12 (step 5T8), each bit of the first register group 13 and the second register group 14 are
is logically ANDed with each bit of , and each of these logical products is stored in the corresponding bit of the second register group 14 (step 5T9).

Thereafter, each time the contents of the offset value register 6, comparison value register 7, and comparison instruction register 8 are rewritten by the CPU 16, the above-described operation is repeated, and the item contents of each working memory 9 are individually checked. (Step 5 TIO).

Thereafter, when checking the item contents of each work memory 9 is completed, the CPU 16 checks the value of each bit constituting the second register group 14 (step 5TII).
).

Then, if there is a bit that is 'l', CPol
B, it is determined that there is data that matches the search condition in all the processed blocks, and each bit data in the second register group 14 is converted into a "hexadecimal" number.

Thereafter, this conversion result is added to the base address value as offset data to calculate the address value of the data that matches the search condition, and the search operation ends (step 5T12).

Also, all bit data in the second register group 14 are “0”.
”, the CPU 16 determines that there is no data matching the search condition in the block just processed, and calculates a base address value specifying the next block (step 5T13).

Thereafter, the above-described operation is repeated, and the comparison value register 7
A search is sequentially performed for data having a matching item content string with each set item content.

In this way, in this embodiment, data is fetched from the knowledge base 17 in block units and checked in parallel in each data unit, so the search time can be significantly shortened, and this allows for inference. Processing can be sped up.

Further, in the embodiment described above, the register circuit 4 is provided in the matching inspection device, but instead of this, the CP
A register in U16 may also be used.

Further, in the embodiment described above, the data 11 in the knowledge base 17 is read out by the working memory circuit 1, but the data 11 is taken in from the knowledge base 17 by the CPU 1B and supplied to the working memory circuit 1. Alternatively, the data 11 in the knowledge base 17 may be transferred to the working memory l using a DMA (direct memory access device) or the like.

(Effects of the Invention) As described above, according to the present invention, search time can be significantly shortened, thereby speeding up processing including search processing.

Therefore, if the matching inspection device according to the present invention is provided in an inference engine or the like, inference processing and the like can be greatly speeded up.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing an embodiment of the matching inspection device according to the present invention, FIG. 2 is a flowchart showing an example of the operation of the same embodiment, and FIG. 3 is a schematic diagram showing an example of a conventional search method. . 2... Comparison section (comparison circuit), 4... Judgment section (judgment circuit), 9... Working memory, 11... Data. Patent applicant: Toyo Tsushinki Co., Ltd.

Claims (1)

[Claims] Comparison of multiple working memories in which multiple pieces of data to be searched are individually stored, the contents of each of these working memories being read out in parallel, and the results of these readings being compared with the search target data specified in advance. What is claimed is: 1. A matching inspection device comprising: a comparison section; and a determination section that determines the quality of pattern matching based on the comparison result of the comparison section.