Results 11 to 20 of about 52,701 (264)

Causal reasoning and symbolic relationships in Medieval Illuminations [PDF]

open access: yesJournal of Data Mining and Digital Humanities, 2019
This work applies knowledge engineering’s techniques to medieval illuminations. Inside it, an illumination is considered as a knowledge graph which was used by some elites in the Middle Ages to represent themselves as a social group and exhibit the ...
Djibril Diarra   +2 more
doaj   +1 more source

Static Polycode Text Modeling Using Network Analysis (Demotivator Dedicated to Problems of Self-Isolation)

open access: yesНаучный диалог, 2022
The features of modeling a graphic-verbal polycode text, including a static image and an accompanying inscription, are considered. The study was conducted on the example of a demotivator dedicated to the problems of mass self-isolation at the very ...
M. N. Latu   +2 more
doaj   +1 more source

Wordnet Semantic Relations in a Chatbot

open access: yesRecoletos Multidisciplinary Research Journal, 2020
The goal of this research is to design and implement a chatbot for querying Wordnet semantic relations. The study creates a contextual chatbot named WordnetBot, a web application that utilizes the use of technologies such as Dialogflow, React, NodeJS ...
Josephine Petralba
doaj   +1 more source

Instantiation of Relations for Semantic Annotation [PDF]

open access: yes2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06), 2006
This paper presents a methodology for the semantic annotation of web pages with individuals of a domain ontology. While most semantic annotation systems can recognize knowledge units, they usually do not establish explicit relations between them. The method presented identifies the individuals which should be related among the whole set of individuals ...
Tenier, Sylvain   +3 more
openaire   +3 more sources

Co-induction in relational semantics [PDF]

open access: yesTheoretical Computer Science, 1991
The purpose of this paper is to present the use of non-well-founded sets in the study of programming languages semantics. The authors show how co- induction may be used for proving properties of non-well-founded sets (objects), in a similar way how induction is used for classical well- founded sets.
Milner, Robin, Tofte, Mads
openaire   +2 more sources

Learning Turkish Hypernymy Using Word Embeddings

open access: yesInternational Journal of Computational Intelligence Systems, 2018
Recently, Neural Network Language Models have been effectively applied to many types of Natural Language Processing (NLP) tasks. One popular type of tasks is the discovery of semantic and syntactic regularities that support the researchers in building a ...
Savaş Yıldırım, Tuğba Yıldız
doaj   +1 more source

Semantic Relations of the Alast Verse and Immutable Essences in Molana’s Mathnavi [PDF]

open access: yesنثرپژوهی ادب فارسی, 2017
Some Islamic mystics have found a close relationship between Verse 172 of Araaf Surrah in Holy Koran and the immutable essences which are among the terms in theoretical system of Ibn Arabi.
Mohammad Behnamfar, Alireza Baghban
doaj   +1 more source

Similarity of Semantic Relations [PDF]

open access: yesComputational Linguistics, 2006
There are at least two kinds of similarity. Relational similarity is correspondence between relations, in contrast with attributional similarity, which is correspondence between attributes. When two words have a high degree of attributional similarity, we call them synonyms.
openaire   +6 more sources

Automatic Construction of Persian ICT WordNet using Princeton WordNet [PDF]

open access: yesJournal of Artificial Intelligence and Data Mining, 2019
WordNet is a large lexical database of English language, in which, nouns, verbs, adjectives, and adverbs are grouped into sets of cognitive synonyms (synsets). Each synset expresses a distinct concept. Synsets are interlinked by both semantic and lexical
A. Ahmadi Tameh   +2 more
doaj   +1 more source

Relational Semantics Revisited

open access: yesElectronic Notes in Theoretical Computer Science, 2009
AbstractThis paper describes the systematic use of fixpoints for the relational semantics of unboundedly nondeterministic sequential programs. The focus is on analysing the expressiveness of various semantic definitions and of powerdomains including or excluding an ‘error’ element ⊥.
Best, Eike, Strecker, Kerstin
openaire   +3 more sources

Home - About - Disclaimer - Privacy