Search (77 results, page 1 of 4)

0.05887971 = product of:
  0.11775942 = sum of:
    0.11775942 = sum of:
      0.07606566 = weight(_text_:networks in 2655) [ClassicSimilarity], result of:
        0.07606566 = score(doc=2655,freq=2.0), product of:
          0.24259318 = queryWeight, product of:
            4.72992 = idf(docFreq=1060, maxDocs=44218)
            0.051289067 = queryNorm
          0.31355235 = fieldWeight in 2655, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.72992 = idf(docFreq=1060, maxDocs=44218)
            0.046875 = fieldNorm(doc=2655)
      0.041693762 = weight(_text_:22 in 2655) [ClassicSimilarity], result of:
        0.041693762 = score(doc=2655,freq=2.0), product of:
          0.17960557 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051289067 = queryNorm
          0.23214069 = fieldWeight in 2655, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=2655)
  0.5 = coord(1/2)

Abstract

The term "facet" was introduced into the field of library classification systems by Ranganathan in the 1930's [Ranganathan, 1962]. A facet is a viewpoint or aspect. In contrast to traditional classification systems, faceted systems are modular in that a domain is analyzed in terms of baseline facets which are then synthesized. In this paper, the term "facet" is used in a broader meaning. Facets can describe different aspects on the same level of abstraction or the same aspect on different levels of abstraction. The notion of facets is related to database views, multicontexts and conceptual scaling in formal concept analysis [Ganter and Wille, 1999], polymorphism in object-oriented design, aspect-oriented programming, views and contexts in description logic and semantic networks. This paper presents a definition of facets in terms of faceted knowledge representation that incorporates the traditional narrower notion of facets and potentially facilitates translation between different knowledge representation formalisms. A goal of this approach is a modular, machine-aided knowledge base design mechanism. A possible application is faceted thesaurus construction for information retrieval and data mining. Reasoning complexity depends on the size of the modules (facets). A more general analysis of complexity will be left for future research.

Date

22. 1.2016 17:30:31

0.04754104 = product of:
  0.09508208 = sum of:
    0.09508208 = product of:
      0.19016416 = sum of:
        0.19016416 = weight(_text_:networks in 847) [ClassicSimilarity], result of:
          0.19016416 = score(doc=847,freq=18.0), product of:
            0.24259318 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.051289067 = queryNorm
            0.7838809 = fieldWeight in 847, product of:
              4.2426405 = tf(freq=18.0), with freq of:
                18.0 = termFreq=18.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.0390625 = fieldNorm(doc=847)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Purpose - The purpose of this paper is to present descriptive characteristics of the historical development of concept networks. The linguistic principles, mechanisms and motivations behind the evolution of concept networks are discussed. Implications emanating from the idea of the historical development of concept networks are discussed in relation to knowledge representation and organization schemes. Design/methodology/approach - Natural language data including both speech and text are analyzed by examining discourse contexts in which a linguistic element such as a polysemy or homonym occurs. Linguistic literature on the historical development of concept networks is reviewed and analyzed. Findings - Semantic sense relations in concept networks can be captured in a systematic and regular manner. The mechanism and impetus behind the process of concept network development suggest that semantic senses in concept networks are closely intertwined with pragmatic contexts and discourse structure. The interrelation and permeability of the semantic senses of concept networks are captured on a continuum scale based on three linguistic parameters: concrete shared semantic sense; discourse and text structure; and contextualized pragmatic information. Research limitations/implications - Research findings signify the critical need for linking discourse structure and contextualized pragmatic information to knowledge representation and organization schemes. Originality/value - The idea of linguistic characteristics, principles, motivation and mechanisms underlying the evolution of concept networks provides theoretical ground for developing a model for integrating knowledge representation and organization schemes with discourse structure and contextualized pragmatic information.

0.040730316 = product of:
  0.08146063 = sum of:
    0.08146063 = product of:
      0.24438189 = sum of:
        0.24438189 = weight(_text_:3a in 400) [ClassicSimilarity], result of:
          0.24438189 = score(doc=400,freq=2.0), product of:
            0.43482926 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.051289067 = queryNorm
            0.56201804 = fieldWeight in 400, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.046875 = fieldNorm(doc=400)
      0.33333334 = coord(1/3)
  0.5 = coord(1/2)

