Search (55 results, page 1 of 3)

0.07238475 = product of:
  0.108577125 = sum of:
    0.08579248 = weight(_text_:index in 5911) [ClassicSimilarity], result of:
      0.08579248 = score(doc=5911,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.3862362 = fieldWeight in 5911, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0625 = fieldNorm(doc=5911)
    0.022784641 = product of:
      0.045569282 = sum of:
        0.045569282 = weight(_text_:classification in 5911) [ClassicSimilarity], result of:
          0.045569282 = score(doc=5911,freq=2.0), product of:
            0.16188543 = queryWeight, product of:
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.05083213 = queryNorm
            0.28149095 = fieldWeight in 5911, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1847067 = idf(docFreq=4974, maxDocs=44218)
              0.0625 = fieldNorm(doc=5911)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)

Abstract

When document components are classified and then recombined during document re-use, a semantic net may serve as the classification language. A theory of analogical inheritance, applied to this semantic net, guides the reorganisation of document components. Authors index paragraphs from various sources with node-link-node triples from a semantic net and then use programs to transverse the semantic net and generate various outlines. The program examines node and link names in deciding which path to take. Describes how these techniques helped in the re-use: parts of an existing book to write a new one

0.050045617 = product of:
  0.15013684 = sum of:
    0.15013684 = weight(_text_:index in 2981) [ClassicSimilarity], result of:
      0.15013684 = score(doc=2981,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.67591333 = fieldWeight in 2981, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.109375 = fieldNorm(doc=2981)
  0.33333334 = coord(1/3)

0.04953232 = product of:
  0.14859696 = sum of:
    0.14859696 = weight(_text_:index in 2637) [ClassicSimilarity], result of:
      0.14859696 = score(doc=2637,freq=6.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.6689808 = fieldWeight in 2637, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0625 = fieldNorm(doc=2637)
  0.33333334 = coord(1/3)

Abstract

Grif is a structured document editor based on the generic structure concepts that supports both hierarchical structures and non hierarchical links. Defines an index and presents an electronic index service that was developed in the Grif editor by taking advantage of the hypertext facilities available in the system. discusses the main principles of the Grif system, describes indexing features with Grif and additional features

0.040442966 = product of:
  0.1213289 = sum of:
    0.1213289 = weight(_text_:index in 7437) [ClassicSimilarity], result of:
      0.1213289 = score(doc=7437,freq=4.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.5462205 = fieldWeight in 7437, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0625 = fieldNorm(doc=7437)
  0.33333334 = coord(1/3)

Abstract

Compares the use of 2 adaptive algorithms (genetic algorithms, and neural networks) in clustering hypermedia documents. The clusters allow the user to index into the nodes and find information quickly. The clustering focuses on the user's paths through the hypermedia document and not on the content of the nodes or the structure of the links in the document, thus the clustering reflects the unique relationships each user sees among the nodes. The original hypermedia document remains untouched, and each user has a personalised index into this document

0.03714924 = product of:
  0.111447714 = sum of:
    0.111447714 = weight(_text_:index in 1491) [ClassicSimilarity], result of:
      0.111447714 = score(doc=1491,freq=6.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.50173557 = fieldWeight in 1491, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.046875 = fieldNorm(doc=1491)
  0.33333334 = coord(1/3)

Abstract

Techniques to aid the manipulation of a computer based document were tested by a group of 38 novice users. The subjects were given a period of time to browse the document, and were subsequently given a set of goal related tasks in a questionnaire/answer session. The techniques tested were sequential paging, index referral, text fins and embedded hypertext links. 3 differing types of link mechansms were assessed and compared with each other. Sequential paging and index referral were the most commonly used of the techniques. Text find was employed more for goal related tasks than for browsing. The hypertext link technique was generally unpopular, especially for goal related tasks. In order to establish the importance of the text find technique, the effect on reading strategies without this facility was also investigated. For browsing operations, an increase in paging and decrease in hypertext linking was observed. In the case of goal directed searching, an increase was observed in paging and index referral techniques. The study calls into question the usefulness of hypertext in educational software

0.03714924 = product of:
  0.111447714 = sum of:
    0.111447714 = weight(_text_:index in 3830) [ClassicSimilarity], result of:
      0.111447714 = score(doc=3830,freq=6.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.50173557 = fieldWeight in 3830, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.046875 = fieldNorm(doc=3830)
  0.33333334 = coord(1/3)

Abstract

Considers the relationship between indexing and hypermedia. Conceptualizes adequate models of index structures and indexing procedures; and establishes what readers do when accessing indexes. There is a range of explicit and implicit models underlying databases, documents and indexes. A fundamental starting point for the development of substructure indexing tools for use with hypermedia is the precise specification of such models. Analysis of substructure indexing models will allow the identification of largely technical constraints and conceptual constraints. Related also are aspects of the problem deriving from how indexes can, and should be, presented. Gives a framework for the identification of such models. Examines index use. A field study was conducted looking at the use accountants make of indexing facilities an a large financial services document. Task analysis highlights the range of problems encountered, strategies employed and the kinds of solutions arrived at. There are 6 key factors underlying the 'rule of thumb' procedure users employ when interrogating an index. Discusses the implications of this study for the design of indexing within hypermedia environment

0.03574687 = product of:
  0.1072406 = sum of:
    0.1072406 = weight(_text_:index in 6192) [ClassicSimilarity], result of:
      0.1072406 = score(doc=6192,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.48279524 = fieldWeight in 6192, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.078125 = fieldNorm(doc=6192)
  0.33333334 = coord(1/3)

Abstract

HyperRez from MaxThink is discussed as is the creation of the major Internet index, HYTELNET. Reference is also made to hypertext utilities currently under development that make use of the HyperRez software

0.030332223 = product of:
  0.09099667 = sum of:
    0.09099667 = weight(_text_:index in 1084) [ClassicSimilarity], result of:
      0.09099667 = score(doc=1084,freq=4.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.40966535 = fieldWeight in 1084, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.046875 = fieldNorm(doc=1084)
  0.33333334 = coord(1/3)

Abstract

An important stage in the process of retrieval of objects from a hypertext database is the creation of a set of internodal links that are intended to represent the relationships existing between objetcs; an operation that is usually undertaken manually such as the allocation of subject index terms to documents. Reports results of a study in which several different sets of hypertext links were inserted, each by a different person, between the paragraphs of each of a number of full text documents. The similarity between the members of each pair of link sets was then evaluated. Results indicated that little similarity existed among the link sets, a finding comparable with those of studies of inter indexer consistency, which suggests that there is generally only a low level of agreemenet between the sets of index terms assigned to a document by indexers. Concludes with that part of the study designed to test the validity of making these kinds of assumptions in the context of hypertext link sets

0.030332223 = product of:
  0.09099667 = sum of:
    0.09099667 = weight(_text_:index in 7460) [ClassicSimilarity], result of:
      0.09099667 = score(doc=7460,freq=4.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.40966535 = fieldWeight in 7460, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.046875 = fieldNorm(doc=7460)
  0.33333334 = coord(1/3)

Abstract

Describes an integrated approach to similarity coefficients for information spaces with multiple dimensions of different types of index term. Categorises applications of similarity coefficients underlying different navigation tools in hypermedia by type of term. Describes an implementation of a unified similarity coefficient based on work in numerical taxonomy, with illustrative scenarios from an experimental navigation via similarity tool for a prototype social history museum hypermedia system. The underlying architecture is based on a semantic approach, where semantic relationships can exist between index terms. This allows imprecise matching when comparing for similarity, with distance measures yielding a degree of match. A ranked list of matching items over several weighted dimensions is returned by the similarity navigation tool. The approach has the potential of allowing different access methods to multimedia data to be combined

0.028597495 = product of:
  0.08579248 = sum of:
    0.08579248 = weight(_text_:index in 5085) [ClassicSimilarity], result of:
      0.08579248 = score(doc=5085,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.3862362 = fieldWeight in 5085, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0625 = fieldNorm(doc=5085)
  0.33333334 = coord(1/3)

Abstract

Reviews SmarText from Lotus Development Co. which creates and retrieves electronically stored reference materials and documents. The software builder automatically analyzes electronic versions of documents assembles its own outlines and indexes and establishes hypertext links between text and illustrations. Documents can be searched either by browsing through the text, using the outline to find a specific section, or selecting from the index. A Boolean search feature allows searching for combinations of terms. Examines the strengths and weaknesses of the program. Smartext is best suited to documents developed internally or in the public domain because of copyright law

0.028597495 = product of:
  0.08579248 = sum of:
    0.08579248 = weight(_text_:index in 6) [ClassicSimilarity], result of:
      0.08579248 = score(doc=6,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.3862362 = fieldWeight in 6, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0625 = fieldNorm(doc=6)
  0.33333334 = coord(1/3)

Abstract

Hypertext is an alternative to traditional linear text and has been used successfully to create useful indexes on various types of computers. HyperRez, from MaxThink, is discussed in details, as is the creation of the major Internet index, HYTELNET. Reference is also made to hypertext utilities currently under development that make use of the HyperRez software

0.025276855 = product of:
  0.075830564 = sum of:
    0.075830564 = weight(_text_:index in 220) [ClassicSimilarity], result of:
      0.075830564 = score(doc=220,freq=4.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.3413878 = fieldWeight in 220, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0390625 = fieldNorm(doc=220)
  0.33333334 = coord(1/3)

Abstract

When the Web was invented, it was touted as a novel nonlinear medium for the written word. No longer would we be constrained by linear presentations! Hyperlinks would allow us to jump haphazardly from page to page, chapter to chapter, idea to idea! Texts would no longer need to run from beginning to end! This is misleading. A printed book is also multidimensional and potentially nonlinear. We can open it to any page, from any other page, for any reason. We can open several books at once. In fact, what makes a book special is its combination of linear structure (the order of the words) and nonlinear physicality (the bound papers). This linear/nonlinear duality is enhanced further by the index, which maps linearly sequenced pages in a nonlinear, informationally ordered structure (architecture). In truth, the online environment is crippled by an absence of linear structure. Imagine selecting a hard cover book, tearing off the covers, ripping pages into small pieces, and throwing them in a box. That box is like a computer file system, and the paper scraps are Web documents. Only one scrap can be retrieved from the box at a time, and it must be replaced before another can be accessed. Page numbers are meaningless. Global context is destroyed. And without page numbers or context, what happens to the index?

0.025022808 = product of:
  0.07506842 = sum of:
    0.07506842 = weight(_text_:index in 5571) [ClassicSimilarity], result of:
      0.07506842 = score(doc=5571,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.33795667 = fieldWeight in 5571, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0546875 = fieldNorm(doc=5571)
  0.33333334 = coord(1/3)

Abstract

Describes the design and implementation of TACHIR, a tool for the automatic construction of hypertexts for information retrieval. Through the use of an authoring methodology employing a set of well known information retrieval techniques, TACHIR automatically builds up a hypertext from a document collection. The structure of the hypertext reflects a 3 level conceptual model which enables navigation among documents, index terms, and concepts using automatically determined links. The hypertext is implemented using the HTML language. It can be distributed on different sites and different machines over the Internet, and it can be navigated using WWW interfaces

0.025022808 = product of:
  0.07506842 = sum of:
    0.07506842 = weight(_text_:index in 7254) [ClassicSimilarity], result of:
      0.07506842 = score(doc=7254,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.33795667 = fieldWeight in 7254, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0546875 = fieldNorm(doc=7254)
  0.33333334 = coord(1/3)

Abstract

The aim of probabilistic models is to define a retrieval strategy within which documents can be optimally ranked according to their relevance probability with respect to a given request. Presents a study which suggests representing documents not only by index term vendors, as proposed by previous probabilistic models but also by considering relevance hypertext links. To enhance retrieval effectiveness, the learning retrieval scheme should modify the weight assigned to each indexing terms, the importance attached to each search term, and the relationships between documents. Evaluation of the proposed retrieval scheme with a hypertext based on the CACM test collection which includes 3.204 documents and the CISI corpus (1,460 documents), yields interesting results on the retrieval effectiveness of this approach

0.018365473 = product of:
  0.055096414 = sum of:
    0.055096414 = product of:
      0.11019283 = sum of:
        0.11019283 = weight(_text_:22 in 8762) [ClassicSimilarity], result of:
          0.11019283 = score(doc=8762,freq=2.0), product of:
            0.17800546 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05083213 = queryNorm
            0.61904186 = fieldWeight in 8762, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.125 = fieldNorm(doc=8762)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

19.10.1995 10:22:53

0.017873434 = product of:
  0.0536203 = sum of:
    0.0536203 = weight(_text_:index in 7493) [ClassicSimilarity], result of:
      0.0536203 = score(doc=7493,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.24139762 = fieldWeight in 7493, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0390625 = fieldNorm(doc=7493)
  0.33333334 = coord(1/3)

Abstract

In important stage in the process of retrieval of objects from a hypertext database is the creation of a set of inter-nodal links that are intended to represent the relationships existing between objects; this operation is often undertaken manually, just as index terms are often manually assigned to documents in a conventional retrieval system. Studies of conventional systems have suggested that a degree of consistency in the terms assigned to documents by indexers is positively associated with retrieval effectiveness. It is thus of interest to investigate the consistency of assignment of links in separate hypertext versions of the same full-text document, since a measure of agreement may be related to the subsequent utility of the resulting hypertext databases. The calculation of values indicating the degree of similarity between objects is a technique that has been widely used in the fields of textual and chemical information retrieval; in this paper we describe the application of arithmetic coefficients and topological indices to the measurement of the degree of similarity between the sets of inter-nodal links in hypertext databases. We publish the results of a study in which several different of links are inserted, by different people, between the paragraphs of each of a number of full-text documents. Our results show little similary between the sets of links identified by different people; this finding is comparable with those of studies of inter-indexer consistency, where it has been found that there is generally only a low level of agreement between the sets of idenx terms assigned to a document by different indexers

0.017873434 = product of:
  0.0536203 = sum of:
    0.0536203 = weight(_text_:index in 735) [ClassicSimilarity], result of:
      0.0536203 = score(doc=735,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.24139762 = fieldWeight in 735, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0390625 = fieldNorm(doc=735)
  0.33333334 = coord(1/3)

Abstract

"Krajewski draws on recent German media theory and on a rich array of European and American sources in this thought-provoking account of the index card as a tool of information management. In investigating the road from the slips of paper of the 16th century to the data processing of the 20th, Krajewski highlights its twists and turns--failures and unintended consequences, reinventions, and surprising transfers."--Ann M. Blair, Henry Charles Lea Professor of History, Harvard University, and author of Too Much to Know: Managing Scholarly Information before the Modern Age -- Ann Blair "This is a fascinating, original, continuously surprising, and meticulously researched study of the long history of the emergence of card systems for organizing not only libraries but business activities in Europe and the United States. It is particularly important for English language readers due to its European perspective and the extraordinary range of German and other resources on which it draws." --W. Boyd Rayward, Professor Emeritus, Graduate School of Library and Information Science, University of Illinois at Urbana-Champaign -- W. Boyd Rayward "Markus Krajewski has done the history of cataloguing and the history of information management a considerable service: I recommend it highly." -- Professor Tom Wilson, Editor-in-Chief, Information Research

0.017873434 = product of:
  0.0536203 = sum of:
    0.0536203 = weight(_text_:index in 3401) [ClassicSimilarity], result of:
      0.0536203 = score(doc=3401,freq=2.0), product of:
        0.2221244 = queryWeight, product of:
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.05083213 = queryNorm
        0.24139762 = fieldWeight in 3401, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          4.369764 = idf(docFreq=1520, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3401)
  0.33333334 = coord(1/3)

Abstract

Die vorliegende Arbeit untersucht die hypertextuellen Verknüpfungen aus semiotischer und textlinguistischer Sicht. Der erste Teil führt kurz ein in die Geschichte des Hypertextes und erläutert die grundlegenden Begriffe. In einem zweiten Teil wird der Hyperlink als Element des Hypertextes thematisiert und Typologien von Hyperlinks vorgestellt, wie sie von Kuhlen (1991) informationswissenschaftlich und von Bucher sprachwissenschaftlich entwickelt wurden. Im dritten Teil werden die Zeichentheorien von Peirce und Morris exemplarisch auf das Phänomen Hyperlink bezogen. Dabei werden die Verknüpfungsanzeiger zuerst nach Peirce als Symbol, Ikon oder Index kategorisiert und anschliessend nach Morris in ihren semantischen, pragmatischen und syntaktischen Aspekten beschrieben. Nach der semiotischen folgt eine textlinguistische Beschreibung der Verknüpfungsanzeiger in Bezug auf die Kohäsion und die Kohärenz von Hypertextbasen. Auf der Textoberflächenstruktur werden die Verknüpfungsanzeiger als Verbindungselemente zwischen Informationseinheiten betrachtet und die verschiedenen Formen von Kohäsionsmittel exemplarisch auf die Verknüpfungsanzeiger angewendet. Abschliessend soll versucht werden, die Hyper-links als Kohärenz stiftende Elemente eines Hypertextes zu beschreiben. In Rücksicht auf den Umfang der Arbeit werden die Ausführungen primär theoretisch bleiben müssen. Wo immer möglich, sollen jedoch Beispiele zur näheren Erläuterung angeführt werden.

0.016069788 = product of:
  0.04820936 = sum of:
    0.04820936 = product of:
      0.09641872 = sum of:
        0.09641872 = weight(_text_:22 in 6562) [ClassicSimilarity], result of:
          0.09641872 = score(doc=6562,freq=2.0), product of:
            0.17800546 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05083213 = queryNorm
            0.5416616 = fieldWeight in 6562, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=6562)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

22. 2.1997 19:40:31

0.016069788 = product of:
  0.04820936 = sum of:
    0.04820936 = product of:
      0.09641872 = sum of:
        0.09641872 = weight(_text_:22 in 1496) [ClassicSimilarity], result of:
          0.09641872 = score(doc=1496,freq=2.0), product of:
            0.17800546 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05083213 = queryNorm
            0.5416616 = fieldWeight in 1496, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.109375 = fieldNorm(doc=1496)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)

Date

22. 7.1998 18:23:25