Abstract: The disclosure provides a role labeling method. The method includes: obtaining a dialogue sentence to be labeled and context information corresponding to the dialogue sentence, and splicing the context information and the dialogue sentence to obtain a spliced text; extracting location information of a role name of the dialogue sentence in the spliced text from the spliced text; determining a first candidate role name of the dialogue sentence based on the location information; determining a second candidate role name of the dialogue sentence from role names in the spliced text; and determining a target role name of the dialogue sentence based on the first candidate role name and the second candidate role name, and performing role labeling on the dialogue sentence based on the target role name.

Abstract: Receiving a first model associated with a user, a generic model of a generic domain, and a specific domain having an associated domain-specific corpus. A first set of query terms based on elements of the first model, and a second set of query terms based on elements of the generic model, are determined. A third set of query terms is generated based on the first and second sets of query terms. The domain specific corpus is queried using the third set of query terms, and a domain specific model is generated based on results of the querying.

Abstract: Among other things, in an aspect, a method includes receiving an indication of a condition at a first component of a computer system. The method also includes performing a search of one or more archives that identifies, among artifacts of at least one of the archives, information relevant to the condition. The method also includes displaying, in a user interface, information determined based on at least one of the artifacts in association with a visual representation indication of the condition.

Abstract: Provided is a process of refining Boolean queries, the process including: obtaining a query; searching a corpus of documents based on the query; selecting narrowing terms that pertain to respective subsets of the responsive documents; selecting broadening terms related to the query; instructing the user's computing device to present a graphical user interface comprising: graphical representations of the narrowing terms; graphical representations of the broadening terms; and one or more user inputs by which the user refines the query by adding a selected narrowing term or a selected broadening term; obtaining a user selection of a broadening term or a narrowing term; forming a refined query based on the user selection; searching at least part of the corpus based on the refined query to identify refined responsive documents; and instructing the user's computing device to present an updated graphical user interface with information about the refined responsive documents.

Abstract: Described are techniques for processing collected workload and performance data. Components of a component category are selected, filtering criteria is specified, the filtering criteria is applied to the collected workload and performance data for the components selected and thereby generating filtered data results, and the filtered results are viewed. The filtering criteria may include a first operation and a first set of one or more metrics included in the collected workload and performance data for the components selected. The first operation may be applied to the first set of one or more metrics and may be selected from a plurality of operations. The plurality of operations may include at least one arithmetic operation, at least one logical operation and at least one relational operation.

Abstract: A method for determining access to a data table store includes determining static properties of data sources during query design, loading the static properties into an unavailability table, at query execution evaluating dynamic properties of the data sources and updating the unavailability table, evaluating a preference expression by a table dispatcher component using session context information from the availability table, determining if a preferred table is available at query execution, and if available indicating to access the preferred table, else applying unavailability rules to obtain repair actions. The preference expression including a user-defined preference between an original table and its replica and user-defined repair actions, where a selection is made at query execution between an original data table and a replicated data table based on the unavailability rules. A non-transitory computer readable medium and a system for implementing the method are also disclosed.

Abstract: A received query is modified by identifying one or more words or phrases in the query that have known associations with stored data upon which the query can be executed, determining whether each of the one or more words or phrases is associated with an attribute name corresponding to stored data, determining whether each of the one or more words or phrases is associated with any constraints regarding an attribute name, determining whether each of the one or more words or phrases is associated with a rule regarding structure or syntax of the query, substituting any determined attribute names into the query for each of the respective associated one or more words or phrases, adding any determined constraints to the query limiting a determined attribute name, and applying any determined rules associated with the one or more words or phrases.

