Search (71 results, page 1 of 4)

0.09629338 = product of:
  0.19258676 = sum of:
    0.19258676 = sum of:
      0.1441628 = weight(_text_:engines in 4330) [ClassicSimilarity], result of:
        0.1441628 = score(doc=4330,freq=4.0), product of:
          0.25941864 = queryWeight, product of:
            5.080822 = idf(docFreq=746, maxDocs=44218)
            0.051058397 = queryNorm
          0.5557149 = fieldWeight in 4330, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            5.080822 = idf(docFreq=746, maxDocs=44218)
            0.0546875 = fieldNorm(doc=4330)
      0.048423957 = weight(_text_:22 in 4330) [ClassicSimilarity], result of:
        0.048423957 = score(doc=4330,freq=2.0), product of:
          0.17879781 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051058397 = queryNorm
          0.2708308 = fieldWeight in 4330, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0546875 = fieldNorm(doc=4330)
  0.5 = coord(1/2)

Abstract

One vision of the Semantic Web is that it will be much like the Web we know today, except that documents will be enriched by annotations in machine understandable markup. These annotations will provide metadata about the documents as well as machine interpretable statements capturing some of the meaning of document content. We discuss how the information retrieval paradigm might be recast in such an environment. We suggest that retrieval can be tightly bound to inference. Doing so makes today's Web search engines useful to Semantic Web inference engines, and causes improvements in either retrieval or inference to lead directly to improvements in the other.

Date

12. 2.2011 17:35:22

0.040547136 = product of:
  0.08109427 = sum of:
    0.08109427 = product of:
      0.24328281 = sum of:
        0.24328281 = weight(_text_:3a in 400) [ClassicSimilarity], result of:
          0.24328281 = score(doc=400,freq=2.0), product of:
            0.43287367 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.051058397 = 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.031529047 = product of:
  0.06305809 = sum of:
    0.06305809 = product of:
      0.12611619 = sum of:
        0.12611619 = weight(_text_:engines in 99) [ClassicSimilarity], result of:
          0.12611619 = score(doc=99,freq=6.0), product of:
            0.25941864 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.051058397 = queryNorm
            0.4861493 = fieldWeight in 99, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0390625 = fieldNorm(doc=99)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

A new model is proposed to retrieve information by building automatically a semantic metatext structure for texts that allow searching and extracting discourse and semantic information according to certain linguistic categorizations. This paper presents approaches for searching and mining full text with semantic categories. The model is built up from two engines: The first one, called EXCOM (Djioua et al., 2006; Alrahabi, 2010), is an automatic system for text annotation, related to discourse and semantic maps, which are specification of general linguistic ontologies founded on the Applicative and Cognitive Grammar. The annotation layer uses a linguistic method called Contextual Exploration, which handles the polysemic values of a term in texts. Several 'semantic maps' underlying 'point of views' for text mining guide this automatic annotation process. The second engine uses semantic annotated texts, produced previously in order to create a semantic inverted index, which is able to retrieve relevant documents for queries associated with discourse and semantic categories such as definition, quotation, causality, relations between concepts, etc. (Djioua & Desclés, 2007). This semantic indexation process builds a metatext layer for textual contents. Some data and linguistic rules sets as well as the general architecture that extend third-party software are expressed as supplementary information.

Footnote

Vgl.: http://www.igi-global.com/book/next-generation-search-engines/64423.

Source

Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a

