Abstract: Systems, methods, and computer-readable storage media are provided for permitting users to search the content of a plurality of apps from a single search query input location. A user inputs a search query and a plurality of apps and/or the content thereof is searched to determine relevancy to the input query. If an app having relevant app content is identified, it may be determined if the app is associated with the querying user. If it is determined that the app is associated with the querying user, the information determined relevant to the input query may be presented to the user. If, it is determined that the app is not associated with the user, the user may be presented with the identity of the app and/or be directed to a location (e.g., an app store) where the user can become associated with the identified app and obtain the desired information.

Abstract: A user is allowed to communicate with a chatbot. A menu is provided to the user that includes a list of actions that can be performed by the user. Whenever natural language input asking a question is received from the user, this input is forwarded to the chatbot, a response to this input is received from the chatbot, this response is provided to the user, and the menu is again provided to the user. Whenever natural language input is received from the user requesting an action that is not one of the actions in the menu, this input is forwarded to the chatbot, a response to this input is received from the chatbot, where this response includes another menu that includes a list of subsequent actions that are related to the requested action and can be performed by the user, and this other menu is provided to the user.

Abstract: A user is allowed to communicate with a chatbot. A menu is provided to the user that includes a list of actions that can be performed by the user. Whenever natural language input asking a question is received from the user, this input is forwarded to the chatbot, a response to this input is received from the chatbot, this response is provided to the user, and the menu is again provided to the user. Whenever natural language input is received from the user requesting an action that is not one of the actions in the menu, this input is forwarded to the chatbot, a response to this input is received from the chatbot, where this response includes another menu that includes a list of subsequent actions that are related to the requested action and can be performed by the user, and this other menu is provided to the user.

