A mathematical formulation of keyword compression for thesauri |
| |
| Authors: | Louis-Gavet Guy |
| |
| Institution: | Université de Lyon 1, Charge d''enseignement Universite Lyon I, Mas des Berlandieres, Pte de Beaurefaire, Balbims, 38-260 La Cote Standre, France |
| |
| Abstract: | In this paper we demonstrate a new method for concentrating the set of key-words of a thesaurus. This method is based on a mathematical study that we have carried out into the distribution of characters in a defined natural language.We have built a function f of concentration which generates only a few synonyms. In applying this function to the set of key-words of a thesaurus, we reduce each key-word to four characters without synonymity. (For three characters we have a rate of synonymity of approx. 1/1000th.)A new structure of binary files allows the thesaurus to be contained in a table of less than 700 bytes. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