Content

Vgl.: https%3A%2F%2Faclanthology.org%2FD19-5317.pdf&usg=AOvVaw0ZZFyq5wWTtNTvNkrvjlGA.

0.035857696 = product of:
  0.07171539 = sum of:
    0.07171539 = product of:
      0.14343078 = sum of:
        0.14343078 = weight(_text_:networks in 3671) [ClassicSimilarity], result of:
          0.14343078 = score(doc=3671,freq=4.0), product of:
            0.24259318 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.051289067 = queryNorm
            0.59124 = fieldWeight in 3671, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.0625 = fieldNorm(doc=3671)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Semantic networks produced from human data have statistical properties that cannot be easily captured by spatial representations. We explore a probabilistic approach to semantic representation that explicitly models the probability with which words occurin diffrent contexts, and hence captures the probabilistic relationships between words. We show that this representation has statistical properties consistent with the large-scale structure of semantic networks constructed by humans, and trace the origins of these properties.

0.035435 = product of:
  0.07087 = sum of:
    0.07087 = product of:
      0.14174 = sum of:
        0.14174 = weight(_text_:networks in 4319) [ClassicSimilarity], result of:
          0.14174 = score(doc=4319,freq=10.0), product of:
            0.24259318 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.051289067 = queryNorm
            0.5842703 = fieldWeight in 4319, product of:
              3.1622777 = tf(freq=10.0), with freq of:
                10.0 = termFreq=10.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4319)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Content

Inhalt: Image and Pattern Recognition: Compression, Image processing, Signal Processing Architectures, Signal Processing for Communication, Signal Processing Implementation, Speech Compression, and Video Coding Architectures. Languages and Systems: Algorithms, Databases, Embedded Systems and Applications, File Systems and I/O, Geographical Information Systems, Kernel and OS Structures, Knowledge Based Systems, Modeling and Simulation, Object Based Software Engineering, Programming Languages, and Programming Models and tools. Parallel Processing: Distributed Scheduling, Multiprocessing, Real-time Systems, Simulation Modeling and Development, and Web Applications. New trends in computing: Computers for People of Special Needs, Fuzzy Inference, Human Computer Interaction, Incremental Learning, Internet-based Computing Models, Machine Intelligence, Natural Language Processing, Neural Networks, and Online Decision Support System

LCSH

Communications Engineering, Networks
Computer Systems Organization and Communication Networks

Subject

Communications Engineering, Networks
Computer Systems Organization and Communication Networks

0.031375486 = product of:
  0.06275097 = sum of:
    0.06275097 = product of:
      0.12550195 = sum of:
        0.12550195 = weight(_text_:networks in 4784) [ClassicSimilarity], result of:
          0.12550195 = score(doc=4784,freq=4.0), product of:
            0.24259318 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.051289067 = queryNorm
            0.517335 = fieldWeight in 4784, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.0546875 = fieldNorm(doc=4784)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

LCSH

Computer Communication Networks

Subject

Computer Communication Networks

0.027447835 = product of:
  0.05489567 = sum of:
    0.05489567 = product of:
      0.10979134 = sum of:
        0.10979134 = weight(_text_:networks in 3810) [ClassicSimilarity], result of:
          0.10979134 = score(doc=3810,freq=6.0), product of:
            0.24259318 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.051289067 = queryNorm
            0.45257387 = fieldWeight in 3810, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3810)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Nowadays, online data shows an astonishing increase and the issue of semantic indexing remains an open question. Ontologies and knowledge bases have been widely used to optimize performance. However, researchers are placing increased emphasis on internal relations of ontologies but neglect latent semantic relations between ontologies and documents. They generally annotate instances mentioned in documents, which are related to concepts in ontologies. In this paper, we propose an Ontology-based Latent Semantic Indexing approach utilizing Long Short-Term Memory networks (LSTM-OLSI). We utilize an importance-aware topic model to extract document-level semantic features and leverage ontologies to extract word-level contextual features. Then we encode the above two levels of features and match their embedding vectors utilizing LSTM networks. Finally, the experimental results reveal that LSTM-OLSI outperforms existing techniques and demonstrates deep comprehension of instances and articles.

