Search (2 results, page 1 of 1)

  • × author_ss:"Diaz, I."
  • × language_ss:"e"
  1. Diaz, I.: Semi-automatic construction of thesaurus applying domain analysis techniques (1998) 0.00 
    0.0024217735 = product of:
  0.018163301 = sum of:
    0.012581941 = weight(_text_:und in 3744) [ClassicSimilarity], result of:
      0.012581941 = score(doc=3744,freq=2.0), product of:
        0.06422601 = queryWeight, product of:
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.028978055 = queryNorm
        0.19590102 = fieldWeight in 3744, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          2.216367 = idf(docFreq=13101, maxDocs=44218)
          0.0625 = fieldNorm(doc=3744)
    0.0055813594 = product of:
      0.011162719 = sum of:
        0.011162719 = weight(_text_:information in 3744) [ClassicSimilarity], result of:
          0.011162719 = score(doc=3744,freq=4.0), product of:
            0.050870337 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.028978055 = queryNorm
            0.21943474 = fieldWeight in 3744, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0625 = fieldNorm(doc=3744)
      0.5 = coord(1/2)
  0.13333334 = coord(2/15)
    Abstract
    Describes a specific application of domain analysis to the construction of thesauri to exploit domain analysis' ability to construct valid domain representations and determine fuzzy limits that normally define specific domains. The system employs a structure, called a Software Thesaurus (developed from a descriptor thesaurus), as a repository to store the information regarding specific domains. The domain representation is constructued semi automatically and can be used as a means of semiautomatic thesaurus generation
    Source
    International forum on information and documentation. 23(1998) no.2, S.11-19
    Theme
    Konzeption und Anwendung des Prinzips Thesaurus
  2. Diaz, I.; Morato, J.; Lioréns, J.: ¬An algorithm for term conflation based on tree structures (2002) 0.00 
    3.7209064E-4 = product of:
  0.0055813594 = sum of:
    0.0055813594 = product of:
      0.011162719 = sum of:
        0.011162719 = weight(_text_:information in 246) [ClassicSimilarity], result of:
          0.011162719 = score(doc=246,freq=4.0), product of:
            0.050870337 = queryWeight, product of:
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.028978055 = queryNorm
            0.21943474 = fieldWeight in 246, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.7554779 = idf(docFreq=20772, maxDocs=44218)
              0.0625 = fieldNorm(doc=246)
      0.5 = coord(1/2)
  0.06666667 = coord(1/15)
    Abstract
    This work presents a new stemming algorithm. This algorithm stores the stemming information in tree structures. This storage allows us to enhance the performance of the algorithm due to the reduction of the search space and the overall complexity. The final result of that stemming algorithm is a normalized concept, understanding this process as the automatic extraction of the generic form (or a lexeme) for a selected term.
    Source
    Journal of the American Society for Information Science and technology. 53(2002) no.3, S.199-208

Authors

Years

Themes