Search (4 results, page 1 of 1)

0.06976585 = product of:
  0.20929754 = sum of:
    0.09268724 = weight(_text_:computer in 478) [ClassicSimilarity], result of:
      0.09268724 = score(doc=478,freq=4.0), product of:
        0.16231956 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.044416238 = queryNorm
        0.5710171 = fieldWeight in 478, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.078125 = fieldNorm(doc=478)
    0.11661029 = product of:
      0.23322058 = sum of:
        0.23322058 = weight(_text_:programs in 478) [ClassicSimilarity], result of:
          0.23322058 = score(doc=478,freq=4.0), product of:
            0.25748047 = queryWeight, product of:
              5.79699 = idf(docFreq=364, maxDocs=44218)
              0.044416238 = queryNorm
            0.90577966 = fieldWeight in 478, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.79699 = idf(docFreq=364, maxDocs=44218)
              0.078125 = fieldNorm(doc=478)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

LCSH

Indexing / Computer programs / Evaluation

Subject

Indexing / Computer programs / Evaluation

0.04086674 = product of:
  0.12260021 = sum of:
    0.06488107 = weight(_text_:computer in 652) [ClassicSimilarity], result of:
      0.06488107 = score(doc=652,freq=4.0), product of:
        0.16231956 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.044416238 = queryNorm
        0.39971197 = fieldWeight in 652, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.0546875 = fieldNorm(doc=652)
    0.057719145 = product of:
      0.11543829 = sum of:
        0.11543829 = weight(_text_:programs in 652) [ClassicSimilarity], result of:
          0.11543829 = score(doc=652,freq=2.0), product of:
            0.25748047 = queryWeight, product of:
              5.79699 = idf(docFreq=364, maxDocs=44218)
              0.044416238 = queryNorm
            0.44833803 = fieldWeight in 652, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.79699 = idf(docFreq=364, maxDocs=44218)
              0.0546875 = fieldNorm(doc=652)
      0.5 = coord(1/2)
  0.33333334 = coord(2/6)

Abstract

The index to the second edition of The Canadian Encyclopedia was prepared on an IBM PC-XT personal computer using the IBM Professional Editor, custom programs written in IBM Pascal, and TeX a high quality typesetting program developed by Donald E. Knuth of Stanford University in California. The entries were chosen and keyed in by the indexer, and then alphabetized, formatted, and typeset by the computer. An unusual data entry format together with good typesetting software made possible the delivery to the printer of the 372 page camera ready index less than two weeks after the indexer received the final pages of text. TeX provides fully automatic pagination.

0.008738637 = product of:
  0.05243182 = sum of:
    0.05243182 = weight(_text_:computer in 653) [ClassicSimilarity], result of:
      0.05243182 = score(doc=653,freq=2.0), product of:
        0.16231956 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.044416238 = queryNorm
        0.32301605 = fieldWeight in 653, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.0625 = fieldNorm(doc=653)
  0.16666667 = coord(1/6)

Abstract

NEPHIS, Craven's Nested Phrase Indexing System, transfers one more indexing procedure, the creation of individual index entries, to computer algorithm, permitting the human indexer to concentrate on the intellectual task of analyzing text and naming its important features. Experience at Rutgers University has shown that novice indexers can learn NEPHIS quite quickly and can use it to produce acceptable indexes

0.007646307 = product of:
  0.04587784 = sum of:
    0.04587784 = weight(_text_:computer in 3638) [ClassicSimilarity], result of:
      0.04587784 = score(doc=3638,freq=8.0), product of:
        0.16231956 = queryWeight, product of:
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.044416238 = queryNorm
        0.28263903 = fieldWeight in 3638, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          3.6545093 = idf(docFreq=3109, maxDocs=44218)
          0.02734375 = fieldNorm(doc=3638)
  0.16666667 = coord(1/6)

Abstract

In the optimistic 1960s the potential of the computer seemed limitless. The realization of this potential in the area of information retrieval and dissemination owes much to the creative mind of Hans Peter Luhn. A pioneer of information science, he had a mind and an imagination that could transcend the state of the art. Luhn was born in Germany, where he studied technology, physics, and accounting. He came to the United States in 1924 and in 1941, at the age of 45, he joined IBM. In the course of his twenty-year tenure at IBM, he was issued over eighty patents; at one time he held more than any other IBM employee. Luhn is credited with originating KWIC indexes, computer selective dissemination systems (SDI), computer coding schemes, and statistical techniques for automatic indexing and abstracting. Also attributed to him is the first modern use of the word "thesaurus." The selection that follows modestly presents the idea of a Keyword in Context (KWIC) index. This is the idea of automatically identifying significant or "key" words and highlighting them in context. The context in question was normally a title. Though title term or catchword indexing had been practiced for over one hundred years, the implementation of the idea in mechanized systems in the 1960s was not trivial. It required programming the computer to recognize word boundaries and then developing a means for automatically differentiating significant from nonsignificant words. Spaces were used to demarcate word boundaries and a stop list, consisting of articles, conjunctions, prepositions, auxiliary verbs, some adjectives, and some very common words, was used to differentiate significant from nonsignificant words. A difficulty with any automatic indexing limited to extracting single words from texts is the semantic indeterminancy of the extracted character strings. To disambiguate these, Luhn adopted the concordance idea, proposing to display them in the context of their titles. Specifying the meaning of an index term by couching it in "context," anticipated the later development of string index languages such as PRECIS (PREserved Context Index System). Although the selection that follows is quite short, it presents, in addition to the idea of KWIC, what at the time were two innovative ideas. One is the distinction between the dissemination and the retrieval of information, in regard to which Luhn makes a point sometimes overlooked by modern critics of KWIC. This is that different purposes require different kinds of indexes; an index that is used to disseminate information for current awareness need not be as "perfect" as one used for retrospective information retrieval. The need to alert researchers to current information quickly, and the somewhat transitory character of this information, make KWIC, albeit quick and dirty, a costeffective alternative for dissemination indexes. The second harbinger idea is a method of uniquely identifying documents for retrieval using an identification code comprising the initial characters from a document's author, title, and - interestingly - year of publication. Luhn's mind was fertile indeed and he is aptly called a pioneer of information science.