7,952 Hits in 4.4 sec

A Semantic Search Approach by Graph Matching with Negations and Inferences [chapter]

Kewei Tu, Jing Lu, Haiping Zhu, Guowei Liu, Yong Yu
2003 Lecture Notes in Computer Science  
Before matching we enrich the resource graphs with background knowledge by a deductive graph inference, so as to improve the search performance.  ...  The knowledge representation we employ is based on conceptual graphs and is expressive with negation. We carry out semantic search by graph matching, which can be performed in polynomial time.  ...  Conclusion and Future Work In this paper we introduced a semantic search approach by graph matching.  ... 
doi:10.1007/978-3-540-45091-7_27 fatcat:islbxtj3tjacvdlgcxoqbmymqy

Semantic Parsing for Textual Entailment

Elisabeth Lien, Milen Kouylekov
2015 Proceedings of the 14th International Conference on Parsing Technologies  
In this paper we gauge the utility of general-purpose, open-domain semantic parsing for textual entailment recognition by combining graph-structured meaning representations with semantic technologies and  ...  Our approach achieves high precision, and in two case studies we show that when reasoning over n-best analyses from the parser the performance of our system reaches stateof-the-art for rule-based textual  ...  Our work supports a notion of logical inference for TE by reasoning with formal rules over graph-structured meaning representations, while achieving results that are comparable with robust approaches.  ... 
doi:10.18653/v1/w15-2205 dblp:conf/iwpt/LienK15 fatcat:2pgq7lq2wzbm7g5pbgxyjvwvze

Semantically driven approach for scenario recognition in the IE system FRET [chapter]

Svetla Boytcheva, Milena Yankova, Albena Strupchanska
2004 Current issues in linguistic theory  
The presented approach uses partial semantic analysis based on logical form representation of the templates and the processed text.  ...  Some aspects of negation and modalities that occur in the texts are also taken into account.  ...  Our plans for future development of the system include making a deep investigation of the domain and completing the events graph.  ... 
doi:10.1075/cilt.260.28boy fatcat:btzusdbg2rgezea7lc3ijxykym

Exploiting Inference from Semantic Annotations for Information Retrieval

Guido Zuccon, Bevan Koopman, Peter Bruza
2014 Proceedings of the 7th International Workshop on Exploiting Semantic Annotations in Information Retrieval - ESAIR '14  
The medical domain offers a plethora of carefully curated, structured, semantic resources, along with well established entity extraction and linking tools, and search topics that intuitively require a  ...  We argue that integrating semantic inference in information retrieval has the potential to uncover a large amount of information that otherwise would be inaccessible; but inference is also risky and, if  ...  The authors would like to acknowledge Reviewer 1 for the insightful commentary and pointers.  ... 
doi:10.1145/2663712.2666197 dblp:conf/cikm/ZucconKB14 fatcat:idkfcomzxfbivha6w33qztmjf4

SBERT studies Meaning Representations: Decomposing Sentence Embeddings into Explainable AMR Meaning Features [article]

Juri Opitz, Anette Frank
2022 arXiv   pre-print
Our approach works in two steps: We first select AMR graph metrics that measure meaning similarity of sentences with respect to key semantic facets, such as, i.a., semantic roles, negation, or quantification  ...  In our experimental studies, we show that our approach offers a valuable balance between performance and interpretability.  ...  Instead, it infers the embedding of each sentence individually, and calculates similarity with simple vector algebra, which greatly reduces clustering and search time.  ... 
arXiv:2206.07023v1 fatcat:em5eyjanlbbslpnwuxbeazwatu

UIO-Lien: Entailment Recognition using Minimal Recursion Semantics

Elisabeth Lien, Milen Kouylekov
2014 Proceedings of the 8th International Workshop on Semantic Evaluation (SemEval 2014)  
Our results demonstrate that using generic tools for semantic analysis is a viable option for a system that recognizes textual entailment.  ...  In this paper we present our participation in the Semeval 2014 task "Evaluation of compositional distributional semantic models on full sentences through semantic relatedness and textual entailment".  ...  In Wotzlaw and Coote (2013) , the authors present an entailment recognition system which combines high-coverage syntactic and semantic text analysis with logical inference supported by relevant background  ... 
doi:10.3115/v1/s14-2125 dblp:conf/semeval/LienK14 fatcat:ivocel2rnjgfpovmsdpicdgnj4


2008 International journal on artificial intelligence tools  
In this paper we study a graph-based approach to the task of Recognizing Textual Entailment between a Text and a Hypothesis.  ...  It starts with mapping the Text and Hypothesis on to graph structures that have nodes representing concepts and edges representing lexico-syntactic relations among concepts.  ...  Acknowledgments This research was partially funded by The University of Memphis and AutoTutor, Coh-Metrix, and iSTART projects.  ... 
doi:10.1142/s0218213008004096 fatcat:wnv4q4w7orej7oki4ut3ybnpo4

Knowledge Graph Inference for spoken dialog systems

Yi Ma, Paul A. Crook, Ruhi Sarikaya, Eric Fosler-Lussier
2015 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)  
We propose Inference Knowledge Graph, a novel approach of remapping existing, large scale, semantic knowledge graphs into Markov Random Fields in order to create user goal tracking models that could form  ...  Since semantic knowledge graphs include both entities and their attributes, the proposed method merges the semantic dialog-state-tracking of attributes and the database lookup of entities that fulfill  ...  existence of matching entity names or relationships in the semantic graph [7] , or collecting natural language surface forms for relationships that exist within the graph by composing web search queries  ... 
doi:10.1109/icassp.2015.7178992 dblp:conf/icassp/MaCSF15 fatcat:itqktmxhn5covezlbzyuihmz64

