-
Brown, T.B.; Mann, B.; Ryder, N.; Subbiah, M.; Kaplan, J.; Dhariwal, P.; Neelakantan, A.; Shyam, P.; Sastry, G.; Askell, A.; Agarwal, S.; Herbert-Voss, A.; Krueger, G.; Henighan, T.; Child, R.; Ramesh, A.; Ziegler, D.M.; Wu, J.; Winter, C.; Hesse, C.; Chen, M.; Sigler, E.; Litwin, M.; Gray, S.; Chess, B.; Clark, J.; Berner, C.; McCandlish, S.; Radford, A.; Sutskever, I.; Amodei, D.: Language models are few-shot learners (2020)
0.00
0.0019187195 = product of:
0.003837439 = sum of:
0.003837439 = product of:
0.007674878 = sum of:
0.007674878 = weight(_text_:a in 872) [ClassicSimilarity], result of:
0.007674878 = score(doc=872,freq=24.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.17652355 = fieldWeight in 872, product of:
4.8989797 = tf(freq=24.0), with freq of:
24.0 = termFreq=24.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.03125 = fieldNorm(doc=872)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Recent work has demonstrated substantial gains on many NLP tasks and benchmarks by pre-training on a large corpus of text followed by fine-tuning on a specific task. While typically task-agnostic in architecture, this method still requires task-specific fine-tuning datasets of thousands or tens of thousands of examples. By contrast, humans can generally perform a new language task from only a few examples or from simple instructions - something which current NLP systems still largely struggle to do. Here we show that scaling up language models greatly improves task-agnostic, few-shot performance, sometimes even reaching competitiveness with prior state-of-the-art fine-tuning approaches. Specifically, we train GPT-3, an autoregressive language model with 175 billion parameters, 10x more than any previous non-sparse language model, and test its performance in the few-shot setting. For all tasks, GPT-3 is applied without any gradient updates or fine-tuning, with tasks and few-shot demonstrations specified purely via text interaction with the model. GPT-3 achieves strong performance on many NLP datasets, including translation, question-answering, and cloze tasks, as well as several tasks that require on-the-fly reasoning or domain adaptation, such as unscrambling words, using a novel word in a sentence, or performing 3-digit arithmetic. At the same time, we also identify some datasets where GPT-3's few-shot learning still struggles, as well as some datasets where GPT-3 faces methodological issues related to training on large web corpora. Finally, we find that GPT-3 can generate samples of news articles which human evaluators have difficulty distinguishing from articles written by humans. We discuss broader societal impacts of this finding and of GPT-3 in general.
- Type
- a
-
Zadeh, B.Q.; Handschuh, S.: ¬The ACL RD-TEC : a dataset for benchmarking terminology extraction and classification in computational linguistics (2014)
0.00
0.0018577921 = product of:
0.0037155843 = sum of:
0.0037155843 = product of:
0.0074311686 = sum of:
0.0074311686 = weight(_text_:a in 2803) [ClassicSimilarity], result of:
0.0074311686 = score(doc=2803,freq=10.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.1709182 = fieldWeight in 2803, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=2803)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- This paper introduces ACL RD-TEC: a dataset for evaluating the extraction and classification of terms from literature in the domain of computational linguistics. The dataset is derived from the Association for Computational Linguistics anthology reference corpus (ACL ARC). In its first release, the ACL RD-TEC consists of automatically segmented, part-of-speech-tagged ACL ARC documents, three lists of candidate terms, and more than 82,000 manually annotated terms. The annotated terms are marked as either valid or invalid, and valid terms are further classified as technology and non-technology terms. Technology terms signify methods, algorithms, and solutions in computational linguistics. The paper describes the dataset and reports the relevant statistics. We hope the step described in this paper encourages a collaborative effort towards building a full-fledged annotated corpus from the computational linguistics literature.
- Type
- a
-
Vaswani, A.; Shazeer, N.; Parmar, N.; Uszkoreit, J.; Jones, L.; Gomez, A.N.; Kaiser, L.; Polosukhin, I.: Attention Is all you need (2017)
0.00
0.0018577921 = product of:
0.0037155843 = sum of:
0.0037155843 = product of:
0.0074311686 = sum of:
0.0074311686 = weight(_text_:a in 970) [ClassicSimilarity], result of:
0.0074311686 = score(doc=970,freq=10.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.1709182 = fieldWeight in 970, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=970)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- The dominant sequence transduction models are based on complex recurrent or convolutional neural networks in an encoder-decoder configuration. The best performing models also connect the encoder and decoder through an attention mechanism. We propose a new simple network architecture, the Transformer, based solely on attention mechanisms, dispensing with recurrence and convolutions entirely. Experiments on two machine translation tasks show these models to be superior in quality while being more parallelizable and requiring significantly less time to train. Our model achieves 28.4 BLEU on the WMT 2014 English-to-German translation task, improving over the existing best results, including ensembles by over 2 BLEU. On the WMT 2014 English-to-French translation task, our model establishes a new single-model state-of-the-art BLEU score of 41.8 after training for 3.5 days on eight GPUs, a small fraction of the training costs of the best models from the literature. We show that the Transformer generalizes well to other tasks by applying it successfully to English constituency parsing both with large and limited training data.
- Type
- a
-
Park, J.S.; O'Brien, J.C.; Cai, C.J.; Ringel Morris, M.; Liang, P.; Bernstein, M.S.: Generative agents : interactive simulacra of human behavior (2023)
0.00
0.0016959244 = product of:
0.0033918489 = sum of:
0.0033918489 = product of:
0.0067836978 = sum of:
0.0067836978 = weight(_text_:a in 972) [ClassicSimilarity], result of:
0.0067836978 = score(doc=972,freq=12.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.15602624 = fieldWeight in 972, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0390625 = fieldNorm(doc=972)
0.5 = coord(1/2)
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.
- Type
- a
-
Stoykova, V.; Petkova, E.: Automatic extraction of mathematical terms for precalculus (2012)
0.00
0.0016788795 = product of:
0.003357759 = sum of:
0.003357759 = product of:
0.006715518 = sum of:
0.006715518 = weight(_text_:a in 156) [ClassicSimilarity], result of:
0.006715518 = score(doc=156,freq=6.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.1544581 = fieldWeight in 156, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=156)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- In this work, we present the results of research for evaluating a methodology for extracting mathematical terms for precalculus using the techniques for semantically-oriented statistical search. We use the corpus-based approach and the combination of different statistically-based techniques for extracting keywords, collocations and co-occurrences incorporated in the Sketch Engine software. We evaluate the collocations candidate terms for the basic concept function(s) and approve the related methodology by precalculus domain conceptual terms definitions. Finally, we offer a conceptual terms hierarchical representation and discuss the results with respect to their possible applications.
- Type
- a
-
Shen, M.; Liu, D.-R.; Huang, Y.-S.: Extracting semantic relations to enrich domain ontologies (2012)
0.00
0.0016788795 = product of:
0.003357759 = sum of:
0.003357759 = product of:
0.006715518 = sum of:
0.006715518 = weight(_text_:a in 267) [ClassicSimilarity], result of:
0.006715518 = score(doc=267,freq=6.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.1544581 = fieldWeight in 267, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.0546875 = fieldNorm(doc=267)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Domain ontologies facilitate the organization, sharing and reuse of domain knowledge, and enable various vertical domain applications to operate successfully. Most methods for automatically constructing ontologies focus on taxonomic relations, such as is-kind-of and is- part-of relations. However, much of the domain-specific semantics is ignored. This work proposes a semi-unsupervised approach for extracting semantic relations from domain-specific text documents. The approach effectively utilizes text mining and existing taxonomic relations in domain ontologies to discover candidate keywords that can represent semantic relations. A preliminary experiment on the natural science domain (Taiwan K9 education) indicates that the proposed method yields valuable recommendations. This work enriches domain ontologies by adding distilled semantics.
- Type
- a
-
Altmann, E.G.; Cristadoro, G.; Esposti, M.D.: On the origin of long-range correlations in texts (2012)
0.00
0.0016616598 = product of:
0.0033233196 = sum of:
0.0033233196 = product of:
0.006646639 = sum of:
0.006646639 = weight(_text_:a in 330) [ClassicSimilarity], result of:
0.006646639 = score(doc=330,freq=8.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.15287387 = fieldWeight in 330, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.046875 = fieldNorm(doc=330)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- The complexity of human interactions with social and natural phenomena is mirrored in the way we describe our experiences through natural language. In order to retain and convey such a high dimensional information, the statistical properties of our linguistic output has to be highly correlated in time. An example are the robust observations, still largely not understood, of correlations on arbitrary long scales in literary texts. In this paper we explain how long-range correlations flow from highly structured linguistic levels down to the building blocks of a text (words, letters, etc..). By combining calculations and data analysis we show that correlations take form of a bursty sequence of events once we approach the semantically relevant topics of the text. The mechanisms we identify are fairly general and can be equally applied to other hierarchical settings.
- Type
- a
-
Voss, O.: Übersetzer überflüssig? : Sprachsoftware DeepL und Acrolinx (2019)
0.00
0.0016616598 = product of:
0.0033233196 = sum of:
0.0033233196 = product of:
0.006646639 = sum of:
0.006646639 = weight(_text_:a in 4981) [ClassicSimilarity], result of:
0.006646639 = score(doc=4981,freq=2.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.15287387 = fieldWeight in 4981, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.09375 = fieldNorm(doc=4981)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Metz, C.: ¬The new chatbots could change the world : can you trust them? (2022)
0.00
0.0016616598 = product of:
0.0033233196 = sum of:
0.0033233196 = product of:
0.006646639 = sum of:
0.006646639 = weight(_text_:a in 854) [ClassicSimilarity], result of:
0.006646639 = score(doc=854,freq=2.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.15287387 = fieldWeight in 854, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.09375 = fieldNorm(doc=854)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Ramisch, C.; Schreiner, P.; Idiart, M.; Villavicencio, A.: ¬An evaluation of methods for the extraction of multiword expressions (20xx)
0.00
0.0015666279 = product of:
0.0031332558 = sum of:
0.0031332558 = product of:
0.0062665115 = sum of:
0.0062665115 = weight(_text_:a in 962) [ClassicSimilarity], result of:
0.0062665115 = score(doc=962,freq=4.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.14413087 = fieldWeight in 962, 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=962)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Rajasurya, S.; Muralidharan, T.; Devi, S.; Swamynathan, S.: Semantic information retrieval using ontology in university domain (2012)
0.00
0.0015481601 = product of:
0.0030963202 = sum of:
0.0030963202 = product of:
0.0061926404 = sum of:
0.0061926404 = weight(_text_:a in 2861) [ClassicSimilarity], result of:
0.0061926404 = score(doc=2861,freq=10.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.14243183 = fieldWeight in 2861, 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=2861)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Abstract
- Today's conventional search engines hardly do provide the essential content relevant to the user's search query. This is because the context and semantics of the request made by the user is not analyzed to the full extent. So here the need for a semantic web search arises. SWS is upcoming in the area of web search which combines Natural Language Processing and Artificial Intelligence. The objective of the work done here is to design, develop and implement a semantic search engine- SIEU(Semantic Information Extraction in University Domain) confined to the university domain. SIEU uses ontology as a knowledge base for the information retrieval process. It is not just a mere keyword search. It is one layer above what Google or any other search engines retrieve by analyzing just the keywords. Here the query is analyzed both syntactically and semantically. The developed system retrieves the web results more relevant to the user query through keyword expansion. The results obtained here will be accurate enough to satisfy the request made by the user. The level of accuracy will be enhanced since the query is analyzed semantically. The system will be of great use to the developers and researchers who work on web. The Google results are re-ranked and optimized for providing the relevant links. For ranking an algorithm has been applied which fetches more apt results for the user query.
- Type
- a
-
Simanowski, R.: Wenn die Dinge anfangen zu sprechen : Chatbot LaMDA von Google (2022)
0.00
0.0013847164 = product of:
0.0027694327 = sum of:
0.0027694327 = product of:
0.0055388655 = sum of:
0.0055388655 = weight(_text_:a in 864) [ClassicSimilarity], result of:
0.0055388655 = score(doc=864,freq=2.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.12739488 = fieldWeight in 864, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.078125 = fieldNorm(doc=864)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Leighton, T.: ChatGPT und Künstliche Intelligenz : Utopie oder Dystopie? (2023)
0.00
0.0013847164 = product of:
0.0027694327 = sum of:
0.0027694327 = product of:
0.0055388655 = sum of:
0.0055388655 = weight(_text_:a in 908) [ClassicSimilarity], result of:
0.0055388655 = score(doc=908,freq=2.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.12739488 = fieldWeight in 908, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.078125 = fieldNorm(doc=908)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Barthel, J.; Ciesielski, R.: Regeln zu ChatGPT an Unis oft unklar : KI in der Bildung (2023)
0.00
0.0013847164 = product of:
0.0027694327 = sum of:
0.0027694327 = product of:
0.0055388655 = sum of:
0.0055388655 = weight(_text_:a in 925) [ClassicSimilarity], result of:
0.0055388655 = score(doc=925,freq=2.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.12739488 = fieldWeight in 925, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.078125 = fieldNorm(doc=925)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Janssen, J.-K.: ChatGPT-Klon läuft lokal auf jedem Rechner : Alpaca/LLaMA ausprobiert (2023)
0.00
0.0013847164 = product of:
0.0027694327 = sum of:
0.0027694327 = product of:
0.0055388655 = sum of:
0.0055388655 = weight(_text_:a in 927) [ClassicSimilarity], result of:
0.0055388655 = score(doc=927,freq=2.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.12739488 = fieldWeight in 927, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.078125 = fieldNorm(doc=927)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Lutz-Westphal, B.: ChatGPT und der "Faktor Mensch" im schulischen Mathematikunterricht (2023)
0.00
0.0013847164 = product of:
0.0027694327 = sum of:
0.0027694327 = product of:
0.0055388655 = sum of:
0.0055388655 = weight(_text_:a in 930) [ClassicSimilarity], result of:
0.0055388655 = score(doc=930,freq=2.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.12739488 = fieldWeight in 930, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.078125 = fieldNorm(doc=930)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Harari, Y.N.: ¬[Yuval-Noah-Harari-argues-that] AI has hacked the operating system of human civilisation (2023)
0.00
0.0013847164 = product of:
0.0027694327 = sum of:
0.0027694327 = product of:
0.0055388655 = sum of:
0.0055388655 = weight(_text_:a in 953) [ClassicSimilarity], result of:
0.0055388655 = score(doc=953,freq=2.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.12739488 = fieldWeight in 953, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.078125 = fieldNorm(doc=953)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Hahn, S.: DarkBERT ist mit Daten aus dem Darknet trainiert : ChatGPTs dunkler Bruder? (2023)
0.00
0.0013847164 = product of:
0.0027694327 = sum of:
0.0027694327 = product of:
0.0055388655 = sum of:
0.0055388655 = weight(_text_:a in 979) [ClassicSimilarity], result of:
0.0055388655 = score(doc=979,freq=2.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.12739488 = fieldWeight in 979, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.078125 = fieldNorm(doc=979)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Siepmann, D.: Auswirkungen von KI auf die Textproduktion in der Wissenschaft (2023)
0.00
0.0013847164 = product of:
0.0027694327 = sum of:
0.0027694327 = product of:
0.0055388655 = sum of:
0.0055388655 = weight(_text_:a in 1044) [ClassicSimilarity], result of:
0.0055388655 = score(doc=1044,freq=2.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.12739488 = fieldWeight in 1044, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.078125 = fieldNorm(doc=1044)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
-
Weßels, D.: ChatGPT - ein Meilenstein der KI-Entwicklung (2023)
0.00
0.0013847164 = product of:
0.0027694327 = sum of:
0.0027694327 = product of:
0.0055388655 = sum of:
0.0055388655 = weight(_text_:a in 1051) [ClassicSimilarity], result of:
0.0055388655 = score(doc=1051,freq=2.0), product of:
0.043477926 = queryWeight, product of:
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.037706986 = queryNorm
0.12739488 = fieldWeight in 1051, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.153047 = idf(docFreq=37942, maxDocs=44218)
0.078125 = fieldNorm(doc=1051)
0.5 = coord(1/2)
0.5 = coord(1/2)
- Type
- a
