Abstract: A particular method of content personalization based on user information includes receiving data representing an information retrieval task. The data is received at a server from a computing device associated with a user. The information retrieval task is executed to generate result information. Personalization information associated with the user that is relevant to the information retrieval task is retrieved. The personalization information associated with the user includes information associated with at least one of a genotype of the user and a phenotype of the user. The method includes modifying the result information based on the retrieved personalization information to generate personalized result information.

Abstract: Architecture that provides the capability to identify which parts (terms and phrases) of a voice query have been covered by predefined phrase templates, and then to concatenate matching phrase templates into a new paraphrased query. A match-drop-continue algorithm is disclosed that progressively masks out the portions (phrases, terms) of the query matched to the phrase templates. Ultimately, the matched phrase templates are accumulated and organized together dynamically into a rephrased version of the original voice query. A user interface is provided that allows the user to confirm/summarize the multiple concepts in a progressive manner.

Abstract: A user submits an unstructured query that is analyzed to determine a mapping from attributes to attribute values. One or more matching items from a structured data set are determined based on the attribute values of attributes associated with the items. The matching items are displayed. One or more refinement attributes are displayed, each with one or more attribute values. The attribute values in the refinements that correspond to the attribute values of the query are shown as selected. If the user selects any of the refinement attributes, the query is revised to incorporate the attribute values of the selected refinements. New matching items are determined using the revised structured query. The revised structured query and the new matching items are displayed. This process can be iterated, by modification of the query or the refinements. The matching items, the selected refinement attribute values and the query are synchronized.

Abstract: A data scheme and protocol (DSP) adapter which translates communications received from one or more application servers (FEs) into corresponding communications understandable by one or more repositories (BEs). The DSP adapter comprises an interface unit which receives a FE query from a FE. The DSP adapter comprises a processing unit which determines an FE query pattern fulfilled by the FE query and checks whether the FE query pattern exists for the FE query in an accessible memory. Where the FE query pattern does not exist in the accessible memory, the processing unit transforms the FE query pattern into a corresponding BE query pattern. Where the FE query pattern exists in the accessible memory, the processing unit obtains the corresponding BE query pattern from the accessible memory. A method for translating at a data scheme and protocol (DSP) adapter communications received from one or more application servers (FEs) into corresponding communications understandable by one or more repositories (BEs).

Abstract: A business intelligence (BI) server and repository are described which support a set of customized and/or calculated data members. In accordance with an embodiment, the BI server maintains a connection to a plurality of data sources which may store a set of dimension members. The data source can be relational, file storage based, multidimensional and other types. In accordance with an embodiment, the BI server can accept queries from the user that contain calculated members as a parameter. The calculated member is defined by an expression including multiple dimension members and one or more arithmetic operators. The BI server can parse and validate the query and rewrite the query for the data source. After the query is rewritten and optimized, it is executed against the data source and a set of results is received.

Abstract: A method and system for automatically refining information extraction (IE) rules. A provenance graph for IE rules on a set of test documents is determined. The provenance graph indicates a sequence of evaluations of the IE rules that generates an output of each operator of the IE rules. Based on the provenance graph, high-level rule changes (HLCs) of the IE rules are determined. Low-level rule changes (LLCs) of the IE rules are determined to specify how to implement the HLCs. Each LLC specifies changing an operator's structure or inserting a new operator in between two operators. Based on how the LLCs affect the IE rules and previously received correct results of applying the rules on the test documents, a ranked list of the LLCs is determined. The IE rules are refined based on the ranked list.

Abstract: System and methods for dynamically generating taxonomies of keywords and/or descriptors are provided. In one example, a navigation system for accessing a corpus of information provides for dynamic taxonomy generation expanding upon a topic entered by a user in a user interface. The navigation system generates, dynamically, at least one term associated with the received topic from at least one sense or meaning retrieved from a semantic network. The navigation system is further configured to present to the user the at least one term as a selectable refinement in response to receiving the topic entered by the user in the user interface. The system can also be configured to retrieve terms and/or senses from the semantic network and evaluate any retrieved terms for their informativeness. The system can further cache any information generated during taxonomy creation and update the corpus to reflect useful refinements.