Abstract: The insertion and processing of programming language code (e.g., C#) in SQL statements, and the dynamic compiling of the code to detect errors prior to statement execution. The SQL statement with arbitrary programming language code can then be executed concurrently as a query on a computer cluster. External libraries can be imported and the associated functionality leveraged from within a SQL statement. The programming language compiler performs checking at build time, rather than retuning an error during the statement execution against the cluster, a potentially costly proposition in both computing time and human resources.

Abstract: Systems, methods, and computer-readable storage media are provided for reconciling query results associated with multiple indices. A search query having a first spelling is received. A plurality of query results is determined, each query result being derived from one of a plurality of indices. At least a first index is associated with a lexicon that is specific to a user computing device and at least a second index is associated with a lexicon that is specific to web-based content. Each query result may be a query result determined based upon the first spelling for the search query, a suggested alternate spelling for the received search query, a query result determined based upon the suggested alternate spelling for the received search query, or a null result. One or more of the query results then is selected as responsive to the received search query.

Abstract: Systems, methods, and computer-readable storage media are provided for reconciling query results associated with multiple indices. A search query having a first spelling is received. A plurality of query results is determined, each query result being derived from one of a plurality of indices. At least a first index is associated with a lexicon that is specific to a user computing device and at least a second index is associated with a lexicon that is specific to web-based content. Each query result may be a query result determined based upon the first spelling for the search query, a suggested alternate spelling for the received search query, a query result determined based upon the suggested alternate spelling for the received search query, or a null result. One or more of the query results then is selected as responsive to the received search query.

Abstract: Embodiment described herein are directed to an enhanced search engine with multiple feedback loops for providing optimal search results that are responsive a user's search query. The user's search query is parsed, and based on the underlying terms, different linguistic models and refinement techniques generate alternative candidate search queries that may yield better results. Searches are performed for the original search query and the candidate search queries, and different scores are used to select the best search results to present to the user. Results making it onto the list, as well as the underlying candidate search query, linguistic model, or refinement technique for generating that search query, will have their corresponding scores updated to reflect their success of generating a search result. Scores are stored and used by future searches to come up with better results.

Abstract: Systems, methods, and computer-readable storage media are provided for permitting users to search the content of a plurality of apps from a single search query input location. A user inputs a search query and a plurality of apps and/or the content thereof is searched to determine relevancy to the input query. If an app having relevant app content is identified, it may be determined if the app is associated with the querying user. If it is determined that the app is associated with the querying user, the information determined relevant to the input query may be presented to the user. If, it is determined that the app is not associated with the user, the user may be presented with the identity of the app and/or be directed to a location (e.g., an app store) where the user can become associated with the identified app and obtain the desired information.

Abstract: Methods are provided for re-ranking documents based on user-specific features. Search results are received from a non-contextual ranking system such that the search results are not specific toward a particular user, such as the user who submitted the search query. Contextual signals are received and provide user-specific features that are used to re-rank documents so that the most important and relevant documents are listed at the top of the list of search results. Each of the user-specific features are evaluated and compared to determine a new position of each document. A set of contextual search results is then generated based on the new positions.

Abstract: Embodiment described herein are directed to an enhanced search engine with multiple feedback loops for providing optimal search results that are responsive a user's search query. The user's search query is parsed, and based on the underlying terms, different linguistic models and refinement techniques generate alternative candidate search queries that may yield better results. Searches are performed for the original search query and the candidate search queries, and different scores are used to select the best search results to present to the user. Results making it onto the list, as well as the underlying candidate search query, linguistic model, or refinement technique for generating that search query, will have their corresponding scores updated to reflect their success of generating a search result. Scores are stored and used by future searches to come up with better results.

Abstract: Systems and methods for presenting search results ordered, at least in part, based upon indicated user preferences are provided. User preferences for one potential search result over another that are free of position bias are obtained utilizing random relative order interchange of juxtaposed, ranked search results. Upon receipt of a search query, a determination is made to present at least a portion of search results satisfying the received query ordered based on user preferences, whether or not the order coincides with that determined using a ranking algorithm. In this way, presented search results are ordered, at least in part, according to user preferences, thus improving the relevance of the output relative to standard ranking algorithms alone.

Abstract: Methods are provided for re-ranking documents based on user-specific features. Search results are received from a non-contextual ranking system such that the search results are not specific toward a particular user, such as the user who submitted the search query. Contextual signals are received and provide user-specific features that are used to re-rank documents so that the most important and relevant documents are listed at the top of the list of search results. Each of the user-specific features are evaluated and compared to determine a new position of each document. A set of contextual search results is then generated based on the new positions.

Abstract: Core commands and aggregations of such commands are provided to programmers to enable them to generate programs that can be parallel-processed without requiring the programmer to be aware of parallel-processing techniques. The core commands and aggregations abstract mechanisms that can be executed in parallel, enabling the programmer to focus on higher-level concepts. The core commands provided include commands for applying a function in parallel and distributing and joining data in parallel. The output of each core command can implement an interface that can enable underlying mechanisms to stitch together multiple core commands in a cohesive manner to perform more complex actions.

Abstract: Systems, methods, computer-readable media, and graphical user interfaces for presenting search results having collapsed domains are provided. A search result obtaining module obtains search results based upon a received query. Upon obtaining the search results, search results having the same domain are associated with one another. Thereafter, search result clusters of associated search results are formed. In some embodiments, the search result clusters may be formatted to include desired search result cluster attributes. The search result clusters are presented such that two or more associated search results form a single cluster of search results rather than being presented individually. In some embodiments, an option to view more search results with the same domain may be provided.

Abstract: A system and methods of language identification of natural language text are presented. The system includes stored expected character counts and variances for a list of characters found in a natural language. Expected character counts and variances are stored for multiple languages to be considered during language identification. At run-time, one or more languages are identified for a text sample based on comparing actual and expected character counts. The present methods can be combined with upstream analyzing of Unicode ranges for characters in the text sample to limit the number of languages considered. Further, n-gram methods can be used in downstream processing to select the most probable language from among the languages identified by the present system and methods.

Abstract: A task framework and a semantic reasoning engine are combined to provide a scalable mechanism for dealing with extremely large numbers of widgets, allowing users to both find a widget and automatically fill-in whatever functionality is available on the widget. Calling applications are employed to obtain task information from each widget. The calling application also receives user queries that can be resolved by a widget. A task reasoning process based on an adaptive semantic reasoning engine utilizes the task information to select a widget best suited to respond to a user's query. The task reasoning process can also be employed to determine “best-guess” slot filling of the selected widget. The calling application can then invoke the selected widget and, if available, fill appropriate slots with information to facilitate user interaction with the selected widget. Instances can be client- and/or server-side based.

Abstract: A task system and method are provided. The system provides an automated approach for task creation, maintenance and/or execution. The system includes a browser that receives search results and at least one task associated with a query from a search engine. The system further includes a browser helper object that binds to the browser at runtime. The browser helper object provides information associated with a user's action with respect to the search results and/or at least one task. The information can be employed as feedback to update model(s) (e.g., query classification model(s) and/or slot-filling model(s)) of a semantic reasoning component that retrieves task based, at least in part, upon user query(ies).

Abstract: Scripting core commands and aggregations of such commands are provided to script authors to enable them to generate scripts that can be parallel-processed without requiring the author to be aware of parallel-processing techniques. The scripting core commands and aggregations abstract mechanisms that can be executed in parallel, enabling the script author to focus on higher-level concepts. The scripting core commands provided include commands for applying a function in parallel and distributing and joining data in parallel. For added flexibility, one or more scripting core commands can utilize functions written in a different programming language and referenced appropriately in code blocks.

Abstract: Structured queries, such as those written using the Structured Query Language (SQL) can be an efficient mechanism for expressing the information sought to be obtained from a collection of data. Mechanisms can enable the use of structured queries to express data processing that can be performed in parallel in order to obtain the attendant efficiencies of such processing. The structured queries, whether standing alone or integrated into another programming context, can be translated into an intermediate form that can be compatible with, or equivalent to, the programming context into which they were integrated or some other high-level programming language. The intermediate, translated form can use core commands that abstract mechanisms that can be executed in parallel. The core commands include commands for applying a function in parallel and distributing and joining data in parallel, and also include aggregations of core commands directed to commonly performed functions.

Abstract: A spell checking system includes a letter spelling engine. The letter spelling engine is configured to select a plurality of candidate letter target strings that closely match a misspelled source string. The spell checking system includes a phoneme spelling engine. The phoneme spelling engine is configured to select a plurality of candidate phoneme target strings that closely match the misspelled source string. A ranker module is configured to combine the candidate letter target strings and the candidate phoneme target strings into a combined list of candidate target strings. The ranker module is also configured to rank the list of candidate target strings to provide a list of best candidate target strings for the misspelled source string.