Search (7 results, page 1 of 1)

0.029110933 = product of:
  0.058221865 = sum of:
    0.058221865 = product of:
      0.23288746 = sum of:
        0.23288746 = weight(_text_:3a in 862) [ClassicSimilarity], result of:
          0.23288746 = score(doc=862,freq=2.0), product of:
            0.4143772 = queryWeight, product of:
              8.478011 = idf(docFreq=24, maxDocs=44218)
              0.0488767 = 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.25 = coord(1/4)
  0.5 = coord(1/2)

Source

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

0.013244236 = product of:
  0.026488472 = sum of:
    0.026488472 = product of:
      0.052976944 = sum of:
        0.052976944 = weight(_text_:22 in 5749) [ClassicSimilarity], result of:
          0.052976944 = score(doc=5749,freq=2.0), product of:
            0.17115787 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0488767 = 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)
  0.5 = coord(1/2)

Date

2. 3.2020 19:04:22

0.012149302 = product of:
  0.024298605 = sum of:
    0.024298605 = product of:
      0.09719442 = sum of:
        0.09719442 = weight(_text_:authors in 900) [ClassicSimilarity], result of:
          0.09719442 = score(doc=900,freq=6.0), product of:
            0.22281978 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.0488767 = queryNorm
            0.43620193 = fieldWeight in 900, product of:
              2.4494898 = tf(freq=6.0), with freq of:
                6.0 = termFreq=6.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.0390625 = fieldNorm(doc=900)
      0.25 = coord(1/4)
  0.5 = coord(1/2)

Abstract

Purpose A number of approaches and algorithms have been proposed over the years as a basis for automatic indexing. Many of these approaches suffer from precision inefficiency at low recall. The choice of indexing units has a great impact on search system effectiveness. The authors dive beyond simple terms indexing to propose a framework for multi-word terms (MWT) filtering and indexing. Design/methodology/approach In this paper, the authors rely on ranking MWT to filter them, keeping the most effective ones for the indexing process. The proposed model is based on filtering MWT according to their ability to capture the document topic and distinguish between different documents from the same collection. The authors rely on the hypothesis that the best MWT are those that achieve the greatest association degree. The experiments are carried out with English and French languages data sets. Findings The results indicate that this approach achieved precision enhancements at low recall, and it performed better than more advanced models based on terms dependencies. Originality/value Using and testing different association measures to select MWT that best describe the documents to enhance the precision in the first retrieved documents.

0.011903835 = product of:
  0.02380767 = sum of:
    0.02380767 = product of:
      0.09523068 = sum of:
        0.09523068 = weight(_text_:authors in 846) [ClassicSimilarity], result of:
          0.09523068 = score(doc=846,freq=4.0), product of:
            0.22281978 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.0488767 = queryNorm
            0.42738882 = fieldWeight in 846, product of:
              2.0 = tf(freq=4.0), with freq of:
                4.0 = termFreq=4.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.046875 = fieldNorm(doc=846)
      0.25 = coord(1/4)
  0.5 = coord(1/2)

Abstract

It is well known that, within the Latin production of written text, peculiar metric schemes were followed not only in poetic compositions, but also in many prose works. Such metric patterns were based on so-called syllabic quantity, that is, on the length of the involved syllables, and there is substantial evidence suggesting that certain authors had a preference for certain metric patterns over others. In this research we investigate the possibility to employ syllabic quantity as a base for deriving rhythmic features for the task of computational authorship attribution of Latin prose texts. We test the impact of these features on the authorship attribution task when combined with other topic-agnostic features. Our experiments, carried out on three different datasets using support vector machines (SVMs) show that rhythmic features based on syllabic quantity are beneficial in discriminating among Latin prose authors.

0.009820162 = product of:
  0.019640325 = sum of:
    0.019640325 = product of:
      0.0785613 = sum of:
        0.0785613 = weight(_text_:authors in 1139) [ClassicSimilarity], result of:
          0.0785613 = score(doc=1139,freq=2.0), product of:
            0.22281978 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.0488767 = queryNorm
            0.35257778 = fieldWeight in 1139, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1139)
      0.25 = coord(1/4)
  0.5 = coord(1/2)

Abstract

In light of AI (Artificial Intelligence) and NLP (Natural language processing) technologies, this article examines the feasibility of using AI/NLP models to enhance the subject indexing of digital resources. While BERT (Bidirectional Encoder Representations from Transformers) models are widely used in scholarly communities, the authors assess whether BERT models can be used in machine-assisted indexing in the Project Gutenberg collection, through suggesting Library of Congress subject headings filtered by certain Library of Congress Classification subclass labels. The findings of this study are informative for further research on BERT models to assist with automatic subject indexing for digital library collections.

0.008277647 = product of:
  0.016555294 = sum of:
    0.016555294 = product of:
      0.03311059 = sum of:
        0.03311059 = weight(_text_:22 in 1171) [ClassicSimilarity], result of:
          0.03311059 = score(doc=1171,freq=2.0), product of:
            0.17115787 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.0488767 = 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)
  0.5 = coord(1/2)

Date

23.11.2023 19:07:22

0.007014402 = product of:
  0.014028804 = sum of:
    0.014028804 = product of:
      0.056115218 = sum of:
        0.056115218 = weight(_text_:authors in 972) [ClassicSimilarity], result of:
          0.056115218 = score(doc=972,freq=2.0), product of:
            0.22281978 = queryWeight, product of:
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.0488767 = queryNorm
            0.25184128 = fieldWeight in 972, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              4.558814 = idf(docFreq=1258, maxDocs=44218)
              0.0390625 = fieldNorm(doc=972)
      0.25 = coord(1/4)
  0.5 = coord(1/2)

Abstract

Believable proxies of human behavior can empower interactive applications ranging from immersive environments to rehearsal spaces for interpersonal communication to prototyping tools. In this paper, we introduce generative agents--computational software agents that simulate believable human behavior. Generative agents wake up, cook breakfast, and head to work; artists paint, while authors write; they form opinions, notice each other, and initiate conversations; they remember and reflect on days past as they plan the next day. To enable generative agents, we describe an architecture that extends a large language model to store a complete record of the agent's experiences using natural language, synthesize those memories over time into higher-level reflections, and retrieve them dynamically to plan behavior. We instantiate generative agents to populate an interactive sandbox environment inspired by The Sims, where end users can interact with a small town of twenty five agents using natural language. In an evaluation, these generative agents produce believable individual and emergent social behaviors: for example, starting with only a single user-specified notion that one agent wants to throw a Valentine's Day party, the agents autonomously spread invitations to the party over the next two days, make new acquaintances, ask each other out on dates to the party, and coordinate to show up for the party together at the right time. We demonstrate through ablation that the components of our agent architecture--observation, planning, and reflection--each contribute critically to the believability of agent behavior. By fusing large language models with computational, interactive agents, this work introduces architectural and interaction patterns for enabling believable simulations of human behavior.