Search (3 results, page 1 of 1)

  • × theme_ss:"Retrievalalgorithmen"
  • × type_ss:"s"
  • × year_i:[1990 TO 2000}
  1. Information retrieval : data structures and algorithms (1992) 0.00 
    0.0018420455 = product of:
  0.003684091 = sum of:
    0.003684091 = product of:
      0.007368182 = sum of:
        0.007368182 = weight(_text_:s in 3495) [ClassicSimilarity], result of:
          0.007368182 = score(doc=3495,freq=12.0), product of:
            0.05008241 = queryWeight, product of:
              1.0872376 = idf(docFreq=40523, maxDocs=44218)
              0.046063907 = queryNorm
            0.14712115 = fieldWeight in 3495, product of:
              3.4641016 = tf(freq=12.0), with freq of:
                12.0 = termFreq=12.0
              1.0872376 = idf(docFreq=40523, maxDocs=44218)
              0.0390625 = fieldNorm(doc=3495)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Content
    An edited volume containing data structures and algorithms for information retrieval including a disk with examples written in C. for prgrammers and students interested in parsing text, automated indexing, its the first collection in book form of the basic data structures and algorithms that are critical to the storage and retrieval of documents. ------------------Enthält die Kapitel: FRAKES, W.B.: Introduction to information storage and retrieval systems; BAEZA-YATES, R.S.: Introduction to data structures and algorithms related to information retrieval; HARMAN, D. u.a.: Inverted files; FALOUTSOS, C.: Signature files; GONNET, G.H. u.a.: New indices for text: PAT trees and PAT arrays; FORD, D.A. u. S. CHRISTODOULAKIS: File organizations for optical disks; FOX, C.: Lexical analysis and stoplists; FRAKES, W.B.: Stemming algorithms; SRINIVASAN, P.: Thesaurus construction; BAEZA-YATES, R.A.: String searching algorithms; HARMAN, D.: Relevance feedback and other query modification techniques; WARTIK, S.: Boolean operators; WARTIK, S. u.a.: Hashing algorithms; HARMAN, D.: Ranking algorithms; FOX, E.: u.a.: Extended Boolean models; RASMUSSEN, E.: Clustering algorithms; HOLLAAR, L.: Special-purpose hardware for information retrieval; STANFILL, C.: Parallel information retrieval algorithms
    Footnote
    Rez. in: Computing reviews. July 1993, S.341-342 (G. Salton)
    Pages
    504 S
    Type
    s
  2. Brenner, E.H.: Beyond Boolean : new approaches in information retrieval; the quest for intuitive online search systems past, present & future (1995) 0.00 
    0.0014889077 = product of:
  0.0029778155 = sum of:
    0.0029778155 = product of:
      0.005955631 = sum of:
        0.005955631 = weight(_text_:s in 2547) [ClassicSimilarity], result of:
          0.005955631 = score(doc=2547,freq=4.0), product of:
            0.05008241 = queryWeight, product of:
              1.0872376 = idf(docFreq=40523, maxDocs=44218)
              0.046063907 = queryNorm
            0.118916616 = fieldWeight in 2547, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              1.0872376 = idf(docFreq=40523, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2547)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Pages
    XV,143 S
    Type
    s
  3. Cross-language information retrieval (1998) 0.00 
    6.512615E-4 = product of:
  0.001302523 = sum of:
    0.001302523 = product of:
      0.002605046 = sum of:
        0.002605046 = weight(_text_:s in 6299) [ClassicSimilarity], result of:
          0.002605046 = score(doc=6299,freq=6.0), product of:
            0.05008241 = queryWeight, product of:
              1.0872376 = idf(docFreq=40523, maxDocs=44218)
              0.046063907 = queryNorm
            0.052015185 = fieldWeight in 6299, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              1.0872376 = idf(docFreq=40523, maxDocs=44218)
              0.01953125 = fieldNorm(doc=6299)
      0.5 = coord(1/2)
  0.5 = coord(1/2)
    Footnote
    Rez. in: Machine translation review: 1999, no.10, S.26-27 (D. Lewis): "Cross Language Information Retrieval (CLIR) addresses the growing need to access large volumes of data across language boundaries. The typical requirement is for the user to input a free form query, usually a brief description of a topic, into a search or retrieval engine which returns a list, in ranked order, of documents or web pages that are relevant to the topic. The search engine matches the terms in the query to indexed terms, usually keywords previously derived from the target documents. Unlike monolingual information retrieval, CLIR requires query terms in one language to be matched to indexed terms in another. Matching can be done by bilingual dictionary lookup, full machine translation, or by applying statistical methods. A query's success is measured in terms of recall (how many potentially relevant target documents are found) and precision (what proportion of documents found are relevant). Issues in CLIR are how to translate query terms into index terms, how to eliminate alternative translations (e.g. to decide that French 'traitement' in a query means 'treatment' and not 'salary'), and how to rank or weight translation alternatives that are retained (e.g. how to order the French terms 'aventure', 'business', 'affaire', and 'liaison' as relevant translations of English 'affair'). Grefenstette provides a lucid and useful overview of the field and the problems. The volume brings together a number of experiments and projects in CLIR. Mark Davies (New Mexico State University) describes Recuerdo, a Spanish retrieval engine which reduces translation ambiguities by scanning indexes for parallel texts; it also uses either a bilingual dictionary or direct equivalents from a parallel corpus in order to compare results for queries on parallel texts. Lisa Ballesteros and Bruce Croft (University of Massachusetts) use a 'local feedback' technique which automatically enhances a query by adding extra terms to it both before and after translation; such terms can be derived from documents known to be relevant to the query.
    Pages
    VII,182 S
    Type
    s

Themes