-
Sprachtechnologie, mobile Kommunikation und linguistische Ressourcen : Beiträge zur GLDV Tagung 2005 in Bonn (2005)
0.04
0.041178323 = product of:
0.06176748 = sum of:
0.04025957 = weight(_text_:search in 3578) [ClassicSimilarity], result of:
0.04025957 = score(doc=3578,freq=8.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.230407 = fieldWeight in 3578, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0234375 = fieldNorm(doc=3578)
0.021507913 = product of:
0.043015826 = sum of:
0.043015826 = weight(_text_:engines in 3578) [ClassicSimilarity], result of:
0.043015826 = score(doc=3578,freq=2.0), product of:
0.25542772 = queryWeight, product of:
5.080822 = idf(docFreq=746, maxDocs=44218)
0.05027291 = queryNorm
0.16840704 = fieldWeight in 3578, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
5.080822 = idf(docFreq=746, maxDocs=44218)
0.0234375 = fieldNorm(doc=3578)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Content
- INHALT: Chris Biemann/Rainer Osswald: Automatische Erweiterung eines semantikbasierten Lexikons durch Bootstrapping auf großen Korpora - Ernesto William De Luca/Andreas Nürnberger: Supporting Mobile Web Search by Ontology-based Categorization - Rüdiger Gleim: HyGraph - Ein Framework zur Extraktion, Repräsentation und Analyse webbasierter Hypertextstrukturen - Felicitas Haas/Bernhard Schröder: Freges Grundgesetze der Arithmetik: Dokumentbaum und Formelwald - Ulrich Held/ Andre Blessing/Bettina Säuberlich/Jürgen Sienel/Horst Rößler/Dieter Kopp: A personalized multimodal news service -Jürgen Hermes/Christoph Benden: Fusion von Annotation und Präprozessierung als Vorschlag zur Behebung des Rohtextproblems - Sonja Hüwel/Britta Wrede/Gerhard Sagerer: Semantisches Parsing mit Frames für robuste multimodale Mensch-Maschine-Kommunikation - Brigitte Krenn/Stefan Evert: Separating the wheat from the chaff- Corpus-driven evaluation of statistical association measures for collocation extraction - Jörn Kreutel: An application-centered Perspective an Multimodal Dialogue Systems - Jonas Kuhn: An Architecture for Prallel Corpusbased Grammar Learning - Thomas Mandl/Rene Schneider/Pia Schnetzler/Christa Womser-Hacker: Evaluierung von Systemen für die Eigennamenerkennung im crosslingualen Information Retrieval - Alexander Mehler/Matthias Dehmer/Rüdiger Gleim: Zur Automatischen Klassifikation von Webgenres - Charlotte Merz/Martin Volk: Requirements for a Parallel Treebank Search Tool - Sally YK. Mok: Multilingual Text Retrieval an the Web: The Case of a Cantonese-Dagaare-English Trilingual e-Lexicon -
Karel Pala: The Balkanet Experience - Peter M. Kruse/Andre Nauloks/Dietmar Rösner/Manuela Kunze: Clever Search: A WordNet Based Wrapper for Internet Search Engines - Rosmary Stegmann/Wolfgang Woerndl: Using GermaNet to Generate Individual Customer Profiles - Ingo Glöckner/Sven Hartrumpf/Rainer Osswald: From GermaNet Glosses to Formal Meaning Postulates -Aljoscha Burchardt/ Katrin Erk/Anette Frank: A WordNet Detour to FrameNet - Daniel Naber: OpenThesaurus: ein offenes deutsches Wortnetz - Anke Holler/Wolfgang Grund/Heinrich Petith: Maschinelle Generierung assoziativer Termnetze für die Dokumentensuche - Stefan Bordag/Hans Friedrich Witschel/Thomas Wittig: Evaluation of Lexical Acquisition Algorithms - Iryna Gurevych/Hendrik Niederlich: Computing Semantic Relatedness of GermaNet Concepts - Roland Hausser: Turn-taking als kognitive Grundmechanik der Datenbanksemantik - Rodolfo Delmonte: Parsing Overlaps - Melanie Twiggs: Behandlung des Passivs im Rahmen der Datenbanksemantik- Sandra Hohmann: Intention und Interaktion - Anmerkungen zur Relevanz der Benutzerabsicht - Doris Helfenbein: Verwendung von Pronomina im Sprecher- und Hörmodus - Bayan Abu Shawar/Eric Atwell: Modelling turn-taking in a corpus-trained chatbot - Barbara März: Die Koordination in der Datenbanksemantik - Jens Edlund/Mattias Heldner/Joakim Gustafsson: Utterance segmentation and turn-taking in spoken dialogue systems - Ekaterina Buyko: Numerische Repräsentation von Textkorpora für Wissensextraktion - Bernhard Fisseni: ProofML - eine Annotationssprache für natürlichsprachliche mathematische Beweise - Iryna Schenk: Auflösung der Pronomen mit Nicht-NP-Antezedenten in spontansprachlichen Dialogen - Stephan Schwiebert: Entwurf eines agentengestützten Systems zur Paradigmenbildung - Ingmar Steiner: On the analysis of speech rhythm through acoustic parameters - Hans Friedrich Witschel: Text, Wörter, Morpheme - Möglichkeiten einer automatischen Terminologie-Extraktion.
-
Sünkler, S.; Kerkmann, F.; Schultheiß, S.: Ok Google . the end of search as we know it : sprachgesteuerte Websuche im Test (2018)
0.02
0.022141634 = product of:
0.0664249 = sum of:
0.0664249 = weight(_text_:search in 5626) [ClassicSimilarity], result of:
0.0664249 = score(doc=5626,freq=4.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.38015217 = fieldWeight in 5626, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0546875 = fieldNorm(doc=5626)
0.33333334 = coord(1/3)
- Abstract
- Sprachsteuerungssysteme, die den Nutzer auf Zuruf unterstützen, werden im Zuge der Verbreitung von Smartphones und Lautsprechersystemen wie Amazon Echo oder Google Home zunehmend populär. Eine der zentralen Anwendungen dabei stellt die Suche in Websuchmaschinen dar. Wie aber funktioniert "googlen", wenn der Nutzer seine Suchanfrage nicht schreibt, sondern spricht? Dieser Frage ist ein Projektteam der HAW Hamburg nachgegangen und hat im Auftrag der Deutschen Telekom untersucht, wie effektiv, effizient und zufriedenstellend Google Now, Apple Siri, Microsoft Cortana sowie das Amazon Fire OS arbeiten. Ermittelt wurden Stärken und Schwächen der Systeme sowie Erfolgskriterien für eine hohe Gebrauchstauglichkeit. Diese Erkenntnisse mündeten in dem Prototyp einer optimalen Voice Web Search.
-
¬Der Student aus dem Computer (2023)
0.02
0.015893001 = product of:
0.047679 = sum of:
0.047679 = product of:
0.095358 = sum of:
0.095358 = weight(_text_:22 in 1079) [ClassicSimilarity], result of:
0.095358 = score(doc=1079,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = 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.33333334 = coord(1/3)
- Date
- 27. 1.2023 16:22:55
-
Monnerjahn, P.: Vorsprung ohne Technik : Übersetzen: Computer und Qualität (2000)
0.01
0.013622571 = product of:
0.040867712 = sum of:
0.040867712 = product of:
0.081735425 = sum of:
0.081735425 = weight(_text_:22 in 5429) [ClassicSimilarity], result of:
0.081735425 = score(doc=5429,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.46428138 = fieldWeight in 5429, 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=5429)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Source
- c't. 2000, H.22, S.230-231
-
Witschel, H.F.: Global and local resources for peer-to-peer text retrieval (2008)
0.01
0.013558928 = product of:
0.040676784 = sum of:
0.040676784 = weight(_text_:search in 127) [ClassicSimilarity], result of:
0.040676784 = score(doc=127,freq=6.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.23279473 = fieldWeight in 127, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.02734375 = fieldNorm(doc=127)
0.33333334 = coord(1/3)
- Abstract
- This thesis is organised as follows: Chapter 2 gives a general introduction to the field of information retrieval, covering its most important aspects. Further, the tasks of distributed and peer-to-peer information retrieval (P2PIR) are introduced, motivating their application and characterising the special challenges that they involve, including a review of existing architectures and search protocols in P2PIR. Finally, chapter 2 presents approaches to evaluating the e ectiveness of both traditional and peer-to-peer IR systems. Chapter 3 contains a detailed account of state-of-the-art information retrieval models and algorithms. This encompasses models for matching queries against document representations, term weighting algorithms, approaches to feedback and associative retrieval as well as distributed retrieval. It thus defines important terminology for the following chapters. The notion of "multi-level association graphs" (MLAGs) is introduced in chapter 4. An MLAG is a simple, graph-based framework that allows to model most of the theoretical and practical approaches to IR presented in chapter 3. Moreover, it provides an easy-to-grasp way of defining and including new entities into IR modeling, such as paragraphs or peers, dividing them conceptually while at the same time connecting them to each other in a meaningful way. This allows for a unified view on many IR tasks, including that of distributed and peer-to-peer search. Starting from related work and a formal defiition of the framework, the possibilities of modeling that it provides are discussed in detail, followed by an experimental section that shows how new insights gained from modeling inside the framework can lead to novel combinations of principles and eventually to improved retrieval effectiveness.
Chapter 5 empirically tackles the first of the two research questions formulated above, namely the question of global collection statistics. More precisely, it studies possibilities of radically simplified results merging. The simplification comes from the attempt - without having knowledge of the complete collection - to equip all peers with the same global statistics, making document scores comparable across peers. Chapter 5 empirically tackles the first of the two research questions formulated above, namely the question of global collection statistics. More precisely, it studies possibilities of radically simplified results merging. The simplification comes from the attempt - without having knowledge of the complete collection - to equip all peers with the same global statistics, making document scores comparable across peers. What is examined, is the question of how we can obtain such global statistics and to what extent their use will lead to a drop in retrieval effectiveness. In chapter 6, the second research question is tackled, namely that of making forwarding decisions for queries, based on profiles of other peers. After a review of related work in that area, the chapter first defines the approaches that will be compared against each other. Then, a novel evaluation framework is introduced, including a new measure for comparing results of a distributed search engine against those of a centralised one. Finally, the actual evaluation is performed using the new framework.
-
Kuhlmann, U.; Monnerjahn, P.: Sprache auf Knopfdruck : Sieben automatische Übersetzungsprogramme im Test (2000)
0.01
0.011352143 = product of:
0.03405643 = sum of:
0.03405643 = product of:
0.06811286 = sum of:
0.06811286 = weight(_text_:22 in 5428) [ClassicSimilarity], result of:
0.06811286 = score(doc=5428,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.38690117 = fieldWeight in 5428, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.078125 = fieldNorm(doc=5428)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Source
- c't. 2000, H.22, S.220-229
-
Lezius, W.; Rapp, R.; Wettler, M.: ¬A morphology-system and part-of-speech tagger for German (1996)
0.01
0.011352143 = product of:
0.03405643 = sum of:
0.03405643 = product of:
0.06811286 = sum of:
0.06811286 = weight(_text_:22 in 1693) [ClassicSimilarity], result of:
0.06811286 = score(doc=1693,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.38690117 = fieldWeight in 1693, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.078125 = fieldNorm(doc=1693)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 22. 3.2015 9:37:18
-
Ruge, G.: Sprache und Computer : Wortbedeutung und Termassoziation. Methoden zur automatischen semantischen Klassifikation (1995)
0.01
0.009081715 = product of:
0.027245143 = sum of:
0.027245143 = product of:
0.054490287 = sum of:
0.054490287 = weight(_text_:22 in 1534) [ClassicSimilarity], result of:
0.054490287 = score(doc=1534,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.30952093 = fieldWeight in 1534, 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=1534)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Footnote
- Rez. in: Knowledge organization 22(1995) no.3/4, S.182-184 (M.T. Rolland)
-
Lezius, W.: Morphy - Morphologie und Tagging für das Deutsche (2013)
0.01
0.009081715 = product of:
0.027245143 = sum of:
0.027245143 = product of:
0.054490287 = sum of:
0.054490287 = weight(_text_:22 in 1490) [ClassicSimilarity], result of:
0.054490287 = score(doc=1490,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.30952093 = fieldWeight in 1490, 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=1490)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 22. 3.2015 9:30:24
-
Bager, J.: ¬Die Text-KI ChatGPT schreibt Fachtexte, Prosa, Gedichte und Programmcode (2023)
0.01
0.009081715 = product of:
0.027245143 = sum of:
0.027245143 = product of:
0.054490287 = sum of:
0.054490287 = weight(_text_:22 in 835) [ClassicSimilarity], result of:
0.054490287 = score(doc=835,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.30952093 = fieldWeight in 835, 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=835)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 29.12.2022 18:22:55
-
Rieger, F.: Lügende Computer (2023)
0.01
0.009081715 = product of:
0.027245143 = sum of:
0.027245143 = product of:
0.054490287 = sum of:
0.054490287 = weight(_text_:22 in 912) [ClassicSimilarity], result of:
0.054490287 = score(doc=912,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.30952093 = fieldWeight in 912, 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=912)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 16. 3.2023 19:22:55
-
Schneider, R.: Web 3.0 ante portas? : Integration von Social Web und Semantic Web (2008)
0.01
0.007946501 = product of:
0.0238395 = sum of:
0.0238395 = product of:
0.047679 = sum of:
0.047679 = weight(_text_:22 in 4184) [ClassicSimilarity], result of:
0.047679 = score(doc=4184,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.2708308 = fieldWeight in 4184, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.0546875 = fieldNorm(doc=4184)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 22. 1.2011 10:38:28
-
Lorenz, S.: Konzeption und prototypische Realisierung einer begriffsbasierten Texterschließung (2006)
0.01
0.0068112854 = product of:
0.020433856 = sum of:
0.020433856 = product of:
0.040867712 = sum of:
0.040867712 = weight(_text_:22 in 1746) [ClassicSimilarity], result of:
0.040867712 = score(doc=1746,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.23214069 = fieldWeight in 1746, 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=1746)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 22. 3.2015 9:17:30
-
Rötzer, F.: Computer ergooglen die Bedeutung von Worten (2005)
0.01
0.0067099286 = product of:
0.020129785 = sum of:
0.020129785 = weight(_text_:search in 3385) [ClassicSimilarity], result of:
0.020129785 = score(doc=3385,freq=2.0), product of:
0.1747324 = queryWeight, product of:
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.05027291 = queryNorm
0.1152035 = fieldWeight in 3385, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.475677 = idf(docFreq=3718, maxDocs=44218)
0.0234375 = fieldNorm(doc=3385)
0.33333334 = coord(1/3)
- Content
- Mit einem bereits zuvor von Paul Vitanyi und anderen entwickeltem Verfahren, das den Zusammenhang von Objekten misst (normalized information distance - NID ), kann die Nähe zwischen bestimmten Objekten (Bilder, Worte, Muster, Intervalle, Genome, Programme etc.) anhand aller Eigenschaften analysiert und aufgrund der dominanten gemeinsamen Eigenschaft bestimmt werden. Ähnlich können auch die allgemein verwendeten, nicht unbedingt "wahren" Bedeutungen von Namen mit der Google-Suche erschlossen werden. 'At this moment one database stands out as the pinnacle of computer-accessible human knowledge and the most inclusive summary of statistical information: the Google search engine. There can be no doubt that Google has already enabled science to accelerate tremendously and revolutionized the research process. It has dominated the attention of internet users for years, and has recently attracted substantial attention of many Wall Street investors, even reshaping their ideas of company financing.' (Paul Vitanyi und Rudi Cilibrasi) Gibt man ein Wort ein wie beispielsweise "Pferd", erhält man bei Google 4.310.000 indexierte Seiten. Für "Reiter" sind es 3.400.000 Seiten. Kombiniert man beide Begriffe, werden noch 315.000 Seiten erfasst. Für das gemeinsame Auftreten beispielsweise von "Pferd" und "Bart" werden zwar noch immer erstaunliche 67.100 Seiten aufgeführt, aber man sieht schon, dass "Pferd" und "Reiter" enger zusammen hängen. Daraus ergibt sich eine bestimmte Wahrscheinlichkeit für das gemeinsame Auftreten von Begriffen. Aus dieser Häufigkeit, die sich im Vergleich mit der maximalen Menge (5.000.000.000) an indexierten Seiten ergibt, haben die beiden Wissenschaftler eine statistische Größe entwickelt, die sie "normalised Google distance" (NGD) nennen und die normalerweise zwischen 0 und 1 liegt. Je geringer NGD ist, desto enger hängen zwei Begriffe zusammen. "Das ist eine automatische Bedeutungsgenerierung", sagt Vitanyi gegenüber dern New Scientist (4). "Das könnte gut eine Möglichkeit darstellen, einen Computer Dinge verstehen und halbintelligent handeln zu lassen." Werden solche Suchen immer wieder durchgeführt, lässt sich eine Karte für die Verbindungen von Worten erstellen. Und aus dieser Karte wiederum kann ein Computer, so die Hoffnung, auch die Bedeutung der einzelnen Worte in unterschiedlichen natürlichen Sprachen und Kontexten erfassen. So habe man über einige Suchen realisiert, dass ein Computer zwischen Farben und Zahlen unterscheiden, holländische Maler aus dem 17. Jahrhundert und Notfälle sowie Fast-Notfälle auseinander halten oder elektrische oder religiöse Begriffe verstehen könne. Überdies habe eine einfache automatische Übersetzung Englisch-Spanisch bewerkstelligt werden können. Auf diese Weise ließe sich auch, so hoffen die Wissenschaftler, die Bedeutung von Worten erlernen, könne man Spracherkennung verbessern oder ein semantisches Web erstellen und natürlich endlich eine bessere automatische Übersetzung von einer Sprache in die andere realisieren.
-
Sienel, J.; Weiss, M.; Laube, M.: Sprachtechnologien für die Informationsgesellschaft des 21. Jahrhunderts (2000)
0.01
0.0056760716 = product of:
0.017028214 = sum of:
0.017028214 = product of:
0.03405643 = sum of:
0.03405643 = weight(_text_:22 in 5557) [ClassicSimilarity], result of:
0.03405643 = score(doc=5557,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.19345059 = fieldWeight in 5557, 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=5557)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 26.12.2000 13:22:17
-
Pinker, S.: Wörter und Regeln : Die Natur der Sprache (2000)
0.01
0.0056760716 = product of:
0.017028214 = sum of:
0.017028214 = product of:
0.03405643 = sum of:
0.03405643 = weight(_text_:22 in 734) [ClassicSimilarity], result of:
0.03405643 = score(doc=734,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.19345059 = fieldWeight in 734, 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=734)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 19. 7.2002 14:22:31
-
Semantik, Lexikographie und Computeranwendungen : Workshop ... (Bonn) : 1995.01.27-28 (1996)
0.01
0.0056760716 = product of:
0.017028214 = sum of:
0.017028214 = product of:
0.03405643 = sum of:
0.03405643 = weight(_text_:22 in 190) [ClassicSimilarity], result of:
0.03405643 = score(doc=190,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.19345059 = fieldWeight in 190, 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=190)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 14. 4.2007 10:04:22
-
Rötzer, F.: KI-Programm besser als Menschen im Verständnis natürlicher Sprache (2018)
0.00
0.0045408574 = product of:
0.013622572 = sum of:
0.013622572 = product of:
0.027245143 = sum of:
0.027245143 = weight(_text_:22 in 4217) [ClassicSimilarity], result of:
0.027245143 = score(doc=4217,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.15476047 = fieldWeight in 4217, 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=4217)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 22. 1.2018 11:32:44
-
Schürmann, H.: Software scannt Radio- und Fernsehsendungen : Recherche in Nachrichtenarchiven erleichtert (2001)
0.00
0.0039732503 = product of:
0.01191975 = sum of:
0.01191975 = product of:
0.0238395 = sum of:
0.0238395 = weight(_text_:22 in 5759) [ClassicSimilarity], result of:
0.0238395 = score(doc=5759,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.1354154 = fieldWeight in 5759, 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=5759)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Source
- Handelsblatt. Nr.79 vom 24.4.2001, S.22
-
Melzer, C.: ¬Der Maschine anpassen : PC-Spracherkennung - Programme sind mittlerweile alltagsreif (2005)
0.00
0.0039732503 = product of:
0.01191975 = sum of:
0.01191975 = product of:
0.0238395 = sum of:
0.0238395 = weight(_text_:22 in 4044) [ClassicSimilarity], result of:
0.0238395 = score(doc=4044,freq=2.0), product of:
0.17604718 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05027291 = queryNorm
0.1354154 = fieldWeight in 4044, 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=4044)
0.5 = coord(1/2)
0.33333334 = coord(1/3)
- Date
- 3. 5.1997 8:44:22