0.027031425 = product of:
  0.05406285 = sum of:
    0.05406285 = product of:
      0.16218854 = sum of:
        0.16218854 = weight(_text_:3a in 701) [ClassicSimilarity], result of:
          0.16218854 = score(doc=701,freq=2.0), product of:
            0.43287367 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.051058397 = 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.027031425 = product of:
  0.05406285 = sum of:
    0.05406285 = product of:
      0.16218854 = sum of:
        0.16218854 = weight(_text_:3a in 5820) [ClassicSimilarity], result of:
          0.16218854 = score(doc=5820,freq=2.0), product of:
            0.43287367 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.051058397 = 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.025743358 = product of:
  0.051486716 = sum of:
    0.051486716 = product of:
      0.10297343 = sum of:
        0.10297343 = weight(_text_:engines in 97) [ClassicSimilarity], result of:
          0.10297343 = score(doc=97,freq=4.0), product of:
            0.25941864 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.051058397 = queryNorm
            0.39693922 = fieldWeight in 97, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0390625 = fieldNorm(doc=97)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Footnote

Vgl.: http://www.igi-global.com/book/next-generation-search-engines/64424.

Source

Next generation search engines: advanced models for information retrieval. Eds.: C. Jouis, u.a

0.025743358 = product of:
  0.051486716 = sum of:
    0.051486716 = product of:
      0.10297343 = sum of:
        0.10297343 = weight(_text_:engines in 231) [ClassicSimilarity], result of:
          0.10297343 = score(doc=231,freq=4.0), product of:
            0.25941864 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.051058397 = queryNorm
            0.39693922 = fieldWeight in 231, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0390625 = fieldNorm(doc=231)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

As an extension to the current Web, Semantic Web will not only contain structured data with machine understandable semantics but also textual information. While structured queries can be used to find information more precisely on the Semantic Web, keyword searches are still needed to help exploit textual information. It thus becomes very important that we can combine precise structured queries with imprecise keyword searches to have a hybrid query capability. In addition, due to the huge volume of information on the Semantic Web, the hybrid query must be processed in a very scalable way. In this paper, we define such a hybrid query capability that combines unary tree-shaped structured queries with keyword searches. We show how existing information retrieval (IR) index structures and functions can be reused to index semantic web data and its textual information, and how the hybrid query is evaluated on the index structure using IR engines in an efficient and scalable manner. We implemented this IR approach in an engine called Semplore. Comprehensive experiments on its performance show that it is a promising approach. It leads us to believe that it may be possible to evolve current web search engines to query and search the Semantic Web. Finally, we briefy describe how Semplore is used for searching Wikipedia and an IBM customer's product information.

0.025743358 = product of:
  0.051486716 = sum of:
    0.051486716 = product of:
      0.10297343 = sum of:
        0.10297343 = weight(_text_:engines in 2861) [ClassicSimilarity], result of:
          0.10297343 = score(doc=2861,freq=4.0), product of:
            0.25941864 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.051058397 = queryNorm
            0.39693922 = fieldWeight in 2861, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2861)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Today's conventional search engines hardly do provide the essential content relevant to the user's search query. This is because the context and semantics of the request made by the user is not analyzed to the full extent. So here the need for a semantic web search arises. SWS is upcoming in the area of web search which combines Natural Language Processing and Artificial Intelligence. The objective of the work done here is to design, develop and implement a semantic search engine- SIEU(Semantic Information Extraction in University Domain) confined to the university domain. SIEU uses ontology as a knowledge base for the information retrieval process. It is not just a mere keyword search. It is one layer above what Google or any other search engines retrieve by analyzing just the keywords. Here the query is analyzed both syntactically and semantically. The developed system retrieves the web results more relevant to the user query through keyword expansion. The results obtained here will be accurate enough to satisfy the request made by the user. The level of accuracy will be enhanced since the query is analyzed semantically. The system will be of great use to the developers and researchers who work on web. The Google results are re-ranked and optimized for providing the relevant links. For ranking an algorithm has been applied which fetches more apt results for the user query.

