298 results about "Query expansion" patented technology

A voice query extension method and system. The voice query extension method includes: detecting voice activity of a user from an input signal and extracting a feature vector from the voice activity; converting the feature vector into at least one phoneme sequence and generating the at least one phoneme sequence; matching the at least one phoneme sequence with words registered in a dictionary, extracting a string of the matched words with a linguistic meaning, and selecting the string of the matched words as a query; determining whether the query is in a predetermined first language, and when the query is not in the first language as a result of the determining, converting the query using a phoneme to grapheme rule, and generating a query in the first language; and searching using the query in the first language.

A method and apparatus for efficient query expansion using reduced size indices and for progressive query processing. Queries are expanded conceptually, using semantically similar and syntactically related words to those specified by the user in the query to reduce the chances of missing relevant documents. The notion of a multi-granularity information and processing structure is used to support efficient query expansion, which involves an indexing phase, a query processing and a ranking phase. In the indexing phase, semantically similar words are grouped into a concept which results in a substantial index size reduction due to the coarser granularity of semantic concepts. During query processing, the words in a query are mapped into their corresponding semantic concepts and syntactic extensions, resulting in a logical expansion of the original query. Additionally, the processing overhead is avoided. The initial query words can then be used to rank the documents in the answer set on the basis of exact, semantic and syntactic matches and also to perform progressive query processing.

Query objects are created by a client process. The query objects have one or more sub-query objects and one or more execute methods that are capable of operating on their respective query object to produce one or more query expressions. All of the execute methods are capable of producing the respective query expression that is compatible with a structured query language. A compound query contains one or more boolean expressions of one or more of the query objects. The compound query has one or more compound execute methods which invoke one or more the execute methods of each of the query objects. Each of the execute methods returns their respective query expression and the compound execute method uses one or more common table expressions to combine the query expressions to form a single compound query expression that represents the boolean expression. This single expression can be execute against a database to return a result without executing any of the query expressions against the database individually.

A method, system, and computer program product for performing searching that generates improved queries, retrieves meaningful and relevant information, and presents the retrieved information to the user in a useful and comprehensive manner is described. The method of searching comprises the steps of: receiving from a user a search query requesting information, retrieving at least one recommendation relating to the search query, generating an expanded query based on the received query, performing a search using the expanded query to retrieve documents, and generating themes relating to the retrieved documents. The at least one recommendation relating to the search query is retrieved from a recommendation database. The recommendation database is generated by performing the steps of: performing data mining using users search query logs, user search patterns, and user profile information to generate a plurality of recommendations relating to search query strings, generating a data structure including the recommendations relating to search query strings, and generating a text index based on information in the data structure.

Methods, systems, and apparatus, including computer program products, for identifying candidate synonyms of transliterated terms for query expansion. In one aspect, a method includes identifying multiple transliterated terms in a target language. For each transliterated term of the multiple transliterated terms in the target language, the transliterated term is mapped to one or more terms in a source language. For a first transliterated term of the multiple transliterated terms in the target language, one or more second transliterated terms of the multiple transliterated terms in the target language are identified as candidate synonyms of the first transliterated term, where each of the one or more second transliterated terms is mapped to at least one term in the source language that is also mapped from the first transliterated term.

A system and method for providing a user interface with search query broadening is described. A query defining a search executable on potentially retrievable information is accepted. The query is parsed. A broadened query is provided. At least one of the broadened query and results of a search executed on the broadened query is presented.

The present invention provides a method and system that enable search result snippet analysis for query expansion and result filtering. Further, a technique for post processing search result snippets is provided to suggest topics for further search and extracting terms related to the search topic for later use.

A method and apparatus for efficient query expansion using reduced size indices and for progressive query processing. Queries are expanded conceptually, using semantically similar and syntactically related words to those specified by the user in the query to reduce the chances of missing relevant documents. The notion of a multi-granularity information and processing structure is used to support efficient query expansion, which involves an indexing phase, a query processing and a ranking phase. In the indexing phase, semantically similar words are grouped into a concept which results in a substantial index size reduction due to the coarser granularity of semantic concepts. During query processing, the words in a query are mapped into their corresponding semantic concepts and syntactic extensions, resulting in a logical expansion of the original query. Additionally, the processing overhead is avoided. The initial query words can then be used to rank the documents in the answer set on the basis of exact, semantic and syntactic matches and also to perform progressive query processing.

