The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
This paper proposes a strategy of the summary sentence selection for query-focused multi-document summarization through extracting keywords from relevant document set. It calculates the query related feature and the topic related feature for every word in relevant document set, then obtains the importance of the word
Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects user-defined bounds on the number of returned hits. We assume a real-world setting where the user is not given direct access to a Web search engine's index, i.e., querying is possible only through an interface
Keyword search over relational databases (KSORD) enables casual users to use keyword queries (a set of keywords) to search relational databases just like searching the Web, without any knowledge of the database schema or any need of writing SQL queries. In KSORD, retrieval of user's initial query is often unsatisfying
In previous work, we showed that using a lattice instead of the 1-best path to represent both the query and the utterance being searched is beneficial for spoken keyword spotting. In this paper, we introduce several techniques that further improve our multi-lattice alignment approach, including edit operation modeling
Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. Compared with traditional keyword search, it is far more expensive to answer a keyword query over probabilistic XML data due to the consideration of possible world semantics. In this paper, we
Ranking of object summaries proposed a keyword search paradigm which produces, as a query result, a ranked list of object summaries (OSs) in top-k and size-l; each OS summaries all data held in the relational database about a particular data subject (DS). This paper further investigates the volatility of the ranking
subjectivity of deciding relevant documents empirically. Furthermore, a sentence selection strategy through extracting keywords is proposed. It calculated the word's query related feature through word co-occurrence window, and obtained the topic related feature through likelihood ratio, then combined the two features to extract
This work identifies relevant songs from a user's personal music collection to accompany pictures of an event. The event's pictures are analyzed to extract aggregated semantic concepts in a variety of dimensions, including scene type, geospatial information, and event type, along with user-provided keywords. These
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.