A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Filters
Universal Decompositional Semantics on Universal Dependencies
2016
Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing
Preserved Fulltext
We present a framework for augmenting data sets from the Universal Dependencies project with Universal Decompositional Semantics. ...
We describe results from annotating the English Universal Dependencies treebank, dealing with word senses, semantic roles, and event properties. ...
Introduction This paper describes the Universal Decompositional Semantics (Decomp) project, which aims to augments Universal Dependencies (UD) data sets with robust, scalable semantic annotations based ...
doi:10.18653/v1/d16-1177
dblp:conf/emnlp/WhiteRSVZRRD16
fatcat:arwt2attcvezvdy4fz5tqa3ola
Page 1095 of Mathematical Reviews Vol. , Issue 96b
[page]
1996
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “This paper focuses on one of the fundamental de- sign issues in fuzzy database modeling, namely, the dependency- preserving decomposition. ...
On the other hand, the decomposition should guarantee that the semantic knowledge and integrity constraints expressed by fuzzy functional dependency (FFD) are satisfactorily preserved by the resultant ...
The Universal Recommender
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Other Versions
In contrast to existing recommender systems, the Universal Recommender applies to any dataset that allows a semantic representation. ...
We describe the Universal Recommender, a recommender system for semantic datasets that generalizes domain-specific recommenders such as content-based, collaborative, social, bibliographic, lexicographic ...
Universal Latent Decomposition In this section, we describe the general decomposition approach for semantic networks used by the Universal Recommender. ...
arXiv:0909.3472v2
fatcat:g3o5nczpefapdchf5cr6czyjue
The Universal Decompositional Semantics Dataset and Decomp Toolkit
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We present the Universal Decompositional Semantics (UDS) dataset (v1.0), which is bundled with the Decomp toolkit (v0.1). ...
UDS1.0 unifies five high-quality, decompositional semantics-aligned annotation sets within a single semantic graph specification---with graph structures defined by the predicative patterns produced by ...
Acknowledgements This research was supported by the University of Rochester, JHU HLTCOE, the National Science Foundation (BCS-1748969/BCS-1749025), DARPA AIDA, DARPA KAIROS, and IARPA BETTER. ...
arXiv:1909.13851v1
fatcat:qwtutjopwzgepgg5vd4avr2rpm
Matrix and Tensor Factorization Methods for Natural Language Processing
2015
Tutorials
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This includes the link between eigenvalue decomposition and singular value decomposition and the trace-norm (a.k.a. nuclear norm) as a convex surrogate of the low-rank constraint on optimization problems ...
and dependency parsing. ...
This includes the link between eigenvalue decomposition and singular value decomposition and the trace-norm (a.k.a. nuclear norm) as a convex surrogate of the low-rank constraint on optimization problems ...
doi:10.3115/v1/p15-5005
dblp:conf/acl/BouchardNRRV15
fatcat:q2zksc5hqfe5ffgbpv477trdu4
Relational Databases and Bell's Theorem
[chapter]
2013
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
On the one hand there is the decomposition problem: how to decompose a large database into smaller parts, which would form an instance of a database schema with the associated dependencies. ...
One may indeed reformulate first order logic so that the semantics is not based on the concept of a model satisfying a sentence, but on the concept 1 ...
The question is, given an instance, does it arise from the decomposition of a big "universal" database into smaller ones. ...
doi:10.1007/978-3-642-41660-6_2
fatcat:nby7pcom5zhd7lhwxhzamkbaym
A view of directions in relational database theory
[chapter]
1981
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
These directions include dependency inferences, support for the universal relation concept, null value semantics, and an exploration of the properties of acyclic database schemes. I. ...
The appropriate response to redundancy is decomposition, the replacement of one relation scheme t ...
One requirement on the database scheme is the lossIess join property, the condition that when you take a legal universal relation and project it onto the relation scheme8 in the decomposition, then "join ...
doi:10.1007/3-540-10843-2_13
fatcat:j3mq6xblgfa6faorgg6h2f53fm
Relational decomposition through partial functional dependencies
2002
Data & Knowledge Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Throughout this work, we use that dependency to decompose relations through a more flexible and general decomposition process, and by iterating this process, we find a mechanism to extract knowledge from ...
It presents the concept of partial functional dependency in the relational database framework. This new kind of dependency is an extension to the classical definition of functional dependency. ...
If, in addition, the RDBMS allows views on views, then we can construct the universal relation related to an iterated decomposition. ...
doi:10.1016/s0169-023x(02)00056-3
fatcat:r4uccs3bfzakncsbbzmnfrb2w4
Aspect-Oriented Requirements Engineering: An Introduction
2008
2008 16th IEEE International Requirements Engineering Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
and operationalisation
based on goals and softgoals
• Your favourite technique
The Problem of Crosscutting
Concerns
• The dominant decomposition
-Slice requirements on the lines of viewpoints ...
influences and interferences from
syntactic compositions
• Composition fragility
• Make natural language requirement
semantics more explicit and base
composition on these semantics ...
Analysing Dependencies => --"time longer than 5s" } • Ask "how" and "how much" about the goals <SystemDeveloper>::Log [system] { AND Log [query information] => --"time longer than 5s" Log [submit complaints ...
doi:10.1109/re.2008.58
dblp:conf/re/Rashid08
fatcat:buqu3ifbnjhjvhxsx3jym724kq
Renormalization of Hierarchy and Semantic Computing
2018
Journal of Modern Physics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
coexist with certain universal, shared by each of them ones. ...
This implies that it depends on the current state of a system and the current environment impact. ...
This in turn opens the door to more efficient organization of the semantic intelligence. ...
doi:10.4236/jmp.2018.93024
fatcat:bu46fkjkkbfyvh4hw65wdixgau
ILexicOn: toward an ECD-compliant interlingual lexical ontology described with semantic web formalisms
[article]
2012
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
the projection of its semantic decomposition on itself. ...
Finally, we show how semantic web formalisms enable the projection of a semantic decomposition on the decomposed ILUc. ...
We thus propose a novel approach to the lexicographic definition of an ILU c that consists in projecting the minimal semantic decomposition of the ILU c on the ILU c using Semantic Actant-like slots. ...
arXiv:1204.5316v1
fatcat:qx2hdqodozhv7k4twzjxlu3guq
Towards a Tailored Theory of Consistency Enforcement in Databases
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Link: On Multivalued Dependencies in Fixed and Undetermined Universes, in J. Dix, S.J. ...
Link: Appropriate Reasoning about Data Dependencies in
Fixed and Undetermined Universes, 5th International Symposium on Foun-
dations of Information and Knowledge Systems -FoIKS 2008, Pisa, Italy,
LNCS ...
doi:10.1007/3-540-45758-5_11
fatcat:d7woowpivvbbhmke4jvprzz3ie
Graph-Based Meaning Representations: Design and Processing
2019
Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The tutorial will (a) briefly review relevant background in formal and linguistic semantics; (b) semi-formally define a unified abstract view on different flavors of semantic graphs and associated terminology ...
This tutorial is on representing and processing sentence meaning in the form of labeled directed graphs. ...
Stephan Oepen • Bi-Lexical semantic dependencies (Hockenmaier and Steedman, 2007; Miyao and Tsujii, 2008; Hajič et al., 2012; Ivanova et al., 2012; Che et al., 2016) ;• Universal Conceptual Cognitive Annotation ...
doi:10.18653/v1/p19-4002
dblp:conf/acl/KollerOS19
fatcat:z7wecf7xm5beteychramwvqgni
Anna Wierzbicka, Semantic Decomposition, and the Meaning-Text Approach
2018
Russian Journal of Linguistics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
To illustrate the importance and fruitfulness of semantic decomposition, two Meaning-Text mini-models are presented for English and Russian. ...
The paper aims to demonstrate that the main contribution of Anna Wierzbicka to linguistics is the idea of semantic decomposition -that is, representing meaning in terms of structurally organized configurations ...
-to discover the Semantic Primitives of human thought, linguistically universal semantic elements, or Semantic Primes, as they have come to be known lately, and, based on these, to elaborate a universal ...
doi:10.22363/2312-9182-2018-22-3-521-538
fatcat:mskphlzofra57k7igfnuvtakim
Bridging Semantic Web and Digital Shapes
[article]
2007
Eurographics State of the Art Reports
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
In this context, in order to reason on digital shapes and their associated semantic, we see a growing interest in exploiting the potential of the Semantic Web in different research fields. ...
We also provide motivations for further work in developing new techniques for managing 3D models on the Web. ...
The authors would like to thank Annie Hui and May Huang, from the University of Maryland, for the development of the first two modules of the system. ...
doi:10.2312/egs.20071044
fatcat:oobellh2yvg5xe3v6oufc4fg5u
« Previous
Showing results 1 — 15 out of 38,450 results