Correa, C.A.; Kobashi, N.Y.: ¬A hybrid model of automatic indexing based on paraconsitent logic
0.01
0.009683615 = product of:
0.04841807 = sum of:
0.04841807 = weight(_text_:context in 3537) [ClassicSimilarity], result of:
0.04841807 = score(doc=3537,freq=2.0), product of:
0.17622331 = queryWeight, product of:
4.14465 = idf(docFreq=1904, maxDocs=44218)
0.04251826 = queryNorm
0.27475408 = fieldWeight in 3537, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.14465 = idf(docFreq=1904, maxDocs=44218)
0.046875 = fieldNorm(doc=3537)
0.2 = coord(1/5)
- Abstract
- In the processes of information organization, information retrieval and information visualization one point in common can be found: they are strongly connected by the procedures associated to the indexing of texts or documents. Indexing is an essential component of text analysis, and the indexing process have equal importance both for retrieval and for the visualization of information. In this context, it is worth mentioning the solutions that use automatic indexing. The researches that proposes solutions for automatic indexing are based on different theoretical assumptions such as: statistics, linguistics and controlled vocabulary (Leiva 1999). Most solutions developed hybrid models combining these theoretical assumptions. Other solutions to the problem of automatic indexing are based on theories that allow the treatment of uncertainty, imprecision and vagueness. The aim of this paper is to argue the theoretical potential for use in hybrid models of automatic indexing, the paraconsistent logic, a non-classical logic, with capacity to handle situations that involve uncertainty, imprecision and vagueness.
