Search (18 results, page 1 of 1)

  • × theme_ss:"Suchmaschinen"
  • × type_ss:"el"
  1. Gillitzer, B.: Yewno (2017) 0.02 
    0.024050627 = product of:
  0.09620251 = sum of:
    0.09620251 = sum of:
      0.07581388 = weight(_text_:intelligenz in 3447) [ClassicSimilarity], result of:
        0.07581388 = score(doc=3447,freq=4.0), product of:
          0.21362439 = queryWeight, product of:
            5.678294 = idf(docFreq=410, maxDocs=44218)
            0.037621226 = queryNorm
          0.3548934 = fieldWeight in 3447, product of:
            2.0 = tf(freq=4.0), with freq of:
              4.0 = termFreq=4.0
            5.678294 = idf(docFreq=410, maxDocs=44218)
            0.03125 = fieldNorm(doc=3447)
      0.020388626 = weight(_text_:22 in 3447) [ClassicSimilarity], result of:
        0.020388626 = score(doc=3447,freq=2.0), product of:
          0.13174312 = queryWeight, product of:
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.037621226 = queryNorm
          0.15476047 = fieldWeight in 3447, product of:
            1.4142135 = tf(freq=2.0), with freq of:
              2.0 = termFreq=2.0
            3.5018296 = idf(docFreq=3622, maxDocs=44218)
            0.03125 = fieldNorm(doc=3447)
  0.25 = coord(1/4)
    Abstract
    Yewno findet Themen und Konzepte (Suchbegriffe und ihre Abstraktionen) in englischsprachigen digitalen Texten mit Methoden des maschinellen Lernens und der künstlichen Intelligenz. Als Ergebnis Ihrer Suchanfrage werden die Konzepte, die Ihre Anfrage betreffen, in vielfältigen sachlichen Beziehungen als graphisches Netzwerk präsentiert, über das Sie einfach navigieren können. Auch versteckte thematische Beziehungen werden hier sichtbar gemacht, die vom Bekannten zu neuen Entdeckungen führen. Im Rahmen einer Pilotphase können Sie über einen interdisziplinären Ausschnitt aus aktuellen englischsprachigen Fachzeitschriften verschiedenster Fachgebiete recherchieren. Die zu den Themen gehörigen Artikel werden in Ausschnitten unmittelbar angezeigt und können in den meisten Fällen direkt als Volltext aufgerufen werden.
    "Die Bayerische Staatsbibliothek testet den semantischen "Discovery Service" Yewno als zusätzliche thematische Suchmaschine für digitale Volltexte. Der Service ist unter folgendem Link erreichbar: https://www.bsb-muenchen.de/recherche-und-service/suchen-und-finden/yewno/. Das Identifizieren von Themen, um die es in einem Text geht, basiert bei Yewno alleine auf Methoden der künstlichen Intelligenz und des maschinellen Lernens. Dabei werden sie nicht - wie bei klassischen Katalogsystemen - einem Text als Ganzem zugeordnet, sondern der jeweiligen Textstelle. Die Eingabe eines Suchwortes bzw. Themas, bei Yewno "Konzept" genannt, führt umgehend zu einer grafischen Darstellung eines semantischen Netzwerks relevanter Konzepte und ihrer inhaltlichen Zusammenhänge. So ist ein Navigieren über thematische Beziehungen bis hin zu den Fundstellen im Text möglich, die dann in sogenannten Snippets angezeigt werden. In der Test-Anwendung der Bayerischen Staatsbibliothek durchsucht Yewno aktuell 40 Millionen englischsprachige Dokumente aus Publikationen namhafter Wissenschaftsverlage wie Cambridge University Press, Oxford University Press, Wiley, Sage und Springer, sowie Dokumente, die im Open Access verfügbar sind. Nach der dreimonatigen Testphase werden zunächst die Rückmeldungen der Nutzer ausgewertet. Ob und wann dann der Schritt von der klassischen Suchmaschine zum semantischen "Discovery Service" kommt und welche Bedeutung Anwendungen wie Yewno in diesem Zusammenhang einnehmen werden, ist heute noch nicht abzusehen. Die Software Yewno wurde vom gleichnamigen Startup in Zusammenarbeit mit der Stanford University entwickelt, mit der auch die Bayerische Staatsbibliothek eng kooperiert. [Inetbib-Posting vom 22.02.2017].
    Date
    22. 2.2017 10:16:49
  2. Boldi, P.; Santini, M.; Vigna, S.: PageRank as a function of the damping factor (2005) 0.02 
    0.015199585 = product of:
  0.03039917 = sum of:
    0.017656278 = product of:
      0.05296883 = sum of:
        0.05296883 = weight(_text_:k in 2564) [ClassicSimilarity], result of:
          0.05296883 = score(doc=2564,freq=8.0), product of:
            0.13429943 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.037621226 = queryNorm
            0.39440846 = fieldWeight in 2564, product of:
              2.828427 = tf(freq=8.0), with freq of:
                8.0 = termFreq=8.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.0390625 = fieldNorm(doc=2564)
      0.33333334 = coord(1/3)
    0.012742892 = product of:
      0.025485784 = sum of:
        0.025485784 = weight(_text_:22 in 2564) [ClassicSimilarity], result of:
          0.025485784 = score(doc=2564,freq=2.0), product of:
            0.13174312 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.037621226 = queryNorm
            0.19345059 = fieldWeight in 2564, 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=2564)
      0.5 = coord(1/2)
  0.5 = coord(2/4)
    Abstract
    PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor alpha that spreads uniformly part of the rank. The choice of alpha is eminently empirical, and in most cases the original suggestion alpha=0.85 by Brin and Page is still used. Recently, however, the behaviour of PageRank with respect to changes in alpha was discovered to be useful in link-spam detection. Moreover, an analytical justification of the value chosen for alpha is still missing. In this paper, we give the first mathematical analysis of PageRank when alpha changes. In particular, we show that, contrarily to popular belief, for real-world graphs values of alpha close to 1 do not give a more meaningful ranking. Then, we give closed-form formulae for PageRank derivatives of any order, and an extension of the Power Method that approximates them with convergence O(t**k*alpha**t) for the k-th derivative. Finally, we show a tight connection between iterated computation and analytical behaviour by proving that the k-th iteration of the Power Method gives exactly the PageRank value obtained using a Maclaurin polynomial of degree k. The latter result paves the way towards the application of analytical methods to the study of PageRank.
    Date
    16. 1.2016 10:22:28
  3. Weiß, E.-M.: ChatGPT soll es richten : Microsoft baut KI in Suchmaschine Bing ein (2023) 0.01 
    0.011726861 = product of:
  0.046907444 = sum of:
    0.046907444 = product of:
      0.09381489 = sum of:
        0.09381489 = weight(_text_:intelligenz in 866) [ClassicSimilarity], result of:
          0.09381489 = score(doc=866,freq=2.0), product of:
            0.21362439 = queryWeight, product of:
              5.678294 = idf(docFreq=410, maxDocs=44218)
              0.037621226 = queryNorm
            0.43915814 = fieldWeight in 866, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.678294 = idf(docFreq=410, maxDocs=44218)
              0.0546875 = fieldNorm(doc=866)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Abstract
    ChatGPT, die künstliche Intelligenz der Stunde, ist von OpenAI entwickelt worden. Und OpenAI ist in der Vergangenheit nicht unerheblich von Microsoft unterstützt worden. Nun geht es ums Profitieren: Die KI soll in die Suchmaschine Bing eingebaut werden, was eine direkte Konkurrenz zu Googles Suchalgorithmen und Intelligenzen bedeutet. Bing war da bislang nicht sonderlich erfolgreich. Wie "The Information" mit Verweis auf zwei Insider berichtet, plant Microsoft, ChatGPT in seine Suchmaschine Bing einzubauen. Bereits im März könnte die neue, intelligente Suche verfügbar sein. Microsoft hatte zuvor auf der hauseigenen Messe Ignite zunächst die Integration des Bildgenerators DALL·E 2 in seine Suchmaschine angekündigt - ohne konkretes Startdatum jedoch. Fragt man ChatGPT selbst, bestätigt der Chatbot seine künftige Aufgabe noch nicht. Weiß aber um potentielle Vorteile.
  4. Dunning, A.: Do we still need search engines? (1999) 0.01 
    0.008920024 = product of:
  0.035680097 = sum of:
    0.035680097 = product of:
      0.07136019 = sum of:
        0.07136019 = weight(_text_:22 in 6021) [ClassicSimilarity], result of:
          0.07136019 = score(doc=6021,freq=2.0), product of:
            0.13174312 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.037621226 = queryNorm
            0.5416616 = fieldWeight in 6021, 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=6021)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Source
    Ariadne. 1999, no.22
  5. Birmingham, J.: Internet search engines (1996) 0.01 
    0.0076457346 = product of:
  0.030582938 = sum of:
    0.030582938 = product of:
      0.061165877 = sum of:
        0.061165877 = weight(_text_:22 in 5664) [ClassicSimilarity], result of:
          0.061165877 = score(doc=5664,freq=2.0), product of:
            0.13174312 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.037621226 = queryNorm
            0.46428138 = fieldWeight in 5664, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.09375 = fieldNorm(doc=5664)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    10.11.1996 16:36:22
  6. Weigert, M.: Erkunden statt suchen : HORIZOBU (2011) 0.01 
    0.0058634304 = product of:
  0.023453722 = sum of:
    0.023453722 = product of:
      0.046907444 = sum of:
        0.046907444 = weight(_text_:intelligenz in 4442) [ClassicSimilarity], result of:
          0.046907444 = score(doc=4442,freq=2.0), product of:
            0.21362439 = queryWeight, product of:
              5.678294 = idf(docFreq=410, maxDocs=44218)
              0.037621226 = queryNorm
            0.21957907 = fieldWeight in 4442, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.678294 = idf(docFreq=410, maxDocs=44218)
              0.02734375 = fieldNorm(doc=4442)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Content
    Wer bei horizobu, das in einer englischsprachigen und einer deutschsprachigen Version (für die Schweiz) angeboten wird, nach einem bestimmten Begriff sucht, dem präsentiert der Dienst lediglich sechs möglichst relevante Ergebnisse in voneinander separierten Boxen. Einzelne dieser Boxen lassen sich löschen, wodurch ein weiteres Suchergebnis ans Tageslicht befördert wird. Mit einem Klick auf "More" wechselt man alle sechs Resultate aus. Gefällige Resultate lassen sich per Drag-And-Drop in der rechten Spalte ablegen und für später aufbewahren. Um seinem Entdeckeranspruch gerecht zu werden, listet horizobu oberhalb der Suchergebnisse zehn mit dem jeweiligen Suchwort verwandte Begriffe, die beliebig kombinierbar zur Verfeinerung und Erweiterung der bisherigen Suche verwendet werden können. Inspiriert durch die Vorschläge haben User auch die Möglichkeit, weitere Begriffe zur Eingrenzung hinzufügen. "Die Intelligenz aus Social Software führt teilweise zu überraschenden Fundstücken, die bislang mit herkömmlichen Suchmaschinen kaum erschlossen wurden", so Werner Hartmann, Titularprofessor der ETH Zürich und einer der zwei Gründer von horizobu. Nachdem Nutzer mit den Resultaten ihrer Recherche zufrieden sind und diese womöglich mit der Bookmarking-Funktion gespeichert haben, kann die so entstandene Linksammlung direkt über einen eindeutigen Link weiterversendet werden (das sieht z.B. so aus). Diese Funktion ist zwar nicht revolutionär, aber simpel, intuitiv und erfordert wenige Klicks.
  7. Campbell, K.: Understanding and comparing search engines (1996) 0.01 
    0.0052968836 = product of:
  0.021187535 = sum of:
    0.021187535 = product of:
      0.0635626 = sum of:
        0.0635626 = weight(_text_:k in 5666) [ClassicSimilarity], result of:
          0.0635626 = score(doc=5666,freq=2.0), product of:
            0.13429943 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.037621226 = queryNorm
            0.47329018 = fieldWeight in 5666, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.09375 = fieldNorm(doc=5666)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)
  8. Bensman, S.J.: Eugene Garfield, Francis Narin, and PageRank : the theoretical bases of the Google search engine (2013) 0.01 
    0.0050971564 = product of:
  0.020388626 = sum of:
    0.020388626 = product of:
      0.04077725 = sum of:
        0.04077725 = weight(_text_:22 in 1149) [ClassicSimilarity], result of:
          0.04077725 = score(doc=1149,freq=2.0), product of:
            0.13174312 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.037621226 = queryNorm
            0.30952093 = fieldWeight in 1149, 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=1149)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    17.12.2013 11:02:22
  9. Schaat, S.: Von der automatisierten Manipulation zur Manipulation der Automatisierung (2019) 0.01 
    0.0050971564 = product of:
  0.020388626 = sum of:
    0.020388626 = product of:
      0.04077725 = sum of:
        0.04077725 = weight(_text_:22 in 4996) [ClassicSimilarity], result of:
          0.04077725 = score(doc=4996,freq=2.0), product of:
            0.13174312 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.037621226 = queryNorm
            0.30952093 = fieldWeight in 4996, 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=4996)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    19. 2.2019 17:22:00
  10. Lischka, K.; Kremp, M.: Was der Google-Gegner weiß - und was nicht (2009) 0.00 
    0.0044140695 = product of:
  0.017656278 = sum of:
    0.017656278 = product of:
      0.05296883 = sum of:
        0.05296883 = weight(_text_:k in 4443) [ClassicSimilarity], result of:
          0.05296883 = score(doc=4443,freq=2.0), product of:
            0.13429943 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.037621226 = queryNorm
            0.39440846 = fieldWeight in 4443, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.078125 = fieldNorm(doc=4443)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)
  11. Graf, K.: Großer Suchmaschinentest 2021 : Alternativen zu Google? (2021) 0.00 
    0.0044140695 = product of:
  0.017656278 = sum of:
    0.017656278 = product of:
      0.05296883 = sum of:
        0.05296883 = weight(_text_:k in 2443) [ClassicSimilarity], result of:
          0.05296883 = score(doc=2443,freq=2.0), product of:
            0.13429943 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.037621226 = queryNorm
            0.39440846 = fieldWeight in 2443, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.078125 = fieldNorm(doc=2443)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)
  12. Place, E.: Internationale Zusammenarbeit bei Internet Subject Gateways (1999) 0.00 
    0.0038228673 = product of:
  0.015291469 = sum of:
    0.015291469 = product of:
      0.030582938 = sum of:
        0.030582938 = weight(_text_:22 in 4189) [ClassicSimilarity], result of:
          0.030582938 = score(doc=4189,freq=2.0), product of:
            0.13174312 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.037621226 = queryNorm
            0.23214069 = fieldWeight in 4189, 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=4189)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    22. 6.2002 19:35:09
  13. Baeza-Yates, R.; Boldi, P.; Castillo, C.: Generalizing PageRank : damping functions for linkbased ranking algorithms (2006) 0.00 
    0.003185723 = product of:
  0.012742892 = sum of:
    0.012742892 = product of:
      0.025485784 = sum of:
        0.025485784 = weight(_text_:22 in 2565) [ClassicSimilarity], result of:
          0.025485784 = score(doc=2565,freq=2.0), product of:
            0.13174312 = queryWeight, product of:
              3.5018296 = idf(docFreq=3622, maxDocs=44218)
              0.037621226 = queryNorm
            0.19345059 = fieldWeight in 2565, 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=2565)
      0.5 = coord(1/2)
  0.25 = coord(1/4)
    Date
    16. 1.2016 10:22:28
  14. Bryan, K.; Leise, T.: ¬The $25.000.000.000 eigenvector : the linear algebra behind Google 0.00 
    0.0030898487 = product of:
  0.012359395 = sum of:
    0.012359395 = product of:
      0.037078183 = sum of:
        0.037078183 = weight(_text_:k in 1353) [ClassicSimilarity], result of:
          0.037078183 = score(doc=1353,freq=2.0), product of:
            0.13429943 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.037621226 = queryNorm
            0.27608594 = fieldWeight in 1353, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.0546875 = fieldNorm(doc=1353)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)
  15. El-Ramly, N.; Peterson. R.E.; Volonino, L.: Top ten Web sites using search engines : the case of the desalination industry (1996) 0.00 
    0.0026484418 = product of:
  0.010593767 = sum of:
    0.010593767 = product of:
      0.0317813 = sum of:
        0.0317813 = weight(_text_:k in 945) [ClassicSimilarity], result of:
          0.0317813 = score(doc=945,freq=2.0), product of:
            0.13429943 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.037621226 = queryNorm
            0.23664509 = fieldWeight in 945, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.046875 = fieldNorm(doc=945)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)
    Abstract
    The desalination industry involves the desalting of sea or brackish water and achieves the purpose of increasing the worls's effective water supply. There are approximately 4.000 desalination Web sites. The six major Internet search engines were used to determine, according to each of the six, the top twenty sites for desalination. Each site was visited and the 120 gross returns were pared down to the final ten - the 'Top Ten'. The Top Ten were then analyzed to determine what it was that made the sites useful and informative. The major attributes were: a) currency (up-to-date); b) search site capability; c) access to articles on desalination; d) newsletters; e) databases; f) product information; g) online conferencing; h) valuable links to other sites; l) communication links; j) site maps; and k) case studies. Reasons for having a Web site and the current status and prospects for Internet commerce are discussed
  16. Khare, R.; Cutting, D.; Sitaker, K.; Rifkin, A.: Nutch: a flexible and scalable open-source Web search engine (2004) 0.00 
    0.0026484418 = product of:
  0.010593767 = sum of:
    0.010593767 = product of:
      0.0317813 = sum of:
        0.0317813 = weight(_text_:k in 852) [ClassicSimilarity], result of:
          0.0317813 = score(doc=852,freq=2.0), product of:
            0.13429943 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.037621226 = queryNorm
            0.23664509 = fieldWeight in 852, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.046875 = fieldNorm(doc=852)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)
  17. Körber, S.: Suchmuster erfahrener und unerfahrener Suchmaschinennutzer im deutschsprachigen World Wide Web (2000) 0.00 
    0.0017656278 = product of:
  0.007062511 = sum of:
    0.007062511 = product of:
      0.021187533 = sum of:
        0.021187533 = weight(_text_:k in 5938) [ClassicSimilarity], result of:
          0.021187533 = score(doc=5938,freq=2.0), product of:
            0.13429943 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.037621226 = queryNorm
            0.15776339 = fieldWeight in 5938, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.03125 = fieldNorm(doc=5938)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)
    Content
    [Magisterarbeit] - Rez. in: Online Mitteilungen 2001, Nr.69, S.41-43 (K. Patzwaldt) (Vgl. auch: http://www.ideenreich.com/suchmaschinen/kritik.shtml)
  18. Teutsch, K.: ¬Die Welt ist doch eine Scheibe : Google-Herausforderer eyePlorer (2009) 0.00 
    0.0011035174 = product of:
  0.0044140695 = sum of:
    0.0044140695 = product of:
      0.0132422075 = sum of:
        0.0132422075 = weight(_text_:k in 2678) [ClassicSimilarity], result of:
          0.0132422075 = score(doc=2678,freq=2.0), product of:
            0.13429943 = queryWeight, product of:
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.037621226 = queryNorm
            0.098602116 = fieldWeight in 2678, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              3.569778 = idf(docFreq=3384, maxDocs=44218)
              0.01953125 = fieldNorm(doc=2678)
      0.33333334 = coord(1/3)
  0.25 = coord(1/4)

Authors

Years

Languages

Types

Themes