patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|---|---|---|
9,170,821 | 1 | 2 | 1. A non-transitory computer-readable medium embodying a program executable in a computing device, the program comprising: code that acquires a test document associated with a workflow definition in response to receiving the workflow definition comprising a plurality of possible paths of execution, individual ones of the plurality of possible paths of execution comprising a sequence of a plurality of actions, the test document comprising a programmatic input source configured to provide an input for at least one of the plurality of actions of the workflow definition and an expected state for the workflow definition based at least on the input; code that places a workflow instance in a queue accessible to a workflow engine in the computing device, the workflow instance being an instance of the workflow definition; code that provides the input from the programmatic input source for the at least one of the plurality of actions of the workflow instance to the workflow engine managing the workflow instance, the at least one of the plurality of actions determined based at least in part upon a present state of the workflow instance and being performed by a remote application, the remote application interfacing with the workflow engine and returning a result, the input being determined upon execution of the at least one of the plurality of actions of the workflow instance; code that generates a comparison of a next state of the workflow instance to the expected state of the test document in response to receiving the next state of the workflow instance, the next state being based at least in part upon the present state, the at least one of the plurality of actions, the input, and the result, wherein the comparison comprises the result of the remote application; and code that restarts the workflow instance at a beginning of the workflow instance based at least in part on a difference in the comparison. | 1. A non-transitory computer-readable medium embodying a program executable in a computing device, the program comprising: code that acquires a test document associated with a workflow definition in response to receiving the workflow definition comprising a plurality of possible paths of execution, individual ones of the plurality of possible paths of execution comprising a sequence of a plurality of actions, the test document comprising a programmatic input source configured to provide an input for at least one of the plurality of actions of the workflow definition and an expected state for the workflow definition based at least on the input; code that places a workflow instance in a queue accessible to a workflow engine in the computing device, the workflow instance being an instance of the workflow definition; code that provides the input from the programmatic input source for the at least one of the plurality of actions of the workflow instance to the workflow engine managing the workflow instance, the at least one of the plurality of actions determined based at least in part upon a present state of the workflow instance and being performed by a remote application, the remote application interfacing with the workflow engine and returning a result, the input being determined upon execution of the at least one of the plurality of actions of the workflow instance; code that generates a comparison of a next state of the workflow instance to the expected state of the test document in response to receiving the next state of the workflow instance, the next state being based at least in part upon the present state, the at least one of the plurality of actions, the input, and the result, wherein the comparison comprises the result of the remote application; and code that restarts the workflow instance at a beginning of the workflow instance based at least in part on a difference in the comparison. 2. The non-transitory computer-readable medium of claim 1 , further comprising code that provides an initial state of the workflow instance, the test document further comprising the initial state. | 0.804781 |
7,941,438 | 7 | 8 | 7. The process of claim 3 further comprising the steps: controlling a computer to display diagrams and textual interactive dialogs and process and store data entered using said diagrams and textual interactive dialogs so as to perform the functions recited herein, said diagrams and textual interactive dialogs being tools which a designer of said computer program uses to enter requirements data that defines the desired structure and behavior and user interface of said computer program using object-oriented modeling techniques to avoid the complexity of purely textual formal methods; automatically converting said requirements data entered using said diagrams and textual interactive dialogs into formal language elements as each piece of requirements data is entered and storing said formal language elements as said Formal Specification written in an object-oriented formal specification language having rules of syntax and semantics that define a grammar for said formal language; controlling a computer to use said rules of syntax and semantics to validate said Formal Specification to generate said validated Formal Specification. | 7. The process of claim 3 further comprising the steps: controlling a computer to display diagrams and textual interactive dialogs and process and store data entered using said diagrams and textual interactive dialogs so as to perform the functions recited herein, said diagrams and textual interactive dialogs being tools which a designer of said computer program uses to enter requirements data that defines the desired structure and behavior and user interface of said computer program using object-oriented modeling techniques to avoid the complexity of purely textual formal methods; automatically converting said requirements data entered using said diagrams and textual interactive dialogs into formal language elements as each piece of requirements data is entered and storing said formal language elements as said Formal Specification written in an object-oriented formal specification language having rules of syntax and semantics that define a grammar for said formal language; controlling a computer to use said rules of syntax and semantics to validate said Formal Specification to generate said validated Formal Specification. 8. The process of claim 7 wherein said diagrams and textual interactive dialogs receive and process requirements data entered by said designer defining an Object Model, a Dynamic Model, a Functional Model and a Presentation Model including requirements data which, if entered, defines classes, relationships between classes, global interactions, global functions and views, and wherein said diagrams and textual interactive dialogs receive and process requirements data which, if entered, defines: attributes; services; derivations; constraints; transaction formulas; triggers; display sets; filters; population selection patterns; a state transition diagram; a name; an alias; and a default population selection interface pattern for use among the population selection patterns specified in said requirements data. | 0.796148 |
9,460,151 | 1 | 10 | 1. A system comprising: a processor and executable instructions accessible on a computer-readable medium that, when executed, cause the processor to perform operations comprising: receive, from a first user, a search query to search for document information in a database, the database including an index data structure; determine that terms of the search query are in accordance with dictionary information that corresponds to the first user, the dictionary information for the first user including a first list of compatible query operators; apply the search query to the index data structure in the database to identify the document information; and send an electronic interface to the first user, the electronic interface including the document information. | 1. A system comprising: a processor and executable instructions accessible on a computer-readable medium that, when executed, cause the processor to perform operations comprising: receive, from a first user, a search query to search for document information in a database, the database including an index data structure; determine that terms of the search query are in accordance with dictionary information that corresponds to the first user, the dictionary information for the first user including a first list of compatible query operators; apply the search query to the index data structure in the database to identify the document information; and send an electronic interface to the first user, the electronic interface including the document information. 10. The system of claim 1 , wherein the search query is arranged as an expression tree that includes at least one child node coupled to at least one parent node and wherein data included in the at least one child node is an input to an operator included in the at least one parent node. | 0.757216 |
8,701,032 | 9 | 11 | 9. The method of claim 7 , wherein determining the respective lexical cost values for each of at least the first key, the second key, and the third key comprises comparing each of at least the first key, the second key, and the third key with a language model. | 9. The method of claim 7 , wherein determining the respective lexical cost values for each of at least the first key, the second key, and the third key comprises comparing each of at least the first key, the second key, and the third key with a language model. 11. The method of claim 9 , wherein the language model comprises a group of predefined phrases. | 0.5 |
9,424,299 | 2 | 3 | 2. The method of claim 1 , wherein: the conceptual relationship is based upon a directed graph with weights based upon a similarity and a distance based upon concepts. | 2. The method of claim 1 , wherein: the conceptual relationship is based upon a directed graph with weights based upon a similarity and a distance based upon concepts. 3. The method of claim 2 , wherein: the distance is based upon a topic hierarchy. | 0.5 |
9,529,795 | 11 | 12 | 11. The system of claim 10 wherein the program further configured to select the first statistically generated template instead of the second statistically generated template based on a set of model weights. | 11. The system of claim 10 wherein the program further configured to select the first statistically generated template instead of the second statistically generated template based on a set of model weights. 12. The system of claim 11 wherein the set of model weights is associated with a set of ranking features, the set of ranking features includes at least one of: a. a position of each pre-segmented text; b. a type and a number of a set of content; c. an n-gram calculation; d. a template length; and e. an overlap calculation between a current template and the gold template. | 0.5 |
7,827,483 | 1 | 3 | 1. A method of providing a real time preview of changes to fonts in a computer system operating a document editing program having a document display window, comprising: storing an active document in a memory medium; displaying at least part of the active document in the document display window including text having an associated font command code, the document display window for editing the active document therein; tracking a cursor position controlled by a user in the document editing program; identifying a font by hovering of the cursor for a predetermined period of time over the font displayed in a menu or toolbar option of the document display window, the menu or toolbar option providing one or more available fonts, each of the available fonts associated with a respective font command codes that can be applied to the active document; inserting the font command code corresponding to the identified font into the memory medium storing the active document and updating the display of the active document in the document display windows to show the impact of the inserted font command code on the display of the text of the active document, without confirmation being received from the user; pushing the font command code corresponding to the identified font to the undo stack when a subsequent confirmation is received from the user; and removing the font command code corresponding to the identified font from the memory medium when subsequent confirmation is not received from the user or when another font command code is identified. | 1. A method of providing a real time preview of changes to fonts in a computer system operating a document editing program having a document display window, comprising: storing an active document in a memory medium; displaying at least part of the active document in the document display window including text having an associated font command code, the document display window for editing the active document therein; tracking a cursor position controlled by a user in the document editing program; identifying a font by hovering of the cursor for a predetermined period of time over the font displayed in a menu or toolbar option of the document display window, the menu or toolbar option providing one or more available fonts, each of the available fonts associated with a respective font command codes that can be applied to the active document; inserting the font command code corresponding to the identified font into the memory medium storing the active document and updating the display of the active document in the document display windows to show the impact of the inserted font command code on the display of the text of the active document, without confirmation being received from the user; pushing the font command code corresponding to the identified font to the undo stack when a subsequent confirmation is received from the user; and removing the font command code corresponding to the identified font from the memory medium when subsequent confirmation is not received from the user or when another font command code is identified. 3. The method of claim 1 wherein the font comprises a font size. | 0.901538 |
8,839,414 | 9 | 10 | 9. The method of claim 8 , wherein receiving the connection request comprises receiving an ODBC connection request containing a target alias for retrieving the credentials from the credential manager, and a connection string for the native target resource connectivity component. | 9. The method of claim 8 , wherein receiving the connection request comprises receiving an ODBC connection request containing a target alias for retrieving the credentials from the credential manager, and a connection string for the native target resource connectivity component. 10. The method of claim 9 , wherein generating the native target resource connection request comprises packaging the retrieved credentials with the connection string. | 0.5 |
7,849,416 | 1 | 26 | 1. A computer-implemented method for creating a prototype that includes motion control, machine vision, and Data Acquisition (DAQ) functionality, the method comprising: displaying a graphical user interface (GUI) that provides GUI access to a set of operations, wherein the set of operations includes one or more motion control operations, one or more machine vision operations, and one or more DAQ operations; creating a sequence of operations, wherein creating the sequence comprises including a plurality of operations in the sequence in response to user input selecting each operation in the plurality of operations from the GUI, wherein including the plurality of operations in the sequence in response to the user input selecting each operation in the plurality of operations from the GUI comprises including the plurality of operations in the sequence without receiving user input specifying program code for performing the plurality of operations; wherein the plurality of operations included in the sequence includes at least one motion control operation, at least one machine vision operation, and at least one DAQ operation, wherein at least one of the DAQ operations included in the sequence is operable to control a DAQ measurement device to acquire measurement data of a device under test; wherein the method further comprises storing information representing the sequence of operations in a data structure, wherein the sequence of operations comprises the prototype. | 1. A computer-implemented method for creating a prototype that includes motion control, machine vision, and Data Acquisition (DAQ) functionality, the method comprising: displaying a graphical user interface (GUI) that provides GUI access to a set of operations, wherein the set of operations includes one or more motion control operations, one or more machine vision operations, and one or more DAQ operations; creating a sequence of operations, wherein creating the sequence comprises including a plurality of operations in the sequence in response to user input selecting each operation in the plurality of operations from the GUI, wherein including the plurality of operations in the sequence in response to the user input selecting each operation in the plurality of operations from the GUI comprises including the plurality of operations in the sequence without receiving user input specifying program code for performing the plurality of operations; wherein the plurality of operations included in the sequence includes at least one motion control operation, at least one machine vision operation, and at least one DAQ operation, wherein at least one of the DAQ operations included in the sequence is operable to control a DAQ measurement device to acquire measurement data of a device under test; wherein the method further comprises storing information representing the sequence of operations in a data structure, wherein the sequence of operations comprises the prototype. 26. The method of claim 1 , wherein said displaying the GUI comprises a first application displaying the GUI; wherein said creating the sequence comprises the first application creating the sequence; wherein the method further comprises: the first application receiving a request to invoke execution of the sequence from a second program external to the first application; and the first application executing the sequence of operations in response to the request from the second program, wherein the first application executing the sequence comprises the first application invoking execution of software routines to perform the plurality of operations in the sequence. | 0.631347 |
8,024,193 | 82 | 85 | 82. The system of claim 75 wherein creating feature vectors comprises: constructing a matrix W from the instances; and decomposing the matrix W. | 82. The system of claim 75 wherein creating feature vectors comprises: constructing a matrix W from the instances; and decomposing the matrix W. 85. The system of claim 82 wherein decomposing the matrix W comprises performing a singular value decomposition of W, represented by
W=USV T where M is the number of instances, M is the maximum number of segments corresponding to an instance, U is the M×R left singular matrix with row vectors u i (1≦i≦M), S is the R×R diagonal matrix of singular values s 1 ≧s 2 ≧ . . . ≧s R >0, V is the N×R right singular matrix with row vectors v j (1≦j≦N), R≦min (M, N), and T denotes matrix transposition. | 0.5 |
9,037,519 | 3 | 4 | 3. The system of claim 2 , wherein the cascaded two-tier classifier includes: a tier comprising the first multilayer perceptron classifier that is configured to classify the data sample as being in the congested state or a non-congested state. | 3. The system of claim 2 , wherein the cascaded two-tier classifier includes: a tier comprising the first multilayer perceptron classifier that is configured to classify the data sample as being in the congested state or a non-congested state. 4. The system of claim 3 , wherein the tier is a first tier and the cascaded two-tier classifier includes: a second tier comprising the first support vector machine classifier that is configured to classify the data sample as being in the unimpeded state or the busy state, in response to the data sample determined to being classified as being in the non-congested state by the first multilayer perceptron classifier. | 0.75 |
7,475,007 | 11 | 13 | 11. The expression extraction device according to claim 9 , wherein the expression extraction unit further extracts a pair of an evaluation item and an expression indicating an evaluation of the evaluation item as at least one of the multiple evaluation expressions. | 11. The expression extraction device according to claim 9 , wherein the expression extraction unit further extracts a pair of an evaluation item and an expression indicating an evaluation of the evaluation item as at least one of the multiple evaluation expressions. 13. The expression extraction device according to claim 11 , further comprising: a polarity determination unit for determining a polarity of the verb/adjective, when polarities of the verb/adjective appearing in multiple positions in the text are judged as the same polarity at a proportion equal to or higher than a predetermined proportion, as equivalent to the polarity judged as identical at the proportion equal to or higher than the predetermined proportion. | 0.5 |
9,613,321 | 1 | 5 | 1. A system for managing dynamic meta-knowledge, said system comprising: a database for storing a record of data including of a plurality of publications each including a document body, a title and an abstract, a plurality of meta-data entities and a plurality of quantitative data items; a management module for managing said database, wherein a selected publication of said plurality of publications is linked to a selected set of meta-data entities of said plurality of meta-data entities and linked to a selected set of quantitative data items of said plurality of quantitative data items, said management module, further, for configuring to publication webpage for said selected publication for displaying said selected set of meta-data entities and selected set of quantitative data items linked to said selected publication, said management module further for configuring an entity webpage for a selected meta-data entity of said selected set of meta-data entities, and determining a plurality of products including at least two different products, each of said plurality of products referenced in the document body, the title, or the abstract of at least one of said plurality of publications; and, an aggregator for configuring said entity webpage to aggregate each publication of said plurality of publications linked to said selected meta-data entity, including said selected publication, aggregate each of the plurality of products referenced in the document body, the title or the abstract of at least one of the plurality of publications linked to said selected meta-data entity, including said selected publication, and aggregate each of said plurality of said meta-data entities, other than said selected meta data entity, that are linked to said selected meta-data entity via said selected publication and via each other publication of said plurality of publications that are linked to said selected meta-data entity, wherein said aggregated meta-data entities, aggregated publications, and aggregated products are aggregated into web pages displayable on said entity webpage. | 1. A system for managing dynamic meta-knowledge, said system comprising: a database for storing a record of data including of a plurality of publications each including a document body, a title and an abstract, a plurality of meta-data entities and a plurality of quantitative data items; a management module for managing said database, wherein a selected publication of said plurality of publications is linked to a selected set of meta-data entities of said plurality of meta-data entities and linked to a selected set of quantitative data items of said plurality of quantitative data items, said management module, further, for configuring to publication webpage for said selected publication for displaying said selected set of meta-data entities and selected set of quantitative data items linked to said selected publication, said management module further for configuring an entity webpage for a selected meta-data entity of said selected set of meta-data entities, and determining a plurality of products including at least two different products, each of said plurality of products referenced in the document body, the title, or the abstract of at least one of said plurality of publications; and, an aggregator for configuring said entity webpage to aggregate each publication of said plurality of publications linked to said selected meta-data entity, including said selected publication, aggregate each of the plurality of products referenced in the document body, the title or the abstract of at least one of the plurality of publications linked to said selected meta-data entity, including said selected publication, and aggregate each of said plurality of said meta-data entities, other than said selected meta data entity, that are linked to said selected meta-data entity via said selected publication and via each other publication of said plurality of publications that are linked to said selected meta-data entity, wherein said aggregated meta-data entities, aggregated publications, and aggregated products are aggregated into web pages displayable on said entity webpage. 5. The system of claim 1 , wherein said system further comprises an analyzer module, said analyzer module for processing information on at least one parameter to generate said data for a graphical interface for display on said publication webpage. | 0.803968 |
9,509,847 | 30 | 31 | 30. The method of claim 29 , wherein the language table is referenced to assign language tags using at least one match made through one of: static entries and a set of numbers based on address characteristics mapped to a given language. | 30. The method of claim 29 , wherein the language table is referenced to assign language tags using at least one match made through one of: static entries and a set of numbers based on address characteristics mapped to a given language. 31. The method of claim 30 , wherein the address characteristics comprise country codes. | 0.5 |
7,761,301 | 14 | 15 | 14. The computer implemented speech synthesis method according to claim 13 , wherein the determining the type includes: selecting, from a group of a plurality of prosodic boundary estimation rules each including a condition for the punctuation mark incidence between the language units in order to determine the type of the prosodic boundary between the language units, the prosodic boundary estimation rule whose condition meets the punctuation mark incidence between the language units estimated, and determining the type of the prosodic boundary between the language units types based on the prosodic boundary estimation rule selected. | 14. The computer implemented speech synthesis method according to claim 13 , wherein the determining the type includes: selecting, from a group of a plurality of prosodic boundary estimation rules each including a condition for the punctuation mark incidence between the language units in order to determine the type of the prosodic boundary between the language units, the prosodic boundary estimation rule whose condition meets the punctuation mark incidence between the language units estimated, and determining the type of the prosodic boundary between the language units types based on the prosodic boundary estimation rule selected. 15. The computer implemented speech synthesis method according to claim 14 , wherein the prosodic boundary estimation rules are generated based on a plurality of learning data items each concerning the boundary between the language units and including the punctuation mark incidence between the language units. | 0.5 |
7,526,464 | 1 | 10 | 1. An adaptive fuzzy network system, comprising: a computer-implemented fuzzy network comprising a plurality of objects, wherein two objects of the plurality of objects have one or more relationships types, and one or more relationships associated with each relationship type, each relationship being uni-directional or bi-directional, and each direction of each relationship has an associated relationship indicator, wherein the relationship indicators associated with each direction are not necessarily the same magnitude; a usage aspect comprising usage behaviors of one or more users associated with the fuzzy network; a first function to generate a recommendation for delivery to a user based, at least in part, on inferred interests of the user derived from the said usage behaviors; a second function to specify security for a subset of the fuzzy network; and a third function to modify a subset of the fuzzy network in accordance with the specified security. | 1. An adaptive fuzzy network system, comprising: a computer-implemented fuzzy network comprising a plurality of objects, wherein two objects of the plurality of objects have one or more relationships types, and one or more relationships associated with each relationship type, each relationship being uni-directional or bi-directional, and each direction of each relationship has an associated relationship indicator, wherein the relationship indicators associated with each direction are not necessarily the same magnitude; a usage aspect comprising usage behaviors of one or more users associated with the fuzzy network; a first function to generate a recommendation for delivery to a user based, at least in part, on inferred interests of the user derived from the said usage behaviors; a second function to specify security for a subset of the fuzzy network; and a third function to modify a subset of the fuzzy network in accordance with the specified security. 10. The system of claim 1 , wherein a third function to modify a subset of the fuzzy network in accordance with the specified security comprises: a fourth function to combine a plurality of subsets of the fuzzy network. | 0.508969 |
8,326,818 | 1 | 7 | 1. A method of managing websites registered in a search engine in a search engine administration system, the method comprising: receiving, by an interface module, website information of a website; sorting, by a website registration module, the website information according to an information field; recording the sorted website information in a database; maintaining an adult keyword database that stores adult keywords; extracting a hypertext markup language (HTML) file of a web page of the website; extracting a redirection tag included in the HTML file by analyzing the extracted HTML file, the redirection tag comprising a target universal resource locator (URL); analyzing the target URL or a target HTML file corresponding to the target URL; extracting a character string within the analyzed target URL or target HTML file; searching the adult keyword database for an adult keyword corresponding to the extracted character string; and controlling a process for the website in response to an adult keyword corresponding to the extracted character string being found, wherein controlling a process for the website comprises taking measures against the website that has been determined to be an adult site when the website is not registered as an adult site. | 1. A method of managing websites registered in a search engine in a search engine administration system, the method comprising: receiving, by an interface module, website information of a website; sorting, by a website registration module, the website information according to an information field; recording the sorted website information in a database; maintaining an adult keyword database that stores adult keywords; extracting a hypertext markup language (HTML) file of a web page of the website; extracting a redirection tag included in the HTML file by analyzing the extracted HTML file, the redirection tag comprising a target universal resource locator (URL); analyzing the target URL or a target HTML file corresponding to the target URL; extracting a character string within the analyzed target URL or target HTML file; searching the adult keyword database for an adult keyword corresponding to the extracted character string; and controlling a process for the website in response to an adult keyword corresponding to the extracted character string being found, wherein controlling a process for the website comprises taking measures against the website that has been determined to be an adult site when the website is not registered as an adult site. 7. The method of claim 1 , further comprising: determining, when the adult keyword corresponding to the extracted character string is found in the adult keyword database, whether the website corresponding to the adult keyword is registered as an adult site, wherein controlling the process for the website comprises taking measures against a registrant of the website that has been determined to be an adult site when the website is not registered as an adult site. | 0.509494 |
9,129,227 | 7 | 8 | 7. The method of claim 1 , wherein generating the model of user interests further comprises: mapping a set of topics into a joint embedding space, wherein each of the set of topics is assigned a location within the joint embedding space; mapping a set of content items into the joint embedding space, wherein each of the set of content items is associated with one or more topics in the set of topics; learning one or more mappings for the set of topics and the set of content items in the joint embedding space to create a learned joint embedding space; projecting the plurality of topics into the learned joint embedding space; and determining associations between the plurality of topics and the set of content items. | 7. The method of claim 1 , wherein generating the model of user interests further comprises: mapping a set of topics into a joint embedding space, wherein each of the set of topics is assigned a location within the joint embedding space; mapping a set of content items into the joint embedding space, wherein each of the set of content items is associated with one or more topics in the set of topics; learning one or more mappings for the set of topics and the set of content items in the joint embedding space to create a learned joint embedding space; projecting the plurality of topics into the learned joint embedding space; and determining associations between the plurality of topics and the set of content items. 8. The method of claim 7 , wherein learning the one or more mappings for the set of topics and the set of content items further comprising training mapping functions associated with each of the set of mapped topics and the set of mapped content items such that a loss function is minimized. | 0.5 |
7,707,027 | 16 | 17 | 16. The machine readable storage of claim 13 , further comprising: code for identifying bigrams that are entirely composed of meaningless unigrams; code for determining whether the identified bigrams are individually meaningless; and code for assigning at least a portion of the bigrams identified as being individually meaningless to the first n-gram class. | 16. The machine readable storage of claim 13 , further comprising: code for identifying bigrams that are entirely composed of meaningless unigrams; code for determining whether the identified bigrams are individually meaningless; and code for assigning at least a portion of the bigrams identified as being individually meaningless to the first n-gram class. 17. The machine readable storage of claim 16 , further comprising code for categorizing the identified bigrams into at least one class selected from the group consisting of a nonsensical class and at least one ambiguous class. | 0.686111 |
7,895,178 | 1 | 2 | 1. A method for operating an advertising machine implemented on at least one computer to provide advertisements via a communications link to a data processing device of a user, the method comprising: receiving from the data processing device via the communications link a search request that includes a search argument; searching at least one database using the search argument to produce search results; selecting at least one advertisement from an advertisement database relating to at least one of the search argument and the search results; transmitting the search results together with the at least one advertisement via the communications link to the data processing device; receiving search refinement input from the data processing device via the communications link; producing modified search results based upon at least the search refinement input; selecting at least one other advertisement from the advertisement database based upon at least one of the search refinement input and the modified search results; and transmitting at least one of the modified search results and the at least one other advertisement via the communications link to the data processing device. | 1. A method for operating an advertising machine implemented on at least one computer to provide advertisements via a communications link to a data processing device of a user, the method comprising: receiving from the data processing device via the communications link a search request that includes a search argument; searching at least one database using the search argument to produce search results; selecting at least one advertisement from an advertisement database relating to at least one of the search argument and the search results; transmitting the search results together with the at least one advertisement via the communications link to the data processing device; receiving search refinement input from the data processing device via the communications link; producing modified search results based upon at least the search refinement input; selecting at least one other advertisement from the advertisement database based upon at least one of the search refinement input and the modified search results; and transmitting at least one of the modified search results and the at least one other advertisement via the communications link to the data processing device. 2. The method of claim 1 , wherein both the search results and the search argument are used to select the at least one advertisement. | 0.796636 |
9,779,083 | 10 | 13 | 10. A method for extracting information from a natural language sentence, the method comprising: converting, by a processing device, the natural language sentence into a computer readable primitive sentence by detecting one or more logical clauses in the natural language sentence, wherein the computer-readable primitive sentence improves a functioning of a computing device by not requiring voluminous storage space in allowing the computing device to process the natural language sentence to obtain information from the natural language sentence; determining, by the processing device, a type for each of the one or more logical clauses, wherein the type indicates whether each of the one or more logical clauses contains an ambiguous verbal block; and extracting, by the processing device, information using from the computer-readable primitive sentence based on the type for each of the one or more logical clauses. | 10. A method for extracting information from a natural language sentence, the method comprising: converting, by a processing device, the natural language sentence into a computer readable primitive sentence by detecting one or more logical clauses in the natural language sentence, wherein the computer-readable primitive sentence improves a functioning of a computing device by not requiring voluminous storage space in allowing the computing device to process the natural language sentence to obtain information from the natural language sentence; determining, by the processing device, a type for each of the one or more logical clauses, wherein the type indicates whether each of the one or more logical clauses contains an ambiguous verbal block; and extracting, by the processing device, information using from the computer-readable primitive sentence based on the type for each of the one or more logical clauses. 13. The method of claim 10 , wherein extracting the information from the computer-readable primitive sentence comprises detecting sequences of words in the computer-readable primitive sentence using regular expression-like word patterns. | 0.628527 |
8,515,752 | 1 | 6 | 1. A method comprising: receiving, by one or more processors in one or more computer devices, a voice search query; determining, by the one or more processors and from the voice search query, recognition hypotheses for the voice search query, the recognition hypotheses being associated with statistical weights, each of the statistical weights reflecting a respective likelihood that a corresponding recognition hypothesis, of the recognition hypotheses, is accurate for the voice search query; selecting, by the one or more processors and based on the statistical weights, a plurality of the recognition hypotheses as selected recognition hypotheses, where the selected recognition hypotheses are associated with, respectively, corresponding-statistical weights of the statistical weights, and where a quantity of the selected recognition hypotheses is determined based on a quantity of terms included in one of the selected recognition hypotheses and a maximum quantity of terms to be included in a weighted boolean query; constructing, by the one or more processors, the weighted boolean query, the weighted boolean query including the selected recognition hypotheses weighted by the corresponding statistical weights; obtaining, by the one or more processors, results associated with the weighted boolean query; and providing, by the one or more processors, the results for display. | 1. A method comprising: receiving, by one or more processors in one or more computer devices, a voice search query; determining, by the one or more processors and from the voice search query, recognition hypotheses for the voice search query, the recognition hypotheses being associated with statistical weights, each of the statistical weights reflecting a respective likelihood that a corresponding recognition hypothesis, of the recognition hypotheses, is accurate for the voice search query; selecting, by the one or more processors and based on the statistical weights, a plurality of the recognition hypotheses as selected recognition hypotheses, where the selected recognition hypotheses are associated with, respectively, corresponding-statistical weights of the statistical weights, and where a quantity of the selected recognition hypotheses is determined based on a quantity of terms included in one of the selected recognition hypotheses and a maximum quantity of terms to be included in a weighted boolean query; constructing, by the one or more processors, the weighted boolean query, the weighted boolean query including the selected recognition hypotheses weighted by the corresponding statistical weights; obtaining, by the one or more processors, results associated with the weighted boolean query; and providing, by the one or more processors, the results for display. 6. The method of claim 1 , further comprising: adjusting a ranking of the results based on the corresponding statistical weights. | 0.867828 |
9,817,920 | 1 | 4 | 1. A method comprising: identifying, by one or more processors, one or more particular terms, of a plurality of terms, in a search query; forming, by the one or more processors and based on identifying the one or more particular terms, another search query; obtaining, by the one or more processors, first context data that includes a first set of documents returned for the search query and second context data that includes a second set of documents returned for the other search query; comparing, by the one or more processors, information associated with the first set of documents returned for the search query and information associated with the second set of documents returned for the other search query; determining, by the one or more processors and based on the comparing, that the first context data and the second context data are different; and storing, by the one or more processors and based on the determining, information indicating that the search query and the other search query are associated with different context data. | 1. A method comprising: identifying, by one or more processors, one or more particular terms, of a plurality of terms, in a search query; forming, by the one or more processors and based on identifying the one or more particular terms, another search query; obtaining, by the one or more processors, first context data that includes a first set of documents returned for the search query and second context data that includes a second set of documents returned for the other search query; comparing, by the one or more processors, information associated with the first set of documents returned for the search query and information associated with the second set of documents returned for the other search query; determining, by the one or more processors and based on the comparing, that the first context data and the second context data are different; and storing, by the one or more processors and based on the determining, information indicating that the search query and the other search query are associated with different context data. 4. The method of claim 1 , further comprising: identifying, based on determining that the first context data and the second context data are different, a particular term, of the one or more particular terms, that causes the first context data to be different than the second context data. | 0.630769 |
8,386,435 | 17 | 19 | 17. The method of claim 3 further comprising: recording token-value to archive-data-value relationships during the data tokenization process; extracting the token value range for each of the tokenized data segments prior to compression; and storing the relationships and range information in an index file. | 17. The method of claim 3 further comprising: recording token-value to archive-data-value relationships during the data tokenization process; extracting the token value range for each of the tokenized data segments prior to compression; and storing the relationships and range information in an index file. 19. The method of claim 17 , wherein the index file is stored in a central data repository. | 0.633065 |
9,213,911 | 14 | 18 | 14. An apparatus for recognizing text on a surface of a curved object, the apparatus comprising: an image sensor configured to capture from an environment of a user a video stream; and at least one processor device configured to: identify the curved object contains a curved surface based on the video stream; determine that text is found on the identified curved surface; process a first frame of the video stream having a first perspective of text on the curved surface, wherein the first frame includes a first portion of text on the curved surface, the first portion of text including skewed characters that are unrecognizable using an optical character recognition process due to a curvature of the first portion of text on the curved surface viewed from the first perspective, and wherein the first frame includes a second portion of text recognizable using the optical character recognition process; identify a second frame of the video stream having a second perspective of the text on the curved surface, wherein the second frame includes the first portion of text in a form capable of recognition in the optical character recognition process; perform optical character recognition on the second portion of text in the first frame and the first portion of text in the second frame; combine results of the optical character recognition on the second portion of text in the first frame and the first portion of text in the second frame; combine results of the optical character recognition on the second portion of text in the first frame and on the first portion of text in the second frame; and provide the user with a recognized representation of the text on the curved surface, including a recognized representation of the second portion of text in the first image and the first portion of text in the second image. | 14. An apparatus for recognizing text on a surface of a curved object, the apparatus comprising: an image sensor configured to capture from an environment of a user a video stream; and at least one processor device configured to: identify the curved object contains a curved surface based on the video stream; determine that text is found on the identified curved surface; process a first frame of the video stream having a first perspective of text on the curved surface, wherein the first frame includes a first portion of text on the curved surface, the first portion of text including skewed characters that are unrecognizable using an optical character recognition process due to a curvature of the first portion of text on the curved surface viewed from the first perspective, and wherein the first frame includes a second portion of text recognizable using the optical character recognition process; identify a second frame of the video stream having a second perspective of the text on the curved surface, wherein the second frame includes the first portion of text in a form capable of recognition in the optical character recognition process; perform optical character recognition on the second portion of text in the first frame and the first portion of text in the second frame; combine results of the optical character recognition on the second portion of text in the first frame and the first portion of text in the second frame; combine results of the optical character recognition on the second portion of text in the first frame and on the first portion of text in the second frame; and provide the user with a recognized representation of the text on the curved surface, including a recognized representation of the second portion of text in the first image and the first portion of text in the second image. 18. The apparatus of claim 14 , wherein the at least one processor device is further configured to combine the results of the optical character recognition on the first frame and on the second frame. | 0.595528 |
7,756,709 | 14 | 18 | 14. A method according to claim 9 , wherein said step of analyzing comprises observing zero crossings of the sound in said each window. | 14. A method according to claim 9 , wherein said step of analyzing comprises observing zero crossings of the sound in said each window. 18. A method according to claim 14 , wherein said step of analyzing further comprises comparing band-limited energy content of the sound in said each block to a first sound energy threshold. | 0.5 |
9,569,421 | 8 | 14 | 8. A system comprising: at least one server computing device, each server computing device comprising a processor and a storage medium for tangibly storing thereon program logic for execution by the processor, the stored program logic comprising: making logic executed by the processor for making, in response to a request to identify a supported language to display content by a client application at a client computing device, the supported language having a set of translations for use in translating the content, a determination, using a current language tag, that a language referenced by the current language tag is not the supported language, the current language tag comprising one or more subtags, each subtag providing language identification information; in response to making the determination that the language referenced by the current language tag is not the supported language, the stored program logic further comprising: accessing logic executed by the processor for accessing a stored set of mappings comprising one or more mappings, each mapping associating a first language tag referencing a first language with a second language tag referencing a second language that differs from the first language; determining logic executed by the processor for determining whether or not a mapping in the set of mappings includes the current language tag referencing the first language as one of the first and second language tags and a new language tag referencing the second language that differs from the first language as the other of the first and second language tags; using logic executed by the processor for using the new language tag as the current language tag, the new language tag identifying the second language that differs from the first language as the supported language; and identifying logic executed by the processor for identifying, in response to the request, the supported language to use in translating the content to be displayed by the client application at the client computing device. | 8. A system comprising: at least one server computing device, each server computing device comprising a processor and a storage medium for tangibly storing thereon program logic for execution by the processor, the stored program logic comprising: making logic executed by the processor for making, in response to a request to identify a supported language to display content by a client application at a client computing device, the supported language having a set of translations for use in translating the content, a determination, using a current language tag, that a language referenced by the current language tag is not the supported language, the current language tag comprising one or more subtags, each subtag providing language identification information; in response to making the determination that the language referenced by the current language tag is not the supported language, the stored program logic further comprising: accessing logic executed by the processor for accessing a stored set of mappings comprising one or more mappings, each mapping associating a first language tag referencing a first language with a second language tag referencing a second language that differs from the first language; determining logic executed by the processor for determining whether or not a mapping in the set of mappings includes the current language tag referencing the first language as one of the first and second language tags and a new language tag referencing the second language that differs from the first language as the other of the first and second language tags; using logic executed by the processor for using the new language tag as the current language tag, the new language tag identifying the second language that differs from the first language as the supported language; and identifying logic executed by the processor for identifying, in response to the request, the supported language to use in translating the content to be displayed by the client application at the client computing device. 14. The system of claim 8 , the stored program logic further comprising: determining logic executed by the processor for determining whether or not the language referenced by the current language tag is the supported language by determining whether or not the current language tag is one of the language tags in a language tag listing, wherein each language supported by an entity providing language support is represented in the language tag listing, each language tag in the listing referencing a language supported by the entity. | 0.628492 |
6,044,387 | 2 | 10 | 2. The method of claim 1, wherein the editing operation comprises one of the steps of: (a) spell checking text included in the plurality of files to identify words that may be misspelled; and (b) finding characters specified by the user and replacing said characters with replacement characters entered by the user. | 2. The method of claim 1, wherein the editing operation comprises one of the steps of: (a) spell checking text included in the plurality of files to identify words that may be misspelled; and (b) finding characters specified by the user and replacing said characters with replacement characters entered by the user. 10. The method of claim 2, wherein if the editing operation comprises the finding and replacing of characters, further comprising the step of enabling the user to select options related to the editing operation, said options including: (a) finding only characters in each of the plurality of files that match a whole word specified by the user; and (b) finding only characters in the plurality of files that match a case of the characters specified by the user. | 0.5 |
7,873,904 | 9 | 10 | 9. The method as recited in claim 8 , further comprising making each popular URL an active hyperlink to a web page associated with the URL, wherein user-selecting a displayed URL initiates a display of the web page associated with the URL. | 9. The method as recited in claim 8 , further comprising making each popular URL an active hyperlink to a web page associated with the URL, wherein user-selecting a displayed URL initiates a display of the web page associated with the URL. 10. The method as recited in claim 9 , further comprising presenting a slideshow of the web pages associated with the URLs and presenting user controls for operating the slideshow. | 0.5 |
9,070,357 | 1 | 19 | 1. A method comprising: indexing, by a computer comprising hardware and software executing on the hardware, a plurality of health conditions of a human against a plurality of different health-related speech characteristics; identifying, by the computer, a speech segment of a speaker; analyzing, by the computer, the speech segment to determine a presence or absence of any of the health-related speech characteristics; upon determining a presence of one of the health-related speech characteristics, determining, by the computer, a corresponding one of the health conditions consistent with the indexing; and generating, by the computer, an alert indicating that the speaker has a statistically significant likelihood of having the determined health condition based on results of the analyzing, wherein the speech segment is received from mobile computing device of the speaker, wherein the alert triggers an advertisement specific to the determined health condition to be sent over a network for presentation on the mobile communication device. | 1. A method comprising: indexing, by a computer comprising hardware and software executing on the hardware, a plurality of health conditions of a human against a plurality of different health-related speech characteristics; identifying, by the computer, a speech segment of a speaker; analyzing, by the computer, the speech segment to determine a presence or absence of any of the health-related speech characteristics; upon determining a presence of one of the health-related speech characteristics, determining, by the computer, a corresponding one of the health conditions consistent with the indexing; and generating, by the computer, an alert indicating that the speaker has a statistically significant likelihood of having the determined health condition based on results of the analyzing, wherein the speech segment is received from mobile computing device of the speaker, wherein the alert triggers an advertisement specific to the determined health condition to be sent over a network for presentation on the mobile communication device. 19. The method of claim 1 , wherein determining of the satisfaction of at least one health alert definition further comprises: identifying the satisfaction of only a default health alert definition, wherein a situation is created where a health alert definition to handle said analysis is undefined; indicating that the speech segment is unable to be handled by current health alert definitions, wherein said speech segment is marked within the speech segment history with an identifier that instructs the speech-based health monitor to ignore the speech segment for analysis purposes; and requesting resolution of the marked speech segment from a designated entity; and upon receipt of resolution for the marked speech segment, removing the identifier from the speech segment in the speech segment history. | 0.5 |
9,400,987 | 1 | 13 | 1. A method comprising the steps: receiving, at a computing device over a network, a user context query from a user, wherein the user context query is formatted as a parameter of a uniform resource locator (URL) and comprises at least one user context criteria; formulating, via at least one processor of the computing device, a network data query based on the at least one user context criteria, said formulating comprises configuring the network data query based on user data relating to the querying user corresponding to a context of most interest to the user; identifying, via at least one processor of the computing device, at least one entry from a plurality of entries in a context query bid database that relates to the at least one user context criteria based on the formulated network data query, wherein each of the plurality of entries comprises at least one bid context criteria, a bid amount, an identification of an advertiser, and an identification of at least one advertisement; selecting, via at least one processor of the computing device, one of the identified at least one of the plurality of entries on the context query bid database, wherein the selected one of the plurality of entries on the context query bid database has the highest bid amount; retrieving, at the computing device over the network by the computing device, at least one entry from an advertisement database such that an identification of an advertiser and an identification of an advertisement on the at least one entry from the advertisement database matches the identification of the advertiser and the identification of the at least one advertisement on the selected one of the plurality of entries on the context query bid database, wherein each entry on the advertisement database comprises an identification of an advertiser, an identification of an advertisement, and at least one advertisement data object; and generating, via at least one processor of the computing device, a dynamic webpage having content relating to the user context query. | 1. A method comprising the steps: receiving, at a computing device over a network, a user context query from a user, wherein the user context query is formatted as a parameter of a uniform resource locator (URL) and comprises at least one user context criteria; formulating, via at least one processor of the computing device, a network data query based on the at least one user context criteria, said formulating comprises configuring the network data query based on user data relating to the querying user corresponding to a context of most interest to the user; identifying, via at least one processor of the computing device, at least one entry from a plurality of entries in a context query bid database that relates to the at least one user context criteria based on the formulated network data query, wherein each of the plurality of entries comprises at least one bid context criteria, a bid amount, an identification of an advertiser, and an identification of at least one advertisement; selecting, via at least one processor of the computing device, one of the identified at least one of the plurality of entries on the context query bid database, wherein the selected one of the plurality of entries on the context query bid database has the highest bid amount; retrieving, at the computing device over the network by the computing device, at least one entry from an advertisement database such that an identification of an advertiser and an identification of an advertisement on the at least one entry from the advertisement database matches the identification of the advertiser and the identification of the at least one advertisement on the selected one of the plurality of entries on the context query bid database, wherein each entry on the advertisement database comprises an identification of an advertiser, an identification of an advertisement, and at least one advertisement data object; and generating, via at least one processor of the computing device, a dynamic webpage having content relating to the user context query. 13. The method of claim 1 , wherein said formulating the network data query based on the at least one user context criteria so as to identify at least one entry in a context query bid database that relates to the at least one user context criteria comprises: searching for user profile data, social network data, spatial data, temporal data, topical data and context query bid data that is available via the network and relates to the context. | 0.507778 |
8,000,991 | 1 | 2 | 1. A method for executing a workflow on a device, the workflow comprising one or more task activities comprising actions performed by devices participating in the workflow and routing activities used to transfer control and data between devices, the workflow further comprising roles, wherein the method comprises: receiving a message representing an incoming routing activity; generating, using one or more processors, from the workflow a local part to be executed on the device, wherein generating the local part comprises: modifying partner links in the workflow in order to specify coherent partner links; deleting at least part or all task activities in the workflow that do not belong to the local part, while keeping dependencies specified by process control activities; and simplifying the routing and process control activities in the workflow; executing task activities comprised by the generated local part on the device; performing a request to a discovery service in order to obtain one or more identifications of one or more next devices by matching a role to capabilities of the one or more next devices, the role being a set of attributes of the one or more next devices, the set of attributes being used to execute next task activities associated with a next local part on the one or more next devices; and sending one or more messages representing a next routing activity to the one or more next devices thus identified. | 1. A method for executing a workflow on a device, the workflow comprising one or more task activities comprising actions performed by devices participating in the workflow and routing activities used to transfer control and data between devices, the workflow further comprising roles, wherein the method comprises: receiving a message representing an incoming routing activity; generating, using one or more processors, from the workflow a local part to be executed on the device, wherein generating the local part comprises: modifying partner links in the workflow in order to specify coherent partner links; deleting at least part or all task activities in the workflow that do not belong to the local part, while keeping dependencies specified by process control activities; and simplifying the routing and process control activities in the workflow; executing task activities comprised by the generated local part on the device; performing a request to a discovery service in order to obtain one or more identifications of one or more next devices by matching a role to capabilities of the one or more next devices, the role being a set of attributes of the one or more next devices, the set of attributes being used to execute next task activities associated with a next local part on the one or more next devices; and sending one or more messages representing a next routing activity to the one or more next devices thus identified. 2. The method for executing the workflow of claim 1 , further comprising retrieving from the message a number of a local part of a workflow to be executed on the device. | 0.760623 |
7,996,783 | 7 | 9 | 7. A computer-implemented method for facilitating widget searching, comprising: employing a calling application to obtain task associated data exposed by each of a plurality of widgets, each widget residing on a client or server and configured to expose the task associated data to the calling application, the task associated data includes widget task capabilities, types of acceptable slots, or information to facilitate widget slot filling; receiving a user query associated with one or more of the plurality of widgets, wherein the user query is a natural language query; passing the task associated data from the calling application to a task reasoning process that is based, at least in part, on an adaptive semantic reasoning engine; employing the adaptive task reasoning engine to apply adaptive task reasoning and the task associated data obtained from the plurality of widgets to facilitate in selecting one or more appropriate widgets responsive to the user query; utilizing the task associated data to determine slot filling for the selected widgets; employing selected widget feedback from a user to facilitate in determining the one or more appropriate widgets and slot filling in response to the user query; and calling at least one of the selected widgets with appropriate slots filled. | 7. A computer-implemented method for facilitating widget searching, comprising: employing a calling application to obtain task associated data exposed by each of a plurality of widgets, each widget residing on a client or server and configured to expose the task associated data to the calling application, the task associated data includes widget task capabilities, types of acceptable slots, or information to facilitate widget slot filling; receiving a user query associated with one or more of the plurality of widgets, wherein the user query is a natural language query; passing the task associated data from the calling application to a task reasoning process that is based, at least in part, on an adaptive semantic reasoning engine; employing the adaptive task reasoning engine to apply adaptive task reasoning and the task associated data obtained from the plurality of widgets to facilitate in selecting one or more appropriate widgets responsive to the user query; utilizing the task associated data to determine slot filling for the selected widgets; employing selected widget feedback from a user to facilitate in determining the one or more appropriate widgets and slot filling in response to the user query; and calling at least one of the selected widgets with appropriate slots filled. 9. The method of claim 7 further comprising: relaying the selected widgets and slot filling for the selected widgets to the calling application; and invoking at least one of the selected widgets with filled slots for utilization by a user. | 0.5 |
9,189,539 | 1 | 6 | 1. A method, in a data processing system, for managing an electronic document collection, comprising: analyzing a first electronic document to identify a reference to a second electronic document; analyzing the second electronic document to identify document dependencies with zero or more other electronic documents; generating a dependency information data structure based on the analysis of the first electronic document and the analysis of the second electronic document, wherein the dependency information data structure comprises a dependency graph data structure of the electronic document collection, the dependency graph data structure comprising first nodes representing electronic documents in the electronic document collection, second nodes representing authors of electronic documents in the electronic document collection, and edges between nodes representing relationships between nodes, wherein each of the first nodes and the second nodes have an associated node strength attribute, and wherein the associated node strength attribute is a measure of a relative importance of the associated first node or the associated second node to the dependency graph data structure of the electronic document collection and a fragility of the dependency graph data structure with regard to the associated first node or the associated second node; analyzing the dependency information data structure to identify a loaded document subset of the electronic document collection that is a subset of electronic documents to be loaded into memory when performing an information analysis operation; generating an electronic document curation action recommendation based on the identified subset of the electronic document collection; and outputting the electronic document curation action recommendation. | 1. A method, in a data processing system, for managing an electronic document collection, comprising: analyzing a first electronic document to identify a reference to a second electronic document; analyzing the second electronic document to identify document dependencies with zero or more other electronic documents; generating a dependency information data structure based on the analysis of the first electronic document and the analysis of the second electronic document, wherein the dependency information data structure comprises a dependency graph data structure of the electronic document collection, the dependency graph data structure comprising first nodes representing electronic documents in the electronic document collection, second nodes representing authors of electronic documents in the electronic document collection, and edges between nodes representing relationships between nodes, wherein each of the first nodes and the second nodes have an associated node strength attribute, and wherein the associated node strength attribute is a measure of a relative importance of the associated first node or the associated second node to the dependency graph data structure of the electronic document collection and a fragility of the dependency graph data structure with regard to the associated first node or the associated second node; analyzing the dependency information data structure to identify a loaded document subset of the electronic document collection that is a subset of electronic documents to be loaded into memory when performing an information analysis operation; generating an electronic document curation action recommendation based on the identified subset of the electronic document collection; and outputting the electronic document curation action recommendation. 6. The method of claim 1 , wherein the edges between nodes have associated weight values, and wherein the weight value of an edge is indicative of a strength of a corresponding relationship between nodes associated with the edge. | 0.773715 |
10,134,390 | 10 | 11 | 10. A voice recognition method of an electronic device comprising: receiving a user voice; obtaining a word corresponding to the user voice using a user pronunciation lexicon, obtaining a first pronunciation for a phoneme included in the user voice, comparing the first pronunciation and a second pronunciation pre stored for the word, identifying a pronunciation pattern by using a result of the comparing, updating a user pronunciation lexicon according to a pronunciation pattern rule obtained based on the pronunciation pattern, wherein the pronunciation pattern rule is a rule that a user repeats according to at least one of a pronunciation habit of the user and a pronunciation characteristic of the user. | 10. A voice recognition method of an electronic device comprising: receiving a user voice; obtaining a word corresponding to the user voice using a user pronunciation lexicon, obtaining a first pronunciation for a phoneme included in the user voice, comparing the first pronunciation and a second pronunciation pre stored for the word, identifying a pronunciation pattern by using a result of the comparing, updating a user pronunciation lexicon according to a pronunciation pattern rule obtained based on the pronunciation pattern, wherein the pronunciation pattern rule is a rule that a user repeats according to at least one of a pronunciation habit of the user and a pronunciation characteristic of the user. 11. The method as claimed in claim 10 further comprising: in response to the user voice being received, performing the voice recognition based on the user pronunciation lexicon. | 0.786747 |
8,462,177 | 1 | 6 | 1. A system comprising: a non-transitory computer-readable medium configured to store instructions providing a development application; a processor configured to execute the instructions stored in the non-transitory computer-readable medium to execute the development application by performing operations comprising: receiving constraint information relating to one or more images to be used in content provided on one or more operating environments; providing an image portion selection tool for selecting a portion of an image satisfying one or more constraints for an image imposed for an operating environment; receiving a selection of an image portion; and updating selected image portion information based on the selected image portion, the selected image portion information used to provide the content with the selected image portion on the operating environment, wherein versions of the content for different operating environments comprise different image portions according to the selected image portion information. | 1. A system comprising: a non-transitory computer-readable medium configured to store instructions providing a development application; a processor configured to execute the instructions stored in the non-transitory computer-readable medium to execute the development application by performing operations comprising: receiving constraint information relating to one or more images to be used in content provided on one or more operating environments; providing an image portion selection tool for selecting a portion of an image satisfying one or more constraints for an image imposed for an operating environment; receiving a selection of an image portion; and updating selected image portion information based on the selected image portion, the selected image portion information used to provide the content with the selected image portion on the operating environment, wherein versions of the content for different operating environments comprise different image portions according to the selected image portion information. 6. The system of claim 1 , wherein the selection of the image portion comprises a selected portion of an image associated with an automatic placement of the selection tool determined based on analysis of the content of the image. | 0.557915 |
9,442,744 | 17 | 20 | 17. A computing device comprising: a processing system; one or more modules operable at least in part via hardware of the processing system to implement an integrated development environment (IDE) configured to: ascertain one or more languages selected by a developer for translations of an application under development using the IDE; and during a build of the application via the IDE, facilitate in-build translations of a multilingual resource package by generating updated localization files for each of the selected languages in a designated file format established to facilitate translations, the updated localization files reflecting updates that were made to the application, the updated localization files employed by the IDE during the build to: create dynamic resource files for each selected language from the updated localization files when the updates are made to the application in the build; compile the dynamic resource files into compiled language specific resource files for each selected language; and produce the multilingual resource package that contains the compiled language specific resource files for each selected language for distribution with the application. | 17. A computing device comprising: a processing system; one or more modules operable at least in part via hardware of the processing system to implement an integrated development environment (IDE) configured to: ascertain one or more languages selected by a developer for translations of an application under development using the IDE; and during a build of the application via the IDE, facilitate in-build translations of a multilingual resource package by generating updated localization files for each of the selected languages in a designated file format established to facilitate translations, the updated localization files reflecting updates that were made to the application, the updated localization files employed by the IDE during the build to: create dynamic resource files for each selected language from the updated localization files when the updates are made to the application in the build; compile the dynamic resource files into compiled language specific resource files for each selected language; and produce the multilingual resource package that contains the compiled language specific resource files for each selected language for distribution with the application. 20. The computing device of claim 17 , wherein production of the multilingual resource package comprises: enumerating the compiled language specific resources produced for each of the one or more selected languages in a manifest for the application; packaging the manifest and compiled language specific resources together in the multilingual resource package for distribution of the application. | 0.610236 |
9,378,755 | 6 | 8 | 6. A non-transitory computer-readable storage medium having stored thereon instructions, which when executed by a processor, causes the processor to perform a method of detecting a user's voice activity, the method comprising: generating probabilistic models that respectively model features of speech dynamically over time, wherein the probabilistic models model each feature dependent on a past feature and a current state, wherein the features of speech include a nonstationary signal presence feature, a periodicity feature, and a sparsity feature; performing noise suppression on an acoustic signal to generate a nonstationary signal presence signal and a noise suppressed acoustic signal; performing residual analysis on the noise suppressed data signal to generate a periodicity signal and a sparsity signal; receiving the probabilistic models and in real-time, the nonstationary signal presence signal, the periodicity signal, and the sparsity signal; and generating in real time an estimate of voice activity based on the probabilistic models, the nonstationary signal presence signal, the periodicity signal, and the sparsity signal. | 6. A non-transitory computer-readable storage medium having stored thereon instructions, which when executed by a processor, causes the processor to perform a method of detecting a user's voice activity, the method comprising: generating probabilistic models that respectively model features of speech dynamically over time, wherein the probabilistic models model each feature dependent on a past feature and a current state, wherein the features of speech include a nonstationary signal presence feature, a periodicity feature, and a sparsity feature; performing noise suppression on an acoustic signal to generate a nonstationary signal presence signal and a noise suppressed acoustic signal; performing residual analysis on the noise suppressed data signal to generate a periodicity signal and a sparsity signal; receiving the probabilistic models and in real-time, the nonstationary signal presence signal, the periodicity signal, and the sparsity signal; and generating in real time an estimate of voice activity based on the probabilistic models, the nonstationary signal presence signal, the periodicity signal, and the sparsity signal. 8. The non-transitory computer-readable storage medium in claim 6 , wherein generating in real time the estimate of voice activity comprises generating in real time a posterior distribution of voice activity by applying a Viterbi algorithm that has been modified to function in real time. | 0.5 |
9,881,037 | 1 | 5 | 1. A system for determining a canonical title comprising: an interface to: receive a new title; and a processor to: generate a set of n-grams based on the new title, wherein an n-gram of the set of n-grams comprises one or more contiguous words of the new title; assign one or more labels for the new title, wherein assigning the one or more labels for the new title comprises searching a canonical database for identical n-grams and retrieving labels associated with the identical n-grams, wherein the one or more labels for the new title and the labels associated with the identical n-grams are assigned to one or more attributes of a set of attributes; and map the new title to a canonical title based on the one or more labels for the new title, wherein mapping the new title to the canonical title comprises determining whether any canonical title has identical associated labels as the one or more labels for the new title, wherein having an identical associated label comprises having a same label assigned to a same attribute. | 1. A system for determining a canonical title comprising: an interface to: receive a new title; and a processor to: generate a set of n-grams based on the new title, wherein an n-gram of the set of n-grams comprises one or more contiguous words of the new title; assign one or more labels for the new title, wherein assigning the one or more labels for the new title comprises searching a canonical database for identical n-grams and retrieving labels associated with the identical n-grams, wherein the one or more labels for the new title and the labels associated with the identical n-grams are assigned to one or more attributes of a set of attributes; and map the new title to a canonical title based on the one or more labels for the new title, wherein mapping the new title to the canonical title comprises determining whether any canonical title has identical associated labels as the one or more labels for the new title, wherein having an identical associated label comprises having a same label assigned to a same attribute. 5. A system as in claim 1 , wherein generating the set of n-grams comprises generating a set of unigrams. | 0.791667 |
9,069,567 | 1 | 7 | 1. A computer-implemented method for accessing a native application programming interface (API) of a computing device, the method comprising: providing on the computing device, and from a first application written in a device-independent programming language, one or more control objects that include (a) state information that defines a context for accessing the native API and (b) at least one control script; compiling the control script on the computing device into a second application that is native to the operating system of the computing device; executing the second application on the computing device, wherein the executed second application accesses the native API of the computing device to generate an output through a hardware interface of the computing device based on the context; and accessing the native API by the second application, based on information about the state information in the control objects from the first application that is provided as a result of user input received by the first application, to generate one or more additional outputs through the hardware interface of the computing device. | 1. A computer-implemented method for accessing a native application programming interface (API) of a computing device, the method comprising: providing on the computing device, and from a first application written in a device-independent programming language, one or more control objects that include (a) state information that defines a context for accessing the native API and (b) at least one control script; compiling the control script on the computing device into a second application that is native to the operating system of the computing device; executing the second application on the computing device, wherein the executed second application accesses the native API of the computing device to generate an output through a hardware interface of the computing device based on the context; and accessing the native API by the second application, based on information about the state information in the control objects from the first application that is provided as a result of user input received by the first application, to generate one or more additional outputs through the hardware interface of the computing device. 7. The computer-implemented method of claim 1 , wherein the native API comprises a native rendering API, the hardware interface comprises a display screen, and the second application accesses the native rendering API to render drawing objects on the display screen. | 0.641892 |
7,917,354 | 1 | 2 | 1. A computer-readable storage medium storing code representing instructions that when executed by a computer cause the computer to: receive as an input at least a portion of a document; extract a meaning contained in the portion of the document based on a comparison of the portion to a plurality of concepts included in a computer implemented formal ontology and arranged in a hierarchy, said hierarchy having a primary concept defined based on a set of criteria, each concept from the plurality of concepts hierarchically linked to a concept below the primary concept being defined based on all criteria from the set of criteria and based on at least one additional criterion different than each criterion from the set of criteria; associate a first term from the document with a first concept from the plurality of concepts; associate a second term from the document with a second concept from the plurality of concepts; prohibit a link between the first term and the second term when a link between the first concept and the second concept is prohibited based on a link between a parent concept of the first concept and a parent concept of the second concept, the link between the first concept and the second concept being a substantially similar type as the link between the parent concept of the first concept and the parent concept of the second concept; and index the portion of the document based on said meaning extracted from the portion of the document. | 1. A computer-readable storage medium storing code representing instructions that when executed by a computer cause the computer to: receive as an input at least a portion of a document; extract a meaning contained in the portion of the document based on a comparison of the portion to a plurality of concepts included in a computer implemented formal ontology and arranged in a hierarchy, said hierarchy having a primary concept defined based on a set of criteria, each concept from the plurality of concepts hierarchically linked to a concept below the primary concept being defined based on all criteria from the set of criteria and based on at least one additional criterion different than each criterion from the set of criteria; associate a first term from the document with a first concept from the plurality of concepts; associate a second term from the document with a second concept from the plurality of concepts; prohibit a link between the first term and the second term when a link between the first concept and the second concept is prohibited based on a link between a parent concept of the first concept and a parent concept of the second concept, the link between the first concept and the second concept being a substantially similar type as the link between the parent concept of the first concept and the parent concept of the second concept; and index the portion of the document based on said meaning extracted from the portion of the document. 2. A computer-readable storage medium as defined in claim 1 , wherein the link between the first concept and the second concept, and the link between the parent concept of the first concept and the parent concept of the second concept, are ancestrally linked. | 0.5 |
9,477,768 | 1 | 2 | 1. A method of disambiguating online social mentions of a real-world entity, the method including: selecting one or more core entity attributes that represent a real-world entity as a first search attribute set for use in searching biographical sources; receiving, responsive to searching the biographical sources based on the first search attribute set, entity reflections that include supplemental entity attributes for the real-world entity; using a combination of the selected core entity attributes and one or more supplemental entity attributes to define a second search attribute set that is narrower than the first search attribute set; receiving, responsive to searching further web sources based on the second search attribute set, more entity reflections that include meta entity attributes for the real-world entity; and updating the combination to include one or more of the meta entity attributes. | 1. A method of disambiguating online social mentions of a real-world entity, the method including: selecting one or more core entity attributes that represent a real-world entity as a first search attribute set for use in searching biographical sources; receiving, responsive to searching the biographical sources based on the first search attribute set, entity reflections that include supplemental entity attributes for the real-world entity; using a combination of the selected core entity attributes and one or more supplemental entity attributes to define a second search attribute set that is narrower than the first search attribute set; receiving, responsive to searching further web sources based on the second search attribute set, more entity reflections that include meta entity attributes for the real-world entity; and updating the combination to include one or more of the meta entity attributes. 2. The method of claim 1 , further including: selecting one or more meta entity attributes to combine with the second search attribute set to form a third search attribute set that is narrower than the second search attribute set; electronically receiving, responsive to the third search attribute set, additional entity reflections that include additional meta entity attributes; and updating the combination to include one or more of the additional meta entity attributes. | 0.589965 |
8,832,549 | 1 | 9 | 1. A non-transitory machine readable medium storing a program which when executed by at least one processing unit analyzes a document that comprises a plurality of primitive elements, the primitive elements are present in the document prior to analysis by the program, the program comprising sets of instructions for: identifying a set of potential boundaries as rectilinearly aligned graphical primitive elements that satisfy a set of size constraints; identifying a subset of the potential boundaries as actual boundaries by eliminating from the set (i) potential boundaries identified from the graphical primitive elements that intersect with primitive elements that are not in the set of potential boundaries and (ii) potential boundaries identified from the graphical primitive elements that do not intersect at least two additional potential boundaries; identifying regions bounded by the actual boundaries; and defining a structured document based on the regions and the primitive elements. | 1. A non-transitory machine readable medium storing a program which when executed by at least one processing unit analyzes a document that comprises a plurality of primitive elements, the primitive elements are present in the document prior to analysis by the program, the program comprising sets of instructions for: identifying a set of potential boundaries as rectilinearly aligned graphical primitive elements that satisfy a set of size constraints; identifying a subset of the potential boundaries as actual boundaries by eliminating from the set (i) potential boundaries identified from the graphical primitive elements that intersect with primitive elements that are not in the set of potential boundaries and (ii) potential boundaries identified from the graphical primitive elements that do not intersect at least two additional potential boundaries; identifying regions bounded by the actual boundaries; and defining a structured document based on the regions and the primitive elements. 9. The non-transitory machine readable medium of claim 1 , wherein the set of instructions for identifying regions bounded by the actual boundaries comprises sets of instructions for traversing the identified actual boundaries to identify closed loops of boundaries, wherein each closed loop is a region. | 0.5 |
8,554,538 | 18 | 19 | 18. The computer system of claim 15 , wherein the predefined name format requires the unique name to comprise at least a first term for an object class to which the data element relates, and wherein the name generating module uses the second noun as the first term. | 18. The computer system of claim 15 , wherein the predefined name format requires the unique name to comprise at least a first term for an object class to which the data element relates, and wherein the name generating module uses the second noun as the first term. 19. The computer system of claim 18 , wherein the predefined name format requires the unique name to comprise also a second term for a property of the object class, and wherein the name generating module uses another noun associated with the verb phrase as the second term. | 0.5 |
9,583,101 | 11 | 12 | 11. The apparatus according to claim 10 , wherein the operation of performing the corresponding operation further comprises: determining vocabulary content corresponding to the final user attribute recognition result; and performing a corresponding operation according to the content recognition result and the vocabulary content corresponding to the final user attribute recognition result. | 11. The apparatus according to claim 10 , wherein the operation of performing the corresponding operation further comprises: determining vocabulary content corresponding to the final user attribute recognition result; and performing a corresponding operation according to the content recognition result and the vocabulary content corresponding to the final user attribute recognition result. 12. The apparatus according to claim 11 , wherein the operations further comprise: presetting a user attribute, wherein the user attribute comprises at least a gender attribute and an age attribute; and presetting multiple vocabularies corresponding to the gender attribute and multiple vocabularies corresponding to the age attribute, and store correspondences; wherein the operation of determining the vocabulary content corresponding to the final user attribute recognition result further comprises: searching, in a preset correspondence between the gender attribute and a vocabulary and a preset correspondence between the age attribute and a vocabulary, for a vocabulary corresponding to the final user recognition result, and use a found vocabulary as the vocabulary content corresponding to the final user attribute recognition result. | 0.5 |
8,005,673 | 2 | 3 | 2. The voice recognition device as claimed in claim 1 , wherein the second parsing unit includes a calculation unit for calculating a word score based on features of the words contained in the text converted by the voice recognition unit, and identifies the second control candidate group by parsing the text with respect to the control objects which are among the predefined types of control objects but not included in the first control candidate group arid whose each word score satisfies a predefined condition. | 2. The voice recognition device as claimed in claim 1 , wherein the second parsing unit includes a calculation unit for calculating a word score based on features of the words contained in the text converted by the voice recognition unit, and identifies the second control candidate group by parsing the text with respect to the control objects which are among the predefined types of control objects but not included in the first control candidate group arid whose each word score satisfies a predefined condition. 3. The voice recognition device as claimed in claim 2 , wherein the second parsing unit calculates an average value of word scores for the words contained in the text and correspond to the control objects respectively, and uses the average value as the predefined condition if the average value is not smaller than a predefined threshold value. | 0.5 |
8,639,682 | 10 | 16 | 10. An apparatus comprising: at least one processor; and at least one storage device comprising instructions that, when executed, cause the at least one processor to: retrieve a first set of documents from a document repository based on a query, the first set of documents having first metadata values corresponding to a plurality of metadata attributes; characterize the first set of documents based on the first metadata values to provide a first document set characterization; store the first document set characterization to provide a stored first document set characterization; determine at least one candidate entity based on the first set of documents; for each of the at least one candidate entity, retrieve a second set of documents from the document repository based on the query and the candidate entity, the second set of documents having second metadata values corresponding to the plurality of metadata attributes; for each of the at least one candidate entity, characterize the second set of documents based on the second metadata values to provide a second document set characterization; and for each of the at least one candidate entity, compare the second document set characterization with the first stored document set characterization to determine a corresponding degree of similarity between the first document set characterization and the second document set characterization. | 10. An apparatus comprising: at least one processor; and at least one storage device comprising instructions that, when executed, cause the at least one processor to: retrieve a first set of documents from a document repository based on a query, the first set of documents having first metadata values corresponding to a plurality of metadata attributes; characterize the first set of documents based on the first metadata values to provide a first document set characterization; store the first document set characterization to provide a stored first document set characterization; determine at least one candidate entity based on the first set of documents; for each of the at least one candidate entity, retrieve a second set of documents from the document repository based on the query and the candidate entity, the second set of documents having second metadata values corresponding to the plurality of metadata attributes; for each of the at least one candidate entity, characterize the second set of documents based on the second metadata values to provide a second document set characterization; and for each of the at least one candidate entity, compare the second document set characterization with the first stored document set characterization to determine a corresponding degree of similarity between the first document set characterization and the second document set characterization. 16. The apparatus of claim 10 , wherein the instructions that, when executed, cause the at least one processor to determine the at least one candidate entity are further operative to: determine a citation frequency for each of the at least one candidate entity in at least some of the first set of documents; and identify a plurality of entities referenced in the first set of documents; determine, for each entity of the plurality of entities, a citation frequency for the entity in at least some of the first set of documents to provide a plurality of citation frequencies; and select, as the at least one candidate entity, at least a portion of the plurality of entities corresponding to that portion of the plurality of citation frequencies having largest values. | 0.5 |
9,776,073 | 1 | 5 | 1. A method of playing a word game among two or more participants, the method comprising: (a) providing a plurality of game pieces, wherein each of the game pieces includes a single two-letter word bit, each word bit being a fixed ordered two-letter combination; (b) providing a plurality of skill cards, wherein each skill card includes a target number of words of at least four letters, the target number of words on at least two of the skill cards being different from one another; (c) providing a first portion of the game pieces to each of the two or more participants to create a personal pool for each of the two or more participants; (d) providing each of the two or more participants with a respective one of the skill cards, wherein the target number of words on the respective skill card provided to each participant is based on a skill level of the corresponding participant; (e) providing a second portion of the game pieces into a supply pool; and (f) allowing each of the two or more participants to create words of at least four letters by combining the game pieces from the respective participant's personal pool; and (g) ending a round of play when a first of the participants create the target number of words assigned thereto by the corresponding skill card from the first of the participants' personal pool of game pieces. | 1. A method of playing a word game among two or more participants, the method comprising: (a) providing a plurality of game pieces, wherein each of the game pieces includes a single two-letter word bit, each word bit being a fixed ordered two-letter combination; (b) providing a plurality of skill cards, wherein each skill card includes a target number of words of at least four letters, the target number of words on at least two of the skill cards being different from one another; (c) providing a first portion of the game pieces to each of the two or more participants to create a personal pool for each of the two or more participants; (d) providing each of the two or more participants with a respective one of the skill cards, wherein the target number of words on the respective skill card provided to each participant is based on a skill level of the corresponding participant; (e) providing a second portion of the game pieces into a supply pool; and (f) allowing each of the two or more participants to create words of at least four letters by combining the game pieces from the respective participant's personal pool; and (g) ending a round of play when a first of the participants create the target number of words assigned thereto by the corresponding skill card from the first of the participants' personal pool of game pieces. 5. The method of claim 1 further comprising: (h) allowing each of the participants to exchange at least one game piece from the respective participant's personal pool for an equal number of game pieces from the supply pool. | 0.5 |
8,520,808 | 1 | 3 | 1. An interactive spoken dialog system, comprising: a computer including a processor, and non-transitory memory, including: a data store for storing recordings of interactions on the spoken dialog system; a data store for feature data defining a number of features, wherein the features include a set of features selected from the group of: the classification status of a call, the number of speech recognition errors during a call, the number of operator requests from a caller, and the exit status of the call; and an automated rater including a machine-learning algorithm configured to automatically estimate a user experience score for any set of interactions on the spoken dialog system. | 1. An interactive spoken dialog system, comprising: a computer including a processor, and non-transitory memory, including: a data store for storing recordings of interactions on the spoken dialog system; a data store for feature data defining a number of features, wherein the features include a set of features selected from the group of: the classification status of a call, the number of speech recognition errors during a call, the number of operator requests from a caller, and the exit status of the call; and an automated rater including a machine-learning algorithm configured to automatically estimate a user experience score for any set of interactions on the spoken dialog system. 3. The system of claim 1 wherein the automated rater automatically estimates the user experience score for any set of interactions on the interactive spoken dialog system for the same features. | 0.584052 |
6,072,494 | 38 | 40 | 38. A computer-implemented system for storing and recognizing gestures made by a moving subject within an image, the system comprising: means for building a background model by obtaining at least one frame of an image; means for obtaining a data frame containing a subject performing a part of a subject gesture; means for analyzing the data frame thereby determining particular coordinates of the subject at a particular time while the subject is performing the subject gesture; means for adding the particular coordinates to a frame data set; means for examining the particular coordinates such that the particular coordinates are compared to positional data making up a plurality of recognizable gestures, wherein a recognizable gesture is made up of at least one dimension such that the positional data describes dimensions of the recognized gesture; and means for determining whether a plurality of data frames, where a data frame is represented by the frame data set, when examined in a particular sequence, conveys a subject gesture by the subject that resembles a recognizable gesture, thereby causing an operation based on a predetermined meaning of the recognizable gesture be performed by a computer. | 38. A computer-implemented system for storing and recognizing gestures made by a moving subject within an image, the system comprising: means for building a background model by obtaining at least one frame of an image; means for obtaining a data frame containing a subject performing a part of a subject gesture; means for analyzing the data frame thereby determining particular coordinates of the subject at a particular time while the subject is performing the subject gesture; means for adding the particular coordinates to a frame data set; means for examining the particular coordinates such that the particular coordinates are compared to positional data making up a plurality of recognizable gestures, wherein a recognizable gesture is made up of at least one dimension such that the positional data describes dimensions of the recognized gesture; and means for determining whether a plurality of data frames, where a data frame is represented by the frame data set, when examined in a particular sequence, conveys a subject gesture by the subject that resembles a recognizable gesture, thereby causing an operation based on a predetermined meaning of the recognizable gesture be performed by a computer. 40. A system as recited in claim 38 wherein means for obtaining a data frame further includes means for separating the subject in the data frame into a plurality of identifiable parts wherein an identifiable part is assigned particular coordinates. | 0.851852 |
8,612,746 | 7 | 8 | 7. A method performed by one or more server devices, the method comprising: providing, by at least one of the one or more server devices and in a document, un-secure content and a reference associated with secure content, the un-secure content and the reference being included in a web feed, the secure content including at least one of text content, image content, or video content; sending, by at least one of the one or more server devices, a request for the secure content based on selection of the reference by a client device, the request being sent to a device associated with the secure content; receiving, by at least one of the one or more server devices, authentication information associated with the secure content after sending the request for the secure content, the authentication information being received from the client device, the authentication information identifying a user of the client device; sending, by at least one of the one or more server devices, the authentication information to the device associated with the secure content, the authentication information being sent to the device, associated with the secure content, to authenticate the user; receiving, by at least one of the one or more server devices, the secure content based on sending the authentication information to the device to authenticate the user, the secure content being received from the device associated with the secure content; and replacing, by at least one of the one or more server devices and in the document, the reference with the received secure content, replacing the reference including: replacing the reference with the at least one of the text content, the image content, or the video content to provide the at least one of the text content, the image content, or the video content within the document. | 7. A method performed by one or more server devices, the method comprising: providing, by at least one of the one or more server devices and in a document, un-secure content and a reference associated with secure content, the un-secure content and the reference being included in a web feed, the secure content including at least one of text content, image content, or video content; sending, by at least one of the one or more server devices, a request for the secure content based on selection of the reference by a client device, the request being sent to a device associated with the secure content; receiving, by at least one of the one or more server devices, authentication information associated with the secure content after sending the request for the secure content, the authentication information being received from the client device, the authentication information identifying a user of the client device; sending, by at least one of the one or more server devices, the authentication information to the device associated with the secure content, the authentication information being sent to the device, associated with the secure content, to authenticate the user; receiving, by at least one of the one or more server devices, the secure content based on sending the authentication information to the device to authenticate the user, the secure content being received from the device associated with the secure content; and replacing, by at least one of the one or more server devices and in the document, the reference with the received secure content, replacing the reference including: replacing the reference with the at least one of the text content, the image content, or the video content to provide the at least one of the text content, the image content, or the video content within the document. 8. The method of claim 7 , where the reference corresponds to an image element associated with the secure content. | 0.860294 |
8,713,018 | 16 | 17 | 16. A system according to claim 13 , wherein the similarity is determined by forming a score vector for each uncoded document and each coded reference document and calculating a similarity metric between the score vectors for the uncoded documents and coded reference documents as an inner product. | 16. A system according to claim 13 , wherein the similarity is determined by forming a score vector for each uncoded document and each coded reference document and calculating a similarity metric between the score vectors for the uncoded documents and coded reference documents as an inner product. 17. A system according to claim 16 , wherein the inner product is determined according to the following equation: cos σ AB = 〈 S → A · S → B 〉 S → A S → B where cos σ AB comprises a similarity between uncoded document A and coded reference document B, {right arrow over (S)} A comprises a score vector for the uncoded document A, and {right arrow over (S)} B comprises a score vector for the coded reference document B. | 0.5 |
8,646,075 | 3 | 4 | 3. The analysis system for unknown application layer protocols as in claim 2 , characterized in that, initial values of model parameter of the HSMM are selected as follows: a ij =1=/|S|, π i =1/|S|, k j (key)=1/|KEY|, 1 j,key (d)=ce −τ(d−|key|) , and for all i, jεS, keyεKEY, wherein [KEY] represents keyword number, |S|=M represents state number, |key| represents length of key, d represents length of the state, d−|key| represents the number of the rest characters except key in the duration of the state, τ represents an attenuation factor taking an empirical value of 5, c represents a normalization factor resulting in ∑ d ≥ key l j , key ( d ) = 1 ; method of defining variables of the HSMM is as follows: a t (i) represents a forward variable being defined as α t (j)=P[S t] =j,o 1:t |λ],β t (i) represents a backward variable being defined as β t (i)=P[o t+1:T |S t] =i,λ], and ξ t (i,j), ψ t (j,kl) and ζ i (j,key,d) represent intermediate variables being defined respectively as ξ t (i,j)=P[S t] =i,S [t+1 =j,o 1:t |], ω t (j,kl)=P[S [t+]:t+kl =j,o 1:t |λ], and ζ t (j,key,d)=P[S [t−d+1t] =j,o t−d+1t−d+|key| =key,o 1:T |λ], whereas kl≧I is an integer. | 3. The analysis system for unknown application layer protocols as in claim 2 , characterized in that, initial values of model parameter of the HSMM are selected as follows: a ij =1=/|S|, π i =1/|S|, k j (key)=1/|KEY|, 1 j,key (d)=ce −τ(d−|key|) , and for all i, jεS, keyεKEY, wherein [KEY] represents keyword number, |S|=M represents state number, |key| represents length of key, d represents length of the state, d−|key| represents the number of the rest characters except key in the duration of the state, τ represents an attenuation factor taking an empirical value of 5, c represents a normalization factor resulting in ∑ d ≥ key l j , key ( d ) = 1 ; method of defining variables of the HSMM is as follows: a t (i) represents a forward variable being defined as α t (j)=P[S t] =j,o 1:t |λ],β t (i) represents a backward variable being defined as β t (i)=P[o t+1:T |S t] =i,λ], and ξ t (i,j), ψ t (j,kl) and ζ i (j,key,d) represent intermediate variables being defined respectively as ξ t (i,j)=P[S t] =i,S [t+1 =j,o 1:t |], ω t (j,kl)=P[S [t+]:t+kl =j,o 1:t |λ], and ζ t (j,key,d)=P[S [t−d+1t] =j,o t−d+1t−d+|key| =key,o 1:T |λ], whereas kl≧I is an integer. 4. The analysis system for unknown application layer protocols as in claim 3 , characterized in that, an optimal partitioning method of observation sequence is field partitioning according to maximum likelihood probability; the method is detailed as follows: forward computation let
G(j, key, d)=k j (key)l j,key (d), and define δ t ( j , d ) ≡ max S 1 : t - d P [ S 1 : t - d , S [ t - d + 1 : t ] = j , o 1 ; t | λ ] = max i , d ′ , kl δ t - d ( i , d ′ ) a ij G ( j , o t - d + 1 : t - d + kl , d ) ( i * , d * , kl * ) = arg max i , d ′ , kl δ t - d ( i , d ′ ) a ij G ( j , o t - d + 1 : t - d + kl , d )
Ψ(t, j, d)=(t−d, i* , d*)
Key_ML(t, j, d)=o t−d+1:t−d+kl* next, let t 1 =T, and perform backtracking in a reversed direction: ( j 1 , d 1 ) = arg max i , d δ T ( i , d )
kw 1 =Key_ML(t 1 , j 1 , d 1 )
(t 2 , j 2 , d 2 )=Ψ(t 1 , j 1 , d 1 )
kw 2 =Key_ML(t 2 , j 2 , d 2 )
(t n , j n , d n )=Ψ(t n−1 , j n−1 , d n−1 )
kw n =Key_ML(t n , j n , d n ) algorithm ends when t n =1; state sequence [(i 1 , τ 1 ), . . . , (i n , τ n )] of maximum likelihood probability and keyword sequence [key 1 , . . . , key n ] included in the observation sequence are eventually obtained, wherein, i l =j n−l+1 is the l'th state, τ l =d n−l+1 is the duration of the l'th state, key l =kw n−l+1 is the keyword included in the field corresponding to the l'th state, and l=1, . . . , n. | 0.5 |
9,785,638 | 14 | 15 | 14. The system of claim 13 , wherein the search query further comprises a third search criteria. | 14. The system of claim 13 , wherein the search query further comprises a third search criteria. 15. The system of claim 14 , wherein the data analysis logic is configured to determine a third number of documents that satisfy the third search criteria. | 0.5 |
7,680,812 | 82 | 83 | 82. The method of claim 79 wherein said user is a member of at least two groups each with distinct read and write privileges. | 82. The method of claim 79 wherein said user is a member of at least two groups each with distinct read and write privileges. 83. The method of claim 82 , further comprising: performing link analysis of a graph that encompasses all documents available to said at least two groups. | 0.798429 |
9,940,326 | 2 | 4 | 2. The method of claim 1 , further comprising: generating, based on the received audio input, at least one signature by the plurality of computational cores of the natural liquid architecture, wherein the cluster of signatures is identified further based on the generated at least one signature. | 2. The method of claim 1 , further comprising: generating, based on the received audio input, at least one signature by the plurality of computational cores of the natural liquid architecture, wherein the cluster of signatures is identified further based on the generated at least one signature. 4. The method of claim 2 , each computational core of the plurality of computational cores having properties that are at least partly statistically independent of other of the computational cores, wherein the properties are set independently of each other core. | 0.543706 |
10,025,936 | 7 | 12 | 7. A method for detecting an evaluation flaw in a SQL query, said SQL query configured to access data in a database table, comprising: creating a parse tree from said SQL query; evaluating step-wise, using a bottom-up methodology, through said parse tree to ascertain whether said SQL query includes a condition for said data access that when evaluated would result in a value is independent of contents of said database table, wherein said evaluating said parse tree further including storing a value of a select list element for subsequent expression evaluation; performing said subsequent expression evaluation when said select list element is a part of a sub-query; when, responsive to said evaluating, said condition is found, determining whether said condition is always true or whether said condition is always false; when, responsive to said determining, said condition is found to be always true or always false, designating said SQL query at risk for having said evaluation flaw in said SQL query; and rewriting the SQL query to avoid repeated performance of the condition. | 7. A method for detecting an evaluation flaw in a SQL query, said SQL query configured to access data in a database table, comprising: creating a parse tree from said SQL query; evaluating step-wise, using a bottom-up methodology, through said parse tree to ascertain whether said SQL query includes a condition for said data access that when evaluated would result in a value is independent of contents of said database table, wherein said evaluating said parse tree further including storing a value of a select list element for subsequent expression evaluation; performing said subsequent expression evaluation when said select list element is a part of a sub-query; when, responsive to said evaluating, said condition is found, determining whether said condition is always true or whether said condition is always false; when, responsive to said determining, said condition is found to be always true or always false, designating said SQL query at risk for having said evaluation flaw in said SQL query; and rewriting the SQL query to avoid repeated performance of the condition. 12. The method of claim 7 , further comprising when said condition is found to be always true or always false, preventing said SQL query from executing. | 0.54491 |
7,839,511 | 10 | 11 | 10. A system for enhancement of an input document data stream which comprises at least one input format formdef file as an advanced function presentation (AFP) format definition resource file (formdef) comprising format definitions and an input document data file structured in ranges and sub-ranges and containing variable data, comprising: a print data processing computer having a control file defining finishing commands and enhancing the data stream with said finishing commands, said control file being generated by analyzing a data structure of the input document data file and mapping said data structure into said control file, and said finishing commands being automatically inserted into said formdef file which are invoked instead of original calls contained in the document data file; the control file also defining document levels that correspond to at least one of the ranges and the sub-ranges of the input document data files, the document levels on which specific ones of the finishing commands are to be applied being defined independent of said data structure of the document input file, said data processing computer comprising a first computer program module providing a graphical user interface by which a user specifies said levels within the data stream; the control file, also by use by the user of said graphical user interface also associating the finishing commands with the levels and registering which finishing commands are executed in which levels; the control file also associating a first of the finishing commands with one of the ranges and associating a second of the finishing commands with one of the sub-ranges; and said processing computer with a second computer program module using the control file, input format file, and the input document data file to automatically generate and output to a printing device for creating a printed document an output format file as an advanced function presentation (AFP) format definition resource file (formdef) that contains the finishing commands in callable groups, the output format formdef file being provided with modified medium maps relative to the formdef file, and an output document data file containing the variable data and group calls associated by at least one of range-by-range and sub-range-by-sub-range. | 10. A system for enhancement of an input document data stream which comprises at least one input format formdef file as an advanced function presentation (AFP) format definition resource file (formdef) comprising format definitions and an input document data file structured in ranges and sub-ranges and containing variable data, comprising: a print data processing computer having a control file defining finishing commands and enhancing the data stream with said finishing commands, said control file being generated by analyzing a data structure of the input document data file and mapping said data structure into said control file, and said finishing commands being automatically inserted into said formdef file which are invoked instead of original calls contained in the document data file; the control file also defining document levels that correspond to at least one of the ranges and the sub-ranges of the input document data files, the document levels on which specific ones of the finishing commands are to be applied being defined independent of said data structure of the document input file, said data processing computer comprising a first computer program module providing a graphical user interface by which a user specifies said levels within the data stream; the control file, also by use by the user of said graphical user interface also associating the finishing commands with the levels and registering which finishing commands are executed in which levels; the control file also associating a first of the finishing commands with one of the ranges and associating a second of the finishing commands with one of the sub-ranges; and said processing computer with a second computer program module using the control file, input format file, and the input document data file to automatically generate and output to a printing device for creating a printed document an output format file as an advanced function presentation (AFP) format definition resource file (formdef) that contains the finishing commands in callable groups, the output format formdef file being provided with modified medium maps relative to the formdef file, and an output document data file containing the variable data and group calls associated by at least one of range-by-range and sub-range-by-sub-range. 11. A system according to claim 10 wherein the output document data file is fed to a data production system that comprises said printing device and at least one device for processing of a print product at least one of before and after the printing event, and wherein the finishing commands activate at least one of the devices for processing of the print product at least one of before and after a printing event. | 0.5 |
6,105,036 | 1 | 3 | 1. A method of displaying on a computer display a source code file including an ordered arrangement of a plurality of object definitions that define a plurality of multimedia objects, the method comprising: (a) displaying at least a portion of the plurality of object definitions in first representations on the computer display; and (b) in response to user input, selectively displaying on the computer display, in place of the first representation of a selected object definition, an inlined multimedia representation of the selected object definition disposed at a relative location of the selected object definition in the ordered arrangement. | 1. A method of displaying on a computer display a source code file including an ordered arrangement of a plurality of object definitions that define a plurality of multimedia objects, the method comprising: (a) displaying at least a portion of the plurality of object definitions in first representations on the computer display; and (b) in response to user input, selectively displaying on the computer display, in place of the first representation of a selected object definition, an inlined multimedia representation of the selected object definition disposed at a relative location of the selected object definition in the ordered arrangement. 3. The method of claim 1, wherein the source code file is written in a hierarchical scene description language, wherein the ordered arrangement defines a plurality of hierarchical levels, with each object definition arranged at one of the plurality of hierarchical levels. | 0.732809 |
9,311,361 | 7 | 9 | 7. A system for algorithmically determining a visual appeal of content items, said system comprising: a processor; and a computer-readable memory device having encoded thereon computer readable instructions that when executed by the processor cause the processor to: store a plurality of software implemented algorithms in the memory device, each algorithm comprising one or more rules representing expert knowledge for subject matter of online content items, the rules are capable of recognizing graphic content parameters, recognizing textual content parameters, and relating the graphic content parameters and the textual content parameters to a set of desired parameters accessible to the rules based on the expert knowledge, the parameters relating to the appearance of the graphic content and the textual content, each algorithm pertains to a different aspect of online content; receive one or more generated items of online content from a content provider computing device; determine graphic content parameters and textual content parameters of the received items of online content, by parsing the online content using the plurality of algorithms according to the different rules included in each algorithm, wherein determining the graphic content parameters and textual content parameters include determining a relative size of a font with respect to other textual content, a location of the textual content within the content item, a location of breaks used in text wrapping in the textual content, a relative alignment of the textual content, a readability of the textual content based on font colors and background colors, and an orientation of graphic objects within the content item; compare the determined parameters to the set of desired parameters, by determining whether each aspect meets a respective predefined threshold value; rank the items of online content based on the comparisons; and provide guidance for improving a quality of the items of online content by outputting the ranked items of online content to the content provider computing device. | 7. A system for algorithmically determining a visual appeal of content items, said system comprising: a processor; and a computer-readable memory device having encoded thereon computer readable instructions that when executed by the processor cause the processor to: store a plurality of software implemented algorithms in the memory device, each algorithm comprising one or more rules representing expert knowledge for subject matter of online content items, the rules are capable of recognizing graphic content parameters, recognizing textual content parameters, and relating the graphic content parameters and the textual content parameters to a set of desired parameters accessible to the rules based on the expert knowledge, the parameters relating to the appearance of the graphic content and the textual content, each algorithm pertains to a different aspect of online content; receive one or more generated items of online content from a content provider computing device; determine graphic content parameters and textual content parameters of the received items of online content, by parsing the online content using the plurality of algorithms according to the different rules included in each algorithm, wherein determining the graphic content parameters and textual content parameters include determining a relative size of a font with respect to other textual content, a location of the textual content within the content item, a location of breaks used in text wrapping in the textual content, a relative alignment of the textual content, a readability of the textual content based on font colors and background colors, and an orientation of graphic objects within the content item; compare the determined parameters to the set of desired parameters, by determining whether each aspect meets a respective predefined threshold value; rank the items of online content based on the comparisons; and provide guidance for improving a quality of the items of online content by outputting the ranked items of online content to the content provider computing device. 9. The system of claim 7 , wherein the computer readable instructions when executed by the processor cause the processor to determine parameters that relate to the semantics of the textual content, where semantics include meaning, emotion, feeling, and memories. | 0.60303 |
10,157,086 | 1 | 4 | 1. An apparatus comprising a processor and a storage to store instructions that, when executed by the processor, cause the processor to perform operations comprising: receive, at a portal, and from a requesting device via a network, a first request to provide objects to the requesting device to enable the requesting device to generate a visualization of a first directed acyclic graph (DAG) of multiple task routines of a first job flow of a first analysis routine, wherein: the portal is provided on the network to control access to at least one federated area by the requesting device via the network; the at least one federated area is maintained within one or more storage devices to store a plurality of data objects, a plurality of task routines and a plurality of job flow definitions; each task routine of the plurality of task routines comprises comments that specify input and output (I/O) parameters that comprise at least one characteristic of an input to the task routine and at least one characteristic of an output generated during execution of the task routine; the I/O parameters of the comments of a subset of task routines of the plurality of task routines comprises an identifier of at least one data object of the plurality of data objects; each task routine of the multiple task routines comprises executable instructions to perform a task when executed; and each job flow definition specifies multiple tasks of a job flow of an analysis routine to be performed by task routines of the plurality of task routines; retrieve each task routine of the multiple task routines from the at least one federated area; parse the comments of each task routine of the multiple task routines to identify and retrieve the specification of the I/O parameters of the task routine from the comments; for each task routine of the multiple task routines, generate a corresponding macro of multiple macros that comprises an indication of the I/O parameters of the task routine; transmit the multiple macros to the requesting device via the network to enable the requesting device to generate, from the multiple macros, the visualization of the first DAG to include a visual representation of each task routine of the multiple task routines, and to enable the requesting device to visually output the visualization for display, wherein: each representation of a task routine comprises: a task graph object comprising an identifier of the task routine; at least one input data graph object that represents an input to the task routine, that is visually connected to the task graph object in the visualization, and that comprises a visual indication of the at least one characteristic of the input; and at least one output data graph object that represents an output of the task routine, that is visually connected to the task graph object in the visualization, and that comprises an indication of the at least one characteristic of the output; and to generate the visualization, the requesting device is to: compare identifiers of data objects in the I/O parameters specified in the comments among the multiple task routines to identify each dependency between an output of one task routine and an input of another task routine; and for each dependency identified between an output and an input of a pair of task routines of the multiple task routines, visually present a dependency marker that visually links the visual representations of the pair of task routines in the visualization; receive a second request from the requesting device to store a second DAG based on the visualization as edited in response to at least one command, wherein: the second DAG depicts a reuse of a portion of the first job flow depicted in the first DAG to define at least a portion of a second job flow of a second analysis routine derived from the first analysis routine; and at least a subset of task routines to be executed in a performance of the first job flow, as indicated in the first DAG, are to be executed in a performance of the second job flow, as indicated in the second DAG; determine whether each task routine identified in the second DAG is stored within the at least one federated area or is included in the second request; determine whether each task data object identified in the second DAG is stored within the at least one federated area or is included in the second request; and in response to a determination that each task routine identified in the second DAG and each data object identified in the second DAG is stored within the at least one federated area or is included in the second request, store the second DAG as a second job flow definition among the plurality of job flow definitions. | 1. An apparatus comprising a processor and a storage to store instructions that, when executed by the processor, cause the processor to perform operations comprising: receive, at a portal, and from a requesting device via a network, a first request to provide objects to the requesting device to enable the requesting device to generate a visualization of a first directed acyclic graph (DAG) of multiple task routines of a first job flow of a first analysis routine, wherein: the portal is provided on the network to control access to at least one federated area by the requesting device via the network; the at least one federated area is maintained within one or more storage devices to store a plurality of data objects, a plurality of task routines and a plurality of job flow definitions; each task routine of the plurality of task routines comprises comments that specify input and output (I/O) parameters that comprise at least one characteristic of an input to the task routine and at least one characteristic of an output generated during execution of the task routine; the I/O parameters of the comments of a subset of task routines of the plurality of task routines comprises an identifier of at least one data object of the plurality of data objects; each task routine of the multiple task routines comprises executable instructions to perform a task when executed; and each job flow definition specifies multiple tasks of a job flow of an analysis routine to be performed by task routines of the plurality of task routines; retrieve each task routine of the multiple task routines from the at least one federated area; parse the comments of each task routine of the multiple task routines to identify and retrieve the specification of the I/O parameters of the task routine from the comments; for each task routine of the multiple task routines, generate a corresponding macro of multiple macros that comprises an indication of the I/O parameters of the task routine; transmit the multiple macros to the requesting device via the network to enable the requesting device to generate, from the multiple macros, the visualization of the first DAG to include a visual representation of each task routine of the multiple task routines, and to enable the requesting device to visually output the visualization for display, wherein: each representation of a task routine comprises: a task graph object comprising an identifier of the task routine; at least one input data graph object that represents an input to the task routine, that is visually connected to the task graph object in the visualization, and that comprises a visual indication of the at least one characteristic of the input; and at least one output data graph object that represents an output of the task routine, that is visually connected to the task graph object in the visualization, and that comprises an indication of the at least one characteristic of the output; and to generate the visualization, the requesting device is to: compare identifiers of data objects in the I/O parameters specified in the comments among the multiple task routines to identify each dependency between an output of one task routine and an input of another task routine; and for each dependency identified between an output and an input of a pair of task routines of the multiple task routines, visually present a dependency marker that visually links the visual representations of the pair of task routines in the visualization; receive a second request from the requesting device to store a second DAG based on the visualization as edited in response to at least one command, wherein: the second DAG depicts a reuse of a portion of the first job flow depicted in the first DAG to define at least a portion of a second job flow of a second analysis routine derived from the first analysis routine; and at least a subset of task routines to be executed in a performance of the first job flow, as indicated in the first DAG, are to be executed in a performance of the second job flow, as indicated in the second DAG; determine whether each task routine identified in the second DAG is stored within the at least one federated area or is included in the second request; determine whether each task data object identified in the second DAG is stored within the at least one federated area or is included in the second request; and in response to a determination that each task routine identified in the second DAG and each data object identified in the second DAG is stored within the at least one federated area or is included in the second request, store the second DAG as a second job flow definition among the plurality of job flow definitions. 4. The apparatus of claim 1 , wherein: to identify the multiple task routines, the first request comprises an instance log identifier of an instance log that documents a performance of the multiple tasks of the first job flow; the instance log comprises a task routine identifier for each task routine of the multiple task routines; and the processor is caused to perform operations comprising: store a plurality of instance logs within the at least one federated area; use the instance log identifier of the first request to retrieve the instance log from among the plurality of instance logs; and use the task routine identifiers of the instance log to retrieve the multiple task routines from among the plurality of task routines. | 0.703958 |
7,689,554 | 1 | 19 | 1. A method for identifying one or more queries related to a given query, the method comprising: receiving a query written according to one or more writing systems of a language with multiple writing systems; identifying a candidate set of queries written according to one or more writing systems of the language with multiple writing systems; calculating a number of common characters in a given candidate query before disagreement with the query received; calculating a number of total common characters between the given candidate query and the query received; calculating a quotient of the frequency with which a selected query from the candidate set follows the received query in one or more query logs and the frequency of the received query in the one or more query logs; and calculating a similarity score on the basis of the number of characters before disagreements, the number of total common characters and the quotient of the frequency with which a selected query from the candidate set follows the received query in one or more query logs and the frequency of the received query in the one or more query logs, wherein the similarity score indicates the similarity of the one or more queries with respect to the query received. | 1. A method for identifying one or more queries related to a given query, the method comprising: receiving a query written according to one or more writing systems of a language with multiple writing systems; identifying a candidate set of queries written according to one or more writing systems of the language with multiple writing systems; calculating a number of common characters in a given candidate query before disagreement with the query received; calculating a number of total common characters between the given candidate query and the query received; calculating a quotient of the frequency with which a selected query from the candidate set follows the received query in one or more query logs and the frequency of the received query in the one or more query logs; and calculating a similarity score on the basis of the number of characters before disagreements, the number of total common characters and the quotient of the frequency with which a selected query from the candidate set follows the received query in one or more query logs and the frequency of the received query in the one or more query logs, wherein the similarity score indicates the similarity of the one or more queries with respect to the query received. 19. The method of claim 1 wherein calculating a score comprises identifying whether either the received query or a selected query from the candidate set contain a non-Roman character. | 0.870945 |
7,979,417 | 11 | 12 | 11. The method of claim 1 , wherein one or more of the parameter values in the one or more information pairs are encrypted. | 11. The method of claim 1 , wherein one or more of the parameter values in the one or more information pairs are encrypted. 12. The method of claim 11 , wherein the one or more encrypted values are encrypted using a key from a non-symmetric key pair. | 0.5 |
7,606,168 | 1 | 4 | 1. A method comprising the steps of: analyzing a plurality of exchanged messages by an analysis mechanism residing in a memory coupled to at least one processor; constructing a social network based on said plurality of exchanged messages; extracting a plurality of concepts from said plurality of exchanged messages based on said social network; creating a semantic network from said plurality of concepts; displaying a visual representation of said social network on a monitor, thereby creating a social network visualization said step of displaying a visual representation of said social network on a monitor comprising the step of displaying at least two of: a layered digraph representing said social network; a force directed graph representing said social network; a circular layout graph representing said social network; a radial view graph representing said social network; and a time based message graph, said time based message graph comprising a plurality of nodes, wherein each node represents a message exchanged between at least two entities; and displaying said plurality of concepts on said monitor in concert with said social network visualization. | 1. A method comprising the steps of: analyzing a plurality of exchanged messages by an analysis mechanism residing in a memory coupled to at least one processor; constructing a social network based on said plurality of exchanged messages; extracting a plurality of concepts from said plurality of exchanged messages based on said social network; creating a semantic network from said plurality of concepts; displaying a visual representation of said social network on a monitor, thereby creating a social network visualization said step of displaying a visual representation of said social network on a monitor comprising the step of displaying at least two of: a layered digraph representing said social network; a force directed graph representing said social network; a circular layout graph representing said social network; a radial view graph representing said social network; and a time based message graph, said time based message graph comprising a plurality of nodes, wherein each node represents a message exchanged between at least two entities; and displaying said plurality of concepts on said monitor in concert with said social network visualization. 4. The method of claim 1 wherein each of said plurality of links and said plurality of nodes is linked to a concepts database and further comprising the step of activating a link or node by clicking on said link or node, thereby extracting and displaying at least one concept from said concepts database. | 0.575419 |
8,605,996 | 14 | 16 | 14. A method, comprising: selecting, by a processor, a trained classifier associated with a source domain to train a target classifier associated with a target domain, the trained classifier comprising identifiers that are used to predict a sentiment of opinion data of the source domain; and populating the target classifier with at least one of the identifiers, the target classifier being configured to classify opinion data of the target domain using the identifiers. | 14. A method, comprising: selecting, by a processor, a trained classifier associated with a source domain to train a target classifier associated with a target domain, the trained classifier comprising identifiers that are used to predict a sentiment of opinion data of the source domain; and populating the target classifier with at least one of the identifiers, the target classifier being configured to classify opinion data of the target domain using the identifiers. 16. The method of claim 14 , further comprising: sorting the opinion data of the target domain into groups based at least in part on the occurrence of a particular identifier in the opinion data, wherein the particular identifier is labeled with a known sentiment; creating an additional identifier based at least in part on the occurrence of a term that is used a predefined number of times in one of the groups; and assigning the known sentiment to the additional identifier. | 0.5 |
9,501,761 | 1 | 3 | 1. A computer-implemented method, comprising: storing first graph state information representing a pre-redacted graph having nodes and edges; wherein the pre-redacted graph represents results of a first user's investigation involving a plurality of data objects and links therebetween; wherein a particular edge of the pre-redacted graph corresponds to a particular link connecting a first data object of the plurality of data objects with a second data object of the plurality of data objects; wherein the plurality of data objects and the links therebetween are associated with access control lists governing access to the data objects and the links; causing, based on the first graph state information, a visualization of the pre-redacted graph to be displayed on a video display; receiving, based on user input from the first user, information that identifies a set of target users; in response to receiving the information that identifies the set of target users, automatically determining a common access control level of the set of target users; after causing the visualization of the pre-redacted graph to be displayed, automatically generating, based at least in part on the common access control level and the access control lists, second graph state information representing a redacted graph having one or more nodes or edges of the pre-redacted graph redacted; causing, based on the second graph state information, a visualization of the redacted graph to be displayed on the video display; wherein the visualization of the redacted graph indicates the one or more nodes or edges of the pre-redacted graph that were redacted; after causing the visualization of the redacted graph to be displayed on the video display and responsive to receiving an indication of acceptance by the first user of the redacted graph, publishing the second graph state information to a graph repository; wherein the method is performed by one or more computing devices. | 1. A computer-implemented method, comprising: storing first graph state information representing a pre-redacted graph having nodes and edges; wherein the pre-redacted graph represents results of a first user's investigation involving a plurality of data objects and links therebetween; wherein a particular edge of the pre-redacted graph corresponds to a particular link connecting a first data object of the plurality of data objects with a second data object of the plurality of data objects; wherein the plurality of data objects and the links therebetween are associated with access control lists governing access to the data objects and the links; causing, based on the first graph state information, a visualization of the pre-redacted graph to be displayed on a video display; receiving, based on user input from the first user, information that identifies a set of target users; in response to receiving the information that identifies the set of target users, automatically determining a common access control level of the set of target users; after causing the visualization of the pre-redacted graph to be displayed, automatically generating, based at least in part on the common access control level and the access control lists, second graph state information representing a redacted graph having one or more nodes or edges of the pre-redacted graph redacted; causing, based on the second graph state information, a visualization of the redacted graph to be displayed on the video display; wherein the visualization of the redacted graph indicates the one or more nodes or edges of the pre-redacted graph that were redacted; after causing the visualization of the redacted graph to be displayed on the video display and responsive to receiving an indication of acceptance by the first user of the redacted graph, publishing the second graph state information to a graph repository; wherein the method is performed by one or more computing devices. 3. The method of claim 1 , wherein a particular group node of the pre-redacted graph corresponds to a particular set of data objects of the plurality of data objects; and wherein generating the second graph state information representing the redacted graph includes determining not to include the particular group node in the redacted graph in response to determining, based on the common access control level and one or more access control lists associated with the particular set of data objects, that the common access control level does not have permission to view a data object of the particular set of data objects. | 0.551301 |
7,966,554 | 25 | 29 | 25. The apparatus of claim 15 wherein said first marker audio data are delivered on said user interface as a selectable connection which when selected will enable said processor to deliver to said user interface corresponding said second marker text. | 25. The apparatus of claim 15 wherein said first marker audio data are delivered on said user interface as a selectable connection which when selected will enable said processor to deliver to said user interface corresponding said second marker text. 29. The apparatus of claim 25 wherein said third marker in the visual data delivered to said user interface is represented on said user interface as a selectable connection which when selected will enable said processor to deliver to said user interface corresponding said first marker audio data. | 0.543077 |
10,133,728 | 1 | 2 | 1. A system comprising: one or more processors; and memory storing instructions that, when executed by the one or more processors, configure the one or more processors to perform operations comprising: receiving one or more syntactic dependency trees; accessing a database, wherein the database comprises a first event and a second event, wherein the first event comprises a first event type, a first cause entity, and a first theme entity, and wherein the second event comprises a nested structure including the first event, wherein the second event comprises a second event type, a second cause entity, and a second theme entity, wherein one of the second cause entity and the second theme entity is the first event, and wherein an event type comprises an action by a cause entity, and wherein the cause entity comprises at least one causal entity, and a theme entity comprises at least one resultant entity caused by the at least one causal entity through imposing the event type; performing semantic parsing on the one or more syntactic dependency trees to form one or more annotated dependency trees, wherein the semantic parsing further comprises: mapping each node of a plurality of nodes in the one or more syntactic dependency trees to an event state based on the database, the event state comprises one of the first event type, the second event type, and a null value; and mapping each edge of a plurality of dependency edges in the one or more syntactic dependency trees to an argument state based on the database, the argument state comprises one of the first cause entity, the first theme entity, the second cause entity, the second theme entity, and a null value; extracting, by the one or more processors, the first event from the one or more annotated dependency trees; extracting, by the one or more processors, the second event from the one or more annotated dependency trees, wherein the second event comprises a nested structure including the first event; and generating, by the one or more processors, an event table, based at least in part on the first event and the second event, wherein the event table comprises: an event type, an event cause entity, and an event theme entity. | 1. A system comprising: one or more processors; and memory storing instructions that, when executed by the one or more processors, configure the one or more processors to perform operations comprising: receiving one or more syntactic dependency trees; accessing a database, wherein the database comprises a first event and a second event, wherein the first event comprises a first event type, a first cause entity, and a first theme entity, and wherein the second event comprises a nested structure including the first event, wherein the second event comprises a second event type, a second cause entity, and a second theme entity, wherein one of the second cause entity and the second theme entity is the first event, and wherein an event type comprises an action by a cause entity, and wherein the cause entity comprises at least one causal entity, and a theme entity comprises at least one resultant entity caused by the at least one causal entity through imposing the event type; performing semantic parsing on the one or more syntactic dependency trees to form one or more annotated dependency trees, wherein the semantic parsing further comprises: mapping each node of a plurality of nodes in the one or more syntactic dependency trees to an event state based on the database, the event state comprises one of the first event type, the second event type, and a null value; and mapping each edge of a plurality of dependency edges in the one or more syntactic dependency trees to an argument state based on the database, the argument state comprises one of the first cause entity, the first theme entity, the second cause entity, the second theme entity, and a null value; extracting, by the one or more processors, the first event from the one or more annotated dependency trees; extracting, by the one or more processors, the second event from the one or more annotated dependency trees, wherein the second event comprises a nested structure including the first event; and generating, by the one or more processors, an event table, based at least in part on the first event and the second event, wherein the event table comprises: an event type, an event cause entity, and an event theme entity. 2. The system of claim 1 , wherein the syntactic dependency trees are derived from unannotated text, and wherein generating the event table is based, at least in part, on the unannotated text. | 0.625 |
9,201,868 | 1 | 2 | 1. A method implemented on a computer comprising a processor, and for performing actions on a multi-term text unit based on a derived semantic attribute or attribute value, the method comprising: receiving a text content comprising multiple text units, each text unit comprising at least a portion of a phrase or a sentence consisting of multiple terms, each term comprising a word or a phrase in a language; identifying, in the text content, a text unit, wherein the text unit comprises a first term and a second term, wherein neither the first term nor the second term includes a grammatically defined negator or negation word; obtaining a derived semantic attribute or attribute value for the text unit as a whole based on the first term and the second term; and performing an action on the text unit based on the derived semantic attribute or attribute value, wherein the action includes extracting the text unit for display or storage, marking the text unit for display in a format that is different from the display format of the text elements adjacent to the text unit in the text content, or displaying the text unit in a format that is different from the display format of the text elements adjacent to the text unit in the text content; wherein the steps for obtaining the derived semantic attribute or attribute value for the text unit as a whole include the following: receiving a name or description of a semantic attribute, wherein the embodiment of the semantic attribute includes an attribute name or description, an attribute type or attribute value, wherein the semantic attribute comprises a first value and a second value each representing a meaning carried by a term in the language, wherein an example of the semantic attribute comprises a sentiment or opinion, and when the semantic attribute is a sentiment or opinion, each of the first value and the second value is either a positive value or a negative value, but not a neutral value; identifying the first term in the text unit, wherein the first term is associated with the first value; identifying the second term in the text unit, wherein the second term is associated with the second value; determining the derived semantic attribute or attribute value for the text unit as a whole based on the first term and the second term, and the first value and the second value. | 1. A method implemented on a computer comprising a processor, and for performing actions on a multi-term text unit based on a derived semantic attribute or attribute value, the method comprising: receiving a text content comprising multiple text units, each text unit comprising at least a portion of a phrase or a sentence consisting of multiple terms, each term comprising a word or a phrase in a language; identifying, in the text content, a text unit, wherein the text unit comprises a first term and a second term, wherein neither the first term nor the second term includes a grammatically defined negator or negation word; obtaining a derived semantic attribute or attribute value for the text unit as a whole based on the first term and the second term; and performing an action on the text unit based on the derived semantic attribute or attribute value, wherein the action includes extracting the text unit for display or storage, marking the text unit for display in a format that is different from the display format of the text elements adjacent to the text unit in the text content, or displaying the text unit in a format that is different from the display format of the text elements adjacent to the text unit in the text content; wherein the steps for obtaining the derived semantic attribute or attribute value for the text unit as a whole include the following: receiving a name or description of a semantic attribute, wherein the embodiment of the semantic attribute includes an attribute name or description, an attribute type or attribute value, wherein the semantic attribute comprises a first value and a second value each representing a meaning carried by a term in the language, wherein an example of the semantic attribute comprises a sentiment or opinion, and when the semantic attribute is a sentiment or opinion, each of the first value and the second value is either a positive value or a negative value, but not a neutral value; identifying the first term in the text unit, wherein the first term is associated with the first value; identifying the second term in the text unit, wherein the second term is associated with the second value; determining the derived semantic attribute or attribute value for the text unit as a whole based on the first term and the second term, and the first value and the second value. 2. The method of claim 1 , wherein the first value represents a meaning that is in contrast with or opposite to the meaning represented by the second value. | 0.823529 |
8,909,513 | 17 | 20 | 17. A non-transitory computer-readable medium having instruction stored there on that, when executed by one or more computers, causes the computers to perform operations comprising: selecting one or more segments from a text field, wherein each of the segments is in proximity to a current position of an input cursor in the text field; analyzing the segments to determine a respective context for each of the segments, wherein the context is at least one of a respective target subtext or a respective target meaning of the segment; for one or more of the segments, identifying a respective candidate emoticon for the segment based on an association between the candidate emoticon and the context of the segment, the association exceeding a threshold value and being based on, at least, statistical usage of the candidate emoticon for the context by one or more users, wherein a strength of the association varies according to the statistical usage; providing one or more of the candidate emoticons for user selection, the candidate emoticons for user selection being based on at least one of a user preference, user-related information, and recipient-related information; receiving user selection of one or more of the provided emoticons and inserting the selected emoticons into the text field at the current position of the input cursor; and updating the statistical usage of at least one of the provided emoticons based on the user selection. | 17. A non-transitory computer-readable medium having instruction stored there on that, when executed by one or more computers, causes the computers to perform operations comprising: selecting one or more segments from a text field, wherein each of the segments is in proximity to a current position of an input cursor in the text field; analyzing the segments to determine a respective context for each of the segments, wherein the context is at least one of a respective target subtext or a respective target meaning of the segment; for one or more of the segments, identifying a respective candidate emoticon for the segment based on an association between the candidate emoticon and the context of the segment, the association exceeding a threshold value and being based on, at least, statistical usage of the candidate emoticon for the context by one or more users, wherein a strength of the association varies according to the statistical usage; providing one or more of the candidate emoticons for user selection, the candidate emoticons for user selection being based on at least one of a user preference, user-related information, and recipient-related information; receiving user selection of one or more of the provided emoticons and inserting the selected emoticons into the text field at the current position of the input cursor; and updating the statistical usage of at least one of the provided emoticons based on the user selection. 20. The computer-readable medium of claim 17 wherein providing one or more of the candidate emoticons for user selection comprises displaying the set of candidate emoticons on a physical input device or a virtual input device, wherein the physical input device and the virtual input device are configured to receive the entry selection. | 0.5 |
7,979,267 | 18 | 24 | 18. One or more processor readable storage devices having processor readable code embodied on the processor readable storage devices, the processor readable code for programming one or more processors to perform a method comprising: receiving a first input at a user interface of a computing device for a first field of a natural language expression, the first input indicates a first data value for the first field; accessing options for a second field of the natural language expression that are determined based on the first data value and data stored in data group; displaying the second field and the options for the second field; receiving a second input at the user interface for the second field of the natural language expression, the second input indicates a second data value for the second field from the options for the second field; accessing options for a third field of the natural language expression that are determined based on the second data value and data stored in the data group; displaying the third field and the options for the third field; receiving a third input at the user interface for the third field of the natural language expression, the third input indicates a third data value for the third field, the second data value indicates a relationship between the first data value and the third data value that exists in the data group, a result of receiving the third input is an updated version of the natural language expression that includes the first data value, the second data value and the third data value as natural language; and accessing and reporting a subset of the data group that corresponds to the natural language expression that includes the first data value, the second data value and the third data value as natural language. | 18. One or more processor readable storage devices having processor readable code embodied on the processor readable storage devices, the processor readable code for programming one or more processors to perform a method comprising: receiving a first input at a user interface of a computing device for a first field of a natural language expression, the first input indicates a first data value for the first field; accessing options for a second field of the natural language expression that are determined based on the first data value and data stored in data group; displaying the second field and the options for the second field; receiving a second input at the user interface for the second field of the natural language expression, the second input indicates a second data value for the second field from the options for the second field; accessing options for a third field of the natural language expression that are determined based on the second data value and data stored in the data group; displaying the third field and the options for the third field; receiving a third input at the user interface for the third field of the natural language expression, the third input indicates a third data value for the third field, the second data value indicates a relationship between the first data value and the third data value that exists in the data group, a result of receiving the third input is an updated version of the natural language expression that includes the first data value, the second data value and the third data value as natural language; and accessing and reporting a subset of the data group that corresponds to the natural language expression that includes the first data value, the second data value and the third data value as natural language. 24. One or more processor readable storage devices according to claim 18 , wherein: the receiving the second input at the user interface for the second field of the natural language expression includes receiving text and matching the text to one of the options for the second field. | 0.770358 |
7,519,822 | 1 | 7 | 1. A method of processing information representing a graph, comprising: serializing each of multiple statements; using a digital processor to independently compute a hash value for each of the multiple statements; and applying a commutative function to each hash value, to obtain an aggregate hash value representing all of the multiple statements. | 1. A method of processing information representing a graph, comprising: serializing each of multiple statements; using a digital processor to independently compute a hash value for each of the multiple statements; and applying a commutative function to each hash value, to obtain an aggregate hash value representing all of the multiple statements. 7. A method according to claim 1 , further comprising: identifying a public key; and using the digital processor to authenticate the graph, including using the public key to decrypt a verification hash, comparing the aggregate hash value to the verification hash, and determining that the graph is authentic in dependence on the comparison. | 0.619687 |
7,478,047 | 50 | 51 | 50. The computer readable medium of claim 49 wherein said mental state further comprises a defined emotional state. | 50. The computer readable medium of claim 49 wherein said mental state further comprises a defined emotional state. 51. The computer readable medium of claim 50 wherein said modification of pitch or duration is based at least in part on the degree of intensity of said defined emotional state. | 0.5 |
8,488,886 | 1 | 5 | 1. A method, comprising: receiving, by at least one computing device, a glyph; reducing, by the at least one computing device, the received glyph to a predefined format; normalizing, by the at least one computing device, the reduced glyph; comparing, by the at least one computing device, the normalized glyph to a plurality of image prototypes; and outputting, by the at least one computing device, at least one of the plurality of image prototypes based on the comparison of the normalized glyph to the plurality of image prototypes, wherein comparing the normalized glyph to the plurality of image prototypes includes: determining a number of rows in the normalized glyph and a number of rows in a selected one of the plurality of image prototypes; for the lesser of the number of rows in the normalized glyph and the number of rows in the selected one of the plurality of image prototypes, exclusive-or'ing (xor'ing) pixels of the normalized glyph with corresponding pixels of the selected one of the plurality of image prototypes; accumulating a result of the xor'ing of the pixels of the normalized glyph with the corresponding pixels of the selected one of the plurality of image prototypes; for each row of the normalized glyph and the selected one of the plurality of image prototypes that was not xor'ed, adding to the result a number corresponding to the number of pixels ‘on’ in the normalized glyph or the selected one of the plurality of image prototypes; and saving the added result. | 1. A method, comprising: receiving, by at least one computing device, a glyph; reducing, by the at least one computing device, the received glyph to a predefined format; normalizing, by the at least one computing device, the reduced glyph; comparing, by the at least one computing device, the normalized glyph to a plurality of image prototypes; and outputting, by the at least one computing device, at least one of the plurality of image prototypes based on the comparison of the normalized glyph to the plurality of image prototypes, wherein comparing the normalized glyph to the plurality of image prototypes includes: determining a number of rows in the normalized glyph and a number of rows in a selected one of the plurality of image prototypes; for the lesser of the number of rows in the normalized glyph and the number of rows in the selected one of the plurality of image prototypes, exclusive-or'ing (xor'ing) pixels of the normalized glyph with corresponding pixels of the selected one of the plurality of image prototypes; accumulating a result of the xor'ing of the pixels of the normalized glyph with the corresponding pixels of the selected one of the plurality of image prototypes; for each row of the normalized glyph and the selected one of the plurality of image prototypes that was not xor'ed, adding to the result a number corresponding to the number of pixels ‘on’ in the normalized glyph or the selected one of the plurality of image prototypes; and saving the added result. 5. The method of claim 1 , further comprising: storing, by the at least one computing device, the plurality of image prototypes in a repository. | 0.938776 |
9,699,129 | 1 | 9 | 1. An electronic mail apparatus, comprising: a computing device capable of being connected to a network; and an email productivity module, executed by the computing device, and configured to interact with an existing email application executed by the computing device that sends and receives email messages over the network, wherein the email productivity module includes: a content analysis engine, executed by the computing device, configured to analyze a received email message to generate content information representative of a content of the received email message; a prioritization module, executed by the computing device, having at least one prioritization knowledge base implemented on the computing device, the prioritization module being configured to apply the content information to the at least one prioritization knowledge base to determine at least one priority score for the received email message that reflects a relative priority of the received email message as a legitimate email message and to assign at least one priority level to the received email message based on the priority score that reflects a range of priority scores; a message sorting module, executed by the computing device, having at least one sorting knowledge base implemented on the computing device, the message sorting module being configured to apply the content information to the at least one sorting knowledge base to determine a set of suggested folders for the received email message that represent one or more folders in which are stored other emails having similar content and in which a user would be most likely to store the received email message; and a junkmail module, executed by the computing device, having at least one junkmail knowledge base implemented on the computing device, the junkmail module being configured to apply the content information to the at least one junkmail knowledge base to determine a junkmail score for the received email message that represents a probability that the received email message is junkmail, and the junkmail module being configured to cause a user interface of the existing email application to modify a presentation of the received email message in accordance with the junkmail score; the email productivity module being configured to attach fields for the priority score, priority level, set of suggested folders, and junkmail score to the received email message for display by the existing email application; the email productivity module being configured to receive user feedback to the existing email application indicative of a user action taken with respect to the received email message, and to cause the computing device to adapt the at least one prioritization knowledge base, the at least one sorting database, or the at least one junkmail database, in accordance with the user feedback; wherein the at least one prioritization knowledge base is adapted by the computing device in accordance with explicit user feedback in an event that the user modifies the at least one priority level or the at least one priority score produced by the prioritization module and attached to the received email message for display; and wherein the at least one prioritization knowledge base is adapted by the computing device in accordance with implicit user feedback in an event that the user does not modify the at least one priority level or the at least one priority score produced by the prioritization module and attached to the received email message for display. | 1. An electronic mail apparatus, comprising: a computing device capable of being connected to a network; and an email productivity module, executed by the computing device, and configured to interact with an existing email application executed by the computing device that sends and receives email messages over the network, wherein the email productivity module includes: a content analysis engine, executed by the computing device, configured to analyze a received email message to generate content information representative of a content of the received email message; a prioritization module, executed by the computing device, having at least one prioritization knowledge base implemented on the computing device, the prioritization module being configured to apply the content information to the at least one prioritization knowledge base to determine at least one priority score for the received email message that reflects a relative priority of the received email message as a legitimate email message and to assign at least one priority level to the received email message based on the priority score that reflects a range of priority scores; a message sorting module, executed by the computing device, having at least one sorting knowledge base implemented on the computing device, the message sorting module being configured to apply the content information to the at least one sorting knowledge base to determine a set of suggested folders for the received email message that represent one or more folders in which are stored other emails having similar content and in which a user would be most likely to store the received email message; and a junkmail module, executed by the computing device, having at least one junkmail knowledge base implemented on the computing device, the junkmail module being configured to apply the content information to the at least one junkmail knowledge base to determine a junkmail score for the received email message that represents a probability that the received email message is junkmail, and the junkmail module being configured to cause a user interface of the existing email application to modify a presentation of the received email message in accordance with the junkmail score; the email productivity module being configured to attach fields for the priority score, priority level, set of suggested folders, and junkmail score to the received email message for display by the existing email application; the email productivity module being configured to receive user feedback to the existing email application indicative of a user action taken with respect to the received email message, and to cause the computing device to adapt the at least one prioritization knowledge base, the at least one sorting database, or the at least one junkmail database, in accordance with the user feedback; wherein the at least one prioritization knowledge base is adapted by the computing device in accordance with explicit user feedback in an event that the user modifies the at least one priority level or the at least one priority score produced by the prioritization module and attached to the received email message for display; and wherein the at least one prioritization knowledge base is adapted by the computing device in accordance with implicit user feedback in an event that the user does not modify the at least one priority level or the at least one priority score produced by the prioritization module and attached to the received email message for display. 9. The apparatus of claim 1 , wherein the email productivity module includes a folder management function that analyzes the content of previously stored messages in each folder and identifies messages that may not belong in a particular folder according to information in the at least one sorting knowledge base. | 0.5 |
8,234,120 | 11 | 13 | 11. A method of adding user-defined abstractions to a voice-enabled system, the method comprising acts of: detecting an attempt to record a new abstraction; receiving a proposed voice command for use when invoking the new abstraction, the proposed voice command being proposed as part of the attempt to record the new abstraction, wherein receiving the proposed voice command comprises receiving the entire proposed voice command; in response to the act of receiving the proposed voice command for use when invoking the new abstraction, comparing the proposed voice command against a set of existing voice commands that the voice-enabled system was programmed to recognize prior to the act of receiving the proposed voice command to determine whether the proposed voice command is likely to be confused with at least one of the existing voice commands, wherein the act of comparing the proposed voice command against the set of existing commands is performed after the act of receiving the proposed voice command; parsing the proposed voice command into a plurality of component parts, wherein each the act of comparing the proposed voice command against the existing voice commands comprises comparing at least one component part against one or more of the existing voice commands; when it is determined that the proposed voice command is likely to be confused with at least one of the existing voice commands, performing at least one programmatic action designed to reduce a likelihood of an occurrence of a potential recognition ambiguity between the proposed voice command and the at least one of the existing voice commands; recording a plurality of actions associated with the new abstraction; and associating the new abstraction with the proposed voice command to enable a user to subsequently invoke an execution of the plurality of actions by speaking the proposed voice command. | 11. A method of adding user-defined abstractions to a voice-enabled system, the method comprising acts of: detecting an attempt to record a new abstraction; receiving a proposed voice command for use when invoking the new abstraction, the proposed voice command being proposed as part of the attempt to record the new abstraction, wherein receiving the proposed voice command comprises receiving the entire proposed voice command; in response to the act of receiving the proposed voice command for use when invoking the new abstraction, comparing the proposed voice command against a set of existing voice commands that the voice-enabled system was programmed to recognize prior to the act of receiving the proposed voice command to determine whether the proposed voice command is likely to be confused with at least one of the existing voice commands, wherein the act of comparing the proposed voice command against the set of existing commands is performed after the act of receiving the proposed voice command; parsing the proposed voice command into a plurality of component parts, wherein each the act of comparing the proposed voice command against the existing voice commands comprises comparing at least one component part against one or more of the existing voice commands; when it is determined that the proposed voice command is likely to be confused with at least one of the existing voice commands, performing at least one programmatic action designed to reduce a likelihood of an occurrence of a potential recognition ambiguity between the proposed voice command and the at least one of the existing voice commands; recording a plurality of actions associated with the new abstraction; and associating the new abstraction with the proposed voice command to enable a user to subsequently invoke an execution of the plurality of actions by speaking the proposed voice command. 13. The method of claim 11 , further comprising acts of: receiving a service request; selecting at least one service agent; and manipulating, by the at least one service agent, at least one computing device to enable a safety analysis function. | 0.791809 |
8,949,784 | 9 | 15 | 9. A computer system, including: at least one computer readable module comprising computer executable instructions representative of declarative code according to a declarative programming model implementing a type system supporting constraint-based type refinement and type membership, the at least one computer readable module including a programming construct comprising a refinement type of the type system that defines a type by shaping the type relative to an unlimited top level type representing all types, a first expression in the refinement type of the programming construct including a type test construct that tests an evaluation of a second expression that is included in the first expression for membership of an indicated type; at least one data store including data with respect to which the at least one computer executable instructions execute to perform at least one of accessing, modifying, filtering, transforming, versioning, or processing of the data based on the programming construct of the declarative code; and a typechecking module configured to determine whether an error occurs based on at least one judgment that is based on at least one context associated with the at least one type. | 9. A computer system, including: at least one computer readable module comprising computer executable instructions representative of declarative code according to a declarative programming model implementing a type system supporting constraint-based type refinement and type membership, the at least one computer readable module including a programming construct comprising a refinement type of the type system that defines a type by shaping the type relative to an unlimited top level type representing all types, a first expression in the refinement type of the programming construct including a type test construct that tests an evaluation of a second expression that is included in the first expression for membership of an indicated type; at least one data store including data with respect to which the at least one computer executable instructions execute to perform at least one of accessing, modifying, filtering, transforming, versioning, or processing of the data based on the programming construct of the declarative code; and a typechecking module configured to determine whether an error occurs based on at least one judgment that is based on at least one context associated with the at least one type. 15. The system of claim 9 , wherein the programming construct includes a specification of a union of at least two types and an intersection of at least two types specified in the type refinement construct. | 0.554348 |
8,321,443 | 17 | 21 | 17. A computer program product comprising: a computer readable storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising: proxying an Open Database Connectivity (ODBC) call from an application to one or more query engines of a plurality of query engines, the proxying comprising: replacing an ODBC interface of a processor with an ODBC proxy as a drop-in replacement for the ODBC interface, wherein the ODBC interface is configured to perform one or more functions including at least one of: accept the ODBC call from the application, forward a query of the ODBC call to a query engine of the plurality of query engines, and return at least one result of the forwarded query to the application in a format usable by the application, and wherein based on the replacing, the ODBC proxy performs the one or more functions of the ODBC interface; receiving, from the application at the ODBC proxy, the ODBC call; determining by the ODBC proxy which one or more query engines of the plurality of query engines should be used to satisfy the query, the determining being based on one or more characteristics of the query and on one or more capabilities of the plurality of query engines to compute query results; routing the query to one or more selected query engines based on the determining; receiving by the ODBC proxy results from the one or more selected query engines; and returning the results received from the one or more selected query engines to the application. | 17. A computer program product comprising: a computer readable storage medium readable by a processing circuit and storing instructions for execution by the processing circuit for performing a method comprising: proxying an Open Database Connectivity (ODBC) call from an application to one or more query engines of a plurality of query engines, the proxying comprising: replacing an ODBC interface of a processor with an ODBC proxy as a drop-in replacement for the ODBC interface, wherein the ODBC interface is configured to perform one or more functions including at least one of: accept the ODBC call from the application, forward a query of the ODBC call to a query engine of the plurality of query engines, and return at least one result of the forwarded query to the application in a format usable by the application, and wherein based on the replacing, the ODBC proxy performs the one or more functions of the ODBC interface; receiving, from the application at the ODBC proxy, the ODBC call; determining by the ODBC proxy which one or more query engines of the plurality of query engines should be used to satisfy the query, the determining being based on one or more characteristics of the query and on one or more capabilities of the plurality of query engines to compute query results; routing the query to one or more selected query engines based on the determining; receiving by the ODBC proxy results from the one or more selected query engines; and returning the results received from the one or more selected query engines to the application. 21. The computer program product of claim 17 , wherein the method further comprises dynamically changing a number of query engines included as the plurality of query engines, wherein the dynamically changing comprises removing one or more query engines, the removing employing a configuration interface of the ODBC proxy. | 0.696023 |
9,386,046 | 1 | 8 | 1. A method for improving a statistical message classifier, the method comprising: receiving a message over a network communication interface; identifying by a processor executing instructions out of a memory a feature in the message that is associated with a junk count; testing the message with a machine classifier by the processor performing a calculation according to a logarithmic function including the junk count, wherein the machine classifier outputs a value for the statistical message classifier for storage in the memory; updating the statistical message classifier stored in the memory according to the logarithmic calculation made by the machine classifier, wherein the stored statistical message classifier corresponds to a probability that the feature in the message is spam; identifying that the message is spam based on the probability that the feature in the message is spam; and quarantining the message. | 1. A method for improving a statistical message classifier, the method comprising: receiving a message over a network communication interface; identifying by a processor executing instructions out of a memory a feature in the message that is associated with a junk count; testing the message with a machine classifier by the processor performing a calculation according to a logarithmic function including the junk count, wherein the machine classifier outputs a value for the statistical message classifier for storage in the memory; updating the statistical message classifier stored in the memory according to the logarithmic calculation made by the machine classifier, wherein the stored statistical message classifier corresponds to a probability that the feature in the message is spam; identifying that the message is spam based on the probability that the feature in the message is spam; and quarantining the message. 8. The method for improving a message classifier as recited in claim 1 , wherein updating the statistical message classifier comprises updating a knowledge base used to train the statistical message classifier. | 0.556962 |
7,895,068 | 1 | 5 | 1. A non-transitory computer-readable medium having computer-executable components that, when executed, are configured to cause a processor to perform a method comprising: a) receiving an inquiry from a seeking entity at an inquiry receiving component, the inquiry specifying a predetermined degree of separation, the predetermined degree of separation being dependent on an activity trust level of a relationship the seeking entity is seeking to establish with a sought entity; b) receiving a response, at a response receiving component, indicating an existing relationship between the sought entity and an intermediate entity, the response being indicative of a trust level of the sought entity by the intermediate entity regarding the existing relationship; c) confirming, at a confirming component based on the response, that the relationship may be established; d) determining, at a verification component, whether to share information between the seeking entity and the sought entity in accordance with rights management; and e) in response to determining to share the information, causing the information to be shared between the seeking entity and the sought entity in accordance with rights management. | 1. A non-transitory computer-readable medium having computer-executable components that, when executed, are configured to cause a processor to perform a method comprising: a) receiving an inquiry from a seeking entity at an inquiry receiving component, the inquiry specifying a predetermined degree of separation, the predetermined degree of separation being dependent on an activity trust level of a relationship the seeking entity is seeking to establish with a sought entity; b) receiving a response, at a response receiving component, indicating an existing relationship between the sought entity and an intermediate entity, the response being indicative of a trust level of the sought entity by the intermediate entity regarding the existing relationship; c) confirming, at a confirming component based on the response, that the relationship may be established; d) determining, at a verification component, whether to share information between the seeking entity and the sought entity in accordance with rights management; and e) in response to determining to share the information, causing the information to be shared between the seeking entity and the sought entity in accordance with rights management. 5. The computer-readable medium of claim 1 , wherein the activity trust level is one of street level trust, associate level trust, competitive advantage level trust, and strategic level trust. | 0.5 |
10,049,197 | 8 | 13 | 8. A method for implementing authentication and verification by an authentication and verification system comprising one or more physical processors, the method comprising: obtaining a target personal identification sequence, wherein the target personal identification sequence is associated with an unidentified user; obtaining an input mapping between user-selectable input options and a set of prompts that represent words; obtaining a target sequence of prompts that corresponds to the target personal identification sequence; obtaining a redirection mapping and effectuating presentation of the redirection mapping to the unidentified user prior to effectuating presentation of a set of prompts; effectuating a presentation of the set of prompts to the unidentified user such that individual ones of the presented set of prompts are associated with individual ones of the user-selectable input options in accordance with the obtained input mapping; obtaining one or more audio files comprising sound generated by the unidentified user in response to the presentation; making a first determination whether the obtained one or more audio files represent a vocalization of the target sequence of prompts based on a reversal of a redirection in accordance with the redirection mapping; automatically authenticating the unidentified user responsive to a positive first determination; making a second determination whether the obtained one or more audio files match one or more audio characteristics of sounds generated by the unidentified user; automatically verifying the unidentified user responsive to a positive second determination; and effectuating a grant of access to the unidentified user responsive to authenticating and verifying the unidentified user. | 8. A method for implementing authentication and verification by an authentication and verification system comprising one or more physical processors, the method comprising: obtaining a target personal identification sequence, wherein the target personal identification sequence is associated with an unidentified user; obtaining an input mapping between user-selectable input options and a set of prompts that represent words; obtaining a target sequence of prompts that corresponds to the target personal identification sequence; obtaining a redirection mapping and effectuating presentation of the redirection mapping to the unidentified user prior to effectuating presentation of a set of prompts; effectuating a presentation of the set of prompts to the unidentified user such that individual ones of the presented set of prompts are associated with individual ones of the user-selectable input options in accordance with the obtained input mapping; obtaining one or more audio files comprising sound generated by the unidentified user in response to the presentation; making a first determination whether the obtained one or more audio files represent a vocalization of the target sequence of prompts based on a reversal of a redirection in accordance with the redirection mapping; automatically authenticating the unidentified user responsive to a positive first determination; making a second determination whether the obtained one or more audio files match one or more audio characteristics of sounds generated by the unidentified user; automatically verifying the unidentified user responsive to a positive second determination; and effectuating a grant of access to the unidentified user responsive to authenticating and verifying the unidentified user. 13. The method of claim 8 , wherein the presentation of the set of prompts includes display of the words represented by the set of prompts on an electronic display device. | 0.537838 |
9,069,754 | 1 | 3 | 1. A method comprising: determining text subgroups within an electronic text; determining a relevance score for each word of one or more words within each of the determined text subgroups, the relevance score based on at least one of a frequency of occurrence of the word within one of the determined text subgroups and a type of the word within one of the determined text subgroups; selecting, by an electronic device based on input received from a user, a text subgroup from the determined text subgroups that corresponds to a current user position within the electronic text; selecting, by the electronic device, a text seed from the selected text subgroup based on the relevance scores of the words within the selected text subgroup; determining a first similarity relationship between the selected text seed and one or more of the determined text subgroups adjacent to the selected text subgroup that do not include the selected text seed; creating a text cluster corresponding to the current user position by associating the selected text seed with the one or more adjacent determined text subgroups based on the determined first similarity relationship to the selected text seed; determining an activity indication of times when a user has read other determined text subgroups within the electronic text; determining a second similarity relationship between the text cluster and other text subgroups; linking the text cluster to at least one of the determined text subgroups based on the determined second similarity relationship between the text cluster and the other determined text subgroups; displaying in a first display area, a portion of the electronic text corresponding to the text cluster; and displaying in a second display area, at least one of the determined text subgroups linked to the text cluster based on the determined times when the user read the other determined text subgroups. | 1. A method comprising: determining text subgroups within an electronic text; determining a relevance score for each word of one or more words within each of the determined text subgroups, the relevance score based on at least one of a frequency of occurrence of the word within one of the determined text subgroups and a type of the word within one of the determined text subgroups; selecting, by an electronic device based on input received from a user, a text subgroup from the determined text subgroups that corresponds to a current user position within the electronic text; selecting, by the electronic device, a text seed from the selected text subgroup based on the relevance scores of the words within the selected text subgroup; determining a first similarity relationship between the selected text seed and one or more of the determined text subgroups adjacent to the selected text subgroup that do not include the selected text seed; creating a text cluster corresponding to the current user position by associating the selected text seed with the one or more adjacent determined text subgroups based on the determined first similarity relationship to the selected text seed; determining an activity indication of times when a user has read other determined text subgroups within the electronic text; determining a second similarity relationship between the text cluster and other text subgroups; linking the text cluster to at least one of the determined text subgroups based on the determined second similarity relationship between the text cluster and the other determined text subgroups; displaying in a first display area, a portion of the electronic text corresponding to the text cluster; and displaying in a second display area, at least one of the determined text subgroups linked to the text cluster based on the determined times when the user read the other determined text subgroups. 3. The method of claim 1 , comprising displaying a graphic as an indicator of the determined similarity relationship in an area adjacent to the display area for each determined text subgroup linked to the text cluster. | 0.730198 |
10,140,260 | 8 | 19 | 8. A computer system comprising: at least one processor; a communications medium coupled with the processor; a system memory in communication with the processor via the communication medium, the system memory configured to store programmed computer code, which when executed by the processor, causes the processor to perform operations comprising: receiving inputs from user interface framework of an application that implements the user interface framework when at least one text string is to be displayed in a display element of the user interface, the inputs comprising the text string, an amount of available space in the display element, and an identification of the language of the text string; receiving linguistic pre-analysis results from outside the user interface framework; executing a text reduction algorithm on the text string based upon the linguistic pre-analysis results, wherein executing the text reduction algorithm comprises calculating one or more of entropy, confusion, and style deviation of the short forms of the text string; identifying one or more short forms of the text string that fit within the available space of the display element based on executing the text reduction algorithm; and communicating the identified short forms of the text string to the application or framework for display in the display element of the user interface framework. | 8. A computer system comprising: at least one processor; a communications medium coupled with the processor; a system memory in communication with the processor via the communication medium, the system memory configured to store programmed computer code, which when executed by the processor, causes the processor to perform operations comprising: receiving inputs from user interface framework of an application that implements the user interface framework when at least one text string is to be displayed in a display element of the user interface, the inputs comprising the text string, an amount of available space in the display element, and an identification of the language of the text string; receiving linguistic pre-analysis results from outside the user interface framework; executing a text reduction algorithm on the text string based upon the linguistic pre-analysis results, wherein executing the text reduction algorithm comprises calculating one or more of entropy, confusion, and style deviation of the short forms of the text string; identifying one or more short forms of the text string that fit within the available space of the display element based on executing the text reduction algorithm; and communicating the identified short forms of the text string to the application or framework for display in the display element of the user interface framework. 19. The system of claim 8 wherein calculating the entropy of the one or more short forms of the text string comprises: assigning a total meaningfulness value to the text string; determining a contribution of each character of the text string to the total meaningfulness value; and calculating how much meaning is subtracted when one or more characters are removed from the text string based on determining the contribution of the removed characters to the total meaningfulness value. | 0.5 |
9,436,743 | 9 | 16 | 9. A system for expanding search results, the system comprising: an identification module that identifies, within results of a search, a document that is a member of a document family that includes at least one other document; a determination module that determines that a user has made a selection to include, within the results of the search, the document family; a creation module that creates a data map that includes a representation of the document identified within the results of the search at least in part by identifying a unique identifier associated with the document that corresponds to an offset within the data map and representing the document by toggling a bit at the corresponding offset on the data map; an expansion module that expands the data map by including, within the data map, a representation of each of the at least one other document in the document family based on the determination that the user made the selection; an inclusion module that uses the expanded data map to include the document family within the results of the search; at least one processor that executes the identification module, the determination module, the creation module, the expansion module, and the inclusion module. | 9. A system for expanding search results, the system comprising: an identification module that identifies, within results of a search, a document that is a member of a document family that includes at least one other document; a determination module that determines that a user has made a selection to include, within the results of the search, the document family; a creation module that creates a data map that includes a representation of the document identified within the results of the search at least in part by identifying a unique identifier associated with the document that corresponds to an offset within the data map and representing the document by toggling a bit at the corresponding offset on the data map; an expansion module that expands the data map by including, within the data map, a representation of each of the at least one other document in the document family based on the determination that the user made the selection; an inclusion module that uses the expanded data map to include the document family within the results of the search; at least one processor that executes the identification module, the determination module, the creation module, the expansion module, and the inclusion module. 16. The system of claim 9 , wherein the expansion module expands the data map by: identifying each of the at least one other document within the document family; identifying, for each of the at least one other document within the document family, a unique identifier that corresponds to an offset within the data map; toggling a bit at the corresponding offset for each of the at least one other document within the document family. | 0.682353 |
9,607,102 | 1 | 6 | 1. A method comprising: receiving, by a computing device comprising a natural language understanding automatic speech recognition computing engine device, a first natural language input comprising one or more words; activating, by the natural language understanding automatic speech recognition computing engine device, a first task based on the first natural language input, wherein the first task is associated with one or more first task agents configured for retrieving information associated with the first task; prompting, by the natural language understanding automatic speech recognition computing engine device and via a first of the one or more first task agents, for a subsequent natural language input based on a first transcription of the first natural language input and based on a first intent associated with the first task; receiving, by the natural language understanding automatic speech recognition computing engine device and while the first task is activated, a second natural language input comprising one or more words; responsive to determining, by the natural language understanding automatic speech recognition computing engine device, that a task activation switching parameter associated with the first task is not a false value and that a second intent associated with the second natural language input is different from the first intent associated with the first task, determining, by the natural language understanding automatic speech recognition computing engine device: one or more candidate second tasks that are capable of being activated based on one or more task switching rules that identify one or more tasks that are allowed to interrupt the activated first task, wherein an interrupted task is arranged in a task stack memory component of the computing device; and one or more candidate third tasks that are incapable of being activated based on the one or more task switching rules; activating, by the natural language understanding automatic speech recognition computing engine device, one of the one or more candidate second tasks, wherein the activated candidate second task is associated with one or more second task agents configured for retrieving information associated with the activated candidate second task; responsive to satisfying the one or more second task agents with the first natural language input, the second natural language input, or an additional natural language input, performing, by the computing device, an action associated with the activated second candidate task; determining, by the natural language understanding automatic speech recognition computing engine device, whether the second natural language input satisfies the one or more first task agents associated with the first task; performing, by the computing device, an action associated with the first task responsive to the second natural language input satisfying the one or more first task agents; and prompting, by the natural language understanding automatic speech recognition computing engine device and via one of the one or more first task agents, for a second subsequent natural language input based on the first transcription of the first natural language input responsive to the second natural language input not satisfying the one or more first task agents. | 1. A method comprising: receiving, by a computing device comprising a natural language understanding automatic speech recognition computing engine device, a first natural language input comprising one or more words; activating, by the natural language understanding automatic speech recognition computing engine device, a first task based on the first natural language input, wherein the first task is associated with one or more first task agents configured for retrieving information associated with the first task; prompting, by the natural language understanding automatic speech recognition computing engine device and via a first of the one or more first task agents, for a subsequent natural language input based on a first transcription of the first natural language input and based on a first intent associated with the first task; receiving, by the natural language understanding automatic speech recognition computing engine device and while the first task is activated, a second natural language input comprising one or more words; responsive to determining, by the natural language understanding automatic speech recognition computing engine device, that a task activation switching parameter associated with the first task is not a false value and that a second intent associated with the second natural language input is different from the first intent associated with the first task, determining, by the natural language understanding automatic speech recognition computing engine device: one or more candidate second tasks that are capable of being activated based on one or more task switching rules that identify one or more tasks that are allowed to interrupt the activated first task, wherein an interrupted task is arranged in a task stack memory component of the computing device; and one or more candidate third tasks that are incapable of being activated based on the one or more task switching rules; activating, by the natural language understanding automatic speech recognition computing engine device, one of the one or more candidate second tasks, wherein the activated candidate second task is associated with one or more second task agents configured for retrieving information associated with the activated candidate second task; responsive to satisfying the one or more second task agents with the first natural language input, the second natural language input, or an additional natural language input, performing, by the computing device, an action associated with the activated second candidate task; determining, by the natural language understanding automatic speech recognition computing engine device, whether the second natural language input satisfies the one or more first task agents associated with the first task; performing, by the computing device, an action associated with the first task responsive to the second natural language input satisfying the one or more first task agents; and prompting, by the natural language understanding automatic speech recognition computing engine device and via one of the one or more first task agents, for a second subsequent natural language input based on the first transcription of the first natural language input responsive to the second natural language input not satisfying the one or more first task agents. 6. The method of claim 1 , wherein the satisfying the one or more second task agents comprises: prompting, via the one or more second task agents, for an additional natural language input associated with the second task; receiving at least one natural language input associated with the second task; and satisfying the one or more second task agents with a transcription of the received at least one natural language input associated with the second task. | 0.769036 |
9,652,541 | 17 | 18 | 17. A system for refining a search query, comprising: a processor; and a memory device including instructions that, when executed by the processor, cause the system to: receive a search request from a client device, the search request including at least a first query term and at least a first search refinement value; provide a first set of search results corresponding to the first query term and the first search refinement value to be displayed on the client device; provide an editable search refinement specification including a plurality of editable elements to be displayed along with the first set of search results, the plurality of editable elements including at least a first editable element corresponding to the first query term and at least a second editable element corresponding to the first search refinement value, each of the plurality of editable elements being associated with text and a respective text input box element, each of the plurality of editable elements allowing an adjustment of the text of at least one editable element of the plurality of editable elements of the editable search refinement specification via the respective text input box element while maintaining the text of at least one other editable element of the plurality of editable elements of the editable search refinement specification; provide a displayable option element utilized to modify a currently selected editable element of the plurality of editable elements and to be displayed along with the plurality of editable elements, the displayable option element including two or more of a set of selectable operation icons including an edit operation icon, a remove operation icon, an undo operation icon, a save operation icon, a share operation icon, an auto-complete operation icon, a help operation icon, and a suggestion operation icon; receive a submission including at least a second query term and at least a second search refinement value taken from the editable search refinement specification after adjustment of the text of at least one editable element of the editable search refinement specification via the respective text input box element; and provide a second set of search results matching the second query term and the second search refinement value in the editable search refinement specification after the adjustment to be displayed on the client device. | 17. A system for refining a search query, comprising: a processor; and a memory device including instructions that, when executed by the processor, cause the system to: receive a search request from a client device, the search request including at least a first query term and at least a first search refinement value; provide a first set of search results corresponding to the first query term and the first search refinement value to be displayed on the client device; provide an editable search refinement specification including a plurality of editable elements to be displayed along with the first set of search results, the plurality of editable elements including at least a first editable element corresponding to the first query term and at least a second editable element corresponding to the first search refinement value, each of the plurality of editable elements being associated with text and a respective text input box element, each of the plurality of editable elements allowing an adjustment of the text of at least one editable element of the plurality of editable elements of the editable search refinement specification via the respective text input box element while maintaining the text of at least one other editable element of the plurality of editable elements of the editable search refinement specification; provide a displayable option element utilized to modify a currently selected editable element of the plurality of editable elements and to be displayed along with the plurality of editable elements, the displayable option element including two or more of a set of selectable operation icons including an edit operation icon, a remove operation icon, an undo operation icon, a save operation icon, a share operation icon, an auto-complete operation icon, a help operation icon, and a suggestion operation icon; receive a submission including at least a second query term and at least a second search refinement value taken from the editable search refinement specification after adjustment of the text of at least one editable element of the editable search refinement specification via the respective text input box element; and provide a second set of search results matching the second query term and the second search refinement value in the editable search refinement specification after the adjustment to be displayed on the client device. 18. The system of claim 17 , wherein content being searched is organized according to a hierarchical categorization, the editable search refinement specification displaying a current search category and at least one parent category in the hierarchical categorization. | 0.66791 |
8,423,978 | 23 | 27 | 23. A computer program product comprising a computer usable storage medium having stored therein computer usable program code for processing a JavaServer page, the computer usable program code, which when executed by a computer hardware system, causes the computer hardware system to perform: translating the JavaServer page into a document object model object; configuring a set of visitor classes for invocation in a selected sequence; and processing the document object model using the set of visitor classes in the selected sequence to perform a desired set of custom functions on the document object model. | 23. A computer program product comprising a computer usable storage medium having stored therein computer usable program code for processing a JavaServer page, the computer usable program code, which when executed by a computer hardware system, causes the computer hardware system to perform: translating the JavaServer page into a document object model object; configuring a set of visitor classes for invocation in a selected sequence; and processing the document object model using the set of visitor classes in the selected sequence to perform a desired set of custom functions on the document object model. 27. The computer program product of claim 23 , wherein the set of visitor classes for invocation in the selected sequence is defined in a configuration file. | 0.770468 |
8,266,162 | 1 | 6 | 1. A method comprising: collecting, using a computer, data indicative of search terms associated with one or more search queries; identifying, in the search terms, a particular keyword; identifying, using the computer, remaining search terms as candidate keywords related to the particular keyword; and generating a confidence score for a candidate keyword, the confidence score comprising a ratio of (i) a number of times the candidate keyword and the particular keyword appeared in a same search query of the one or more search queries, to (ii) a number of times the candidate keyword appeared in the one or more search queries. | 1. A method comprising: collecting, using a computer, data indicative of search terms associated with one or more search queries; identifying, in the search terms, a particular keyword; identifying, using the computer, remaining search terms as candidate keywords related to the particular keyword; and generating a confidence score for a candidate keyword, the confidence score comprising a ratio of (i) a number of times the candidate keyword and the particular keyword appeared in a same search query of the one or more search queries, to (ii) a number of times the candidate keyword appeared in the one or more search queries. 6. The method of claim 1 , wherein the search terms comprise elements that are related to each other. | 0.78692 |
10,096,044 | 16 | 17 | 16. The computer-readable storage device of claim 15 , having additional instructions stored which, when executed by the computing device, result in an operation comprising: generating the text based on speech from the user, wherein the speech is received via passive monitoring of the speech of the user. | 16. The computer-readable storage device of claim 15 , having additional instructions stored which, when executed by the computing device, result in an operation comprising: generating the text based on speech from the user, wherein the speech is received via passive monitoring of the speech of the user. 17. The computer-readable storage device of claim 16 , having additional instructions stored which, when executed by the computing device, result in an operation comprising: displaying the advertisement while performing the passive monitoring. | 0.5 |
9,183,020 | 24 | 25 | 24. A processor readable non-transitory storage media that includes instructions for generating an application, wherein a computer that executes at least a portion of the instructions performs actions, comprising: responsive to encountering a multi-size type during compilation of an intermediate language version of the application into a machine code version of the application, performing actions, including: determining architecture information of a target computer, wherein the architecture information includes at least a word size of the target computer; determining one or more data types associated with the target computer that corresponds to the multi-sized type based on the architecture information; determining one or more native code calls that perform actions associated with an intermediate language code call, wherein parameters to the one or more native codes call match the one or more data types; generating a machine code version of the intermediate language code call that at least corresponds to the one or more determined native code calls and also corresponds to the architecture information; when the target computer enables just-in-time compiling, executing the generated machine code version of the intermediate language code call with one or more values correspondent to the multi-size type and the one or more data types by executing the one or more determined native code calls using the one or more determined data types that correspond to the architecture information; and when the target computer disables just-in-time compiling, inserting the generated machine code version of the intermediate language code call in the machine code version of the application with the one or more values correspondent to the multi-size type and the one or more data types, wherein the generated machine code version includes instructions to execute the one or more determined native code calls. | 24. A processor readable non-transitory storage media that includes instructions for generating an application, wherein a computer that executes at least a portion of the instructions performs actions, comprising: responsive to encountering a multi-size type during compilation of an intermediate language version of the application into a machine code version of the application, performing actions, including: determining architecture information of a target computer, wherein the architecture information includes at least a word size of the target computer; determining one or more data types associated with the target computer that corresponds to the multi-sized type based on the architecture information; determining one or more native code calls that perform actions associated with an intermediate language code call, wherein parameters to the one or more native codes call match the one or more data types; generating a machine code version of the intermediate language code call that at least corresponds to the one or more determined native code calls and also corresponds to the architecture information; when the target computer enables just-in-time compiling, executing the generated machine code version of the intermediate language code call with one or more values correspondent to the multi-size type and the one or more data types by executing the one or more determined native code calls using the one or more determined data types that correspond to the architecture information; and when the target computer disables just-in-time compiling, inserting the generated machine code version of the intermediate language code call in the machine code version of the application with the one or more values correspondent to the multi-size type and the one or more data types, wherein the generated machine code version includes instructions to execute the one or more determined native code calls. 25. The media of claim 24 , further comprising, generating the intermediate language code from one or more source code files, wherein the intermediate language code is deployable to a plurality of target platforms that have different architectures. | 0.670213 |
7,720,681 | 9 | 17 | 9. A method for improving digitally transmitted speech, comprising: selecting a voice profile for use in improving the digitally transmitted speech between a first individual and a second individual during a conversation, wherein selecting the voice profile comprises: determining whether the voice profile is a local version for application to receive digitally transmitted speech, in response to determining that the voice profile is not a local version, obtaining the voice profile from a remote location, in response to determining that the voice profile is a local version, determining identifiers from the local version of the voice profile, and determining whether the voice profile is current; and improving received digitally transmitted speech by applying the selected voice profile. | 9. A method for improving digitally transmitted speech, comprising: selecting a voice profile for use in improving the digitally transmitted speech between a first individual and a second individual during a conversation, wherein selecting the voice profile comprises: determining whether the voice profile is a local version for application to receive digitally transmitted speech, in response to determining that the voice profile is not a local version, obtaining the voice profile from a remote location, in response to determining that the voice profile is a local version, determining identifiers from the local version of the voice profile, and determining whether the voice profile is current; and improving received digitally transmitted speech by applying the selected voice profile. 17. The method of claim 9 , wherein determining that the voice profile is not current comprises merging the local version of the voice profile with the shared voice profile. | 0.712625 |
9,497,234 | 8 | 17 | 8. A method comprising: determining a first user interaction represented by an existing social graph connection in a social graph maintained by a social network system; identifying a social network page in the social network system associated with the first user interaction by traversing the social graph of the social network system; identifying a user account based on the first user interaction; generating an implicit social graph connection between the identified user account and the identified social network page based on the determined first user interaction, wherein the existing social graph connection associated with the first user interaction does not involve both the user account and the social network page; determining an edge weight of the implicit social graph connection; storing the implicit social graph connection in the social graph of the social network system; and selecting a content entry for displaying to a user device based on the implicit social graph connection. | 8. A method comprising: determining a first user interaction represented by an existing social graph connection in a social graph maintained by a social network system; identifying a social network page in the social network system associated with the first user interaction by traversing the social graph of the social network system; identifying a user account based on the first user interaction; generating an implicit social graph connection between the identified user account and the identified social network page based on the determined first user interaction, wherein the existing social graph connection associated with the first user interaction does not involve both the user account and the social network page; determining an edge weight of the implicit social graph connection; storing the implicit social graph connection in the social graph of the social network system; and selecting a content entry for displaying to a user device based on the implicit social graph connection. 17. The method of claim 8 , wherein selecting the content entry includes selecting a news feed for displaying to the user device signed-in under the user account based on the edge weight of the implicit social graph connection. | 0.639683 |
7,630,972 | 1 | 6 | 1. A method for searching data using a network device in communication with a client device, comprising: receiving, from the client device, one or more search terms; determining at least one concept based on an analysis of the one or more search terms; identifying one or more concept-specific data sources over which to perform searches based on the at least one concept; performing a search over each of the one or more concept-specific data sources based at least on the search term to generate a plurality of clusters, search results from each concept-specific data source comprising a different cluster in the plurality of clusters; determining a relevance score for each result within each cluster based on user specific contextual data for a user of the client device; for each cluster in the plurality of clusters, employing at least the relevance scores of each result within the respective cluster to determine a respective cluster score; generating an ordered listing of each of the plurality of clusters based on the respective cluster scores; and displaying at the client device at least a portion of the ordered plurality of clusters. | 1. A method for searching data using a network device in communication with a client device, comprising: receiving, from the client device, one or more search terms; determining at least one concept based on an analysis of the one or more search terms; identifying one or more concept-specific data sources over which to perform searches based on the at least one concept; performing a search over each of the one or more concept-specific data sources based at least on the search term to generate a plurality of clusters, search results from each concept-specific data source comprising a different cluster in the plurality of clusters; determining a relevance score for each result within each cluster based on user specific contextual data for a user of the client device; for each cluster in the plurality of clusters, employing at least the relevance scores of each result within the respective cluster to determine a respective cluster score; generating an ordered listing of each of the plurality of clusters based on the respective cluster scores; and displaying at the client device at least a portion of the ordered plurality of clusters. 6. The method of claim 1 , wherein the specific contextual data for the user includes at least one of information about an application currently running on the client device, a past behavior of the user, or a past purchase by the user. | 0.757732 |
8,965,876 | 3 | 5 | 3. The method of claim 1 , further comprising: transmitting the response to the entity. | 3. The method of claim 1 , further comprising: transmitting the response to the entity. 5. The method of claim 3 , further comprising: packaging the response with additional content in a web page; and wherein said transmitting comprises: transmitting the web page to a computing device to be displayed in a browser to a user that input the query to a user interface displayed by the browser. | 0.5 |
9,798,526 | 13 | 16 | 13. A system including instructions recorded on a non-transitory computer-readable storage medium, and executable by at least one processor, the system comprising: a multi-domain decision manager facilitating software development of a software application across a plurality of knowledge domains, based on relationships between a first knowledge domain and a second knowledge domain of the plurality of knowledge domains, the multi-domain decision manager including an assessment engine constructing a first assessment as an instantiation of a first knowledge base model of the first knowledge domain, and a second assessment as an instantiation of a second knowledge base model of the second knowledge domain; a relationship engine characterizing relationships between the first assessment and the second assessment, wherein the relationships characterize a likelihood that inclusion of a first selectable assessment option of the first assessment is associated with inclusion of a second selectable assessment option of the second assessment; and a relationship analyzer analyzing the relationships to identify causes and effects of a change across the first domain and the second domain for a multi-domain compliant development of the software application being developed, wherein the relationship analyzer suggests a change to the first assessment, based on the relationship analysis, and performs an aggregated statistical analysis characterizing a cumulative impact of the property relationships and the assessment relationships on the software application being developed. | 13. A system including instructions recorded on a non-transitory computer-readable storage medium, and executable by at least one processor, the system comprising: a multi-domain decision manager facilitating software development of a software application across a plurality of knowledge domains, based on relationships between a first knowledge domain and a second knowledge domain of the plurality of knowledge domains, the multi-domain decision manager including an assessment engine constructing a first assessment as an instantiation of a first knowledge base model of the first knowledge domain, and a second assessment as an instantiation of a second knowledge base model of the second knowledge domain; a relationship engine characterizing relationships between the first assessment and the second assessment, wherein the relationships characterize a likelihood that inclusion of a first selectable assessment option of the first assessment is associated with inclusion of a second selectable assessment option of the second assessment; and a relationship analyzer analyzing the relationships to identify causes and effects of a change across the first domain and the second domain for a multi-domain compliant development of the software application being developed, wherein the relationship analyzer suggests a change to the first assessment, based on the relationship analysis, and performs an aggregated statistical analysis characterizing a cumulative impact of the property relationships and the assessment relationships on the software application being developed. 16. The system of claim 13 , wherein the first knowledge base model includes structured data characterizing a first software property and associated first assessment options, and the second knowledge base model includes structured data characterizing a second software property and associated second assessment options, and wherein the relationship engine provides the relationships including at least one relationship between the first software property and the second software property. | 0.5 |
9,747,891 | 16 | 19 | 16. A computer program product for recommending the pronunciation of a common name, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program instructions readable by a processing circuit to cause the processing circuit to perform a method comprising: providing a plurality of audio records wherein the plurality of audio records includes a set of audio records identifying the pronunciation of a common name; analyzing the set of audio records identifying the pronunciation of a common name to determine variations in the pronunciation; determining the most frequent common pronunciation of the common name in the set of audio records; and presenting the most frequent common pronunciation of the common name to an end user as the recommended pronunciation. | 16. A computer program product for recommending the pronunciation of a common name, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, wherein the computer readable storage medium is not a transitory signal per se, the program instructions readable by a processing circuit to cause the processing circuit to perform a method comprising: providing a plurality of audio records wherein the plurality of audio records includes a set of audio records identifying the pronunciation of a common name; analyzing the set of audio records identifying the pronunciation of a common name to determine variations in the pronunciation; determining the most frequent common pronunciation of the common name in the set of audio records; and presenting the most frequent common pronunciation of the common name to an end user as the recommended pronunciation. 19. The computer program product of claim 16 further including providing a ranking of pronunciations of the common name based upon frequency of occurrences of the pronunciation of the common name within the set of audio records. | 0.766871 |
7,478,100 | 28 | 32 | 28. The method of claim 27 in which the XPath expression is translated to the SQL query by: breaking the XPath expression into multiple components; creating a Previously Presented SQL query corresponding to each of the multiple components; and joining the Previously Presented SQL query corresponding a component to its previous component. | 28. The method of claim 27 in which the XPath expression is translated to the SQL query by: breaking the XPath expression into multiple components; creating a Previously Presented SQL query corresponding to each of the multiple components; and joining the Previously Presented SQL query corresponding a component to its previous component. 32. The method of claim 28 in which the new SQL query comprises one or more conditions. | 0.817992 |
8,185,373 | 7 | 8 | 7. The method of claim 6 , wherein said step of assigning on the computing device a second rating to the translation's accuracy as compared to the source material for its type as determined in step (d) is comprised of the step of assigning on the computing device a second rating to the translation's accuracy as a function of the execution of activities selected from the group of activities consisting of translation of words and phrases in the language used in the source material to equivalent words and phrases in the language used in the translation, translation of syntax used in the source material to equivalent syntax used in the translation, translation of communicant's intention, perception, nuance, tone, and so on to equivalent intention, perception, nuance, tone, and so on in the translation, and providing exact language of user-definable excerpts of the source material. | 7. The method of claim 6 , wherein said step of assigning on the computing device a second rating to the translation's accuracy as compared to the source material for its type as determined in step (d) is comprised of the step of assigning on the computing device a second rating to the translation's accuracy as a function of the execution of activities selected from the group of activities consisting of translation of words and phrases in the language used in the source material to equivalent words and phrases in the language used in the translation, translation of syntax used in the source material to equivalent syntax used in the translation, translation of communicant's intention, perception, nuance, tone, and so on to equivalent intention, perception, nuance, tone, and so on in the translation, and providing exact language of user-definable excerpts of the source material. 8. The method of claim 7 , wherein said step of assigning on the computing device a second rating to the translation's accuracy as compared to the source material for its type as determined in step (d) is comprised of the step of assigning on the computing device a second rating to the translation's accuracy selected from the group of translation accuracy ratings consisting of extremely accurate, very accurate, average accuracy, below average accuracy, and not accurate. | 0.5 |
9,836,538 | 11 | 17 | 11. A system that responds to a document search request, the system comprising: a memory; and a processor programmed to: receive a query; calculate scores for a plurality of documents obtained with respect to the received query by comparing terms in said query with terms in said documents; call a same first function implemented by each of a plurality of domain-based scorers of different types, to determine, without utilizing one or more documents of the plurality of documents, which of said domain-based scorers will contribute and which will not contribute to scoring of said documents in response to the calculation of said scores for the plurality of documents, wherein the same first function is used to determine whether the received query is too vague and will not be scored or is not too vague and will be scored, and wherein determining whether the received query is too vague or not too vague is based upon each domain-based scorer using its own set of first criteria for determining whether the received query is too vague or not too vague, each of said domain-based scorers calculating a domain-based score based on features of said documents or of said query that are specific to a substantive field of knowledge after the calculation of the scores for the plurality of documents, said each of said plurality of domain-based scorers implementing its own version of a same second function to calculate the domain-based score of said documents without obtaining said documents again with respect to the received query, wherein the same second function includes receiving document identifiers to identify said documents in a database and returning scores for said documents and using the returned scores as input into an aggregation formula, wherein each domain-based scorer uses its own set of second criteria within the aggregation formula, wherein said same second function of each of the plurality of domain-based scorers utilizes said documents which have already received scores based on the terms in said query to calculate the domain-based scores of said documents; include, on a list, those domain-based scorers that indicate, through said same first function, that they will contribute to scoring of said documents; use a configurable parameter selected based on a different scoring scheme by those ones of said domain-based scorers that are on said list to adjust said scores, whereby adjusted scores of said documents are created by combining the contributions from all of the said domain-based scorers; create a set of search results based on the adjusted scores of said documents; and present said search results to a user. | 11. A system that responds to a document search request, the system comprising: a memory; and a processor programmed to: receive a query; calculate scores for a plurality of documents obtained with respect to the received query by comparing terms in said query with terms in said documents; call a same first function implemented by each of a plurality of domain-based scorers of different types, to determine, without utilizing one or more documents of the plurality of documents, which of said domain-based scorers will contribute and which will not contribute to scoring of said documents in response to the calculation of said scores for the plurality of documents, wherein the same first function is used to determine whether the received query is too vague and will not be scored or is not too vague and will be scored, and wherein determining whether the received query is too vague or not too vague is based upon each domain-based scorer using its own set of first criteria for determining whether the received query is too vague or not too vague, each of said domain-based scorers calculating a domain-based score based on features of said documents or of said query that are specific to a substantive field of knowledge after the calculation of the scores for the plurality of documents, said each of said plurality of domain-based scorers implementing its own version of a same second function to calculate the domain-based score of said documents without obtaining said documents again with respect to the received query, wherein the same second function includes receiving document identifiers to identify said documents in a database and returning scores for said documents and using the returned scores as input into an aggregation formula, wherein each domain-based scorer uses its own set of second criteria within the aggregation formula, wherein said same second function of each of the plurality of domain-based scorers utilizes said documents which have already received scores based on the terms in said query to calculate the domain-based scores of said documents; include, on a list, those domain-based scorers that indicate, through said same first function, that they will contribute to scoring of said documents; use a configurable parameter selected based on a different scoring scheme by those ones of said domain-based scorers that are on said list to adjust said scores, whereby adjusted scores of said documents are created by combining the contributions from all of the said domain-based scorers; create a set of search results based on the adjusted scores of said documents; and present said search results to a user. 17. The system of claim 11 , wherein each of said plurality of domain-based scorers exposes a callable function that, when called, provides an explanation describing a reason for which a final score has been assigned to a given one of said documents. | 0.734607 |
8,495,156 | 12 | 13 | 12. A device comprising a machine-readable medium storing instructions for causing one or more hardware processors to perform operations comprising: determining that a user of a first instant messaging service is associated with a second instant messaging service different from the first instant messaging service; identifying user identities for users other than the user, wherein the user identities are associated with the first instant messaging service and the user identities are stored in a first list associated with the user; determining if at least one of the user identities from the first list of user identities has a matching user identity associated with the second instant messaging service by identifying if a unique portion of the at least one of the user identities from the first list has at least one common feature with a unique portion of a user identity associated with the second instant messaging service; determining a degree of uniqueness of an identified user identity; adjusting the required amount of common features between the unique portion of the identified user identity and the unique portion of a matching user identity associated with the second instant messaging service based on the determined degree of uniqueness of the identified use identity; and modifying a second list associated with the second instant messaging service to include the matching user identities. | 12. A device comprising a machine-readable medium storing instructions for causing one or more hardware processors to perform operations comprising: determining that a user of a first instant messaging service is associated with a second instant messaging service different from the first instant messaging service; identifying user identities for users other than the user, wherein the user identities are associated with the first instant messaging service and the user identities are stored in a first list associated with the user; determining if at least one of the user identities from the first list of user identities has a matching user identity associated with the second instant messaging service by identifying if a unique portion of the at least one of the user identities from the first list has at least one common feature with a unique portion of a user identity associated with the second instant messaging service; determining a degree of uniqueness of an identified user identity; adjusting the required amount of common features between the unique portion of the identified user identity and the unique portion of a matching user identity associated with the second instant messaging service based on the determined degree of uniqueness of the identified use identity; and modifying a second list associated with the second instant messaging service to include the matching user identities. 13. The device of claim 12 , wherein the first list comprises a contact list associated with the first instant messaging service. | 0.874757 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.