Query Suggestion by Concept Instantiation
نویسندگان
چکیده
A class of search queries which contain abstract concepts are studied in this paper. These queries cannot be correctly interpreted by traditional keyword-based search engines. This paper presents a simple framework that detects and instantiates the abstract concepts by their concrete entities or meanings to produce alternate queries that yield better search results. 3
منابع مشابه
A personalised query suggestion agent based on query-concept bipartite graphs and Concept Relation Trees
Queries submitted to a Web search engine are usually short and ambiguous. Currently, most search engines respond to a user’s query by using the bag-of-words model, which matches keywords between the query and Web documents but ignores contexts and users’ preferences. Thus, many irrelevant results are returned by the conventional search engines. Query suggestion is a way for extending queries to...
متن کاملAutomatic suggestion of phrasal-concept queries for literature search
Both general and domain-specific search engines have adopted query suggestion techniques to help users formulate effective queries. In the specific domain of literature search (e.g., finding academic papers), the initial queries are usually based on a draft paper or abstract, rather than short lists of keywords. In this paper, we investigate phrasal-concept query suggestions for literature sear...
متن کاملEntity Suggestion by Example using a Conceptual Taxonomy
Entity suggestion by example (ESbE) refers to a type of entity acquisition query in which a user provides a set of example entities as the query and obtains in return some entities that best complete the concept underlying the given query. Such entity acquisition queries can be useful in many applications such as related-entity recommendation and query expansion. A number of ESbE query processi...
متن کاملSyntactic Similarity for Ranking Database Answers Obtained by Anti-Instantiation
Flexible query answering can be implemented in an intelligent database system by query generalization to obtain answers close to a user’s intention although not answering his query exactly. In this paper, we focus on the generalization operator “Anti-Instantiation” and investigate how syntactic similarity measures can be used to rank generalized queries with regard to their closeness to the ori...
متن کاملEnriching Query Routing Processes in PDMS with Semantic Information and Information Quality
Query answering has been addressed as a key issue in dynamic distributed environments such as Peer Data Management Systems (PDMS). An important step in this process regards query routing, i.e., how to find peers (data sources) that are most likely to provide matching results according to the semantics of a submitted query. To help matters, we argue that semantic information like contextual info...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013