Log in

Relevant bibliographies by topics / Decompositional semantics / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Decompositional semantics.

Dissertations / Theses on the topic 'Decompositional semantics'

Author: Grafiati

Published: 4 June 2021

Last updated: 20 February 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 24 dissertations / theses for your research on the topic 'Decompositional semantics.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

de, Zwaan Alan. "Non-predicating adjectives: a semantic account." Thesis, Department of Linguistics, 2010. http://hdl.handle.net/2123/5797.

Full text

Abstract:

This thesis provides a semantic account of non-predication in the adjectives of English. Particular attention is paid to adjectives that are only non-predicating when they modify certain types of nouns; both agentive nouns and degree nouns are decomposed semantically into two distinct semantic elements, one of which consists of the referent (referential element) and another which consists of either an action associated with the noun or a quality already expressed by it (non-referential element). The other main focus of the thesis is denominal adjectives which have a structure like that of modi

APA, Harvard, Vancouver, ISO, and other styles

2

Saka, Paul. "Lexical decomposition in cognitive semantics." Diss., The University of Arizona, 1991. http://hdl.handle.net/10150/185592.

Full text

Abstract:

This dissertation formulates, defends, and exemplifies a semantic approach that I call Cognitive Decompositionism. Cognitive Decompositionism is one version of lexical decompositionism, which holds that the meaning of lexical items are decomposable into component parts. Decompositionism comes in different varieties that can be characterized in terms of four binary parameters. First, Natural Decompositionism contrasts with Artful Decompositionism. The former views components as word-like, the latter views components more abstractly. Second, Convenient Decompositionism claims that components are

APA, Harvard, Vancouver, ISO, and other styles

3

Sripadham, Shankar B. "Semantic Decomposition By Covering." Thesis, Virginia Tech, 2000. http://hdl.handle.net/10919/34335.

Full text

Abstract:

This thesis describes the implementation of a covering algorithm for semantic decomposition of sentences of technical patents. This research complements the ASPIN project that has a long term goal of providing an automated system for digital system synthesis from patents. In order to develop a prototype of the system explained in a patent, a natural language processor (sentence-interpreter) is required. These systems typically attempt to interpret a sentence by syntactic analysis (parsing) followed by semantic analysis. Quite often, the technical narrative contains grammatical errors, incompl

APA, Harvard, Vancouver, ISO, and other styles

4

Copeck, Terry (Frank Terrence) Carleton University Dissertation Computer Science. "A decompositional semantic system for natural language apprehension." Ottawa, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Krishnamurthy, Jayant (Jayant S. ). "Finding analogies in semantic networks using the singular value decomposition." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53131.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.<br>Includes bibliographical references (p. 59-61).<br>We present CROSSBRIDGE, an algorithm for finding analogies in large, sparse semantic networks. We treat analogies as comparisons between domains of knowledge. A domain is a small semantic network, i.e., a set of concepts and binary relations between concepts. We treat our knowledge base (the large semantic network) as if it contained many domains of knowledge, then apply dimensionality reduction to find the most salient relat

APA, Harvard, Vancouver, ISO, and other styles

6

Lamb, Katherine Marie. "Semantic feature distinctiveness and frequency." Scholar Commons, 2012. http://scholarcommons.usf.edu/etd/4354.

Full text

Abstract:

Lexical access is the process in which basic components of meaning in language, the lexical entries (words) are activated. This activation is based on the organization and representational structure of the lexical entries. Semantic features of words, which are the prominent semantic characteristics of a word concept, provide important information because they mediate semantic access to words. An experiment was conducted to examine the importance of semantic feature distinctiveness and feature frequency in accessing the lexical representations of young and older adults in an off-line task using

APA, Harvard, Vancouver, ISO, and other styles

7

JOSHI, ABHIJIT PURSHOTTAM. "CONTEXTUAL DECOMPOSITION OF WEB RESOURCES: APPLYING SEMANTIC GRAPH ANALYSIS TO PERSONAL URL SETS." University of Cincinnati / OhioLINK, 2003. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1070633035.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Joshi, Abhijit P. "Contextual decomposition of web resources applying semantic graph analysis to personal URL sets /." Cincinnati, Ohio : University of Cincinnati, 2002. http://rave.ohiolink.edu/etdc/view?acc%5Fnum=ucin.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Lefrançois, Maxime. "Représentation des connaissances sémantiques lexicales de la Théorie Sens-Texte : conceptualisation, représentation, et opérationnalisation des définitions lexicographiques." Phd thesis, Université Nice Sophia Antipolis, 2014. http://tel.archives-ouvertes.fr/tel-01071945.

Full text

Abstract:

Nous présentons une recherche en ingénierie des connaissances appliquée aux prédicats linguistiques et aux définitions lexicographiques de la théorie Sens-Texte (TST). Notre méthodologie comporte trois étapes. 1. Nous montrons en quoi la conceptualisation de la TST devrait être étendue pour faciliter sa formalisation. Nous justifions la nécessité de définir un niveau sémantique profond (SemP) à base de graphes. Nous y définissons la notion de type d'unité sémantique profonde et sa structure actancielle, de sorte que leur organisation hiérarchique puisse correspondre à une hiérarchie de sens au

