JPH02297193A - Dictionary consulting device - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of the Invention The present invention relates to a dictionary lookup device used when a machine analyzes or generates sentences or sentences written in a natural language.

2. Description of the Related Art In a natural language processing device that processes texts and sentences written in a natural language by a machine, a dictionary lookup is performed to extract predetermined word weight information by appropriately referring to necessary vocabulary information stored in advance.

Conventionally, dictionary lookup devices search for one or more keywords individually by applying a file management method using transposed files such as B-tree, and then integrate the results or sequentially narrow down the results by keyword. There was one that displayed what was obtained by searching as a search result.

Problems to be Solved by the Invention In a dictionary lookup device that applies a conventional file management method using transposed files such as a B-tree, when searching a dictionary using one or more keywords required by a natural language processing device, only one keyword is required. Since the search results are obtained by searching for each of the above keywords, integrating the results, or sequentially narrowing down the results by keywords, the storage area for the transposed files in the dictionary lookup device is large. , it took a lot of effort to change the transposed file as the contents of the dictionary changed, and it was difficult to flexibly design the size of the storage area for the transposed file according to the environment of the computer on which the dictionary lookup device was implemented. .

The present invention has been made to solve the above problems, and it is an object of the present invention to provide a dictionary lookup device that has a small storage area and allows easy modification of dictionary contents.

Means for Solving the Problems Technical means of the present invention for solving the above problems include a dictionary information storage device that stores natural language starting information, and a superimposed code of word information in the dictionary information storage device. a superposition code storage device for searching the superposition code of the superposition code storage device based on the superposition code of question information for dictionary lookup; It is equipped with a verification device for verification.

Effect The effect of the above configuration is as follows. One or more keywords included in the start-of-day information stored in the dictionary information storage device are...
The data is encoded using the Tusch function, and its superposition code is created and stored in a superposition code storage device. On the other hand, question information for dictionary lookup is similarly superimposed encoded. The search device collates the data stored in the superposition code storage device using the superposition code of the question information, and obtains a search result called a drop, which is a candidate for the correct search result for the question information. A drop, which is a search result by a search device, always includes a set of starting information that is a correct search result for a question, but may also include incorrectly retrieved starting information called 7 orsdrops. In order to remove false drops from the drops, the collation device collates the question with the starting information in the dictionary information storage device indicated by the drop. Then, the correct search results are displayed on the output device.

EXAMPLES Hereinafter, the present invention will be explained in more detail based on the drawings.

FIG. 1 shows a conceptual diagram of a dictionary lookup device according to an embodiment of the present invention. The natural language edict information stored in the dictionary information storage device 1 in advance is processed by the superposition code creation device 2.
The dictionary superposition code is stored in the superposition code storage device 3, and the question given to the input device 4 is sent to the question processing device 5.
A question superimposition code is created by a superimposition code creation device 2, a search device 6 collates this question superimposition code with a dictionary superimposition code, and a collation device 7 compares the start-of-day information and the question represented by the search results. The output device 8 outputs starting information, which is the correct dictionary lookup result for the question.
Displayed by

FIG. 2 shows the configuration of the superposition code creation device 2. As shown in FIG. The natural language starting information from the dictionary information storage device 1 is given to the bcw creation device 21 of the superposition code creation device 2. The starting information R has one or more keywords, number Ri. For example, the word ``Japan'' is ``Japan'' as a keyword,
It has two keywords: "proper noun". bcw
In the creation device 21, one or more input keywords 1
For each one, some bits of b bits are “l”
A bit string of length b called bcW (binary code word) is created using a no-nosh function that sets 0 and the rest are 0. In the illustrated example, the keyword "Japan J" is 01010100. The keyword "proper noun" is 0.
An 8-bit bit string of 0011010 is created. bc
The w superimposition device n creates a bit string 5 (Ri) of length b by ORing these Ri bcw bit by bit as a dictionary superimposition code of the starting information Ri. In the illustrated example, the dictionary superimposition code is 010111 for "Japan" at the beginning of the school day.
10 is created. This operation is performed for all the start-of-day information in the dictionary information storage device 1, and a dictionary superimposition code is created for each start-of-day information. The F dictionary superposition codes thus created are stored in the superposition code storage device 3 as b bit strings of length F, as explained in FIG. Here, F is the number of pieces of edict information in the dictionary information storage device 1. Note that by determining b, the size of the superposition code can be freely designed.