0.027153544 = product of:
  0.05430709 = sum of:
    0.05430709 = product of:
      0.16292126 = sum of:
        0.16292126 = weight(_text_:3a in 701) [ClassicSimilarity], result of:
          0.16292126 = score(doc=701,freq=2.0), product of:
            0.43482926 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.051289067 = queryNorm
            0.3746787 = fieldWeight in 701, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.03125 = fieldNorm(doc=701)
      0.33333334 = coord(1/3)
  0.5 = coord(1/2)

Content

Vgl.: http%3A%2F%2Fdigbib.ubka.uni-karlsruhe.de%2Fvolltexte%2Fdocuments%2F1627&ei=tAtYUYrBNoHKtQb3l4GYBw&usg=AFQjCNHeaxKkKU3-u54LWxMNYGXaaDLCGw&sig2=8WykXWQoDKjDSdGtAakH2Q&bvm=bv.44442042,d.Yms.

0.027153544 = product of:
  0.05430709 = sum of:
    0.05430709 = product of:
      0.16292126 = sum of:
        0.16292126 = weight(_text_:3a in 5820) [ClassicSimilarity], result of:
          0.16292126 = score(doc=5820,freq=2.0), product of:
            0.43482926 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.051289067 = queryNorm
            0.3746787 = fieldWeight in 5820, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.03125 = fieldNorm(doc=5820)
      0.33333334 = coord(1/3)
  0.5 = coord(1/2)

Content

Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Language and Information Technologies. Vgl.: https%3A%2F%2Fwww.cs.cmu.edu%2F~cx%2Fpapers%2Fknowledge_based_text_representation.pdf&usg=AOvVaw0SaTSvhWLTh__Uz_HtOtl3.

0.026893275 = product of:
  0.05378655 = sum of:
    0.05378655 = product of:
      0.1075731 = sum of:
        0.1075731 = weight(_text_:networks in 3708) [ClassicSimilarity], result of:
          0.1075731 = score(doc=3708,freq=4.0), product of:
            0.24259318 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.051289067 = queryNorm
            0.44343 = fieldWeight in 3708, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046875 = fieldNorm(doc=3708)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

One of the key objectives of knowledge management is to transfer knowledge quickly and efficiently from experts to novices, who are different in terms of the structural properties of domain knowledge or knowledge structure. This study applies experts' semantic networks to hypertext navigation design and examines the potential of the resulting design, i.e., semantic hypertext, in facilitating knowledge structure acquisition and problem solving. Moreover, we argue that the level of sophistication of the knowledge structure acquired by learners is an important mediator influencing the learning outcomes (in this case, problem solving). The research model was empirically tested with a situated experiment involving 80 business professionals. The results of the empirical study provided strong support for the effectiveness of semantic hypertext in transferring knowledge structure and reported a significant full mediating effect of knowledge structure sophistication. Both theoretical and practical implications of this research are discussed.

0.026893275 = product of:
  0.05378655 = sum of:
    0.05378655 = product of:
      0.1075731 = sum of:
        0.1075731 = weight(_text_:networks in 439) [ClassicSimilarity], result of:
          0.1075731 = score(doc=439,freq=4.0), product of:
            0.24259318 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.051289067 = queryNorm
            0.44343 = fieldWeight in 439, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046875 = fieldNorm(doc=439)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

LCSH

Computer Communication Networks

Subject

Computer Communication Networks