Abstract: A method for determining access to a data table store includes determining static properties of data sources during query design, loading the static properties into an unavailability table, at query execution evaluating dynamic properties of the data sources and updating the unavailability table, evaluating a preference expression by a table dispatcher component using session context information from the availability table, determining if a preferred table is available at query execution, and if available indicating to access the preferred table, else applying unavailability rules to obtain repair actions. The preference expression including a user-defined preference between an original table and its replica and user-defined repair actions, where a selection is made at query execution between an original data table and a replicated data table based on the unavailability rules. A non-transitory computer readable medium and a system for implementing the method are also disclosed.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for identifying query refinements from sibling queries. In one aspect, a method includes associating each of a plurality of parent queries with a respective group of one or more child queries for the parent query, identifying one or more candidate sibling queries for a particular child query, selecting one or more final sibling queries for the particular child query from the one or more candidate sibling queries, and associating the final sibling queries with the particular child query as query refinements.

Abstract: Certain example embodiments described herein relate to techniques for introducing semantic concepts into complex event processing (CEP) systems and/or methods. In an event processing system, for example, an event bus is configured to receive a stream of events, each having a predefined event type. An event processing agent is configured to execute predefined queries on the events, with each query conforming to a query language, and with the query language being enhanced via a semantic extension corresponding to an ontology. An ontology management component in communication with the event processing agent stores mappings (optionally specified at design time) between concepts of the query language and concepts of the ontology that enhances the query language.

Abstract: A computer-implemented method, system, and article of manufacture for querying and integrating structured and unstructured data. The method includes: receiving entity information that is extracted from a first set of unstructured data using an open domain information extraction system, wherein the entity information comprises relationship information between a first entity and a second entity of the first set of unstructured data; recognizing a pattern based on the relationship information and creating a schema for the first set of unstructured data based on the pattern; and associating an element of the created schema with (i) an entity of a second set of unstructured data or (ii) a schema element of an existing set of structured data if there is sufficient overall similarity between the created schema element and either the second unstructured data entity or the schema element of the existing structured data.

Abstract: Redirection (“biasing”) architecture that automates the selection of topical terms in a search query, and provides a user-selectable (e.g., clickable) interface which enables the user to quickly and easily re-formulate and execute a new query using terms that return more focused search results. The redirection of search by biasing the terms (strings) can also be performed by indicating that certain results are not interesting to the user. For example, one way using an existing search engine, is to apply a search operator (e.g., a hyphen) to indicate that certain terms must not occur in the search results (negation). Accordingly, by automatically selecting topical terms to negate, constructing a query, and embedding the negation in a link with each results page result, considerable manual and cognitive effort is saved.

Abstract: Technologies are described herein for locating relevant content items across multiple disparate content sources. Query parameters are received from a user interface for defining a query for searching a number of content sources located on multiple, disparate content servers. A native search is executed on each of the content servers based on the received query parameters, and query statistics and other data regarding content items in the content sources matching the query parameters are received. The query statistics are aggregated across the content servers and presented in the user interface. The presentation of the query statistics may be broken out by each content source, by each query phrase segmented from the query, and the like. In addition, a preview of a number of content items matching the query parameters is presented based on the data received.

Abstract: A dynamic call on dynamic data can be transformed into a dynamic call on a structure representing dynamic data. Specifically, a dynamic query with a code object representation that includes an untyped parameter can be transformed into a dynamic query with a function call with a dynamic meta-object. The function call with the dynamic meta-object tracks operation(s) that correspond to the code object representation that includes an untyped parameter in order to build a structure representing such code object representation. At runtime, the dynamic query is built and the structure representing the code object representation is rebuilt so as to enable a dynamic query with a code object representation that references untyped data.

Abstract: Methods, computer systems, and computer-readable storage media for dynamically correcting misspelled search queries are provided. A portion of a search query is received, and a data store is accessed. It is determined that the portion of the search query is absent from the data store and, thus, comprises a misspelled portion of a search query. Correctly spelled portions of search queries are dynamically determined for the misspelled portion of the search query using a trie data structure, and the misspelled portion of the search query is associated with the correctly spelled portions of search queries. Search suggestions are determined for the correctly spelled portions of search queries and are ranked based on a frequency of use and on a transformation cost of associating the misspelled portion of the search query with the correctly spelled portion of search queries. The ranked search suggestions are provided to a user.

