Search (36 results, page 1 of 2)

  • × year_i:[1990 TO 2000}
  • × theme_ss:"Computerlinguistik"
  1. Brenner, E.H.: Beyond Boolean : new approaches in information retrieval; the quest for intuitive online search systems past, present & future (1995) 0.09 
    0.08769246 = product of:
  0.13153869 = sum of:
    0.08135357 = weight(_text_:search in 2547) [ClassicSimilarity], result of:
      0.08135357 = score(doc=2547,freq=6.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.46558946 = fieldWeight in 2547, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0546875 = fieldNorm(doc=2547)
    0.05018513 = product of:
      0.10037026 = sum of:
        0.10037026 = weight(_text_:engines in 2547) [ClassicSimilarity], result of:
          0.10037026 = score(doc=2547,freq=2.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.39294976 = fieldWeight in 2547, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2547)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    The challenge of effectively bringing specific, relevant information from the global sea of data to our fingertips, has become an increasingly difficult one. Discusses how the online information industry, founded on Boolean search systems, may be evolving to take advantage of other methods, such as 'term weighting', 'relevance ranking' and 'query by example'
    Content
    (1) The Boolean world; (2) The Non-Boolean picture; (3) The commercial search engines: Personal Librarian, CLARIT, ConQuest, DR-LINK, InQuizit, InTEXT, TOPIC, WIN, TARGET, FREESTYLE, InfoSeek; (4) Wiedergabe von 8 Aufsätzen aus 'Monitor'
  2. Addison, E.R.; Wilson, H.D.; Feder, J.: ¬The impact of plain English searching on end users (1993) 0.07 
    0.074022576 = product of:
  0.11103386 = sum of:
    0.053679425 = weight(_text_:search in 5354) [ClassicSimilarity], result of:
      0.053679425 = score(doc=5354,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.30720934 = fieldWeight in 5354, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0625 = fieldNorm(doc=5354)
    0.057354435 = product of:
      0.11470887 = sum of:
        0.11470887 = weight(_text_:engines in 5354) [ClassicSimilarity], result of:
          0.11470887 = score(doc=5354,freq=2.0), product of:
            0.25542772 = queryWeight, product of:
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.05027291 = queryNorm
            0.44908544 = fieldWeight in 5354, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.080822 = idf(docFreq=746, maxDocs=44218)
              0.0625 = fieldNorm(doc=5354)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Commercial software products are available with plain English searching capabilities as engines for online and CD-ROM information services, and for internal text information management. With plain English interfaces, end users do not need to master the keyword and connector approach of the Boolean search query language. Describes plain English searching and its impact on the process of full text retrieval. Explores the issues of ease of use, reliability and implications for the total research process
  3. Prasad, A.R.D.; Kar, B.B.: Parsing Boolean search expression using definite clause grammars (1994) 0.04 
    0.035786286 = product of:
  0.10735885 = sum of:
    0.10735885 = weight(_text_:search in 8188) [ClassicSimilarity], result of:
      0.10735885 = score(doc=8188,freq=8.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.6144187 = fieldWeight in 8188, 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=8188)
  0.33333334 = coord(1/3)
    Abstract
    Briefly discusses the role of search languages in information retrieval and broadly groups the search languages into 4 categories. Explains the idea of definite clause grammars and demonstrates how parsers for Boolean logic-based search languages can easily be developed. Presents a partial Prolog code of the parser that was used in an object-oriented bibliographic database management system
  4. Krueger, S.: Getting more out of NEXIS (1996) 0.03 
    0.031630907 = product of:
  0.09489272 = sum of:
    0.09489272 = weight(_text_:search in 4512) [ClassicSimilarity], result of:
      0.09489272 = score(doc=4512,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.54307455 = fieldWeight in 4512, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.078125 = fieldNorm(doc=4512)
  0.33333334 = coord(1/3)
    Abstract
    The MORE search command on the LEXIS/NEXIS online databses analyzes the words in a retrieved document, selects and creates a FREESTYLE search, and retrieves th 25 most relevant documents. Shows how MORE works and gives advice about when and when not to use it
  5. Griffith, C.: FREESTYLE: LEXIS-NEXIS goes natural (1994) 0.03 
    0.031630907 = product of:
  0.09489272 = sum of:
    0.09489272 = weight(_text_:search in 2512) [ClassicSimilarity], result of:
      0.09489272 = score(doc=2512,freq=4.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.54307455 = fieldWeight in 2512, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.078125 = fieldNorm(doc=2512)
  0.33333334 = coord(1/3)
    Abstract
    Describes FREESTYLE, the associative language search engine, developed by Mead Data Central for its LEXIS/NEXIS online service. The special feature of the associative language in FREESTYLE allows users to enter search descriptions in plain English
  6. Hsinchun, C.: Knowledge-based document retrieval framework and design (1992) 0.03 
    0.030991834 = product of:
  0.0929755 = sum of:
    0.0929755 = weight(_text_:search in 6686) [ClassicSimilarity], result of:
      0.0929755 = score(doc=6686,freq=6.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.5321022 = fieldWeight in 6686, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0625 = fieldNorm(doc=6686)
  0.33333334 = coord(1/3)
    Abstract
    Presents research on the design of knowledge-based document retrieval systems in which a semantic network was adopted to represent subject knowledge and classification scheme knowledge and experts' search strategies and user modelling capability were modelled as procedural knowledge. These functionalities were incorporated into a prototype knowledge-based retrieval system, Metacat. Describes a system, the design of which was based on the blackboard architecture, which was able to create a user profile, identify task requirements, suggest heuristics-based search strategies, perform semantic-based search assistance, and assist online query refinement
  7. Frappaolo, C.: Artificial intelligence and text retrieval : a current perspective on the state of the art (1992) 0.02 
    0.022366427 = product of:
  0.06709928 = sum of:
    0.06709928 = weight(_text_:search in 7097) [ClassicSimilarity], result of:
      0.06709928 = score(doc=7097,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.3840117 = fieldWeight in 7097, 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=7097)
  0.33333334 = coord(1/3)
    Abstract
    Brief discussion of the ways in which computerized information retrieval and database searching can be enhanced by integrating artificial intelligence with such search systems. Explores the possibility of integrating the powers and capabilities of artificial intelligence (specifically natural language processing) with text retrieval
  8. Ferber, R.; Wettler, M.; Rapp, R.: ¬An associative model of word selection in the generation of search queries (1995) 0.02 
    0.019369897 = product of:
  0.058109686 = sum of:
    0.058109686 = weight(_text_:search in 3177) [ClassicSimilarity], result of:
      0.058109686 = score(doc=3177,freq=6.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.33256388 = fieldWeight in 3177, product of:
          2.4494898 = tf(freq=6.0), with freq of:
            6.0 = termFreq=6.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0390625 = fieldNorm(doc=3177)
  0.33333334 = coord(1/3)
    Abstract
    To generate a search query based on an end user request, a database searcher has to select appropriate search terms. These terms can either be taken from the request, or they can be added by the searcher. This selection process is simulated by an associative lexical net; the nodes of the net are the terms used in 94 records of written requests to a psychological information agency and the respective online searches. The weights connecting the nodes are calculated from the co-occurrences of these terms in the abstracts of the database PsycLit. To simulate the term selection process of a query, the nodes of all terms used in the written requests are activated, and 1 or more spreading activation cycles are performed. The result of the simulation is a ranking of the terms according to the activities of their nodes. Simulations for all 94 records show a low mean activity rank for the terms selected from the request; the mean activity rank for new terms added by the searcher is lower than the mean activity rank for thode terms of the request that were not used in the query
  9. Pritchard-Schoch, T.: Comparing natural language retrieval : Win & Freestyle (1995) 0.02 
    0.017893143 = product of:
  0.053679425 = sum of:
    0.053679425 = weight(_text_:search in 2546) [ClassicSimilarity], result of:
      0.053679425 = score(doc=2546,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.30720934 = fieldWeight in 2546, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0625 = fieldNorm(doc=2546)
  0.33333334 = coord(1/3)
    Abstract
    Reports on a comparison of 2 natural language interfaces to full text legal databases: WIN for access to WESTLAW databases and FREESTYLE for access to the LEXIS database. 30 legal issues in natural langugae queries were presented to identical libraries in both systems. The top 20 ranked documents from each search were analyzed and reviewed for relevance to the legal issue
  10. Pritchard-Schoch, T.: Natural language comes of age (1993) 0.02 
    0.017893143 = product of:
  0.053679425 = sum of:
    0.053679425 = weight(_text_:search in 2570) [ClassicSimilarity], result of:
      0.053679425 = score(doc=2570,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.30720934 = fieldWeight in 2570, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0625 = fieldNorm(doc=2570)
  0.33333334 = coord(1/3)
    Abstract
    Discusses natural languages and the natural language implementations of Westlaw's full-text legal documents, Westlaw Is Natural. Natural language is not aritificial intelligence but a hybrid of linguistics, mathematics and statistics. Provides 3 classes of retrieval models. Explains how Westlaw processes an English query. Assesses WIN. Covers WIN enhancements; the natural language features of Congressional Quarterly's Washington Alert using a document for a query; the personal librarian front end search software and Dowquest from Dow Jones news/retrieval. Conmsiders whether natural language encourages fuzzy thinking and whether Boolean logic will still be needed
  11. Frakes, W.B.: Stemming algorithms (1992) 0.02 
    0.017893143 = product of:
  0.053679425 = sum of:
    0.053679425 = weight(_text_:search in 3503) [ClassicSimilarity], result of:
      0.053679425 = score(doc=3503,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.30720934 = fieldWeight in 3503, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.0625 = fieldNorm(doc=3503)
  0.33333334 = coord(1/3)
    Abstract
    Desribes stemming algorithms - programs that relate morphologically similar indexing and search terms. Stemming is used to improve retrieval effectiveness and to reduce the size of indexing files. Several approaches to stemming are describes - table lookup, affix removal, successor variety, and n-gram. empirical studies of stemming are summarized. The Porter stemmer is described in detail, and a full implementation in C is presented
  12. McMahon, J.G.; Smith, F.J.: Improved statistical language model performance with automatic generated word hierarchies (1996) 0.02 
    0.015893001 = product of:
  0.047679 = sum of:
    0.047679 = product of:
      0.095358 = sum of:
        0.095358 = weight(_text_:22 in 3164) [ClassicSimilarity], result of:
          0.095358 = score(doc=3164,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.5416616 = fieldWeight in 3164, 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=3164)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Source
    Computational linguistics. 22(1996) no.2, S.217-248
  13. Ruge, G.: ¬A spreading activation network for automatic generation of thesaurus relationships (1991) 0.02 
    0.015893001 = product of:
  0.047679 = sum of:
    0.047679 = product of:
      0.095358 = sum of:
        0.095358 = weight(_text_:22 in 4506) [ClassicSimilarity], result of:
          0.095358 = score(doc=4506,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.5416616 = fieldWeight in 4506, 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=4506)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Date
    8.10.2000 11:52:22
  14. Somers, H.: Example-based machine translation : Review article (1999) 0.02 
    0.015893001 = product of:
  0.047679 = sum of:
    0.047679 = product of:
      0.095358 = sum of:
        0.095358 = weight(_text_:22 in 6672) [ClassicSimilarity], result of:
          0.095358 = score(doc=6672,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.5416616 = fieldWeight in 6672, 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=6672)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Date
    31. 7.1996 9:22:19
  15. New tools for human translators (1997) 0.02 
    0.015893001 = product of:
  0.047679 = sum of:
    0.047679 = product of:
      0.095358 = sum of:
        0.095358 = weight(_text_:22 in 1179) [ClassicSimilarity], result of:
          0.095358 = score(doc=1179,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.5416616 = fieldWeight in 1179, 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=1179)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Date
    31. 7.1996 9:22:19
  16. Baayen, R.H.; Lieber, H.: Word frequency distributions and lexical semantics (1997) 0.02 
    0.015893001 = product of:
  0.047679 = sum of:
    0.047679 = product of:
      0.095358 = sum of:
        0.095358 = weight(_text_:22 in 3117) [ClassicSimilarity], result of:
          0.095358 = score(doc=3117,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.5416616 = fieldWeight in 3117, 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=3117)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Date
    28. 2.1999 10:48:22
  17. Akman, K.I.: ¬A new text compression technique based on natural language structure (1995) 0.02 
    0.015656501 = product of:
  0.0469695 = sum of:
    0.0469695 = weight(_text_:search in 1860) [ClassicSimilarity], result of:
      0.0469695 = score(doc=1860,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.2688082 = fieldWeight in 1860, 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=1860)
  0.33333334 = coord(1/3)
    Abstract
    Describes a new data compression technique which utilizes some of the common structural characteristics of languages. The proposed algorithm partitions words into their roots and suffixes which are then replaced by shorter bit representations. The method used 3 dictionaries in the from of binary search trees and 1 character array. The first 2 dictionaries are for roots, and the third one is for suffixes. The character array is used for both searching compressible words and coding incompressible words. The number of bits in representing a substring depends on the number of the entries in the dictionary in which the substring is found. The proposed algorithm is implemented in the Turkish language and tested using 3 different text groups with different lenghts. Results indicate a compression factor of up to 47 per cent
  18. Greengrass, M.: Conflation methods for searching databases of Latin text (1996) 0.02 
    0.015656501 = product of:
  0.0469695 = sum of:
    0.0469695 = weight(_text_:search in 6987) [ClassicSimilarity], result of:
      0.0469695 = score(doc=6987,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.2688082 = fieldWeight in 6987, 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=6987)
  0.33333334 = coord(1/3)
    Abstract
    Describes the results of a project to develop conflation tools for searching databases of Latin text. Reports on the results of a questionnaire sent to 64 users of Latin text retrieval systems. Describes a Latin stemming algorithm that uses a simple longest match with some recoding but differs from most stemmers in its use of 2 separate suffix dictionaries for processing query and database words. Describes a retrieval system in which a user inputs the principal component of their search term, these components are stemmed and the resulting stems matched against the noun based and verb based stem dictionaries. Evaluates the system, describing its limitations, and a more complex system
  19. Mock, K.J.; Vemuri, V.R.: Information filtering via hill climbing, WordNet, and index patterns (1997) 0.02 
    0.015656501 = product of:
  0.0469695 = sum of:
    0.0469695 = weight(_text_:search in 1517) [ClassicSimilarity], result of:
      0.0469695 = score(doc=1517,freq=2.0), product of:
        0.1747324 = queryWeight, product of:
          3.475677 = idf(docFreq=3718, maxDocs=44218)
          0.05027291 = queryNorm
        0.2688082 = fieldWeight in 1517, 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=1517)
  0.33333334 = coord(1/3)
    Abstract
    The INFOS (Intelligent News Filtering Organizational System) project is designed to reduce the user's search burden by automatically categorising data as relevant or irrelevant based upon user interests. These predictions are learned automatically based upon features taken from input articles and collaborative features derived from other users. The filtering is performed by a hybrid technique that combines elements of a keyword-based hill climbing method, knowledge-based conceptual representation via WordNet, and partial parsing via index patterns. The hybrid systems integrating all these approaches combines the benefits of each while maintaing robustness and acalability
  20. Byrne, C.C.; McCracken, S.A.: ¬An adaptive thesaurus employing semantic distance, relational inheritance and nominal compound interpretation for linguistic support of information retrieval (1999) 0.01 
    0.013622571 = product of:
  0.040867712 = sum of:
    0.040867712 = product of:
      0.081735425 = sum of:
        0.081735425 = weight(_text_:22 in 4483) [ClassicSimilarity], result of:
          0.081735425 = score(doc=4483,freq=2.0), product of:
            0.17604718 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05027291 = queryNorm
            0.46428138 = fieldWeight in 4483, 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=4483)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Date
    15. 3.2000 10:22:37

Authors

Languages

  • e 33
  • d 3

Types

  • a 30
  • m 4
  • s 3
  • d 1
  • r 1
  • More… Less…

Themes

Subjects

Classifications