-
Huo, W.: Automatic multi-word term extraction and its application to Web-page summarization (2012)
0.21
0.2064732 = product of:
0.4817708 = sum of:
0.14306398 = weight(_text_:2f in 563) [ClassicSimilarity], result of:
0.14306398 = score(doc=563,freq=2.0), product of:
0.25455406 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03002521 = 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.02018744 = weight(_text_:classification in 563) [ClassicSimilarity], result of:
0.02018744 = score(doc=563,freq=2.0), product of:
0.09562149 = queryWeight, product of:
3.1847067 = idf(docFreq=4974, maxDocs=44218)
0.03002521 = queryNorm
0.21111822 = fieldWeight in 563, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1847067 = idf(docFreq=4974, maxDocs=44218)
0.046875 = fieldNorm(doc=563)
0.14306398 = weight(_text_:2f in 563) [ClassicSimilarity], result of:
0.14306398 = score(doc=563,freq=2.0), product of:
0.25455406 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03002521 = 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.02018744 = weight(_text_:classification in 563) [ClassicSimilarity], result of:
0.02018744 = score(doc=563,freq=2.0), product of:
0.09562149 = queryWeight, product of:
3.1847067 = idf(docFreq=4974, maxDocs=44218)
0.03002521 = queryNorm
0.21111822 = fieldWeight in 563, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.1847067 = idf(docFreq=4974, maxDocs=44218)
0.046875 = fieldNorm(doc=563)
0.14306398 = weight(_text_:2f in 563) [ClassicSimilarity], result of:
0.14306398 = score(doc=563,freq=2.0), product of:
0.25455406 = queryWeight, product of:
8.478011 = idf(docFreq=24, maxDocs=44218)
0.03002521 = 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.0122040035 = product of:
0.024408007 = sum of:
0.024408007 = weight(_text_:22 in 563) [ClassicSimilarity], result of:
0.024408007 = score(doc=563,freq=2.0), product of:
0.10514317 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03002521 = 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.5 = coord(1/2)
0.42857143 = coord(6/14)
- 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
-
Pepper, S.: ¬The typology and semantics of binominal lexemes : noun-noun compounds and their functional equivalents (2020)
0.01
0.006660128 = product of:
0.046620894 = sum of:
0.023310447 = weight(_text_:classification in 104) [ClassicSimilarity], result of:
0.023310447 = score(doc=104,freq=6.0), product of:
0.09562149 = queryWeight, product of:
3.1847067 = idf(docFreq=4974, maxDocs=44218)
0.03002521 = queryNorm
0.24377833 = fieldWeight in 104, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.1847067 = idf(docFreq=4974, maxDocs=44218)
0.03125 = fieldNorm(doc=104)
0.023310447 = weight(_text_:classification in 104) [ClassicSimilarity], result of:
0.023310447 = score(doc=104,freq=6.0), product of:
0.09562149 = queryWeight, product of:
3.1847067 = idf(docFreq=4974, maxDocs=44218)
0.03002521 = queryNorm
0.24377833 = fieldWeight in 104, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
3.1847067 = idf(docFreq=4974, maxDocs=44218)
0.03125 = fieldNorm(doc=104)
0.14285715 = coord(2/14)
- Abstract
- The dissertation establishes 'binominal lexeme' as a comparative concept and discusses its cross-linguistic typology and semantics. Informally, a binominal lexeme is a noun-noun compound or functional equivalent; more precisely, it is a lexical item that consists primarily of two thing-morphs between which there exists an unstated semantic relation. Examples of binominals include Mandarin Chinese ?? (tielù) [iron road], French chemin de fer [way of iron] and Russian ???????? ?????? (zeleznaja doroga) [iron:adjz road]. All of these combine a word denoting 'iron' and a word denoting 'road' or 'way' to denote the meaning railway. In each case, the unstated semantic relation is one of composition: a railway is conceptualized as a road that is composed (or made) of iron. However, three different morphosyntactic strategies are employed: compounding, prepositional phrase and relational adjective. This study explores the range of such strategies used by a worldwide sample of 106 languages to express a set of 100 meanings from various semantic domains, resulting in a classification consisting of nine different morphosyntactic types. The semantic relations found in the data are also explored and a classification called the Hatcher-Bourque system is developed that operates at two levels of granularity, together with a tool for classifying binominals, the Bourquifier. The classification is extended to other subfields of language, including metonymy and lexical semantics, and beyond language to the domain of knowledge representation, resulting in a proposal for a general model of associative relations called the PHAB model. The many findings of the research include universals concerning the recruitment of anchoring nominal modification strategies, a method for comparing non-binary typologies, the non-universality (despite its predominance) of compounding, and a scale of frequencies for semantic relations which may provide insights into the associative nature of human thought.
-
Karlova-Bourbonus, N.: Automatic detection of contradictions in texts (2018)
0.01
0.0055192295 = product of:
0.038634606 = sum of:
0.012730695 = weight(_text_:subject in 5976) [ClassicSimilarity], result of:
0.012730695 = score(doc=5976,freq=2.0), product of:
0.10738805 = queryWeight, product of:
3.576596 = idf(docFreq=3361, maxDocs=44218)
0.03002521 = queryNorm
0.11854853 = fieldWeight in 5976, product of:
1.4142135 = tf(freq=2.0), with freq of:
2.0 = termFreq=2.0
3.576596 = idf(docFreq=3361, maxDocs=44218)
0.0234375 = fieldNorm(doc=5976)
0.025903909 = product of:
0.051807817 = sum of:
0.051807817 = weight(_text_:texts in 5976) [ClassicSimilarity], result of:
0.051807817 = score(doc=5976,freq=6.0), product of:
0.16460659 = queryWeight, product of:
5.4822793 = idf(docFreq=499, maxDocs=44218)
0.03002521 = queryNorm
0.3147372 = fieldWeight in 5976, product of:
2.4494898 = tf(freq=6.0), with freq of:
6.0 = termFreq=6.0
5.4822793 = idf(docFreq=499, maxDocs=44218)
0.0234375 = fieldNorm(doc=5976)
0.5 = coord(1/2)
0.14285715 = coord(2/14)
- Abstract
- 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.
-
Nagy T., I.: Detecting multiword expressions and named entities in natural language texts (2014)
0.00
0.0030528049 = product of:
0.042739265 = sum of:
0.042739265 = product of:
0.08547853 = sum of:
0.08547853 = weight(_text_:texts in 1536) [ClassicSimilarity], result of:
0.08547853 = score(doc=1536,freq=12.0), product of:
0.16460659 = queryWeight, product of:
5.4822793 = idf(docFreq=499, maxDocs=44218)
0.03002521 = queryNorm
0.51928985 = fieldWeight in 1536, product of:
3.4641016 = tf(freq=12.0), with freq of:
12.0 = termFreq=12.0
5.4822793 = idf(docFreq=499, maxDocs=44218)
0.02734375 = fieldNorm(doc=1536)
0.5 = coord(1/2)
0.071428575 = coord(1/14)
- Abstract
- Multiword expressions (MWEs) are lexical items that can be decomposed into single words and display lexical, syntactic, semantic, pragmatic and/or statistical idiosyncrasy (Sag et al., 2002; Kim, 2008; Calzolari et al., 2002). The proper treatment of multiword expressions such as rock 'n' roll and make a decision is essential for many natural language processing (NLP) applications like information extraction and retrieval, terminology extraction and machine translation, and it is important to identify multiword expressions in context. For example, in machine translation we must know that MWEs form one semantic unit, hence their parts should not be translated separately. For this, multiword expressions should be identified first in the text to be translated. The chief aim of this thesis is to develop machine learning-based approaches for the automatic detection of different types of multiword expressions in English and Hungarian natural language texts. In our investigations, we pay attention to the characteristics of different types of multiword expressions such as nominal compounds, multiword named entities and light verb constructions, and we apply novel methods to identify MWEs in raw texts. In the thesis it will be demonstrated that nominal compounds and multiword amed entities may require a similar approach for their automatic detection as they behave in the same way from a linguistic point of view. Furthermore, it will be shown that the automatic detection of light verb constructions can be carried out using two effective machine learning-based approaches.
In this thesis, we focused on the automatic detection of multiword expressions in natural language texts. On the basis of the main contributions, we can argue that: - Supervised machine learning methods can be successfully applied for the automatic detection of different types of multiword expressions in natural language texts. - Machine learning-based multiword expression detection can be successfully carried out for English as well as for Hungarian. - Our supervised machine learning-based model was successfully applied to the automatic detection of nominal compounds from English raw texts. - We developed a Wikipedia-based dictionary labeling method to automatically detect English nominal compounds. - A prior knowledge of nominal compounds can enhance Named Entity Recognition, while previously identified named entities can assist the nominal compound identification process. - The machine learning-based method can also provide acceptable results when it was trained on an automatically generated silver standard corpus. - As named entities form one semantic unit and may consist of more than one word and function as a noun, we can treat them in a similar way to nominal compounds. - Our sequence labelling-based tool can be successfully applied for identifying verbal light verb constructions in two typologically different languages, namely English and Hungarian. - Domain adaptation techniques may help diminish the distance between domains in the automatic detection of light verb constructions. - Our syntax-based method can be successfully applied for the full-coverage identification of light verb constructions. As a first step, a data-driven candidate extraction method can be utilized. After, a machine learning approach that makes use of an extended and rich feature set selects LVCs among extracted candidates. - When a precise syntactic parser is available for the actual domain, the full-coverage identification can be performed better. In other cases, the usage of the sequence labeling method is recommended.
-
Lorenz, S.: Konzeption und prototypische Realisierung einer begriffsbasierten Texterschließung (2006)
0.00
8.7171455E-4 = product of:
0.0122040035 = sum of:
0.0122040035 = product of:
0.024408007 = sum of:
0.024408007 = weight(_text_:22 in 1746) [ClassicSimilarity], result of:
0.024408007 = score(doc=1746,freq=2.0), product of:
0.10514317 = queryWeight, product of:
3.5018296 = idf(docFreq=3622, maxDocs=44218)
0.03002521 = 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.071428575 = coord(1/14)
- Date
- 22. 3.2015 9:17:30
