Relational data model in document hierarchical indexing

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationAdvances in Natural Language Processing - 3rd International Conference, PorTAL 2002, Proceedings
EditorsElisabete Ranchhod, Nuno J. Mamede
PublisherSpringer Verlag
Pages259-262
Number of pages4
ISBN (Print)3540438297, 9783540438298
DOIs
StatePublished - 2002
Event3rd International Conference on Portugal for Natural Language Processing, PorTAL 2002 - Faro, Portugal
Duration: 23 Jun 200226 Jun 2002

Publication series

NameLecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)
Volume2389
ISSN (Print)0302-9743

Conference

Conference3rd International Conference on Portugal for Natural Language Processing, PorTAL 2002
Country/TerritoryPortugal
CityFaro
Period23/06/0226/06/02

Fingerprint

Dive into the research topics of 'Relational data model in document hierarchical indexing'. Together they form a unique fingerprint.

Cite this