Abstract: The invention relates to a method and system for processing a search request. A search request including a sequence of data strings and representing a plurality of search parameters is received. The strings are parsed and the search request is interpreted so as to define search parameters by recognizing items reflecting search criteria within the sequence of data strings. A query is built based on the result of the preceding process and at least one travel data service can be interrogated. This improves the search for information based on free-text input from the user. Application to methods for travel data service interrogation and to search engines.

Abstract: Data is accessed and updated in a data store at a field granularity. A user query specifies one or more non-unique fields of a record. The query is sent to a data store to retrieve the fields of the record at a field granularity, in satisfaction of the query. The fields of the record can also be modified by transmitting a record ID along with original content, while omitting some of the record data, and by also including the modification to be made.

Abstract: There is provided an image processing apparatus including a search condition information acquiring unit that acquires search condition information that is text information indicating search conditions for searching for search object text structured according to a case structure, a language processing unit that executes language analysis processing with respect to the search condition information, a structure extracting unit that extracts a sentence structure of the search condition information using the language analysis result of the search condition information, a search expression generating unit that generates a search expression reflecting the sentence structure of the search condition information used to search for the search object text according to the sentence structure of the search condition information, and a searching unit that searches for text matching the search conditions from the search object text according to the sentence structure of the search condition information using the generated se

Abstract: Architecture for completing search queries by using artificial intelligence based schemes to infer search intentions of users. Partial queries are completed dynamically in real time. Additionally, search aliasing can also be employed. Custom tuning can be performed based on at least query inputs in the form of text, graffiti, images, handwriting, voice, audio, and video signals. Natural language processing occurs, along with handwriting recognition and slang recognition. The system includes a classifier that receives a partial query as input, accesses a query database based on contents of the query input, and infers an intended search goal from query information stored on the query database. A query formulation engine receives search information associated with the intended search goal and generates a completed formal query for execution.

Abstract: A method for adaptation of a free text query to a customized query. The method comprises selecting at least one resource from a plurality of resources of information for responding to a query received from a user device; performing an analysis of the received query; performing at least one of: customizing the query to meet an input query format of a selected at least one resource, or and providing an input query that is transformed to meet an input requirement of the selected at least one resource; and sending the customized query to the selected at least one resource, wherein each of the selected at least one resource receives an appropriately customized query format.

Abstract: A method of retrieving information from a data source is described. The method includes providing a query sentence in a source language. A stemmed sentence is generated by removing affixes from base words of the query sentence and by removing predetermined words from the query sentence. A translated sentence is generated by translating the stemmed sentence into a target language. The translated sentence is provided to an information retrieval module operable to retrieve information in the target language from the data source based on the translated sentence.

Abstract: The invention provides a method and system for transforming a search query before it is sent to a search engine. The search query, written in a language potentially not mastered correctly by its writer, can comprise typos corresponding to the alphabetic representation of a sound in the writer native language. The search query is first interpreted so as to identify a sequence of phonemes corresponding to its pronunciation by the writer in its native language. The sequence of phonemes is then analyzed so as to determine the corresponding words.

Abstract: Methods and computer-storage media having computer-executable instructions embodied thereon that facilitate reformulating user queries in association with a search box are provided. A user query having a plurality of terms is received and a determination is made that the received user query satisfies a threshold. Based on the received user query, a first set of reformulated user queries is determined. The first set of reformulated user queries includes a plurality of member queries. The plurality of member queries may include one or more suggested query term alterations and/or one or more suggested query term deletions. The member queries may be categorized into groups and/or ranked prior to presentation to a user. A selection option may also be presented for a user to input additional query terms.

Abstract: A method, system and controller is provided for searching a database containing data items with a user via a user inter the method comprising the steps of specifying an initial search subset of some or all of the data items in the database (1201); identifying representatives of each of a number of data categories in the search subset (1203); displaying the representatives on the user interface (1204); selecting one or more of the representatives (1205); specifying a refined search subset of data items in the search subset within the data categories corresponding to the selected representatives (1207); and repeating the steps of identifying and displaying representatives for the refined search subset.

