Relational Data Model in Document Hierarchical Indexing

Authors:
Alexander F. Gelbukh;Grigori Sidorov;Adolfo Guzmán-Arenas
Affiliations:
-;-;-
Venue:
PorTAL '02 Proceedings of the Third International Conference on Advances in Natural Language Processing
Year:
2002

Citing 3
Cited 0

Modern Information Retrieval

Modern Information Retrieval
Use of a Weighted Topic Hierarchy for Document Classification

TSD '99 Proceedings of the Second International Workshop on Text, Speech and Dialogue
Lazy Query Enrichment: A Method for Indexing Large Specialized Document Bases with Morphology and Concept Hierarchy

DEXA '00 Proceedings of the 11th International Conference on Database and Expert Systems Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.