0.021843962 = product of:
  0.043687925 = sum of:
    0.043687925 = product of:
      0.08737585 = sum of:
        0.08737585 = weight(_text_:engines in 1638) [ClassicSimilarity], result of:
          0.08737585 = score(doc=1638,freq=2.0), product of:
            0.25941864 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.051058397 = queryNorm
            0.33681408 = fieldWeight in 1638, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.046875 = fieldNorm(doc=1638)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The Web of Data keeps growing rapidly. However, the full exploitation of this large amount of structured data faces numerous challenges like usability, scalability, imprecise information needs and data change. We present Semplore, an IR-based system that aims at addressing these issues. Semplore supports intuitive faceted search and complex queries both on text and structured data. It combines imprecise keyword search and precise structured query in a unified ranking scheme. Scalable query processing is supported by leveraging inverted indexes traditionally used in IR systems. This is combined with a novel block-based index structure to support efficient index update when data changes. The experimental results show that Semplore is an efficient and effective system for searching the Web of Data and can be used as a basic infrastructure for Web-scale Semantic Web search engines.

0.021843962 = product of:
  0.043687925 = sum of:
    0.043687925 = product of:
      0.08737585 = sum of:
        0.08737585 = weight(_text_:engines in 4802) [ClassicSimilarity], result of:
          0.08737585 = score(doc=4802,freq=2.0), product of:
            0.25941864 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.051058397 = queryNorm
            0.33681408 = fieldWeight in 4802, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.046875 = fieldNorm(doc=4802)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The power of search is with no doubt one of the main aspects for the success of the Web. Currently available search engines on the Web allow to return results with a high precision. Nevertheless, if we limit our attention only to lookup search we are missing another important search task. In exploratory search, the user is willing not only to find documents relevant with respect to her query but she is also interested in learning, discovering and understanding novel knowledge on complex and sometimes unknown topics. In the paper we address this issue presenting LED, a web based system that aims to improve (lookup) Web search by enabling users to properly explore knowledge associated to her query. We rely on DBpedia to explore the semantics of keywords within the query thus suggesting potentially interesting related topics/keywords to the user.

0.018203301 = product of:
  0.036406603 = sum of:
    0.036406603 = product of:
      0.072813205 = sum of:
        0.072813205 = weight(_text_:engines in 3280) [ClassicSimilarity], result of:
          0.072813205 = score(doc=3280,freq=2.0), product of:
            0.25941864 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.051058397 = queryNorm
            0.2806784 = fieldWeight in 3280, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3280)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This publication shows how the gap between the HTML based internet and the RDF based vision of the semantic web might be bridged, by linking words in texts to concepts of ontologies. Most current search engines use indexes that are built at the syntactical level and return hits based on simple string comparisons. However, the indexes do not contain synonyms, cannot differentiate between homonyms ('mouse' as a pointing vs. 'mouse' as an animal) and users receive different search results when they use different conjugation forms of the same word. In this publication, we present a system that uses ontologies and Natural Language Processing techniques to index texts, and thus supports word sense disambiguation and the retrieval of texts that contain equivalent words, by indexing them to concepts of ontologies. For this purpose, we developed fully automated methods for mapping equivalent concepts of imported RDF ontologies (for this prototype WordNet, SUMO and OpenCyc). These methods will thus allow the seamless integration of domain specific ontologies for concept based information retrieval in different domains. To demonstrate the practical workability of this approach, a set of web pages that contain synonyms and homonyms were indexed and can be queried via a search engine like query frontend. However, the ontology based indexing approach can also be used for other data mining applications such text clustering, relation mining and for searching free text fields in biological databases. The ontology alignment methods and some of the text mining principles described in this publication are now incorporated into the ONDEX system http://ondex.sourceforge.net/.