APA, Harvard, Vancouver, ISO, and other styles

10

Sarkar, Somwrita. "Acquiring symbolic design optimization problem reformulation knowledge: On computable relationships between design syntax and semantics." Thesis, The University of Sydney, 2009. http://hdl.handle.net/2123/5683.

Full text

Abstract:

This thesis presents a computational method for the inductive inference of explicit and implicit semantic design knowledge from the symbolic-mathematical syntax of design formulations using an unsupervised pattern recognition and extraction approach. Existing research shows that AI / machine learning based design computation approaches either require high levels of knowledge engineering or large training databases to acquire problem reformulation knowledge. The method presented in this thesis addresses these methodological limitations. The thesis develops, tests, and evaluates ways in which th

APA, Harvard, Vancouver, ISO, and other styles

11

Dornescu, Iustin. "Encyclopaedic question answering." Thesis, University of Wolverhampton, 2012. http://hdl.handle.net/2436/254613.

Full text

Abstract:

Open-domain question answering (QA) is an established NLP task which enables users to search for speciVc pieces of information in large collections of texts. Instead of using keyword-based queries and a standard information retrieval engine, QA systems allow the use of natural language questions and return the exact answer (or a list of plausible answers) with supporting snippets of text. In the past decade, open-domain QA research has been dominated by evaluation fora such as TREC and CLEF, where shallow techniques relying on information redundancy have achieved very good performance. However

APA, Harvard, Vancouver, ISO, and other styles

12

Gorrell, Genevieve. "Generalized Hebbian Algorithm for Dimensionality Reduction in Natural Language Processing." Doctoral thesis, Linköping : Department of Computer and Information Science, Linköpings universitet, 2006. http://www.bibl.liu.se/liupubl/disp/disp2006/tek1045s.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Fähndrich, Johannes [Verfasser], Sahin [Akademischer Betreuer] Albayrak, Sahin [Gutachter] Albayrak, Rainer [Gutachter] Unland, and Michael [Gutachter] Weyrich. "Semantic decomposition and marker passing in an artificial representation of meaning / Johannes Fähndrich ; Gutachter: Sahin Albayrak, Rainer Unland, Michael Weyrich ; Betreuer: Sahin Albayrak." Berlin : Technische Universität Berlin, 2018. http://d-nb.info/1162540680/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

King, John Douglas. "Deep Web Collection Selection." Thesis, Queensland University of Technology, 2004. https://eprints.qut.edu.au/15992/3/John_King_Thesis.pdf.

Full text

Abstract:

The deep web contains a massive number of collections that are mostly invisible to search engines. These collections often contain high-quality, structured information that cannot be crawled using traditional methods. An important problem is selecting which of these collections to search. Automatic collection selection methods try to solve this problem by suggesting the best subset of deep web collections to search based on a query. A few methods for deep Web collection selection have proposed in Collection Retrieval Inference Network system and Glossary of Servers, Server system.

APA, Harvard, Vancouver, ISO, and other styles

15

King, John Douglas. "Deep Web Collection Selection." Queensland University of Technology, 2004. http://eprints.qut.edu.au/15992/.

Full text

Abstract:

The deep web contains a massive number of collections that are mostly invisible to search engines. These collections often contain high-quality, structured information that cannot be crawled using traditional methods. An important problem is selecting which of these collections to search. Automatic collection selection methods try to solve this problem by suggesting the best subset of deep web collections to search based on a query. A few methods for deep Web collection selection have proposed in Collection Retrieval Inference Network system and Glossary of Servers Server system. The d

APA, Harvard, Vancouver, ISO, and other styles

16

Sarkar, Somwrita. "Acquiring symbolic design optimization problem reformulation knowledge." Connect to full text, 2009. http://hdl.handle.net/2123/5683.

Full text

Abstract:

Thesis (Ph. D.)--University of Sydney, 2009.<br>Title from title screen (viewed November 13, 2009). Submitted in fulfilment of the requirements for the degree of Doctor of Philosophy to the Faculty of Architecture, Design and Planning in the Faculty of Science. Includes graphs and tables. Includes bibliographical references. Also available in print form.

APA, Harvard, Vancouver, ISO, and other styles

17

Kučaidze, Artiom. "Tinklalapio navigavimo asociacijų analizės ir prognozavimo modelis." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2009. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2008~D_20090908_201802-74260.

Full text

Abstract:

Darbe, remiantis informacijos paieškos teorija, bandoma sukurti tinklalapio navigavimo asociacijų analizės ir prognozavimo modelį. Šio modelio tikslas – simuliuoti potencialių tinklalapio vartotojų informacijos paieškos kelius turint apibrėžtą informacinį tikslą. Modelis kuriamas apjungiant LSA, SVD algoritmus ir koreliacijos koeficientų skaičiavimus. LSA algoritmas naudojamas kuriant semantines erdves, o koreliacijos koeficientų skaičiavimai naudojami statistikoje. Kartu jie leidžia tinklalapio navigavimo asociacijų analizės ir prognozavimo modeliui analizuoti žodžių semantinį panašumą. Darbo

