Search (359 results, page 1 of 18)

0.12653719 = product of:
  0.25307438 = sum of:
    0.25307438 = sum of:
      0.14085601 = weight(_text_:language in 337) [ClassicSimilarity], result of:
        0.14085601 = score(doc=337,freq=2.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.6935467 = fieldWeight in 337, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.125 = fieldNorm(doc=337)
      0.11221837 = weight(_text_:22 in 337) [ClassicSimilarity], result of:
        0.11221837 = score(doc=337,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.61904186 = fieldWeight in 337, 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=337)
  0.5 = coord(1/2)

Source

Annual review of information science and technology. 22(1987), S.79-108

0.12122209 = product of:
  0.24244419 = sum of:
    0.24244419 = sum of:
      0.186335 = weight(_text_:language in 7415) [ClassicSimilarity], result of:
        0.186335 = score(doc=7415,freq=14.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.9174761 = fieldWeight in 7415, product of:
            3.7416575 = tf(freq=14.0), with freq of:
              14.0 = termFreq=14.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.0625 = fieldNorm(doc=7415)
      0.056109186 = weight(_text_:22 in 7415) [ClassicSimilarity], result of:
        0.056109186 = score(doc=7415,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.30952093 = fieldWeight in 7415, 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=7415)
  0.5 = coord(1/2)

Abstract

State of the art review of natural language processing updating an earlier review published in ARIST 22(1987). Discusses important developments that have allowed for significant advances in the field of natural language processing: materials and resources; knowledge based systems and statistical approaches; and a strong emphasis on evaluation. Reviews some natural language processing applications and common problems still awaiting solution. Considers closely related applications such as language generation and th egeneration phase of machine translation which face the same problems as natural language processing. Covers natural language methodologies for information retrieval only briefly

0.11072004 = product of:
  0.22144008 = sum of:
    0.22144008 = sum of:
      0.123249 = weight(_text_:language in 3164) [ClassicSimilarity], result of:
        0.123249 = score(doc=3164,freq=2.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.60685337 = fieldWeight in 3164, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.109375 = fieldNorm(doc=3164)
      0.098191075 = weight(_text_:22 in 3164) [ClassicSimilarity], result of:
        0.098191075 = score(doc=3164,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = 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)

Source

Computational linguistics. 22(1996) no.2, S.217-248

0.10862944 = sum of:
  0.082218945 = product of:
    0.24665684 = sum of:
      0.24665684 = weight(_text_:3a in 862) [ClassicSimilarity], result of:
        0.24665684 = score(doc=862,freq=2.0), product of:
          0.43887708 = queryWeight, product of:
            8.478011 = idf(docFreq=24, maxDocs=44218)
            0.051766515 = queryNorm
          0.56201804 = fieldWeight in 862, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            8.478011 = idf(docFreq=24, maxDocs=44218)
            0.046875 = fieldNorm(doc=862)
    0.33333334 = coord(1/3)
  0.0264105 = product of:
    0.052821 = sum of:
      0.052821 = weight(_text_:language in 862) [ClassicSimilarity], result of:
        0.052821 = score(doc=862,freq=2.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.26008 = fieldWeight in 862, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.046875 = fieldNorm(doc=862)
    0.5 = coord(1/2)

Abstract

This research revisits the classic Turing test and compares recent large language models such as ChatGPT for their abilities to reproduce human-level comprehension and compelling text generation. Two task challenges- summary and question answering- prompt ChatGPT to produce original content (98-99%) from a single text entry and sequential questions initially posed by Turing in 1950. We score the original and generated content against the OpenAI GPT-2 Output Detector from 2019, and establish multiple cases where the generated content proves original and undetectable (98%). The question of a machine fooling a human judge recedes in this work relative to the question of "how would one prove it?" The original contribution of the work presents a metric and simple grammatical set for understanding the writing mechanics of chatbots in evaluating their readability and statistical clarity, engagement, delivery, overall quality, and plagiarism risks. While Turing's original prose scores at least 14% below the machine-generated output, whether an algorithm displays hints of Turing's true initial thoughts (the "Lovelace 2.0" test) remains unanswerable.

Source

https%3A%2F%2Farxiv.org%2Fabs%2F2212.06721&usg=AOvVaw3i_9pZm9y_dQWoHi6uv0EN

0.106795505 = product of:
  0.21359101 = sum of:
    0.21359101 = sum of:
      0.15748182 = weight(_text_:language in 5749) [ClassicSimilarity], result of:
        0.15748182 = score(doc=5749,freq=10.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.77540886 = fieldWeight in 5749, product of:
            3.1622777 = tf(freq=10.0), with freq of:
              10.0 = termFreq=10.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.0625 = fieldNorm(doc=5749)
      0.056109186 = weight(_text_:22 in 5749) [ClassicSimilarity], result of:
        0.056109186 = score(doc=5749,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.30952093 = fieldWeight in 5749, 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=5749)
  0.5 = coord(1/2)

Abstract

This article describes experiments in the use of machine learning techniques at the British Library to assign language codes to catalog records, in order to provide information about the language of content of the resources described. In the first phase of the project, language codes were assigned to 1.15 million records with 99.7% confidence. The automated language identification tools developed will be used to contribute to future enhancement of over 4 million legacy records.

Date

2. 3.2020 19:04:22

0.10325989 = sum of:
  0.082218945 = product of:
    0.24665684 = sum of:
      0.24665684 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
        0.24665684 = score(doc=562,freq=2.0), product of:
          0.43887708 = queryWeight, product of:
            8.478011 = idf(docFreq=24, maxDocs=44218)
            0.051766515 = queryNorm
          0.56201804 = fieldWeight in 562, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            8.478011 = idf(docFreq=24, maxDocs=44218)
            0.046875 = fieldNorm(doc=562)
    0.33333334 = coord(1/3)
  0.021040944 = product of:
    0.04208189 = sum of:
      0.04208189 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
        0.04208189 = score(doc=562,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.23214069 = fieldWeight in 562, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=562)
    0.5 = coord(1/2)

Content

Vgl.: http://www.google.de/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&ved=0CEAQFjAA&url=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Fdoi%3D10.1.1.91.4940%26rep%3Drep1%26type%3Dpdf&ei=dOXrUMeIDYHDtQahsIGACg&usg=AFQjCNHFWVh6gNPvnOrOS9R3rkrXCNVD-A&sig2=5I2F5evRfMnsttSgFF9g7Q&bvm=bv.1357316858,d.Yms.

Date

8. 1.2013 10:22:32

0.08009663 = product of:
  0.16019326 = sum of:
    0.16019326 = sum of:
      0.11811137 = weight(_text_:language in 1848) [ClassicSimilarity], result of:
        0.11811137 = score(doc=1848,freq=10.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.5815567 = fieldWeight in 1848, product of:
            3.1622777 = tf(freq=10.0), with freq of:
              10.0 = termFreq=10.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.046875 = fieldNorm(doc=1848)
      0.04208189 = weight(_text_:22 in 1848) [ClassicSimilarity], result of:
        0.04208189 = score(doc=1848,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.23214069 = fieldWeight in 1848, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=1848)
  0.5 = coord(1/2)

Abstract

The goal of entity linking is to associate references to an entity that is found in unstructured natural language content to an authoritative inventory of known entities. This article describes the construction of 6 test collections for cross-language person-entity linking that together span 22 languages. Fully automated components were used together with 2 crowdsourced validation stages to affordably generate ground-truth annotations with an accuracy comparable to that of a completely manual process. The resulting test collections each contain between 642 (Arabic) and 2,361 (Romanian) person references in non-English texts for which the correct resolution in English Wikipedia is known, plus a similar number of references for which no correct resolution into English Wikipedia is believed to exist. Fully automated cross-language person-name linking experiments with 20 non-English languages yielded a resolution accuracy of between 0.84 (Serbian) and 0.98 (Romanian), which compares favorably with previously reported cross-language entity linking results for Spanish.

0.07908574 = product of:
  0.15817147 = sum of:
    0.15817147 = sum of:
      0.088035 = weight(_text_:language in 1693) [ClassicSimilarity], result of:
        0.088035 = score(doc=1693,freq=2.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.4334667 = fieldWeight in 1693, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.078125 = fieldNorm(doc=1693)
      0.07013648 = weight(_text_:22 in 1693) [ClassicSimilarity], result of:
        0.07013648 = score(doc=1693,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = 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)

Date

22. 3.2015 9:37:18

Source

Natural language processing and speech technology: Results of the 3rd KONVENS Conference, Bielefeld, October 1996. Ed.: D. Gibbon

0.077854715 = product of:
  0.15570943 = sum of:
    0.15570943 = sum of:
      0.09960024 = weight(_text_:language in 6753) [ClassicSimilarity], result of:
        0.09960024 = score(doc=6753,freq=4.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.4904116 = fieldWeight in 6753, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.0625 = fieldNorm(doc=6753)
      0.056109186 = weight(_text_:22 in 6753) [ClassicSimilarity], result of:
        0.056109186 = score(doc=6753,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.30952093 = fieldWeight in 6753, 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=6753)
  0.5 = coord(1/2)

Abstract

Describes and evaluates the results of a large scale lexical learning system, ARISTO-LEX, that uses a combination of probabilisitc and knowledge based methods for the acquisition of selectional restrictions of words in sublanguages. Presents experimental data obtained from different corpora in different doamins and languages, and shows that the acquired lexical data not only have practical applications in natural language processing, but they are useful for a comparative analysis of sublanguages

Date

6. 3.1997 16:22:15

0.077854715 = product of:
  0.15570943 = sum of:
    0.15570943 = sum of:
      0.09960024 = weight(_text_:language in 1534) [ClassicSimilarity], result of:
        0.09960024 = score(doc=1534,freq=4.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.4904116 = fieldWeight in 1534, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.0625 = fieldNorm(doc=1534)
      0.056109186 = weight(_text_:22 in 1534) [ClassicSimilarity], result of:
        0.056109186 = score(doc=1534,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.30952093 = fieldWeight in 1534, 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=1534)
  0.5 = coord(1/2)

Content

Enthält folgende Kapitel: (1) Motivation; (2) Language philosophical foundations; (3) Structural comparison of extensions; (4) Earlier approaches towards term association; (5) Experiments; (6) Spreading-activation networks or memory models; (7) Perspective. Appendices: Heads and modifiers of 'car'. Glossary. Index. Language and computer. Word semantics and term association. Methods towards an automatic semantic classification

Footnote

Rez. in: Knowledge organization 22(1995) no.3/4, S.182-184 (M.T. Rolland)

0.06812288 = product of:
  0.13624576 = sum of:
    0.13624576 = sum of:
      0.087150216 = weight(_text_:language in 2345) [ClassicSimilarity], result of:
        0.087150216 = score(doc=2345,freq=4.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.42911017 = fieldWeight in 2345, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.0546875 = fieldNorm(doc=2345)
      0.049095538 = weight(_text_:22 in 2345) [ClassicSimilarity], result of:
        0.049095538 = score(doc=2345,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.2708308 = fieldWeight in 2345, 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=2345)
  0.5 = coord(1/2)

Abstract

Natural language processing (NLP) is a powerful technology for the vital tasks of information retrieval (IR) and knowledge discovery (KD) which, in turn, feed the visualization systems of the present and future and enable knowledge workers to focus more of their time on the vital tasks of analysis and prediction

Date

22. 9.1997 19:16:05

0.06812288 = product of:
  0.13624576 = sum of:
    0.13624576 = sum of:
      0.087150216 = weight(_text_:language in 330) [ClassicSimilarity], result of:
        0.087150216 = score(doc=330,freq=4.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.42911017 = fieldWeight in 330, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.0546875 = fieldNorm(doc=330)
      0.049095538 = weight(_text_:22 in 330) [ClassicSimilarity], result of:
        0.049095538 = score(doc=330,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.2708308 = fieldWeight in 330, 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=330)
  0.5 = coord(1/2)

Abstract

Responds to Kay, M.: The proper place of men and machines in language translation. Examines the appropriateness of machine translation (MT) under the following special circumstances: controlled domain-specific text and high-quality output; controlled domain-specific text and indicative output; dynamic general text and indicative output and dynamic general text and high-quality output. MT is appropriate in the 1st 3 cases but the 4th case requires human translation. Examines how MT research could be more useful for aiding human translation

Date

31. 7.1996 9:22:19

0.06812288 = product of:
  0.13624576 = sum of:
    0.13624576 = sum of:
      0.087150216 = weight(_text_:language in 3840) [ClassicSimilarity], result of:
        0.087150216 = score(doc=3840,freq=4.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.42911017 = fieldWeight in 3840, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.0546875 = fieldNorm(doc=3840)
      0.049095538 = weight(_text_:22 in 3840) [ClassicSimilarity], result of:
        0.049095538 = score(doc=3840,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.2708308 = fieldWeight in 3840, 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=3840)
  0.5 = coord(1/2)

Abstract

Linguistics is the scientific study of language which emphasizes language spoken in everyday settings by human beings. It has a long history of interdisciplinarity, both internally and in contribution to other fields, including information science. A linguistic perspective is beneficial in many ways in information science, since it examines the relationship between the forms of meaningful expressions and their social, cognitive, institutional, and communicative context, these being two perspectives on information that are actively studied, to different degrees, in information science. Examples of issues relevant to information science are presented for which the approach taken under a linguistic perspective is illustrated.

Date

27. 8.2011 14:22:33

0.06678528 = product of:
  0.13357057 = sum of:
    0.13357057 = sum of:
      0.091488674 = weight(_text_:language in 3244) [ClassicSimilarity], result of:
        0.091488674 = score(doc=3244,freq=6.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.45047188 = fieldWeight in 3244, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.046875 = fieldNorm(doc=3244)
      0.04208189 = weight(_text_:22 in 3244) [ClassicSimilarity], result of:
        0.04208189 = score(doc=3244,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.23214069 = fieldWeight in 3244, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=3244)
  0.5 = coord(1/2)

Abstract

Describes techniques for automatic construction of dictionaries for use in large-scale foreign language tutoring (FLT) and interlingual machine translation (MT) systems. The dictionaries are based on a language independent representation called lexical conceptual structure (LCS). Demonstrates that synonymous verb senses share distribution patterns. Shows how the syntax-semantics relation can be used to develop a lexical acquisition approach that contributes both toward the enrichment of existing online resources and toward the development of lexicons containing more complete information than is provided in any of these resources alone. Describes the structure of the LCS and shows how this representation is used in FLT and MT. Focuses on the problem of building LCS dictionaries for large-scale FLT and MT. Describes authoring tools for manual and semi-automatic construction of LCS dictionaries. Presents an approach that uses linguistic techniques for building word definitions automatically. The techniques have been implemented as part of a set of lixicon-development tools used in the MILT FLT project

Date

31. 7.1996 9:22:19

0.063268594 = product of:
  0.12653719 = sum of:
    0.12653719 = sum of:
      0.07042801 = weight(_text_:language in 771) [ClassicSimilarity], result of:
        0.07042801 = score(doc=771,freq=2.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.34677336 = fieldWeight in 771, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.0625 = fieldNorm(doc=771)
      0.056109186 = weight(_text_:22 in 771) [ClassicSimilarity], result of:
        0.056109186 = score(doc=771,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.30952093 = fieldWeight in 771, 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=771)
  0.5 = coord(1/2)

Content

Enthält folgende 9 Kapitel: The literal and the metaphoric; Views of metaphor; Knowledge representation; Representation schemes and conceptual graphs; The dynamic type hierarchy theory of metaphor; Computational approaches to metaphor; Thenature and structure of semantic hierarchies; Language games, open texture and family resemblance; Programming the dynamic type hierarchy; Subject index

Footnote

Bereits 1991 bei Kluwer publiziert // Rez. in: Knowledge organization 22(1995) no.1, S.48-49 (O. Sechser)

0.06291727 = product of:
  0.12583454 = sum of:
    0.12583454 = sum of:
      0.07624056 = weight(_text_:language in 2541) [ClassicSimilarity], result of:
        0.07624056 = score(doc=2541,freq=6.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.3753932 = fieldWeight in 2541, product of:
            2.4494898 = tf(freq=6.0), with freq of:
              6.0 = termFreq=6.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2541)
      0.04959398 = weight(_text_:22 in 2541) [ClassicSimilarity], result of:
        0.04959398 = score(doc=2541,freq=4.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.27358043 = fieldWeight in 2541, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=2541)
  0.5 = coord(1/2)

Abstract

The Specialized Information Services Division (SIS) of the National Library of Medicine (NLM) provides Web access to more than a dozen scientific databases on toxicology and the environment on TOXNET . Search queries on TOXNET often include misspelled or variant English words, medical and scientific jargon and chemical names. Following the example of search engines like Google and ClinicalTrials.gov, we set out to develop a spelling "suggestion" system for increased recall and precision in TOXNET searching. This paper describes development of dictionary technology that can be used in a variety of applications such as orthographic verification, writing aid, natural language processing, and information storage and retrieval. The design of the technology allows building complex applications using the components developed in the earlier phases of the work in a modular fashion without extensive rewriting of computer code. Since many of the potential applications envisioned for this work have on-line or web-based interfaces, the dictionaries and other computer components must have fast response, and must be adaptable to open-ended database vocabularies, including chemical nomenclature. The dictionary vocabulary for this work was derived from SIS and other databases and specialized resources, such as NLM's Unified Medical Language Systems (UMLS) . The resulting technology, A-Z Dictionary (AZdict), has three major constituents: 1) the vocabulary list, 2) the word attributes that define part of speech and morphological relationships between words in the list, and 3) a set of programs that implements the retrieval of words and their attributes, and determines similarity between words (ChemSpell). These three components can be used in various applications such as spelling verification, spelling aid, part-of-speech tagging, paraphrasing, and many other natural language processing functions.

Date

14. 8.2004 17:22:56

Source

Online. 28(2004) no.3, S.22-29

0.061551623 = product of:
  0.123103246 = sum of:
    0.123103246 = sum of:
      0.088035 = weight(_text_:language in 1171) [ClassicSimilarity], result of:
        0.088035 = score(doc=1171,freq=8.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.4334667 = fieldWeight in 1171, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1171)
      0.03506824 = weight(_text_:22 in 1171) [ClassicSimilarity], result of:
        0.03506824 = score(doc=1171,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.19345059 = fieldWeight in 1171, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1171)
  0.5 = coord(1/2)

Abstract

Logical rules are essential for uncovering the logical connections between relations, which could improve the reasoning performance and provide interpretable results on knowledge graphs (KGs). Although there have been many efforts to mine meaningful logical rules over KGs, existing methods suffer from the computationally intensive searches over the rule space and a lack of scalability for large-scale KGs. Besides, they often ignore the semantics of relations which is crucial for uncovering logical connections. Recently, large language models (LLMs) have shown impressive performance in the field of natural language processing and various applications, owing to their emergent ability and generalizability. In this paper, we propose a novel framework, ChatRule, unleashing the power of large language models for mining logical rules over knowledge graphs. Specifically, the framework is initiated with an LLM-based rule generator, leveraging both the semantic and structural information of KGs to prompt LLMs to generate logical rules. To refine the generated rules, a rule ranking module estimates the rule quality by incorporating facts from existing KGs. Last, a rule validator harnesses the reasoning ability of LLMs to validate the logical correctness of ranked rules through chain-of-thought reasoning. ChatRule is evaluated on four large-scale KGs, w.r.t. different rule quality metrics and downstream tasks, showing the effectiveness and scalability of our method.

Date

23.11.2023 19:07:22

0.058391035 = product of:
  0.11678207 = sum of:
    0.11678207 = sum of:
      0.074700184 = weight(_text_:language in 4436) [ClassicSimilarity], result of:
        0.074700184 = score(doc=4436,freq=4.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.3678087 = fieldWeight in 4436, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.046875 = fieldNorm(doc=4436)
      0.04208189 = weight(_text_:22 in 4436) [ClassicSimilarity], result of:
        0.04208189 = score(doc=4436,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.23214069 = fieldWeight in 4436, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=4436)
  0.5 = coord(1/2)

Abstract

Language barrier is the major problem that people face in searching for, retrieving, and understanding multilingual collections on the Internet. This paper deals with query translation and document translation in a Chinese-English information retrieval system called MTIR. Bilingual dictionary and monolingual corpus-based approaches are adopted to select suitable tranlated query terms. A machine transliteration algorithm is introduced to resolve proper name searching. We consider several design issues for document translation, including which material is translated, what roles the HTML tags play in translation, what the tradeoff is between the speed performance and the translation performance, and what from the translated result is presented in. About 100.000 Web pages translated in the last 4 months of 1997 are used for quantitative study of online and real-time Web page translation

Date

16. 2.2000 14:22:39

0.058391035 = product of:
  0.11678207 = sum of:
    0.11678207 = sum of:
      0.074700184 = weight(_text_:language in 75) [ClassicSimilarity], result of:
        0.074700184 = score(doc=75,freq=4.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.3678087 = fieldWeight in 75, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.046875 = fieldNorm(doc=75)
      0.04208189 = weight(_text_:22 in 75) [ClassicSimilarity], result of:
        0.04208189 = score(doc=75,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.23214069 = fieldWeight in 75, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.046875 = fieldNorm(doc=75)
  0.5 = coord(1/2)

Abstract

A technology is described which supports the acquisition, visualisation and manipulation of large vocabularies with associated structures. It is used for dictionary production, terminology data bases, thesauri, library classification systems etc. Essential features of the technology are a lexicographic user interface, variable word description, unlimited list of word readings, a concept language, automatic transformations of formulas into graphic structures, structure manipulation operations and retransformation into formulas. The concept language includes notations for undefined concepts. The structure of defined concepts can be constructed interactively. The technology supports the generation of large vocabularies with structures representing word senses. Concept structures and ordering systems for indexing and retrieval can be constructed separately and connected by associating relations.

Date

30.12.2001 19:01:22

0.05536002 = product of:
  0.11072004 = sum of:
    0.11072004 = sum of:
      0.0616245 = weight(_text_:language in 1361) [ClassicSimilarity], result of:
        0.0616245 = score(doc=1361,freq=2.0), product of:
          0.2030952 = queryWeight, product of:
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.051766515 = queryNorm
          0.30342668 = fieldWeight in 1361, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.9232929 = idf(docFreq=2376, maxDocs=44218)
            0.0546875 = fieldNorm(doc=1361)
      0.049095538 = weight(_text_:22 in 1361) [ClassicSimilarity], result of:
        0.049095538 = score(doc=1361,freq=2.0), product of:
          0.18127751 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.051766515 = queryNorm
          0.2708308 = fieldWeight in 1361, 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=1361)
  0.5 = coord(1/2)

Abstract

THESYS is based on the natural language processing of free-text databases. It yields statistically evaluated correlations between words of the database. These correlations correspond to traditional thesaurus relations. The person who has to build a thesaurus is thus assisted by the proposals made by THESYS. THESYS is being tested on commercial databases under real world conditions. It is part of a text processing project at Siemens, called TINA (Text-Inhalts-Analyse). Software from TINA is actually being applied and evaluated by the US Department of Commerce for patent search and indexing (REALIST: REtrieval Aids by Linguistics and STatistics)

Date

6. 1.1999 10:22:07