Abstract: A searching device including a data storage unit that stores a plurality of pieces of data, each of which prescribes search terms respectively corresponding to a plurality of attributes of the piece of data; a character input unit that is configured to input characters that constitute an input search term one by one; and an attribute specifying screen display unit that, when a next character is input subsequently to a input character that has been input by the character input unit, displays an attribute specifying screen, including a corresponding attribute corresponding to at least one candidate of the input search term to be extracted from among the search terms by inputting the next character, configured such that the corresponding attribute is specified by a user.

Abstract: The present invention relates to a method and apparatus for assembling a set of documents related to a triggering item. One embodiment of a method for assembling a set of electronic documents related to an electronic triggering item detected by a computing device being operated by a user includes automatically extracting by the computing device a set of features from the triggering item, without receiving a request by the user to assemble the set of electronic documents, and assembling as the set of electronic documents a plurality of documents that is relevant to the set of features, wherein the plurality of documents is retrieved from a plurality of different types of electronic sources.

Abstract: The present invention provides a method and a system of providing assistance to a user to identify at least one context while forming a search query. In one embodiment, this is accomplished by receiving one or more inputs related to the search query, and providing a plurality of contexts related to the received input, wherein the contexts include one or more topics, and wherein the topics are part of one or more ontologies.

Abstract: A system includes a document corpus containing structured documents, which contain both text and annotations of the text. The system also includes a search engine which is adapted to perform structured searches of the structured documents. As new types of annotations are added to the system, the search engine is updated automatically to become capable of performing structured searches for the new types of annotations. For example, if a new natural language processing (NLP) component, adapted to generate annotations of a new type, is added to the system, then the system automatically updates a query language to include a definition of the new type of annotation. The search engine may then immediately be capable of processing structured queries which refer to the new type of annotation.

Abstract: Embodiments are directed to defining a query expression over a dynamic system model and to transforming a dynamically built query expression into a simplified, canonical form. A computer system receives various user inputs that are to be included as part of a query expression for querying a dynamic system model. The dynamic system model is queryable to determine features provided by a service hosted by a back-end server. The computer system dynamically builds the query expression based on both the received inputs and the available features provided by the service as indicated by the dynamic system model. The query expression also includes metadata structures representing those features of the service which are provided by the service. The computer system also queries across the dynamic system model using the dynamically built query expression to retrieve and provide the service features requested in the received user input.

Abstract: This invention is related to an object sharing and search system (OS3) that allows users to create and share computational content of any sort in a multi-user computing environment. It considers user, domain and document as three basic and interacting classes of objects, and allows users to create domain hierarchies, to create objects within a domain, to specify the accessibility of an object in a domain, etc., and it controls the access of an object by another object in a domain. It also allows users to search objects in a domain and recommend the ranking for a search.

Abstract: According to certain embodiments, a search query for a search of samples of sensor data is received. The search query indicates one or more requested values of one or more data parameters. The samples are represented by a characteristic function indicating whether a given binary representation represents a sample. A query function representing the one or more requested values is formulated. The query function and the characteristic function are used to identify one or more samples that have the one or more requested values.

Abstract: Some aspects include reception of an indication of an extension field added to a node of a business object object model, and modification of a schema of a search engine index based on the extension field and before receiving an instruction to add the extension field to a search view.

Abstract: A method in a computer system for retrieving data from one of multiple copies of the data is provided, referred to as the data management system. The data management system receives a request identifying at least one data object to be accessed. Then, the data management system queries a metabase to locate data copies that contain the identified at least one data object, wherein the data copies are created from similar source data, and wherein for each data copy the metabase contains an indication of the availability of the copy relative to other copies. Next, the data management system determines one of the located data copies to use to access the identified at least one data object, wherein the determination is made based on the indicated availability contained in the metabase for each of the located data copies. Then, the data management system accesses the identified at least one data object using the determined one of the located data copies.

