Enhancing the sentence similarity measure by semantic and syntactico-semantic knowledge
نویسندگان
چکیده
منابع مشابه
A Link Grammar and Semantic Corpus Based Sentence Similarity Measure
A novel sentence similarity measure that based on grammar and semantic corpus is presented. The well-known problem in the field of semantic processing, such as natural language processing, QA systems, expert systems, search engines, etc., is trying to evaluate the semantic similarity between sentences or articles. The major challenge is to evaluate the similarity of sentence-vs.-sentence since ...
متن کاملUsing Standardized Lexical Semantic Knowledge to Measure Similarity
The issue of sentence semantic similarity is important and essential to many applications of Natural Language Processing. This issue was treated in some frameworks dealing with the similarity between short texts especially with the similarity between sentence pairs. However, the semantic component was paradoxically weak in the proposed methods. In order to address this weakness, we propose in t...
متن کاملA Semantic Similarity Measure for Semantic Web Services
Establishing the compatibility of services is an essential prerequisite to service composition. By formally defining the similarity of semantic services, useful information can be obtained about their compatibility. In this paper we propose a metric for measuring the similarity of semantic services annotated with OWL ontology. Similarity is calculated by defining the intrinsic information value...
متن کاملEnhancing Algebraic Query Relaxation with Semantic Similarity
Cooperative database systems support a database user by searching for answers that are closely related to his query and hence are informative answers. Common operators to relax the user query are Dropping Condition, Anti-Instantiation and Goal Replacement. In this article, we provide an algebraic version of these operators. Moreover we propose some heuristics to assign a degree of similarity to...
متن کاملExploiting Syntactico-Semantic Structures for Relation Extraction
In this paper, we observe that there exists a second dimension to the relation extraction (RE) problem that is orthogonal to the relation type dimension. We show that most of these second dimensional structures are relatively constrained and not difficult to identify. We propose a novel algorithmic approach to RE that starts by first identifying these structures and then, within these, identify...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Vietnam Journal of Computer Science
سال: 2016
ISSN: 2196-8888,2196-8896
DOI: 10.1007/s40595-016-0080-2