APA, Harvard, Vancouver, ISO, and other styles

18

Belica, Michal. "Metody sumarizace dokumentů na webu." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2013. http://www.nusl.cz/ntk/nusl-236386.

Full text

Abstract:

The work deals with automatic summarization of documents in HTML format. As a language of web documents, Czech language has been chosen. The project is focused on algorithms of text summarization. The work also includes document preprocessing for summarization and conversion of text into representation suitable for summarization algorithms. General text mining is also briefly discussed but the project is mainly focused on the automatic document summarization. Two simple summarization algorithms are introduced. Then, the main attention is paid to an advanced algorithm that uses latent semantic

APA, Harvard, Vancouver, ISO, and other styles

19

Ayed, Rihab. "Recherche d’information agrégative dans des bases de graphes distribuées." Thesis, Lyon, 2019. http://www.theses.fr/2019LYSE1305.

Full text

Abstract:

Le sujet de cette thèse s’inscrit dans le cadre général de la Recherche d’Information et la gestion des données massives et distribuées. Notre problématique concerne l’évaluation et l’optimisation de requêtes agrégatives (Aggregated Search). La Recherche d’Information Agrégative est un nouveau paradigme permettant l’accès à l’information massivement distribuée. Elle a pour but de retourner à l’utilisateur d’un système de recherche d’information des objets résultats qui sont riches et porteurs de connaissances. Ces objets n’existent pas en tant que tels dans les sources. Ils sont construits par

APA, Harvard, Vancouver, ISO, and other styles

20

Sundaramurthy, Roshni. "Recommender System for Gym Customers." Thesis, Linköpings universitet, Statistik och maskininlärning, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-166147.

Full text

Abstract:

Recommender systems provide new opportunities for retrieving personalized information on the Internet. Due to the availability of big data, the fitness industries are now focusing on building an efficient recommender system for their end-users. This thesis investigates the possibilities of building an efficient recommender system for gym users. BRP Systems AB has provided the gym data for evaluation and it consists of approximately 896,000 customer interactions with 8 features. Four different matrix factorization methods, Latent semantic analysis using Singular value decomposition, Alternating

APA, Harvard, Vancouver, ISO, and other styles

21

Karol, Sven. "Well-Formed and Scalable Invasive Software Composition." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-170162.

Full text

Abstract:

Software components provide essential means to structure and organize software effectively. However, frequently, required component abstractions are not available in a programming language or system, or are not adequately combinable with each other. Invasive software composition (ISC) is a general approach to software composition that unifies component-like abstractions such as templates, aspects and macros. ISC is based on fragment composition, and composes programs and other software artifacts at the level of syntax trees. Therefore, a unifying fragment component model is related to the cont

APA, Harvard, Vancouver, ISO, and other styles

22

Park, Kyoungup. "A learning framework for higher-order consistency models in multi-class pixel labeling problems." Phd thesis, 2014. http://hdl.handle.net/1885/12686.

Full text

Abstract:

Recently, higher-order Markov random field (MRF) models have been successfully applied to problems in computer vision, especially scene understanding problems. One successful higher-order MRF model for scene understanding is the consistency model [Kohli and Kumar, 2010; Kohli et al., 2009] and earlier work by Ladicky et al. [2009, 2013] which contain higher-order potentials composed of lower linear envelope functions. In semantic image segmentation problems, which seek to identify the pixels of images with pre-defined labels of objects and backgrounds, this model encourages consistent lab

APA, Harvard, Vancouver, ISO, and other styles

23

Chui, Carmen. "Axiomatized Relationships between Ontologies." Thesis, 2013. http://hdl.handle.net/1807/42747.

Full text

Abstract:

This work focuses on the axiomatized relationships between different ontologies of varying levels of expressivity. Motivated by experiences in the decomposition of first-order logic ontologies, we partially decompose the Descriptive Ontology for Linguistic and Cognitive Engineering (DOLCE) into modules. By leveraging automated reasoning tools to semi-automatically verify the modules, we provide an account of the meta-theoretic relationships found between DOLCE and other existing ontologies. As well, we examine the composition process required to determine relationships between DOLCE modules

APA, Harvard, Vancouver, ISO, and other styles

24

Karol, Sven. "Well-Formed and Scalable Invasive Software Composition." Doctoral thesis, 2014. https://tud.qucosa.de/id/qucosa%3A28724.

Full text

Abstract:

Software components provide essential means to structure and organize software effectively. However, frequently, required component abstractions are not available in a programming language or system, or are not adequately combinable with each other. Invasive software composition (ISC) is a general approach to software composition that unifies component-like abstractions such as templates, aspects and macros. ISC is based on fragment composition, and composes programs and other software artifacts at the level of syntax trees. Therefore, a unifying fragment component model is related to the cont

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!