0.018203301 = product of:
  0.036406603 = sum of:
    0.036406603 = product of:
      0.072813205 = sum of:
        0.072813205 = weight(_text_:engines in 4317) [ClassicSimilarity], result of:
          0.072813205 = score(doc=4317,freq=2.0), product of:
            0.25941864 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.051058397 = queryNorm
            0.2806784 = fieldWeight in 4317, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0390625 = fieldNorm(doc=4317)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Information Retrieval [IR] is the science of searching for documents, for information within documents, and for metadata about documents, as well as that of searching relational databases and the World Wide Web. This paper describes a document representation method instead of keywords ontological descriptors. The purpose of this paper is to propose a system for content-based querying of texts based on the availability of ontology for the concepts in the text domain and to develop new Indexing methods to improve RSV (Retrieval status value). There is a need for querying ontologies at various granularities to retrieve information from various sources to suit the requirements of Semantic web, to eradicate the mismatch between user request and response from the Information Retrieval system. Most of the search engines use indexes that are built at the syntactical level and return hits based on simple string comparisons. The indexes do not contain synonyms, cannot differentiate between homonyms and users receive different search results when they use different conjugation forms of the same word.

0.018203301 = product of:
  0.036406603 = sum of:
    0.036406603 = product of:
      0.072813205 = sum of:
        0.072813205 = weight(_text_:engines in 264) [ClassicSimilarity], result of:
          0.072813205 = score(doc=264,freq=2.0), product of:
            0.25941864 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.051058397 = queryNorm
            0.2806784 = fieldWeight in 264, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0390625 = fieldNorm(doc=264)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Using semantic web search engines, such as Watson, Swoogle or Sindice, to find ontologies is a complex exploratory activity. It generally requires formulating multiple queries, browsing pages of results, and assessing the returned ontologies against each other to obtain a relevant and adequate subset of ontologies for the intended use. Our hypothesis is that at least some of the difficulties related to searching ontologies stem from the lack of structure in the search results, where ontologies that are implicitly related to each other are presented as disconnected and shown on different result pages. In earlier publications we presented a software framework, Kannel, which is able to automatically detect and make explicit relationships between ontologies in large ontology repositories. In this paper, we present a study that compares the use of the Watson ontology search engine with an extension,Watson+Kannel, which provides information regarding the various relationships occurring between the result ontologies. We evaluate Watson+Kannel by demonstrating through various indicators that explicit relationships between ontologies improve users' efficiency in ontology search, thus validating our hypothesis.

0.018203301 = product of:
  0.036406603 = sum of:
    0.036406603 = product of:
      0.072813205 = sum of:
        0.072813205 = weight(_text_:engines in 2801) [ClassicSimilarity], result of:
          0.072813205 = score(doc=2801,freq=2.0), product of:
            0.25941864 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.051058397 = queryNorm
            0.2806784 = fieldWeight in 2801, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2801)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The book covers multimedia ontology in heritage preservation with intellectual explorations of various themes of Indian cultural heritage. The result of more than 15 years of collective research, Multimedia Ontology: Representation and Applications provides a theoretical foundation for understanding the nature of media data and the principles involved in its interpretation. The book presents a unified approach to recent advances in multimedia and explains how a multimedia ontology can fill the semantic gap between concepts and the media world. It relays real-life examples of implementations in different domains to illustrate how this gap can be filled. The book contains information that helps with building semantic, content-based search and retrieval engines and also with developing vertical application-specific search applications. It guides you in designing multimedia tools that aid in logical and conceptual organization of large amounts of multimedia data. As a practical demonstration, it showcases multimedia applications in cultural heritage preservation efforts and the creation of virtual museums. The book describes the limitations of existing ontology techniques in semantic multimedia data processing, as well as some open problems in the representations and applications of multimedia ontology. As an antidote, it introduces new ontology representation and reasoning schemes that overcome these limitations. The long, compiled efforts reflected in Multimedia Ontology: Representation and Applications are a signpost for new achievements and developments in efficiency and accessibility in the field.

