Given a large volume of Web documents, we consider problem of finding the shortest keyword sequences for each of the documents such that a keyword sequence can be rendered to a given search engine, then the corresponding Web document can be identified and is ranked at the first place within the results. We call this system as an Inverse Search Engine (ISE). Whenever a shortest keyword sequence ...

Studies on the effect of the keyword method, a mnemonic technique that uses two links (acoustic and imagery) to facilitate memory for acquiring foreign words, are numerous. The majority of past studies found it effective for various age groups of learners for learning words of different languages. The findings however, have been inconclusive in: (a) its application to classroom settings; (b) it...

Isolated Word Verification (IWV) is the task of verifying the occurrence of a keyword at a specified location within a speech stream. Typical applications of IWV are to reduce the number of incorrect results output by a speech recognizer or keyword spotter. Such algorithms are also vital in reducing the false alarm rate in many commercial applications of speech recognition, such as automated te...

The present study investigated the effect of the keyword method of vocabulary teaching on the learning and longterm retention of vocabulary in a normal EFL classroom context. Fifty elementary EFL students were selected and assigned into experimental and control groups. The experimental group received vocabulary instruction using mnemonic keyword method and the control group received conventiona...

Although SPARQL has been the predominant query language over RDF graphs, some query intentions cannot be well captured by only using SPARQL syntax. On the other hand, the keyword search enjoys widespread usage because of its intuitive way of specifying information needs but suffers from the problem of low precision. To maximize the advantages of both SPARQL and keyword search, we introduce a no...

Searchable encryption allows a remote server to search over encrypted documents without knowing the sensitive data contents. Prior searchable symmetric encryption schemes focus on single keyword search. Conjunctive Keyword Searches (CKS) schemes improve system usability by retrieving the matched documents. In this type of search, the user has to repeatedly perform the search protocol for many t...

In this paper, we present a new method for isolated keyword detection that is meant to activate a personal device from standby state. Instead of using the common method for speech recognition such as Hidden Markov Model (HMM) or Dynamic Time Warping (DTW), we modify a GMM-UBM (Gaussian Mixture Model – Universal Background Model) scheme that is better known in speaker recognition field. Since on...

Efficient full-text searching is a big challenge in Peer-to-Peer (P2P) system. Recently, Distributed Hash Table (DHT) becomes one of the reliable communication schemes for P2P. Some research efforts perform keyword searching and result intersection on DHT substrate. Two or more search requests must be issued for multi-keyword query. This article proposes a Sliding Window improved Multi-keyword ...

In many collaborative systems, researchers are interested in creating representative user profiles. In this paper, we are particularly interested in using social labeling and automatic keyword extraction techniques for generating user profiles. Social labeling is a process in which users manually tag other users with keywords. Automatic keyword extraction is a technique that selects the most sa...

Abstract Unstructured texts are a very popular data type and still widely unexplored in the privacy preserving data mining field. We consider the problem of providing public information about a set of confidential documents. To that end we have developed a method to protect a Vector Space Model (VSM), to make it public even if the documents it represents are private. This method is inspired by ...