semantic relation

Definitions

  • WordNet 3.6
    • n semantic relation a relation between meanings
    • ***

Usage

In literature:

A stock semantic parallel occurs in the relation between age and respectability.
"The Romance of Words (4th ed.)" by Ernest Weekley
***

In news:

Semantic annotation of localization and identification relations falls under an immense project of automatic annotation of relations embodied in the platform EXCOM.
In this paper, a semantic parser for recognizing semantic roles and named entities in individual sentences of schizophrenia related scientific abstracts is described.
This paper addresses the task of automatic classification of semantic relations between nouns.
This paper addresses the task of automatic classification of semantic relation s between nouns.
Most word sense disambiguation (WSD) methods require large quantities of manually annotated training data and/or do not exploit fully the semantic relations of thesauri.
We introduce a new method for finding nodes semantically related to a given node in a hyperlinked graph: the Green method, based on a classical Markov chain tool.
***

In science:

Our proof is maybe even simpler; moreover it formalizes the relation between the declarative semantics of the transformed program and the operational semantics of the original one.
A Simple Correctness Proof for Magic Transformation
We are now ready to define the semantics of dependence logic. S ignatures t are assumed to be finite and they may contain constants, relations and function symbols.
Hierarchies in Dependence Logic
Sadilek and Wachsmuth propose a technique for defining the semantics of DSLs that uses model instances as configurations and QVT relations to define steps between configurations.
Prototyping the Semantics of a DSL using ASF+SDF: Link to Formal Verification of DSL Models
These two observations led us to a decision that at this point (sample six) we can start developing the framework for semantic relations as the number of concepts and relations are not frequently fluctuating.
Development of a Conceptual Structure for a Domain-Specific Corpus
Predicate relations in level 1 and level 2 concept maps are supported by Tier 1 semantic relations. The ontology along with the concept maps is depicted in .
A Corpus-based Evaluation of a Domain-specific Text to Knowledge Mapping Prototype
The semantics of dynamic controllability for CSTNUs also generalizes the related notions for CSTPs and STNUs.
The Dynamic Controllability of Conditional STNs with Uncertainty
Studying to properties of relation between query and search engine gave the understanding about the semantic representation statistically for ob ject in literal text.
Simple Search Engine Model: Adaptive Properties
In the context of modal logic, the similarity of two event spaces Ωx and Ωy for ω ⇒ tx (true) and ω ⇒ ty (true) respectively we use to explore the semantic relation of Ω where each search term is represented by a set of features .
Simple Search Engine Model: Adaptive Properties for Doubleton
Studying to properties of relation between query and search engine gave the understanding about the semantic representation of doubleton for ob ject in literal text.
Simple Search Engine Model: Adaptive Properties for Doubleton
The first aggregation step is to identify semantically related messages.
Conciseness through Aggregation in Text Generation
First define program equivalence, through the bigstep semantics: Notation "p ∼ q" := (bstep p == bstep q). (The “==” symbol denotes equality in the considered KAT model; in this case, relational equality.) The following lemmas about unfolding loops and dead code elimination, can be proved automatically.
Kleene Algebra with Tests and Coq Tools for While Programs
We will study this situation here with the result that we will obtain a coherent picture of relations between different semantics for normal logic programs.
Towards a Systematic Account of Different Semantics for Logic Programs
Of lesser importance, albeit still acknowledged in particular for their relation to resolutionbased logic programming, are the Fitting semantics and approaches based on stratification [2,22].
Towards a Systematic Account of Different Semantics for Logic Programs
The stable model semantics due to is intimately related to the well-founded semantics.
Towards a Systematic Account of Different Semantics for Logic Programs
The following theorem relates our observations to Definition 3, in perfect analogy to the correspondence between the stable model semantics, Theorem 1, Fages’s characterization from Theorem 2, the well-founded semantics, and the alternating fixed point characterization.
Towards a Systematic Account of Different Semantics for Logic Programs
***