Search (33 results, page 1 of 2)

  • × year_i:[1990 TO 2000}
  • × theme_ss:"Computerlinguistik"
  1. Polity, Y.: Vers une ergonomie linguistique (1994) 0.07 
    0.069699265 = product of:
  0.104548894 = sum of:
    0.067894526 = weight(_text_:bibliographic in 36) [ClassicSimilarity], result of:
      0.067894526 = score(doc=36,freq=2.0), product of:
        0.19731061 = queryWeight, product of:
          3.893044 = idf(docFreq=2449, maxDocs=44218)
          0.05068286 = queryNorm
        0.34409973 = fieldWeight in 36, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.893044 = idf(docFreq=2449, maxDocs=44218)
          0.0625 = fieldNorm(doc=36)
    0.036654368 = product of:
      0.073308736 = sum of:
        0.073308736 = weight(_text_:searching in 36) [ClassicSimilarity], result of:
          0.073308736 = score(doc=36,freq=2.0), product of:
            0.20502694 = queryWeight, product of:
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.05068286 = queryNorm
            0.3575566 = fieldWeight in 36, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.0625 = fieldNorm(doc=36)
      0.5 = coord(1/2)
  0.6666667 = coord(2/3)
    Abstract
    Analyzed a special type of man-mchine interaction, that of searching an information system with natural language. A model for full text processing for information retrieval was proposed that considered the system's users and how they employ information. Describes how INIST (the National Institute for Scientific and Technical Information) is developing computer assisted indexing as an aid to improving relevance when retrieving information from bibliographic data banks
  2. Yannakoudakis, E.J.; Daraki, J.J.: Lexical clustering and retrieval of bibliographic records (1994) 0.03 
    0.028005064 = product of:
  0.08401519 = sum of:
    0.08401519 = weight(_text_:bibliographic in 1045) [ClassicSimilarity], result of:
      0.08401519 = score(doc=1045,freq=4.0), product of:
        0.19731061 = queryWeight, product of:
          3.893044 = idf(docFreq=2449, maxDocs=44218)
          0.05068286 = queryNorm
        0.4258017 = fieldWeight in 1045, product of:
          2.0 = tf(freq=4.0), with freq of:
            4.0 = termFreq=4.0
          3.893044 = idf(docFreq=2449, maxDocs=44218)
          0.0546875 = fieldNorm(doc=1045)
  0.33333334 = coord(1/3)
    Abstract
    Presents a new system that enables users to retrieve catalogue entries on the basis of theri lexical similarities and to cluster records in a dynamic fashion. Describes the information retrieval system developed by the Department of Informatics, Athens University of Economics and Business, Greece. The system also offers the means for cyclic retrieval of records from each cluster while allowing the user to define the field to be used in each case. The approach is based on logical keys which are derived from pertinent bibliographic fields and are used for all clustering and information retrieval functions
  3. Prasad, A.R.D.; Kar, B.B.: Parsing Boolean search expression using definite clause grammars (1994) 0.02 
    0.02263151 = product of:
  0.067894526 = sum of:
    0.067894526 = weight(_text_:bibliographic in 8188) [ClassicSimilarity], result of:
      0.067894526 = score(doc=8188,freq=2.0), product of:
        0.19731061 = queryWeight, product of:
          3.893044 = idf(docFreq=2449, maxDocs=44218)
          0.05068286 = queryNorm
        0.34409973 = fieldWeight in 8188, product of:
          1.4142135 = tf(freq=2.0), with freq of:
            2.0 = termFreq=2.0
          3.893044 = idf(docFreq=2449, 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. Jones, K.: Linguistic searching versus relevance ranking : DR-LINK and TARGET (1999) 0.02 
    0.021381717 = product of:
  0.06414515 = sum of:
    0.06414515 = product of:
      0.1282903 = sum of:
        0.1282903 = weight(_text_:searching in 6423) [ClassicSimilarity], result of:
          0.1282903 = score(doc=6423,freq=2.0), product of:
            0.20502694 = queryWeight, product of:
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.05068286 = queryNorm
            0.6257241 = fieldWeight in 6423, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.109375 = fieldNorm(doc=6423)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
  5. Addison, E.R.; Wilson, H.D.; Feder, J.: ¬The impact of plain English searching on end users (1993) 0.02 
    0.021162411 = product of:
  0.06348723 = sum of:
    0.06348723 = product of:
      0.12697446 = sum of:
        0.12697446 = weight(_text_:searching in 5354) [ClassicSimilarity], result of:
          0.12697446 = score(doc=5354,freq=6.0), product of:
            0.20502694 = queryWeight, product of:
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.05068286 = queryNorm
            0.61930627 = fieldWeight in 5354, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.0625 = fieldNorm(doc=5354)
      0.5 = coord(1/2)
  0.33333334 = coord(1/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
  6. Allen, E.E.: Searching, naturally (1998) 0.02 
    0.018327186 = product of:
  0.054981556 = sum of:
    0.054981556 = product of:
      0.10996311 = sum of:
        0.10996311 = weight(_text_:searching in 2602) [ClassicSimilarity], result of:
          0.10996311 = score(doc=2602,freq=2.0), product of:
            0.20502694 = queryWeight, product of:
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.05068286 = queryNorm
            0.53633493 = fieldWeight in 2602, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.09375 = fieldNorm(doc=2602)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
  7. Hagn-Meincke, L.L.: Sprogspil pa tvaers : sprogfilosofiske teoriers betydning for indeksering og emnesogning (1999) 0.02 
    0.018327186 = product of:
  0.054981556 = sum of:
    0.054981556 = product of:
      0.10996311 = sum of:
        0.10996311 = weight(_text_:searching in 4643) [ClassicSimilarity], result of:
          0.10996311 = score(doc=4643,freq=2.0), product of:
            0.20502694 = queryWeight, product of:
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.05068286 = queryNorm
            0.53633493 = fieldWeight in 4643, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.09375 = fieldNorm(doc=4643)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Footnote
    Übers. d. Titels: Language-game interferences: the importance of linguistic theories for indexing and subject searching
  8. McMahon, J.G.; Smith, F.J.: Improved statistical language model performance with automatic generated word hierarchies (1996) 0.02 
    0.016022598 = product of:
  0.048067793 = sum of:
    0.048067793 = product of:
      0.09613559 = sum of:
        0.09613559 = weight(_text_:22 in 3164) [ClassicSimilarity], result of:
          0.09613559 = score(doc=3164,freq=2.0), product of:
            0.17748274 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05068286 = 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
  9. Ruge, G.: ¬A spreading activation network for automatic generation of thesaurus relationships (1991) 0.02 
    0.016022598 = product of:
  0.048067793 = sum of:
    0.048067793 = product of:
      0.09613559 = sum of:
        0.09613559 = weight(_text_:22 in 4506) [ClassicSimilarity], result of:
          0.09613559 = score(doc=4506,freq=2.0), product of:
            0.17748274 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05068286 = 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
  10. Somers, H.: Example-based machine translation : Review article (1999) 0.02 
    0.016022598 = product of:
  0.048067793 = sum of:
    0.048067793 = product of:
      0.09613559 = sum of:
        0.09613559 = weight(_text_:22 in 6672) [ClassicSimilarity], result of:
          0.09613559 = score(doc=6672,freq=2.0), product of:
            0.17748274 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05068286 = 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
  11. New tools for human translators (1997) 0.02 
    0.016022598 = product of:
  0.048067793 = sum of:
    0.048067793 = product of:
      0.09613559 = sum of:
        0.09613559 = weight(_text_:22 in 1179) [ClassicSimilarity], result of:
          0.09613559 = score(doc=1179,freq=2.0), product of:
            0.17748274 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05068286 = 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
  12. Baayen, R.H.; Lieber, H.: Word frequency distributions and lexical semantics (1997) 0.02 
    0.016022598 = product of:
  0.048067793 = sum of:
    0.048067793 = product of:
      0.09613559 = sum of:
        0.09613559 = weight(_text_:22 in 3117) [ClassicSimilarity], result of:
          0.09613559 = score(doc=3117,freq=2.0), product of:
            0.17748274 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05068286 = 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
  13. Frappaolo, C.: Artificial intelligence and text retrieval : a current perspective on the state of the art (1992) 0.02 
    0.015272654 = product of:
  0.04581796 = sum of:
    0.04581796 = product of:
      0.09163592 = sum of:
        0.09163592 = weight(_text_:searching in 7097) [ClassicSimilarity], result of:
          0.09163592 = score(doc=7097,freq=2.0), product of:
            0.20502694 = queryWeight, product of:
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.05068286 = queryNorm
            0.44694576 = fieldWeight in 7097, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.078125 = fieldNorm(doc=7097)
      0.5 = coord(1/2)
  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
  14. Greengrass, M.: Conflation methods for searching databases of Latin text (1996) 0.02 
    0.015119157 = product of:
  0.04535747 = sum of:
    0.04535747 = product of:
      0.09071494 = sum of:
        0.09071494 = weight(_text_:searching in 6987) [ClassicSimilarity], result of:
          0.09071494 = score(doc=6987,freq=4.0), product of:
            0.20502694 = queryWeight, product of:
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.05068286 = queryNorm
            0.44245374 = fieldWeight in 6987, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.0546875 = fieldNorm(doc=6987)
      0.5 = coord(1/2)
  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
  15. 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.013733655 = product of:
  0.041200966 = sum of:
    0.041200966 = product of:
      0.08240193 = sum of:
        0.08240193 = weight(_text_:22 in 4483) [ClassicSimilarity], result of:
          0.08240193 = score(doc=4483,freq=2.0), product of:
            0.17748274 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05068286 = 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
  16. Hutchins, J.: From first conception to first demonstration : the nascent years of machine translation, 1947-1954. A chronology (1997) 0.01 
    0.011444713 = product of:
  0.034334138 = sum of:
    0.034334138 = product of:
      0.068668276 = sum of:
        0.068668276 = weight(_text_:22 in 1463) [ClassicSimilarity], result of:
          0.068668276 = score(doc=1463,freq=2.0), product of:
            0.17748274 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05068286 = queryNorm
            0.38690117 = fieldWeight in 1463, 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=1463)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Date
    31. 7.1996 9:22:19
  17. Lezius, W.; Rapp, R.; Wettler, M.: ¬A morphology-system and part-of-speech tagger for German (1996) 0.01 
    0.011444713 = product of:
  0.034334138 = sum of:
    0.034334138 = product of:
      0.068668276 = sum of:
        0.068668276 = weight(_text_:22 in 1693) [ClassicSimilarity], result of:
          0.068668276 = score(doc=1693,freq=2.0), product of:
            0.17748274 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05068286 = queryNorm
            0.38690117 = fieldWeight in 1693, 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=1693)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Date
    22. 3.2015 9:37:18
  18. Akman, K.I.: ¬A new text compression technique based on natural language structure (1995) 0.01 
    0.010690859 = product of:
  0.032072574 = sum of:
    0.032072574 = product of:
      0.06414515 = sum of:
        0.06414515 = weight(_text_:searching in 1860) [ClassicSimilarity], result of:
          0.06414515 = score(doc=1860,freq=2.0), product of:
            0.20502694 = queryWeight, product of:
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.05068286 = queryNorm
            0.31286204 = fieldWeight in 1860, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1860)
      0.5 = coord(1/2)
  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
  19. SIGIR'92 : Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (1992) 0.01 
    0.009258555 = product of:
  0.027775666 = sum of:
    0.027775666 = product of:
      0.05555133 = sum of:
        0.05555133 = weight(_text_:searching in 6671) [ClassicSimilarity], result of:
          0.05555133 = score(doc=6671,freq=6.0), product of:
            0.20502694 = queryWeight, product of:
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.05068286 = queryNorm
            0.2709465 = fieldWeight in 6671, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.02734375 = fieldNorm(doc=6671)
      0.5 = coord(1/2)
  0.33333334 = coord(1/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
  20. Wacholder, N.; Byrd, R.J.: Retrieving information from full text using linguistic knowledge (1994) 0.01 
    0.009163593 = product of:
  0.027490778 = sum of:
    0.027490778 = product of:
      0.054981556 = sum of:
        0.054981556 = weight(_text_:searching in 8524) [ClassicSimilarity], result of:
          0.054981556 = score(doc=8524,freq=2.0), product of:
            0.20502694 = queryWeight, product of:
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.05068286 = queryNorm
            0.26816747 = fieldWeight in 8524, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.0452914 = idf(docFreq=2103, maxDocs=44218)
              0.046875 = fieldNorm(doc=8524)
      0.5 = coord(1/2)
  0.33333334 = coord(1/3)
    Abstract
    Examines how techniques in the field of natural language processing can be applied to the analysis of text in information retrieval. State of the art text searching programs cannot distinguish, for example, between occurrences of the sickness, AIDS and aids as tool or between library school and school nor equate such terms as online or on-line which are variants of the same form. To make these distinction, systems must incorporate knowledge about the meaning of words in context. Research in natural language processing has concentrated on the automatic 'understanding' of language; how to analyze the grammatical structure and meaning of text. Although many asoects of this research remain experimental, describes how these techniques to recognize spelling variants, names, acronyms, and abbreviations

Authors

Languages

  • e 28
  • d 3
  • da 1
  • f 1
  • More… Less…

Types

  • a 27
  • m 3
  • s 3
  • d 1
  • r 1
  • More… Less…

Themes

Subjects

Classifications