Abstract: Query suggestions can be generated by identifying desirable sub-queries. Search engine data can be accumulated to determine usage characteristics for various queries. Potential sub-queries can be generated and ranked based on the usage data. After ranking potential sub-queries, the rankings can be used to select sub-queries when a search request is received. The selected sub-queries can be used directly as query suggestions, or the sub-queries can be used as input for another query suggestion engine.

Abstract: Advertisements are selected for presentation on a search results page based on the presence or absence of user activity within the search results page. When a search results page is provided to an end user, the search results page is tracked for user activity. If user activity is detected, a user context is identified and new advertisements are selected for presentation on the search results page based on the user context. In some embodiments, the search results page provides search results in clusters, and the user context corresponds with a search result cluster selected by an end user. In some embodiments, dominant concepts in the user context are identified and used to select advertisements. Alternatively, if user activity is not detected within a predetermined period of time, new advertisements are selected based on the absence of user activity within the search results page.

Abstract: A process includes receiving an archive of video data comprising a plurality of archive descriptor types, and applying a query to the archive. The query includes a number of N query descriptor types for a query object. The process further includes determining a difference between each query descriptor type and corresponding descriptor types of the archive, and storing each difference as a point in an N dimensional space. The process further includes identifying an archive object that is similar to the query object as a function of proximities of the differences to an origin of the N dimensional space.

Abstract: The present invention extends to methods, systems, and computer program products for composing views with automatic creation of links. Generally, views receive data through a query. Views also can have bindings to variables, for example, to represent what is selected in the view. Analyzing these queries can be used to determine whether a composition is valid, and how to compute a new query for a composed second view. In a composite view, a selection variable is utilized, and is bound to the selection parameter of the new first view. The data query for the second new view is re-written to refer to the selection variable in the composite.

Abstract: A method, apparatus and article of manufacture for providing supplemental video content for third party websites is disclosed. In one embodiment, coded instructions are transmitted from a content enhancement server to a host server, for incorporation into the webpage source code. The host server is controlled by a first entity and the content enhancement server is controlled by a second entity commercially distinct from the first entity. Keywords are generated by execution of the coded instructions in the webpage received in the client computer from the host server, and the keywords are sent to a content enhancement server, which generates supplemental substantive video content information for transmission to the client.

Abstract: A method is provided that includes specifying enabling relationships, which map enabling sets of one or more enabling attribute-value pairs to respective enableable attributes. Responsively to the search query, a current state is designated that comprises current-state attribute-value pairs, and a result set is generated containing some of the items of a corpus. An enableable attribute of one of the enabling relationships is identified as enabled when the current-state attribute-value pairs include all of the enabling attribute-value pairs of the enabling relationship. A populated attribute-value pair is found that comprises the enabled attribute and a value therefor, and which, when added to the search query, results in an extended query that is satisfied by at least one of the items in the corpus. The result set is presented in association with the value of the populated attribute-value pair as a refinement option. Other embodiments are also described.

Abstract: A web-based system scans content for specific terms, and transforms occurrences of the terms into hypertext links. Each hypertext link provides access to a dynamically generated web page which contains aggregated content related to the respective term. The aggregated content may be gathered through a distributed keyword search of various content sources, including web sites and other sources on a wide area network. The results of the keyword search are aggregated into a single page or document, preferably with filtering to remove page elements not well suited for display on a mobile device. Occurrences of specific terms on this dynamically generated page may similarly be transformed into links, such that the user can browse content from various sources within a confined environment.

Abstract: Reusing assets for packaged software application configurations may include defining one or more query criteria based on information associated with a project, querying an asset repository stored in a storage device using the one or more query criteria, receiving a list of one or more assets from the asset repository in response to the querying, and using the one or more assets on the list to compose a document defining deployment procedures associated with deploying a packaged software application.

Abstract: A method and system for managing route resources. After receiving a request for a route from a user, user-specified constraints, route supplier-specified constraints, and weights assigned to the constraints, a dynamic model of available routes is queried to generate proposed routes based on the constraints and weights. The model is updated according to the proposed routes. Current bids on related routes are retrieved. Prices of the proposed routes are determined and presented to the user. The prices are based on the updated model and the current bids on related routes. If no price is acceptable, the user modifies the constraints and a new set of proposed routes is generated. A bid from the user to purchase a selected proposed route is received.