FIG. 3 shows how F dictionary superposition codes created by the superposition code creation device 2 are stored in the superposition code storage device 3. As described above, the superposition code creation device 2 creates superposition codes for the F words stored in the dictionary information storage device 1. In the example shown in Figure 3, there are three
01011110.1101 for each starting day.
An example is shown in which three superposition codes of 1010.11011110 are created. When these F superposition codes are stored in the superposition code storage device 3, they are stored as bit strings whose vertical and horizontal directions have been converted. That is, as shown in FIG. 3, the superposition code outputted from the bcw superposition device n is stored in the superposition code storage device 3 in a form in which the vertical and horizontal directions have been converted. In this way, the superposition code of F and b bit strings created by the superposition code creation device 2 is stored in the superposition code storage device 3 of b and F bit strings.
It is stored as a bit string, that is, a superposed signal of rows B and columns F. In this case, the edicts ■, ■, ■ will be stored as vertical column information.

On the other hand, questions given from the input device 4 are also superposition encoded in the same way. This situation will be explained with reference to FIG. Now, let us consider a case where the command ``Look up the proper noun Japan in a dictionary'' is input to the input device 4.

A question obtained from an input device 4 is broken down into one or more keywords by a question processing device 5. In the case of the above directive, it is broken down into two keywords: "proper noun" and "Japan". Regarding these keywords, the same as in the case of creating and storing dictionary superposition codes/- Using the superposition code creation device 2 using the Sosch function, that is, using the bcw creation device 21, as bcw, "proper noun; 0OOIIOIOJ, “Japan; 01010100J was created, then bcw
The superposition device 2 generates a query superposition code rQ;0IOI
IIIOJ is created. The question is thus superposition coded.

This query superposition code Q is supplied to the search device 6. The search device 6 compares the query superposition code with the data in the superposition code storage device to obtain a search result called a drop. That is, the bit position i where "1" is set in the query superposition code (position "t'% in the illustrated example)
Drops can be easily determined by performing a bit-by-bit logical product on the bit string of the first row of stored data in the superposition code storage device 3 corresponding to 0% dX e).

The edict information corresponding to the bit j in which "1" is set in the bit string that is the result of this logical product is the search result in the search device 6. In the illustrated example, opening hours ■ and ■ are obtained as search results. The drop, which is the search result by the search device 6, always includes edict information that is the correct search result for the question, but it may also include edict information that was incorrectly searched, called a false drop. Eliminate false drops. This operation will be explained with reference to FIG. The collation device 7 receives the search result from the search device 6, that is, “1” in the drop.
The imperial edict information in the dictionary information storage device 1 indicated by the bit that is set, in the illustrated example, the two words of ``Japanese'' and ■British are compared with the question Q, and those that match are 0 Japanese in the illustrated example. is output and displayed on the output device 8 as a correct search result.

Effects of the Invention As described above, the present invention superimposes the edict information in the dictionary information storage device, stores it in the superposition code storage device, and represents the contents of the dictionary information storage device stored in the superposition code storage device. A partial matching search is performed between the dictionary superimposition code and the query superimposition code whose keywords have been converted by the query processing device, and the dictionary information represented by the search result is compared with the keyword. The data contained therein is much smaller than the transposed file in a conventional dictionary lookup device, and maintenance is easy. Furthermore, since the size of data in the superposition code storage device can be changed freely, a dictionary lookup function can be provided to natural language processing devices on various electronic computers.

Furthermore, since processing is performed using superimposed codes, it is possible to search for drops at high speed almost regardless of the number of starting operations of the dictionary information storage device.

[Brief explanation of the drawing]

FIG. 1 is a block diagram showing the concept of a dictionary lookup device in an embodiment of the present invention, FIG. 2 is a block diagram showing the concept of a superposition code creation section in the configuration of FIG. 1, and FIG.
FIG. 4 is a block diagram showing the concept of the superposition code storage part in the configuration shown in the figure. FIG. 4 is a block diagram showing the concept of the search unit in the configuration shown in FIG. 1. FIG. FIG. l... Dictionary information storage device, 2... Superposition code creation device, 3... Superposition code storage device, 4... Input device, 5... Question processing device, 6... Search device ,7...
- Collation device, 8... Output device, 21... bcw creation device, n... bcw superposition device. Name of agent: Patent attorney Shigetaka Awano and one other person Figure 2

Claims (2)

[Claims] (1) A dictionary information storage device that stores natural language vocabulary information, an input device that inputs questions for dictionary lookup, and converts each keyword into a superposition code after encoding each keyword for each of the vocabulary information and questions. a search device that performs partial matching between the superposition code of vocabulary information and the superposition code of the question; and a matching device that matches the keywords of the question with the vocabulary information corresponding to the search results of the search device. A dictionary lookup device characterized by comprising: (2) Claim 1, further comprising a superimposition code storage device for vertically and horizontally converting superimposed codes of vocabulary information and storing the superimposed codes, and partially collating the superimposed codes stored in the superimposed code storage device with the superimposed codes of questions. Dictionary lookup device described.