A document retrieval system is provided which has a document display interface which is easy to recognize the important portions even if a document retrieved by using a query expression designated by a document or a long sentence is displayed. When a text is registered, predetermined character strings and location information which are extracted from the text are stored in a location information file. A weight of each character string is calculated by a predetermined method and is stored in a weight file. In retrieving a document, predetermined character strings are extracted from a designated query expression. A similarity is calculated between the query expression and texts in the database by using the location information and the weights acquired from the location file and the weight file. In displaying the document, character strings having the high weights are extracted from the character strings used for the retrieval. Then, the display format of a portion which contains the extracted character strings is changed to display the text.

A method for evaluating a user query on a relational database having records stored therein, a workload made up of a set of queries that have been executed on the database, and a query optimizer that generates a query execution plan for the user query. Each query plan includes a plurality of intermediate query plan components that verify a subset of records from the database meeting query criteria. The method accesses the query plan and a set of stored intermediate statistics for records verified by query components, such as histograms that summarize the cardinality of the records that verify the query component. The method forms a transformed query plan based on the selected intermediate statistics (possibly by rewriting the query plan) and estimates the cardinality of the transformed query plan to arrive at a more accurate cardinality estimate for the query. If additional intermediate statistics are necessary, a pool of intermediate statistics may be generated based on the queries in the workload by evaluating the benefit of a given statistic over the workload and adding intermediate statistics to the pool that provide relatively great benefit.

A technique for identifying one or more items from amongst a plurality of items in response to a spoken utterance is used to improve call routing and information retrieval systems which employ automatic speech recognition (ASR). An automatic speech recognizer is used to recognize the utterance, including generating a plurality of hypotheses for the utterance. A query element is then generated for use in identifying one or more items from amongst the plurality of items. The query element includes a set of values representing two or more of the hypotheses, each value corresponding to one of the words in the hypotheses. Each value in the query element is then weighted based on hypothesis confidence, word confidence, or both, as determined by the ASR process. The query element is then applied to the plurality of items to identify one or more items which satisfy the query.

A system and method for automatically extracting relevant key concepts from a free-text document and indexing the document using the extracted key concepts. The indexing mechanism applies syntactic and semantic filters to filter out irrelevant terms. The remaining terms are deemed to be key concepts for the free-text document. An input search query is compared against the key concepts extracted for the free-text document for determining whether the document satisfies the query. Prior to applying the search query, additional scenario-specific terms are added to the search query in order to improve retrieval performance. The query expansion mechanism generates a list of candidate expansion concepts, filters the list of candidate expansion concepts based on a user-entered scenario concept, and expands the input query based on the candidate expansion concepts remaining after the filtering process.

A method and system for improved query expansion in faceted search are provided. The method includes: receiving a search query; expanding the search query to obtain query expansion terms; and receiving a facet selection for the search query. A facet profile is retrieved in the form of collected important terms for the facet; and the query expansion terms are weighted by comparing them to the facet profile. The query expansion terms are re-ranked and the method includes executing the re-weighted query expansion terms whilst filtering for the facet.

An improved technique of querying a data store by widening the query using a series of queries that follow relations between items. Initial auxiliary queries are used to find metadata property values (rather than the actual items) that are then used in the subsequent queries. The initial queries employ one or more property values to find a related item. In response thereto, an action menu is presented for the item that facilitates widening the search for all other items with the same selected property value. The user can be presented with several choices depending on which property is used for query widening.

The invention discloses a short text query expansion and indexing method based on a word vector. The short text query expansion and indexing method particularly comprises: A, pretreatment of corpus information of a short text; B, expression of every word in a corpus dictionary by the word vector through a training model; C, query extension; D, obtaining of a text candidate set through a query expansion word set and a BM25 index model; E, extraction of subject of the short text; F, calculation of the text vector of the short text; G, re-sequencing of the short text returned by a traditional indexing model. The short text query expansion and indexing method can more exactly and effectively satisfy the indexing demand of a user; moreover, the query expansion module can find out words capable of expressing user's intension according to the existing data so as to perform the query expansion.

A rendering engine dynamically renders content that includes query expressions. The query expressions are resolved by extracting data from a data source. The resolutions to the queries are rendered with the content, according to rules associated with the content.

A system is disclosed for expanding a user query based on user learned popularity rankings. User queries often have no exact match, resulting in a user having to refine or abandon the search. The disclosed system obtains popularity rankings based on the content of a user query. The system expands the user query based on the popularity rankings. Thereafter, query results based on the expanded user query may be provided to the user. The system also regularly learns from user behavior and adapts the popularity rankings according to the learned information.

