-
Lezius, W.; Rapp, R.; Wettler, M.: ¬A morphology-system and part-of-speech tagger for German (1996)
0.04
0.036862895 = product of:
0.055294342 = sum of:
0.019940332 = weight(_text_:of in 1693) [ClassicSimilarity], result of:
0.019940332 = score(doc=1693,freq=4.0), product of:
0.08160993 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.05218836 = queryNorm
0.24433708 = fieldWeight in 1693, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.078125 = fieldNorm(doc=1693)
0.03535401 = product of:
0.07070802 = sum of:
0.07070802 = weight(_text_:22 in 1693) [ClassicSimilarity], result of:
0.07070802 = score(doc=1693,freq=2.0), product of:
0.18275474 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05218836 = 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.6666667 = coord(2/3)
- Date
- 22. 3.2015 9:37:18
- Source
- Natural language processing and speech technology: Results of the 3rd KONVENS Conference, Bielefeld, October 1996. Ed.: D. Gibbon
-
Ruge, G.: Sprache und Computer : Wortbedeutung und Termassoziation. Methoden zur automatischen semantischen Klassifikation (1995)
0.03
0.029490318 = product of:
0.044235475 = sum of:
0.015952265 = weight(_text_:of in 1534) [ClassicSimilarity], result of:
0.015952265 = score(doc=1534,freq=4.0), product of:
0.08160993 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.05218836 = queryNorm
0.19546966 = fieldWeight in 1534, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0625 = fieldNorm(doc=1534)
0.028283209 = product of:
0.056566417 = sum of:
0.056566417 = weight(_text_:22 in 1534) [ClassicSimilarity], result of:
0.056566417 = score(doc=1534,freq=2.0), product of:
0.18275474 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05218836 = 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.6666667 = coord(2/3)
- Content
- Enthält folgende Kapitel: (1) Motivation; (2) Language philosophical foundations; (3) Structural comparison of extensions; (4) Earlier approaches towards term association; (5) Experiments; (6) Spreading-activation networks or memory models; (7) Perspective. Appendices: Heads and modifiers of 'car'. Glossary. Index. Language and computer. Word semantics and term association. Methods towards an automatic semantic classification
- Footnote
- Rez. in: Knowledge organization 22(1995) no.3/4, S.182-184 (M.T. Rolland)
-
¬Der Student aus dem Computer (2023)
0.02
0.01649854 = product of:
0.049495615 = sum of:
0.049495615 = product of:
0.09899123 = sum of:
0.09899123 = weight(_text_:22 in 1079) [ClassicSimilarity], result of:
0.09899123 = score(doc=1079,freq=2.0), product of:
0.18275474 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05218836 = 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
-
Sienel, J.; Weiss, M.; Laube, M.: Sprachtechnologien für die Informationsgesellschaft des 21. Jahrhunderts (2000)
0.02
0.016484652 = product of:
0.024726978 = sum of:
0.0070499717 = weight(_text_:of in 5557) [ClassicSimilarity], result of:
0.0070499717 = score(doc=5557,freq=2.0), product of:
0.08160993 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.05218836 = queryNorm
0.086386204 = fieldWeight in 5557, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0390625 = fieldNorm(doc=5557)
0.017677005 = product of:
0.03535401 = sum of:
0.03535401 = weight(_text_:22 in 5557) [ClassicSimilarity], result of:
0.03535401 = score(doc=5557,freq=2.0), product of:
0.18275474 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05218836 = 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.6666667 = coord(2/3)
- Date
- 26.12.2000 13:22:17
- Source
- Sprachtechnologie für eine dynamische Wirtschaft im Medienzeitalter - Language technologies for dynamic business in the age of the media - L'ingénierie linguistique au service de la dynamisation économique à l'ère du multimédia: Tagungsakten der XXVI. Jahrestagung der Internationalen Vereinigung Sprache und Wirtschaft e.V., 23.-25.11.2000, Fachhochschule Köln. Hrsg.: K.-D. Schmitz
-
Pinker, S.: Wörter und Regeln : Die Natur der Sprache (2000)
0.02
0.016484652 = product of:
0.024726978 = sum of:
0.0070499717 = weight(_text_:of in 734) [ClassicSimilarity], result of:
0.0070499717 = score(doc=734,freq=2.0), product of:
0.08160993 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.05218836 = queryNorm
0.086386204 = fieldWeight in 734, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0390625 = fieldNorm(doc=734)
0.017677005 = product of:
0.03535401 = sum of:
0.03535401 = weight(_text_:22 in 734) [ClassicSimilarity], result of:
0.03535401 = score(doc=734,freq=2.0), product of:
0.18275474 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05218836 = 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.6666667 = coord(2/3)
- Abstract
- Wie lernen Kinder sprechen? Welche Hinweise geben gerade ihre Fehler beim Spracherwerb auf den Ablauf des Lernprozesses - getreu dem Motto: "Kinder sagen die töllsten Sachen«? Und wie helfen beziehungsweise warum scheitern bislang Computer bei der Simulation neuronaler Netzwerke, die am komplizierten Gewebe der menschlichen Sprache mitwirken? In seinem neuen Buch Wörter und Regeln hat der bekannte US-amerikanische Kognitionswissenschaftler Steven Pinker (Der Sprachinstinkt) wieder einmal eine ebenso informative wie kurzweifige Erkundungstour ins Reich der Sprache unternommen. Was die Sache besonders spannend und lesenswert macht: Souverän beleuchtet der Professor am Massachusetts Institute of Technology sowohl natur- als auch geisteswissenschaftliche Aspekte. So vermittelt er einerseits linguistische Grundlagen in den Fußspuren Ferdinand de Saussures, etwa die einer generativen Grammatik, liefert einen Exkurs durch die Sprachgeschichte und widmet ein eigenes Kapitel den Schrecken der deutschen Sprache". Andererseits lässt er aber auch die neuesten bildgebenden Verfahren nicht außen vor, die zeigen, was im Gehirn bei der Sprachverarbeitung abläuft. Pinkers Theorie, die sich in diesem Puzzle verschiedenster Aspekte wiederfindet: Sprache besteht im Kein aus zwei Bestandteilen - einem mentalen Lexikon aus erinnerten Wörtern und einer mentalen Grammatik aus verschiedenen kombinatorischen Regeln. Konkret heißt das: Wir prägen uns bekannte Größen und ihre abgestuften, sich kreuzenden Merkmale ein, aber wir erzeugen auch neue geistige Produkte, in dem wir Regeln anwenden. Gerade daraus, so schließt Pinker, erschließt sich der Reichtum und die ungeheure Ausdruckskraft unserer Sprache
- Date
- 19. 7.2002 14:22:31
-
Scherer Auberson, K.: Counteracting concept drift in natural language classifiers : proposal for an automated method (2018)
0.02
0.015977783 = product of:
0.023966674 = sum of:
0.011964198 = weight(_text_:of in 2849) [ClassicSimilarity], result of:
0.011964198 = score(doc=2849,freq=4.0), product of:
0.08160993 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.05218836 = queryNorm
0.14660224 = fieldWeight in 2849, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.046875 = fieldNorm(doc=2849)
0.012002475 = product of:
0.02400495 = sum of:
0.02400495 = weight(_text_:science in 2849) [ClassicSimilarity], result of:
0.02400495 = score(doc=2849,freq=2.0), product of:
0.13747036 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.05218836 = queryNorm
0.17461908 = fieldWeight in 2849, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.046875 = fieldNorm(doc=2849)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Abstract
- Natural Language Classifier helfen Unternehmen zunehmend dabei die Flut von Textdaten zu überwinden. Aber diese Classifier, einmal trainiert, verlieren mit der Zeit ihre Nützlichkeit. Sie bleiben statisch, aber die zugrundeliegende Domäne der Textdaten verändert sich: Ihre Genauigkeit nimmt aufgrund eines Phänomens ab, das als Konzeptdrift bekannt ist. Die Frage ist ob Konzeptdrift durch die Ausgabe eines Classifiers zuverlässig erkannt werden kann, und falls ja: ist es möglich dem durch nachtrainieren des Classifiers entgegenzuwirken. Es wird eine System-Implementierung mittels Proof-of-Concept vorgestellt, bei der das Konfidenzmass des Classifiers zur Erkennung von Konzeptdrift verwendet wird. Der Classifier wird dann iterativ neu trainiert, indem er Stichproben mit niedrigem Konfidenzmass auswählt, sie korrigiert und im Trainingsset der nächsten Iteration verwendet. Die Leistung des Classifiers wird über die Zeit gemessen, und die Leistung des Systems beobachtet. Basierend darauf werden schließlich Empfehlungen gegeben, die sich bei der Implementierung solcher Systeme als nützlich erweisen können.
- Content
- Diese Publikation entstand im Rahmen einer Thesis zum Master of Science FHO in Business Administration, Major Information and Data Management.
-
Monnerjahn, P.: Vorsprung ohne Technik : Übersetzen: Computer und Qualität (2000)
0.01
0.014141604 = product of:
0.042424813 = sum of:
0.042424813 = product of:
0.084849626 = sum of:
0.084849626 = weight(_text_:22 in 5429) [ClassicSimilarity], result of:
0.084849626 = score(doc=5429,freq=2.0), product of:
0.18275474 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05218836 = 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
-
Kuhlmann, U.; Monnerjahn, P.: Sprache auf Knopfdruck : Sieben automatische Übersetzungsprogramme im Test (2000)
0.01
0.011784671 = product of:
0.03535401 = sum of:
0.03535401 = product of:
0.07070802 = sum of:
0.07070802 = weight(_text_:22 in 5428) [ClassicSimilarity], result of:
0.07070802 = score(doc=5428,freq=2.0), product of:
0.18275474 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05218836 = 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
-
Renker, L.: Exploration von Textkorpora : Topic Models als Grundlage der Interaktion (2015)
0.01
0.011368023 = product of:
0.017052034 = sum of:
0.0070499717 = weight(_text_:of in 2380) [ClassicSimilarity], result of:
0.0070499717 = score(doc=2380,freq=2.0), product of:
0.08160993 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.05218836 = queryNorm
0.086386204 = fieldWeight in 2380, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0390625 = fieldNorm(doc=2380)
0.010002062 = product of:
0.020004123 = sum of:
0.020004123 = weight(_text_:science in 2380) [ClassicSimilarity], result of:
0.020004123 = score(doc=2380,freq=2.0), product of:
0.13747036 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.05218836 = queryNorm
0.1455159 = fieldWeight in 2380, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.0390625 = fieldNorm(doc=2380)
0.5 = coord(1/2)
0.6666667 = coord(2/3)
- Footnote
- Masterthesis zur Erlangung des akademischen Grades Master of Science (M.Sc.) vorgelegt an der Fachhochschule Köln / Fakultät für Informatik und Ingenieurswissenschaften im Studiengang Medieninformatik.
-
Rötzer, F.: Computer ergooglen die Bedeutung von Worten (2005)
0.01
0.010306511 = product of:
0.015459767 = sum of:
0.00945853 = weight(_text_:of in 3385) [ClassicSimilarity], result of:
0.00945853 = score(doc=3385,freq=10.0), product of:
0.08160993 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.05218836 = queryNorm
0.11589926 = fieldWeight in 3385, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0234375 = fieldNorm(doc=3385)
0.0060012373 = product of:
0.012002475 = sum of:
0.012002475 = weight(_text_:science in 3385) [ClassicSimilarity], result of:
0.012002475 = score(doc=3385,freq=2.0), product of:
0.13747036 = queryWeight, product of:
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.05218836 = queryNorm
0.08730954 = fieldWeight in 3385, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
2.6341193 = idf(docFreq=8627, maxDocs=44218)
0.0234375 = fieldNorm(doc=3385)
0.5 = coord(1/2)
0.6666667 = coord(2/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.
-
Göpferich, S.: Von der Terminographie zur Textographie : computergestützte Verwaltung textsortenspezifischer Textversatzstücke (1995)
0.01
0.009947985 = product of:
0.029843956 = sum of:
0.029843956 = weight(_text_:of in 4567) [ClassicSimilarity], result of:
0.029843956 = score(doc=4567,freq=14.0), product of:
0.08160993 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.05218836 = queryNorm
0.36569026 = fieldWeight in 4567, product of:
3.7416575 = tf(freq=14.0), with freq of:
14.0 = termFreq=14.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0625 = fieldNorm(doc=4567)
0.33333334 = coord(1/3)
- Abstract
- The paper presents 2 different types of computer-based retrieval systems for text-type specific information ranging from phrases to whole standardized passages. The first part describes the structure of a full-text database for text prototypes, the second part, ways of storing text-type specific phrases and passages an a combined terminological and textographic database. The program used to illustrate this second kind of retrieval system is the terminology system CATS, which the Terminology Centre at the Faculty of Applied Linguistics and Cultural Studies of the University of Mainz in Germersheim uses for its FASTERM database
-
Lezius, W.: Morphy - Morphologie und Tagging für das Deutsche (2013)
0.01
0.0094277365 = product of:
0.028283209 = sum of:
0.028283209 = product of:
0.056566417 = sum of:
0.056566417 = weight(_text_:22 in 1490) [ClassicSimilarity], result of:
0.056566417 = score(doc=1490,freq=2.0), product of:
0.18275474 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05218836 = 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.0094277365 = product of:
0.028283209 = sum of:
0.028283209 = product of:
0.056566417 = sum of:
0.056566417 = weight(_text_:22 in 835) [ClassicSimilarity], result of:
0.056566417 = score(doc=835,freq=2.0), product of:
0.18275474 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05218836 = 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.0094277365 = product of:
0.028283209 = sum of:
0.028283209 = product of:
0.056566417 = sum of:
0.056566417 = weight(_text_:22 in 912) [ClassicSimilarity], result of:
0.056566417 = score(doc=912,freq=2.0), product of:
0.18275474 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05218836 = 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
-
Altmann, E.G.; Cristadoro, G.; Esposti, M.D.: On the origin of long-range correlations in texts (2012)
0.01
0.008917587 = product of:
0.02675276 = sum of:
0.02675276 = weight(_text_:of in 330) [ClassicSimilarity], result of:
0.02675276 = score(doc=330,freq=20.0), product of:
0.08160993 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.05218836 = queryNorm
0.32781258 = fieldWeight in 330, product of:
4.472136 = tf(freq=20.0), with freq of:
20.0 = termFreq=20.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.046875 = fieldNorm(doc=330)
0.33333334 = coord(1/3)
- 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.
- Source
- Proceedings of the National Academy of Sciences, 2. Juli 2012. DOI: 10.1073/pnas.1117723109
-
Witschel, H.F.: Global and local resources for peer-to-peer text retrieval (2008)
0.01
0.008547636 = product of:
0.025642907 = sum of:
0.025642907 = weight(_text_:of in 127) [ClassicSimilarity], result of:
0.025642907 = score(doc=127,freq=54.0), product of:
0.08160993 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.05218836 = queryNorm
0.3142131 = fieldWeight in 127, product of:
7.3484693 = tf(freq=54.0), with freq of:
54.0 = termFreq=54.0
1.5637573 = idf(docFreq=25162, 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.
-
Dietze, J.; Völkel, H.: Verifikation einer Methode der lexikalischen Semantik : zur computergestützten Bestimmung der semantischen Konsistenz und des semantischen Abstands (1992)
0.01
0.0084075825 = product of:
0.025222747 = sum of:
0.025222747 = weight(_text_:of in 6680) [ClassicSimilarity], result of:
0.025222747 = score(doc=6680,freq=10.0), product of:
0.08160993 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.05218836 = queryNorm
0.3090647 = fieldWeight in 6680, product of:
3.1622777 = tf(freq=10.0), with freq of:
10.0 = termFreq=10.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0625 = fieldNorm(doc=6680)
0.33333334 = coord(1/3)
- Abstract
- Uses a semantic field 'linguistic communication' of 735 verbs to verify two numerically based methods working with the semic cooccurrence interval due to the semic micro-structure of a lexeme. The weak point of this procedure is the one-stage classification of the semantic features (semes) of the field
-
Schneider, R.: Web 3.0 ante portas? : Integration von Social Web und Semantic Web (2008)
0.01
0.00824927 = product of:
0.024747808 = sum of:
0.024747808 = product of:
0.049495615 = sum of:
0.049495615 = weight(_text_:22 in 4184) [ClassicSimilarity], result of:
0.049495615 = score(doc=4184,freq=2.0), product of:
0.18275474 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05218836 = 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
-
Karlova-Bourbonus, N.: Automatic detection of contradictions in texts (2018)
0.01
0.007593052 = product of:
0.022779156 = sum of:
0.022779156 = weight(_text_:of in 5976) [ClassicSimilarity], result of:
0.022779156 = score(doc=5976,freq=58.0), product of:
0.08160993 = queryWeight, product of:
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.05218836 = queryNorm
0.27912235 = fieldWeight in 5976, product of:
7.615773 = tf(freq=58.0), with freq of:
58.0 = termFreq=58.0
1.5637573 = idf(docFreq=25162, maxDocs=44218)
0.0234375 = fieldNorm(doc=5976)
0.33333334 = coord(1/3)
- Abstract
- Natural language contradictions are of complex nature. As will be shown in Chapter 5, the realization of contradictions is not limited to the examples such as Socrates is a man and Socrates is not a man (under the condition that Socrates refers to the same object in the real world), which is discussed by Aristotle (Section 3.1.1). Empirical evidence (see Chapter 5 for more details) shows that only a few contradictions occurring in the real life are of that explicit (prototypical) kind. Rather, con-tradictions make use of a variety of natural language devices such as, e.g., paraphrasing, synonyms and antonyms, passive and active voice, diversity of negation expression, and figurative linguistic means such as idioms, irony, and metaphors. Additionally, the most so-phisticated kind of contradictions, the so-called implicit contradictions, can be found only when applying world knowledge and after conducting a sequence of logical operations such as e.g. in: (1.1) The first prize was given to the experienced grandmaster L. Stein who, in total, col-lected ten points (7 wins and 3 draws). Those familiar with the chess rules know that a chess player gets one point for winning and zero points for losing the game. In case of a draw, each player gets a half point. Built on this idea and by conducting some simple mathematical operations, we can infer that in the case of 7 wins and 3 draws (the second part of the sentence), a player can only collect 8.5 points and not 10 points. Hence, we observe that there is a contradiction between the first and the second parts of the sentence.
Implicit contradictions will only partially be the subject of the present study, aiming primarily at identifying the realization mechanism and cues (Chapter 5) as well as finding the parts of contradictions by applying the state of the art algorithms for natural language processing without conducting deep meaning processing. Further in focus are the explicit and implicit contradictions that can be detected by means of explicit linguistic, structural, lexical cues, and by conducting some additional processing operations (e.g., counting the sum in order to detect contradictions arising from numerical divergencies). One should note that an additional complexity in finding contradictions can arise in case parts of the contradictions occur on different levels of realization. Thus, a contradiction can be observed on the word- and phrase-level, such as in a married bachelor (for variations of contradictions on lexical level, see Ganeev 2004), on the sentence level - between parts of a sentence or between two or more sentences, or on the text level - between the portions of a text or between the whole texts such as a contradiction between the Bible and the Quran, for example. Only contradictions arising at the level of single sentences occurring in one or more texts, as well as parts of a sentence, will be considered for the purpose of this study. Though the focus of interest will be on single sentences, it will make use of text particularities such as coreference resolution without establishing the referents in the real world. Finally, another aspect to be considered is that parts of the contradictions are not neces-sarily to appear at the same time. They can be separated by many years and centuries with or without time expression making their recognition by human and detection by machine challenging. According to Aristotle's ontological version of the LNC (Section 3.1.1), how-ever, the same time reference is required in order for two statements to be judged as a contradiction. Taking this into account, we set the borders for the study by limiting the ana-lyzed textual data thematically (only nine world events) and temporally (three days after the reported event had happened) (Section 5.1). No sophisticated time processing will thus be conducted.
-
Lorenz, S.: Konzeption und prototypische Realisierung einer begriffsbasierten Texterschließung (2006)
0.01
0.007070802 = product of:
0.021212406 = sum of:
0.021212406 = product of:
0.042424813 = sum of:
0.042424813 = weight(_text_:22 in 1746) [ClassicSimilarity], result of:
0.042424813 = score(doc=1746,freq=2.0), product of:
0.18275474 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.05218836 = 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
