Search (4 results, page 1 of 1)

  • × author_ss:"Eastman, C.M."
  • × year_i:[1990 TO 2000}
  1. Nakkouzi, Z.S.; Eastman, C.M.: Query formulation for handling negation in information retrieval systems (1990) 0.02
    0.018862877 = product of:
      0.037725754 = sum of:
        0.037725754 = product of:
          0.07545151 = sum of:
            0.07545151 = weight(_text_:systems in 3531) [ClassicSimilarity], result of:
              0.07545151 = score(doc=3531,freq=6.0), product of:
                0.16037072 = queryWeight, product of:
                  3.0731742 = idf(docFreq=5561, maxDocs=44218)
                  0.052184064 = queryNorm
                0.4704818 = fieldWeight in 3531, product of:
                  2.4494898 = tf(freq=6.0), with freq of:
                    6.0 = termFreq=6.0
                  3.0731742 = idf(docFreq=5561, maxDocs=44218)
                  0.0625 = fieldNorm(doc=3531)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    Queries containing negation are widely recognised as presenting problems for both users and systems. In information retrieval systems such problems usually manifest themselves in the use of the NOT operator. Describes an algorithm to transform Boolean queries with negated terms into queries without negation; the transformation process is based on the use of a hierarchical thesaurus. Examines a set of user requests submitted to the Thomas Cooper Library at the University of South Carolina to determine the pattern and frequency of use of negation.
  2. Kim, S.H.; Eastman, C.M.: ¬An experiment on node size in a hypermedia system (1999) 0.01
    0.012372886 = product of:
      0.024745772 = sum of:
        0.024745772 = product of:
          0.049491543 = sum of:
            0.049491543 = weight(_text_:22 in 3673) [ClassicSimilarity], result of:
              0.049491543 = score(doc=3673,freq=2.0), product of:
                0.1827397 = queryWeight, product of:
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.052184064 = queryNorm
                0.2708308 = fieldWeight in 3673, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.5018296 = idf(docFreq=3622, maxDocs=44218)
                  0.0546875 = fieldNorm(doc=3673)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Date
    22. 5.1999 9:35:20
  3. McQuire, A.R.; Eastman, C.M.: ¬The ambiguity of negation in natural language queries to information retrieval systems (1998) 0.01
    0.009625921 = product of:
      0.019251842 = sum of:
        0.019251842 = product of:
          0.038503684 = sum of:
            0.038503684 = weight(_text_:systems in 1147) [ClassicSimilarity], result of:
              0.038503684 = score(doc=1147,freq=4.0), product of:
                0.16037072 = queryWeight, product of:
                  3.0731742 = idf(docFreq=5561, maxDocs=44218)
                  0.052184064 = queryNorm
                0.24009174 = fieldWeight in 1147, product of:
                  2.0 = tf(freq=4.0), with freq of:
                    4.0 = termFreq=4.0
                  3.0731742 = idf(docFreq=5561, maxDocs=44218)
                  0.0390625 = fieldNorm(doc=1147)
          0.5 = coord(1/2)
      0.5 = coord(1/2)
    
    Abstract
    A prototype system to handle negation in natural language queries to information retrieval systems is presented. Whenever a query that has negation is entered, the system will determine whether or not it is necessary for the user to clarify exactly what constituents in the query are being negated. If clarification is needed, the user is presented with a list of choices and asked to select the appropriate one. The algorithm used is based on the results of a survey adminitered to 64 subjects. The subjects were given a number of queries using negation. For each query, several possible choices for the negated constituent(s) were given. Whenever a lexical unit composed of nouns connected by the conjunction 'and' was negated, there was general agreement on the response. But whenever there were multiple lexical units involved, such as complex lexical units connected by 'and' or prepositional phrases, the subjects were divided on the choices. The results of this survey indicate that it is not possible for a system to automatically disambiguate all uses of negotiation. However, it is possible for the user interface to handle disambiguation through a clarification dialog during which a user is asked to select from a list of possible interpretations
  4. Young, C.W.; Eastman, C.M.; Oakman, R.L.: ¬An analysis of ill-formed input in natural language queries to document retrieval systems (1991) 0.01
    0.008167865 = product of:
      0.01633573 = sum of:
        0.01633573 = product of:
          0.03267146 = sum of:
            0.03267146 = weight(_text_:systems in 5263) [ClassicSimilarity], result of:
              0.03267146 = score(doc=5263,freq=2.0), product of:
                0.16037072 = queryWeight, product of:
                  3.0731742 = idf(docFreq=5561, maxDocs=44218)
                  0.052184064 = queryNorm
                0.2037246 = fieldWeight in 5263, product of:
                  1.4142135 = tf(freq=2.0), with freq of:
                    2.0 = termFreq=2.0
                  3.0731742 = idf(docFreq=5561, maxDocs=44218)
                  0.046875 = fieldNorm(doc=5263)
          0.5 = coord(1/2)
      0.5 = coord(1/2)