The invention belongs to the field of multimedia information retrieval and relates to a method for realizing thesaurus-based query expansion and sort in image retrieval. The method comprises a WordNet-based English word semantic similarity metric algorithm, a HowNet-based Chinese word semantic similarity metric algorithm, an expansion rule-based query expansion word selection and optimization algorithm and a retrieval result evaluation and optimization algorithm. In the method, an image search engine is improved by the relevant text processing method and the relevant semantic network dictionary; and the retrieval result is sorted through semantic expansion, user interaction and improved similarity measurement. Compared with the traditional method, the method has the advantages of high accuracy rate, high integrality and low space-time cost. The method has very important significance for performing high-efficiency image retrieval according to image high-layer semantic information and on the basis of a large-scale image data set, and has wide application value in the field of cross-linguistic and cross-media retrieval.

Systems and processes for managing graph queries on navigational relationships of database entities are described. A graph index may be used to store a class of navigational relationships to expand query capabilities and improve query efficiency of a traditional relational database. Entity relationships stored in the graph index may be dynamically defined and made accessible to query writers. In addition, users can specify particular entity attributes to be replicated in the graph index from the corresponding entities stored in the traditional relational database. Query performance may be improved by leveraging the graph index data and querying both the database and the graph index. Queries of the underlying database may be narrowed by first searching the graph index. Queries of the graph index may also be narrowed by first searching the underlying database. Historic query data may be stored and used to improve subsequent query execution plans.

A method, apparatus, and computer program product for querying data in a database. An ontology is associated with the data in the database. A query containing a query predicate is received. The query predicate is expanded using implications from the ontology to form a modified query. The modified query is rewritten to include subsumption checking.

Document retrieval system and method are disclosed which can diminish a gap between the user's retrieval intention in information retrieval and the configuration of a query as well as document representations in database and which permits easy retrieval reflecting the user's retrieval intention. The user enumerates a group of words which the user hits upon, as a primary query. Upon receipt of the primary query, the system estimates relational representations which the words (group) of the primary query can possess, and then makes expansion of the query through a partial coincidence of the relational representations and sample spaces extracted from document data to prepare a query candidate representation group. The expanded query candidate representation group is presented to the user. The user then simply chooses a relational representation candidate in accordance with his or her intention. A retrieval execution query is constituted by the thus-selected representation.

The invention discloses a question matching system and a question matching system in an intelligent interaction system. The question matching method comprises the following steps of performing word segmentation, stop word removal and query expansion on a question asked by a user to avoid interferences of small correlation in a complex sentence to question matching results; according to a preset index file, matching a candidate question associated with the questioning question in a question and answer database, and reducing question matching calculation amount; then, calculating the similarity of the questioning question with the question in a similar question set corresponding to the candidate question, thereby avoiding a condition that same questions are not matched with questions due to a plurality of different asking methods, and improving the question matching results; finally, according to the calculated similarity, outputting an answer corresponding to the question matched with the questioning question according to a preset rule. According to the whole scheme, the accuracy rate of the question matching results in the intelligent interaction system is increased.

The invention discloses a multilayer quotation recommendation method based on a literature content mapping knowledge domain, and belongs to the field of information recommendation and intelligent information processing. The method comprises the following steps: firstly, obtaining the query requirement of a user, wherein the query requirement consists of the key words of the title and the digest of a thesis which needs to recommend a quotation thesis or quotation literature; then, on the basis of the literature content mapping knowledge domain, expanding and querying a retrieval word, wherein the mapping knowledge domain consists of the research object word and the research behavior word node of the literature, and edges which express various semantic relations including synonymy, synonym, an up and down position, part-whole, juxtaposition and the like; and finally, constructing the inverted index of the literature in a data set, selecting a candidate quotation, calculating the similarity between the candidate quotation and query, and adopting a gradient progressive regression tree to carry out quotation recommendation. The method carries out multilayer quotation recommendation on the basis of the literature content mapping knowledge domain, enlarges the range of the candidate quotation, accurately expresses the research object and contents of the thesis, improves efficiency for users to obtain a relevant literature and has a wide application prospect.

