JPH05120351A - System for making dictionary of synonym - Google Patents

Abstract

PURPOSE:To keep synonym in small memory areas and to easily register new words by constructing a graph without directive closed circuit with directive branches based on the relation including the concept represented by words added between words and taking words whose distance from one word in the graph less than the constant value as a synonym. CONSTITUTION:Words W1 to Wn are connected with directive branches e1, e2, to em based on the relation including the concept represented by each word, comprising a graph without directive closed circuit. For example, when a word whose path length on the graph, that is, the distance between words is less than two is defined as a synonym, the synonym of the W2 is W1, W3, W4, W5, and Wn. In this case, when a new word Wn+1 is added to the W5 by the directive branch em+1, similarly the W2, W3, and W5 are registered as synonyms.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a synonym dictionary construction system used in an information retrieval system.

[0002]

2. Description of the Related Art A conventional synonym dictionary construction method is shown in FIG.
As shown in (a), words W1, W2, ..., Wn are arranged to connect synonyms to each other by lines S1, S2, ..., Sm, or as shown in FIG. 3 (b), words W1, W2.
2, ..., Wn are synonym lists r1, r2 ,.
I was holding an rn.

[0003]

The conventional synonym dictionary construction method described above requires a large amount of memory area, and the registration of a new word imposes a heavy load on the correction of existing data. Further, there is a drawback in that it is not possible to express a relationship in which the concept represented by one of the two synonyms includes that of the other.

An object of the present invention is to provide a synonym dictionary construction system which holds synonyms in a small memory area, facilitates the registration of new words, and expresses the inclusion relation of concepts represented by words.

[0005]

According to the synonym dictionary construction method of the present invention, a directional branch based on the inclusion relation of concepts represented by words is added between words to form a graph having no directional cycle. All the words whose distance from one word is less than a certain value are considered as synonyms.

[0006]

According to the present invention, the inclusion relation of concepts represented by words can be explicitly treated. Further, since it is not necessary to connect one word and all its synonyms with a line, the memory area can be reduced. Further, the registration of a new word can be realized by arranging the word at an appropriate position in the graph and adding a directional branch, and the load of modifying the existing data is small.

[0007]

Embodiments of the present invention will now be described with reference to the drawings.

FIG. 1 is a conceptual diagram showing an embodiment of the present invention. The words W1, W2, ..., Wn are directional branches e1, e2, ..., Em based on the inclusion relation of the concept expressed by each word.
Form a graph with no directed cycles connected by. As an example, if the distance between words is defined as the length of a path on the graph, that is, a word having a distance between words of 2 or less is defined as a synonym, the synonym of W2 in FIG.
1, W3, W4, W5, Wn.

FIG. 2 is an explanatory diagram showing an example of new word registration in the synonym dictionary shown in FIG. The new word Wn + 1 was added to W5 by the directed branch em + 1, but at the same time, W2, W3, and W5 were registered as synonyms according to the above definition.

[0010]

As described above, according to the present invention, a directional branch based on the inclusion relation of concepts represented by words is added between words to form a graph having no directional cycle. Words that are less than a certain value are regarded as synonyms, so it is possible to explicitly handle the inclusion relations of the concepts represented by the words, the memory area is small, and a synonym dictionary that reduces the load on existing data when registering new words is constructed. There is an effect that you can.

[Brief description of drawings]

FIG. 1 is a conceptual diagram showing an embodiment of a synonym dictionary construction system of the present invention.

FIG. 2 is a conceptual diagram showing an example of new word registration in the synonym dictionary shown in FIG.

FIG. 3 is an explanatory diagram showing an example of a conventional synonym dictionary construction method.

[Explanation of symbols]

W1, W2, ..., Wn, Wn + 1 words e1, e2, ..., em, em + 1 Directed branch added between words S1, S2, ... list

Claims (1)

[Claims] 1. A graph having no directed cycle is constructed by adding directional branches based on the inclusion relation of concepts expressed by words between words, and the distance from one word in the graph is a certain value or less. Is a synonym dictionary construction method in which all the words are regarded as synonyms.