Search (134 results, page 1 of 7)

  • × theme_ss:"Automatisches Indexieren"
  1. Voorhees, E.M.: Implementing agglomerative hierarchic clustering algorithms for use in document retrieval (1986) 0.11 
    0.10588467 = product of:
  0.158827 = sum of:
    0.10315535 = weight(_text_:management in 402) [ClassicSimilarity], result of:
      0.10315535 = score(doc=402,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.5958457 = fieldWeight in 402, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.125 = fieldNorm(doc=402)
    0.05567166 = product of:
      0.11134332 = sum of:
        0.11134332 = weight(_text_:22 in 402) [ClassicSimilarity], result of:
          0.11134332 = score(doc=402,freq=2.0), product of:
            0.17986396 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051362853 = 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.6666667 = coord(2/3)
    Source
    Information processing and management. 22(1986) no.6, S.465-476
  2. Fuhr, N.: Ranking-Experimente mit gewichteter Indexierung (1986) 0.08 
    0.0794135 = product of:
  0.119120255 = sum of:
    0.077366516 = weight(_text_:management in 58) [ClassicSimilarity], result of:
      0.077366516 = score(doc=58,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.44688427 = fieldWeight in 58, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.09375 = fieldNorm(doc=58)
    0.041753743 = product of:
      0.083507486 = sum of:
        0.083507486 = weight(_text_:22 in 58) [ClassicSimilarity], result of:
          0.083507486 = score(doc=58,freq=2.0), product of:
            0.17986396 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.051362853 = 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.6666667 = coord(2/3)
    Date
    14. 6.2015 22:12:44
    Source
    Deutscher Dokumentartag 1985, Nürnberg, 1.-4.10.1985: Fachinformation: Methodik - Management - Markt; neue Entwicklungen, Berufe, Produkte. Bearb.: H. Strohl-Goebel
  3. Lassalle, E.: Text retrieval : from a monolingual system to a multilingual system (1993) 0.07 
    0.06723826 = product of:
  0.10085738 = sum of:
    0.045130465 = weight(_text_:management in 7403) [ClassicSimilarity], result of:
      0.045130465 = score(doc=7403,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.2606825 = fieldWeight in 7403, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0546875 = fieldNorm(doc=7403)
    0.055726912 = product of:
      0.111453824 = sum of:
        0.111453824 = weight(_text_:system in 7403) [ClassicSimilarity], result of:
          0.111453824 = score(doc=7403,freq=16.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.68896466 = fieldWeight in 7403, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0546875 = fieldNorm(doc=7403)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Describes the TELMI monolingual text retrieval system and its future extension, a multilingual system. TELMI is designed for medium sized databases containing short texts. The characteristics of the system are fine-grained natural language processing (NLP); an open domain and a large scale knowledge base; automated indexing based on conceptual representation of texts and reusability of the NLP tools. Discusses the French MINITEL service, the MGS information service and the TELMI research system covering the full text system; NLP architecture; the lexical level; the syntactic level; the semantic level and an example of the use of a generic system
    Source
    Journal of document and text management. 1(1993) no.1, S.65-74
  4. Malone, L.C.; Driscoll, J.R.; Pepe, J.W.: Modeling the performance of an automated keywording system (1991) 0.06 
    0.064407885 = product of:
  0.09661182 = sum of:
    0.051577676 = weight(_text_:management in 6682) [ClassicSimilarity], result of:
      0.051577676 = score(doc=6682,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.29792285 = fieldWeight in 6682, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0625 = fieldNorm(doc=6682)
    0.045034144 = product of:
      0.09006829 = sum of:
        0.09006829 = weight(_text_:system in 6682) [ClassicSimilarity], result of:
          0.09006829 = score(doc=6682,freq=8.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.5567675 = fieldWeight in 6682, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0625 = fieldNorm(doc=6682)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Presents a model for predicting the performance of a computerised keyword assigning and indexing system. Statistical procedures were investigated in order to protect against incorrect keywording by the system behaving as an expert system designed to mimic the behaviour of human keyword indexers and representing lessons learned from military exercises and operations
    Source
    Information processing and management. 27(1991) nos.2/3, S.145-151
  5. Cunningham, P.; Veale, T.; Conway, A.: Knowledge acquisition for concept indexing in document retrieval (1992) 0.06 
    0.060385596 = product of:
  0.09057839 = sum of:
    0.051577676 = weight(_text_:management in 5083) [ClassicSimilarity], result of:
      0.051577676 = score(doc=5083,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.29792285 = fieldWeight in 5083, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0625 = fieldNorm(doc=5083)
    0.039000716 = product of:
      0.07800143 = sum of:
        0.07800143 = weight(_text_:system in 5083) [ClassicSimilarity], result of:
          0.07800143 = score(doc=5083,freq=6.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.48217484 = fieldWeight in 5083, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0625 = fieldNorm(doc=5083)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Describes TWIG, a system for knowledge acquisition from text for use in an intelligent document database system. Documents are scanned into the system and converted into a hypertext thus providing a richer environment for browsing and retrieval. The knowledge acquisition phase is blackboard based with the text analysis expertise partitioned into agents that communicate through the blackboard
    Source
    Expert systems for information management. 5(1992) no.1, S.25-41
  6. Greiner-Petter, A.; Schubotz, M.; Cohl, H.S.; Gipp, B.: Semantic preserving bijective mappings for expressions involving special functions between computer algebra systems and document preparation systems (2019) 0.06 
    0.056979075 = product of:
  0.08546861 = sum of:
    0.025788838 = weight(_text_:management in 5499) [ClassicSimilarity], result of:
      0.025788838 = score(doc=5499,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.14896142 = fieldWeight in 5499, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.03125 = fieldNorm(doc=5499)
    0.059679776 = sum of:
      0.03184395 = weight(_text_:system in 5499) [ClassicSimilarity], result of:
        0.03184395 = score(doc=5499,freq=4.0), product of:
          0.16177002 = queryWeight, product of:
            3.1495528 = idf(docFreq=5152, maxDocs=44218)
            0.051362853 = queryNorm
          0.19684705 = fieldWeight in 5499, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.1495528 = idf(docFreq=5152, maxDocs=44218)
            0.03125 = fieldNorm(doc=5499)
      0.02783583 = weight(_text_:22 in 5499) [ClassicSimilarity], result of:
        0.02783583 = score(doc=5499,freq=2.0), product of:
          0.17986396 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051362853 = queryNorm
          0.15476047 = fieldWeight in 5499, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.03125 = fieldNorm(doc=5499)
  0.6666667 = coord(2/3)
    Abstract
    Purpose Modern mathematicians and scientists of math-related disciplines often use Document Preparation Systems (DPS) to write and Computer Algebra Systems (CAS) to calculate mathematical expressions. Usually, they translate the expressions manually between DPS and CAS. This process is time-consuming and error-prone. The purpose of this paper is to automate this translation. This paper uses Maple and Mathematica as the CAS, and LaTeX as the DPS. Design/methodology/approach Bruce Miller at the National Institute of Standards and Technology (NIST) developed a collection of special LaTeX macros that create links from mathematical symbols to their definitions in the NIST Digital Library of Mathematical Functions (DLMF). The authors are using these macros to perform rule-based translations between the formulae in the DLMF and CAS. Moreover, the authors develop software to ease the creation of new rules and to discover inconsistencies. Findings The authors created 396 mappings and translated 58.8 percent of DLMF formulae (2,405 expressions) successfully between Maple and DLMF. For a significant percentage, the special function definitions in Maple and the DLMF were different. An atomic symbol in one system maps to a composite expression in the other system. The translator was also successfully used for automatic verification of mathematical online compendia and CAS. The evaluation techniques discovered two errors in the DLMF and one defect in Maple. Originality/value This paper introduces the first translation tool for special functions between LaTeX and CAS. The approach improves error-prone manual translations and can be used to verify mathematical online compendia and CAS.
    Date
    20. 1.2015 18:30:22
    Source
    Aslib journal of information management. 71(2019) no.3, S.415-439
  7. Silvester, J.P.; Genuardi, M.T.; Klingbiel, P.H.: Machine-aided indexing at NASA (1994) 0.06 
    0.0563569 = product of:
  0.084535345 = sum of:
    0.045130465 = weight(_text_:management in 8503) [ClassicSimilarity], result of:
      0.045130465 = score(doc=8503,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.2606825 = fieldWeight in 8503, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0546875 = fieldNorm(doc=8503)
    0.039404877 = product of:
      0.07880975 = sum of:
        0.07880975 = weight(_text_:system in 8503) [ClassicSimilarity], result of:
          0.07880975 = score(doc=8503,freq=8.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.4871716 = fieldWeight in 8503, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0546875 = fieldNorm(doc=8503)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Describes the NASA Lexical Dictionary (NLD), a machine aided indexing system used online at the NASA Center for AeroSpace Information (CASI). This system automatically suggests a set of candidate terms from NASA's controlled vocabulary for any designated natural language text input. The system is comprised of a text processor that is based on the computational, nonsyntactic analysis of input text and an extensive knowledge base that serves to recognize and translate text-extracted concepts. The functions of the various NLD system components are described in detail, and production and quality benefits resulting from the implementation of machine-aided indexing at CASI are discussed
    Source
    Information processing and management. 30(1994) no.5, S.631-645
  8. Malone, L.C.; Wildman-Pepe, J.; Driscoll, J.R.: Evaluation of an automated keywording system (1990) 0.06 
    0.055576127 = product of:
  0.08336419 = sum of:
    0.038683258 = weight(_text_:management in 4999) [ClassicSimilarity], result of:
      0.038683258 = score(doc=4999,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.22344214 = fieldWeight in 4999, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.046875 = fieldNorm(doc=4999)
    0.044680934 = product of:
      0.08936187 = sum of:
        0.08936187 = weight(_text_:system in 4999) [ClassicSimilarity], result of:
          0.08936187 = score(doc=4999,freq=14.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.5524007 = fieldWeight in 4999, product of:
              3.7416575 = tf(freq=14.0), with freq of:
                14.0 = termFreq=14.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.046875 = fieldNorm(doc=4999)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    An automated keywording system has been designed ro artifically behave as a human "expert" indexer. The system was designed to keyword 100 to 800 word documents representing lessons learned from military exercises and operations. A set of 74 documents can be keyworded on an IBM PS/2 model 80 in about five minutes. This paper presents a variety of ways for statistical documenting improvements in the development of an automated keywording system over time. It is not only beneficial to have some measure of system performance for a given time, but it is also useful as attemps are made to improve a system to assess if actual statistically significant improvements have been made. Furthermore, it is useful to identify the source of any existing problems so that they can be rectified. The specifics of the automated system that was evaluated are described, and the performance measures used are discussed.
    Source
    Microcomputers for information management. 7(1990) no. 2, S.127-148
  9. Smart, G.: Using language analysis to manage information (1993) 0.05 
    0.0493965 = product of:
  0.07409475 = sum of:
    0.051577676 = weight(_text_:management in 4423) [ClassicSimilarity], result of:
      0.051577676 = score(doc=4423,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.29792285 = fieldWeight in 4423, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0625 = fieldNorm(doc=4423)
    0.022517072 = product of:
      0.045034144 = sum of:
        0.045034144 = weight(_text_:system in 4423) [ClassicSimilarity], result of:
          0.045034144 = score(doc=4423,freq=2.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.27838376 = fieldWeight in 4423, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0625 = fieldNorm(doc=4423)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    The ESPRIT project SIMPR developed software to analyse documents and generate indexes for them. Of immediate application as a document indexing and classification system, this also offers a technology for information modelling that has broader implications, supporting many new uses for information management softeware. The project was based on the assumption that information can only be managed successfully by computer systems that can view the information contained in a document through the language in which the document is written, and that systems need to be sufficiently flexible to respond to the changing requirements of document use
  10. Damerau, F.J.: Generating an evaluating domain-oriented multi-word terms from texts (1993) 0.05 
    0.0493965 = product of:
  0.07409475 = sum of:
    0.051577676 = weight(_text_:management in 5814) [ClassicSimilarity], result of:
      0.051577676 = score(doc=5814,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.29792285 = fieldWeight in 5814, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0625 = fieldNorm(doc=5814)
    0.022517072 = product of:
      0.045034144 = sum of:
        0.045034144 = weight(_text_:system in 5814) [ClassicSimilarity], result of:
          0.045034144 = score(doc=5814,freq=2.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.27838376 = fieldWeight in 5814, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0625 = fieldNorm(doc=5814)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Examines techniques for automatically generating domain vocabularies from large text collections. Focuses on the problem of generating multi-word vocabulary terms (specifically pairs). Discusses statistical issues associated with word co-occurrences likely to be of use in a natural language interface. Provides a more objective evaluation of the selection procedures. As substantial experimentation with subjects using a working query system is absent, all evaluation is necessarily subjective. Uses surrogate for experimentation by relying on pre-existing dictionaries as indicators of domain relevance
    Source
    Information processing and management. 29(1993) no.4, S.433-447
  11. Driscoll, J.R.; Rajala, D.A.; Shaffer, W.H.: ¬The operation and performance of an artificially intelligent keywording system (1991) 0.05 
    0.048662614 = product of:
  0.07299392 = sum of:
    0.045130465 = weight(_text_:management in 6681) [ClassicSimilarity], result of:
      0.045130465 = score(doc=6681,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.2606825 = fieldWeight in 6681, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0546875 = fieldNorm(doc=6681)
    0.027863456 = product of:
      0.055726912 = sum of:
        0.055726912 = weight(_text_:system in 6681) [ClassicSimilarity], result of:
          0.055726912 = score(doc=6681,freq=4.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.34448233 = fieldWeight in 6681, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0546875 = fieldNorm(doc=6681)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Presents a new approach to text analysis for automating the key phrase indexing process, using artificial intelligence techniques. This mimics the behaviour of human experts by using a rule base consisting of insertion and deletion rules generated by subject-matter experts. The insertion rules are based on the idea that some phrases found in a text imply or trigger other phrases. The deletion rules apply to semantically ambiguous phrases where text presence alone does not determine appropriateness as a key phrase. The insertion and deletion rules are used to transform a list of found phrases to a list of key phrases for indexing a document. Statistical data are provided to demonstrate the performance of this expert rule based system
    Source
    Information processing and management. 27(1991) no.1, S.43-54
  12. Biebricher, N.; Fuhr, N.; Lustig, G.; Schwantner, M.; Knorz, G.: ¬The automatic indexing system AIR/PHYS : from research to application (1988) 0.04 
    0.041960754 = product of:
  0.12588225 = sum of:
    0.12588225 = sum of:
      0.05629268 = weight(_text_:system in 1952) [ClassicSimilarity], result of:
        0.05629268 = score(doc=1952,freq=2.0), product of:
          0.16177002 = queryWeight, product of:
            3.1495528 = idf(docFreq=5152, maxDocs=44218)
            0.051362853 = queryNorm
          0.3479797 = fieldWeight in 1952, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.1495528 = idf(docFreq=5152, maxDocs=44218)
            0.078125 = fieldNorm(doc=1952)
      0.06958958 = weight(_text_:22 in 1952) [ClassicSimilarity], result of:
        0.06958958 = score(doc=1952,freq=2.0), product of:
          0.17986396 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051362853 = queryNorm
          0.38690117 = fieldWeight in 1952, 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=1952)
  0.33333334 = coord(1/3)
    Date
    16. 8.1998 12:51:22
  13. Lochbaum, K.E.; Streeter, A.R.: Comparing and combining the effectiveness of latent semantic indexing and the ordinary vector space model for information retrieval (1989) 0.04 
    0.041710816 = product of:
  0.06256622 = sum of:
    0.038683258 = weight(_text_:management in 3458) [ClassicSimilarity], result of:
      0.038683258 = score(doc=3458,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.22344214 = fieldWeight in 3458, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.046875 = fieldNorm(doc=3458)
    0.02388296 = product of:
      0.04776592 = sum of:
        0.04776592 = weight(_text_:system in 3458) [ClassicSimilarity], result of:
          0.04776592 = score(doc=3458,freq=4.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.29527056 = fieldWeight in 3458, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.046875 = fieldNorm(doc=3458)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    A retrievalsystem was built to find individuals with appropriate expertise within a large research establishment on the basis of their authored documents. The expert-locating system uses a new method for automatic indexing and retrieval based on singular value decomposition, a matrix decomposition technique related to the factor analysis. Organizational groups, represented by the documents they write, and the terms contained in these documents, are fit simultaneously into a 100-dimensional "semantic" space. User queries are positioned in the semantic space, and the most similar groups are returned to the user. Here we compared the standard vector-space model with this new technique and found that combining the two methods improved performance over either alone. We also examined the effects of various experimental variables on the system`s retrieval accuracy. In particular, the effects of: term weighting functions in the semantic space construction and in query construction, suffix stripping, and using lexical units larger than a a single word were studied.
    Source
    Information processing and management. 25(1989) no.6, S. 665-676
  14. Lepsky, K.; Vorhauer, J.: Lingo - ein open source System für die Automatische Indexierung deutschsprachiger Dokumente (2006) 0.04 
    0.039786518 = product of:
  0.11935955 = sum of:
    0.11935955 = sum of:
      0.0636879 = weight(_text_:system in 3581) [ClassicSimilarity], result of:
        0.0636879 = score(doc=3581,freq=4.0), product of:
          0.16177002 = queryWeight, product of:
            3.1495528 = idf(docFreq=5152, maxDocs=44218)
            0.051362853 = queryNorm
          0.3936941 = fieldWeight in 3581, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.1495528 = idf(docFreq=5152, maxDocs=44218)
            0.0625 = fieldNorm(doc=3581)
      0.05567166 = weight(_text_:22 in 3581) [ClassicSimilarity], result of:
        0.05567166 = score(doc=3581,freq=2.0), product of:
          0.17986396 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051362853 = queryNorm
          0.30952093 = fieldWeight in 3581, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0625 = fieldNorm(doc=3581)
  0.33333334 = coord(1/3)
    Abstract
    Lingo ist ein frei verfügbares System (open source) zur automatischen Indexierung der deutschen Sprache. Bei der Entwicklung von lingo standen hohe Konfigurierbarkeit und Flexibilität des Systems für unterschiedliche Einsatzmöglichkeiten im Vordergrund. Der Beitrag zeigt den Nutzen einer linguistisch basierten automatischen Indexierung für das Information Retrieval auf. Die für eine Retrievalverbesserung zur Verfügung stehende linguistische Funktionalität von lingo wird vorgestellt und an Beispielen erläutert: Grundformerkennung, Kompositumerkennung bzw. Kompositumzerlegung, Wortrelationierung, lexikalische und algorithmische Mehrwortgruppenerkennung, OCR-Fehlerkorrektur. Der offene Systemaufbau von lingo wird beschrieben, mögliche Einsatzszenarien und Anwendungsgrenzen werden benannt.
    Date
    24. 3.2006 12:22:02
  15. Tsai, C.-F.; McGarry, K.; Tait, J.: Qualitative evaluation of automatic assignment of keywords to images (2006) 0.04 
    0.037740998 = product of:
  0.056611493 = sum of:
    0.032236047 = weight(_text_:management in 963) [ClassicSimilarity], result of:
      0.032236047 = score(doc=963,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.18620178 = fieldWeight in 963, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0390625 = fieldNorm(doc=963)
    0.024375446 = product of:
      0.048750892 = sum of:
        0.048750892 = weight(_text_:system in 963) [ClassicSimilarity], result of:
          0.048750892 = score(doc=963,freq=6.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.30135927 = fieldWeight in 963, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0390625 = fieldNorm(doc=963)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    In image retrieval, most systems lack user-centred evaluation since they are assessed by some chosen ground truth dataset. The results reported through precision and recall assessed against the ground truth are thought of as being an acceptable surrogate for the judgment of real users. Much current research focuses on automatically assigning keywords to images for enhancing retrieval effectiveness. However, evaluation methods are usually based on system-level assessment, e.g. classification accuracy based on some chosen ground truth dataset. In this paper, we present a qualitative evaluation methodology for automatic image indexing systems. The automatic indexing task is formulated as one of image annotation, or automatic metadata generation for images. The evaluation is composed of two individual methods. First, the automatic indexing annotation results are assessed by human subjects. Second, the subjects are asked to annotate some chosen images as the test set whose annotations are used as ground truth. Then, the system is tested by the test set whose annotation results are judged against the ground truth. Only one of these methods is reported for most systems on which user-centred evaluation are conducted. We believe that both methods need to be considered for full evaluation. We also provide an example evaluation of our system based on this methodology. According to this study, our proposed evaluation methodology is able to provide deeper understanding of the system's performance.
    Source
    Information processing and management. 42(2006) no.1, S.136-154
  16. Bordoni, L.; Pazienza, M.T.: Documents automatic indexing in an environmental domain (1997) 0.03 
    0.034813207 = product of:
  0.104439616 = sum of:
    0.104439616 = sum of:
      0.055726912 = weight(_text_:system in 530) [ClassicSimilarity], result of:
        0.055726912 = score(doc=530,freq=4.0), product of:
          0.16177002 = queryWeight, product of:
            3.1495528 = idf(docFreq=5152, maxDocs=44218)
            0.051362853 = queryNorm
          0.34448233 = fieldWeight in 530, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.1495528 = idf(docFreq=5152, maxDocs=44218)
            0.0546875 = fieldNorm(doc=530)
      0.0487127 = weight(_text_:22 in 530) [ClassicSimilarity], result of:
        0.0487127 = score(doc=530,freq=2.0), product of:
          0.17986396 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051362853 = queryNorm
          0.2708308 = fieldWeight in 530, 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=530)
  0.33333334 = coord(1/3)
    Abstract
    Describes an application of Natural Language Processing (NLP) techniques, in HIRMA (Hypertextual Information Retrieval Managed by ARIOSTO), to the problem of document indexing by referring to a system which incorporates natural language processing techniques to determine the subject of the text of documents and to associate them with relevant semantic indexes. Describes briefly the overall system, details of its implementation on a corpus of scientific abstracts related to environmental topics and experimental evidence of the system's behaviour. Analyzes in detail an experiment designed to evaluate the system's retrieval ability in terms of recall and precision
    Source
    International forum on information and documentation. 22(1997) no.1, S.17-28
  17. Rapke, K.: Automatische Indexierung von Volltexten für die Gruner+Jahr Pressedatenbank (2001) 0.03 
    0.03475901 = product of:
  0.052138515 = sum of:
    0.032236047 = weight(_text_:management in 5863) [ClassicSimilarity], result of:
      0.032236047 = score(doc=5863,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.18620178 = fieldWeight in 5863, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0390625 = fieldNorm(doc=5863)
    0.01990247 = product of:
      0.03980494 = sum of:
        0.03980494 = weight(_text_:system in 5863) [ClassicSimilarity], result of:
          0.03980494 = score(doc=5863,freq=4.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.24605882 = fieldWeight in 5863, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5863)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Retrievaltests sind die anerkannteste Methode, um neue Verfahren der Inhaltserschließung gegenüber traditionellen Verfahren zu rechtfertigen. Im Rahmen einer Diplomarbeit wurden zwei grundsätzlich unterschiedliche Systeme der automatischen inhaltlichen Erschließung anhand der Pressedatenbank des Verlagshauses Gruner + Jahr (G+J) getestet und evaluiert. Untersucht wurde dabei natürlichsprachliches Retrieval im Vergleich zu Booleschem Retrieval. Bei den beiden Systemen handelt es sich zum einen um Autonomy von Autonomy Inc. und DocCat, das von IBM an die Datenbankstruktur der G+J Pressedatenbank angepasst wurde. Ersteres ist ein auf natürlichsprachlichem Retrieval basierendes, probabilistisches System. DocCat demgegenüber basiert auf Booleschem Retrieval und ist ein lernendes System, das aufgrund einer intellektuell erstellten Trainingsvorlage indexiert. Methodisch geht die Evaluation vom realen Anwendungskontext der Textdokumentation von G+J aus. Die Tests werden sowohl unter statistischen wie auch qualitativen Gesichtspunkten bewertet. Ein Ergebnis der Tests ist, dass DocCat einige Mängel gegenüber der intellektuellen Inhaltserschließung aufweist, die noch behoben werden müssen, während das natürlichsprachliche Retrieval von Autonomy in diesem Rahmen und für die speziellen Anforderungen der G+J Textdokumentation so nicht einsetzbar ist
    Source
    Information Research & Content Management: Orientierung, Ordnung und Organisation im Wissensmarkt; 23. DGI-Online-Tagung der DGI und 53. Jahrestagung der Deutschen Gesellschaft für Informationswissenschaft und Informationspraxis e.V. DGI, Frankfurt am Main, 8.-10.5.2001. Proceedings. Hrsg.: R. Schmidt
  18. Li, W.; Wong, K.-F.; Yuan, C.: Toward automatic Chinese temporal information extraction (2001) 0.03 
    0.03475901 = product of:
  0.052138515 = sum of:
    0.032236047 = weight(_text_:management in 6029) [ClassicSimilarity], result of:
      0.032236047 = score(doc=6029,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.18620178 = fieldWeight in 6029, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.0390625 = fieldNorm(doc=6029)
    0.01990247 = product of:
      0.03980494 = sum of:
        0.03980494 = weight(_text_:system in 6029) [ClassicSimilarity], result of:
          0.03980494 = score(doc=6029,freq=4.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.24605882 = fieldWeight in 6029, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.0390625 = fieldNorm(doc=6029)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Over the past few years, temporal information processing and temporal database management have increasingly become hot topics. Nevertheless, only a few researchers have investigated these areas in the Chinese language. This lays down the objective of our research: to exploit Chinese language processing techniques for temporal information extraction and concept reasoning. In this article, we first study the mechanism for expressing time in Chinese. On the basis of the study, we then design a general frame structure for maintaining the extracted temporal concepts and propose a system for extracting time-dependent information from Hong Kong financial news. In the system, temporal knowledge is represented by different types of temporal concepts (TTC) and different temporal relations, including absolute and relative relations, which are used to correlate between action times and reference times. In analyzing a sentence, the algorithm first determines the situation related to the verb. This in turn will identify the type of temporal concept associated with the verb. After that, the relevant temporal information is extracted and the temporal relations are derived. These relations link relevant concept frames together in chronological order, which in turn provide the knowledge to fulfill users' queries, e.g., for question-answering (i.e., Q&A) applications
  19. Willett, P.: Recent trends in hierarchic document clustering : a critical review (1988) 0.03 
    0.03438512 = product of:
  0.10315535 = sum of:
    0.10315535 = weight(_text_:management in 2604) [ClassicSimilarity], result of:
      0.10315535 = score(doc=2604,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.5958457 = fieldWeight in 2604, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.125 = fieldNorm(doc=2604)
  0.33333334 = coord(1/3)
    Source
    Information processing and management. 24(1988) no.5, S.577-597
  20. SIGIR'92 : Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (1992) 0.03 
    0.03361913 = product of:
  0.05042869 = sum of:
    0.022565233 = weight(_text_:management in 6671) [ClassicSimilarity], result of:
      0.022565233 = score(doc=6671,freq=2.0), product of:
        0.17312427 = queryWeight, product of:
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.051362853 = queryNorm
        0.13034125 = fieldWeight in 6671, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.3706124 = idf(docFreq=4130, maxDocs=44218)
          0.02734375 = fieldNorm(doc=6671)
    0.027863456 = product of:
      0.055726912 = sum of:
        0.055726912 = weight(_text_:system in 6671) [ClassicSimilarity], result of:
          0.055726912 = score(doc=6671,freq=16.0), product of:
            0.16177002 = queryWeight, product of:
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.051362853 = queryNorm
            0.34448233 = fieldWeight in 6671, product of:
              4.0 = tf(freq=16.0), with freq of:
                16.0 = termFreq=16.0
              3.1495528 = idf(docFreq=5152, maxDocs=44218)
              0.02734375 = fieldNorm(doc=6671)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Content
    HARMAN, D.: Relevance feedback revisited; AALBERSBERG, I.J.: Incremental relevance feedback; TAGUE-SUTCLIFFE, J.: Measuring the informativeness of a retrieval process; LEWIS, D.D.: An evaluation of phrasal and clustered representations on a text categorization task; BLOSSEVILLE, M.J., G. HÉBRAIL, M.G. MONTEIL u. N. PÉNOT: Automatic document classification: natural language processing, statistical analysis, and expert system techniques used together; MASAND, B., G. LINOFF u. D. WALTZ: Classifying news stories using memory based reasoning; KEEN, E.M.: Term position ranking: some new test results; CROUCH, C.J. u. B. YANG: Experiments in automatic statistical thesaurus construction; GREFENSTETTE, G.: Use of syntactic context to produce term association lists for text retrieval; ANICK, P.G. u. R.A. FLYNN: Versioning of full-text information retrieval system; BURKOWSKI, F.J.: Retrieval activities in a database consisting of heterogeneous collections; DEERWESTER, S.C., K. WACLENA u. M. LaMAR: A textual object management system; NIE, J.-Y.:Towards a probabilistic modal logic for semantic-based information retrieval; WANG, A.W., S.K.M. WONG u. Y.Y. YAO: An analysis of vector space models based on computational geometry; BARTELL, B.T., G.W. COTTRELL u. R.K. BELEW: Latent semantic indexing is an optimal special case of multidimensional scaling; GLAVITSCH, U. u. P. SCHÄUBLE: A system for retrieving speech documents; MARGULIS, E.L.: N-Poisson document modelling; HESS, M.: An incrementally extensible document retrieval system based on linguistics and logical principles; COOPER, W.S., F.C. GEY u. D.P. DABNEY: Probabilistic retrieval based on staged logistic regression; FUHR, N.: Integration of probabilistic fact and text retrieval; CROFT, B., L.A. SMITH u. H. TURTLE: A loosely-coupled integration of a text retrieval system and an object-oriented database system; DUMAIS, S.T. u. J. NIELSEN: Automating the assignement of submitted manuscripts to reviewers; GOST, M.A. u. M. MASOTTI: Design of an OPAC database to permit different subject searching accesses; ROBERTSON, A.M. u. P. WILLETT: Searching for historical word forms in a database of 17th century English text using spelling correction methods; FAX, E.A., Q.F. CHEN u. L.S. HEATH: A faster algorithm for constructing minimal perfect hash functions; MOFFAT, A. u. J. ZOBEL: Parameterised compression for sparse bitmaps; GRANDI, F., P. TIBERIO u. P. Zezula: Frame-sliced patitioned parallel signature files; ALLEN, B.: Cognitive differences in end user searching of a CD-ROM index; SONNENWALD, D.H.: Developing a theory to guide the process of designing information retrieval systems; CUTTING, D.R., J.O. PEDERSEN, D. KARGER, u. J.W. TUKEY: Scatter/ Gather: a cluster-based approach to browsing large document collections; CHALMERS, M. u. P. CHITSON: Bead: Explorations in information visualization; WILLIAMSON, C. u. B. SHNEIDERMAN: The dynamic HomeFinder: evaluating dynamic queries in a real-estate information exploring system

Authors

Years

Languages

Types

  • a 118
  • el 8
  • x 5
  • s 3
  • m 2
  • d 1
  • More… Less…

Themes