0.018203301 = product of:
  0.036406603 = sum of:
    0.036406603 = product of:
      0.072813205 = sum of:
        0.072813205 = weight(_text_:engines in 5864) [ClassicSimilarity], result of:
          0.072813205 = score(doc=5864,freq=2.0), product of:
            0.25941864 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.051058397 = queryNorm
            0.2806784 = fieldWeight in 5864, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5864)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Current retrieval and recommendation approaches rely on hard-wired data models. This hinders personalized cus-tomizations to meet information needs of users in a more flexible manner. Therefore, the paper investigates how similarity-basedretrieval strategies can be combined with graph queries to enable users or system providers to explore repositories in the LinkedOpen Data (LOD) cloud more thoroughly. For this purpose, we developed novel content-based recommendation approaches.They rely on concept annotations of Simple Knowledge Organization System (SKOS) vocabularies and a SPARQL-based querylanguage that facilitates advanced and personalized requests for openly available knowledge graphs. We have comprehensivelyevaluated the novel search strategies in several test cases and example application domains (i.e., travel search and multimediaretrieval). The results of the web-based online experiments showed that our approaches increase the recall and diversity of rec-ommendations or at least provide a competitive alternative strategy of resource access when conventional methods do not providehelpful suggestions. The findings may be of use for Linked Data-enabled recommender systems (LDRS) as well as for semanticsearch engines that can consume LOD resources. (PDF) Similarity-based knowledge graph queries for recommendation retrieval. Available from: https://www.researchgate.net/publication/333358714_Similarity-based_knowledge_graph_queries_for_recommendation_retrieval [accessed May 21 2020].

0.01802035 = product of:
  0.0360407 = sum of:
    0.0360407 = product of:
      0.0720814 = sum of:
        0.0720814 = weight(_text_:engines in 517) [ClassicSimilarity], result of:
          0.0720814 = score(doc=517,freq=4.0), product of:
            0.25941864 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.051058397 = queryNorm
            0.27785745 = fieldWeight in 517, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.02734375 = fieldNorm(doc=517)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Content

"Textual content-based search engines for the web have a number of limitations. Firstly, many web resources have little or no textual content (images, audio or video streams etc.) Secondly, precision is low where natural language terms have overloaded meaning (e.g. 'bank', 'watch', 'chip' etc.) Thirdly, recall is incomplete where the search does not take account of synonyms or quasi-synonyms. Fourthly, there is no basis for assisting a user in modifying (expanding, refining, translating) a search based on the meaning of the original search. Fifthly, there is no basis for searching across natural languages, or framing search queries in terms of symbolic languages. The Semantic Web is a framework for creating, managing, publishing and searching semantically rich metadata for web resources. Annotating web resources with precise and meaningful statements about conceptual aspects of their content provides a basis for overcoming all of the limitations of textual content-based search engines listed above. Creating this type of metadata requires that metadata generators are able to refer to shared repositories of meaning: 'vocabularies' of concepts that are common to a community, and describe the domain of interest for that community.

0.01729427 = product of:
  0.03458854 = sum of:
    0.03458854 = product of:
      0.06917708 = sum of:
        0.06917708 = weight(_text_:22 in 6089) [ClassicSimilarity], result of:
          0.06917708 = score(doc=6089,freq=2.0), product of:
            0.17879781 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051058397 = 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.01729427 = product of:
  0.03458854 = sum of:
    0.03458854 = product of:
      0.06917708 = sum of:
        0.06917708 = weight(_text_:22 in 5576) [ClassicSimilarity], result of:
          0.06917708 = score(doc=5576,freq=2.0), product of:
            0.17879781 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051058397 = 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.01729427 = product of:
  0.03458854 = sum of:
    0.03458854 = product of:
      0.06917708 = sum of:
        0.06917708 = weight(_text_:22 in 539) [ClassicSimilarity], result of:
          0.06917708 = score(doc=539,freq=2.0), product of:
            0.17879781 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051058397 = 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

0.01729427 = product of:
  0.03458854 = sum of:
    0.03458854 = product of:
      0.06917708 = sum of:
        0.06917708 = weight(_text_:22 in 3406) [ClassicSimilarity], result of:
          0.06917708 = score(doc=3406,freq=2.0), product of:
            0.17879781 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051058397 = queryNorm
            0.38690117 = fieldWeight in 3406, 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=3406)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

30. 5.2010 16:22:35