0.026893275 = product of:
  0.05378655 = sum of:
    0.05378655 = product of:
      0.1075731 = sum of:
        0.1075731 = weight(_text_:networks in 1205) [ClassicSimilarity], result of:
          0.1075731 = score(doc=1205,freq=4.0), product of:
            0.24259318 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.051289067 = queryNorm
            0.44343 = fieldWeight in 1205, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046875 = fieldNorm(doc=1205)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Detecting science-technology hierarchical linkages is beneficial for understanding deep interactions between science and technology (S&T). Previous studies have mainly focused on linear linkages between S&T but ignored their structural linkages. In this paper, we propose a network coupling approach to inspect hierarchical interactions of S&T by integrating their knowledge linkages and structural linkages. S&T knowledge networks are first enhanced with bidirectional encoder representation from transformers (BERT) knowledge alignment, and then their hierarchical structures are identified based on K-core decomposition. Hierarchical coupling preferences and strengths of the S&T networks over time are further calculated based on similarities of coupling nodes' degree distribution and similarities of coupling edges' weight distribution. Extensive experimental results indicate that our approach is feasible and robust in identifying the coupling hierarchy with superior performance compared to other isomorphism and dissimilarity algorithms. Our research extends the mindset of S&T linkage measurement by identifying patterns and paths of the interaction of S&T hierarchical knowledge.

0.022411061 = product of:
  0.044822123 = sum of:
    0.044822123 = product of:
      0.089644246 = sum of:
        0.089644246 = weight(_text_:networks in 1093) [ClassicSimilarity], result of:
          0.089644246 = score(doc=1093,freq=4.0), product of:
            0.24259318 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.051289067 = queryNorm
            0.369525 = fieldWeight in 1093, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.0390625 = fieldNorm(doc=1093)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The Semantic Web has been criticized for not being semantic. This article examines the questions of why and how the Web of Data, expressed in the Resource Description Framework (RDF), has come to be known as the Semantic Web. Contrary to previous papers, we deliberately take a descriptive stance and do not start from preconceived ideas about the nature of semantics. Instead, we mainly base our analysis on early design documents of the (Semantic) Web. The main determining factor is shown to be link typing, coupled with the influence of online metadata. Both factors already were present in early web standards and drafts. Our findings indicate that the Semantic Web is directly linked to older artificial intelligence work, despite occasional claims to the contrary. Because of link typing, the Semantic Web can be considered an example of a semantic network. Originally network representations of the meaning of natural language utterances, semantic networks have eventually come to refer to any networks with typed (usually directed) links. We discuss possible causes for this shift and suggest that it may be due to confounding paradigmatic and syntagmatic semantic relations.

0.019016415 = product of:
  0.03803283 = sum of:
    0.03803283 = product of:
      0.07606566 = sum of:
        0.07606566 = weight(_text_:networks in 3378) [ClassicSimilarity], result of:
          0.07606566 = score(doc=3378,freq=2.0), product of:
            0.24259318 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.051289067 = queryNorm
            0.31355235 = fieldWeight in 3378, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046875 = fieldNorm(doc=3378)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Digital libraries have become commodity in the current world of Internet. More and more information is produced, and more and more non-digital information is being rendered available. The new, more user friendly, community-oriented technologies used throughout the Internet are raising the bar of expectations. Digital libraries cannot stand still with their technologies; if not for the sake of handling rapidly growing amount and diversity of information, they must provide for better user experience matching and overgrowing standards set by the industry. The next generation of digital libraries combine technological solutions, such as P2P, SOA, or Grid, with recent research on semantics and social networks. These solutions are put into practice to answer a variety of requirements imposed on digital libraries.

0.019016415 = product of:
  0.03803283 = sum of:
    0.03803283 = product of:
      0.07606566 = sum of:
        0.07606566 = weight(_text_:networks in 4795) [ClassicSimilarity], result of:
          0.07606566 = score(doc=4795,freq=2.0), product of:
            0.24259318 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.051289067 = queryNorm
            0.31355235 = fieldWeight in 4795, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046875 = fieldNorm(doc=4795)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

SKOS (Simple Knowledge Organisation System) provides a model for expressing the basic structure and content of concept schemes such as thesauri, classification schemes, subject heading lists, taxonomies, folksonomies, and other types of controlled vocabulary. As an application of the Resource Description Framework (RDF) SKOS allows concepts to be documented, linked and merged with other data, while still being composed, integrated and published on the World Wide Web. This document is an implementors guide for those who would like to represent their concept scheme using SKOS. In basic SKOS, conceptual resources (concepts) can be identified using URIs, labelled with strings in one or more natural languages, documented with various types of notes, semantically related to each other in informal hierarchies and association networks, and aggregated into distinct concept schemes. In advanced SKOS, conceptual resources can be mapped to conceptual resources in other schemes and grouped into labelled or ordered collections. Concept labels can also be related to each other. Finally, the SKOS vocabulary itself can be extended to suit the needs of particular communities of practice.