The present invention provides an apparatus for expanding a query requirement, comprising: a query requirement understanding device which generates an explicit query requirement according to a user query request; and a query requirement expanding device which generates an implicit query requirement associated with the explicit query requirement. The query requirement understanding device generates an explicit query requirement including a query concept and a question type by searching a knowledge base and a language base, and the query requirement expanding device generates an implicit query requirement including a query concept and a question type by searching the knowledge base, the language base and a relevancy database. The present invention further provides a method for expanding a query requirement. The apparatus and method for expanding a query requirement according to the present invention can facilitate a user's query and provide the user with an accurate, comprehensive query answer.

The invention provides a text search method. The text search method comprises the following steps that an inquiry statement is divided into a key semanteme and a key word according to the input inquiry statement, semantic extension based on the domain ontology is carried out according to the key semanteme so that the extended semanteme can be generated, an extended inquiry statement is generated according to the extended semanteme and the key word, similarity grading is carried out on the extended semanteme, semantic weighing is carried out on the extended inquiry statement, text search is carried out on the extended inquiry statement so as to obtain the corresponding inquiry result, and the searched inquiry result is displayed. According to the method, the search recall ratio and the precision ratio of a search engine can be increased in the text search process. The invention further provides a text search system.

The invention provides a system and method of associating results from a query from a user directed to a search engine to advertisements associated with the search engine. In the method, there are the steps of: obtaining advertisement keyword senses associated with the advertisements; disambiguating the query to identify query keyword senses associated with the query; expanding the query keyword senses to include relevant semantic synonyms for the query keyword senses to create a list of expanded query keyword senses; using the expanded keyword senses to search the advertisement keyword senses to locate relevant advertisements correlating to the query; and providing the relevant advertisements to the user. The system incorporates modules conducting steps of the method.

The present invention can include a data processing system-implemented method or a data processing system readable media having software code for carrying out the method. The method can comprise formulating queries, searching for a plurality of information objects, or a combination thereof. In a specific embodiment, an original query with at least one keyword can be automatically expanded to an expanded query that includes at least one keyword that is not in the original query. The expanded query may be used to search for information objects that are relevant to the expanded query.

The invention relates to a microblog-oriented emotion entity searching system. The emotion entity searching system comprises a user interface (1), a query expansion module (2), a query processing module (3), an emotive information mining module (4), an emotive information judging and index building module (5) and a reverse index building module (6). The user interface (1) is used for interaction between a user and the system, and the user can submit a query request through the user interface and obtain a feedback result; the query expansion module (2) is used for carrying out word relation mining on microblog corpus data and building a weighting word relation graph in combination with a WordNet ontology base; the query processing module (3) is used for converting the query request of the user into query key words or query statements and for carrying out query expansion on the basis of the word relation graph built by the query expansion module (2), wherein the query key words or the query statements can be accepted by an index base; the emotive information mining module (4) is used for performing emotion mining on the microblog corpus base and generating a judging rule for emotion entities and emotion polarities; the emotive information judging and index building module (5) is used for judging the emotion entities and emotion polarities, building an emotive information index and storing the emotive information index; the reverse index building module (6) is used for building a reverse index for microblog text information and storing the reverse index. The microblog-oriented emotion entity searching system solves the problems that difficulty exists in microblog emotion entity extraction, emotion polarity analysis, emotion entity search and the like, and a novel intelligent searching product is provided for analyzing and monitoring social networking public opinions.

The invention discloses an expansion query method, a device and a search engine system containing the device, which can solve the problems that the natures of relevant query words provided by the existing search engine are same possibly, so the searched results by using the query words are similar and whether more information in a wider range can be searched or not is uncertain. The method comprises following steps: statistics of co-occurrence words with the query words is carried out; all the co-occurrence words are classified; a characteristic word is selected for each type; the characteristic words of various types are taken as the relevant query words of the query words. Compared with the prior art, the invention provides the multi-type query for a user, the natures of various query words are different, thus being capable of querying the more information in the wider range. The expansion query method guides the user to use better words to carry out the retrieval, thus being capable of obtaining better retrieval effect; the quiddity of guiding the user is to carry out the speculation of the query purpose of the user and further carry out the division, thus obtaining better effect.

A system and method for searching data, such as, text data, using a processing component. A query including one or more terms may be received. At least one term may be automatically added to the query to generate an expanded query set. Entries from one or more information sources, such as, Internet posts, may be retrieved. The retrieved entries may include terms that match terms in the expanded query set. The relevancy of each retrieved entry to the query may be automatically determined. A search result may be provided including a subset of the retrieved entries that are determined to have sufficient relevancy to the query. An output device may display the search result to a client or user.