Search (6 results, page 1 of 1)

Craven, T.C.: Concept relation structures and their graphic display (1992) 0.06

0.061921705 = product of:
  0.24768682 = sum of:
    0.24768682 = weight(_text_:graphic in 2090) [ClassicSimilarity], result of:
      0.24768682 = score(doc=2090,freq=4.0), product of:
        0.29924196 = queryWeight, product of:
          6.6217136 = idf(docFreq=159, maxDocs=44218)
          0.045191016 = queryNorm
        0.8277142 = fieldWeight in 2090, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          6.6217136 = idf(docFreq=159, maxDocs=44218)
          0.0625 = fieldNorm(doc=2090)
  0.25 = coord(1/4)

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

Craven, T.C.: Condensed representation of sentences in graphic displays of text structures (1990) 0.06
```
0.061921705 = product of:
  0.24768682 = sum of:
    0.24768682 = weight(_text_:graphic in 3870) [ClassicSimilarity], result of:
      0.24768682 = score(doc=3870,freq=4.0), product of:
        0.29924196 = queryWeight, product of:
          6.6217136 = idf(docFreq=159, maxDocs=44218)
          0.045191016 = queryNorm
        0.8277142 = fieldWeight in 3870, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          6.6217136 = idf(docFreq=159, maxDocs=44218)
          0.0625 = fieldNorm(doc=3870)
  0.25 = coord(1/4)
```
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
Craven, T.C.: Automatic structure modification in the graphic display of thesauri (1990) 0.06
```
0.061921705 = product of:
  0.24768682 = sum of:
    0.24768682 = weight(_text_:graphic in 4793) [ClassicSimilarity], result of:
      0.24768682 = score(doc=4793,freq=4.0), product of:
        0.29924196 = queryWeight, product of:
          6.6217136 = idf(docFreq=159, maxDocs=44218)
          0.045191016 = queryNorm
        0.8277142 = fieldWeight in 4793, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          6.6217136 = idf(docFreq=159, maxDocs=44218)
          0.0625 = fieldNorm(doc=4793)
  0.25 = coord(1/4)
```
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

Craven, T.C.: ¬A general versus a special algorithm in the graphic display of thesauri (1992) 0.04

0.04378526 = product of:
  0.17514104 = sum of:
    0.17514104 = weight(_text_:graphic in 2099) [ClassicSimilarity], result of:
      0.17514104 = score(doc=2099,freq=2.0), product of:
        0.29924196 = queryWeight, product of:
          6.6217136 = idf(docFreq=159, maxDocs=44218)
          0.045191016 = queryNorm
        0.5852823 = fieldWeight in 2099, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          6.6217136 = idf(docFreq=159, maxDocs=44218)
          0.0625 = fieldNorm(doc=2099)
  0.25 = coord(1/4)

Craven, T.C.: ¬A computer-aided abstracting tool kit (1993) 0.01

0.008070464 = product of:
  0.032281857 = sum of:
    0.032281857 = product of:
      0.064563714 = sum of:
        0.064563714 = weight(_text_:methods in 6506) [ClassicSimilarity], result of:
          0.064563714 = score(doc=6506,freq=2.0), product of:
            0.18168657 = queryWeight, product of:
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.045191016 = queryNorm
            0.35535768 = fieldWeight in 6506, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.0625 = fieldNorm(doc=6506)
      0.5 = coord(1/2)
  0.25 = coord(1/4)

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

Craven, T.C.: Determining authorship of Web pages (2006) 0.01
```
0.0070616566 = product of:
  0.028246626 = sum of:
    0.028246626 = product of:
      0.056493253 = sum of:
        0.056493253 = weight(_text_:methods in 1498) [ClassicSimilarity], result of:
          0.056493253 = score(doc=1498,freq=2.0), product of:
            0.18168657 = queryWeight, product of:
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.045191016 = queryNorm
            0.31093797 = fieldWeight in 1498, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0204134 = idf(docFreq=2156, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1498)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
```
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.

Search (6 results, page 1 of 1)

Years

Themes