Search (75 results, page 1 of 4)

0.1277396 = product of:
  0.2554792 = sum of:
    0.2554792 = sum of:
      0.15786715 = weight(_text_:network in 4506) [ClassicSimilarity], result of:
        0.15786715 = score(doc=4506,freq=2.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.6888462 = fieldWeight in 4506, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.109375 = fieldNorm(doc=4506)
      0.097612046 = weight(_text_:22 in 4506) [ClassicSimilarity], result of:
        0.097612046 = score(doc=4506,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = 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)

Date

8.10.2000 11:52:22

0.10265097 = sum of:
  0.081734106 = product of:
    0.24520232 = sum of:
      0.24520232 = weight(_text_:3a in 562) [ClassicSimilarity], result of:
        0.24520232 = score(doc=562,freq=2.0), product of:
          0.43628904 = queryWeight, product of:
            8.478011 = idf(docFreq=24, maxDocs=44218)
            0.05146125 = 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.020916866 = product of:
    0.041833732 = sum of:
      0.041833732 = weight(_text_:22 in 562) [ClassicSimilarity], result of:
        0.041833732 = score(doc=562,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = 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.07381185 = product of:
  0.1476237 = sum of:
    0.1476237 = sum of:
      0.11276226 = weight(_text_:network in 1365) [ClassicSimilarity], result of:
        0.11276226 = score(doc=1365,freq=8.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.492033 = fieldWeight in 1365, product of:
            2.828427 = tf(freq=8.0), with freq of:
              8.0 = termFreq=8.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.0390625 = fieldNorm(doc=1365)
      0.034861445 = weight(_text_:22 in 1365) [ClassicSimilarity], result of:
        0.034861445 = score(doc=1365,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.19345059 = fieldWeight in 1365, 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=1365)
  0.5 = coord(1/2)

Abstract

The paper aims to present the relations of network theory and terminology. The model of scale-free networks, which has been recently developed and widely applied since, can be effectively used in terminology research as well. Operation based on the principle of networks is a universal characteristic of complex systems. Networks are governed by general laws. The model of scale-free networks can be viewed as a statistical-probability model, and it can be described with mathematical tools. Its main feature is that "everything is connected to everything else," that is, every node is reachable (in a few steps) starting from any other node; this phenomena is called "the small world phenomenon." The existence of a linguistic network and the general laws of the operation of networks enable us to place issues of language use in the complex system of relations that reveal the deeper connection s between phenomena with the help of networks embedded in each other. The realization of the metaphor that language also has a network structure is the basis of the classification methods of the terminological system, and likewise of the ways of creating terminology databases, which serve the purpose of providing easy and versatile accessibility to specialised knowledge.

Date

2. 9.2014 21:22:48

0.040867053 = product of:
  0.081734106 = sum of:
    0.081734106 = product of:
      0.24520232 = sum of:
        0.24520232 = weight(_text_:3a in 862) [ClassicSimilarity], result of:
          0.24520232 = score(doc=862,freq=2.0), product of:
            0.43628904 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.05146125 = 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.5 = coord(1/2)

Source

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

0.04010874 = product of:
  0.08021748 = sum of:
    0.08021748 = sum of:
      0.05581447 = weight(_text_:network in 1616) [ClassicSimilarity], result of:
        0.05581447 = score(doc=1616,freq=4.0), product of:
          0.22917621 = queryWeight, product of:
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.05146125 = queryNorm
          0.24354391 = fieldWeight in 1616, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            4.4533744 = idf(docFreq=1398, maxDocs=44218)
            0.02734375 = fieldNorm(doc=1616)
      0.024403011 = weight(_text_:22 in 1616) [ClassicSimilarity], result of:
        0.024403011 = score(doc=1616,freq=2.0), product of:
          0.18020853 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.05146125 = queryNorm
          0.1354154 = fieldWeight in 1616, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.02734375 = fieldNorm(doc=1616)
  0.5 = coord(1/2)

Abstract

The information available in languages other than English in the World Wide Web is increasing significantly. According to a report from Computer Economics in 1999, 54% of Internet users are English speakers ("English Will Dominate Web for Only Three More Years," Computer Economics, July 9, 1999, http://www.computereconomics. com/new4/pr/pr990610.html). However, it is predicted that there will be only 60% increase in Internet users among English speakers verses a 150% growth among nonEnglish speakers for the next five years. By 2005, 57% of Internet users will be non-English speakers. A report by CNN.com in 2000 showed that the number of Internet users in China had been increased from 8.9 million to 16.9 million from January to June in 2000 ("Report: China Internet users double to 17 million," CNN.com, July, 2000, http://cnn.org/2000/TECH/computing/07/27/ china.internet.reut/index.html). According to Nielsen/ NetRatings, there was a dramatic leap from 22.5 millions to 56.6 millions Internet users from 2001 to 2002. China had become the second largest global at-home Internet population in 2002 (US's Internet population was 166 millions) (Robyn Greenspan, "China Pulls Ahead of Japan," Internet.com, April 22, 2002, http://cyberatias.internet.com/big-picture/geographics/article/0,,5911_1013841,00. html). All of the evidences reveal the importance of crosslingual research to satisfy the needs in the near future. Digital library research has been focusing in structural and semantic interoperability in the past. Searching and retrieving objects across variations in protocols, formats and disciplines are widely explored (Schatz, B., & Chen, H. (1999). Digital libraries: technological advances and social impacts. IEEE Computer, Special Issue an Digital Libraries, February, 32(2), 45-50.; Chen, H., Yen, J., & Yang, C.C. (1999). International activities: development of Asian digital libraries. IEEE Computer, Special Issue an Digital Libraries, 32(2), 48-49.). However, research in crossing language boundaries, especially across European languages and Oriental languages, is still in the initial stage. In this proposal, we put our focus an cross-lingual semantic interoperability by developing automatic generation of a cross-lingual thesaurus based an English/Chinese parallel corpus. When the searchers encounter retrieval problems, Professional librarians usually consult the thesaurus to identify other relevant vocabularies. In the problem of searching across language boundaries, a cross-lingual thesaurus, which is generated by co-occurrence analysis and Hopfield network, can be used to generate additional semantically relevant terms that cannot be obtained from dictionary. In particular, the automatically generated cross-lingual thesaurus is able to capture the unknown words that do not exist in a dictionary, such as names of persons, organizations, and events. Due to Hong Kong's unique history background, both English and Chinese are used as official languages in all legal documents. Therefore, English/Chinese cross-lingual information retrieval is critical for applications in courts and the government. In this paper, we develop an automatic thesaurus by the Hopfield network based an a parallel corpus collected from the Web site of the Department of Justice of the Hong Kong Special Administrative Region (HKSAR) Government. Experiments are conducted to measure the precision and recall of the automatic generated English/Chinese thesaurus. The result Shows that such thesaurus is a promising tool to retrieve relevant terms, especially in the language that is not the same as the input term. The direct translation of the input term can also be retrieved in most of the cases.

0.039466787 = product of:
  0.078933574 = sum of:
    0.078933574 = product of:
      0.15786715 = sum of:
        0.15786715 = weight(_text_:network in 6416) [ClassicSimilarity], result of:
          0.15786715 = score(doc=6416,freq=2.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.6888462 = fieldWeight in 6416, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.109375 = fieldNorm(doc=6416)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

0.034179244 = product of:
  0.06835849 = sum of:
    0.06835849 = product of:
      0.13671698 = sum of:
        0.13671698 = weight(_text_:network in 2764) [ClassicSimilarity], result of:
          0.13671698 = score(doc=2764,freq=6.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.59655833 = fieldWeight in 2764, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.0546875 = fieldNorm(doc=2764)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

The ACL Anthology is a large collection of research papers in computational linguistics. Citation data were obtained using text extraction from a collection of PDF files with significant manual postprocessing performed to clean up the results. Manual annotation of the references was then performed to complete the citation network. We analyzed the networks of paper citations, author citations, and author collaborations in an attempt to identify the most central papers and authors. The analysis includes general network statistics, PageRank, metrics across publication years and venues, the impact factor and h-index, as well as other measures.

0.028190564 = product of:
  0.05638113 = sum of:
    0.05638113 = product of:
      0.11276226 = sum of:
        0.11276226 = weight(_text_:network in 4236) [ClassicSimilarity], result of:
          0.11276226 = score(doc=4236,freq=2.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.492033 = fieldWeight in 4236, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.078125 = fieldNorm(doc=4236)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Presents an overview of some recent developments in the clause-based content analysis of linguistic data. Introduces network analysis of evaluative texts, for the analysis of cognitive maps, and linguistic content analysis. Focuses on the types of substantive inferences afforded by the three approaches

0.028190564 = product of:
  0.05638113 = sum of:
    0.05638113 = product of:
      0.11276226 = sum of:
        0.11276226 = weight(_text_:network in 5043) [ClassicSimilarity], result of:
          0.11276226 = score(doc=5043,freq=8.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.492033 = fieldWeight in 5043, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.0390625 = fieldNorm(doc=5043)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

This paper is concerned with paraphrase detection, i.e., identifying sentences that are semantically identical. The ability to detect similar sentences written in natural language is crucial for several applications, such as text mining, text summarization, plagiarism detection, authorship authentication and question answering. Recognizing this importance, we study in particular how to address the challenges with detecting paraphrases in user generated short texts, such as Twitter, which often contain language irregularity and noise, and do not necessarily contain as much semantic information as longer clean texts. We propose a novel deep neural network-based approach that relies on coarse-grained sentence modelling using a convolutional neural network (CNN) and a recurrent neural network (RNN) model, combined with a specific fine-grained word-level similarity matching model. More specifically, we develop a new architecture, called DeepParaphrase, which enables to create an informative semantic representation of each sentence by (1) using CNN to extract the local region information in form of important n-grams from the sentence, and (2) applying RNN to capture the long-term dependency information. In addition, we perform a comparative study on state-of-the-art approaches within paraphrase detection. An important insight from this study is that existing paraphrase approaches perform well when applied on clean texts, but they do not necessarily deliver good performance against noisy texts, and vice versa. In contrast, our evaluation has shown that the proposed DeepParaphrase-based approach achieves good results in both types of texts, thus making it more robust and generic than the existing approaches.

0.027907236 = product of:
  0.05581447 = sum of:
    0.05581447 = product of:
      0.11162894 = sum of:
        0.11162894 = weight(_text_:network in 1059) [ClassicSimilarity], result of:
          0.11162894 = score(doc=1059,freq=4.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.48708782 = fieldWeight in 1059, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1059)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

We present a new part-of-speech tagger that demonstrates the following ideas: (i) explicit use of both preceding and following tag contexts via a dependency network representation, (ii) broad use of lexical features, including jointly conditioning on multiple consecutive words, (iii) effective use of priors in conditional loglinear models, and (iv) fine-grained modeling of unknown word features. Using these ideas together, the resulting tagger gives a 97.24%accuracy on the Penn TreebankWSJ, an error reduction of 4.4% on the best previous single automatically learned tagging result.

0.027889157 = product of:
  0.055778313 = sum of:
    0.055778313 = product of:
      0.11155663 = sum of:
        0.11155663 = weight(_text_:22 in 337) [ClassicSimilarity], result of:
          0.11155663 = score(doc=337,freq=2.0), product of:
            0.18020853 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05146125 = 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)
  0.5 = coord(1/2)

Source

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

0.024403011 = product of:
  0.048806023 = sum of:
    0.048806023 = product of:
      0.097612046 = sum of:
        0.097612046 = weight(_text_:22 in 3164) [ClassicSimilarity], result of:
          0.097612046 = score(doc=3164,freq=2.0), product of:
            0.18020853 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05146125 = 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.5 = coord(1/2)

Source

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

0.024403011 = product of:
  0.048806023 = sum of:
    0.048806023 = product of:
      0.097612046 = sum of:
        0.097612046 = weight(_text_:22 in 6672) [ClassicSimilarity], result of:
          0.097612046 = score(doc=6672,freq=2.0), product of:
            0.18020853 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05146125 = 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.5 = coord(1/2)

Date

31. 7.1996 9:22:19

0.024403011 = product of:
  0.048806023 = sum of:
    0.048806023 = product of:
      0.097612046 = sum of:
        0.097612046 = weight(_text_:22 in 1179) [ClassicSimilarity], result of:
          0.097612046 = score(doc=1179,freq=2.0), product of:
            0.18020853 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05146125 = 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.5 = coord(1/2)

Date

31. 7.1996 9:22:19

0.024403011 = product of:
  0.048806023 = sum of:
    0.048806023 = product of:
      0.097612046 = sum of:
        0.097612046 = weight(_text_:22 in 3117) [ClassicSimilarity], result of:
          0.097612046 = score(doc=3117,freq=2.0), product of:
            0.18020853 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05146125 = 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.5 = coord(1/2)

Date

28. 2.1999 10:48:22

0.024403011 = product of:
  0.048806023 = sum of:
    0.048806023 = product of:
      0.097612046 = sum of:
        0.097612046 = weight(_text_:22 in 1079) [ClassicSimilarity], result of:
          0.097612046 = score(doc=1079,freq=2.0), product of:
            0.18020853 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.05146125 = queryNorm
            0.5416616 = fieldWeight in 1079, 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=1079)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Date

27. 1.2023 16:22:55

0.023920486 = product of:
  0.04784097 = sum of:
    0.04784097 = product of:
      0.09568194 = sum of:
        0.09568194 = weight(_text_:network in 2777) [ClassicSimilarity], result of:
          0.09568194 = score(doc=2777,freq=4.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.41750383 = fieldWeight in 2777, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.046875 = fieldNorm(doc=2777)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

In this paper, a supervised neural network has been used to classify pairs of terms as being multiwords or non-multiwords. Classification is based an the values yielded by different estimators, currently available in literature, used as inputs for the neural network. Lists of multiwords and non-multiwords have been built to train the net. Afterward, many other pairs of terms have been classified using the trained net. Results obtained in this classification have been used to perform information retrieval tasks. Experiments show that detecting multiwords results in better performance of the IR methods.

0.023920486 = product of:
  0.04784097 = sum of:
    0.04784097 = product of:
      0.09568194 = sum of:
        0.09568194 = weight(_text_:network in 1205) [ClassicSimilarity], result of:
          0.09568194 = score(doc=1205,freq=4.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.41750383 = fieldWeight in 1205, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.046875 = fieldNorm(doc=1205)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Detecting science-technology hierarchical linkages is beneficial for understanding deep interactions between science and technology (S&T). Previous studies have mainly focused on linear linkages between S&T but ignored their structural linkages. In this paper, we propose a network coupling approach to inspect hierarchical interactions of S&T by integrating their knowledge linkages and structural linkages. S&T knowledge networks are first enhanced with bidirectional encoder representation from transformers (BERT) knowledge alignment, and then their hierarchical structures are identified based on K-core decomposition. Hierarchical coupling preferences and strengths of the S&T networks over time are further calculated based on similarities of coupling nodes' degree distribution and similarities of coupling edges' weight distribution. Extensive experimental results indicate that our approach is feasible and robust in identifying the coupling hierarchy with superior performance compared to other isomorphism and dissimilarity algorithms. Our research extends the mindset of S&T linkage measurement by identifying patterns and paths of the interaction of S&T hierarchical knowledge.

0.022552451 = product of:
  0.045104902 = sum of:
    0.045104902 = product of:
      0.090209804 = sum of:
        0.090209804 = weight(_text_:network in 6686) [ClassicSimilarity], result of:
          0.090209804 = score(doc=6686,freq=2.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.3936264 = fieldWeight in 6686, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.0625 = fieldNorm(doc=6686)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Abstract

Presents research on the design of knowledge-based document retrieval systems in which a semantic network was adopted to represent subject knowledge and classification scheme knowledge and experts' search strategies and user modelling capability were modelled as procedural knowledge. These functionalities were incorporated into a prototype knowledge-based retrieval system, Metacat. Describes a system, the design of which was based on the blackboard architecture, which was able to create a user profile, identify task requirements, suggest heuristics-based search strategies, perform semantic-based search assistance, and assist online query refinement

0.022552451 = product of:
  0.045104902 = sum of:
    0.045104902 = product of:
      0.090209804 = sum of:
        0.090209804 = weight(_text_:network in 6295) [ClassicSimilarity], result of:
          0.090209804 = score(doc=6295,freq=2.0), product of:
            0.22917621 = queryWeight, product of:
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.05146125 = queryNorm
            0.3936264 = fieldWeight in 6295, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.4533744 = idf(docFreq=1398, maxDocs=44218)
              0.0625 = fieldNorm(doc=6295)
      0.5 = coord(1/2)
  0.5 = coord(1/2)

Footnote

Übers. d. Titels: Use of a network of lexical co-occurences to improve a thematic analysis based on distribution of words