-
Huo, W.: Automatic multi-word term extraction and its application to Web-page summarization (2012)
0.34
0.34462228 = product of:
0.57437044 = sum of:
0.16404013 = weight(_text_:2f in 563) [ClassicSimilarity], result of:
0.16404013 = score(doc=563,freq=2.0), product of:
0.291877 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03442753 = queryNorm
0.56201804 = fieldWeight in 563, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046875 = fieldNorm(doc=563)
0.16404013 = weight(_text_:2f in 563) [ClassicSimilarity], result of:
0.16404013 = score(doc=563,freq=2.0), product of:
0.291877 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03442753 = queryNorm
0.56201804 = fieldWeight in 563, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046875 = fieldNorm(doc=563)
0.024307044 = product of:
0.04861409 = sum of:
0.04861409 = weight(_text_:web in 563) [ClassicSimilarity], result of:
0.04861409 = score(doc=563,freq=8.0), product of:
0.11235461 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03442753 = queryNorm
0.43268442 = fieldWeight in 563, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=563)
0.5 = coord(1/2)
0.16404013 = weight(_text_:2f in 563) [ClassicSimilarity], result of:
0.16404013 = score(doc=563,freq=2.0), product of:
0.291877 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03442753 = queryNorm
0.56201804 = fieldWeight in 563, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
8.478011 = idf(docFreq=24, maxDocs=44218)
0.046875 = fieldNorm(doc=563)
0.04861409 = weight(_text_:web in 563) [ClassicSimilarity], result of:
0.04861409 = score(doc=563,freq=8.0), product of:
0.11235461 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03442753 = queryNorm
0.43268442 = fieldWeight in 563, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.046875 = fieldNorm(doc=563)
0.009328911 = product of:
0.027986731 = sum of:
0.027986731 = weight(_text_:22 in 563) [ClassicSimilarity], result of:
0.027986731 = score(doc=563,freq=2.0), product of:
0.12055935 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03442753 = queryNorm
0.23214069 = fieldWeight in 563, 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=563)
0.33333334 = coord(1/3)
0.6 = coord(6/10)
- Abstract
- In this thesis we propose three new word association measures for multi-word term extraction. We combine these association measures with LocalMaxs algorithm in our extraction model and compare the results of different multi-word term extraction methods. Our approach is language and domain independent and requires no training data. It can be applied to such tasks as text summarization, information retrieval, and document classification. We further explore the potential of using multi-word terms as an effective representation for general web-page summarization. We extract multi-word terms from human written summaries in a large collection of web-pages, and generate the summaries by aligning document words with these multi-word terms. Our system applies machine translation technology to learn the aligning process from a training set and focuses on selecting high quality multi-word terms from human written summaries to generate suitable results for web-page summarization.
- Content
- A Thesis presented to The University of Guelph In partial fulfilment of requirements for the degree of Master of Science in Computer Science. Vgl. Unter: http://www.inf.ufrgs.br%2F~ceramisch%2Fdownload_files%2Fpublications%2F2009%2Fp01.pdf.
- Date
- 10. 1.2013 19:22:47
-
Artemenko, O.; Shramko, M.: Entwicklung eines Werkzeugs zur Sprachidentifikation in mono- und multilingualen Texten (2005)
0.03
0.030353079 = product of:
0.075882696 = sum of:
0.010026145 = product of:
0.02005229 = sum of:
0.02005229 = weight(_text_:web in 572) [ClassicSimilarity], result of:
0.02005229 = score(doc=572,freq=4.0), product of:
0.11235461 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03442753 = queryNorm
0.17847323 = fieldWeight in 572, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02734375 = fieldNorm(doc=572)
0.5 = coord(1/2)
0.019668503 = weight(_text_:world in 572) [ClassicSimilarity], result of:
0.019668503 = score(doc=572,freq=2.0), product of:
0.1323281 = queryWeight, product of:
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.03442753 = queryNorm
0.14863437 = fieldWeight in 572, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.02734375 = fieldNorm(doc=572)
0.026135758 = weight(_text_:wide in 572) [ClassicSimilarity], result of:
0.026135758 = score(doc=572,freq=2.0), product of:
0.15254007 = queryWeight, product of:
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.03442753 = queryNorm
0.171337 = fieldWeight in 572, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
4.4307585 = idf(docFreq=1430, maxDocs=44218)
0.02734375 = fieldNorm(doc=572)
0.02005229 = weight(_text_:web in 572) [ClassicSimilarity], result of:
0.02005229 = score(doc=572,freq=4.0), product of:
0.11235461 = queryWeight, product of:
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.03442753 = queryNorm
0.17847323 = fieldWeight in 572, product of:
2.0 = tf(freq=4.0), with freq of:
4.0 = termFreq=4.0
3.2635105 = idf(docFreq=4597, maxDocs=44218)
0.02734375 = fieldNorm(doc=572)
0.4 = coord(4/10)
- Abstract
- Mit der Verbreitung des Internets vermehrt sich die Menge der im World Wide Web verfügbaren Dokumente. Die Gewährleistung eines effizienten Zugangs zu gewünschten Informationen für die Internetbenutzer wird zu einer großen Herausforderung an die moderne Informationsgesellschaft. Eine Vielzahl von Werkzeugen wird bereits eingesetzt, um den Nutzern die Orientierung in der wachsenden Informationsflut zu erleichtern. Allerdings stellt die enorme Menge an unstrukturierten und verteilten Informationen nicht die einzige Schwierigkeit dar, die bei der Entwicklung von Werkzeugen dieser Art zu bewältigen ist. Die zunehmende Vielsprachigkeit von Web-Inhalten resultiert in dem Bedarf an Sprachidentifikations-Software, die Sprache/en von elektronischen Dokumenten zwecks gezielter Weiterverarbeitung identifiziert. Solche Sprachidentifizierer können beispielsweise effektiv im Bereich des Multilingualen Information Retrieval eingesetzt werden, da auf den Sprachidentifikationsergebnissen Prozesse der automatischen Indexbildung wie Stemming, Stoppwörterextraktion etc. aufbauen. In der vorliegenden Arbeit wird das neue System "LangIdent" zur Sprachidentifikation von elektronischen Textdokumenten vorgestellt, das in erster Linie für Lehre und Forschung an der Universität Hildesheim verwendet werden soll. "LangIdent" enthält eine Auswahl von gängigen Algorithmen zu der monolingualen Sprachidentifikation, die durch den Benutzer interaktiv ausgewählt und eingestellt werden können. Zusätzlich wurde im System ein neuer Algorithmus implementiert, der die Identifikation von Sprachen, in denen ein multilinguales Dokument verfasst ist, ermöglicht. Die Identifikation beschränkt sich nicht nur auf eine Aufzählung von gefundenen Sprachen, vielmehr wird der Text in monolinguale Abschnitte aufgeteilt, jeweils mit der Angabe der identifizierten Sprache.
-
Karlova-Bourbonus, N.: Automatic detection of contradictions in texts (2018)
0.00
0.0033717435 = product of:
0.033717435 = sum of:
0.033717435 = weight(_text_:world in 5976) [ClassicSimilarity], result of:
0.033717435 = score(doc=5976,freq=8.0), product of:
0.1323281 = queryWeight, product of:
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.03442753 = queryNorm
0.25480178 = fieldWeight in 5976, product of:
2.828427 = tf(freq=8.0), with freq of:
8.0 = termFreq=8.0
3.8436708 = idf(docFreq=2573, maxDocs=44218)
0.0234375 = fieldNorm(doc=5976)
0.1 = coord(1/10)
- 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.00
9.328911E-4 = product of:
0.009328911 = sum of:
0.009328911 = product of:
0.027986731 = sum of:
0.027986731 = weight(_text_:22 in 1746) [ClassicSimilarity], result of:
0.027986731 = score(doc=1746,freq=2.0), product of:
0.12055935 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03442753 = 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.33333334 = coord(1/3)
0.1 = coord(1/10)
- Date
- 22. 3.2015 9:17:30
-
Rösener, C.: ¬Die Stecknadel im Heuhaufen : Natürlichsprachlicher Zugang zu Volltextdatenbanken (2005)
0.00
6.275728E-4 = product of:
0.006275728 = sum of:
0.006275728 = product of:
0.018827183 = sum of:
0.018827183 = weight(_text_:29 in 548) [ClassicSimilarity], result of:
0.018827183 = score(doc=548,freq=2.0), product of:
0.12110529 = queryWeight, product of:
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03442753 = queryNorm
0.15546128 = fieldWeight in 548, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.5176873 = idf(docFreq=3565, maxDocs=44218)
0.03125 = fieldNorm(doc=548)
0.33333334 = coord(1/3)
0.1 = coord(1/10)
- Date
- 29. 3.2009 11:11:45
