Search (69 results, page 1 of 4)

  • × theme_ss:"Automatisches Indexieren"
  1. Stankovic, R. et al.: Indexing of textual databases based on lexical resources : a case study for Serbian (2016) 0.07 
    0.069925636 = product of:
  0.13985127 = sum of:
    0.13985127 = sum of:
      0.06940146 = weight(_text_:search in 2759) [ClassicSimilarity], result of:
        0.06940146 = score(doc=2759,freq=2.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.3840117 = fieldWeight in 2759, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.078125 = fieldNorm(doc=2759)
      0.07044981 = weight(_text_:22 in 2759) [ClassicSimilarity], result of:
        0.07044981 = score(doc=2759,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.38690117 = fieldWeight in 2759, 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=2759)
  0.5 = coord(1/2)
    Date
    1. 2.2016 18:25:22
    Source
    Semantic keyword-based search on structured data sources: First COST Action IC1302 International KEYSTONE Conference, IKC 2015, Coimbra, Portugal, September 8-9, 2015. Revised Selected Papers. Eds.: J. Cardoso et al
  2. Hodges, P.R.: Keyword in title indexes : effectiveness of retrieval in computer searches (1983) 0.05 
    0.048947945 = product of:
  0.09789589 = sum of:
    0.09789589 = sum of:
      0.048581023 = weight(_text_:search in 5001) [ClassicSimilarity], result of:
        0.048581023 = score(doc=5001,freq=2.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.2688082 = fieldWeight in 5001, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.0546875 = fieldNorm(doc=5001)
      0.049314864 = weight(_text_:22 in 5001) [ClassicSimilarity], result of:
        0.049314864 = score(doc=5001,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.2708308 = fieldWeight in 5001, 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=5001)
  0.5 = coord(1/2)
    Abstract
    A study was done to test the effectiveness of retrieval using title word searching. It was based on actual search profiles used in the Mechanized Information Center at Ohio State University, in order ro replicate as closely as possible actual searching conditions. Fewer than 50% of the relevant titles were retrieved by keywords in titles. The low rate of retrieval can be attributes to three sources: titles themselves, user and information specialist ignorance of the subject vocabulary in use, and to general language problems. Across fields it was found that the social sciences had the best retrieval rate, with science having the next best, and arts and humanities the lowest. Ways to enhance and supplement keyword in title searching on the computer and in printed indexes are discussed.
    Date
    14. 3.1996 13:22:21
  3. Milstead, J.L.: Thesauri in a full-text world (1998) 0.03 
    0.034962818 = product of:
  0.069925636 = sum of:
    0.069925636 = sum of:
      0.03470073 = weight(_text_:search in 2337) [ClassicSimilarity], result of:
        0.03470073 = score(doc=2337,freq=2.0), product of:
          0.18072747 = queryWeight, product of:
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.051997773 = queryNorm
          0.19200584 = fieldWeight in 2337, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.475677 = idf(docFreq=3718, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2337)
      0.035224903 = weight(_text_:22 in 2337) [ClassicSimilarity], result of:
        0.035224903 = score(doc=2337,freq=2.0), product of:
          0.18208735 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051997773 = queryNorm
          0.19345059 = fieldWeight in 2337, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2337)
  0.5 = coord(1/2)
    Abstract
    Despite early claims to the contemporary, thesauri continue to find use as access tools for information in the full-text environment. Their mode of use is changing, but this change actually represents an expansion rather than a contrdiction of their utility. Thesauri and similar vocabulary tools can complement full-text access by aiding users in focusing their searches, by supplementing the linguistic analysis of the text search engine, and even by serving as one of the tools used by the linguistic engine for its analysis. While human indexing contunues to be used for many databases, the trend is to increase the use of machine aids for this purpose. All machine-aided indexing (MAI) systems rely on thesauri as the basis for term selection. In the 21st century, the balance of effort between human and machine will change at both input and output, but thesauri will continue to play an important role for the foreseeable future
    Date
    22. 9.1997 19:16:05
  4. Voorhees, E.M.: Implementing agglomerative hierarchic clustering algorithms for use in document retrieval (1986) 0.03 
    0.028179923 = product of:
  0.056359846 = sum of:
    0.056359846 = product of:
      0.11271969 = sum of:
        0.11271969 = weight(_text_:22 in 402) [ClassicSimilarity], result of:
          0.11271969 = score(doc=402,freq=2.0), product of:
            0.18208735 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051997773 = queryNorm
            0.61904186 = fieldWeight in 402, 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=402)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Source
    Information processing and management. 22(1986) no.6, S.465-476
  5. Salton, G.; Wong, A.: Generation and search of clustered files (1978) 0.03 
    0.027760584 = product of:
  0.055521168 = sum of:
    0.055521168 = product of:
      0.111042336 = sum of:
        0.111042336 = weight(_text_:search in 2411) [ClassicSimilarity], result of:
          0.111042336 = score(doc=2411,freq=2.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.6144187 = fieldWeight in 2411, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.125 = fieldNorm(doc=2411)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
  6. Sparck Jones, K.; Tait, J.I.: Automatic search term variant generation (1984) 0.03 
    0.027760584 = product of:
  0.055521168 = sum of:
    0.055521168 = product of:
      0.111042336 = sum of:
        0.111042336 = weight(_text_:search in 2918) [ClassicSimilarity], result of:
          0.111042336 = score(doc=2918,freq=2.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.6144187 = fieldWeight in 2918, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.125 = fieldNorm(doc=2918)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
  7. Molto, M.: Improving full text search performance through textual analysis (1993) 0.03 
    0.027760584 = product of:
  0.055521168 = sum of:
    0.055521168 = product of:
      0.111042336 = sum of:
        0.111042336 = weight(_text_:search in 5099) [ClassicSimilarity], result of:
          0.111042336 = score(doc=5099,freq=8.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.6144187 = fieldWeight in 5099, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0625 = fieldNorm(doc=5099)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Explores the potential of text analysis as a tool in full text search and design improvement. Reports on a trial analysis performed in the domain of family history. The findings offered insights into possible gains and losses in using one search or design strategy versus another and strong evidence was provided to the potential of text analysis. Makes search and design recommendation
  8. Stegentritt, E.: Evaluationsresultate des mehrsprachigen Suchsystems CANAL/LS (1998) 0.03 
    0.027760584 = product of:
  0.055521168 = sum of:
    0.055521168 = product of:
      0.111042336 = sum of:
        0.111042336 = weight(_text_:search in 7216) [ClassicSimilarity], result of:
          0.111042336 = score(doc=7216,freq=8.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.6144187 = fieldWeight in 7216, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0625 = fieldNorm(doc=7216)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The search system CANAL/LS simplifies the searching of library catalogues by analyzing search questions linguistically and translating them if required. The linguistic analysis reduces the search question words to their basic forms so that they can be compared with basic title forms. Consequently all variants of words and parts of compounds in German can be found. Presents the results of an analysis of search questions in a catalogue of 45.000 titles in the field of psychology
  9. Zhitomirsky-Geffet, M.; Prebor, G.; Bloch, O.: Improving proverb search and retrieval with a generic multidimensional ontology (2017) 0.03 
    0.027542854 = product of:
  0.055085707 = sum of:
    0.055085707 = product of:
      0.110171415 = sum of:
        0.110171415 = weight(_text_:search in 3320) [ClassicSimilarity], result of:
          0.110171415 = score(doc=3320,freq=14.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.6095997 = fieldWeight in 3320, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.046875 = fieldNorm(doc=3320)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    The goal of this research is to develop a generic ontological model for proverbs that unifies potential classification criteria and various characteristics of proverbs to enable their effective retrieval and large-scale analysis. Because proverbs can be described and indexed by multiple characteristics and criteria, we built a multidimensional ontology suitable for proverb classification. To evaluate the effectiveness of the constructed ontology for improving search and retrieval of proverbs, a large-scale user experiment was arranged with 70 users who were asked to search a proverb repository using ontology-based and free-text search interfaces. The comparative analysis of the results shows that the use of this ontology helped to substantially improve the search recall, precision, user satisfaction, and efficiency and to minimize user effort during the search process. A practical contribution of this work is an automated web-based proverb search and retrieval system which incorporates the proposed ontological scheme and an initial corpus of ontology-based annotated proverbs.
  10. Search Engines and Beyond : Developing efficient knowledge management systems, April 19-20 1999, Boston, Mass (1999) 0.03 
    0.025023052 = product of:
  0.050046105 = sum of:
    0.050046105 = product of:
      0.10009221 = sum of:
        0.10009221 = weight(_text_:search in 2596) [ClassicSimilarity], result of:
          0.10009221 = score(doc=2596,freq=26.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.55382955 = fieldWeight in 2596, product of:
              5.0990195 = tf(freq=26.0), with freq of:
                26.0 = termFreq=26.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.03125 = fieldNorm(doc=2596)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    This series of meetings originated in Albuquerque, New Mexico in 1995. This inaugural meeting (part of an ASIDIC series) was transplanted to Bath in England (1996 and 1997) and then to Boston, Massachusetts (1998 and 1999). The Search Engines Meetings bring together commercial search engine developers, academics and corporate professionals to learn from each other. Infonortics, sponsor of meetings post-1995 with Ev Brenner, plans to continue the same success in Boston in 2000.
    Content
    Ramana Rao (Inxight, Palo Alto, CA) 7 ± 2 Insights on achieving Effective Information Access Session One: Updates and a twelve month perspective Danny Sullivan (Search Engine Watch, US / England) Portalization and other search trends Carol Tenopir (University of Tennessee) Search realities faced by end users and professional searchers Session Two: Today's search engines and beyond Daniel Hoogterp (Retrieval Technologies, McLean, VA) Effective presentation and utilization of search techniques Rick Kenny (Fulcrum Technologies, Ontario, Canada) Beyond document clustering: The knowledge impact statement Gary Stock (Ingenius, Kalamazoo, MI) Automated change monitoring Gary Culliss (Direct Hit, Wellesley Hills, MA) User popularity ranked search engines Byron Dom (IBM, CA) Automatically finding the best pages on the World Wide Web (CLEVER) Peter Tomassi (LookSmart, San Francisco, CA) Adding human intellect to search technology Session Three: Panel discussion: Human v automated categorization and editing Ev Brenner (New York, NY)- Chairman James Callan (University of Massachusetts, MA) Marc Krellenstein (Northern Light Technology, Cambridge, MA) Dan Miller (Ask Jeeves, Berkeley, CA) Session Four: Updates and a twelve month perspective Steve Arnold (AIT, Harrods Creek, KY) Review: The leading edge in search and retrieval software Ellen Voorhees (NIST, Gaithersburg, MD) TREC update Session Five: Search engines now and beyond Intelligent Agents John Snyder (Muscat, Cambridge, England) Practical issues behind intelligent agents Text summarization Therese Firmin, (Dept of Defense, Ft George G. Meade, MD) The TIPSTER/SUMMAC evaluation of automatic text summarization systems Cross language searching Elizabeth Liddy (TextWise, Syracuse, NY) A conceptual interlingua approach to cross-language retrieval. Video search and retrieval Armon Amir (IBM, Almaden, CA) CueVideo: Modular system for automatic indexing and browsing of video/audio Speech recognition Michael Witbrock (Lycos, Waltham, MA) Retrieval of spoken documents Visualization James A. Wise (Integral Visuals, Richland, WA) Information visualization in the new millennium: Emerging science or passing fashion? Text mining David Evans (Claritech, Pittsburgh, PA) Text mining - towards decision support
  11. Fuhr, N.; Niewelt, B.: ¬Ein Retrievaltest mit automatisch indexierten Dokumenten (1984) 0.02 
    0.024657432 = product of:
  0.049314864 = sum of:
    0.049314864 = product of:
      0.09862973 = sum of:
        0.09862973 = weight(_text_:22 in 262) [ClassicSimilarity], result of:
          0.09862973 = score(doc=262,freq=2.0), product of:
            0.18208735 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051997773 = queryNorm
            0.5416616 = fieldWeight in 262, 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=262)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Date
    20.10.2000 12:22:23
  12. Hlava, M.M.K.: Automatic indexing : comparing rule-based and statistics-based indexing systems (2005) 0.02 
    0.024657432 = product of:
  0.049314864 = sum of:
    0.049314864 = product of:
      0.09862973 = sum of:
        0.09862973 = weight(_text_:22 in 6265) [ClassicSimilarity], result of:
          0.09862973 = score(doc=6265,freq=2.0), product of:
            0.18208735 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051997773 = queryNorm
            0.5416616 = fieldWeight in 6265, 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=6265)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Source
    Information outlook. 9(2005) no.8, S.22-23
  13. Kajanan, S.; Bao, Y.; Datta, A.; VanderMeer, D.; Dutta, K.: Efficient automatic search query formulation using phrase-level analysis (2014) 0.02 
    0.024041371 = product of:
  0.048082743 = sum of:
    0.048082743 = product of:
      0.096165486 = sum of:
        0.096165486 = weight(_text_:search in 1264) [ClassicSimilarity], result of:
          0.096165486 = score(doc=1264,freq=24.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.5321022 = fieldWeight in 1264, product of:
              4.8989797 = tf(freq=24.0), with freq of:
                24.0 = termFreq=24.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.03125 = fieldNorm(doc=1264)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Over the past decade, the volume of information available digitally over the Internet has grown enormously. Technical developments in the area of search, such as Google's Page Rank algorithm, have proved so good at serving relevant results that Internet search has become integrated into daily human activity. One can endlessly explore topics of interest simply by querying and reading through the resulting links. Yet, although search engines are well known for providing relevant results based on users' queries, users do not always receive the results they are looking for. Google's Director of Research describes clickstream evidence of frustrated users repeatedly reformulating queries and searching through page after page of results. Given the general quality of search engine results, one must consider the possibility that the frustrated user's query is not effective; that is, it does not describe the essence of the user's interest. Indeed, extensive research into human search behavior has found that humans are not very effective at formulating good search queries that describe what they are interested in. Ideally, the user should simply point to a portion of text that sparked the user's interest, and a system should automatically formulate a search query that captures the essence of the text. In this paper, we describe an implemented system that provides this capability. We first describe how our work differs from existing work in automatic query formulation, and propose a new method for improved quantification of the relevance of candidate search terms drawn from input text using phrase-level analysis. We then propose an implementable method designed to provide relevant queries based on a user's text input. We demonstrate the quality of our results and performance of our system through experimental studies. Our results demonstrate that our system produces relevant search terms with roughly two-thirds precision and recall compared to search terms selected by experts, and that typical users find significantly more relevant results (31% more relevant) more quickly (64% faster) using our system than self-formulated search queries. Further, we show that our implementation can scale to request loads of up to 10 requests per second within current online responsiveness expectations (<2-second response times at the highest loads tested).
  14. Fuhr, N.: Ranking-Experimente mit gewichteter Indexierung (1986) 0.02 
    0.02113494 = product of:
  0.04226988 = sum of:
    0.04226988 = product of:
      0.08453976 = sum of:
        0.08453976 = weight(_text_:22 in 58) [ClassicSimilarity], result of:
          0.08453976 = score(doc=58,freq=2.0), product of:
            0.18208735 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051997773 = queryNorm
            0.46428138 = fieldWeight in 58, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=58)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Date
    14. 6.2015 22:12:44
  15. Hauer, M.: Automatische Indexierung (2000) 0.02 
    0.02113494 = product of:
  0.04226988 = sum of:
    0.04226988 = product of:
      0.08453976 = sum of:
        0.08453976 = weight(_text_:22 in 5887) [ClassicSimilarity], result of:
          0.08453976 = score(doc=5887,freq=2.0), product of:
            0.18208735 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051997773 = queryNorm
            0.46428138 = fieldWeight in 5887, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=5887)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Source
    Wissen in Aktion: Wege des Knowledge Managements. 22. Online-Tagung der DGI, Frankfurt am Main, 2.-4.5.2000. Proceedings. Hrsg.: R. Schmidt
  16. Fuhr, N.: Rankingexperimente mit gewichteter Indexierung (1986) 0.02 
    0.02113494 = product of:
  0.04226988 = sum of:
    0.04226988 = product of:
      0.08453976 = sum of:
        0.08453976 = weight(_text_:22 in 2051) [ClassicSimilarity], result of:
          0.08453976 = score(doc=2051,freq=2.0), product of:
            0.18208735 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051997773 = queryNorm
            0.46428138 = fieldWeight in 2051, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=2051)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Date
    14. 6.2015 22:12:56
  17. Hauer, M.: Tiefenindexierung im Bibliothekskatalog : 17 Jahre intelligentCAPTURE (2019) 0.02 
    0.02113494 = product of:
  0.04226988 = sum of:
    0.04226988 = product of:
      0.08453976 = sum of:
        0.08453976 = weight(_text_:22 in 5629) [ClassicSimilarity], result of:
          0.08453976 = score(doc=5629,freq=2.0), product of:
            0.18208735 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051997773 = queryNorm
            0.46428138 = fieldWeight in 5629, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=5629)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Source
    B.I.T.online. 22(2019) H.2, S.163-166
  18. Salton, G.; Araya, J.: On the use of clustered file organizations in information search and retrieval (1990) 0.02 
    0.020820437 = product of:
  0.041640874 = sum of:
    0.041640874 = product of:
      0.08328175 = sum of:
        0.08328175 = weight(_text_:search in 2409) [ClassicSimilarity], result of:
          0.08328175 = score(doc=2409,freq=2.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.460814 = fieldWeight in 2409, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.09375 = fieldNorm(doc=2409)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
  19. Salton, G.: Fast document classification in automatic information retrieval (1978) 0.02 
    0.019629696 = product of:
  0.039259393 = sum of:
    0.039259393 = product of:
      0.078518786 = sum of:
        0.078518786 = weight(_text_:search in 2331) [ClassicSimilarity], result of:
          0.078518786 = score(doc=2331,freq=4.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.43445963 = fieldWeight in 2331, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0625 = fieldNorm(doc=2331)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    A classified or clustered file is one where related or similar records are grouped into classes or clusters of items in such a way that all itmes within a cluster are jointly retrievable. Clustered files are easily adapted to to broad and narrow search strategies, and simple file updating methods are available. An inexpensive file clustering method applicable to large files is given together with appropriate file search methods
  20. Samstag-Schnock, U.; Meadow, C.T.: PBS: an ecomical natural language query interpreter (1993) 0.02 
    0.019629696 = product of:
  0.039259393 = sum of:
    0.039259393 = product of:
      0.078518786 = sum of:
        0.078518786 = weight(_text_:search in 5091) [ClassicSimilarity], result of:
          0.078518786 = score(doc=5091,freq=4.0), product of:
            0.18072747 = queryWeight, product of:
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.051997773 = queryNorm
            0.43445963 = fieldWeight in 5091, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.475677 = idf(docFreq=3718, maxDocs=44218)
              0.0625 = fieldNorm(doc=5091)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Abstract
    Reports on the design and implementation of the information searching and retrieval software, PBS (Parsing, Boolean recognition, Stemming) for the front end OAK 2, a new version of OAK developed at Toronto Univ. OAK 2 is a research tool for user behaviour studies. PBS receives natural language search statements from an end user and identifies search facets and implied Boolean logic operators

Authors

Years

Languages

  • e 50
  • d 17
  • f 1
  • ru 1
  • More… Less…

Types

  • a 62
  • el 4
  • x 2
  • m 1
  • s 1
  • More… Less…

Themes