-
Ahmed, M.: Automatic indexing for agriculture : designing a framework by deploying Agrovoc, Agris and Annif (2023)
0.00
0.0030491136 = product of:
0.006098227 = sum of:
0.006098227 = product of:
0.012196454 = sum of:
0.012196454 = weight(_text_:a in 1024) [ClassicSimilarity], result of:
0.012196454 = score(doc=1024,freq=26.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.22966442 = fieldWeight in 1024, product of:
5.0990195 = tf(freq=26.0), with freq of:
26.0 = termFreq=26.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=1024)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- There are several ways to employ machine learning for automating subject indexing. One popular strategy is to utilize a supervised learning algorithm to train a model on a set of documents that have been manually indexed by subject matter using a standard vocabulary. The resulting model can then predict the subject of new and previously unseen documents by identifying patterns learned from the training data. To do this, the first step is to gather a large dataset of documents and manually assign each document a set of subject keywords/descriptors from a controlled vocabulary (e.g., from Agrovoc). Next, the dataset (obtained from Agris) can be divided into - i) a training dataset, and ii) a test dataset. The training dataset is used to train the model, while the test dataset is used to evaluate the model's performance. Machine learning can be a powerful tool for automating the process of subject indexing. This research is an attempt to apply Annif (http://annif. org/), an open-source AI/ML framework, to autogenerate subject keywords/descriptors for documentary resources in the domain of agriculture. The training dataset is obtained from Agris, which applies the Agrovoc thesaurus as a vocabulary tool (https://www.fao.org/agris/download).
- Type
- a
-
Asula, M.; Makke, J.; Freienthal, L.; Kuulmets, H.-A.; Sirel, R.: Kratt: developing an automatic subject indexing tool for the National Library of Estonia : how to transfer metadata information among work cluster members (2021)
0.00
0.0030444188 = product of:
0.0060888375 = sum of:
0.0060888375 = product of:
0.012177675 = sum of:
0.012177675 = weight(_text_:a in 723) [ClassicSimilarity], result of:
0.012177675 = score(doc=723,freq=18.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.22931081 = fieldWeight in 723, product of:
4.2426405 = tf(freq=18.0), with freq of:
18.0 = termFreq=18.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=723)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Manual subject indexing in libraries is a time-consuming and costly process and the quality of the assigned subjects is affected by the cataloger's knowledge on the specific topics contained in the book. Trying to solve these issues, we exploited the opportunities arising from artificial intelligence to develop Kratt: a prototype of an automatic subject indexing tool. Kratt is able to subject index a book independent of its extent and genre with a set of keywords present in the Estonian Subject Thesaurus. It takes Kratt approximately one minute to subject index a book, outperforming humans 10-15 times. Although the resulting keywords were not considered satisfactory by the catalogers, the ratings of a small sample of regular library users showed more promise. We also argue that the results can be enhanced by including a bigger corpus for training the model and applying more careful preprocessing techniques.
- Type
- a
-
Moulaison-Sandy, H.; Adkins, D.; Bossaller, J.; Cho, H.: ¬An automated approach to describing fiction : a methodology to use book reviews to identify affect (2021)
0.00
0.0026473717 = product of:
0.0052947435 = sum of:
0.0052947435 = product of:
0.010589487 = sum of:
0.010589487 = weight(_text_:a in 710) [ClassicSimilarity], result of:
0.010589487 = score(doc=710,freq=10.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.19940455 = fieldWeight in 710, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=710)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Subject headings and genre terms are notoriously difficult to apply, yet are important for fiction. The current project functions as a proof of concept, using a text-mining methodology to identify affective information (emotion and tone) about fiction titles from professional book reviews as a potential first step in automating the subject analysis process. Findings are presented and discussed, comparing results to the range of aboutness and isness information in library cataloging records. The methodology is likewise presented, and how future work might expand on the current project to enhance catalog records through text-mining is explored.
- Type
- a
-
Oliver, C.: Leveraging KOS to extend our reach with automated processes (2021)
0.00
0.001913537 = product of:
0.003827074 = sum of:
0.003827074 = product of:
0.007654148 = sum of:
0.007654148 = weight(_text_:a in 722) [ClassicSimilarity], result of:
0.007654148 = score(doc=722,freq=4.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.14413087 = fieldWeight in 722, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0625 = fieldNorm(doc=722)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- This article provides a conclusion to the special issue on Artificial Intelligence (AI) and Automated Processes for Subject Access. The authors who contributed to this special issue have provoked interesting questions as well as bringing attention to important issues. This concluding article looks at common themes and highlights some of the questions raised.
- Type
- a
-
Yang, T.-H.; Hsieh, Y.-L.; Liu, S.-H.; Chang, Y.-C.; Hsu, W.-L.: ¬A flexible template generation and matching method with applications for publication reference metadata extraction (2021)
0.00
0.0018909799 = product of:
0.0037819599 = sum of:
0.0037819599 = product of:
0.0075639198 = sum of:
0.0075639198 = weight(_text_:a in 63) [ClassicSimilarity], result of:
0.0075639198 = score(doc=63,freq=10.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.14243183 = fieldWeight in 63, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=63)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Conventional rule-based approaches use exact template matching to capture linguistic information and necessarily need to enumerate all variations. We propose a novel flexible template generation and matching scheme called the principle-based approach (PBA) based on sequence alignment, and employ it for reference metadata extraction (RME) to demonstrate its effectiveness. The main contributions of this research are threefold. First, we propose an automatic template generation that can capture prominent patterns using the dominating set algorithm. Second, we devise an alignment-based template-matching technique that uses a logistic regression model, which makes it more general and flexible than pure rule-based approaches. Last, we apply PBA to RME on extensive cross-domain corpora and demonstrate its robustness and generality. Experiments reveal that the same set of templates produced by the PBA framework not only deliver consistent performance on various unseen domains, but also surpass hand-crafted knowledge (templates). We use four independent journal style test sets and one conference style test set in the experiments. When compared to renowned machine learning methods, such as conditional random fields (CRF), as well as recent deep learning methods (i.e., bi-directional long short-term memory with a CRF layer, Bi-LSTM-CRF), PBA has the best performance for all datasets.
- Type
- a
-
Matthews, P.; Glitre, K.: Genre analysis of movies using a topic model of plot summaries (2021)
0.00
0.001757696 = product of:
0.003515392 = sum of:
0.003515392 = product of:
0.007030784 = sum of:
0.007030784 = weight(_text_:a in 412) [ClassicSimilarity], result of:
0.007030784 = score(doc=412,freq=6.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.13239266 = fieldWeight in 412, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=412)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Genre plays an important role in the description, navigation, and discovery of movies, but it is rarely studied at large scale using quantitative methods. This allows an analysis of how genre labels are applied, how genres are composed and how these ingredients change, and how genres compare. We apply unsupervised topic modeling to a large collection of textual movie summaries and then use the model's topic proportions to investigate key questions in genre, including recognizability, mapping, canonicity, and change over time. We find that many genres can be quite easily predicted by their lexical signatures and this defines their position on the genre landscape. We find significant genre composition changes between periods for westerns, science fiction and road movies, reflecting changes in production and consumption values. We show that in terms of canonicity, canonical examples are often at the high end of the topic distribution profile for the genre rather than central as might be predicted by categorization theory.
- Type
- a
-
Lowe, D.B.; Dollinger, I.; Koster, T.; Herbert, B.E.: Text mining for type of research classification (2021)
0.00
0.001757696 = product of:
0.003515392 = sum of:
0.003515392 = product of:
0.007030784 = sum of:
0.007030784 = weight(_text_:a in 720) [ClassicSimilarity], result of:
0.007030784 = score(doc=720,freq=6.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.13239266 = fieldWeight in 720, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=720)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- This project brought together undergraduate students in Computer Science with librarians to mine abstracts of articles from the Texas A&M University Libraries' institutional repository, OAKTrust, in order to probe the creation of new metadata to improve discovery and use. The mining operation task consisted simply of classifying the articles into two categories of research type: basic research ("for understanding," "curiosity-based," or "knowledge-based") and applied research ("use-based"). These categories are fundamental especially for funders but are also important to researchers. The mining-to-classification steps took several iterations, but ultimately, we achieved good results with the toolkit BERT (Bidirectional Encoder Representations from Transformers). The project and its workflows represent a preview of what may lie ahead in the future of crafting metadata using text mining techniques to enhance discoverability.
- Type
- a
-
Zhang, Y.; Zhang, C.; Li, J.: Joint modeling of characters, words, and conversation contexts for microblog keyphrase extraction (2020)
0.00
0.0016913437 = product of:
0.0033826875 = sum of:
0.0033826875 = product of:
0.006765375 = sum of:
0.006765375 = weight(_text_:a in 5816) [ClassicSimilarity], result of:
0.006765375 = score(doc=5816,freq=8.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.12739488 = fieldWeight in 5816, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=5816)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Millions of messages are produced on microblog platforms every day, leading to the pressing need for automatic identification of key points from the massive texts. To absorb salient content from the vast bulk of microblog posts, this article focuses on the task of microblog keyphrase extraction. In previous work, most efforts treat messages as independent documents and might suffer from the data sparsity problem exhibited in short and informal microblog posts. On the contrary, we propose to enrich contexts via exploiting conversations initialized by target posts and formed by their replies, which are generally centered around relevant topics to the target posts and therefore helpful for keyphrase identification. Concretely, we present a neural keyphrase extraction framework, which has 2 modules: a conversation context encoder and a keyphrase tagger. The conversation context encoder captures indicative representation from their conversation contexts and feeds the representation into the keyphrase tagger, and the keyphrase tagger extracts salient words from target posts. The 2 modules were trained jointly to optimize the conversation context encoding and keyphrase extraction processes. In the conversation context encoder, we leverage hierarchical structures to capture the word-level indicative representation and message-level indicative representation hierarchically. In both of the modules, we apply character-level representations, which enables the model to explore morphological features and deal with the out-of-vocabulary problem caused by the informal language style of microblog messages. Extensive comparison results on real-life data sets indicate that our model outperforms state-of-the-art models from previous studies.
- Type
- a
-
Villaespesa, E.; Crider, S.: ¬A critical comparison analysis between human and machine-generated tags for the Metropolitan Museum of Art's collection (2021)
0.00
0.0014647468 = product of:
0.0029294936 = sum of:
0.0029294936 = product of:
0.005858987 = sum of:
0.005858987 = weight(_text_:a in 341) [ClassicSimilarity], result of:
0.005858987 = score(doc=341,freq=6.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.11032722 = fieldWeight in 341, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=341)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Purpose Based on the highlights of The Metropolitan Museum of Art's collection, the purpose of this paper is to examine the similarities and differences between the subject keywords tags assigned by the museum and those produced by three computer vision systems. Design/methodology/approach This paper uses computer vision tools to generate the data and the Getty Research Institute's Art and Architecture Thesaurus (AAT) to compare the subject keyword tags. Findings This paper finds that there are clear opportunities to use computer vision technologies to automatically generate tags that expand the terms used by the museum. This brings a new perspective to the collection that is different from the traditional art historical one. However, the study also surfaces challenges about the accuracy and lack of context within the computer vision results. Practical implications This finding has important implications on how these machine-generated tags complement the current taxonomies and vocabularies inputted in the collection database. In consequence, the museum needs to consider the selection process for choosing which computer vision system to apply to their collection. Furthermore, they also need to think critically about the kind of tags they wish to use, such as colors, materials or objects. Originality/value The study results add to the rapidly evolving field of computer vision within the art information context and provide recommendations of aspects to consider before selecting and implementing these technologies.
- Type
- a
-
Franke-Maier, M.; Beck, C.; Kasprzik, A.; Maas, J.F.; Pielmeier, S.; Wiesenmüller, H: ¬Ein Feuerwerk an Algorithmen und der Startschuss zur Bildung eines Kompetenznetzwerks für maschinelle Erschließung : Bericht zur Fachtagung Netzwerk maschinelle Erschließung an der Deutschen Nationalbibliothek am 10. und 11. Oktober 2019 (2020)
0.00
0.0014351527 = product of:
0.0028703054 = sum of:
0.0028703054 = product of:
0.005740611 = sum of:
0.005740611 = weight(_text_:a in 5851) [ClassicSimilarity], result of:
0.005740611 = score(doc=5851,freq=4.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.10809815 = fieldWeight in 5851, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=5851)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Suominen, O.; Koskenniemi, I.: Annif Analyzer Shootout : comparing text lemmatization methods for automated subject indexing (2022)
0.00
0.0011959607 = product of:
0.0023919214 = sum of:
0.0023919214 = product of:
0.0047838427 = sum of:
0.0047838427 = weight(_text_:a in 658) [ClassicSimilarity], result of:
0.0047838427 = score(doc=658,freq=4.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.090081796 = fieldWeight in 658, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=658)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Automated text classification is an important function for many AI systems relevant to libraries, including automated subject indexing and classification. When implemented using the traditional natural language processing (NLP) paradigm, one key part of the process is the normalization of words using stemming or lemmatization, which reduces the amount of linguistic variation and often improves the quality of classification. In this paper, we compare the output of seven different text lemmatization algorithms as well as two baseline methods. We measure how the choice of method affects the quality of text classification using example corpora in three languages. The experiments have been performed using the open source Annif toolkit for automated subject indexing and classification, but should generalize also to other NLP toolkits and similar text classification tasks. The results show that lemmatization methods in most cases outperform baseline methods in text classification particularly for Finnish and Swedish text, but not English, where baseline methods are most effective. The differences between lemmatization methods are quite small. The systematic comparison will help optimize text classification pipelines and inform the further development of the Annif toolkit to incorporate a wider choice of normalization methods.
- Type
- a
-
Golub, K.: Automated subject indexing : an overview (2021)
0.00
0.0011839407 = product of:
0.0023678814 = sum of:
0.0023678814 = product of:
0.0047357627 = sum of:
0.0047357627 = weight(_text_:a in 718) [ClassicSimilarity], result of:
0.0047357627 = score(doc=718,freq=2.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.089176424 = fieldWeight in 718, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=718)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Lepsky, K.: Automatisches Indexieren (2023)
0.00
0.0011839407 = product of:
0.0023678814 = sum of:
0.0023678814 = product of:
0.0047357627 = sum of:
0.0047357627 = weight(_text_:a in 781) [ClassicSimilarity], result of:
0.0047357627 = score(doc=781,freq=2.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.089176424 = fieldWeight in 781, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=781)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Chou, C.; Chu, T.: ¬An analysis of BERT (NLP) for assisted subject indexing for Project Gutenberg (2022)
0.00
0.0011839407 = product of:
0.0023678814 = sum of:
0.0023678814 = product of:
0.0047357627 = sum of:
0.0047357627 = weight(_text_:a in 1139) [ClassicSimilarity], result of:
0.0047357627 = score(doc=1139,freq=2.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.089176424 = fieldWeight in 1139, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=1139)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Pielmeier, S.; Voß, V.; Carstensen, H.; Kahl, B.: Online-Workshop "Computerunterstützte Inhaltserschließung" 2020 (2021)
0.00
0.0010148063 = product of:
0.0020296127 = sum of:
0.0020296127 = product of:
0.0040592253 = sum of:
0.0040592253 = weight(_text_:a in 4409) [ClassicSimilarity], result of:
0.0040592253 = score(doc=4409,freq=2.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.07643694 = fieldWeight in 4409, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=4409)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Junger, U.; Scholze, F.: Neue Wege und Qualitäten : die Inhaltserschließungspolitik der Deutschen Nationalbibliothek (2021)
0.00
0.0010148063 = product of:
0.0020296127 = sum of:
0.0020296127 = product of:
0.0040592253 = sum of:
0.0040592253 = weight(_text_:a in 365) [ClassicSimilarity], result of:
0.0040592253 = score(doc=365,freq=2.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.07643694 = fieldWeight in 365, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=365)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Sack, H.: Hybride Künstliche Intelligenz in der automatisierten Inhaltserschließung (2021)
0.00
0.0010148063 = product of:
0.0020296127 = sum of:
0.0020296127 = product of:
0.0040592253 = sum of:
0.0040592253 = weight(_text_:a in 372) [ClassicSimilarity], result of:
0.0040592253 = score(doc=372,freq=2.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.07643694 = fieldWeight in 372, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=372)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Qualität in der Inhaltserschließung (2021)
0.00
9.567685E-4 = product of:
0.001913537 = sum of:
0.001913537 = product of:
0.003827074 = sum of:
0.003827074 = weight(_text_:a in 753) [ClassicSimilarity], result of:
0.003827074 = score(doc=753,freq=4.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.072065435 = fieldWeight in 753, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.03125 = fieldNorm(doc=753)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Editor
- Franke-Maier, M., A. Kasprzik, A. Ledl u. H. Schürmann
-
Kasprzik, A.: Aufbau eines produktiven Dienstes für die automatisierte Inhaltserschließung an der ZBW : ein Status- und Erfahrungsbericht. (2023)
0.00
9.567685E-4 = product of:
0.001913537 = sum of:
0.001913537 = product of:
0.003827074 = sum of:
0.003827074 = weight(_text_:a in 935) [ClassicSimilarity], result of:
0.003827074 = score(doc=935,freq=4.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.072065435 = fieldWeight in 935, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.03125 = fieldNorm(doc=935)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Pintscher, L.; Bourgonje, P.; Moreno Schneider, J.; Ostendorff, M.; Rehm, G.: Wissensbasen für die automatische Erschließung und ihre Qualität am Beispiel von Wikidata : die Inhaltserschließungspolitik der Deutschen Nationalbibliothek (2021)
0.00
8.4567186E-4 = product of:
0.0016913437 = sum of:
0.0016913437 = product of:
0.0033826875 = sum of:
0.0033826875 = weight(_text_:a in 366) [ClassicSimilarity], result of:
0.0033826875 = score(doc=366,freq=2.0), product of:
0.053105544 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046056706 = queryNorm
0.06369744 = fieldWeight in 366, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=366)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