Abstract: The present disclosure includes systems and techniques relating to enterprise application integration. In general, one aspect of the subject matter described in this specification can be embodied in a computer system including a service oriented architecture (SOA), where the system includes a composite application configured to present sales targeted information by combining services from multiple application resources on a network, wherein the multiple application resources include: a sales force automation (SFA) tool configured to automate sales and sales force management functions; a real-time predictive analytics tool configured to evaluate customer purchasing data and recommend products or services based on the customer purchasing data; a knowledge management tool configured to search and retrieve data across multiple integrated applications; and a calendar tool configured to manage appointment scheduling.

Abstract: Concepts are presented related to a search engine query. Users can subsequently navigate search results and/or reformulate a query at a conceptual level. In one instance, users can specify weight with respect to one or more concepts to capture interest or lack of interest with respect to search intent. Based on one or more weights, a search query can be modified and results presented to a user along with associated concepts to enable continued interaction. Additionally or alternatively, organization and/or presentation of search results as well as advertisements can be influenced by user-specified weights or other interactions with concepts.

Abstract: A system and method for guiding a user in building a query are disclosed. The method includes providing an interaction space in which a user formulates a query using a plurality of query building blocks selected from a predefined set of query building blocks. The user's formulation of the query is guided. Guiding selection of at least a next building block is provided by at least one of a content-based mechanism which limits the selection of the next building block to those which will yield at least one result from an indexed collection of documents, a structure-based selection mechanism which limits the selection of the next building block to those which meet a predefined grammar, and a usage-based selection mechanism which proposes a next building block based on patterns of building blocks used in building prior queries. Each of these guidance mechanisms may be provided with the result that the next block proposed is informed by each of the mechanisms.

Abstract: A system determines whether a received search query includes an entity name, determines whether to rewrite the received search query based on information relating to prior searches involving the entity name, and rewrites the received search query when it is determined that the received search query should be rewritten. The system further determines whether to provide a suggestion of rewriting the received search query, as a rewriting suggestion, based on information relating to prior searches involving the entity name when it is determined that the received search query should not be rewritten. The system also generates the rewriting suggestion when it is determined that the rewriting suggestion should be provided. The system performs a search based on one of the received search query and the rewritten search query to obtain search results, presents the search results, and presents the rewriting suggestion when it is determined that the rewriting suggestion should be provided.

Abstract: A method for modeling a process includes receiving a plurality of graphs representing processes wherein for each graph. A sequence of process steps of the processes are represented as nodes and edges connecting pairs of nodes represent transitions between process steps. A numeric value representative of graph appearance for each of the plurality of received graphs is calculated. Each of the plurality of received graphs is stored within a tree-like data structure according to its corresponding numeric value. Each of the above steps is performed using a computer system.

Abstract: A data search and retrieval system that, in response to a search query, applies a model to search results to generate information to be returned to a user. A user may modify the model via a set of controls displayed to the user. The modified model may then be applied to search results to generate information in compliance with the modified model. Modified models may be stored locally on a client system or stored in the search system and made available to other users so that the modified models can be applied to subsequent requests for information. The modified models and the results of a search may be stored on a client machine such that, as the model is modified, new information may be generated based on the original search, reducing communication bandwidth, which can improve the speed and cost of providing user interaction with data in a mobile environment.

Abstract: Embodiments of the invention provide data management solutions that go beyond the traditional warehousing system to support advanced analytics. Furthermore, embodiments of the invention relate to systems and methods for extracting data from an existing data warehouse, storing the extracted data in a reusable (intermediate) form using data parallel and compute parallel techniques over cloud, query processing over the data with/without compute parallel techniques, and providing querying using high level querying languages.

Abstract: One particular embodiment accesses a first set of search queries comprising one or more first search queries; extracts one or more features based on the first set of search queries, trains a search-query classifier using the features; accesses a second search query provided by a user; determines whether the second search query has implicit and general local intent using the search-query classifier; if the second search query has implicit and general local intent, then determines a location associated with the user; and identifies a search result in response to the second search query based at least in part on the location associated with the user; and presents the search result to the user.

