Search (16 results, page 1 of 1)

  • × author_ss:"Craven, T.C."
  1. Craven, T.C.: Use of a general graph drawing algorithm in the construction of association maps (1992) 0.01 
    0.008869919 = product of:
  0.026609756 = sum of:
    0.026609756 = weight(_text_:to in 4449) [ClassicSimilarity], result of:
      0.026609756 = score(doc=4449,freq=8.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.32138905 = fieldWeight in 4449, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=4449)
  0.33333334 = coord(1/3)
    Abstract
    Investigates a possible approach to the automatic generation of concept maps that might be useful to abstractors. The technique involves using stems as concept surrogates, cooccurrence to define concept links, and a general graph drawing algorithm to position the stems in 2 dimensions
  2. Craven, T.C.: 'DESCRIPTION' META tags in locally linked web pages (2001) 0.01 
    0.008869919 = product of:
  0.026609756 = sum of:
    0.026609756 = weight(_text_:to in 701) [ClassicSimilarity], result of:
      0.026609756 = score(doc=701,freq=8.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.32138905 = fieldWeight in 701, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=701)
  0.33333334 = coord(1/3)
    Abstract
    Advice given in printed and web-based sources on HTML META tags with NAME='DESCRIPTION' is surveyed.To determin patterns of relationships among descriptions on the same site,links were followed automatically from 460 pages registered withYahoo! and previously found to contain descriptions.Sites where the registered page pointed to many other pages were significantly less likely to reuse the same description on those other pages; where different descriptions were used words from the registered page's description tended to appear toward the beginnings of other descriptions.
  3. Craven, T.C.: Salient node notation (1979) 0.01 
    0.0077611795 = product of:
  0.023283537 = sum of:
    0.023283537 = weight(_text_:to in 1608) [ClassicSimilarity], result of:
      0.023283537 = score(doc=1608,freq=8.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.28121543 = fieldWeight in 1608, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1608)
  0.33333334 = coord(1/3)
    Abstract
    Salient node notation is a technique for decreasing the average length of notation in a classification scheme without sacrficing expressiveness or disturbing the succession of chracteristics of the filing order. Assignment of notation begins at a node of the classification tree other than the root. This salient node may be determined algorithmically, given data on the bias of the collection to be classified, even if only part of the tree has been developed. A dummy value is reserved to indicate upward movement in the tree. The technique is especially applicable to classification schemes for spevialized collections and to facets such as space in which the biases of human existence are especially prominent
  4. Craven, T.C.: Determining authorship of Web pages (2006) 0.01 
    0.0077611795 = product of:
  0.023283537 = sum of:
    0.023283537 = weight(_text_:to in 1498) [ClassicSimilarity], result of:
      0.023283537 = score(doc=1498,freq=8.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.28121543 = fieldWeight in 1498, product of:
          2.828427 = tf(freq=8.0), with freq of:
            8.0 = termFreq=8.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1498)
  0.33333334 = coord(1/3)
    Abstract
    Assignability of authors to Web pages using either normal browsing procedures or browsing assisted by simple automatic extraction was investigated. Candidate strings for 1000 pages were extracted automatically from title elements, meta-tags, and address-like and copyright-like passages; 539 of the pages produced at least one candidate: 310 candidates from titles, 66 from meta-tags, 91 from address-like passages, and 259 from copyright-like passages. An assistant attempted to identify personal authors for 943 pages by examining the pages themselves and related pages; this added 90 pages with authors to the pages from which no candidate strings were extracted. Specific problems are noted and some refinements to the extraction methods are suggested.
  5. Craven, T.C.: Three-dimensional displays of concept relation structures (1992) 0.01 
    0.0076815756 = product of:
  0.023044726 = sum of:
    0.023044726 = weight(_text_:to in 2534) [ClassicSimilarity], result of:
      0.023044726 = score(doc=2534,freq=6.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.2783311 = fieldWeight in 2534, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=2534)
  0.33333334 = coord(1/3)
    Abstract
    Special reference is made to the possible use of automatically generated displays as an aid to abstracters. Some advantages of three-diemnsional displays are outlined with experimental results conforming their reduced distortion of concept space. Features that may set three-dimensional representations of concepts space off from other kinds of three dimensional representations are noted. Features of a prototype system operating on a microcomputer with VGA display are described and illustrated
    Source
    Library science with a slant to documentation. 29(1992) no.1, S.1-14
  6. Craven, T.C.: Adapting of string indexing systems for retrieval using proximity operators (1988) 0.01 
    0.00627198 = product of:
  0.018815938 = sum of:
    0.018815938 = weight(_text_:to in 705) [ClassicSimilarity], result of:
      0.018815938 = score(doc=705,freq=4.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.22725637 = fieldWeight in 705, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=705)
  0.33333334 = coord(1/3)
    Abstract
    This article explores the idea of using a conventional string indexing source description, together with a special phrase generator, to generate multiple descriptor phrases for inclusion in a database record for online retrieval. For use with proximity operators, these multiple descriptor phrases should attempt to meet such objectives as bringing together groups of syntactically related words. Software for generating multiple descriptor phrases from source descriptions in a specific existing string indexing system is briefly described
  7. Craven, T.C.: Concept relation structures and their graphic display (1992) 0.01 
    0.00627198 = product of:
  0.018815938 = sum of:
    0.018815938 = weight(_text_:to in 2090) [ClassicSimilarity], result of:
      0.018815938 = score(doc=2090,freq=4.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.22725637 = fieldWeight in 2090, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=2090)
  0.33333334 = coord(1/3)
    Abstract
    Ideas on computerized graphic displays of concept networks are surveyed, with reference to both recent and early research. While the emphasis is on syntactic and semantic relations and on indexing and information retrieval applications, attention is also paid to related areas
  8. Craven, T.C.: ¬An experiment in the use of tools for computer-assisted abstracting (1996) 0.01 
    0.005761182 = product of:
  0.017283546 = sum of:
    0.017283546 = weight(_text_:to in 7426) [ClassicSimilarity], result of:
      0.017283546 = score(doc=7426,freq=6.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.20874833 = fieldWeight in 7426, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=7426)
  0.33333334 = coord(1/3)
    Abstract
    Experimental subjects wrote abstracts of an article using a simplified version of the TEXNET abstracting assistance software. In addition to the fulltext, the 35 subjects were presented with either keywords or phrases extracted automatically. The resulting abstracts, and the times taken, were recorded automatically; some additional information was gathered by oral questionnaire. Results showed considerable variation among subjects, but 37% found the keywords or phrases quite or very useful in writing their abstracts. Statistical analysis failed to support deveral hypothesised relations; phrases were not viewed as significantly more helpful than keywords; and abstracting experience did not correlate with originality of wording, approximation of the author abstract, or greater conciseness. Results also suggested possible modifications to the software
  9. Craven, T.C.: Abstracts produced using computer assistance (2000) 0.01 
    0.005761182 = product of:
  0.017283546 = sum of:
    0.017283546 = weight(_text_:to in 4809) [ClassicSimilarity], result of:
      0.017283546 = score(doc=4809,freq=6.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.20874833 = fieldWeight in 4809, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.046875 = fieldNorm(doc=4809)
  0.33333334 = coord(1/3)
    Abstract
    Experimental subjects wrote abstracts using a simplified version of the TEXNET abstracting assistance software. In addition to the full text, subjects were presented with either keywords or phrases extracted automatically. The resulting abstracts, and the times taken, were recorded automatically; some additional information was gathered by oral questionnaire. Selected abstracts produced were evaluated on various criteria by independent raters. Results showed considerable variation among subjects, but 37% found the keywords or phrases 'quite' or 'very' useful in writing their abstracts. Statistical analysis failed to support several hypothesized relations: phrases were not viewed as significantly more helpful than keywords; and abstracting experience did not correlate with originality of wording, approximation of the author abstract, or greater conciseness. Requiring further study are some unanticipated strong correlations including the following: Windows experience and writing an abstract like the author's; experience reading abstracts and thinking one had written a good abstract; gender and abstract length; gender and use of words and phrases from the original text. Results have also suggested possible modifications to the TEXNET software
  10. Craven, T.C.: ¬An online index entry format based on multiple search terms (1987) 0.01 
    0.0055436995 = product of:
  0.016631098 = sum of:
    0.016631098 = weight(_text_:to in 438) [ClassicSimilarity], result of:
      0.016631098 = score(doc=438,freq=2.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.20086816 = fieldWeight in 438, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.078125 = fieldNorm(doc=438)
  0.33333334 = coord(1/3)
    Abstract
    A new approach to generate string index entries from concept networks is discussed: terms from multi-term search specifications are cited near the beginning of the entry, while an articulated entry structure indicative of concept relations is retained.
  11. Craven, T.C.: Customized extracts based on Boolean queries and sentence dependency structures (1989) 0.00 
    0.0044349595 = product of:
  0.013304878 = sum of:
    0.013304878 = weight(_text_:to in 789) [ClassicSimilarity], result of:
      0.013304878 = score(doc=789,freq=2.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.16069452 = fieldWeight in 789, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=789)
  0.33333334 = coord(1/3)
    Abstract
    A method is described for using Boolean queries in automatically deriving customized extracts from a text in which semantic dependencies between sentences have been coded. Each sentence in the structured text is treated as defining a separate extract. This extract consists of the sentence and all other sentences on which the sentence is directly or indirectly dependent for its meaning. Extracts from a text that satisfy a given Boolean query are merged to eliminate duplicate sentences. A prototype implementation of the method has been developed within an experimental text structure management system (TEXNET)
  12. Craven, T.C.: Condensed representation of sentences in graphic displays of text structures (1990) 0.00 
    0.0044349595 = product of:
  0.013304878 = sum of:
    0.013304878 = weight(_text_:to in 3870) [ClassicSimilarity], result of:
      0.013304878 = score(doc=3870,freq=2.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.16069452 = fieldWeight in 3870, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=3870)
  0.33333334 = coord(1/3)
    Abstract
    This article ic concerned with how sentences may be represented briefly but informatively in graphic desplays of a sentence dependence structure. Different automatic abbreviation schemes were assessed on a sample data set for compression and ambiguity. 'Speedwriting' of words longer than five letters yielded a compression to 80% of the source text, with very low ambiguitiy. This and two other automatic notemaking-like techniques have been implemented as options in the TEXNET text structure management system
  13. Craven, T.C.: Automatic structure modification in the graphic display of thesauri (1990) 0.00 
    0.0044349595 = product of:
  0.013304878 = sum of:
    0.013304878 = weight(_text_:to in 4793) [ClassicSimilarity], result of:
      0.013304878 = score(doc=4793,freq=2.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.16069452 = fieldWeight in 4793, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=4793)
  0.33333334 = coord(1/3)
    Abstract
    2 automatic techniques for modifying the structure of the thesaurus are described: automatic structure simplifications, and automatic addition of dummy terms. These techniques, especially when used together, can be used to simplify graphic thesaurus displays without sacrificing important information and they can also assist in correcting poorly structured theauri. Originally developed for sentence dependency structures in the TEXNET text structure management package, they are now available as options in the THSRS thesaurus management package
  14. Craven, T.C.: ¬A computer-aided abstracting tool kit (1993) 0.00 
    0.0044349595 = product of:
  0.013304878 = sum of:
    0.013304878 = weight(_text_:to in 6506) [ClassicSimilarity], result of:
      0.013304878 = score(doc=6506,freq=2.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.16069452 = fieldWeight in 6506, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=6506)
  0.33333334 = coord(1/3)
    Abstract
    Describes the abstracting assistance features being prototyped in the TEXNET text network management system. Sentence weighting methods include: weithing negatively or positively on the stems in a selected passage; weighting on general lists of cue words, adjusting weights of selected segments; and weighting of occurrence of frequent stems. The user may adjust a number of parameters: the minimum strength of extracts; the threshold for frequent word/stems and the amount sentence weight is to be adjusted for each weighting type
  15. Craven, T.C.: ¬A thesaurus for use in a computer-aided abstracting tool kit (1993) 0.00 
    0.0044349595 = product of:
  0.013304878 = sum of:
    0.013304878 = weight(_text_:to in 7949) [ClassicSimilarity], result of:
      0.013304878 = score(doc=7949,freq=2.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.16069452 = fieldWeight in 7949, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=7949)
  0.33333334 = coord(1/3)
    Abstract
    A multi-purpose thesaurus is among abstracting assistance features being prototyped in the TEXNET text networking management system. The thesaurus is intended to support vocabulary control, including production of a variety of printed thesaurus displays, as well as automatic weighting of passages and Roget-style suggestions of alternate terms
  16. Craven, T.C.: ¬A phrase flipper for the assistance of writers of abstracts and other text (1995) 0.00 
    0.0044349595 = product of:
  0.013304878 = sum of:
    0.013304878 = weight(_text_:to in 4897) [ClassicSimilarity], result of:
      0.013304878 = score(doc=4897,freq=2.0), product of:
        0.08279609 = queryWeight, product of:
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.045541126 = queryNorm
        0.16069452 = fieldWeight in 4897, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          1.818051 = idf(docFreq=19512, maxDocs=44218)
          0.0625 = fieldNorm(doc=4897)
  0.33333334 = coord(1/3)
    Abstract
    Describes computerized tools for computer assisted abstracting. FlipPhr is a Microsoft Windows application program that rearranges (flips) phrases or other expressions in accordance with rules in a grammar. The flipping may be invoked with a single keystroke from within various Windows application programs that allow cutting and pasting of text. The user may modify the grammar to provide for different kinds of flipping

Years

Themes