JPH0531788B2 - - Google Patents

Description

[Detailed description of the invention]

(Field of Industrial Application) The present invention is based on the many-to-many correspondence between morphological information and words and their corresponding information, and the many-to-many correspondence between words and grammatical information and semantic information in a word dictionary. ,3
The present invention relates to an electronic dictionary that avoids duplication of dictionary contents by dividing information into different dictionaries, and that allows one dictionary to be specified and other dictionaries to be searched. (Prior art and its problems) Conventional electronic dictionaries use conjugated forms and base forms (or stems) as headwords, and the contents of each dictionary entry include notation, morphological information, grammatical information, part-of-speech information, and meaning. information, etc., and the contents of all of them are 1
It was under one heading. However, there is a correspondence as shown in Table 1 between morphological information such as notation and grammatical information.

[Table] For example, if we consider the word "bite" as its original form,
Bite has two surface forms: ``bite, bit, bit'' and ``bite, bit, bitlen''.
This shows a two-to-many relationship between the original form "bite" and the surface form. Conversely, the superficial form ``bit'' corresponds to both the words ``bit'' and ``bite.'' This indicates that there is multi-word correspondence for one form. Therefore, there is a many-to-many relationship between surface forms and words. There is also a similar many-to-many relationship between words and meanings. For example, "Festival" and "Fair" have the meaning "BAZAR," and conversely, the word "fair" has the meanings "BAZR" and "JUST" (fair and fair). Normally, in order to store this combination, a dictionary entry structure as shown in Table 2 is adopted. Table 2 Usual dictionary structure Word Meaning bit bit BIT SMALL bit bite BITE bitten bite BITE festivals festival BAZAR fairs fair BAZAR fair fair BAZAR JUST Just just JUST In Table 2, the headings are either the form or the word, and the meaning Because the words "festival", "fair" and "bazar" appear under different entries many times even though they have a common meaning "BAZAR". It has drawbacks such as redundant descriptions. As a result, the amount of description increases (that is, the required storage capacity increases), but despite this, only surface forms and word forms can be used as headings, making it difficult to search based on meaning. (Objective of the Invention) The object of the present invention is to eliminate the above-mentioned drawbacks, specify one of the meaning, form (surface notation), and word base form (notation) without increasing the amount of description, and flexibly handle other information. The aim is to provide an electronic dictionary that can be searched. (Structure of the Invention) According to the present invention, a morphological item having one or more morphological information and a word heading corresponding to a morphological heading, syntactic part-of-speech information corresponding to a word heading, and a word heading corresponding to the word or dictionary storage means for storing a word item having a plurality of form headings and a plurality of meaning headings, and a meaning item having semantic information and the meaning heading corresponding to the meaning heading; and a symbol indicating the type of the item and the heading. There is obtained an electronic dictionary characterized in that it comprises at least a dictionary search means for generating a search heading corresponding to the entered heading and supplying it to the dictionary storage means. (Embodiment) Next, one embodiment of the present invention will be described with reference to the drawings. In Figure 1, 1 is a dictionary search and management means;
2, when a search dictionary entry (heading) is input through an input line 4, which is a dictionary storage means, the dictionary search management means 1 searches the dictionary storage means 2 through a data/control line 3 for contents corresponding to the search dictionary entry. Output via data line 4. This dictionary search means can be easily constructed using the usual B-tree method. This B-tree method is reviewed in a paper published by Miyagawa and Yumiba entitled "Technology for index search in computers" in the August 1975 issue of the Journal of the Institute of Electrical Engineers of Japan, pages 11 to 18. I will only give a brief explanation. That is, according to the B-tree method, it is possible to construct a search means that uses a morpheme, meaning notation, and word notation as a search index for identifying one of the dictionary items. In FIG. 1, the record contents in the dictionary storage means 2 will be explained with reference to FIG. 2. One dictionary entry is a variable length record, and the first field divided into two fields includes headwords (Mbit, Gbite, SBITE) such as 212, 222, 232 and contents in the figure. The heading is a search key index of the search means such as the B-tree method. The second field stores each previous pointer (a set of headwords in the first field of each dictionary entry record). Current dictionary storage means 2
The content inside is divided into three types: the first type 21 has an "M" (the first letter of morphological) at the beginning of the headword, and the second type 22 has a "G" (the first letter of grammatical) at the beginning of the headword. )including. Third
Species 23 includes "S" (the first character of semantics) at the beginning of the heading. This allows different dictionaries to be integrated into the same physical dictionary and allows searches across dictionaries with different contents. FIGS. 3A and 3B are flowcharts illustrating the operation of the dictionary search means 1. In A of the same figure, a search designation is read A1. The search specification is notation (one of form, word, meaning notation) Y(YC({M,G,
S, }−{Z})). In heading generation A2,
A B-tree search index ZX is generated from and Z, and it is set as {INDEXj} (INDEXj=ZX). In search function call A3, each of {INDEXj}
Apply RETRIEVE function B to INDEXj. In RETRIEVE function B, record search B1
Perform as follows. INDEXj calculates the address of the dictionary item record by B-tree {Addressk}, sends {Addressk} to the dictionary storage means 2, receives the record {R _k } as a reply, and outputs {R _k }. If {R _k } is empty, then
The RETRIEVE function stops B3. In search heading generation B2, search the second field of {R _k } for a headword whose first character is the element of Y, set it as {INDEXj}, and create a character set by removing the first character of {INDEXj} from Y. Let's say Y again. At this time, if {INDEXj} is empty, stop B4. In this embodiment, a search means is prepared for each entry word with the first character M, G, and S, and three types of dictionaries are allocated to independent files, so that the dictionary contents and search key index can be determined by the beginning of the entry word. Similar searches can be performed without distinction. Further, in the dictionary search means 1, the second
Other dictionaries can be searched by the dictionary search means based on the field. In this case, by using the physical address of the key index in the search means for the headword instead of the dictionary headword as the second field, a high-speed dictionary search means can be obtained. (Effects of the Invention) According to the present invention, three types of information regarding words (surface form information, grammatical part of speech information, and meaning/concept information) are stored and retained separately, and pointers are placed between different types of information that correspond to each other. 1 of the information
By specifying one, you can search for other related dictionary contents, and in various information,
By holding items with the same content in one record, an electronic dictionary that can avoid data duplication can be obtained.

[Brief explanation of the drawing]

FIG. 1 is a diagram for explaining one embodiment of the present invention, FIG. 2 is a diagram for explaining the record format of the dictionary storage means, and FIGS. 3A and B are diagrams for explaining the operation of the dictionary retrieval means. This is a diagram. In the figure, 1 is a dictionary search means, and 2 is a dictionary storage means.

Claims (1)

[Claims] 1. A morphological item having one or more morphological information and a word heading corresponding to a morphological heading, and a word item having syntactic part-of-speech information corresponding to a word heading, and a morphological heading and a meaning heading corresponding to the word. dictionary storage means for protecting meaning items having semantic information and word headings for the meanings corresponding to the meaning headings; and a dictionary storing means for protecting meaning items having semantic information and word headings for the meanings; 1. An electronic dictionary comprising at least a dictionary search means supplied to a dictionary storage means.