0.019016415 = product of:
  0.03803283 = sum of:
    0.03803283 = product of:
      0.07606566 = sum of:
        0.07606566 = weight(_text_:networks in 132) [ClassicSimilarity], result of:
          0.07606566 = score(doc=132,freq=2.0), product of:
            0.24259318 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.051289067 = queryNorm
            0.31355235 = fieldWeight in 132, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046875 = fieldNorm(doc=132)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This paper presents an approach to designing and implementing extensible computational models for perceiving systems based on a knowledge-driven joint inference approach. These models can integrate different sources of information both horizontally (multi-modal and temporal fusion) and vertically (bottom-up, top-down) by incorporating prior hierarchical knowledge expressed as an extensible ontology.Two implementations of this approach are presented. The first consists of a content-based image retrieval system that allows users to search image databases using an ontological query language. Queries are parsed using a probabilistic grammar and Bayesian networks to map high-level concepts onto low-level image descriptors, thereby bridging the 'semantic gap' between users and the retrieval system. The second application extends the notion of ontological languages to video event detection. It is shown how effective high-level state and event recognition mechanisms can be learned from a set of annotated training sequences by incorporating syntactic and semantic constraints represented by an ontology.

0.019016415 = product of:
  0.03803283 = sum of:
    0.03803283 = product of:
      0.07606566 = sum of:
        0.07606566 = weight(_text_:networks in 1130) [ClassicSimilarity], result of:
          0.07606566 = score(doc=1130,freq=2.0), product of:
            0.24259318 = queryWeight, product of:
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.051289067 = queryNorm
            0.31355235 = fieldWeight in 1130, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.72992 = idf(docFreq=1060, maxDocs=44218)
              0.046875 = fieldNorm(doc=1130)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Knowledge network construction (KNC) is the essence of dynamic knowledge architecture, and is helpful to illustrate ubiquitous knowledge service in digital libraries (DLs). The authors explore its theoretical foundations and basic rules to elucidate the basic principles of KNC in DLs. The results indicate that world general connection, small-world phenomenon, relevance theory, unity and continuity of science development have been the production tool, architecture aim and scientific foundation of KNC in DLs. By analyzing both the characteristics of KNC based on different types of knowledge linking and the relationships between different forms of knowledge and the appropriate ways of knowledge linking, the basic principle of KNC is summarized as follows: let each kind of knowledge linking form each shows its ability, each kind of knowledge manifestation each answer the purpose intended in practice, and then subjective knowledge network and objective knowledge network are organically combined. This will lay a solid theoretical foundation and provide an action guide for DLs to construct knowledge networks.

0.017372401 = product of:
  0.034744803 = sum of:
    0.034744803 = product of:
      0.069489606 = sum of:
        0.069489606 = weight(_text_:22 in 6089) [ClassicSimilarity], result of:
          0.069489606 = score(doc=6089,freq=2.0), product of:
            0.17960557 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051289067 = queryNorm
            0.38690117 = fieldWeight in 6089, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=6089)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Pages

S.11-22

0.017372401 = product of:
  0.034744803 = sum of:
    0.034744803 = product of:
      0.069489606 = sum of:
        0.069489606 = weight(_text_:22 in 5576) [ClassicSimilarity], result of:
          0.069489606 = score(doc=5576,freq=2.0), product of:
            0.17960557 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051289067 = queryNorm
            0.38690117 = fieldWeight in 5576, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=5576)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

13.12.2017 14:17:22

0.017372401 = product of:
  0.034744803 = sum of:
    0.034744803 = product of:
      0.069489606 = sum of:
        0.069489606 = weight(_text_:22 in 539) [ClassicSimilarity], result of:
          0.069489606 = score(doc=539,freq=2.0), product of:
            0.17960557 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051289067 = queryNorm
            0.38690117 = fieldWeight in 539, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.078125 = fieldNorm(doc=539)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

26.12.2011 13:22:07