Xiantang Sun
ABSTRACT
This paper introduces our domain independent approach to "free generation" from single RDF triples without using any domain dependent knowledge. Our approach is developed based on our argument that RDF representations carry rich linguistic information, which can be used to achieve readable domain independent generation. In order to examine to what extent our argument is realistic, we carry out an evaluation experiment, which is the first evaluation of this kind of domain independent generation in the field.
- J. C. Lester, and B. W. Porter. (1997) Developing and empirically evaluating robust explanation generators: The Knight Experiments. Computational Linguistics 23(1):65--101. Google Scholar
Digital Library
- O. Mason, (2003). Qtag 3.1. Department of English, School of Humanities, University of Birmingham, http://web.bham.ac.uk/O.Mason/software/tagger/Google Scholar
- C. Mellish and X. Sun. (2006). The Semantic Web as a Linguistic Resource. Knowledge Based Systems 19, pp 298--303.Google ScholarDigital Library
- W3C, (1999). "Resource Description Framework (RDF) Model and Syntax Specification.", http://www.w3.org/TR/PR-rdf-syntax/.Google Scholar
- X Sun and C. Mellish. (2006). Domain Independent Sentence Generation from RDF Representations for the Semantic Web. Combined Workshop on Language-Enabled Educational Technology (ECAI'06), Italy.Google Scholar
- An experiment on "free generation" from single RDF triples
Recommendations
Enquiring Semantic Relations among RDF Triples
DCABES '12: Proceedings of the 2012 11th International Symposium on Distributed Computing and Applications to Business, Engineering & ScienceThis paper presents the research work of extending the semantic web retrieval language SPARQL and the ARQ engine in Jena to searching semantic relations among RDF triples by introducing a new query pattern which retrieves semantic relation paths between ...
Extended RDF: Computability and complexity issues
ERDF stable model semantics is a recently proposed semantics for ERDF ontologies and a faithful extension of RDFS semantics on RDF graphs. In this paper, we elaborate on the computability and complexity issues of the ERDF stable model semantics. Based ...
Predicting RDF triples in incomplete knowledge bases with tensor factorization
SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied ComputingOn RDF datasets, the truth values of triples are known when they are either explicitly stated or can be inferred using logical entailment. Due to the open world semantics of RDF, nothing can be said about the truth values of triples that are neither in ...
Comments