WatsonPaths: Scenario-Based Question Answering and Inference over Unstructured Information

Adam Lally, Sugato Bagchi, Michael A. Barborak, David W. Buchanan, Jennifer Chu-Carroll, David A. Ferrucci, Michael R. Glass, Aditya Kalyanpur, Erik T. Mueller, J. William Murdock, Siddharth Patwardhan, John M. Prager
2017 The AI Magazine  
Probabilistic inference is performed over the graph to conclude the answer.  ...  These include medical questions that present a patient summary and ask for the most likely diagnosis or most appropriate treatment. WatsonPaths builds on the IBM Watson question answering system.  ...  The premise for this approach is to explore how a hypothesis fits in with the rest of the inference graph.  ... 
doi:10.1609/aimag.v38i2.2715 fatcat:anavizgd5bcofbbmuqchnc2ax4

Web Explanations for Semantic Heterogeneity Discovery [chapter]

Pavel Shvaiko, Fausto Giunchiglia, Paulo Pinheiro da Silva, Deborah L. McGuinness
2005 Lecture Notes in Computer Science  
We view Match as an operator that takes two graph-like structures (e.g., concept hierarchies or ontologies) and returns a mapping between the nodes of the graphs that correspond semantically to each other  ...  There, S-Match, a semantic matching system, produces proofs and explanations for mappings it has discovered.  ...  We view Match as one of the key operators for enabling semantic applications since it takes two graph-like structures and produces a mapping between the nodes of the graphs that correspond semantically  ... 
doi:10.1007/11431053_21 fatcat:7dgezfxlrbe7ppoagvwbkjwmzm

Proposal for Using NLP Interchange Format for Question Answering in Organizations

Majid Latifi
2013 International Web Rule Symposium  
Question Answering (QA) system is playing an important role in current search engine optimization.  ...  In this research we proposed an model to implement Conceptual Question Answering and Automatic Information Inferences for the enterprise's operational knowledge management in ontology-based learning organization  ...  Miquel Sànchez-Marrè for his helpful comments and guidance. I acknowledge the financial support of the Generalitat de Catalunya through the AGAUR agency for Consolidated Research Groups.  ... 
dblp:conf/ruleml/Latifi13 fatcat:h447vnbwfvh5ppbb6fykg72shy

Networked graphs

Simon Schenk, Steffen Staab
2008 Proceeding of the 17th international conference on World Wide Web - WWW '08  
We propose Networked Graphs, which allow users to define RDF graphs both, by extensionally listing content, but also by using views on other graphs.  ...  A simple declarative mechanism for reusing and combining RDF data would help users to generate content for the semantic web.  ...  Approaches for dealing with RDF graphs with either a declarative or a procedural semantics include the following: Stoermer et al. use named graphs plus semantic extensions of RDF to implement a system  ... 
doi:10.1145/1367497.1367577 dblp:conf/www/SchenkS08 fatcat:gkmarqyptzappoouysqsra4g3m

Finding and sharing GIS methods based on the questions they answer

S. Scheider, A. Ballatore, R. Lemmens
2018 International Journal of Digital Earth  
In this article, we systematically investigate the analytic questions that lie behind a range of common GIS tools, and we propose a semantic framework to match analytic questions and tools that are capable  ...  To support the matching process, we define a tractable subset of SPARQL, the query language of the Semantic Web, and we propose and test an algorithm for computing query containment.  ...  Disclosure statement No potential conflict of interest was reported by the authors.  ... 
doi:10.1080/17538947.2018.1470688 fatcat:6jtj3kzg6ba7bdq72qyjjsga2e

Comparison of Question Answering Systems Based on Ontology and Semantic Web in Different Environment

2012 Journal of Computer Science  
Results: The semantic search methodology is implemented by using RDF graph in the application of data structure domain and the performance is also analyzed.  ...  Approach: This paper surveys different types of question answering system based on ontology and semantic web model with different query format.  ...  In our QAAL system, Graph matching in ontology is used for implementing semantic search model. In a Graph, two steps are followed for finding the matching.  ... 
doi:10.3844/jcssp.2012.1407.1413 fatcat:xdfchvwntrfjxemyw6z5nogwvm

Database Foundations for Scalable RDF Processing [chapter]

Katja Hose, Ralf Schenkel, Martin Theobald, Gerhard Weikum
2011 Lecture Notes in Computer Science  
The third part of the lecture is thus intended to provide a close-up on current approaches and platforms to make reasoning (e.g., in the form of probabilistic inference) with uncertain RDF data scalable  ...  We cover search engines as well as federated query processing, highlight differences to classic federated database systems, and discuss efficient techniques for distributed query processing in general  ...  In the first step of searching, the user defines a keyword query. The result of the search is a list of all entities matching the keyword together with a summary description for the entities.  ... 
doi:10.1007/978-3-642-23032-5_4 fatcat:5owq3argizaj3epzu4yhuuxc6i
« Previous Showing results 1 — 15 out of 7,952 results