Abstract: A method in a computer system for retrieving data from one of multiple copies of the data is provided, referred to as the data management system. The data management system receives a request identifying at least one data object to be accessed. Then, the data management system queries a metabase to locate data copies that contain the identified at least one data object, wherein the data copies are created from similar source data, and wherein for each data copy the metabase contains an indication of the availability of the copy relative to other copies. Next, the data management system determines one of the located data copies to use to access the identified at least one data object, wherein the determination is made based on the indicated availability contained in the metabase for each of the located data copies. Then, the data management system accesses the identified at least one data object using the determined one of the located data copies.

Abstract: Disclosed are systems and methods for extracting data from a report document for analysis. A report document is retrieved from a group of report documents. Data present in the report document may include fields and associated metadata. The fields and the associated metadata present in the report are categorized as corresponding data source parameters. The data source parameters are rendered on a user interface, to receive a user definition of a scope for analyzing the data present in the report document. The data source parameters associated with the user definition are qualified to rendered result objects for each associated data source parameter. Based upon the result objects, a query is generated to define the data for analyzing the report document. Based upon a user input to the query, the data present in the report document associated to the query is extracted to generate a multi-dimensional result data.

Abstract: The structuring of data items in a hierarchical structure. A user interface permits a user to define, for each generation of a hierarchical tree, the child characteristics for child data items of particular nodes in the hierarchical tree. Then, a query, or a query template, may be formulated using the child characteristic and the designated parent data item. This may be repeatedly performed to allow for multiple generations of data items to be formed. The query may, at some point, be submitted to identify which data items are child data items or the parent data item. The data items that result from the query (or at least a portion of the data items) may then be assigned as child data items of the parent data item. The query may be postponed until the node is expanded by the user.

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: Helpful query suggestions are obtained by displaying a minivisual with each query suggestion that is developed from a submitted partial query.

Abstract: Data stream query mediation may utilize a query handler configured to receive a query from a stream application to be applied against a stream of data including multiple tuples representing events. A stream window manager may be configured to express the query in a specification which defines a window including a subset of the tuples, the specification defining content of the window as a range of the tuples having a range attribute over which the content is specified, defining when to update the window using a synchronization attribute specifying a movement of the window over time with respect to the content, and defining an evaluation of the content of the window using an evaluation attribute specifying when to perform the evaluation. A query translator may be configured to translate the query including mapping the range attribute, the synchronization attribute, and the evaluation attribute to a stream processing language of a data stream management system (DSMS), to thereby obtain a translated query.

Abstract: A system is provided to detect email spam. During operation, the system receives an email, extracts a set of keywords from the email body, and constructs a first search query based a keyword extracted from the email body. The system further constructs a second search query based on the keyword in the first query and one additional word which pertains to a known spam word or to the subject of the email. Next, the system receives a first number of hits and a second number of hits in response to the first and second search queries, respectively. The system then determines whether the email is spam based on the first number and the second number. The system can also perform Website filtering using inference detection which is based on search results received in response to search queries formulated with keywords extracted from Websites.

Abstract: A bank maintains a financial document in a first storage system when a record date is later than a pre-selected date and in a second storage system when the record date is earlier than or equal to the pre-selected date. The bank receives and inputs a request for the financial document from a client and compares the record date to the pre-selected date to determine if the record date is later than, earlier than, or equal to the pre-selected date. In processing the request, the bank can utilize a computer terminal, connected to the storage systems through a processing unit, to access one of the storage systems in response to the comparison of the record date to the pre-selected date. After accessing the appropriate storage system, the bank retrieves the requested financial document and can then reproduce and distribute the requested financial document.

Abstract: Embodiments of the invention enable users of an abstract database to use logical fields that are relevant to a given model entity. In one embodiment, a user may be presented with a query interface that includes relevant fields, and which may be used to compose abstract queries. In another embodiment, the query interface may include an initial query result, and may include relevant fields for model entities included in the initial query result. The query interface may be configured to enable a user to perform subsequent query operations using the included relevant fields.