Advances in Natural Language Processing pp 259-262
Relational Data Model in Document Hierarchical Indexing
- First Online:
- Cite this paper as:
- Gelbukh A., Sidorov G., Guzmán-Arenas A. (2002) Relational Data Model in Document Hierarchical Indexing. In: Ranchhod E., Mamede N.J. (eds) Advances in Natural Language Processing. Lecture Notes in Computer Science, vol 2389. Springer, Berlin, Heidelberg
One of the problems of the development of document indexing and retrieval applications is the usage of hierarchies. In this paper we describe a method of automatic hierarchical indexing using the traditional relational data model. The main idea is to assign continuous numbers to the words (grammatical forms of the words) that characterize the nodes in the hierarchy (concept tree). One of the advantages of the proposed scheme is its simplicity. The system that implements such indexing scheme is described.
Unable to display preview. Download preview PDF.