Abstract: An approach is provided for automatic controlled value expansion of information. A value expansion controller detects a request at a device to perform an information operation on a set of data elements of an information space, wherein the request identifies the set by a name and the information operation applies to each data element within the set. The value expansion controller intercepts the request based on the detection and determines the location of the data elements within a communication network based on the name. The value expansion controller retrieves the data elements from the location and populates an expansion table with the retrieved data elements, wherein the expansion table is correlated to the set. The value expansion controller performs the information operation on each data element in the expansion table and causes transmission of one or more results of the information operation to the device.

Abstract: The present invention is directed to a system and method for quickly searching for all irrelevant data items in a data set based on a logical expression of an issue of interest to a user, which describes what the user is searching for. By performing this search, the size of data set that the system needs to search to find relevant documents is significantly reduced. The system is also configured to identify terms that are being used in possibly inconsistent ways with their normally accepted means so that code words can be uncovered. Additionally, the system is configured to search for Trade Terms that are not contained in any Dictionaries. In some embodiments, the system and method of the present invention utilize advanced automated search techniques including highlighting capability and use of query terms for determining subsets of relevant or irrelevant content data (in paper or electronic form).

Abstract: A mechanism is disclosed that dramatically minimizes the time it takes to gather needs, dramatically minimizes the expense it takes to gather those needs, and ensures those statements are formulated in manner that comply with a set of rules designed to ensure the right inputs are used in downstream strategy formulation, marketing, product development, and related company workflows. In addition, the mechanism may or may not minimize the time it takes for a company to acquire the capability to uncover these needs statements.

Abstract: A method and apparatus for processing at least one data stream are disclosed. For example, the method receives at least a join query for the at least one data stream, wherein the join query specifies a lifetime for keeping a tuple as a marker for a beginning of a sequence of interest, and receives a tuple from the at least one data stream. The method marks the tuple as a beginning of a sequence of interest and stores the tuple, if the tuple is the beginning of the sequence of interest. The method applies one or more initial predicates to the tuple, and determines if the tuple matched a marked tuple, if the tuple meets the one or more initial predicates. The method determines if the tuple meets one or more conditions to be outputted, if the tuple meets the one or more initial predicates conditions.

Abstract: A method, system and computer program product are disclosed for searching for information using a knowledge base. In one embodiment, the method comprises receiving a query; formulizing the query, including dividing the query into a plurality of parts; for each of the parts, identifying a source, using the knowledge, that addresses that part; and combining the sources to answer the query. In one embodiment, the query includes text; the text is separated into a plurality of segments; and, for each of the segments, at least one source is identified addressing the segment. In an embodiment, a logical proof is formulated having a conclusion that is an answer to the query, and a sequence of statements that establish said conclusion; and a proof of this conclusion is generated by identifying two or more documents that assert the sequence of statements.

Abstract: A search device includes a partial character string extracting unit for acquiring partial character strings for search from a search query inputted, a partial character string searching unit for acquiring name text candidates and pieces of partial character string appearance position information respectively showing the appearance positions of the partial character strings within the name text candidates according to the partial character strings for search, a candidate counting unit for counting an accumulated score for each name text candidates by providing consistency among the appearance positions in consideration of the pieces of partial character string appearance position information in such a way that the appearance positions do not overlap one another in each name text candidate, a candidate-to-be-presented selecting unit for determining a candidate to be presented according to the accumulated score, and a candidate presentation unit for presenting the candidate to be presented.

Abstract: A query including one or more current search terms is received from a user and executed against a target database. When the query yields a number of results less than a defined search threshold (a.k.a. an “unsuccessful” search), the current search terms are compared with an associations database. The associations database includes associations between search terms in previously-executed queries that yielded less than a threshold number of results and replacement search terms that were substituted to generate a successful query yielding at least the threshold number of results. Upon finding a match between one or more of the search terms and the current search terms, the associations between the search terms and the replacement search terms are used to identify suggested replacement search terms and present them to the user.

Abstract: User profiles are created based on taxonomic nouns related to documents accessed by the user. The profiles can be leveraged to create lists, such as mailing lists and lead lists, to target content, such as offers, to persons most likely to be interested in the content. A database of the profiles is queried based on nouns describing content to be promoted. The profiles that satisfy the query are used to generate a list. The invention can be used to create any type of list, such as mailing lists, lead lists, lists of related content, lists of related users, lists of categorized content, and the like.

