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,030,417 | 4 | 6 | 4. The method of claim 1 , wherein calculating the edit distance using the operations according to the respective cost comprises: converting the input character string and the searched candidate words into key input strings of the identified keypad type; and calculating an edit distance between the key input string of the input character string and the key input string of each of the searched candidate words. | 4. The method of claim 1 , wherein calculating the edit distance using the operations according to the respective cost comprises: converting the input character string and the searched candidate words into key input strings of the identified keypad type; and calculating an edit distance between the key input string of the input character string and the key input string of each of the searched candidate words. 6. The method of claim 4 , wherein determining the each cost of the insert operation, delete operation, and replace operation corresponding to the identified keypad type comprises: identifying at least one or more incorrect input types having a high frequency of occurrence associated with the identified keypad type; if operating conditions of at least one or more incorrect input types having a high frequency of occurrence are met, determining the cost of the insert operation, the delete operation, or the replace operation as a first value and, otherwise, determining the cost of the insert operation, the delete operation, or the replace operation as a second value higher than the first value; and determining the cost of the insert operation, the delete operation, or the replace operation as a basic cost whether the operating conditions are met or not. | 0.5 |
8,032,377 | 5 | 6 | 5. The method according to claim 1 , wherein said further alignment step comprises: g1) aligning, using the computer, a lexicon in a lexicon alignment step by generating the second plurality of grapheme and phoneme clusters, each cluster comprising a sequence of at least two components; g2) calculating, using the computer, a statistical distribution of potential grapheme and phoneme clusters generated in said lexicon alignment step; g3) selecting, using the computer, among said potential grapheme and phoneme clusters a cluster having highest occurrence; and g4) if said highest occurrence is higher than a third predetermined threshold, rewriting, using the computer, said lexicon by replacing each sequence of components of corresponding clusters in said lexicon with said selected cluster and repeating steps g1 to g4. | 5. The method according to claim 1 , wherein said further alignment step comprises: g1) aligning, using the computer, a lexicon in a lexicon alignment step by generating the second plurality of grapheme and phoneme clusters, each cluster comprising a sequence of at least two components; g2) calculating, using the computer, a statistical distribution of potential grapheme and phoneme clusters generated in said lexicon alignment step; g3) selecting, using the computer, among said potential grapheme and phoneme clusters a cluster having highest occurrence; and g4) if said highest occurrence is higher than a third predetermined threshold, rewriting, using the computer, said lexicon by replacing each sequence of components of corresponding clusters in said lexicon with said selected cluster and repeating steps g1 to g4. 6. The method according to claim 5 , wherein said lexicon alignment step comprises: h) generating, using the computer, a first statistical grapheme to phoneme association model having uniform probability; i) selecting, using the computer, lexicon tuples having a total number of graphemes or grapheme clusters equal to a total number of phonemes or phoneme clusters; j) aligning, using the computer, said tuples using said first statistical grapheme to phoneme association model; k) recalculating, using the computer, said first statistical grapheme to phoneme association model using said aligned tuples; l) if said recalculated model is not stable, repeating the step of aligning said tuples using said recalculated model and repeating the step of recalculating said model; m) aligning, using the computer, the whole lexicon using said recalculated statistical grapheme to phoneme association model; n) recalculating, using the computer, said statistical grapheme to phoneme association model using said whole lexicon; and o) if said recalculated model is not stable, repeating the step of aligning the whole lexicon using said recalculated model and repeating the step of recalculating said model using said whole lexicon. | 0.5 |
8,484,083 | 16 | 22 | 16. A non-transitory computer readable storage medium storing an executable program for sending a message in a social network, where the program performs steps of: receiving from a source of the message or from a user a keyword relating to a subject of the message; retrieving from an ontology source a normalized set of concepts associated with the keyword, wherein the ontology source comprises at least one community-generated ontology source; collecting information from the social network, the information comprising one or more interactions between users of the social network and profile information for the users; identifying a subset of the information that corresponds to the normalized set of concepts, wherein the subset of the information is used to form a global topic model comprising at least one topic; sending the message to at least one of the users of the social network who is associated with the at least one topic; and dynamically updating the global topic model as new information is collected from the social network. | 16. A non-transitory computer readable storage medium storing an executable program for sending a message in a social network, where the program performs steps of: receiving from a source of the message or from a user a keyword relating to a subject of the message; retrieving from an ontology source a normalized set of concepts associated with the keyword, wherein the ontology source comprises at least one community-generated ontology source; collecting information from the social network, the information comprising one or more interactions between users of the social network and profile information for the users; identifying a subset of the information that corresponds to the normalized set of concepts, wherein the subset of the information is used to form a global topic model comprising at least one topic; sending the message to at least one of the users of the social network who is associated with the at least one topic; and dynamically updating the global topic model as new information is collected from the social network. 22. The non-transitory computer readable storage medium of claim 16 , wherein the sending comprises: identifying, for the at least one topic, a connection among those of the users who are associated with the at least one topic. | 0.689891 |
10,162,817 | 1 | 4 | 1. A computer system comprising: at least one processor; and memory comprising instructions stored thereon that when executed by at least one processor cause at least one processor to perform acts comprising: receiving computer-readable creation data from a computer-readable developer profile at a first messaging bot, with the creation data comprising instructions to create a second messaging bot, and with the instructions to create the second messaging bot comprising natural language instructions defining one or more messaging bot characteristics; analyzing the natural language instructions, with the analyzing of the natural language instructions comprising determining that the natural language instructions match one or more pre-defined commands to include the one or more messaging bot characteristics in the second messaging bot; and generating a computer-readable definition of the second messaging bot using results of the analyzing of the natural language instructions, the generating of the definition comprising including computer-readable instructions for the one or more characteristics in the definition, with the definition being configured to produce the one or more characteristics when the second messaging bot is executed using the definition. | 1. A computer system comprising: at least one processor; and memory comprising instructions stored thereon that when executed by at least one processor cause at least one processor to perform acts comprising: receiving computer-readable creation data from a computer-readable developer profile at a first messaging bot, with the creation data comprising instructions to create a second messaging bot, and with the instructions to create the second messaging bot comprising natural language instructions defining one or more messaging bot characteristics; analyzing the natural language instructions, with the analyzing of the natural language instructions comprising determining that the natural language instructions match one or more pre-defined commands to include the one or more messaging bot characteristics in the second messaging bot; and generating a computer-readable definition of the second messaging bot using results of the analyzing of the natural language instructions, the generating of the definition comprising including computer-readable instructions for the one or more characteristics in the definition, with the definition being configured to produce the one or more characteristics when the second messaging bot is executed using the definition. 4. The computer system of claim 1 , wherein the acts further comprise running the second messaging bot in the computer system, the running of the second messaging bot comprising receiving one or more natural language instructions from a computer-readable user profile and responding to the one or more natural language instructions from the user profile by automatically generating and sending one or more natural language responses to the user profile, wherein the generating and sending the one or more natural language responses are performed in a manner dictated by the computer-readable instructions for the one or more characteristics in the definition of the second messaging bot. | 0.532653 |
9,002,102 | 13 | 15 | 13. A computer program product for classifying documents, the computer program product comprising: a non-transitory computer readable medium storing computer usable program code embodied therewith, the computer usable program code comprising: computer usable program code to, when executed by a processor, determine a number of sub-samples in a number of original documents; and computer usable program code to, when executed by a processor, create a number of pseudo-documents from the sub-samples, the pseudo-documents comprising a portion of the number of sub-samples, in which each of the pseudo-documents are created by deleting a number of the sub-samples through a jackknife statistical method. | 13. A computer program product for classifying documents, the computer program product comprising: a non-transitory computer readable medium storing computer usable program code embodied therewith, the computer usable program code comprising: computer usable program code to, when executed by a processor, determine a number of sub-samples in a number of original documents; and computer usable program code to, when executed by a processor, create a number of pseudo-documents from the sub-samples, the pseudo-documents comprising a portion of the number of sub-samples, in which each of the pseudo-documents are created by deleting a number of the sub-samples through a jackknife statistical method. 15. The computer program product of claim 13 , further comprising computer usable program code to, when executed by a processor, train a classifying device to classify textual documents based on the pseudo-documents. | 0.5 |
8,600,975 | 1 | 18 | 1. A computer-implemented method comprising: decomposing, by at least one processor of a computer system, a search query that includes three or more words into a plurality of candidate phrasifications, including different groupings of words of the search query, each candidate phrasification comprising a disjoint union of component phrases, and each component phrase including at least one word or related word of the search query; scoring, by at least one of the processors of the computer system, at least two of the candidate phrasifications, wherein the candidate phrasifications include one or more component phrases, and wherein the scoring is based on a probability of occurrence of each of the candidate phrasification's component phrases, and is based on the number of component phrases constituting the candidate phrasification, wherein candidate phrasifications having relatively fewer component phrases are weighted higher than candidate phrasifications having relatively more component phrases; selecting, by at least one of the processors of the computer system and based on scores of the candidate phrasifications, a subset of the candidate phrasification; and executing a query of a document indexing, by at least one of the processors of the computer system, using the selected subset of candidate phrasifications, wherein the query comprises the component phrases of each selected phrasification. | 1. A computer-implemented method comprising: decomposing, by at least one processor of a computer system, a search query that includes three or more words into a plurality of candidate phrasifications, including different groupings of words of the search query, each candidate phrasification comprising a disjoint union of component phrases, and each component phrase including at least one word or related word of the search query; scoring, by at least one of the processors of the computer system, at least two of the candidate phrasifications, wherein the candidate phrasifications include one or more component phrases, and wherein the scoring is based on a probability of occurrence of each of the candidate phrasification's component phrases, and is based on the number of component phrases constituting the candidate phrasification, wherein candidate phrasifications having relatively fewer component phrases are weighted higher than candidate phrasifications having relatively more component phrases; selecting, by at least one of the processors of the computer system and based on scores of the candidate phrasifications, a subset of the candidate phrasification; and executing a query of a document indexing, by at least one of the processors of the computer system, using the selected subset of candidate phrasifications, wherein the query comprises the component phrases of each selected phrasification. 18. The method of claim 1 , wherein the selected subset of candidate phrasifications is organized as a Boolean phrase tree. | 0.907519 |
8,423,971 | 1 | 4 | 1. A computer-implemented method for generating an application software library, comprising: processing a binary input library, by a static analyser, to identify one or more locations in the binary input library which satisfy a semantic analysis condition derived from a design requirement implemented in the binary input library, the semantic analysis condition having non-executable metadata associated therewith, the metadata associated with corresponding executable aspect code; inserting the metadata into the binary input library at the one or more locations which satisfy the semantic analysis condition; and linking the binary input library with a binary aspect library to generate the application software library, wherein the binary aspect library includes an aspect definition providing the corresponding executable aspect code associated with the metadata. | 1. A computer-implemented method for generating an application software library, comprising: processing a binary input library, by a static analyser, to identify one or more locations in the binary input library which satisfy a semantic analysis condition derived from a design requirement implemented in the binary input library, the semantic analysis condition having non-executable metadata associated therewith, the metadata associated with corresponding executable aspect code; inserting the metadata into the binary input library at the one or more locations which satisfy the semantic analysis condition; and linking the binary input library with a binary aspect library to generate the application software library, wherein the binary aspect library includes an aspect definition providing the corresponding executable aspect code associated with the metadata. 4. The method of claim 1 wherein the semantic analysis condition includes a criterion relating to a procedure in the binary input library. | 0.503597 |
9,569,593 | 61 | 74 | 61. At least one non-transitory computer-readable storage medium encoded with computer-executable instructions that, when executed, perform a method comprising: transcribing audio data comprising audio of one or more clinical personnel speaking while performing a surgical procedure, the audio data comprising audio of a first clinician speaking to one or more other clinical personnel while performing the surgical procedure; analyzing the transcribed audio data, including the transcribed audio of the first clinician speaking to the one or more other clinical personnel while performing the surgical procedure, at least in part by automatically extracting one or more clinical facts from the transcribed audio data, to identify relevant information for documenting the surgical procedure, wherein analyzing the transcribed audio data comprises identifying within the transcribed audio data a present-tense narration by the first clinician stating to the other clinical personnel that the first clinician is currently performing a particular step of the surgical procedure; automatically generating a text report including the relevant information documenting the surgical procedure, wherein automatically generating the text report comprises automatically transforming the present-tense narration into a non-present-tense portion in the report, stating that the particular step of the surgical procedure was performed; and outputting the automatically generated text report for review via a user interface on an audio and/or visual display device. | 61. At least one non-transitory computer-readable storage medium encoded with computer-executable instructions that, when executed, perform a method comprising: transcribing audio data comprising audio of one or more clinical personnel speaking while performing a surgical procedure, the audio data comprising audio of a first clinician speaking to one or more other clinical personnel while performing the surgical procedure; analyzing the transcribed audio data, including the transcribed audio of the first clinician speaking to the one or more other clinical personnel while performing the surgical procedure, at least in part by automatically extracting one or more clinical facts from the transcribed audio data, to identify relevant information for documenting the surgical procedure, wherein analyzing the transcribed audio data comprises identifying within the transcribed audio data a present-tense narration by the first clinician stating to the other clinical personnel that the first clinician is currently performing a particular step of the surgical procedure; automatically generating a text report including the relevant information documenting the surgical procedure, wherein automatically generating the text report comprises automatically transforming the present-tense narration into a non-present-tense portion in the report, stating that the particular step of the surgical procedure was performed; and outputting the automatically generated text report for review via a user interface on an audio and/or visual display device. 74. The at least one non-transitory computer-readable storage medium of claim 61 , wherein the analyzing is performed using at least one model trained on past surgical reports, past audio transcriptions and/or medical literature. | 0.886969 |
9,361,635 | 1 | 8 | 1. A system comprising one or more processors and a non-transitory storage medium comprising program logic for execution by the one or more processors, the program logic comprising: a native advertisement placement engine that: obtains a Document Object Model of an HTML document; identifies Document Object Model elements, of the Document Object Model, associated with native advertisement placement candidate containers; identifies, with the Document Object Model, HTML tag sequences that include at least L tags, where L is a specified number, repeat at least R times, where R is a specified number, and all correspond to a single element of the Document Object Model; constructs a suffix tree of a string of tags comprising all tags in the Document Object Model; performs a traversal of the suffix tree, beginning with a root node, and computes, for each node that is non-root and non-leaf, a number of leaf nodes of the each node; analyzes the Document Object Model by performing a recursion of the suffix tree and pruning the recursion when the number of leaf nodes of the each node is less than R; and based at least in part on the analysis associated with the Document Object Model, and utilizing at least some of the identified elements, determines, within the Document Object Model, one or more native advertisement placement candidate containers. | 1. A system comprising one or more processors and a non-transitory storage medium comprising program logic for execution by the one or more processors, the program logic comprising: a native advertisement placement engine that: obtains a Document Object Model of an HTML document; identifies Document Object Model elements, of the Document Object Model, associated with native advertisement placement candidate containers; identifies, with the Document Object Model, HTML tag sequences that include at least L tags, where L is a specified number, repeat at least R times, where R is a specified number, and all correspond to a single element of the Document Object Model; constructs a suffix tree of a string of tags comprising all tags in the Document Object Model; performs a traversal of the suffix tree, beginning with a root node, and computes, for each node that is non-root and non-leaf, a number of leaf nodes of the each node; analyzes the Document Object Model by performing a recursion of the suffix tree and pruning the recursion when the number of leaf nodes of the each node is less than R; and based at least in part on the analysis associated with the Document Object Model, and utilizing at least some of the identified elements, determines, within the Document Object Model, one or more native advertisement placement candidate containers. 8. The system of claim 1 , wherein the identified candidate containers relate to content with which native advertisements may be associated. | 0.833729 |
7,904,477 | 1 | 2 | 1. A method for handling a plurality of information units in an information processing system through verification process for said plurality of information units, comprising the following steps of: a) converting each information unit in said plurality of information units into verified object by augmenting a first meaning in said information unit with a second meaning, b) expressing the verified objects, converted from said plurality of information units, by object representation for each verified object, c) constructing a processing structure that is capable of applying a plurality of relationships among said verified objects, d) applying said processing structure to said verified objects to handle said plurality of information units according to the relationships, e) handling rules that exist in a distributed network, wherein the rules are used to construct the processing structure that applies the relationship, defined in the rules, among the verified objects, and whereby the rules can be referenced by the information processing system remotely, and f) using a semantic tree as a basis for defining the relationship in the rules, wherein the information units are based on data or event in the information processing system, and wherein the verified objects are semantically augmented information units. | 1. A method for handling a plurality of information units in an information processing system through verification process for said plurality of information units, comprising the following steps of: a) converting each information unit in said plurality of information units into verified object by augmenting a first meaning in said information unit with a second meaning, b) expressing the verified objects, converted from said plurality of information units, by object representation for each verified object, c) constructing a processing structure that is capable of applying a plurality of relationships among said verified objects, d) applying said processing structure to said verified objects to handle said plurality of information units according to the relationships, e) handling rules that exist in a distributed network, wherein the rules are used to construct the processing structure that applies the relationship, defined in the rules, among the verified objects, and whereby the rules can be referenced by the information processing system remotely, and f) using a semantic tree as a basis for defining the relationship in the rules, wherein the information units are based on data or event in the information processing system, and wherein the verified objects are semantically augmented information units. 2. The method according to claim 1 , wherein the method further comprises a step of converting each information unit of the plurality of information units based on data or event in the information processing system into verified object by augmenting the first meaning in said information unit with a second meaning. | 0.672557 |
8,744,183 | 1 | 2 | 1. A computer-implemented method of identifying documents sharing at least one common underlying structure, comprising: detecting, by at least one computer, occurrences of a plurality of predetermined image features in a plurality of document images, wherein at least one of the plurality of predetermined image features is common among instances of a form; indexing, by the at least one computer, the plurality of document images in an image index based on the detected image features; building, by the at least one computer, a graph of connected nodes for the plurality of document images by searching the image index, wherein nodes representing instances of a predefined document type are connected by edges in the graph; and identifying, by the at least one computer, the documents sharing common underlying structures using the graph. | 1. A computer-implemented method of identifying documents sharing at least one common underlying structure, comprising: detecting, by at least one computer, occurrences of a plurality of predetermined image features in a plurality of document images, wherein at least one of the plurality of predetermined image features is common among instances of a form; indexing, by the at least one computer, the plurality of document images in an image index based on the detected image features; building, by the at least one computer, a graph of connected nodes for the plurality of document images by searching the image index, wherein nodes representing instances of a predefined document type are connected by edges in the graph; and identifying, by the at least one computer, the documents sharing common underlying structures using the graph. 2. The method of claim 1 , wherein the graph comprises a weighted graph and edges in the weighted graph are assigned weights measuring similarities between document images represented by nodes connected by the edges. | 0.707317 |
8,112,709 | 9 | 10 | 9. A computer program product comprising code embedded in a storage medium that when executed on a processor implements a method for controlling printing of an electronically stored document, the code comprising: code for producing a print dialog in a user interface, said print dialog displayed in a viewing area of a display device, the code for producing a print dialog comprising: code for displaying a defined concepts list comprising at least one displayed concept and at least one relevance of said document to said at least one displayed concept, wherein said at least one displayed concept is from a user profile associated with a user; code for receiving selection of at least one selected concept of interest from said at least one displayed concept; code for causing an analysis of the electronically stored document to identify a number of locations of text relevant to said at least one selected concept in the electronically stored document; code for displaying visual indications of the identified locations of said text relevant to said at least one selected concept to the user on a display device; and code for causing a printer to print at least a portion of the electronically stored document comprising the identified locations of said text relevant to said at least one selected concept for the user using a printer. | 9. A computer program product comprising code embedded in a storage medium that when executed on a processor implements a method for controlling printing of an electronically stored document, the code comprising: code for producing a print dialog in a user interface, said print dialog displayed in a viewing area of a display device, the code for producing a print dialog comprising: code for displaying a defined concepts list comprising at least one displayed concept and at least one relevance of said document to said at least one displayed concept, wherein said at least one displayed concept is from a user profile associated with a user; code for receiving selection of at least one selected concept of interest from said at least one displayed concept; code for causing an analysis of the electronically stored document to identify a number of locations of text relevant to said at least one selected concept in the electronically stored document; code for displaying visual indications of the identified locations of said text relevant to said at least one selected concept to the user on a display device; and code for causing a printer to print at least a portion of the electronically stored document comprising the identified locations of said text relevant to said at least one selected concept for the user using a printer. 10. The computer program product of claim 9 , wherein said code for displaying visual indications of the identified locations to the user on a display device further comprises code for displaying an elongated thumbnail image of a part of said electronically stored document in a viewing area of a display, said thumbnail image having at least one of a plurality of indications of locations of discussion of concepts of interest to said user, the code for producing a print dialog in a user interface further comprising: code for emphasizing an area of said thumbnail image corresponding to a section of said electronically stored document of interest to the user; and code for accepting user input controlling sliding said emphasized area through said electronically stored document to indicate said at least one section of said electronically stored document to print. | 0.5 |
10,152,319 | 1 | 2 | 1. A method of providing supplemental functionalities to an executable program via an ontology instance, the method comprising: causing, by a computer system, an executable program associated with an ontology to be run, wherein the ontology comprises information indicating attributes for a set of applications; obtaining, by a computer system, an instance of the ontology, wherein the ontology instance corresponds to an application of the set of applications; using, by a computer system, the ontology instance to generate application metadata for the executable program, wherein the application metadata is related to one or more functionalities of the application; extracting, by a computer system, class information from the ontology; using, by a computer system, the class information to generate a programming interface, wherein the programming interface allows the executable program to access the application metadata; and providing, by a computer system, the application metadata as input to the executable program via the programming interface, wherein the application metadata, at least in part, causes the one or more functionalities of the application to be made available via the executable program. | 1. A method of providing supplemental functionalities to an executable program via an ontology instance, the method comprising: causing, by a computer system, an executable program associated with an ontology to be run, wherein the ontology comprises information indicating attributes for a set of applications; obtaining, by a computer system, an instance of the ontology, wherein the ontology instance corresponds to an application of the set of applications; using, by a computer system, the ontology instance to generate application metadata for the executable program, wherein the application metadata is related to one or more functionalities of the application; extracting, by a computer system, class information from the ontology; using, by a computer system, the class information to generate a programming interface, wherein the programming interface allows the executable program to access the application metadata; and providing, by a computer system, the application metadata as input to the executable program via the programming interface, wherein the application metadata, at least in part, causes the one or more functionalities of the application to be made available via the executable program. 2. The method of claim 1 , further comprising: obtaining, by a computer system, another instance of the ontology, wherein the other ontology instance corresponds to another application of the set of applications; using, by a computer system, the other ontology instance to generate other application metadata for the executable program, wherein the other application metadata is related to one or more functionalities of the other application; and providing, by a computer system, the other application metadata as input to the executable program, wherein the other application metadata, at least in part, causes the one or more functionalities of the other application be made available via the executable program. | 0.5 |
7,730,467 | 5 | 6 | 5. The system of claim 3 , further comprising a syntax analyzer that determines whether the pulled XML item conforms to a desired XML syntax. | 5. The system of claim 3 , further comprising a syntax analyzer that determines whether the pulled XML item conforms to a desired XML syntax. 6. The system of claim 5 , the syntax analyzer references syntax documents. | 0.741379 |
9,275,112 | 10 | 13 | 10. A computing device to filter views with a predefined query, the computing device comprising: a memory configured to store instructions; and a processor coupled to the memory, the processor executing an application in conjunction with the instructions stored in the memory, wherein the application is configured to: determine at least one view to provide to a user based on access privileges associated with the user; determine one or more additional views to provide to the user based on a common element determined between the at least one view and the one or more additional views; provide the at least one view and the one or more additional views to the user through a user interface for configuration of a filter query, wherein the user is enabled to edit the filter query; receive the filter query from the user; receive a view from the user; and disable the filter query in response to a detection of the user editing the filter query to include views and structures unrelated to the view received; else combine the filter query and the view to generate a filtered view result in place of an original view result; associate the filter query with the view received from the user such that the view is filtered when the user requests data from the view; and provide the filtered view result to one or more other users seeking access to a corresponding view, wherein the filtered view is provided to the one or more other users with inherited permissions from the user. | 10. A computing device to filter views with a predefined query, the computing device comprising: a memory configured to store instructions; and a processor coupled to the memory, the processor executing an application in conjunction with the instructions stored in the memory, wherein the application is configured to: determine at least one view to provide to a user based on access privileges associated with the user; determine one or more additional views to provide to the user based on a common element determined between the at least one view and the one or more additional views; provide the at least one view and the one or more additional views to the user through a user interface for configuration of a filter query, wherein the user is enabled to edit the filter query; receive the filter query from the user; receive a view from the user; and disable the filter query in response to a detection of the user editing the filter query to include views and structures unrelated to the view received; else combine the filter query and the view to generate a filtered view result in place of an original view result; associate the filter query with the view received from the user such that the view is filtered when the user requests data from the view; and provide the filtered view result to one or more other users seeking access to a corresponding view, wherein the filtered view is provided to the one or more other users with inherited permissions from the user. 13. The computing device of claim 10 , wherein the application is further configured to: enable the user to elect use of the filter query together with the view for a request; and filter the original view result by the filter query. | 0.550388 |
8,571,869 | 13 | 14 | 13. A natural language call routing system comprising: at least one processor configured to: obtain first data from a plurality of calls routed by a natural language call routing system that uses a first speech recognition model to recognize speech of the plurality of calls and a first action classification model to route calls based on the recognized speech, the first data comprising audio data from the plurality of calls, a first N-best list of word sequences generated by using the first speech recognition model to recognize at least a portion of the audio data and associated call classification data indicating how each of the plurality of calls were routed by the natural language call routing system; and modify the first speech recognition model and the first action classification model based at least in part on the first data, including using the first N-best list of word sequences, to obtain a second speech recognition model and a second action classification model; and modify the second speech recognition model and the second action classification model based at least in part on the first data to obtain a third speech recognition model and a third action classification model, wherein the modifying comprises modifying the second speech recognition model and the second action classification model by using the first N-best list or a second N-best list of word sequences generated by using the second speech recognition model to recognize at least the portion of the audio data. | 13. A natural language call routing system comprising: at least one processor configured to: obtain first data from a plurality of calls routed by a natural language call routing system that uses a first speech recognition model to recognize speech of the plurality of calls and a first action classification model to route calls based on the recognized speech, the first data comprising audio data from the plurality of calls, a first N-best list of word sequences generated by using the first speech recognition model to recognize at least a portion of the audio data and associated call classification data indicating how each of the plurality of calls were routed by the natural language call routing system; and modify the first speech recognition model and the first action classification model based at least in part on the first data, including using the first N-best list of word sequences, to obtain a second speech recognition model and a second action classification model; and modify the second speech recognition model and the second action classification model based at least in part on the first data to obtain a third speech recognition model and a third action classification model, wherein the modifying comprises modifying the second speech recognition model and the second action classification model by using the first N-best list or a second N-best list of word sequences generated by using the second speech recognition model to recognize at least the portion of the audio data. 14. The system of claim 13 , wherein the at least one processor is configured to modify the first speech recognition model and the first action classification model by jointly modifying the first speech recognition model and the first action classification model by using an unisolated performance metric indicative of routing accuracy of the natural language call routing system. | 0.591398 |
10,019,195 | 16 | 17 | 16. The method of claim 12 comprising calculating the logical component score as a function of a plurality of logical component category scores. | 16. The method of claim 12 comprising calculating the logical component score as a function of a plurality of logical component category scores. 17. The method of claim 16 comprising calculating each logical component category score as a function of a plurality of logical component category instance scores. | 0.5 |
8,285,537 | 47 | 48 | 47. At least one computer readable medium as recited in claim 46 , wherein said predicting is based on a country associated with the proper noun. | 47. At least one computer readable medium as recited in claim 46 , wherein said predicting is based on a country associated with the proper noun. 48. At least one computer readable medium as recited in claim 47 , wherein the country is derived from a postal address associated with the proper noun. | 0.570621 |
8,923,608 | 1 | 22 | 1. A computer-implemented method for evaluating training data comprising: receiving training data comprising a labeled training set of digital objects, at least some of the digital objects in the labeled training set including a label indicating that the digital object is positive for a respective class selected from a predetermined set of classes with which a classifier is to be trained; grouping the positively labeled digital objects in the labeled training set into positive label groups, one positive label group for each class in the set of classes, each label group comprising digital objects having a label indicating the digital object is positive for the respective class; with a trained categorizer, assigning a score vector to each digital object in the labeled training set of digital objects, the score vector comprising a score for each category of a predetermined set of categories; applying at least one heuristic to the training data to evaluate the training data for training the classifier based on the assigned score vectors and training data labels; and based on the at least one heuristic, providing an evaluation of the training data prior to training the classifier. | 1. A computer-implemented method for evaluating training data comprising: receiving training data comprising a labeled training set of digital objects, at least some of the digital objects in the labeled training set including a label indicating that the digital object is positive for a respective class selected from a predetermined set of classes with which a classifier is to be trained; grouping the positively labeled digital objects in the labeled training set into positive label groups, one positive label group for each class in the set of classes, each label group comprising digital objects having a label indicating the digital object is positive for the respective class; with a trained categorizer, assigning a score vector to each digital object in the labeled training set of digital objects, the score vector comprising a score for each category of a predetermined set of categories; applying at least one heuristic to the training data to evaluate the training data for training the classifier based on the assigned score vectors and training data labels; and based on the at least one heuristic, providing an evaluation of the training data prior to training the classifier. 22. The method of claim 1 , wherein at least some of the digital objects in the labeled training set include a label indicating that the digital object is neutral with respect to one of the classes in the set of classes, the applying of the at least one heuristic comprising applying a heuristic configured for identifying at least one of: a neutral labeled digital object having a score vector that is not sufficiently close to score vectors of other digital objects with the same neutral label; and a neutral labeled digital object having a score vector that is not sufficiently close to score vectors of other digital objects in a positive label group which includes the neutral labeled digital object; and wherein the evaluation optionally includes providing for identifying the neutral labeled digital object and outputting a recommendation based on the applied heuristic. | 0.5 |
4,379,288 | 12 | 14 | 12. A keyboard for encoding Chinese type characters in accordance with five basic strokes and the sequence thereof comprising three horizontal ranks, each rank comprising about ten keys wherein all character coding keys locate, wherein five said keys locating in positions in the middle rank are monographic and representative of a basic stroke, and about twenty three said keys are polygraphic, representative of a sequence of basic strokes of two or more, at least a portion of said polygraphic keys being digraphic, means responsive to the actuation of said keys to generate a code signal representative of the stroke or sequence of strokes represented thereby. | 12. A keyboard for encoding Chinese type characters in accordance with five basic strokes and the sequence thereof comprising three horizontal ranks, each rank comprising about ten keys wherein all character coding keys locate, wherein five said keys locating in positions in the middle rank are monographic and representative of a basic stroke, and about twenty three said keys are polygraphic, representative of a sequence of basic strokes of two or more, at least a portion of said polygraphic keys being digraphic, means responsive to the actuation of said keys to generate a code signal representative of the stroke or sequence of strokes represented thereby. 14. A keyboard in accordance with claim 12 wherein said polygraphic keys include about fifteen digraphic keys, about five trigraphic keys, at least one tetragraphic key and at least one pentagraphic key. | 0.601961 |
8,392,187 | 4 | 5 | 4. The method of claim 1 wherein modifying a beam threshold further comprises modifying the beam threshold based on a number of active phones. | 4. The method of claim 1 wherein modifying a beam threshold further comprises modifying the beam threshold based on a number of active phones. 5. The method of claim 4 , wherein modifying a beam threshold based on a number of active phones further comprises further comprises reducing the beam threshold if the number of active phones is greater than an empirically determined threshold. | 0.5 |
9,552,080 | 9 | 15 | 9. A computing device comprising: at least one processor; and at least one module operable by the at least one processor to: output, for display, a graphical keyboard comprising a plurality of keys; maintain a plurality of letter chains, wherein: each respective letter chain of the plurality of letter chains is associated with a respective cost value; each respective letter chain includes a different respective group of one or more characters; and each respective character of each respective group of one or more characters corresponds to a respective key of the plurality of keys; receive an indication of a particular portion of a gesture detected at a presence-sensitive input device, the gesture comprising a plurality of portions; responsive to receiving the indication of the particular portion of the gesture, update, based at least in part on the indication of the particular portion of the gesture, the plurality of letter chains; determine, for the particular portion of the gesture and based at least in part on a cost value associated with at least one of the plurality of letter chains, a candidate word; and output, for display, the candidate word. | 9. A computing device comprising: at least one processor; and at least one module operable by the at least one processor to: output, for display, a graphical keyboard comprising a plurality of keys; maintain a plurality of letter chains, wherein: each respective letter chain of the plurality of letter chains is associated with a respective cost value; each respective letter chain includes a different respective group of one or more characters; and each respective character of each respective group of one or more characters corresponds to a respective key of the plurality of keys; receive an indication of a particular portion of a gesture detected at a presence-sensitive input device, the gesture comprising a plurality of portions; responsive to receiving the indication of the particular portion of the gesture, update, based at least in part on the indication of the particular portion of the gesture, the plurality of letter chains; determine, for the particular portion of the gesture and based at least in part on a cost value associated with at least one of the plurality of letter chains, a candidate word; and output, for display, the candidate word. 15. The computing device of claim 9 , wherein the gesture is a continuous gesture, wherein the at least one module is operable by the at least one processor to: determine, based at least in part on a plurality of features associated with the particular portion of the continuous gesture, a group of alignment points traversed by the continuous gesture, wherein the plurality of features associated with the particular portion of the continuous gesture comprises at least one of: a length of a segment of the particular portion of the continuous gesture, wherein the segment comprises a path traversed by the portion of the continuous gesture at the presence-sensitive input device; a direction of the segment of the particular portion of the continuous gesture; a curvature of the segment of the particular portion of the continuous gesture; a local speed that represents a rate at which the segment of the particular portion of the continuous gesture was detected; and a global speed that represents a rate at which the particular portion of the continuous gesture was detected. | 0.5 |
8,983,940 | 1 | 2 | 1. A method for object retrieval and localization, comprising: performing, by one or more computing devices: obtaining an initial ranking of a collection of a plurality of images, with regard to a query object included in a query image, the initial ranking based on a similarity score for each of the images of the collection to the query object, the similarity score determined using a spatially-constrained similarity measure; generating a ranking of the collection with regard to each of one or more nearest neighbors to the query object as indicated by the initial ranking of the collection, said generating the ranking comprising: for each of the one or more nearest neighbors, searching the collection according to a localized object of the respective nearest neighbor to determine the similarity scores for the collection, the localized object being a best match object of the respective nearest neighbor to the query object in the query image; ranking the collection according to the similarity scores; and generating a new ranking of the collection with regard to the query object according to the initial ranking and the generated rankings with regard to each of the one or more nearest neighbors. | 1. A method for object retrieval and localization, comprising: performing, by one or more computing devices: obtaining an initial ranking of a collection of a plurality of images, with regard to a query object included in a query image, the initial ranking based on a similarity score for each of the images of the collection to the query object, the similarity score determined using a spatially-constrained similarity measure; generating a ranking of the collection with regard to each of one or more nearest neighbors to the query object as indicated by the initial ranking of the collection, said generating the ranking comprising: for each of the one or more nearest neighbors, searching the collection according to a localized object of the respective nearest neighbor to determine the similarity scores for the collection, the localized object being a best match object of the respective nearest neighbor to the query object in the query image; ranking the collection according to the similarity scores; and generating a new ranking of the collection with regard to the query object according to the initial ranking and the generated rankings with regard to each of the one or more nearest neighbors. 2. The method as recited in claim 1 , wherein features of the nearest neighbor that are outside the localized object are disregarded during said searching. | 0.859347 |
7,793,255 | 1 | 2 | 1. A computer program product having a computer readable storage medium operable to store computer program logic embodied in computer program code encoded thereon for updateable partial binding comprising: computer program code for creating associations between document objects in a markup language and managed objects in a content tree, the document objects corresponding to a class hierarchy structure; computer program code for selectively modifying the managed objects; and computer program code for updating, by traversing the created associations, the document objects corresponding to the modified managed objects, the updating occurring in a lossless manner which preserves unmodified data in the document objects; wherein the document objects in the markup language correspond to a first view from an application program, and the managed objects in the content tree correspond to a second view from the application program; wherein creating comprises unmarshalling the document objects in the markup language to create the managed objects, wherein unmarshalling includes identifying a class structure in a document object model having a set of instances of the document objects; compiling the identified class structure to generate a second class structure corresponding to the managed objects; and matching tags and attributes corresponding to the markup language objects to the managed objects. | 1. A computer program product having a computer readable storage medium operable to store computer program logic embodied in computer program code encoded thereon for updateable partial binding comprising: computer program code for creating associations between document objects in a markup language and managed objects in a content tree, the document objects corresponding to a class hierarchy structure; computer program code for selectively modifying the managed objects; and computer program code for updating, by traversing the created associations, the document objects corresponding to the modified managed objects, the updating occurring in a lossless manner which preserves unmodified data in the document objects; wherein the document objects in the markup language correspond to a first view from an application program, and the managed objects in the content tree correspond to a second view from the application program; wherein creating comprises unmarshalling the document objects in the markup language to create the managed objects, wherein unmarshalling includes identifying a class structure in a document object model having a set of instances of the document objects; compiling the identified class structure to generate a second class structure corresponding to the managed objects; and matching tags and attributes corresponding to the markup language objects to the managed objects. 2. The computer program product of claim 1 further comprising computer program code for compiling an application programming interface adapted for access by the application program and operable to modify the managed objects. | 0.5 |
8,812,321 | 4 | 5 | 4. The method of claim 1 , wherein the machine-learning algorithm comprises a mixture of domain-specific speech recognizers from different domains, wherein the mixture of domain-specific speech recognizers comprises two of the following: local business search, web search, Short Messaging Service, question/answering, video search, broadcast news, and voicemail to text. | 4. The method of claim 1 , wherein the machine-learning algorithm comprises a mixture of domain-specific speech recognizers from different domains, wherein the mixture of domain-specific speech recognizers comprises two of the following: local business search, web search, Short Messaging Service, question/answering, video search, broadcast news, and voicemail to text. 5. The method of claim 4 , wherein selecting the speech recognition candidates further comprises comparing domain-specific speech recognizers in the mixture of domain-specific speech recognizers to select the best speech recognition candidates. | 0.5 |
8,386,484 | 1 | 7 | 1. A method for electronically publishing text-based data, the method comprising: dividing said text-based data into a plurality of portions of text-based data; amending at least one of said plurality of portions of text-based data; storing said plurality of portions of text-based data; storing said amended portion of text-based data; providing a plurality of attributes, wherein said attributes define at least in part a manner in which at least one of said plurality of portions of text-based data and said amended portion of text-based data is capable of being organized and linked in a multidimensional space; associating at least one of said plurality of portions of text-based data and said amended portion of text-based data with at least one link comprising at least one of code or markup language enabled at least in part by at least one of said plurality of attributes; enabling a user to search said plurality of portions of text-based data and said amended portion of text-based data using at least one of said plurality of attributes; and allowing the results of said search to be published to a user by: allowing the provision of at least one of said plurality of portions of text-based data or said amended portion of text-based data in response to said search; and allowing the provision of one or more selectable links to allow said user to select said one or more selectable links, wherein at least one of said plurality of portions of text-based data related to a current, provided portion based on said current, provided portion's attributes is allowed to be displayed as a graphical representation of at least one dimension of a multidimensional space that is configured to allow a user to select and thereby display text-based data represented by a point on said multidimensional space; wherein said multidimensional space is an unbounded area capable of or involving more than three dimensions. | 1. A method for electronically publishing text-based data, the method comprising: dividing said text-based data into a plurality of portions of text-based data; amending at least one of said plurality of portions of text-based data; storing said plurality of portions of text-based data; storing said amended portion of text-based data; providing a plurality of attributes, wherein said attributes define at least in part a manner in which at least one of said plurality of portions of text-based data and said amended portion of text-based data is capable of being organized and linked in a multidimensional space; associating at least one of said plurality of portions of text-based data and said amended portion of text-based data with at least one link comprising at least one of code or markup language enabled at least in part by at least one of said plurality of attributes; enabling a user to search said plurality of portions of text-based data and said amended portion of text-based data using at least one of said plurality of attributes; and allowing the results of said search to be published to a user by: allowing the provision of at least one of said plurality of portions of text-based data or said amended portion of text-based data in response to said search; and allowing the provision of one or more selectable links to allow said user to select said one or more selectable links, wherein at least one of said plurality of portions of text-based data related to a current, provided portion based on said current, provided portion's attributes is allowed to be displayed as a graphical representation of at least one dimension of a multidimensional space that is configured to allow a user to select and thereby display text-based data represented by a point on said multidimensional space; wherein said multidimensional space is an unbounded area capable of or involving more than three dimensions. 7. The method according to claim 1 , wherein said amended portion of text-based data is amended by performing at least one of the group consisting of adding data to one of said plurality of portions of text-based data, deleting data from one of said plurality of portions of text-based data, and modifying data of one of said plurality of portions of text-based data. | 0.5 |
7,523,424 | 1 | 2 | 1. A method for representing analog connectivity in a design written in a hardware description language, comprising: detecting a circuit component that does not have explicit connection path in the design, wherein the circuit component includes a Verilog-AMS out-of-module-reference, a Verilog-AMS defined parameter, and a VHDL-AMS package reference, and wherein the circuit component includes one or more lower-level circuit instances arranged in one or more branches in a hierarchical graph, representations of a lower-level circuit instance vary from one branch to another branch due to out-of-module-reference, automatic inserted connection module, Verilog-AMS defined parameter, VHDL-AMS package reference, VHDL-AMS entity, VHDL-AMS architecture, and VHDL-AMS instance; creating one or more instances of the circuit component having at least one additional port than the circuit component; creating one or more ports in the corresponding one or more instances of the circuit component for providing at least an explicit connection path; and simulating the design using at least the explicit connection path and the one or more ports of the corresponding one or more instances. | 1. A method for representing analog connectivity in a design written in a hardware description language, comprising: detecting a circuit component that does not have explicit connection path in the design, wherein the circuit component includes a Verilog-AMS out-of-module-reference, a Verilog-AMS defined parameter, and a VHDL-AMS package reference, and wherein the circuit component includes one or more lower-level circuit instances arranged in one or more branches in a hierarchical graph, representations of a lower-level circuit instance vary from one branch to another branch due to out-of-module-reference, automatic inserted connection module, Verilog-AMS defined parameter, VHDL-AMS package reference, VHDL-AMS entity, VHDL-AMS architecture, and VHDL-AMS instance; creating one or more instances of the circuit component having at least one additional port than the circuit component; creating one or more ports in the corresponding one or more instances of the circuit component for providing at least an explicit connection path; and simulating the design using at least the explicit connection path and the one or more ports of the corresponding one or more instances. 2. The method of claim 1 , wherein the out-of-module-reference comprises: one or more objects referenced from other parts of the design; one or more objects referenced through hierarchical names; and one or more objects resided in instances in the hierarchical path from a source instance to a destination instance. | 0.719751 |
8,612,445 | 1 | 4 | 1. A unified method of scoring partitions of a composition of ontological subjects comprising: obtaining at least one set of ontological subject of a first predefined order; partitioning the composition of ontological subjects into one or more pluralities of partitions; constructing one or more data arrays corresponding to at least one participation matrix representing participation pattern of at least some of said ontological subjects of the first predefined order into one or more of said partitions by having a non-zero value in the corresponding entries of the participation matrix, wherein each row of the participation matrix is representative of one of said ontological subjects and each column of the participation matrix is representative of one of said partitions or vice versa; assigning or calculating scores, according to one or more importance aspects of one or more predefined criteria of importance, to one or more of said ontological subjects of the first predefined order; scoring one or more of said partitions of the composition, by using the score of the ontological subjects of the first predefined order and data of one or more of said one or more data arrays corresponding to said at least one participation matrix; and processing said scoring data of partitions and/or storing said scoring data of partitions onto one or more non-transitory computer readable storage. | 1. A unified method of scoring partitions of a composition of ontological subjects comprising: obtaining at least one set of ontological subject of a first predefined order; partitioning the composition of ontological subjects into one or more pluralities of partitions; constructing one or more data arrays corresponding to at least one participation matrix representing participation pattern of at least some of said ontological subjects of the first predefined order into one or more of said partitions by having a non-zero value in the corresponding entries of the participation matrix, wherein each row of the participation matrix is representative of one of said ontological subjects and each column of the participation matrix is representative of one of said partitions or vice versa; assigning or calculating scores, according to one or more importance aspects of one or more predefined criteria of importance, to one or more of said ontological subjects of the first predefined order; scoring one or more of said partitions of the composition, by using the score of the ontological subjects of the first predefined order and data of one or more of said one or more data arrays corresponding to said at least one participation matrix; and processing said scoring data of partitions and/or storing said scoring data of partitions onto one or more non-transitory computer readable storage. 4. The method of claim 1 , wherein one or more of said partitions are selected and composed together in a predetermined format to represent a summary of the composition. | 0.866086 |
9,396,166 | 15 | 16 | 15. At least one non-transitory computer storage having encoded thereon instructions that, when executed by at least one processor, perform a method comprising acts of: identifying, within an input text, a plurality of portions of text, each portion of text corresponding to a section type from a plurality of section types specified in a report template, wherein the report template specifies the plurality of section types at least in part by storing a plurality of section headings corresponding respectively to the plurality of section types; inserting a plurality of indicators into the input text, each indicator corresponding to a respective portion of text in the plurality of portions of text and marking a location in the input text where the respective portion of text begins; displaying, to a user, at a first portion of a screen, the input text with the plurality of indicators inserted therein; displaying, to the user, at a second portion of the screen that is different from the first portion of the screen, at least some of the plurality of section headings stored in the report template, wherein the at least some of the plurality of section headings and at least some of the input text with the inserted indicators are visible simultaneously; receiving input from the user indicating the user wishes to mark a location in the input text as a beginning of a section, the input identifying a section heading from the at least some of the plurality of section headings displayed to the user; inserting an indicator at the location indicated by the input, wherein the indicator corresponds to the section heading identified by the input; for at least one portion of text in the plurality of portions of text, identifying formatting data based at least in part on the section type of the at least one portion of text; and using the input text with the plurality of indicators inserted therein to generate a structured report comprising the plurality of portions of text, wherein the at least one portion of text is formatted according to the formatting data identified based at least in part on the section type of the at least one portion of text. | 15. At least one non-transitory computer storage having encoded thereon instructions that, when executed by at least one processor, perform a method comprising acts of: identifying, within an input text, a plurality of portions of text, each portion of text corresponding to a section type from a plurality of section types specified in a report template, wherein the report template specifies the plurality of section types at least in part by storing a plurality of section headings corresponding respectively to the plurality of section types; inserting a plurality of indicators into the input text, each indicator corresponding to a respective portion of text in the plurality of portions of text and marking a location in the input text where the respective portion of text begins; displaying, to a user, at a first portion of a screen, the input text with the plurality of indicators inserted therein; displaying, to the user, at a second portion of the screen that is different from the first portion of the screen, at least some of the plurality of section headings stored in the report template, wherein the at least some of the plurality of section headings and at least some of the input text with the inserted indicators are visible simultaneously; receiving input from the user indicating the user wishes to mark a location in the input text as a beginning of a section, the input identifying a section heading from the at least some of the plurality of section headings displayed to the user; inserting an indicator at the location indicated by the input, wherein the indicator corresponds to the section heading identified by the input; for at least one portion of text in the plurality of portions of text, identifying formatting data based at least in part on the section type of the at least one portion of text; and using the input text with the plurality of indicators inserted therein to generate a structured report comprising the plurality of portions of text, wherein the at least one portion of text is formatted according to the formatting data identified based at least in part on the section type of the at least one portion of text. 16. The at least one non-transitory computer storage of claim 15 , wherein the formatting data comprises at least one format selected from a group consisting of: font type, font size, bolding, underlining, italicizing, spacing and alignment. | 0.683727 |
7,490,092 | 150 | 152 | 150. A method of indexing and searching timed media files, as recited in claim 1 , further comprising the step of creating at least one virtual document comprising a collection of at least one of said relevance intervals. | 150. A method of indexing and searching timed media files, as recited in claim 1 , further comprising the step of creating at least one virtual document comprising a collection of at least one of said relevance intervals. 152. A method of indexing and searching timed media files, as recited in claim 150 , further comprising the step of creating a search index containing said at least one virtual document. | 0.565421 |
8,104,017 | 2 | 11 | 2. The method of claim 1 , where the first part is a portion, of the graphical model, associated with the graphical affordance and the second part is the segment of the generated code. | 2. The method of claim 1 , where the first part is a portion, of the graphical model, associated with the graphical affordance and the second part is the segment of the generated code. 11. The method of claim 2 , where the portion represents an interface for an element and the segment represents at least part of a function related to the interface. | 0.664634 |
8,984,386 | 29 | 32 | 29. A method comprising: creating, by a computer-based service, a plurality of associations, each of which associates (a) occurrence of one or more application events from a plurality of application events, with (b) one or more users from a plurality of users; enabling, by the computer-based service, each user of the plurality of users to interact, over a network, with one or more applications; monitoring, by the computer-based service, for occurrence of said plurality of application events; wherein each application event, from the plurality of application events, corresponds to interaction with at least one of the one or more applications, by at least one user from the plurality of users; in response, at least in part, to occurrence of a first application event from the plurality of application events, the computer-based service sending first information about the first application event to each user of a plurality of second users, from the plurality of users; wherein the first information includes one or more links that provide access to one or more views that are associated with the first application event; wherein the first application event occurred based, at least in part, on interaction of a first user, from the plurality of users, with a given view from the one or more views; wherein sending the first information includes sending the first information to at least one user of the plurality of second users, based, at least in part, on a first association of the plurality of associations; wherein the step of creating includes creating the first association based on the computer-based service receiving, from the at least one user of the plurality of second users, an expression of interest in interactions of the first user; receiving, by the computer-based service, a comment from a particular second user, of the plurality of second users; wherein the first user is a different user than the particular second user; wherein the comment is entered in a text entry interface that is related to the first information; and the computer-based service sending the comment, to each user of the plurality of second users other than the particular second user, to cause display of the comment, in relation to the first information, to the each user of the plurality of second users other than the particular second user. | 29. A method comprising: creating, by a computer-based service, a plurality of associations, each of which associates (a) occurrence of one or more application events from a plurality of application events, with (b) one or more users from a plurality of users; enabling, by the computer-based service, each user of the plurality of users to interact, over a network, with one or more applications; monitoring, by the computer-based service, for occurrence of said plurality of application events; wherein each application event, from the plurality of application events, corresponds to interaction with at least one of the one or more applications, by at least one user from the plurality of users; in response, at least in part, to occurrence of a first application event from the plurality of application events, the computer-based service sending first information about the first application event to each user of a plurality of second users, from the plurality of users; wherein the first information includes one or more links that provide access to one or more views that are associated with the first application event; wherein the first application event occurred based, at least in part, on interaction of a first user, from the plurality of users, with a given view from the one or more views; wherein sending the first information includes sending the first information to at least one user of the plurality of second users, based, at least in part, on a first association of the plurality of associations; wherein the step of creating includes creating the first association based on the computer-based service receiving, from the at least one user of the plurality of second users, an expression of interest in interactions of the first user; receiving, by the computer-based service, a comment from a particular second user, of the plurality of second users; wherein the first user is a different user than the particular second user; wherein the comment is entered in a text entry interface that is related to the first information; and the computer-based service sending the comment, to each user of the plurality of second users other than the particular second user, to cause display of the comment, in relation to the first information, to the each user of the plurality of second users other than the particular second user. 32. The method of claim 29 wherein the first association associates the at least one user of the plurality of second users with occurrence of application events, of the plurality of application events, that correspond to interactions of the first user. | 0.748503 |
9,946,706 | 13 | 15 | 13. An electronic device, comprising: one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for: obtaining a document including text; receiving, from an automatic language identifier service, a first language identification for the document; in response to receiving the first language identification, automatically invoking a modifying operation; performing the modifying operation on the document in accordance with the first language identification; determining, based at least in part on results from the modifying operation, whether the first language identification for the document is correct, wherein the results from the modifying operation include at least one of the amount of errors or the nature of the errors associated with the modifying operation; and in accordance with a determination that the first language identification is correct, providing the first language identification to a user application; in accordance with a determination that the first language identification is incorrect, determining a second language identification of the document, and performing a modifying function on the document in accordance with one or more alternate languages different from the first language, wherein the second language identification of the document is determined based at least in part on the results from performing the modifying function on the document in accordance with the one or more alternate languages. | 13. An electronic device, comprising: one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for: obtaining a document including text; receiving, from an automatic language identifier service, a first language identification for the document; in response to receiving the first language identification, automatically invoking a modifying operation; performing the modifying operation on the document in accordance with the first language identification; determining, based at least in part on results from the modifying operation, whether the first language identification for the document is correct, wherein the results from the modifying operation include at least one of the amount of errors or the nature of the errors associated with the modifying operation; and in accordance with a determination that the first language identification is correct, providing the first language identification to a user application; in accordance with a determination that the first language identification is incorrect, determining a second language identification of the document, and performing a modifying function on the document in accordance with one or more alternate languages different from the first language, wherein the second language identification of the document is determined based at least in part on the results from performing the modifying function on the document in accordance with the one or more alternate languages. 15. The electronic device as in claim 13 , wherein the one or more programs include instructions for: receiving an accuracy confidence ranking associated with the first language identification; and wherein the determining is based on the results from the modifying operation and the accuracy confidence ranking. | 0.5 |
9,626,459 | 9 | 11 | 9. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to: receive a design layout; generate spatial pattern clips from the design layout using a sliding window to split the design layout into overlapping windows; perform a transform on the spatial pattern clips to form frequency domain pattern clips; perform feature extraction on the frequency domain pattern clips to form frequency domain features; utilize the extracted features on a set of training samples to train a machine learning classifier model; and classify a set of previously unseen patterns, based on frequency domain features of the previously unseen patterns using the trained machine learning classifier model, into hotspots and non-hotspots. | 9. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to: receive a design layout; generate spatial pattern clips from the design layout using a sliding window to split the design layout into overlapping windows; perform a transform on the spatial pattern clips to form frequency domain pattern clips; perform feature extraction on the frequency domain pattern clips to form frequency domain features; utilize the extracted features on a set of training samples to train a machine learning classifier model; and classify a set of previously unseen patterns, based on frequency domain features of the previously unseen patterns using the trained machine learning classifier model, into hotspots and non-hotspots. 11. The computer program product of claim 9 , wherein the computer readable program further causes the computing device to: training the machine learning classifier model using a support vector machine. | 0.639286 |
8,320,665 | 1 | 4 | 1. A system for document image segmentation, said system comprising: input means adapted to input a document image; image pre-processing means adapted to pre-process said document image by maintaining the aspect ratio, said pre-processing means including a colour quantization means to give a pre-processed quantized image; colour space transformation means adapted to receive said pre-processed quantized image and apply a Hue, Saturation and Value colour space transformation on said quantized image to derive a transformed image containing only saturation component of said quantized image; first image energy calculation means adapted to receive said transformed image and calculate both horizontal and vertical energies of said transformed image to provide a first energy image by cumulating both of said calculated energies of said transformed image; grayscale image conversion means adapted to receive said pre-processed quantized image and perform a grayscale conversion operation on said quantized image to provide a gray scale image; second image energy calculation means adapted to receive said gray scale image and calculate both horizontal and vertical energies of said gray scale image to provide a second energy image by cumulating both of said calculated energies and said gray scale image; computational means adapted to receive said first energy image and second energy image to compute a maximum of both the energies and provide a maximum energy image; binarization means adapted to receive said maximum energy image and provide a binarized image; dilation means adapted to receive said binarized image and perform a dilation operation to provide a dilated image; clustering means adapted to receive said dilated image and formulate different clusters based on the density of the dilated areas and provide a clustered image; and box creation means adapted to create bounding boxes enclosing each cluster in the clustered image to form an image of the document having image segments. | 1. A system for document image segmentation, said system comprising: input means adapted to input a document image; image pre-processing means adapted to pre-process said document image by maintaining the aspect ratio, said pre-processing means including a colour quantization means to give a pre-processed quantized image; colour space transformation means adapted to receive said pre-processed quantized image and apply a Hue, Saturation and Value colour space transformation on said quantized image to derive a transformed image containing only saturation component of said quantized image; first image energy calculation means adapted to receive said transformed image and calculate both horizontal and vertical energies of said transformed image to provide a first energy image by cumulating both of said calculated energies of said transformed image; grayscale image conversion means adapted to receive said pre-processed quantized image and perform a grayscale conversion operation on said quantized image to provide a gray scale image; second image energy calculation means adapted to receive said gray scale image and calculate both horizontal and vertical energies of said gray scale image to provide a second energy image by cumulating both of said calculated energies and said gray scale image; computational means adapted to receive said first energy image and second energy image to compute a maximum of both the energies and provide a maximum energy image; binarization means adapted to receive said maximum energy image and provide a binarized image; dilation means adapted to receive said binarized image and perform a dilation operation to provide a dilated image; clustering means adapted to receive said dilated image and formulate different clusters based on the density of the dilated areas and provide a clustered image; and box creation means adapted to create bounding boxes enclosing each cluster in the clustered image to form an image of the document having image segments. 4. The system as claimed in claim 1 , wherein said dilation means is adapted to add pixels at boundaries of black pixels in the binarized image thereby providing a thickened and connected image. | 0.907266 |
8,346,545 | 1 | 5 | 1. A model-based distortion compensating noise reduction apparatus for speech recognition, the apparatus comprising: a speech absence probability calculator for calculating the probability distribution for absence and existence of a speech by using the sound absence and existence information for frames; a noise estimation updater for estimating a more accurate noise component by updating the variance of the clean speech and noise for each frame; a speech absence probability-based noise filter for outputting a first clean speech through the speech absence probability transmitted from the speech absence probability calculator and a first noise filter; a post probability calculator for calculating post probabilities for mixtures using a Gaussian mixture model (GMM) containing a clean speech in the first clean speech; and a final filter designer for forming a second noise filter and outputting an improved final clean speech signal using the second noise filter. | 1. A model-based distortion compensating noise reduction apparatus for speech recognition, the apparatus comprising: a speech absence probability calculator for calculating the probability distribution for absence and existence of a speech by using the sound absence and existence information for frames; a noise estimation updater for estimating a more accurate noise component by updating the variance of the clean speech and noise for each frame; a speech absence probability-based noise filter for outputting a first clean speech through the speech absence probability transmitted from the speech absence probability calculator and a first noise filter; a post probability calculator for calculating post probabilities for mixtures using a Gaussian mixture model (GMM) containing a clean speech in the first clean speech; and a final filter designer for forming a second noise filter and outputting an improved final clean speech signal using the second noise filter. 5. The apparatus of claim 1 , wherein the first noise filter uses a clean speech obtained from a previous frame and a first prior signal-to-noise ratio calculated using a preset smoothing parameter value. | 0.642105 |
4,214,125 | 22 | 96 | 22. A method of compressing information bearing signals such as speech to reduce the information content thereof without destroying the intelligibility thereof, said method comprising the steps of mozer phase adjusting said signals to produce equivalent signals having symmetric portions, and deleting selected redundant portions of said equivalent signals. | 22. A method of compressing information bearing signals such as speech to reduce the information content thereof without destroying the intelligibility thereof, said method comprising the steps of mozer phase adjusting said signals to produce equivalent signals having symmetric portions, and deleting selected redundant portions of said equivalent signals. 96. The method of claim 22 wherein said information bearing signals are speech signals containing portions corresponding to phonemes and phoneme groups, and wherein said method further includes the step of selecting signals representative of portions of particular phonemes and phoneme groups lying between every nth pitch period, deleting the signals so selected, and generating second instruction signals specifying the particular portions of said phonemes and phoneme groups so selected for deletion and identifying the values of n. | 0.552676 |
9,002,873 | 1 | 2 | 1. A method of filtering a corpus of documents relevant to a litigation, comprising: identifying the corpus of documents to be filtered, wherein the documents are relevant to a litigation; generating a first modifiable query, wherein the first modifiable query comprises desired characteristics of the documents in the corpus; filtering the corpus of documents in accordance with the first modifiable query into a first result set; naming the first result set of the first modifiable query with a first name that identifies the first result set; generating a second modifiable query, wherein the second modifiable query comprises desired characteristics of the documents in the first result set; filtering the first result set in accordance with the second modifiable query to generate a second result set based on the first modifiable query and the second modifiable query, the filtering the first result set further comprising: applying the second modifiable query to the first result set by using the first result set, specified by the first name that identifies the first result set, as a source of documents for the applying the second modifiable query; naming the second result set with a second name that identifies the second result set; labeling elements of the second result set with the second name that identifies the second result set, wherein the labeling enables presentation of the first and second modifiable queries in response to a user selection; determining a change in either the first modifiable query or second modifiable query; and automatically updating the second result set, without additional user involvement, to reflect the change in either the first modifiable query or the second modifiable query. | 1. A method of filtering a corpus of documents relevant to a litigation, comprising: identifying the corpus of documents to be filtered, wherein the documents are relevant to a litigation; generating a first modifiable query, wherein the first modifiable query comprises desired characteristics of the documents in the corpus; filtering the corpus of documents in accordance with the first modifiable query into a first result set; naming the first result set of the first modifiable query with a first name that identifies the first result set; generating a second modifiable query, wherein the second modifiable query comprises desired characteristics of the documents in the first result set; filtering the first result set in accordance with the second modifiable query to generate a second result set based on the first modifiable query and the second modifiable query, the filtering the first result set further comprising: applying the second modifiable query to the first result set by using the first result set, specified by the first name that identifies the first result set, as a source of documents for the applying the second modifiable query; naming the second result set with a second name that identifies the second result set; labeling elements of the second result set with the second name that identifies the second result set, wherein the labeling enables presentation of the first and second modifiable queries in response to a user selection; determining a change in either the first modifiable query or second modifiable query; and automatically updating the second result set, without additional user involvement, to reflect the change in either the first modifiable query or the second modifiable query. 2. The method of claim 1 , wherein the first modifiable query further comprises undesired characteristics of the documents in the corpus. | 0.537162 |
9,640,181 | 10 | 16 | 10. A method of editing on a headset computer device, comprising: by a processor, generating orientational sensing information describing an orientation of the headset computer; producing user input based on user utterances received via a microphone and the orientational sensing information; transcribing the user utterances to produce transcription text; displaying the transcription text; responding to the user input directed to editing the displayed transcription text; and providing editing assistance using fuzzy matching. | 10. A method of editing on a headset computer device, comprising: by a processor, generating orientational sensing information describing an orientation of the headset computer; producing user input based on user utterances received via a microphone and the orientational sensing information; transcribing the user utterances to produce transcription text; displaying the transcription text; responding to the user input directed to editing the displayed transcription text; and providing editing assistance using fuzzy matching. 16. The method of claim 10 , wherein the user input includes at least one of (i) a user control gesture, and (ii) a user control utterance, for selecting a portion of the transcription text. | 0.5 |
9,766,767 | 2 | 3 | 2. The method of claim 1 , wherein the adjusting of the display position of the first text field comprises displaying the focus on the first text field when an entirety of the first text field is being displayed on the first display area according to the adjustment. | 2. The method of claim 1 , wherein the adjusting of the display position of the first text field comprises displaying the focus on the first text field when an entirety of the first text field is being displayed on the first display area according to the adjustment. 3. The method of claim 2 , further comprising: entering text entered through the displayed SIP into the first text field. | 0.5 |
8,412,703 | 1 | 2 | 1. An electronic interface for a scientific database query system permitting retrieval from an electronic scientific database of scientific documents having text and associated figures as stored in the electronic scientific database, the figures described at least in part by text, the electronic interface comprising: an electronic computer executing a stored program to: (a) receive from the electronic scientific database at least one document selected from the electronic scientific database based on a text query from a human operator; and (b) review the text of the document and the associated figures to provide a ranking of the figures independent from an ordering of the figures in the document and according to an automated determination of an importance of the figure with respect to a subject matter of the document, wherein the ranking is derived from the text of the document. | 1. An electronic interface for a scientific database query system permitting retrieval from an electronic scientific database of scientific documents having text and associated figures as stored in the electronic scientific database, the figures described at least in part by text, the electronic interface comprising: an electronic computer executing a stored program to: (a) receive from the electronic scientific database at least one document selected from the electronic scientific database based on a text query from a human operator; and (b) review the text of the document and the associated figures to provide a ranking of the figures independent from an ordering of the figures in the document and according to an automated determination of an importance of the figure with respect to a subject matter of the document, wherein the ranking is derived from the text of the document. 2. The electronic interface of claim 1 wherein the electronic computer further executes the stored program to: (c) create additional searchable data for the document in the electronic scientific database based at least in part on the ranking. | 0.5 |
9,298,781 | 4 | 12 | 4. A method comprising: determining, via the at least one computing device, that a degree of behavioral association between at least one search term and an item exceeds a threshold; determining, via the at least one computing device, that a search of a repository for the at least one search term surfaces the item at a position less relevant than a plurality of initial search results; and in response to determining that the degree of behavioral association between the at least one search term and the item exceeds the threshold and determining that the search surfaces the item at the position less relevant than the plurality of initial search results, determining that the at least one search term is excluded from product data associated with the item; and in response to determining that the at least one search term is excluded from product data associated with the item, taking, via the at least one computing device, at least one remedial measure comprising adding the at least one search term to the product data. | 4. A method comprising: determining, via the at least one computing device, that a degree of behavioral association between at least one search term and an item exceeds a threshold; determining, via the at least one computing device, that a search of a repository for the at least one search term surfaces the item at a position less relevant than a plurality of initial search results; and in response to determining that the degree of behavioral association between the at least one search term and the item exceeds the threshold and determining that the search surfaces the item at the position less relevant than the plurality of initial search results, determining that the at least one search term is excluded from product data associated with the item; and in response to determining that the at least one search term is excluded from product data associated with the item, taking, via the at least one computing device, at least one remedial measure comprising adding the at least one search term to the product data. 12. The method of claim 4 , wherein determining that the search of the repository for the at least one search term surfaces the item at the position less relevant than the plurality of initial search results further comprises determining that the at least one search term appears in at least one attribute associated with the item in the repository. | 0.581535 |
5,590,256 | 7 | 8 | 7. A method as recited in claim 6 wherein said pointer comprises stylus means contacting a screen of a pen-based computer system. | 7. A method as recited in claim 6 wherein said pointer comprises stylus means contacting a screen of a pen-based computer system. 8. A method as recited in claim 7 wherein the header bar includes a sizing button, the sizing button being operative to adjust a length of the note area associated with the header bar, and wherein said sizing gesture is made to the sizing button, and said sizing gesture comprises contacting said stylus with said screen over the sizing button of said header bar and moving said stylus without lifting said stylus from said screen. | 0.5 |
8,983,839 | 1 | 14 | 1. A computer-implemented method of facilitating dynamic-recognition-grammar-based interpretation of one or more natural language utterance, the method being implemented by a computer system that includes one or more physical processors executing computer program instructions which, when executed, perform the method, the method comprising: receiving, by the computer system, a natural language utterance relating to a navigation context; determining, by the computer system, one or more similarities between a user associated with the natural language utterance and one or more other users; determining, by the computer system, a dynamic recognition grammar based on the one or more determined similarities; and generating, by the computer system, one or more interpretations associated with the natural language utterance based on the dynamic recognition grammar. | 1. A computer-implemented method of facilitating dynamic-recognition-grammar-based interpretation of one or more natural language utterance, the method being implemented by a computer system that includes one or more physical processors executing computer program instructions which, when executed, perform the method, the method comprising: receiving, by the computer system, a natural language utterance relating to a navigation context; determining, by the computer system, one or more similarities between a user associated with the natural language utterance and one or more other users; determining, by the computer system, a dynamic recognition grammar based on the one or more determined similarities; and generating, by the computer system, one or more interpretations associated with the natural language utterance based on the dynamic recognition grammar. 14. The method of claim 1 , the method further comprising: receiving, by the computer system, a subsequent natural language utterance; updating, by the computer system, the dynamic recognition grammar based on the subsequent natural language utterance; and refining, by the computer system, the one or more interpretations associated with the natural language utterance based on the updated dynamic recognition grammar. | 0.724342 |
9,594,730 | 11 | 17 | 11. One or more non-transitory computer-readable media storing instructions which, when processed by one or more processors, cause: processing a web page to determine a plurality of segments, wherein each segment from the plurality of segments includes one or more HTML elements; each machine-based classifier of a plurality of machine-based classifiers generating, based at least upon metadata associated with two or more segments from the plurality of segments that indicates one or more presentation features in the HTML elements of the two or more segments from the plurality of segments, a probability output for each segment of the two or more segments from the plurality of segments, wherein each functional category from the plurality of functional categories corresponds to a functional role of HTML elements in the web page; wherein each machine-based classifier from the plurality of machine-based classifiers corresponds to a functional category from the plurality of functional categories; assigning, based on the plurality of probability output, one or more functional categories to each segment of the two or more segments; a first application selecting a first set of functional categories from the plurality of functional categories; a second application that is different than the first application selecting a second set of functional categories from the plurality of functional categories, wherein the second set of functional categories does not include functional categories from the first set of functional categories; the first application selecting for processing, based upon the first set of functional categories and the functional categories assigned to the two or more segments, a first set of one or more segments from the two or more segments; the second application selecting for processing, based upon the second set of functional categories and the functional categories assigned to the two or more segments, a second set of one or more segments from the two or more segments, wherein the second set of one or more segments includes at least one segment that is not in the first set of one or more segments and the first set of one or more segments includes at least one segment that is not in the second set of one or more segments; the first application processing content contained in the first set of one or more segments and not processing content contained in the second set of one or more segments; and the second application processing content contained in the second set of one or more segments and not processing content contained in the first set of one or more segments. | 11. One or more non-transitory computer-readable media storing instructions which, when processed by one or more processors, cause: processing a web page to determine a plurality of segments, wherein each segment from the plurality of segments includes one or more HTML elements; each machine-based classifier of a plurality of machine-based classifiers generating, based at least upon metadata associated with two or more segments from the plurality of segments that indicates one or more presentation features in the HTML elements of the two or more segments from the plurality of segments, a probability output for each segment of the two or more segments from the plurality of segments, wherein each functional category from the plurality of functional categories corresponds to a functional role of HTML elements in the web page; wherein each machine-based classifier from the plurality of machine-based classifiers corresponds to a functional category from the plurality of functional categories; assigning, based on the plurality of probability output, one or more functional categories to each segment of the two or more segments; a first application selecting a first set of functional categories from the plurality of functional categories; a second application that is different than the first application selecting a second set of functional categories from the plurality of functional categories, wherein the second set of functional categories does not include functional categories from the first set of functional categories; the first application selecting for processing, based upon the first set of functional categories and the functional categories assigned to the two or more segments, a first set of one or more segments from the two or more segments; the second application selecting for processing, based upon the second set of functional categories and the functional categories assigned to the two or more segments, a second set of one or more segments from the two or more segments, wherein the second set of one or more segments includes at least one segment that is not in the first set of one or more segments and the first set of one or more segments includes at least one segment that is not in the second set of one or more segments; the first application processing content contained in the first set of one or more segments and not processing content contained in the second set of one or more segments; and the second application processing content contained in the second set of one or more segments and not processing content contained in the first set of one or more segments. 17. The one or more non-transitory computer-readable media of claim 11 , wherein the first application determines a topic for the web page by analyzing a frequency of words that appear as text within the first set of one or more segments; and wherein the frequency of words that appear as text within segments of the first set of one or more segments assigned an advertisement functional category or user-generated content functional category are not analyzed. | 0.613445 |
8,396,871 | 26 | 28 | 26. An article as in claim 19 , wherein the operations further comprise: sending data characterizing supplemental documents within a stack other than the provided documents to at least one human reviewer for quality control. | 26. An article as in claim 19 , wherein the operations further comprise: sending data characterizing supplemental documents within a stack other than the provided documents to at least one human reviewer for quality control. 28. An article as in claim 26 , wherein the operations further comprise: defining tiers of documents within each stack, and wherein the supplemental documents comprise documents from two or more tiers. | 0.63587 |
9,749,274 | 11 | 14 | 11. A computer implemented method, comprising: identifying one or more electronic messages associated with a user; identifying an event associated with the electronic messages; determining one or more event attributes of the event, the event attributes including at least one event location identifier identifying a physical event location, wherein determining the one or more event attributes includes determining, based on the event being associated with the electronic messages, at least one of the event attributes based on at least one of the electronic messages; storing, in association with the user in one or more databases: an association of the event location identifier with the at least one of the event attributes determined based on the at least one of the electronic messages; receiving a query that includes a plurality of terms; identifying the at least one of the event attributes is relevant to the query based on determining that at least one of the terms matches the event location identifier having the stored association with the at least one of the event attributes; and providing, in response to the query and based on identifying the at least one of the event attributes is relevant to the query, content that is based on the at least one of the event attributes. | 11. A computer implemented method, comprising: identifying one or more electronic messages associated with a user; identifying an event associated with the electronic messages; determining one or more event attributes of the event, the event attributes including at least one event location identifier identifying a physical event location, wherein determining the one or more event attributes includes determining, based on the event being associated with the electronic messages, at least one of the event attributes based on at least one of the electronic messages; storing, in association with the user in one or more databases: an association of the event location identifier with the at least one of the event attributes determined based on the at least one of the electronic messages; receiving a query that includes a plurality of terms; identifying the at least one of the event attributes is relevant to the query based on determining that at least one of the terms matches the event location identifier having the stored association with the at least one of the event attributes; and providing, in response to the query and based on identifying the at least one of the event attributes is relevant to the query, content that is based on the at least one of the event attributes. 14. The method of claim 11 , wherein the electronic messages associated with the user include at least a first electronic message generated by the user and at least one second electronic message received by the user. | 0.816014 |
8,572,024 | 1 | 11 | 1. A computer-implemented method of extracting information from co-occurring Hyper Text Mark-up Language (HTML) structured documents, the method comprising: receiving one or more web sites selected by a user for data extraction; collecting a plurality of co-occurring different HTML structured documents for each of the selected web sites at a computer comprising a processor; forming a plurality of clusters comprising different subsets of the co-occurring HTML structured documents, wherein: each cluster comprises a different HTML structured document of the plurality of co-occurring HTML structured documents as a centroid document and other HTML structured documents of the plurality of co-occurring HTML structured documents that achieve a threshold of similarity with respect to the centroid document, the clusters are formed by comparing each co-occurring HTML structured document to each centroid document of each cluster, and an alignment algorithm is used to determine the co-occurring HTML structured documents that achieve the threshold of similarity with respect to each centroid document by comparing structured locations of data fields for storing data elements within each centroid document and structured locations of corresponding data fields for storing data elements within each of the co-occurring HTML structured documents, the co-occurring HTML structured documents are compared to each centroid document based on similarity of structured locations of corresponding data fields within the HTML data structures, displaying the centroid document of a particular cluster selected from a list of clusters; and providing a user interface displaying content of data elements identified from the other HTML structured documents of the particular cluster on a computer display. | 1. A computer-implemented method of extracting information from co-occurring Hyper Text Mark-up Language (HTML) structured documents, the method comprising: receiving one or more web sites selected by a user for data extraction; collecting a plurality of co-occurring different HTML structured documents for each of the selected web sites at a computer comprising a processor; forming a plurality of clusters comprising different subsets of the co-occurring HTML structured documents, wherein: each cluster comprises a different HTML structured document of the plurality of co-occurring HTML structured documents as a centroid document and other HTML structured documents of the plurality of co-occurring HTML structured documents that achieve a threshold of similarity with respect to the centroid document, the clusters are formed by comparing each co-occurring HTML structured document to each centroid document of each cluster, and an alignment algorithm is used to determine the co-occurring HTML structured documents that achieve the threshold of similarity with respect to each centroid document by comparing structured locations of data fields for storing data elements within each centroid document and structured locations of corresponding data fields for storing data elements within each of the co-occurring HTML structured documents, the co-occurring HTML structured documents are compared to each centroid document based on similarity of structured locations of corresponding data fields within the HTML data structures, displaying the centroid document of a particular cluster selected from a list of clusters; and providing a user interface displaying content of data elements identified from the other HTML structured documents of the particular cluster on a computer display. 11. The method of claim 1 , further comprising: receiving a new HTML structured document; selecting the most similar centroid document to the new HTML structured document based on the relative structural similarity of HTML data structure of the new HTML structured document and HTML data structure of each centroid document of each cluster; adding the new HTML structured document to the cluster that includes the selected centroid document if the new HTML structured document achieves a threshold of similarity with respect to the selected centroid document; marking a data element on the selected centroid document; and identifying a data element on the new HTML structured document that corresponds to the marked data element on the selected centroid document. | 0.5 |
9,201,866 | 16 | 21 | 16. A computer-program product tangibly embodied in a non-transitory, computer-readable storage medium that stores instructions, the instructions executable by a data processing apparatus for performing operations including: accessing, using one or more processors, a mood evaluation index from a first electronic data store, wherein the mood evaluation index maps text to mood categories, wherein text describes a state associated with at least one of the mood categories, and wherein a mood category is associated with a state; mapping text to a mood category using the mood evaluation index, wherein the mood evaluation index associates a state with the text; calculating a mood weight for the text, wherein mood weights are calculated using a mood evaluation index, and wherein mood weights represent an intensity of the state that the text describes; accessing a message from a second electronic data store, wherein the message includes text mapped by the mood evaluation index; using the mood evaluation index to identify text included in the message that is mapped to a mood category; determining whether a modifier is in proximity to identified text; adjusting the mood weight of the identified text that is in proximity to the modifier; summing the mood weights of the identified text, wherein summing includes determining a category score corresponding to the mood category; and outputting the category score corresponding to the mood category to a third electronic data store, wherein the modifier is a negation, and wherein the adjusting the mood weight of the identified text that is in proximity to the modifier includes changing one of a positive mood to a negative mood or changing a negative mood to a positive mood. | 16. A computer-program product tangibly embodied in a non-transitory, computer-readable storage medium that stores instructions, the instructions executable by a data processing apparatus for performing operations including: accessing, using one or more processors, a mood evaluation index from a first electronic data store, wherein the mood evaluation index maps text to mood categories, wherein text describes a state associated with at least one of the mood categories, and wherein a mood category is associated with a state; mapping text to a mood category using the mood evaluation index, wherein the mood evaluation index associates a state with the text; calculating a mood weight for the text, wherein mood weights are calculated using a mood evaluation index, and wherein mood weights represent an intensity of the state that the text describes; accessing a message from a second electronic data store, wherein the message includes text mapped by the mood evaluation index; using the mood evaluation index to identify text included in the message that is mapped to a mood category; determining whether a modifier is in proximity to identified text; adjusting the mood weight of the identified text that is in proximity to the modifier; summing the mood weights of the identified text, wherein summing includes determining a category score corresponding to the mood category; and outputting the category score corresponding to the mood category to a third electronic data store, wherein the modifier is a negation, and wherein the adjusting the mood weight of the identified text that is in proximity to the modifier includes changing one of a positive mood to a negative mood or changing a negative mood to a positive mood. 21. The computer-program product of claim 16 , wherein the message is accessed from an information database. | 0.861538 |
9,268,560 | 1 | 5 | 1. A method for indicating a change to a dependent file, the method comprising: receiving a first change to a program file; performing, via a computing device, a second change to code or program data in a first dependent file on the program file; wherein the second change is related to the first change; and displaying, in a document editor via the computing device, a first identifier for the first dependent file in a first text style, if the first dependent file is changed based on the first change to the program file; displaying, in the document editor via the computing device, a second identifier, in a second text style, for a second dependent file, if the second dependent file is not changed based on the first change to the program file wherein: code of the program file calls code or program data of the first dependent file and the second dependent file, the first text style indicates the first dependent file has been changed based on the first change to the program file, and the first text style and the second text style are different styles. | 1. A method for indicating a change to a dependent file, the method comprising: receiving a first change to a program file; performing, via a computing device, a second change to code or program data in a first dependent file on the program file; wherein the second change is related to the first change; and displaying, in a document editor via the computing device, a first identifier for the first dependent file in a first text style, if the first dependent file is changed based on the first change to the program file; displaying, in the document editor via the computing device, a second identifier, in a second text style, for a second dependent file, if the second dependent file is not changed based on the first change to the program file wherein: code of the program file calls code or program data of the first dependent file and the second dependent file, the first text style indicates the first dependent file has been changed based on the first change to the program file, and the first text style and the second text style are different styles. 5. The method of claim 1 , wherein the first identifier includes text that has the first text style and the second identifier includes text that has the second text style. | 0.640756 |
9,965,502 | 1 | 5 | 1. An apparatus which manages a plurality of objects, each object including content data and metadata, the apparatus comprising: a processor; and a memory that stores a program, which when executed by the processor, programs the processor to: generate an index for the objects using a plurality of content properties including a first content property and a second content property, the first content property having a first name of the first content property and first expression information for extracting values from fields in the metadata of one or more of the objects, and the second content property having the first name and second expression information for extracting values from the fields in the metadata of one or more of the objects so that at least a portion of the index is deduplicated such that values for multiple relevant expressions are able to be returned for a single search request; upon receipt of a search request including the first name and a first value, search the index for one or more objects that have at least one of: the first value in at least one of the fields identified based on the first expression information in the metadata, or the first value in at least one of the fields identified based on the second expression information in the metadata; and based on finding a plurality of matches, return an indication of at least one of the objects determined to include the first value in at least one of the fields identified in the metadata based on the first expression information or in at least one of the fields identified in the metadata based on the second expression information. | 1. An apparatus which manages a plurality of objects, each object including content data and metadata, the apparatus comprising: a processor; and a memory that stores a program, which when executed by the processor, programs the processor to: generate an index for the objects using a plurality of content properties including a first content property and a second content property, the first content property having a first name of the first content property and first expression information for extracting values from fields in the metadata of one or more of the objects, and the second content property having the first name and second expression information for extracting values from the fields in the metadata of one or more of the objects so that at least a portion of the index is deduplicated such that values for multiple relevant expressions are able to be returned for a single search request; upon receipt of a search request including the first name and a first value, search the index for one or more objects that have at least one of: the first value in at least one of the fields identified based on the first expression information in the metadata, or the first value in at least one of the fields identified based on the second expression information in the metadata; and based on finding a plurality of matches, return an indication of at least one of the objects determined to include the first value in at least one of the fields identified in the metadata based on the first expression information or in at least one of the fields identified in the metadata based on the second expression information. 5. An apparatus according to claim 1 , wherein the metadata includes a plurality of annotations of the content data, the annotations including a first annotation generated by a first application and a second annotation generated by a second application. | 0.5 |
9,323,722 | 7 | 9 | 7. A system comprising: a processor; a memory sub-system communicatively coupled to the processor and having instructions stored thereon, that, when executed by the processor, cause the processor to perform operations comprising: while receiving one or more first characters in a sequence of characters being entered into an input field of an interactive user interface of a client device and before the sequence of characters has been completely entered, performing by the client device: parsing the one or more first characters using a first string parsing pattern associated with a first model to generate first parsed input, the first model specifying a first string presentation format, wherein parsing includes: identifying an error indicating that the one or more first characters cannot be parsed by the first string parsing pattern associated with the first model; presenting the first parsed input in the interactive user interface formatted according to the first string presentation format; in response to identifying the error: presenting information identifying the error in the interactive user interface, the information including a message specifying the error and sending a request to identify a second model to a server, wherein the request includes the one or more first characters; receiving, from the server and based on the request, a second model, the second model being different from the first model and associated with a second string parsing pattern and a second string presentation format, wherein the second model is a software component that contains information and processing instructions required to achieve a functionality on the client device and the second model being configured to address the error indicating that the one or more first characters cannot be parsed by the first string parsing pattern associated with the first model; parsing one or more second characters using the second string parsing pattern to generate second parsed input, the second characters including the one or more first characters and zero or more characters entered subsequent to the one or more first characters, wherein the second string parsing pattern is different from the first string parsing pattern; and presenting the second parsed input in the interactive user interface formatted according to the second string presentation format. | 7. A system comprising: a processor; a memory sub-system communicatively coupled to the processor and having instructions stored thereon, that, when executed by the processor, cause the processor to perform operations comprising: while receiving one or more first characters in a sequence of characters being entered into an input field of an interactive user interface of a client device and before the sequence of characters has been completely entered, performing by the client device: parsing the one or more first characters using a first string parsing pattern associated with a first model to generate first parsed input, the first model specifying a first string presentation format, wherein parsing includes: identifying an error indicating that the one or more first characters cannot be parsed by the first string parsing pattern associated with the first model; presenting the first parsed input in the interactive user interface formatted according to the first string presentation format; in response to identifying the error: presenting information identifying the error in the interactive user interface, the information including a message specifying the error and sending a request to identify a second model to a server, wherein the request includes the one or more first characters; receiving, from the server and based on the request, a second model, the second model being different from the first model and associated with a second string parsing pattern and a second string presentation format, wherein the second model is a software component that contains information and processing instructions required to achieve a functionality on the client device and the second model being configured to address the error indicating that the one or more first characters cannot be parsed by the first string parsing pattern associated with the first model; parsing one or more second characters using the second string parsing pattern to generate second parsed input, the second characters including the one or more first characters and zero or more characters entered subsequent to the one or more first characters, wherein the second string parsing pattern is different from the first string parsing pattern; and presenting the second parsed input in the interactive user interface formatted according to the second string presentation format. 9. The system of claim 7 , wherein: the second model is an email model; the second string parsing pattern comprises a regular expression; parsing one or more second characters using the second string parsing pattern comprises parsing the one or more second characters to identify capture groups; and presenting the second parsed input in the interactive user interface formatted according to the second string presentation format comprises formatting the second parsed input according to the capture groups. | 0.553697 |
8,078,963 | 48 | 50 | 48. A non-transitory computer readable medium storing a computer program which when executed by at least one processor places content in a document created based on a template comprising a plurality of template pages, the computer program comprising sets of instructions for: receiving a selection of a template page comprising (i) a body layer for holding in-line content and (ii) a floating layer for holding floating content that is moveable to a location of the in-line content so that the in-line content at the location re-arranges around the floating content, the body layer comprising a first set of fields and the floating layer comprising a second set of fields; adding the template page to the document, wherein the added template page comprises a placeholder in-line content in a first field of the first set of fields of the body layer and a placeholder floating content in a second field of the second set of fields of the floating layer; in response to a first drag-and-drop operation that drags a first content and drops the first content over the first field of the body layer without selecting the placeholder in-line content in the first field, replacing the entire placeholder in-line content in the first field with the first content; and in response to a second drag-and-drop operation that drags a second content and drops the second content over the second field of the floating layer without selecting the placeholder floating content in the second field, replacing the entire placeholder floating content in the second field with the second content. | 48. A non-transitory computer readable medium storing a computer program which when executed by at least one processor places content in a document created based on a template comprising a plurality of template pages, the computer program comprising sets of instructions for: receiving a selection of a template page comprising (i) a body layer for holding in-line content and (ii) a floating layer for holding floating content that is moveable to a location of the in-line content so that the in-line content at the location re-arranges around the floating content, the body layer comprising a first set of fields and the floating layer comprising a second set of fields; adding the template page to the document, wherein the added template page comprises a placeholder in-line content in a first field of the first set of fields of the body layer and a placeholder floating content in a second field of the second set of fields of the floating layer; in response to a first drag-and-drop operation that drags a first content and drops the first content over the first field of the body layer without selecting the placeholder in-line content in the first field, replacing the entire placeholder in-line content in the first field with the first content; and in response to a second drag-and-drop operation that drags a second content and drops the second content over the second field of the floating layer without selecting the placeholder floating content in the second field, replacing the entire placeholder floating content in the second field with the second content. 50. The non-transitory computer readable medium of claim 48 , wherein said second content comprises one of a text box and multimedia. | 0.776094 |
10,157,055 | 12 | 13 | 12. The computing device of claim 8 , wherein said generating a dependency graph from the first syntax tree with each node of the dependency graph corresponding to a code statement and having an assigned weight comprises: generating a dependency graph by following on variables resulting from each code statement of the first syntax tree; and assigning weights to the nodes of the dependency graph. | 12. The computing device of claim 8 , wherein said generating a dependency graph from the first syntax tree with each node of the dependency graph corresponding to a code statement and having an assigned weight comprises: generating a dependency graph by following on variables resulting from each code statement of the first syntax tree; and assigning weights to the nodes of the dependency graph. 13. The computing device of claim 12 , wherein said assigning weights to the nodes of the dependency graph comprises: assigning a first weight to nodes of the dependency graph corresponding to code statements that start asynchronous operations; assigning a second weight to nodes of the dependency graph corresponding to code statements that await; and assigning a third weight to nodes of the dependency graph not assigned the first weight and not assigned the second weight. | 0.5 |
8,810,583 | 11 | 13 | 11. The apparatus of claim 10 , wherein the animation content generation unit comprises: a scenario generation unit configured to generate a scenario script used to create the animation; a presentation style generation unit configured to generate the media style information indicating a style of the animation; and an environmental element setting unit configured to generate environmental element setting information about objects and settings that appear in the animation. | 11. The apparatus of claim 10 , wherein the animation content generation unit comprises: a scenario generation unit configured to generate a scenario script used to create the animation; a presentation style generation unit configured to generate the media style information indicating a style of the animation; and an environmental element setting unit configured to generate environmental element setting information about objects and settings that appear in the animation. 13. The apparatus of claim 11 , wherein if the analyzed text comprises a compound verb, the scenario generation unit is further configured to generate the scenario script by converting the compound verb into a series of two or more actions. | 0.646018 |
8,290,977 | 52 | 53 | 52. The system of claim 29 , further comprising: a module for transforming a markup language document comprising a plurality of elements for storage in a database. | 52. The system of claim 29 , further comprising: a module for transforming a markup language document comprising a plurality of elements for storage in a database. 53. The system of claim 52 , wherein the module for transforming assigns a unique identifier to each element of the markup language document. | 0.5 |
7,992,085 | 1 | 6 | 1. A method of providing information associated with a focused-on item in an electronic document, comprising: receiving a first user-initiated selection comprising a focus on an item contained in an electronic document; evaluating a current mode of the electronic document selected from a first mode in which a plurality of editing functions of the electronic document are disabled, and a second mode in which the plurality of editing functions of the electronic document are enabled; automatically initiating a search for information on the focused-on item when the current mode is evaluated as the first mode; receiving a second user-initiated selection for initiating the search for information on the focused-on item when the current mode is evaluated as the second mode, wherein the second user selection is selected from a group comprising: a simultaneous keyboard and mouse selection; and a control selection accessed in one of a control toolbar and a drop-down menu; passing data representing the focused-on item to an information source following initiating the search for information on the focused-on item; receiving the information associated with the focused-on item from the information source; automatically displaying the returned information associated with the focused-on item in a user interface in the electronic document in proximity to the focused-on item; and when the information associated with the focused-on item will not fit in an available display space provided in the user interface: truncating a portion of the information such that only a portion of the information that will fit in the available display space provided in the user interface is displayed; and disposing a selectable control tab on a first side the user interface which, when selected, causes a display of the truncated portion of the information, the selectable control tab including: a first selectable tab which, when selected, causes to be displayed a first portion of the truncated portion of the information; and a second selectable tab which, when selected, causes to be displayed a second portion of the truncated portion of the information; the first and second selectable tabs extending from the user interface, with the first selectable tab being positioned above the second selectable tab. | 1. A method of providing information associated with a focused-on item in an electronic document, comprising: receiving a first user-initiated selection comprising a focus on an item contained in an electronic document; evaluating a current mode of the electronic document selected from a first mode in which a plurality of editing functions of the electronic document are disabled, and a second mode in which the plurality of editing functions of the electronic document are enabled; automatically initiating a search for information on the focused-on item when the current mode is evaluated as the first mode; receiving a second user-initiated selection for initiating the search for information on the focused-on item when the current mode is evaluated as the second mode, wherein the second user selection is selected from a group comprising: a simultaneous keyboard and mouse selection; and a control selection accessed in one of a control toolbar and a drop-down menu; passing data representing the focused-on item to an information source following initiating the search for information on the focused-on item; receiving the information associated with the focused-on item from the information source; automatically displaying the returned information associated with the focused-on item in a user interface in the electronic document in proximity to the focused-on item; and when the information associated with the focused-on item will not fit in an available display space provided in the user interface: truncating a portion of the information such that only a portion of the information that will fit in the available display space provided in the user interface is displayed; and disposing a selectable control tab on a first side the user interface which, when selected, causes a display of the truncated portion of the information, the selectable control tab including: a first selectable tab which, when selected, causes to be displayed a first portion of the truncated portion of the information; and a second selectable tab which, when selected, causes to be displayed a second portion of the truncated portion of the information; the first and second selectable tabs extending from the user interface, with the first selectable tab being positioned above the second selectable tab. 6. The method of claim 1 , wherein passing data representing the focused-on item to an information source includes passing an Extensible Markup Language (XML) formatted query to the information source that identifies a type of information associated with the focused-on item that is requested from the information source. | 0.794494 |
8,156,429 | 1 | 3 | 1. A server communicatively coupled to an Internet Protocol “IP” network and configured to transfer markup language based content that represents a web page to a client computer within the network, the server comprising: a dispatcher module that: interfaces to a content source and receives a markup language content from the content source, wherein the received markup language content is targeted toward a browser application at a requesting client computer and includes one or more browser links; provides at least a portion of the received markup language content to a markup language object module; receives modified markup language content from the markup language object module; and sends the modified markup language content toward the browser application at the requesting client computer; and the markup language object module that: receives the provided markup language content from the dispatcher module; parses the provided markup language content; identifies a browser link within the provided markup language content; traverses the browser link to obtain the corresponding object; replaces the browser link in the provided markup language content with the corresponding object to modify the provided markup language content; and provides the modified markup language content to the dispatcher module; wherein the server operates in an intermediate node communicatively positioned between the content source and the requesting client; wherein the modified markup language content that is sent toward the browser application has a reduced number of browser links than the markup language content received from the content server; and wherein the modification is transparent to the browser application at the client computer. | 1. A server communicatively coupled to an Internet Protocol “IP” network and configured to transfer markup language based content that represents a web page to a client computer within the network, the server comprising: a dispatcher module that: interfaces to a content source and receives a markup language content from the content source, wherein the received markup language content is targeted toward a browser application at a requesting client computer and includes one or more browser links; provides at least a portion of the received markup language content to a markup language object module; receives modified markup language content from the markup language object module; and sends the modified markup language content toward the browser application at the requesting client computer; and the markup language object module that: receives the provided markup language content from the dispatcher module; parses the provided markup language content; identifies a browser link within the provided markup language content; traverses the browser link to obtain the corresponding object; replaces the browser link in the provided markup language content with the corresponding object to modify the provided markup language content; and provides the modified markup language content to the dispatcher module; wherein the server operates in an intermediate node communicatively positioned between the content source and the requesting client; wherein the modified markup language content that is sent toward the browser application has a reduced number of browser links than the markup language content received from the content server; and wherein the modification is transparent to the browser application at the client computer. 3. The server of claim 1 , wherein the markup language of the markup language content is selected from the group of markup languages consisting of Hyper Text Markup Language “HTML”, Extensible Markup Language “XML”, Wireless Markup Language “WML”, Standardized General Markup Language “SGML”, and Handheld Device Markup Language “HDML”. | 0.641026 |
9,686,423 | 1 | 2 | 1. An apparatus comprising: a controller of a scanner configured to receive a request from a user to register a plurality of remote computing devices at the scanner for remotely assigning metadata to a scanned document generated by the scanner, to generate the scanned document at the scanner for the user, and to hold the scanned document pending a data entry activity by the user at one of the plurality of remote computing devices; the controller configured to identify a workflow associated with the scanned document, and to identify the metadata for the scanned document based on the workflow; the controller configured to identify one of the plurality of remote computing devices for performing the data entry activity by the user from the plurality of remote computing devices that are registered at the scanner, to generate a web page that requests the metadata based on the workflow, and to provide a Hypertext Transfer Protocol (HTTP) link for the web page to the one of the plurality of remote computing devices; the controller configured to receive a request from the one of the plurality of remote computing devices for the web page, to provide the web page to the one of the plurality of remote computing devices for entering the metadata for the scanned document from the user, and to receive the metadata for the scanned document utilizing the web page provided to the one of the plurality of remote computing devices; and the controller configured to assign the metadata received from the web page provided to the one of the plurality of remote computing devices to the scanned document, and to release the scanned document to a scan destination. | 1. An apparatus comprising: a controller of a scanner configured to receive a request from a user to register a plurality of remote computing devices at the scanner for remotely assigning metadata to a scanned document generated by the scanner, to generate the scanned document at the scanner for the user, and to hold the scanned document pending a data entry activity by the user at one of the plurality of remote computing devices; the controller configured to identify a workflow associated with the scanned document, and to identify the metadata for the scanned document based on the workflow; the controller configured to identify one of the plurality of remote computing devices for performing the data entry activity by the user from the plurality of remote computing devices that are registered at the scanner, to generate a web page that requests the metadata based on the workflow, and to provide a Hypertext Transfer Protocol (HTTP) link for the web page to the one of the plurality of remote computing devices; the controller configured to receive a request from the one of the plurality of remote computing devices for the web page, to provide the web page to the one of the plurality of remote computing devices for entering the metadata for the scanned document from the user, and to receive the metadata for the scanned document utilizing the web page provided to the one of the plurality of remote computing devices; and the controller configured to assign the metadata received from the web page provided to the one of the plurality of remote computing devices to the scanned document, and to release the scanned document to a scan destination. 2. The apparatus of claim 1 wherein: the controller is configured to provide the HTTP link to the one of the plurality of remote computing devices utilizing an email. | 0.707746 |
8,464,169 | 6 | 9 | 6. A method for identifying cells in a path in a flowchart, the method comprising: (a) displaying a flowchart comprising a plurality of cells, wherein the plurality of cells define a plurality of paths, wherein at least some of the plurality of cells in the flowchart comprise instructions for providing an interactive multimedia presentation, wherein at least one of the plurality of cells comprises an instruction to trigger a piece of media during the interactive multimedia presentation, wherein timing information specifies when the piece of media is to be played during the interactive multimedia presentation, and wherein at least one other of the plurality of cells comprises an instruction to gather user input during the interactive multimedia presentation; (b) receiving, from a user, a selection of a single cell in the flowchart; (c) in response to the selection of the single cell in the flowchart, determining a path comprising the single cell; (d) identifying, to the user, at least some cells in the path determined in (c) in a way that distinguishes the at least some cells in the path from at least some cells in the flowchart that are not in the path; and (e) for at least one of the plurality of cells that comprise an instruction to trigger a piece of media during the interactive multimedia presentation, displaying a description of the media that will be played during the interactive multimedia presentation. | 6. A method for identifying cells in a path in a flowchart, the method comprising: (a) displaying a flowchart comprising a plurality of cells, wherein the plurality of cells define a plurality of paths, wherein at least some of the plurality of cells in the flowchart comprise instructions for providing an interactive multimedia presentation, wherein at least one of the plurality of cells comprises an instruction to trigger a piece of media during the interactive multimedia presentation, wherein timing information specifies when the piece of media is to be played during the interactive multimedia presentation, and wherein at least one other of the plurality of cells comprises an instruction to gather user input during the interactive multimedia presentation; (b) receiving, from a user, a selection of a single cell in the flowchart; (c) in response to the selection of the single cell in the flowchart, determining a path comprising the single cell; (d) identifying, to the user, at least some cells in the path determined in (c) in a way that distinguishes the at least some cells in the path from at least some cells in the flowchart that are not in the path; and (e) for at least one of the plurality of cells that comprise an instruction to trigger a piece of media during the interactive multimedia presentation, displaying a description of the media that will be played during the interactive multimedia presentation. 9. The method of claim 6 , wherein the flowchart is displayed in a first display region, and wherein the at least some of the cells in the path are identified to the user in (d) by displaying a textual view of the at least some cells in the path, but not of the at least some cells in the flowchart that are not in the path, in a second display region. | 0.5 |
9,239,865 | 19 | 21 | 19. A system for determining recommended entities for a user based on the user's social graph, the system comprising one or more processors; and a tangible non-transitory memory accessible by the one or more processors, the memory having computer code stored thereon, the code comprising a set of instructions that causes one or more processors to perform the following: receiving, at one or more processors, a search query from the user and an identifier for a subset of the user's social graph, wherein the subset of the user's social graph includes a plurality of contacts of the user and is selected by the user from among a plurality of subsets also each having a plurality of contacts of the user; identifying, by one or more processors, a plurality of entities that match the search query; identifying, by one or more processors, one or more contacts in a subset of the user's social graph based on the identifier; determining, by one or more processors, a selected one of the plurality of entities associated with one or more of the identified contacts; and providing, by one or more processors, the plurality of entities including the selected one of plurality of entities as search results responsive to the search query in a search results display, wherein the selected entity is annotated with association information for at least one of the identified contacts including review text or a rating of the selected entity by the at least one identified contact and the selected entity is annotated with an indication of the at least one identified contact. | 19. A system for determining recommended entities for a user based on the user's social graph, the system comprising one or more processors; and a tangible non-transitory memory accessible by the one or more processors, the memory having computer code stored thereon, the code comprising a set of instructions that causes one or more processors to perform the following: receiving, at one or more processors, a search query from the user and an identifier for a subset of the user's social graph, wherein the subset of the user's social graph includes a plurality of contacts of the user and is selected by the user from among a plurality of subsets also each having a plurality of contacts of the user; identifying, by one or more processors, a plurality of entities that match the search query; identifying, by one or more processors, one or more contacts in a subset of the user's social graph based on the identifier; determining, by one or more processors, a selected one of the plurality of entities associated with one or more of the identified contacts; and providing, by one or more processors, the plurality of entities including the selected one of plurality of entities as search results responsive to the search query in a search results display, wherein the selected entity is annotated with association information for at least one of the identified contacts including review text or a rating of the selected entity by the at least one identified contact and the selected entity is annotated with an indication of the at least one identified contact. 21. The system of claim 19 , wherein providing the plurality of entities including the selected one of the plurality of entities as search results comprises presenting the selected one of the plurality of entities before any of the plurality of entities not associated with one or more of the identified contacts. | 0.5 |
8,538,753 | 3 | 5 | 3. The system of claim 1 , where the processor is further programmed to associate the conversation path with auxiliary data. | 3. The system of claim 1 , where the processor is further programmed to associate the conversation path with auxiliary data. 5. The system of claim 3 , where the auxiliary data is a document. | 0.784314 |
8,587,540 | 1 | 4 | 1. An electronic device, comprising: a display; a touch-sensitive surface; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for: concurrently displaying on the display a first text entry area, and an integrated input area, the integrated input area including: a left portion with a left side of a split keyboard with a first set of characters; a right portion with a right side of the split keyboard with a second set of characters; and a center portion in between the left portion and the right portion; detecting a first input on the touch-sensitive surface; in response to detecting the first input, entering a reconfiguration mode for the integrated input area; and, while in the reconfiguration mode for the integrated input area: detecting a second input by a first thumb and/or a second thumb; in response to detecting the second input, adjusting the size of at least one of the left side and the right side of the split keyboard in the integrated input area, maintaining the first set of characters in the left side of the split keyboard, and maintaining the second set of characters in the right side of the split keyboard; detecting a third input; and, in response to detecting the third input, exiting the reconfiguration mode for the integrated input area. | 1. An electronic device, comprising: a display; a touch-sensitive surface; one or more processors; memory; and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for: concurrently displaying on the display a first text entry area, and an integrated input area, the integrated input area including: a left portion with a left side of a split keyboard with a first set of characters; a right portion with a right side of the split keyboard with a second set of characters; and a center portion in between the left portion and the right portion; detecting a first input on the touch-sensitive surface; in response to detecting the first input, entering a reconfiguration mode for the integrated input area; and, while in the reconfiguration mode for the integrated input area: detecting a second input by a first thumb and/or a second thumb; in response to detecting the second input, adjusting the size of at least one of the left side and the right side of the split keyboard in the integrated input area, maintaining the first set of characters in the left side of the split keyboard, and maintaining the second set of characters in the right side of the split keyboard; detecting a third input; and, in response to detecting the third input, exiting the reconfiguration mode for the integrated input area. 4. The device of claim 1 , wherein the second input includes a horizontal movement of a left thumb towards a left vertical side of the display; and the one or more programs include instructions for: in response to detecting the horizontal movement of the left thumb towards the left vertical side of the display, reducing the size of the left side of the split keyboard. | 0.582393 |
9,910,841 | 1 | 3 | 1. A method, comprising: receiving a scanned image corresponding to a page of text; analyzing the scanned image to identify a set of characters (Ci) and corresponding positions (Pi) of each character of Ci on the page; applying natural language processing (NPL) and an analytic analysis algorithm to determine a semantic analysis relationship of phrases formed within Ci and to determine meanings for the phrases; generating annotation data for each phrase based upon the meanings; generating a plurality of annotations (Ai), each Ai corresponding to a corresponding phrase and the corresponding phrase's annotation data, wherein each annotation of Ai is assigned a corresponding position Qi on the page based upon the Pi of the corresponding characters on the page; storing, in a non-transitory computer-readable medium, the scanned image in conjunction with the plurality of annotations, annotation data and the corresponding Qi; and displaying the scanned page in conjunction with the annotations, wherein each annotation is displayed at the corresponding position. | 1. A method, comprising: receiving a scanned image corresponding to a page of text; analyzing the scanned image to identify a set of characters (Ci) and corresponding positions (Pi) of each character of Ci on the page; applying natural language processing (NPL) and an analytic analysis algorithm to determine a semantic analysis relationship of phrases formed within Ci and to determine meanings for the phrases; generating annotation data for each phrase based upon the meanings; generating a plurality of annotations (Ai), each Ai corresponding to a corresponding phrase and the corresponding phrase's annotation data, wherein each annotation of Ai is assigned a corresponding position Qi on the page based upon the Pi of the corresponding characters on the page; storing, in a non-transitory computer-readable medium, the scanned image in conjunction with the plurality of annotations, annotation data and the corresponding Qi; and displaying the scanned page in conjunction with the annotations, wherein each annotation is displayed at the corresponding position. 3. The method of claim 1 , the displaying comprising: superimposing the plurality of annotations on the scanned image, each annotation at the corresponding Qi, to produce a modified scanned image; and transmitting, to a display device for display on the display device, the modified scanned image. | 0.5 |
8,464,216 | 1 | 7 | 1. An apparatus, comprising: a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: present a markup language document on a display coupled to the apparatus, for editing by a user, wherein the markup language document is a document comprising current content generated using at least one markup language; and provide grammatical assistance to the user based on a markup language grammar inferred from the current content of the markup language document, wherein the markup language grammar comprises syntax rules of the at least one markup language used to generate the current content of the markup language document. | 1. An apparatus, comprising: a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: present a markup language document on a display coupled to the apparatus, for editing by a user, wherein the markup language document is a document comprising current content generated using at least one markup language; and provide grammatical assistance to the user based on a markup language grammar inferred from the current content of the markup language document, wherein the markup language grammar comprises syntax rules of the at least one markup language used to generate the current content of the markup language document. 7. The apparatus of claim 1 , wherein the instructions cause the processor to provide assistance to the user by: providing assistance to the user for editing the markup language document based on a real markup language grammar defined in a markup language grammar file for portions of the markup language document having elements corresponding to information in the markup language grammar file, and providing assistance to the user for editing the markup language document based on the inferred markup language grammar for portions of the markup language document having elements that do not correspond to information in the markup language grammar file. | 0.5 |
10,157,344 | 19 | 20 | 19. The non-transitory machine-readable storage medium of claim 15 , wherein the instructions for the retrieving the second navigation trail of the second entity cause the system to perform operations further comprising: determining a plurality of related entities based at least in part on aggregated navigation transitions between the selected entity and each related entity of the plurality of related entities, the plurality of related entities including the second entity. | 19. The non-transitory machine-readable storage medium of claim 15 , wherein the instructions for the retrieving the second navigation trail of the second entity cause the system to perform operations further comprising: determining a plurality of related entities based at least in part on aggregated navigation transitions between the selected entity and each related entity of the plurality of related entities, the plurality of related entities including the second entity. 20. The non-transitory machine-readable storage medium of claim 19 , further comprising instructions that cause the system to perform operations further comprising: selecting, from among the plurality of related entities, the second entity based at least in part on a probability calculated based on the aggregated navigation transitions. | 0.5 |
8,326,627 | 23 | 29 | 23. A navigation device for dynamically generating a recognition grammar in an integrated voice navigation services environment, wherein the navigation device comprises one or more processors configured to: receive a natural language utterance that relates to a navigation context; identify a current location associated with the navigation device; generate a dynamic recognition grammar that organizes grammar information based on one or more topological domains associated with the current location associated with the navigation device; and determine one or more affinities between a user that spoke the natural language utterance and one or more peers associated with the user, wherein the dynamic recognition grammar further organizes the grammar information according to the one or more determined affinities generate one or more interpretations associated with the natural language utterance using the dynamic recognition grammar. | 23. A navigation device for dynamically generating a recognition grammar in an integrated voice navigation services environment, wherein the navigation device comprises one or more processors configured to: receive a natural language utterance that relates to a navigation context; identify a current location associated with the navigation device; generate a dynamic recognition grammar that organizes grammar information based on one or more topological domains associated with the current location associated with the navigation device; and determine one or more affinities between a user that spoke the natural language utterance and one or more peers associated with the user, wherein the dynamic recognition grammar further organizes the grammar information according to the one or more determined affinities generate one or more interpretations associated with the natural language utterance using the dynamic recognition grammar. 29. The navigation device of claim 23 , wherein the conversational language processor is further configured to modify the grammar information in the dynamic recognition grammar in response to one or more changes to the one or more topological domains associated with the current location associated with the navigation device. | 0.820485 |
8,117,229 | 1 | 2 | 1. An apparatus for detecting presence of selected complex strings in a data stream, said apparatus comprising: a memory device storing a predefined complex dictionary containing a plurality of complex strings, each complex string having an arbitrary number of interleaving coherent strings and ambiguous strings; a first computing device having a processor and a memory device storing computer readable instructions for segmenting said predefined complex dictionary into a segmented dictionary and a segment-descriptor matrix, so that: each entry in said segmented dictionary comprises a string segment of a respective complex string; and each row in said segment-descriptor matrix comprises numeric data for facilitating parsing said respective complex string; a second computing device having a memory device and comprising: a first processor for locating selected coherent strings of said plurality of complex strings in said data stream; and a second processor for ascertaining congruence of interleaving portions of said data stream to selected ambiguous strings of said plurality of complex strings; and a memory device storing processor executable instructions which cause said second processor to: determine equality of a first number of characters of each interleaving portion and a second number of characters of a respective ambiguous string; and access a table of predefined classes, each class corresponding to a subset characters, arranged in an arbitrary order, of an alphabet, to determine classes of likewise positioned characters of said each interleaving portion and said respective ambiguous string; wherein each character in said selected ambiguous strings is defined according to class association and said congruence is determined according to class definition of characters of said interleaving portions; and wherein the processes of locating and ascertaining are pipelined. | 1. An apparatus for detecting presence of selected complex strings in a data stream, said apparatus comprising: a memory device storing a predefined complex dictionary containing a plurality of complex strings, each complex string having an arbitrary number of interleaving coherent strings and ambiguous strings; a first computing device having a processor and a memory device storing computer readable instructions for segmenting said predefined complex dictionary into a segmented dictionary and a segment-descriptor matrix, so that: each entry in said segmented dictionary comprises a string segment of a respective complex string; and each row in said segment-descriptor matrix comprises numeric data for facilitating parsing said respective complex string; a second computing device having a memory device and comprising: a first processor for locating selected coherent strings of said plurality of complex strings in said data stream; and a second processor for ascertaining congruence of interleaving portions of said data stream to selected ambiguous strings of said plurality of complex strings; and a memory device storing processor executable instructions which cause said second processor to: determine equality of a first number of characters of each interleaving portion and a second number of characters of a respective ambiguous string; and access a table of predefined classes, each class corresponding to a subset characters, arranged in an arbitrary order, of an alphabet, to determine classes of likewise positioned characters of said each interleaving portion and said respective ambiguous string; wherein each character in said selected ambiguous strings is defined according to class association and said congruence is determined according to class definition of characters of said interleaving portions; and wherein the processes of locating and ascertaining are pipelined. 2. The apparatus of claim 1 wherein said first computing device is configured to update said segmented dictionary and said segment-descriptor matrix in response to one of: addition of a new complex string to said complex dictionary; and deletion of an existing complex string from said complex dictionary. | 0.540663 |
8,856,104 | 9 | 11 | 9. A system to generate a database query to retrieve a set of stored data records from an electronic data record system, the system comprising: a computer that includes one or more hardware processors; a repository of terminology content stored in accordance with an information reference model, wherein the information reference model includes a plurality of backbone classes, wherein the plurality of backbone classes are associated with a plurality of other types of backbone classes to form data structures representing a plurality of higher level healthcare concepts; a concept query system that executes on the computer to receive a concept query request comprising a set of search criteria, wherein the search criteria include a first classification identifier corresponding to a first classification container, and a semantic statement that defines, using the first classification identifier, an expected concept query result generated from a terminology service; generate, via a concept query generator, a classification concept query from the concept query request, wherein the classification concept query includes at least a subset of the search criteria and the first classification identifier, provide the classification concept query to the terminology service that manages the repository of terminology content, wherein the terminology content comprises a plurality of domains of concepts, wherein a plurality of semantically equivalent concepts are stored in different domains of concepts, and are mapped to one another using inter-domain or intra-domain mappings defined in the terminology service, and wherein concepts in each domain are organized into a plurality of classification containers, wherein each classification container represents a collection of semantically equivalent concepts having a corresponding classification identifier, identify, using the defined mappings and the semantic statement, one or more classification containers, wherein each of the one or more classification containers includes a concept semantically equivalent to a concept in the first classification container; and create a concept query result by extracting a plurality of concepts associated with the first classification identifier, from the first classification container and the one or more identified classification containers; and a database query generator to receive the plurality of associated concepts and generate the database query comprising predicates corresponding to the plurality of associated concepts. | 9. A system to generate a database query to retrieve a set of stored data records from an electronic data record system, the system comprising: a computer that includes one or more hardware processors; a repository of terminology content stored in accordance with an information reference model, wherein the information reference model includes a plurality of backbone classes, wherein the plurality of backbone classes are associated with a plurality of other types of backbone classes to form data structures representing a plurality of higher level healthcare concepts; a concept query system that executes on the computer to receive a concept query request comprising a set of search criteria, wherein the search criteria include a first classification identifier corresponding to a first classification container, and a semantic statement that defines, using the first classification identifier, an expected concept query result generated from a terminology service; generate, via a concept query generator, a classification concept query from the concept query request, wherein the classification concept query includes at least a subset of the search criteria and the first classification identifier, provide the classification concept query to the terminology service that manages the repository of terminology content, wherein the terminology content comprises a plurality of domains of concepts, wherein a plurality of semantically equivalent concepts are stored in different domains of concepts, and are mapped to one another using inter-domain or intra-domain mappings defined in the terminology service, and wherein concepts in each domain are organized into a plurality of classification containers, wherein each classification container represents a collection of semantically equivalent concepts having a corresponding classification identifier, identify, using the defined mappings and the semantic statement, one or more classification containers, wherein each of the one or more classification containers includes a concept semantically equivalent to a concept in the first classification container; and create a concept query result by extracting a plurality of concepts associated with the first classification identifier, from the first classification container and the one or more identified classification containers; and a database query generator to receive the plurality of associated concepts and generate the database query comprising predicates corresponding to the plurality of associated concepts. 11. The system of claim 9 , wherein the associated concepts have an IS-A relationship with the classification container associated with the classification identifier. | 0.705674 |
9,430,445 | 11 | 21 | 11. A method for editing a document to display status and metadata for an object embedded in the document, the method comprising: opening the document in a user interface of an editor; identifying the object embedded in the document, an identifier of the object, and an address of a remote service corresponding to the object according to an object definition; communicating with the remote service using the identifier and the address to exchange object information with the remote service, wherein the object information includes the status and the metadata; providing the object information to the user interface; and displaying the status and the metadata of the object together with the object in the user interface, at least one of the status and the metadata being displayed with a special effect indicating a change detected in the status or the metadata of the object; determining whether the remote service is available or unavailable; wherein the user interface is configured to display the object as plain text if said document editor determines the remote service to be unavailable; wherein the object information is exchanged by periodically communicating with the remote service, the special effect indicating the change detected since a previous periodic communication with the remote service. | 11. A method for editing a document to display status and metadata for an object embedded in the document, the method comprising: opening the document in a user interface of an editor; identifying the object embedded in the document, an identifier of the object, and an address of a remote service corresponding to the object according to an object definition; communicating with the remote service using the identifier and the address to exchange object information with the remote service, wherein the object information includes the status and the metadata; providing the object information to the user interface; and displaying the status and the metadata of the object together with the object in the user interface, at least one of the status and the metadata being displayed with a special effect indicating a change detected in the status or the metadata of the object; determining whether the remote service is available or unavailable; wherein the user interface is configured to display the object as plain text if said document editor determines the remote service to be unavailable; wherein the object information is exchanged by periodically communicating with the remote service, the special effect indicating the change detected since a previous periodic communication with the remote service. 21. The method of claim 11 , further comprising: displaying an editor window on a display device; and receiving an input to select the object being displayed the editor window, and invoking the status and the metadata of said object. | 0.689333 |
8,935,609 | 5 | 6 | 5. The method of claim 3 , further comprising: constructing a modified markup file containing the plurality of sub-images, wherein the second scripting language code is adapted to cause a user terminal upon which it is executed to transmit coordinate information defining a position of a user-controlled cursor. | 5. The method of claim 3 , further comprising: constructing a modified markup file containing the plurality of sub-images, wherein the second scripting language code is adapted to cause a user terminal upon which it is executed to transmit coordinate information defining a position of a user-controlled cursor. 6. The method of claim 5 wherein the second scripting language code is further adapted to cause a user terminal upon which it is executed to transmit the coordinate information continuously or on a periodic basis. | 0.5 |
8,682,075 | 3 | 5 | 3. The method of claim 1 , further comprising generating the data representing the text in the non-image form by: inputting the data representing the image of the text to an optical character recognition (OCR) engine; receiving output from the OCR engine, the output being the data representing the text in the non-image form. | 3. The method of claim 1 , further comprising generating the data representing the text in the non-image form by: inputting the data representing the image of the text to an optical character recognition (OCR) engine; receiving output from the OCR engine, the output being the data representing the text in the non-image form. 5. The method of claim 3 , wherein the valid content boundary is determined independent of the OCR engine that generated the data representing the text in the non-image form. | 0.611607 |
8,700,397 | 6 | 7 | 6. A method comprising: receiving a spoken utterance of a plurality of uttered characters; determining an identified character sequence by determining corresponding identified characters for individual ones of the plurality of uttered characters; selecting a plurality of known character sequences that potentially correspond to the identified character sequence; and for each selected known character sequence, scoring such known character sequence, using a processor, based at least in part on a weighting of individual characters that comprise the known character sequence, wherein scoring the known character sequence comprises: for each individual character of the known character sequence, weighting the individual character based on a unigram frequency with which the individual character is known to be uttered, wherein said weighting comprises: determining whether a selected character of the known character sequence matches a selected character of the identified character sequence; and when the selected character of the known character sequence matches the selected character of the identified character sequence: selecting a value that corresponds to the selected character of the known character sequence; and adding the selected value to a cumulative score associated with the known character sequence; and when the selected character of the known character sequence does not match the selected character of the identified character sequence: making no changes to the cumulative score associated with the known character sequence based upon the selected character of the known character sequence. | 6. A method comprising: receiving a spoken utterance of a plurality of uttered characters; determining an identified character sequence by determining corresponding identified characters for individual ones of the plurality of uttered characters; selecting a plurality of known character sequences that potentially correspond to the identified character sequence; and for each selected known character sequence, scoring such known character sequence, using a processor, based at least in part on a weighting of individual characters that comprise the known character sequence, wherein scoring the known character sequence comprises: for each individual character of the known character sequence, weighting the individual character based on a unigram frequency with which the individual character is known to be uttered, wherein said weighting comprises: determining whether a selected character of the known character sequence matches a selected character of the identified character sequence; and when the selected character of the known character sequence matches the selected character of the identified character sequence: selecting a value that corresponds to the selected character of the known character sequence; and adding the selected value to a cumulative score associated with the known character sequence; and when the selected character of the known character sequence does not match the selected character of the identified character sequence: making no changes to the cumulative score associated with the known character sequence based upon the selected character of the known character sequence. 7. The method of claim 6 , wherein the selected value is pre-assigned to the character in a character set. | 0.8 |
9,043,352 | 23 | 31 | 23. A computer-implemented method for searching established document object relationships, the method comprising: accessing, using a server, one or more link relationships stored on a memory device, wherein the one or more link relationships comprise a record, each record having a pointer to a first document object, a pointer to a second document object and information identifying one or more attributes describing the relationship between the first document object and the second document object, wherein the link relationships are stored separately from the first document object and the second document object; prompting, using a server, selection of one or more first link relationship attributes, wherein the first link relationship attributes describe one or more first link relationships; searching established link relationships using the selected one or more first link relationship attributes, wherein the the searching includes identifying the one or more first link relationships that the one or more first link relationship attributes participates in; retrieving one or more second link relationship attributes, wherein the second link relationship attributes further describe the one or more first link relationships; and transmitting, for display, the one or more retrieved second link relationship attributes. | 23. A computer-implemented method for searching established document object relationships, the method comprising: accessing, using a server, one or more link relationships stored on a memory device, wherein the one or more link relationships comprise a record, each record having a pointer to a first document object, a pointer to a second document object and information identifying one or more attributes describing the relationship between the first document object and the second document object, wherein the link relationships are stored separately from the first document object and the second document object; prompting, using a server, selection of one or more first link relationship attributes, wherein the first link relationship attributes describe one or more first link relationships; searching established link relationships using the selected one or more first link relationship attributes, wherein the the searching includes identifying the one or more first link relationships that the one or more first link relationship attributes participates in; retrieving one or more second link relationship attributes, wherein the second link relationship attributes further describe the one or more first link relationships; and transmitting, for display, the one or more retrieved second link relationship attributes. 31. The method of claim 23 wherein the established link relationships further include one or more link relationship attributes. | 0.832011 |
7,797,293 | 45 | 48 | 45. A computer accessible storage medium storing program instructions computer-executable to implement: maintaining a plurality of contact entries, wherein each contact entry comprises contact information for a respective user, wherein some of the contact entries are designated as core contact entries; detecting a primary user's current context information, wherein the primary user is different from each user for which a contact entry is maintained; identifying one or more context appropriate contact entries from the maintained contact entries dependent on the current context information detected for the primary user; providing to the primary user: the one or more context appropriate contact entries; and the core contact entries, wherein the core contact entries are provided independent of the current context information detected for the primary user; detecting a change in the primary user's current context information; and in response to detecting the change in the primary user's current context information: identifying one or more different context appropriate contact entries from the maintained contact entries dependent on the changed context information detected for the primary user; and providing to the primary user: the one or more different context appropriate contact entries; and the same core contact entries. | 45. A computer accessible storage medium storing program instructions computer-executable to implement: maintaining a plurality of contact entries, wherein each contact entry comprises contact information for a respective user, wherein some of the contact entries are designated as core contact entries; detecting a primary user's current context information, wherein the primary user is different from each user for which a contact entry is maintained; identifying one or more context appropriate contact entries from the maintained contact entries dependent on the current context information detected for the primary user; providing to the primary user: the one or more context appropriate contact entries; and the core contact entries, wherein the core contact entries are provided independent of the current context information detected for the primary user; detecting a change in the primary user's current context information; and in response to detecting the change in the primary user's current context information: identifying one or more different context appropriate contact entries from the maintained contact entries dependent on the changed context information detected for the primary user; and providing to the primary user: the one or more different context appropriate contact entries; and the same core contact entries. 48. The computer accessible storage medium of claim 45 , wherein in said providing the program instructions are executable to implement programmatically providing the context appropriate contact entries to an application for user presentation and selection. | 0.727754 |
10,042,506 | 6 | 7 | 6. The system of claim 1 , wherein the memory includes a story web generator. | 6. The system of claim 1 , wherein the memory includes a story web generator. 7. The system of claim 6 , wherein the processor is configured to use the story web generator to create the story web. | 0.5 |
9,747,896 | 1 | 3 | 1. A method for providing follow-up responses to prior natural language inputs of a user, the method being in implemented on a computer system having one or more physical processors programmed with computer program instructions which, when executed, programs the computer system to perform the method, the method comprising: receiving, at the computer system, a first natural language input associated with a user; determining, at the computer system, a first context of the first natural language input; determining, at the computer system, that first information for providing a first response to the first natural language input is not available: receiving, at the computer system, a second natural language input associated with the user after the receipt of the first natural language input; determining, at the computer system, a second context, different from the first context, of the second natural language input; providing, by the computer system, a second response to the second natural language input; receiving, at the computer system, the first information for providing the first response after the second response is provided; generating, at the computer system, the first response based on the second context relating to the second natural language input; and providing, by the computer system, the first response, different than the second response based on the first information. | 1. A method for providing follow-up responses to prior natural language inputs of a user, the method being in implemented on a computer system having one or more physical processors programmed with computer program instructions which, when executed, programs the computer system to perform the method, the method comprising: receiving, at the computer system, a first natural language input associated with a user; determining, at the computer system, a first context of the first natural language input; determining, at the computer system, that first information for providing a first response to the first natural language input is not available: receiving, at the computer system, a second natural language input associated with the user after the receipt of the first natural language input; determining, at the computer system, a second context, different from the first context, of the second natural language input; providing, by the computer system, a second response to the second natural language input; receiving, at the computer system, the first information for providing the first response after the second response is provided; generating, at the computer system, the first response based on the second context relating to the second natural language input; and providing, by the computer system, the first response, different than the second response based on the first information. 3. The method of claim 1 , further comprising: determining, by the computer system, context information associated with an interactive session between the computer system and the user, wherein providing the response comprises providing the response based on the first information and the context information associated with the interactive session. | 0.66474 |
9,904,949 | 14 | 18 | 14. A non-transitory machine readable storage medium having computer readable program code embedded therein for providing product recommendations, comprising: a context item processor to receive and track context items as a product page is navigated; a plurality of similarities datasets comprising products with a similarity to a product on the product page, each of the plurality of similarities datasets being derived from a separate source; a data store selection module to select one of the plurality of similarities datasets as a source of product recommendations based on the context items, wherein the one of the plurality of similarities datasets is selected using a machine learning model that yields patterns representative of an underlying mechanism based on the context items as input for the machine model, and wherein the plurality of similarities datasets are prepared for the product page, and the machine learning model selects the one of the plurality of similarities datasets based on a fallback strategy where one of the plurality of similarity datasets is a new similarities dataset, wherein the fallback strategy is learned by the machine learning model using logged data regarding the plurality of similarities datasets used for past recommendations; a logging module to log the similarities dataset selected by the machine learning model for use in making future recommendations; a ranking module to rank products in the selected one of the plurality of similarities datasets based on the context items; and a content page module to provide the product recommendations for display based on the context items. | 14. A non-transitory machine readable storage medium having computer readable program code embedded therein for providing product recommendations, comprising: a context item processor to receive and track context items as a product page is navigated; a plurality of similarities datasets comprising products with a similarity to a product on the product page, each of the plurality of similarities datasets being derived from a separate source; a data store selection module to select one of the plurality of similarities datasets as a source of product recommendations based on the context items, wherein the one of the plurality of similarities datasets is selected using a machine learning model that yields patterns representative of an underlying mechanism based on the context items as input for the machine model, and wherein the plurality of similarities datasets are prepared for the product page, and the machine learning model selects the one of the plurality of similarities datasets based on a fallback strategy where one of the plurality of similarity datasets is a new similarities dataset, wherein the fallback strategy is learned by the machine learning model using logged data regarding the plurality of similarities datasets used for past recommendations; a logging module to log the similarities dataset selected by the machine learning model for use in making future recommendations; a ranking module to rank products in the selected one of the plurality of similarities datasets based on the context items; and a content page module to provide the product recommendations for display based on the context items. 18. The system of claim 14 , wherein the content page module provides the product recommendations for display via a recommendations widget based on a type or location of the recommendations widget. | 0.582627 |
5,553,084 | 8 | 10 | 8. An apparatus for decoding a machine-readable symbol representing encoded information, the symbol having symbol characters, a series of repeating characters, and error correction characters derived from the symbol and repeating characters, the apparatus comprising: a sensor that receives light reflected by the symbol and produces an output signal therefore; a receiver that receives the output signal and produces a data signal indicative of at least some of the symbol characters, repeating characters and error correction characters, but which fails to accurately indicate at least some of the symbol and repeating characters; and a processor for processing the data signal and producing a signal indicative of the information encoded in the symbol, the processor being programmed to (i) attempt to decode the symbol, (ii) determine if the symbol has any repeating characters if the symbol cannot be decoded, (iii) locate at least two repeating characters in the symbol, (iv) replace the repeating characters that failed to be accurately indicated in the data signal with accurately indicated repeating characters, and (v) attempt to decode the symbol again alter replacing the repeating character with accurately indicated repeating characters that failed to be indicated in the data signal. | 8. An apparatus for decoding a machine-readable symbol representing encoded information, the symbol having symbol characters, a series of repeating characters, and error correction characters derived from the symbol and repeating characters, the apparatus comprising: a sensor that receives light reflected by the symbol and produces an output signal therefore; a receiver that receives the output signal and produces a data signal indicative of at least some of the symbol characters, repeating characters and error correction characters, but which fails to accurately indicate at least some of the symbol and repeating characters; and a processor for processing the data signal and producing a signal indicative of the information encoded in the symbol, the processor being programmed to (i) attempt to decode the symbol, (ii) determine if the symbol has any repeating characters if the symbol cannot be decoded, (iii) locate at least two repeating characters in the symbol, (iv) replace the repeating characters that failed to be accurately indicated in the data signal with accurately indicated repeating characters, and (v) attempt to decode the symbol again alter replacing the repeating character with accurately indicated repeating characters that failed to be indicated in the data signal. 10. The apparatus of claim 8 wherein the sensor is a rasterizing laser scanner. | 0.940512 |
9,953,649 | 2 | 3 | 2. The method of claim 1 , the method further comprising: generating, by the first electronic device, a user interface, wherein receiving the non-voice interaction comprises: receiving, by the first electronic device, a point of focus on the user interface, and wherein the first context is based on the point of focus. | 2. The method of claim 1 , the method further comprising: generating, by the first electronic device, a user interface, wherein receiving the non-voice interaction comprises: receiving, by the first electronic device, a point of focus on the user interface, and wherein the first context is based on the point of focus. 3. The method of claim 2 , wherein the user interface comprises a map display interface and wherein the point of focus includes a location on the map display that indicates a geolocation, which is used as the first context. | 0.5 |
9,646,056 | 19 | 20 | 19. The computer program product as set forth in claim 18 , further comprising instructions for causing the processor to perform an operation of passing the set of cognitive saliency values through a relative saliency threshold. | 19. The computer program product as set forth in claim 18 , further comprising instructions for causing the processor to perform an operation of passing the set of cognitive saliency values through a relative saliency threshold. 20. The computer program product as set forth in claim 19 , wherein the schema is applicable to any type of saliency. | 0.5 |
9,998,342 | 1 | 5 | 1. A method for generating a graph segment providing a gist or summary of an online social network conversation, the method comprising: generating, by a processor, a graph of the online social network conversation, wherein the graph of the online social network conversation comprises a plurality of nodes and each node connecting at least one other node by an edge, each node representing a message of the online social network conversation and each edge corresponding to an action by a participant in the online social network conversation; determining, by the processor, an edge weight for each edge; analyzing, by the processor, the graph of the online social network conversation, by the processor, using at least the edge weight of at least some of the edges; and generating, by the processor, a graph segment comprising a reduced number of nodes of the graph of the online social network conversation based on analyzing the graph of the online social network conversation and the graph segment providing a gist or summary comprising an abbreviated view of the online social network conversation based on the analysis, each node of the reduced number of nodes corresponding to its own respective node of the graph of the online social network conversation. | 1. A method for generating a graph segment providing a gist or summary of an online social network conversation, the method comprising: generating, by a processor, a graph of the online social network conversation, wherein the graph of the online social network conversation comprises a plurality of nodes and each node connecting at least one other node by an edge, each node representing a message of the online social network conversation and each edge corresponding to an action by a participant in the online social network conversation; determining, by the processor, an edge weight for each edge; analyzing, by the processor, the graph of the online social network conversation, by the processor, using at least the edge weight of at least some of the edges; and generating, by the processor, a graph segment comprising a reduced number of nodes of the graph of the online social network conversation based on analyzing the graph of the online social network conversation and the graph segment providing a gist or summary comprising an abbreviated view of the online social network conversation based on the analysis, each node of the reduced number of nodes corresponding to its own respective node of the graph of the online social network conversation. 5. The method of claim 1 , wherein determining the edge weight for a particular edge associated with a particular message comprises: analyzing the particular message using natural language processing to determine the sentiment of the particular message; and using the sentiment of the particular message and a profile of a user that posted the particular message to determine the edge weight of the particular edge associated with the particular message. | 0.751641 |
9,472,184 | 15 | 16 | 15. The speech recognition problem detector of claim 10 , wherein the warning further comprises a phonetic unit type indicator that distinguishes a phonemic cross-language speech recognition problem from a syllabic cross-language speech recognition problem. | 15. The speech recognition problem detector of claim 10 , wherein the warning further comprises a phonetic unit type indicator that distinguishes a phonemic cross-language speech recognition problem from a syllabic cross-language speech recognition problem. 16. The speech recognition problem detector of claim 15 , wherein the phonetic unit type indicator comprises the phonemic cross-language speech recognition problem displayed in a first color and the syllabic cross-language speech recognition problem displayed in a second color different from the first color. | 0.5 |
9,372,834 | 7 | 8 | 7. A non-transitory machine readable medium storing a program which when executed by at least one processing unit aligns a symbol with an associated character, the program comprising sets of instructions for: identifying an italic slant of a character; projecting a set of lines from a first plurality of points on the character along the italic slant of the character; identifying a second plurality of points on the projected lines along a top of the character; generating an alignment shape surrounding the character based on the identified second plurality of points, the alignment shape comprising a plurality of sides; and aligning the symbol associated with the character along one of the plurality of sides of the alignment shape. | 7. A non-transitory machine readable medium storing a program which when executed by at least one processing unit aligns a symbol with an associated character, the program comprising sets of instructions for: identifying an italic slant of a character; projecting a set of lines from a first plurality of points on the character along the italic slant of the character; identifying a second plurality of points on the projected lines along a top of the character; generating an alignment shape surrounding the character based on the identified second plurality of points, the alignment shape comprising a plurality of sides; and aligning the symbol associated with the character along one of the plurality of sides of the alignment shape. 8. The non-transitory machine readable medium of claim 7 , wherein the set of instructions for identifying the italic slant of the character comprises a set of instructions for calculating an angle at which the character is oriented. | 0.745633 |
8,412,716 | 16 | 17 | 16. A computer program, embodied on a non-transitory recording medium, for controlling a computer system to present relevant application components to a user of the computer system, the computer program comprising: a capturing component that is configured to control the computer system to capture a plurality of text displayed in a plurality of applications, wherein the plurality of applications are open to the user, wherein the plurality of text displayed in the plurality of applications corresponds to a user context, wherein the user context corresponds to opened applications and documents, wherein the user context differs from an application component, wherein the application component corresponds to elements of an application; a first determining component that is configured to control the computer system to determine a plurality of key terms in the plurality of text based on a key terms catalog; a second determining component that is configured to control the computer system to determine a plurality of potentially relevant components by using the plurality of key terms to search a user interface dictionary, wherein the user interface dictionary corresponds to a map between user interface strings and user interface components; a computing component that is configured to control the computer system to compute a plurality of relevance scores for the plurality of potentially relevant components using the application component; and a presenting component that is configured to control the computer system to present to the user a plurality of relevant components, wherein the plurality of relevant components correspond to relevant ones of the plurality of potentially relevant components according to the plurality of relevance scores. | 16. A computer program, embodied on a non-transitory recording medium, for controlling a computer system to present relevant application components to a user of the computer system, the computer program comprising: a capturing component that is configured to control the computer system to capture a plurality of text displayed in a plurality of applications, wherein the plurality of applications are open to the user, wherein the plurality of text displayed in the plurality of applications corresponds to a user context, wherein the user context corresponds to opened applications and documents, wherein the user context differs from an application component, wherein the application component corresponds to elements of an application; a first determining component that is configured to control the computer system to determine a plurality of key terms in the plurality of text based on a key terms catalog; a second determining component that is configured to control the computer system to determine a plurality of potentially relevant components by using the plurality of key terms to search a user interface dictionary, wherein the user interface dictionary corresponds to a map between user interface strings and user interface components; a computing component that is configured to control the computer system to compute a plurality of relevance scores for the plurality of potentially relevant components using the application component; and a presenting component that is configured to control the computer system to present to the user a plurality of relevant components, wherein the plurality of relevant components correspond to relevant ones of the plurality of potentially relevant components according to the plurality of relevance scores. 17. The computer program of claim 16 , further comprising: a generating component that is configured to control the computer system to create the user interface dictionary and to create the key terms catalog based on the user interface dictionary; and a storage component that is configured to control the computer system to store the key terms catalog and the user interface dictionary. | 0.5 |
9,788,055 | 11 | 12 | 11. The method of claim 1 , wherein generating search terms comprises: identifying noun phrases in the extracted text; and selecting a threshold number of the noun phrases to be search terms. | 11. The method of claim 1 , wherein generating search terms comprises: identifying noun phrases in the extracted text; and selecting a threshold number of the noun phrases to be search terms. 12. The method of claim 11 , wherein identifying noun phrases comprises: removing program showing data from the extracted text to produce one or more descriptive phrases; and removing at least one verb from the one or more descriptive phrases to produce one or more noun phrases. | 0.584821 |
8,760,451 | 27 | 29 | 27. The image rendering engine of claim 12 , wherein the sets of character encoding data for one of sections of encoding data are stored as a two or more lines of sets of character encoding data with the first encoding data for each text character in the same line of sets of character encoding data sharing at least one common row in the text string lookup table but not having any overlapping columns in the text string lookup table and with the first encoding data for each text character in different lines of sets of character encoding data not sharing any rows of the text string lookup table. | 27. The image rendering engine of claim 12 , wherein the sets of character encoding data for one of sections of encoding data are stored as a two or more lines of sets of character encoding data with the first encoding data for each text character in the same line of sets of character encoding data sharing at least one common row in the text string lookup table but not having any overlapping columns in the text string lookup table and with the first encoding data for each text character in different lines of sets of character encoding data not sharing any rows of the text string lookup table. 29. The image rendering image of claim 27 , wherein the at least one text character and the different text character are adjacent text characters in the text string defined by the section of encoding data. | 0.691265 |
7,533,034 | 40 | 62 | 40. A computer program product comprising a computer readable storage medium having computer readable code thereon for providing to business management a plan for implementing a user's suggestion, the computer readable code comprising: computer code for presenting to a user seeking to submit a suggestion for business improvement, a series of two or more templates for entering a structured response, wherein at least one of the templates contains a field for selecting the type of suggestion from the group of cost saving, revenue generation, quality improvement, safety improvement, customer service improvement, development of a new product, policy change and advertising or corporate slogan; computer code for obtaining over a computer network the structured response, entered into the two or more templates, from the user, wherein the structured response includes a characterization of the type of suggestion entered into one or more templates by the user and at least one of the templates presented to the user is selected according to the type of suggestion characterized by the user; computer code for determining network routing of data from the structured response to business management based upon entries of the response in one or more templates. | 40. A computer program product comprising a computer readable storage medium having computer readable code thereon for providing to business management a plan for implementing a user's suggestion, the computer readable code comprising: computer code for presenting to a user seeking to submit a suggestion for business improvement, a series of two or more templates for entering a structured response, wherein at least one of the templates contains a field for selecting the type of suggestion from the group of cost saving, revenue generation, quality improvement, safety improvement, customer service improvement, development of a new product, policy change and advertising or corporate slogan; computer code for obtaining over a computer network the structured response, entered into the two or more templates, from the user, wherein the structured response includes a characterization of the type of suggestion entered into one or more templates by the user and at least one of the templates presented to the user is selected according to the type of suggestion characterized by the user; computer code for determining network routing of data from the structured response to business management based upon entries of the response in one or more templates. 62. The computer program product according to claim 40 , wherein the computer code for determining the network routing is dependent in part upon a deadline selected by the user. | 0.715434 |
7,685,252 | 43 | 56 | 43. Apparatus for use in accessing an application in association with one or more computer-based devices, the apparatus comprising: one or more processors operative to: (i) obtain the application from an application server, the application being programmatically represented by interactions that the user is permitted to have with the one or more computer-based devices by interaction-based programming components, wherein the interaction-based programming components are independent of content/application logic and presentation requirements associated with the application; and (ii) transcode the interaction-based programming components on a component by component basis to generate one or more modality-specific renderings of the application renderable in accordance with one or more modaility-specific browsers associated with the one or more computer-based devices, the interaction-based programming components being independent of any modality and any modality-specific browser wherein representation by the interaction-based programming components permits synchronization of the one or more modality-specific renderings of the application on the one or more computer-based devices. | 43. Apparatus for use in accessing an application in association with one or more computer-based devices, the apparatus comprising: one or more processors operative to: (i) obtain the application from an application server, the application being programmatically represented by interactions that the user is permitted to have with the one or more computer-based devices by interaction-based programming components, wherein the interaction-based programming components are independent of content/application logic and presentation requirements associated with the application; and (ii) transcode the interaction-based programming components on a component by component basis to generate one or more modality-specific renderings of the application renderable in accordance with one or more modaility-specific browsers associated with the one or more computer-based devices, the interaction-based programming components being independent of any modality and any modality-specific browser wherein representation by the interaction-based programming components permits synchronization of the one or more modality-specific renderings of the application on the one or more computer-based devices. 56. The apparatus of claim 43 , wherein one of the interaction-based programming components represent conversational gestures. | 0.832891 |
7,849,393 | 1 | 4 | 1. An electronic book, comprising: a screen for displaying an electronic book content; at least one first component with at least one underlying link, wherein, upon selection of the at least one first component, the at least one first component links to at least an Internet web site for providing a plurality of streaming video, audio and text data when connected to the electronic book, wherein location information for each of the plurality of streaming video, audio and text data is provided in at least one hidden links table and the at least one hidden links table is provided in conjunction with downloading the content of the electronic book from a remote provider, and each of the at least one hidden links table is associated with the at least one first component with the at least one underlying link, and wherein the location information provides access to the plurality of streaming video, audio and text data, and wherein the at least one first component is a part of a content of the electronic book; and a control function wherein the control function allows selection of one or more of the plurality of streaming video, audio and text data while displaying the content of the electronic book, and wherein the selected data is displayed on the screen of the electronic book, wherein the hidden links table is updatable from a most current links table using information transmitted via the Internet web site from the remote provider, wherein the most current links table is downloaded to the electronic book either periodically by the remote provider, or when a new electronic book content is downloaded to the electronic book by the remote provider, and wherein the control function includes an on-screen show links button, upon selection of which a link menu is displayed on the screen of the electronic book along with the content of the electronic book, wherein the link menu shows all of the first components with the underlying links contained in the content of the electronic book displayed on the screen of the electronic book, and shows linked materials including a number of links, link numbers and descriptions of the linked materials that each of the first components with the underlying links is able to be linked to, such that, by choosing one of the links, a user is able to link to one of the linked materials. | 1. An electronic book, comprising: a screen for displaying an electronic book content; at least one first component with at least one underlying link, wherein, upon selection of the at least one first component, the at least one first component links to at least an Internet web site for providing a plurality of streaming video, audio and text data when connected to the electronic book, wherein location information for each of the plurality of streaming video, audio and text data is provided in at least one hidden links table and the at least one hidden links table is provided in conjunction with downloading the content of the electronic book from a remote provider, and each of the at least one hidden links table is associated with the at least one first component with the at least one underlying link, and wherein the location information provides access to the plurality of streaming video, audio and text data, and wherein the at least one first component is a part of a content of the electronic book; and a control function wherein the control function allows selection of one or more of the plurality of streaming video, audio and text data while displaying the content of the electronic book, and wherein the selected data is displayed on the screen of the electronic book, wherein the hidden links table is updatable from a most current links table using information transmitted via the Internet web site from the remote provider, wherein the most current links table is downloaded to the electronic book either periodically by the remote provider, or when a new electronic book content is downloaded to the electronic book by the remote provider, and wherein the control function includes an on-screen show links button, upon selection of which a link menu is displayed on the screen of the electronic book along with the content of the electronic book, wherein the link menu shows all of the first components with the underlying links contained in the content of the electronic book displayed on the screen of the electronic book, and shows linked materials including a number of links, link numbers and descriptions of the linked materials that each of the first components with the underlying links is able to be linked to, such that, by choosing one of the links, a user is able to link to one of the linked materials. 4. The electronic book of claim 1 , wherein the electronic book is adapted to be displayed on a personal computer. | 0.849206 |
9,223,836 | 1 | 4 | 1. A non-transitory computer-readable medium encoded with a ranking application comprising modules executable by a processor and configured to rank document data retrieved from a data source in response to a search request, the ranking application comprising: a term frequency module to: query the data source to identify a plurality of documents that each comprises a key term, the key term matching a search term in the search request; and determine a corresponding term frequency value for the key term in each of the plurality of documents, the term frequency value comprising a total number of occurrences of the key term in a particular document; a negation module to: retrieve at least one negation term and at least one negation rule from a memory; compare the at least one negation term according to the at least one negation rule to other terms in each document that are within a selected proximity of each occurrence of the key term to determine if each occurrence of the key term has a negative context; determine that the at least one negation term matches another term within the selected proximity of the particular occurrence of the key term according to the at least one negation rule and exclude a particular occurrence of the key term in at least one document for having the negative context; and determine a corresponding term weight value for the key term in each document based on each occurrence of the key term that has not been excluded; a ranking module to determine a corresponding relevancy ranking value for each document based on the corresponding term frequency value and corresponding term weight value; and a user interface module to generate a list of document data for display, the list identifying each document of the plurality of documents in order based on the corresponding relevancy ranking value of each document. | 1. A non-transitory computer-readable medium encoded with a ranking application comprising modules executable by a processor and configured to rank document data retrieved from a data source in response to a search request, the ranking application comprising: a term frequency module to: query the data source to identify a plurality of documents that each comprises a key term, the key term matching a search term in the search request; and determine a corresponding term frequency value for the key term in each of the plurality of documents, the term frequency value comprising a total number of occurrences of the key term in a particular document; a negation module to: retrieve at least one negation term and at least one negation rule from a memory; compare the at least one negation term according to the at least one negation rule to other terms in each document that are within a selected proximity of each occurrence of the key term to determine if each occurrence of the key term has a negative context; determine that the at least one negation term matches another term within the selected proximity of the particular occurrence of the key term according to the at least one negation rule and exclude a particular occurrence of the key term in at least one document for having the negative context; and determine a corresponding term weight value for the key term in each document based on each occurrence of the key term that has not been excluded; a ranking module to determine a corresponding relevancy ranking value for each document based on the corresponding term frequency value and corresponding term weight value; and a user interface module to generate a list of document data for display, the list identifying each document of the plurality of documents in order based on the corresponding relevancy ranking value of each document. 4. The non-transitory computer-readable medium of claim 1 wherein the at least one negation term comprises at least one prefix negation term and at least one suffix negation term. | 0.84103 |
9,418,121 | 1 | 4 | 1. A computer-implemented method comprising: maintaining an index for a collection of resources, wherein each resource in the collection is associated with zero or more respective entity tags, and wherein each entity tag includes a respective entity name; receiving a search query from a user device; identifying a plurality of resources in the collection that satisfy the search query using the index; determining that (i) the search query includes more than a first threshold number of distinct nouns that are hypernyms, (ii) the search query includes more than a different, second threshold number of distinct adjectives, or (iii) the plurality of resources is associated with more than a different, third threshold number of distinct entity tags; in response to determining that (i) the search query includes more than a first threshold number of distinct nouns that are hypernyms, (ii) the search query includes more than a different, second threshold number of distinct adjectives, or (iii) the plurality of resources is associated with more than a different, third threshold number of distinct entity tags, processing each entity tag that is associated with a respective identified resource as a current entity tag, including: determining whether or not a user interface (UI) element that is representative of the current entity tag is to be displayed on the user device; and in response to determining that the UI element that is representative of the current entity tag is to be displayed on the user device, generating UI element data that, when processed by the user device, causes the user device to display a UI element that is labeled with the entity name in the current entity tag and is selectable by a user operating the user device to initiate a search for resources that are associated with an entity that is identified by the entity name in the current entity tag; generating a results page that includes the UI element data; and sending the results page to the user device. | 1. A computer-implemented method comprising: maintaining an index for a collection of resources, wherein each resource in the collection is associated with zero or more respective entity tags, and wherein each entity tag includes a respective entity name; receiving a search query from a user device; identifying a plurality of resources in the collection that satisfy the search query using the index; determining that (i) the search query includes more than a first threshold number of distinct nouns that are hypernyms, (ii) the search query includes more than a different, second threshold number of distinct adjectives, or (iii) the plurality of resources is associated with more than a different, third threshold number of distinct entity tags; in response to determining that (i) the search query includes more than a first threshold number of distinct nouns that are hypernyms, (ii) the search query includes more than a different, second threshold number of distinct adjectives, or (iii) the plurality of resources is associated with more than a different, third threshold number of distinct entity tags, processing each entity tag that is associated with a respective identified resource as a current entity tag, including: determining whether or not a user interface (UI) element that is representative of the current entity tag is to be displayed on the user device; and in response to determining that the UI element that is representative of the current entity tag is to be displayed on the user device, generating UI element data that, when processed by the user device, causes the user device to display a UI element that is labeled with the entity name in the current entity tag and is selectable by a user operating the user device to initiate a search for resources that are associated with an entity that is identified by the entity name in the current entity tag; generating a results page that includes the UI element data; and sending the results page to the user device. 4. The computer-implemented method of claim 1 , wherein each resource in the collection is associated with zero or more respective keyword tags, wherein each keyword tag includes a respective keyword, and wherein the method further comprises: processing each keyword tag that is associated with a respective identified resource as a current keyword tag, including: determining whether or not the keyword included in the current keyword tag is an entity name, and if so, generating an entity tag that includes the keyword; and associating the entity tag with the identified resource that is associated with the current keyword tag. | 0.5 |
8,838,512 | 1 | 4 | 1. A computer-implemented method comprising: defining, using a definition module executable by a processor, a plurality of seed queries, each of the plurality seed queries corresponding to a query and associated with a task to be accomplished; summarizing the plurality of seed queries into one or more query patterns based, at least in part, on the task to be accomplished associated with each of the plurality of seed queries, wherein each of the one or more query patterns is associated with a query pattern task to be accomplished; determining a training data set comprising at least the plurality of seed queries and the query patterns; creating a graph comprising the one or more query patterns connected to one or more uniform resource locators (URLs) by one or more weighted edges; traversing the graph using a random walk algorithm to expand the training data set, wherein the random walk algorithm determines a plurality of transition probabilities such that each of the plurality of transition probabilities associates a query pattern of the one or more query patterns to a URL of the one or more URLs; and classifying the expanded training data set into one or more search task categories, wherein each of the one or more search task categories is associated with a classified task to be accomplished based, at least in part, on the query pattern task associated with an associated query pattern. | 1. A computer-implemented method comprising: defining, using a definition module executable by a processor, a plurality of seed queries, each of the plurality seed queries corresponding to a query and associated with a task to be accomplished; summarizing the plurality of seed queries into one or more query patterns based, at least in part, on the task to be accomplished associated with each of the plurality of seed queries, wherein each of the one or more query patterns is associated with a query pattern task to be accomplished; determining a training data set comprising at least the plurality of seed queries and the query patterns; creating a graph comprising the one or more query patterns connected to one or more uniform resource locators (URLs) by one or more weighted edges; traversing the graph using a random walk algorithm to expand the training data set, wherein the random walk algorithm determines a plurality of transition probabilities such that each of the plurality of transition probabilities associates a query pattern of the one or more query patterns to a URL of the one or more URLs; and classifying the expanded training data set into one or more search task categories, wherein each of the one or more search task categories is associated with a classified task to be accomplished based, at least in part, on the query pattern task associated with an associated query pattern. 4. The computer-implemented method of claim 1 , wherein the one or more search task categories is used to classify a new search query according to a search task. | 0.640625 |
9,031,384 | 12 | 13 | 12. The interesting section identifying device of claim 1 , wherein the designated time acquiring unit acquires a plurality of designated times, the interesting section identifying unit identifies an interesting section corresponding to the plurality of designated times, and the interesting section identifying device further comprises a recording unit configured to record, in an external storage device, the interesting section corresponding to the plurality of designated times in chronological order as indicated by the plurality of designated times. | 12. The interesting section identifying device of claim 1 , wherein the designated time acquiring unit acquires a plurality of designated times, the interesting section identifying unit identifies an interesting section corresponding to the plurality of designated times, and the interesting section identifying device further comprises a recording unit configured to record, in an external storage device, the interesting section corresponding to the plurality of designated times in chronological order as indicated by the plurality of designated times. 13. The interesting section identifying device of claim 12 , wherein the recording unit stores the interesting section corresponding to the plurality of designated times in the external storage device as consolidated data consolidated in chronological order as indicated by the plurality of designated times. | 0.5 |
9,009,188 | 1 | 14 | 1. A computer implemented method, comprising: receiving search request data specifying a search request, the search request comprising a drawing represented by a set of line strokes, wherein each line stroke represents a trace of a moving input point; identifying line segments from the line strokes in the set; comparing the identified line segments to reference line segments, wherein each of the reference line segments represents a portion of a corresponding reference drawing; identifying, by one or more data processors, a candidate reference drawing based on the comparison of the identified line segments with reference line segments representing the candidate reference drawing; identifying a keyword for the candidate reference drawing, wherein the keyword is a term determined to be relevant to a subject matter of the candidate reference drawing; in response to receiving the search request data, providing search results data specifying search results responsive to the keyword; identifying multiple keywords for the candidate reference drawing; providing the multiple keywords for the candidate reference drawing for selection on a search results page; receiving user selection of a particular one of the multiple keywords that are provided for selection on the search results page; and performing a search using the particular one of the multiple keywords in a search query in response to user selection of the particular one of the multiple keywords. | 1. A computer implemented method, comprising: receiving search request data specifying a search request, the search request comprising a drawing represented by a set of line strokes, wherein each line stroke represents a trace of a moving input point; identifying line segments from the line strokes in the set; comparing the identified line segments to reference line segments, wherein each of the reference line segments represents a portion of a corresponding reference drawing; identifying, by one or more data processors, a candidate reference drawing based on the comparison of the identified line segments with reference line segments representing the candidate reference drawing; identifying a keyword for the candidate reference drawing, wherein the keyword is a term determined to be relevant to a subject matter of the candidate reference drawing; in response to receiving the search request data, providing search results data specifying search results responsive to the keyword; identifying multiple keywords for the candidate reference drawing; providing the multiple keywords for the candidate reference drawing for selection on a search results page; receiving user selection of a particular one of the multiple keywords that are provided for selection on the search results page; and performing a search using the particular one of the multiple keywords in a search query in response to user selection of the particular one of the multiple keywords. 14. The computer-implemented method of claim 1 , wherein providing the search results data specifying search results responsive to the keyword is performed without user intervention after receiving the search request data. | 0.75 |
8,781,102 | 1 | 5 | 1. A non-transitory, computer readable medium that controls an executable computer readable programm code embodied therein, the executable computer readable program code for implementing a method of analyzing electronic communication data and generating behavioral assessment data therefrom, which method comprises: receiving an electronic communication from a communicant, the communication being in digital format; generating a text file from the electronic communication; analyzing the text file of the electronic communication by mining the text file generated from the electronic communication and applying a predetermined linguistic-based psychological behavioral model to the text file generated from the electronic communication; and generating behavioral assessment data including a personality type corresponding to the analyzed text file of the electronic communication. | 1. A non-transitory, computer readable medium that controls an executable computer readable programm code embodied therein, the executable computer readable program code for implementing a method of analyzing electronic communication data and generating behavioral assessment data therefrom, which method comprises: receiving an electronic communication from a communicant, the communication being in digital format; generating a text file from the electronic communication; analyzing the text file of the electronic communication by mining the text file generated from the electronic communication and applying a predetermined linguistic-based psychological behavioral model to the text file generated from the electronic communication; and generating behavioral assessment data including a personality type corresponding to the analyzed text file of the electronic communication. 5. The non-transitory, computer readable medium of claim 1 , wherein the electronic communication comprises at least one of a digital recording of a telephone call, a facsimile transmission, an e-mail, a web interaction, voice over IP (“VoIP”), and a digital video. | 0.849943 |
7,849,144 | 8 | 13 | 8. An instant message communications system comprising: a messaging resource configured for detecting an instant message having been sent by a sending party for delivery to a destination party, the instant message expressed in a first language; a presence resource configured for determining a language preference, for the destination party to receive the instant message, independent of whether any translation request has been requested by the sending party, wherein at least one of the messaging resource or the presence resource is configured for selectively clearing a cache that stores translation results of prior transmitted instant messages having been sent by the sending party, based on the messaging resource or the presence resource determining the translation results of the prior transmitted instant messages are no longer viable for context-based translation of the instant message; and a translation resource configured for translating the instant message having been sent by the sending party into a translated instant message, expressed in second language, in response to a translation request from the messaging resource, the messaging resource configured for sending the translation request based on the presence resource having determined the language preference for the destination party is distinct from the first language, wherein the instant message follows a sequence of prior transmitted instant messages having been sent by the sending party and having been translated and sent to the destination party in the second language, the translation resource translating the instant message relative to a context of the sequence of prior transmitted instant messages based on retrieval from the cache of the translation results of the prior transmitted instant messages determined as viable to the context-based translation of the instant message, and initiating the context-based translation of the instant message relative to the translation results; the messaging resource configured for sending the translated instant message in the second language to the destination party. | 8. An instant message communications system comprising: a messaging resource configured for detecting an instant message having been sent by a sending party for delivery to a destination party, the instant message expressed in a first language; a presence resource configured for determining a language preference, for the destination party to receive the instant message, independent of whether any translation request has been requested by the sending party, wherein at least one of the messaging resource or the presence resource is configured for selectively clearing a cache that stores translation results of prior transmitted instant messages having been sent by the sending party, based on the messaging resource or the presence resource determining the translation results of the prior transmitted instant messages are no longer viable for context-based translation of the instant message; and a translation resource configured for translating the instant message having been sent by the sending party into a translated instant message, expressed in second language, in response to a translation request from the messaging resource, the messaging resource configured for sending the translation request based on the presence resource having determined the language preference for the destination party is distinct from the first language, wherein the instant message follows a sequence of prior transmitted instant messages having been sent by the sending party and having been translated and sent to the destination party in the second language, the translation resource translating the instant message relative to a context of the sequence of prior transmitted instant messages based on retrieval from the cache of the translation results of the prior transmitted instant messages determined as viable to the context-based translation of the instant message, and initiating the context-based translation of the instant message relative to the translation results; the messaging resource configured for sending the translated instant message in the second language to the destination party. 13. The system of claim 8 , wherein the message resource is configured for causing the translated instant message to be highlighted by a registered device of the destination party, relative to the sequence of prior transmitted instant messages having been translated and sent to the destination party in the second language. | 0.516418 |
8,249,906 | 19 | 23 | 19. The planning method according to claim 1 , wherein such step of selecting, on such at least one computational device, by such at least one human project planner, at least one time-dependent relationship between such at least two activities comprises the step of selecting, on such at least one computational device, such at least one time-dependent relationship between any first activity embedded node, intermediate of the start and finish nodes of such at least one first activity, and any of the following: a) at least one activity start node of at least one second activity; b) at least one activity finish node of such at least one second activity; c) at least one milestone deadline; and d) at least one second activity embedded node, intermediate of the start and finish nodes of such at least one second activity. | 19. The planning method according to claim 1 , wherein such step of selecting, on such at least one computational device, by such at least one human project planner, at least one time-dependent relationship between such at least two activities comprises the step of selecting, on such at least one computational device, such at least one time-dependent relationship between any first activity embedded node, intermediate of the start and finish nodes of such at least one first activity, and any of the following: a) at least one activity start node of at least one second activity; b) at least one activity finish node of such at least one second activity; c) at least one milestone deadline; and d) at least one second activity embedded node, intermediate of the start and finish nodes of such at least one second activity. 23. The planning method according to claim 19 , wherein such at least one time-dependent relationship comprises “from such at least one first activity embedded node to such at least one second activity finish node” relationship. | 0.5 |
7,761,448 | 1 | 3 | 1. A system for ranking search results, comprising a search engine on a computing device, the search engine configured to execute computer-executable instructions, which when executed by the computing system cause the computing system to perform a method comprising: discovering a plurality of documents on a network; recording document and link information for each of the plurality of documents on the network; generating a representation of the network from the document and link information, wherein the representation of the network includes a plurality of nodes, each document being represented by one of the plurality of nodes; receiving manually input click distances designating a subset of the plurality of nodes as highest authority nodes, the subset of the plurality of nodes including at least a first highest authority node and a second highest authority node, wherein the manually input click distances indicate a relative importance of each highest authority node with respect to other highest authority nodes; initializing click distances for a second subset of the plurality of nodes to a maximum value, the second subset of the plurality of nodes not including highest authority nodes and comprising at least a first non-highest authority node and a second non-highest authority node; computing click distances for the first and second non-highest authority nodes by: determining a first click distance for the first non-highest authority node, the first click distance being a first number of branches traversed on a first shortest path between the first non-highest authority node and the first highest authority node; determining a second click distance for the first non-highest authority node, the second click distance being a second number of branches traversed on a second shortest path between the first non-highest authority node and the second highest authority node; determining a third click distance for the second non-highest authority node, the third click distance being a third number of branches traversed on a third shortest path between the second non-highest authority node and the first highest authority node; and determining a fourth click distance for the second non-highest authority node, the fourth click distance being a fourth number of branches traversed on a fourth shortest path between the second non-highest authority node and the second highest authority node; storing the first, second, third, and fourth click distances in memory, such that the first and second click distances are associated with a first document, and the third and fourth click distances are associated with a second document; calculating search rank results using at least one of the first, second, third, and fourth click distances associated with each of the first and second documents as a query-independent relevance measure in ranking the plurality of documents; and storing search rank results in memory, wherein the search rank results comprise a list of documents arranged in a descending order of relevance. | 1. A system for ranking search results, comprising a search engine on a computing device, the search engine configured to execute computer-executable instructions, which when executed by the computing system cause the computing system to perform a method comprising: discovering a plurality of documents on a network; recording document and link information for each of the plurality of documents on the network; generating a representation of the network from the document and link information, wherein the representation of the network includes a plurality of nodes, each document being represented by one of the plurality of nodes; receiving manually input click distances designating a subset of the plurality of nodes as highest authority nodes, the subset of the plurality of nodes including at least a first highest authority node and a second highest authority node, wherein the manually input click distances indicate a relative importance of each highest authority node with respect to other highest authority nodes; initializing click distances for a second subset of the plurality of nodes to a maximum value, the second subset of the plurality of nodes not including highest authority nodes and comprising at least a first non-highest authority node and a second non-highest authority node; computing click distances for the first and second non-highest authority nodes by: determining a first click distance for the first non-highest authority node, the first click distance being a first number of branches traversed on a first shortest path between the first non-highest authority node and the first highest authority node; determining a second click distance for the first non-highest authority node, the second click distance being a second number of branches traversed on a second shortest path between the first non-highest authority node and the second highest authority node; determining a third click distance for the second non-highest authority node, the third click distance being a third number of branches traversed on a third shortest path between the second non-highest authority node and the first highest authority node; and determining a fourth click distance for the second non-highest authority node, the fourth click distance being a fourth number of branches traversed on a fourth shortest path between the second non-highest authority node and the second highest authority node; storing the first, second, third, and fourth click distances in memory, such that the first and second click distances are associated with a first document, and the third and fourth click distances are associated with a second document; calculating search rank results using at least one of the first, second, third, and fourth click distances associated with each of the first and second documents as a query-independent relevance measure in ranking the plurality of documents; and storing search rank results in memory, wherein the search rank results comprise a list of documents arranged in a descending order of relevance. 3. The system of claim 1 wherein computing click distances further comprises merging the first, second, third, and fourth click distances into an index that includes one or more other ranking values that correspond to each of the first and second documents. | 0.824213 |
9,704,054 | 2 | 3 | 2. The computer-implemented method of claim 1 , wherein each of the first plurality of outputs further comprises at least one degree of confidence in an association of the at least one of the plurality of labels with the one of the plurality of images. | 2. The computer-implemented method of claim 1 , wherein each of the first plurality of outputs further comprises at least one degree of confidence in an association of the at least one of the plurality of labels with the one of the plurality of images. 3. The computer-implemented method of claim 2 , wherein defining the plurality of clusters of the plurality of labels further comprises: identifying a first label having at least a first degree of confidence in an association with one of the plurality of images; identifying a second label having at least a second degree of confidence in the association with the one of the plurality of images; and defining the first cluster of the plurality of labels to include at least the first label and the second label. | 0.5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.