Abstract: Aspects of the disclosure provide methods and systems for cross domain discovery. According to the disclosure, an object can include multiple entities defined by an originator. The multiple entities have different scopes corresponding to different access restrictions. Further, the originator defines keywords for each of the multiple entities. A system for cross domain discovery stores the multiple entities in an object service component, and stores the keywords and access restrictions in a search service component. The search service component conducts a search based on the keywords and access restrictions in response to a search request from a user. An entity is provided to the user based on the user's credential and the searching.

Abstract: A computer-implemented system to receive an instruction to initialize a data provider associated with an analysis cube and a dataset, and, in response to the instruction, acquire first metadata associated with the analysis cube and generate, based on the first metadata, second metadata of an abstraction layer comprising a plurality of objects. A query comprising a first plurality of objects of the abstraction layer is received, the query is transformed to a query state based on the second metadata of the abstraction layer, and a result set is acquired from the dataset using the query state and the analysis cube.

Abstract: One embodiment includes a method for correlating external references to a Web Page with conversions performed by one or more visitors to the Web Page. The method includes receiving the Web Page to monitor and determining one or more conversions to correlate. The one or more conversions to correlate include one or more actions performed on the Web Page by a visitor to the Web Page. The method also includes identifying the visitor to the Web Page. The visitor to the Web Page completed at least one action included in the conversions to correlate. The method also includes identifying the at least one action completed by the visitor and identifying an external reference that directed the visitor to the Web Page. The external reference contains a reference to the Web Page.

Abstract: A bioinformatics method, software, database and system for compiling attribute combinations that co-associate with a query attribute (i.e., an attribute of interest) are presented in which expanded attribute profiles associated with a group of query-attribute-positive individuals and expanded attribute profiles associated with a group of query-attribute-negative individuals are accessed, and combinations of attributes having a higher frequency of occurrence in the set of expanded attribute profiles associated with the group of query-attribute-positive individuals are identified and stored to generate a compilation of attribute combinations that co-associate with the query attribute.

Abstract: Generate tags for content from metadata pre-filtered based on context. A plurality of data items is accessed. Each of the data items has metadata. A context for a user is determined (e.g., at a moment of content capture). One or more of the data items are selected based on the determined context. Upon receipt of content, the received content is compared with the selected data items to identify matches. Metadata is selected from the metadata associated with the matching data items. The selected metadata is associated with the captured content.

Abstract: A symbolic query exploration (QEX) module automatically produces output information that can be used to evaluate a database. The QEX module operates by converting an input query into a formula for processing by a satisfiability module theories (SMT) solver module. The SMT solver module generates a model that satisfies the formula. The model yields table information that is used to populate the database and, optionally, parameter information that is used to instantiate the query. A query evaluation module then submits the instantiated query to the populated database and evaluates whether an evaluation result produced thereby agrees with pre-specified condition information. The QEX module can preprocess the formula using either (or both) an eager expansion approach (in which the formula is expanded in an upfront manner) or a lazy expansion approach (in which axioms are identified for later possible expansion by the SMT solver module).

Abstract: The invention relates to data searching and translation. In particular, the invention relates to searching documents from the Internet or databases. Even further, the invention also relates to translating words in documents, WebPages, images or speech from one language to the next. A computer implemented method including at least one computer in accordance with the invention is characterised by the following steps: receiving a search query including at least one search term, deriving at least one synonym for at least one search term, expanding the received search query with the at least one synonym, searching at least one document using the expanded search query, retrieving the search results obtained with the expanded query, ranking the search results based on context of occurrence of at least one search term. The best mode of the invention is considered to be an Internet search engine that delivers better search results.

Abstract: A search technology generates recommendations with minimal user data and participation, and provides better interpretation of user data, such as popularity, thus obtaining breadth and quality in recommendations. It is sensitive to the semantic content of natural language terms and lets users briefly describe the intended recipient (i.e., interests, eccentricities, previously successful gifts). Based on that input, the recommendation software system and method determines the meaning of the entered terms and creatively discover connections to gift recommendations from the vast array of possibilities. The user may then make a selection from these recommendations. The search/recommendation engine allows the user to find gifts through connections that are not limited to previously available information on the Internet. Thus, interests can be connected to buying behavior by relating terms to respective items.

Abstract: A system and method for automatically grouping keywords into a plurality of ad groups. The method includes receiving a list of keywords and calculating a frequency of occurrence associated with each keyword in the list of keywords. The keywords in the list of keywords are automatically grouped into a plurality of ad groups based on at least the frequency of occurrence or a predetermined ad grouping list. The plurality of ad groups are subsequently saved in an uploadable format and exported to an external application.

Abstract: Location-specific content is automatically generated for a particular entity having a plurality of physical locations. Database entries that contain identifying data associated with the particular entity are searched for to obtain location information of each of the plurality of physical locations. The location information, in correlation with one or more keywords associated with the particular entity, is stored in a computer-readable electronic database such that a user-generated query that includes at least one of the keywords and a search location causes a processor to execute operations that initiates a search of the computer-readable electronic database for the location information of the physical locations that are in proximity to the search location. At least one result that is displayable to the user is provided.

Abstract: A user is made able to configure a search query to be responsive to temporal factors in order to adjust the search query to more accurately reflect the user's true information need. By adjusting the search query in this way, the user is more likely to receive satisfactory search results.

Abstract: A document checking apparatus includes a keyword appearance position extracting unit that extracts keywords and the appearance positions of the keywords from a target document including a confidential document; a keyword pair extracting unit that treats each keyword of the appearance positions of the extracted keywords as a target and determines whether there is another extracted keyword within a predetermined range before and after the target keyword; a feature element matrix creating unit that generates, when it is determined that there is the another keyword, combination information obtained by combining the determination target keyword and the another keyword in association with anteroposterior information of the appearance positions of the keywords; and a computing unit that determines whether the number of combination information, among the plurality of combination information of the generated target document, identical to the combination information of the confidential document is not less than a prede

Abstract: Methods, articles of manufacture and systems are provided for simplifying a query building process by limiting the number of fields presented to a user for building queries. The number of fields presented to the user may be limited by hiding one or more logical fields from the user based on usage characteristics. For example, a logical field that is rarely used or has not been used within a predetermined period of time may be hidden from the user. For some embodiments, a fallout manager may monitor the use of logical fields in building queries, update usage characteristics, and mark logical fields as hidden based on the usage characteristics. A graphical user interface may not present to a user logical fields that have been marked as hidden.

Abstract: A method and apparatus for resolving conjunctive queries, comprising relational predicates and external predicates, such as XML predicates. The method and apparatus obtain results from a relational engine or from an external engine, and then use the obtained results as input for the other engine, so as to optimize the activity of the other engine. The process may repeat further times, with the results obtained by the other engine being input to the first engine. The method and apparatus further disclose handling value, being isomorphic hierarchical subtrees.

Abstract: A system and methods for optimizing search objects submitted to a data resource is provided. These techniques are advantageous in reviewing vast collections of content data or documents to identify relevant data or documents from the collections. The advanced search techniques are based on query terms, which isolate relevant content data that respond to the query terms.

Abstract: Methods and systems are provided for creating an adaptive thesaurus. A term pair including an index term and an expansion term is received. A recall gain, an expansion independence, and a semantic similarity of the term pair are calculated using a processor. Whether to store the term pair is determined based on the recall gain, the expansion independence, and the semantic similarity. The term pair is stored based on the determination. Methods and systems are provided for searching using an adaptive thesaurus. A search query including a query term is received. An expansion term stored in association with an index term matching the query term in the adaptive thesaurus is retrieved. Using a processor, the search query is expanded using the expansion term based on a recall gain, an expansion independence, and a semantic similarity.

Abstract: An advertisement management system, a computer-implemented method, and computer readable media to select advertisements are provided. The advertisement management system includes a keyword component, a targeting component, and a merging component. The keyword component generates a lists of advertisements based on keywords provided by the advertisers. The targeting component, executing in parallel with the keyword component, generates another list of advertisements based on targeting data provided by the advertisers. The merging component combines the list of advertisements generated by the keyword component and targeting component based on relevance to user search terms received by the advertisement management system or revenue that the advertisement is able to generate for the advertiser, publisher, or advertisement management system.

Abstract: A semantic service discovery technology is provided. A semantic service discovery method includes: receiving a query for a service discovery from a user equipment (UE); analyzing the received query; conducting an ontology-based analysis of semantic information of the analyzed query; and generating a query for the service discovery by putting the analyzed semantic information together, converting the generated query into an ontology query, and discovering services using the ontology query. Therefore, a service desired by a user can be discovered through a semantic approach.

Abstract: A system and method are disclosed to detect keywords in media content. The system and method include sending a stream of media content to a media receiver, scanning the stream of media content to locate at least one keyword within the stream of media content, and providing a search result to be displayed concurrently with the media content. The search result contains results of a search using the identified keyword.

Abstract: A method of providing a moving picture search service and an apparatus therefor are disclosed. An embodiment of the present invention provides a method of providing a moving picture search service that includes: obtaining a search keyword from a client terminal; and providing as search results a moving picture cluster list displaying information about a moving picture cluster matching with the search keyword. The moving picture cluster includes a plurality of moving pictures determined to have identity, and the moving picture cluster list includes a cluster unit display area displaying information about the moving picture cluster differently from information about another moving picture cluster included in the moving picture cluster list. By providing moving picture search results related to a search keyword in groups of cluster units, users can understand the search results more easily.

Abstract: Techniques are provided for modifying queries to increase the number of sponsored links that are returned in response to the queries. A query modification system uses a predefined set of rules that are designated to modify a query to increase the chance that the modified query will match more sponsored links. The modified query is then matched against a listing of search query strings that have been pre-selected by sponsors. Each pre-selected search query strings corresponds to one or more sponsored web links. If the modified query matches one of the pre-selected search query strings, the corresponding sponsored web links are returned and displayed to the user.

Abstract: A character folder generator generates one or more character folders, each of which corresponds to a specific character, at each layer of a hierarchical folder structure, and provides a terminal with information of said one or more character folders generated at each layer. A folder ID obtainer obtains identification information of the selected character folders from the terminal, when one of the character folders at each layer is selected at the terminal. A character sequence generator generates a character sequence identified based on a sequence of the character folders, each of which has been selected at each layer. A searcher searches for files by using as a keyword the generated character sequence and generates one or more files retrieved by search in the character folder finally selected at a certain layer and providing the terminal with information of the generated files in the finally selected character folder.

Abstract: A logical table definition is received in association with a database query within a distributed database system. A determination is made as to whether the received logical table definition matches a local logical table definition. The query is processed in response to determining that the received logical table definition matches the local logical table definition. The query is forwarded to at least one other distributed database node. This abstract is not to be considered limiting, since other embodiments may deviate from the features described in this abstract.

Abstract: A communication system includes: a communication device; and a data receiver that is configured so as to be capable of being connected to the communication device. The communication device includes: a content summary receiving unit that is configured so as to be capable of receiving content summary data transmitted from an external device, the content summary data including at least positional data and title data for content data; and a positional data transmitting unit. The data receiver includes a scheduled port querying unit that is configured to transmit to the communication device a query querying the communication device for a scheduled port. The communication device further includes: a scheduled port notifying unit that, upon receiving the scheduled port query from the data receiver, transmits to the data receiver a scheduled port notification indicating the scheduled port.

Abstract: A recommended information presentation apparatus, including a display unit which displays text data, an extraction unit which extracts keyword candidates from the text data, a storage unit which stores semantic attributes of the keyword candidates, semantic attribute rules which contain scoring criteria for semantic attributes, descriptive phrases describing the keyword candidates and descriptive phrase rules which contain scoring criteria for descriptive phrases. The scores of the keyword candidates are calculated by a selection unit based on the semantic attribute rules and descriptive phrase rules and the highest scoring keyword candidates are selected as keywords. The selected keyword is used to search an information database by a search unit which also receives the search results which are displayed on the display unit by a control unit as recommended information with regards to the text information.

Abstract: A query expansion method that improves the precision without degrading the recall, uses augmented terms. The method steps expand an initial query by adding new terms that are related to each term of the initial query. The query is further expanded by adding augmented terms, which are conjunctions of the terms. A weight is assigned to each term so that the augmented terms have higher weights than the other terms.