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
|
|---|---|---|---|---|---|
8,788,262 | 15 | 28 | 15. A computer program product comprising a non-transitory computer-readable storage medium containing computer program code for: receiving an abstract phrase comprising a text phrase and a variable at a particular position in the text phrase; receiving a text value for the variable; combining the text phrase of the abstract phrase and the text value according to the particular position of the variable; applying an integration rule at a boundary of the text phrase of the abstract phrase and the text value to produce an integrated phrase, the integration rule based on a language rule, wherein the integration rule changes a portion of a word of the text phrase of the abstract phrase or a portion of a word of the text value so that the text phrase and the text value comply with the integration rule. | 15. A computer program product comprising a non-transitory computer-readable storage medium containing computer program code for: receiving an abstract phrase comprising a text phrase and a variable at a particular position in the text phrase; receiving a text value for the variable; combining the text phrase of the abstract phrase and the text value according to the particular position of the variable; applying an integration rule at a boundary of the text phrase of the abstract phrase and the text value to produce an integrated phrase, the integration rule based on a language rule, wherein the integration rule changes a portion of a word of the text phrase of the abstract phrase or a portion of a word of the text value so that the text phrase and the text value comply with the integration rule. 28. The computer program product of claim 15 , wherein the computer code is further configured for: receiving metadata describing the text value for the variable, and wherein applying an integration rule at a boundary further comprises determining whether the metadata satisfies a condition of the rule. | 0.821344 |
6,073,096 | 9 | 18 | 9. A method of building class-specific cluster systems comprising the steps of: providing a speaker dependent system for each of a plurality of training speakers; partitioning an acoustic space according to classes, each class being characterized by a set of acoustic features; grouping the speaker dependent systems with the acoustic spaces according to classes to build acoustic spaces with common features from all the speaker dependent systems; and clustering the grouped acoustic spaces with common features to form cluster systems based on acoustic characteristics of the speakers, the acoustic characteristics including class-specific characteristics. | 9. A method of building class-specific cluster systems comprising the steps of: providing a speaker dependent system for each of a plurality of training speakers; partitioning an acoustic space according to classes, each class being characterized by a set of acoustic features; grouping the speaker dependent systems with the acoustic spaces according to classes to build acoustic spaces with common features from all the speaker dependent systems; and clustering the grouped acoustic spaces with common features to form cluster systems based on acoustic characteristics of the speakers, the acoustic characteristics including class-specific characteristics. 18. The method of building class-specific cluster systems as recited in claim 9, wherein the step of partitioning an acoustic space further includes the steps of: gathering expectation-maximization counts of a same context from a speaker independent system; generating a speaker independent context-independent system from the counts; and clustering the context-independent system to generate partitions of a whole acoustic space into the acoustic spaces. | 0.5 |
8,370,352 | 1 | 11 | 1. A system for searching one or more electronic records and displaying relevant data based on the search, the system comprising: a processor; and one or more non-transitory program storage devices readable by the processor, tangibly embodying a searching unit, a visual interface and a statistical analyzer executable by the processor, wherein the searching unit is configured to search for text in the one or more electronic records that are within a context of an entered query string, wherein the context is influenced by text that precedes or follows an instance of the entered query string in the one or more electronic records wherein a context type describes a structure in which the instance of the entered query string may be presented in the one or more electronic records, wherein the context type comprises at least a phrasal context, a bullet context, or a list context, wherein the statistical analyzer is configured to analyze results of the search, provide search statistics, and order the results associated with the entered query string based on the search statistics and the context of the entered query string, and wherein the visual interface is configured to display the search statistics and the results of the search presented in the structure corresponding to the context type. | 1. A system for searching one or more electronic records and displaying relevant data based on the search, the system comprising: a processor; and one or more non-transitory program storage devices readable by the processor, tangibly embodying a searching unit, a visual interface and a statistical analyzer executable by the processor, wherein the searching unit is configured to search for text in the one or more electronic records that are within a context of an entered query string, wherein the context is influenced by text that precedes or follows an instance of the entered query string in the one or more electronic records wherein a context type describes a structure in which the instance of the entered query string may be presented in the one or more electronic records, wherein the context type comprises at least a phrasal context, a bullet context, or a list context, wherein the statistical analyzer is configured to analyze results of the search, provide search statistics, and order the results associated with the entered query string based on the search statistics and the context of the entered query string, and wherein the visual interface is configured to display the search statistics and the results of the search presented in the structure corresponding to the context type. 11. The system of claim 1 , wherein the searching unit is further configured to narrow its search based on one or more constraints relating to a medical record type or a medical institution. | 0.690554 |
7,788,100 | 1 | 2 | 1. A method of allowing a user to interact with a web page displayed on a display device, wherein the web page includes one or more grammatical units, each grammatical unit being defined by an active region, the method comprising: (a) creating an active region for each grammatical unit using a computer prior to displaying the web page on a display device by: (i) getting original web page source code that includes at least text designated for display, (ii) parsing the text into one or more grammatical units, (iii) for each grammatical unit, defining an active region that encompasses the grammatical unit; and (iv) reassembling the original web page source code into text-to-speech enabled web page source code by incorporating the one or more grammatical units into the text-to-speech enabled web page source code, wherein the text-to-speech enabled web page source code is used to display the web page on the display device with which the user interacts; (b) positioning a pointing device over any part of an active region of a grammatical unit; (c) automatically highlighting the grammatical unit using the computer whenever the pointing device is over any part of the active region, and without requiring any further user manipulation of the pointing device or any other user interfaces associated with the display device; (d) automatically loading the grammatical unit into a text-to-speech engine that automatically reads aloud the grammatical unit without requiring any further user manipulation of the pointing device or any other user interfaces associated with the display device; and (e) automatically reading aloud the grammatical unit using the computer only if the pointing device persists in any part of the active region for greater than a preset human perceivable time period, wherein the automatic highlighting and the automatic reading aloud occur sequentially. | 1. A method of allowing a user to interact with a web page displayed on a display device, wherein the web page includes one or more grammatical units, each grammatical unit being defined by an active region, the method comprising: (a) creating an active region for each grammatical unit using a computer prior to displaying the web page on a display device by: (i) getting original web page source code that includes at least text designated for display, (ii) parsing the text into one or more grammatical units, (iii) for each grammatical unit, defining an active region that encompasses the grammatical unit; and (iv) reassembling the original web page source code into text-to-speech enabled web page source code by incorporating the one or more grammatical units into the text-to-speech enabled web page source code, wherein the text-to-speech enabled web page source code is used to display the web page on the display device with which the user interacts; (b) positioning a pointing device over any part of an active region of a grammatical unit; (c) automatically highlighting the grammatical unit using the computer whenever the pointing device is over any part of the active region, and without requiring any further user manipulation of the pointing device or any other user interfaces associated with the display device; (d) automatically loading the grammatical unit into a text-to-speech engine that automatically reads aloud the grammatical unit without requiring any further user manipulation of the pointing device or any other user interfaces associated with the display device; and (e) automatically reading aloud the grammatical unit using the computer only if the pointing device persists in any part of the active region for greater than a preset human perceivable time period, wherein the automatic highlighting and the automatic reading aloud occur sequentially. 2. The method of claim 1 wherein the preset time period is at least about one second. | 0.829317 |
9,483,464 | 1 | 5 | 1. A method for managing semantic and syntactic metadata, said method comprising: a processor of a computer system receiving heterogeneous data; after said receiving, said processor capturing semantic metadata associated with said received heterogeneous data, said semantic metadata describing contextually relevant or domain-specific information about data based on an industry-specific or enterprise-specific metadata model or ontology; after said receiving, said processor capturing syntactic metadata associated with said received heterogeneous data, said syntactic metadata including grammatical rules and structural patterns governing an ordered use of formats and arrangement pertaining to specified data; said processor logically linking said received heterogeneous data and said captured semantic metadata and said syntactic metadata; and said processor storing said heterogeneous data in a repository. | 1. A method for managing semantic and syntactic metadata, said method comprising: a processor of a computer system receiving heterogeneous data; after said receiving, said processor capturing semantic metadata associated with said received heterogeneous data, said semantic metadata describing contextually relevant or domain-specific information about data based on an industry-specific or enterprise-specific metadata model or ontology; after said receiving, said processor capturing syntactic metadata associated with said received heterogeneous data, said syntactic metadata including grammatical rules and structural patterns governing an ordered use of formats and arrangement pertaining to specified data; said processor logically linking said received heterogeneous data and said captured semantic metadata and said syntactic metadata; and said processor storing said heterogeneous data in a repository. 5. The method of claim 1 , said capturing said semantic metadata comprising prior to having determined whether said received heterogeneous data utilizes the standardized syntax: determining that said received heterogeneous data was not generated by a machine; after having determined that said received heterogeneous data was not generated by the machine, sending one or more questions to said end user, each question of said one or more questions relating to semantic attributes of said received heterogeneous data; and receiving at least one response from said end user, each response of said at least one response corresponding to a unique question of said one or more questions. | 0.686004 |
9,165,063 | 3 | 4 | 3. The data handling device according, to claim 1 , in which analysis of the metadata generates for each term a set of weights, each weight indicating a number representing how many documents have been assigned both the term in question and a respective other term, divided by a total number of documents to which the term in question has been assigned. | 3. The data handling device according, to claim 1 , in which analysis of the metadata generates for each term a set of weights, each weight indicating a number representing how many documents have been assigned both the term in question and a respective other term, divided by a total number of documents to which the term in question has been assigned. 4. The data handling device according to claim 3 in which each set of weights is further processed by: for each term for which a nonzero weight has been generated, comparing the set of weights for the term with the set of weights under consideration to determine a rating equal to the number of terms appearing in both sets of weights; and deleting low-rating terms from the set of terms. | 0.5 |
5,493,634 | 13 | 14 | 13. The decomposer of claim 11, further comprising an apparatus, associated with said preparsing apparatus, for storing each of the image related components in the memory section. | 13. The decomposer of claim 11, further comprising an apparatus, associated with said preparsing apparatus, for storing each of the image related components in the memory section. 14. The decomposer of claim 13, in which said storing apparatus is provided with image related identifiers for each of the image related components stored in the memory section, wherein, said decomposer includes a database, said database communicating with said storing apparatus, and said storing apparatus communicates the image related identifiers to said database. | 0.5 |
8,584,085 | 15 | 17 | 15. An apparatus for concept identification in software, comprising: a processing device; a graphical user interface and user input device operatively connected to the processing device; and a storage component, operatively connected to the processing device, having stored thereon executable instructions that, when executed by the processing device, cause the processing device to: display, via the graphical user interface, concept specification prompts; receive, via the at least one user input device based on the concept specification prompts, concept specification information corresponding to a concept, the concept comprising at least one of code abstraction, design abstraction, and architectural abstraction, the concept specification information comprising a code pattern illustrating the concept, and the code pattern including a predetermined length of source code or object code that defines the concept; parse the code pattern to identify at least one token; generate at least one rule based on the at least one token and according to a mapping; identify occurrence of the concept in a code listing based on the at least one rule; and display, via the graphical user interface, information regarding the occurrence of the concept in the code listing as an indication of quality of the code listing, the displayed information comprising at least one of information concerning presence of the concept in the code listing and information concerning absence of the concept in the code listing. | 15. An apparatus for concept identification in software, comprising: a processing device; a graphical user interface and user input device operatively connected to the processing device; and a storage component, operatively connected to the processing device, having stored thereon executable instructions that, when executed by the processing device, cause the processing device to: display, via the graphical user interface, concept specification prompts; receive, via the at least one user input device based on the concept specification prompts, concept specification information corresponding to a concept, the concept comprising at least one of code abstraction, design abstraction, and architectural abstraction, the concept specification information comprising a code pattern illustrating the concept, and the code pattern including a predetermined length of source code or object code that defines the concept; parse the code pattern to identify at least one token; generate at least one rule based on the at least one token and according to a mapping; identify occurrence of the concept in a code listing based on the at least one rule; and display, via the graphical user interface, information regarding the occurrence of the concept in the code listing as an indication of quality of the code listing, the displayed information comprising at least one of information concerning presence of the concept in the code listing and information concerning absence of the concept in the code listing. 17. The apparatus of claim 15 , wherein those instructions that cause the processing device to receive the concept specification information are further operative to receive conditional property-value information applicable to each of the at least one token. | 0.5 |
8,370,328 | 1 | 3 | 1. A method for creating an electronic database of disambiguated entity mentions from a corpus of electronic documents using a microprocessor, the method comprising: (a) executing on the microprocessor a data harvesting module to automatically extract entity mentions from the electronic documents in the corpus and parse the entity mentions into mention objects; (b) executing on the microprocessor a mention group creation module to create one or more mention groups by automatically grouping the mention objects together according to a distinguishing attribute common to a given class of mention objects; (c) selecting a mention group from the one or more mention groups for comparison processing; (d) executing on the microprocessor a collection of comparison modules that automatically (i) compares every mention object in the selected mention group with every other mention object in the selected mention group to produce a collection of comparison algorithm scores for every pair of mention objects in the selected mention group, and (ii) generates an overall confidence score for every pair of mention objects in the selected mention group based on the collection of comparison algorithm scores for said every pair of mention objects; (e) executing on the microprocessor an entity object creation module to create one or more new entity objects for the selected mention group by automatically (i) grouping together mention objects with other mention objects, based on the confidence scores of each pair of mention objects and a specified confidence threshold, wherein pairs of mention objects having a confidence score greater than or equal to the specified threshold are assigned to the same new entity object, and (ii) merging previously-created entity objects with other previously-created entity objects, based on the confidence scores of each pair of entity objects, and a specified confidence threshold, wherein pairs of entity objects having a confidence score greater than or equal to the specified threshold are assigned to the same new entity object; (f) storing said one or more new entity objects in the electronic database of disambiguated entity mentions; and (g) repeating steps (c) through (f) above until all of the one or more mention groups have been comparison processed. | 1. A method for creating an electronic database of disambiguated entity mentions from a corpus of electronic documents using a microprocessor, the method comprising: (a) executing on the microprocessor a data harvesting module to automatically extract entity mentions from the electronic documents in the corpus and parse the entity mentions into mention objects; (b) executing on the microprocessor a mention group creation module to create one or more mention groups by automatically grouping the mention objects together according to a distinguishing attribute common to a given class of mention objects; (c) selecting a mention group from the one or more mention groups for comparison processing; (d) executing on the microprocessor a collection of comparison modules that automatically (i) compares every mention object in the selected mention group with every other mention object in the selected mention group to produce a collection of comparison algorithm scores for every pair of mention objects in the selected mention group, and (ii) generates an overall confidence score for every pair of mention objects in the selected mention group based on the collection of comparison algorithm scores for said every pair of mention objects; (e) executing on the microprocessor an entity object creation module to create one or more new entity objects for the selected mention group by automatically (i) grouping together mention objects with other mention objects, based on the confidence scores of each pair of mention objects and a specified confidence threshold, wherein pairs of mention objects having a confidence score greater than or equal to the specified threshold are assigned to the same new entity object, and (ii) merging previously-created entity objects with other previously-created entity objects, based on the confidence scores of each pair of entity objects, and a specified confidence threshold, wherein pairs of entity objects having a confidence score greater than or equal to the specified threshold are assigned to the same new entity object; (f) storing said one or more new entity objects in the electronic database of disambiguated entity mentions; and (g) repeating steps (c) through (f) above until all of the one or more mention groups have been comparison processed. 3. The method of claim 1 , further comprising executing program instructions on the microprocessor to cause the microprocessor to normalize the distinguishing common attribute for each mention object in the given class according to a set of normalization rules prior to grouping the mention objects together based on the distinguishing common attribute. | 0.696735 |
6,092,038 | 1 | 11 | 1. A method for losslessly compressing an n-gram language model for storage in a storage device, the n-gram language model comprising a plurality of n-gram records generated from a training vocabulary, each n-gram record comprising an n-gram in the form of a series of "n-tuple" words (w1, w2, . . . wn), a count and a probability associated therewith, each n-gram having a history represented by the initial n-1 words of the n-gram, said method comprising the steps of: splitting said plurality of n-gram records into (i) a set of common history records comprising subsets of n-tuple words having a common history and (ii) sets of hypothesis records that are associated with the common history records, each set of hypothesis records including at least one hypothesis record comprising a word record-probability record pair; partitioning said common history records into at least a first group and a second group, said first group comprising each common history record having a single hypothesis record associated therewith, said second group comprising each common history record having more than one hypothesis record associated therewith; storing said hypothesis records associated with said second group of common history records in said storage device; and storing, in an index portion of said storage device, (i) each common history record of said second group together with an address that points to a location in said storage device having corresponding hypothesis records and (ii) each common history record of said first group together with its corresponding single hypothesis record. | 1. A method for losslessly compressing an n-gram language model for storage in a storage device, the n-gram language model comprising a plurality of n-gram records generated from a training vocabulary, each n-gram record comprising an n-gram in the form of a series of "n-tuple" words (w1, w2, . . . wn), a count and a probability associated therewith, each n-gram having a history represented by the initial n-1 words of the n-gram, said method comprising the steps of: splitting said plurality of n-gram records into (i) a set of common history records comprising subsets of n-tuple words having a common history and (ii) sets of hypothesis records that are associated with the common history records, each set of hypothesis records including at least one hypothesis record comprising a word record-probability record pair; partitioning said common history records into at least a first group and a second group, said first group comprising each common history record having a single hypothesis record associated therewith, said second group comprising each common history record having more than one hypothesis record associated therewith; storing said hypothesis records associated with said second group of common history records in said storage device; and storing, in an index portion of said storage device, (i) each common history record of said second group together with an address that points to a location in said storage device having corresponding hypothesis records and (ii) each common history record of said first group together with its corresponding single hypothesis record. 11. The method of claim 1, further comprising the steps of: splitting each of said sets of hypothesis records into a first set and a second set, said first set containing the first n records of the set of hypothesis records and said second set containing the remainder of the set of hypothesis records; storing an A flag in the index portion of said storage device for each of said first sets of n records to mark a byte length for each of said n records; and storing a B flag in the word records and probability records of each second set of remaining hypothesis records to mark a byte length for each of said remaining records. | 0.548132 |
9,479,911 | 14 | 15 | 14. The transmitter-side terminal of claim 8 , further comprising: a microphone supporting collection of a voice signal in the first language, wherein the storage unit comprises a voice recognition database for voice recognition of the voice signal in the first language. | 14. The transmitter-side terminal of claim 8 , further comprising: a microphone supporting collection of a voice signal in the first language, wherein the storage unit comprises a voice recognition database for voice recognition of the voice signal in the first language. 15. The transmitter-side terminal of claim 14 , wherein when the voice signal in the first language is collected, the controller performs a control to generate a voice-recognized text by using the voice recognition database and translate the generated voice-recognized text to generate a translation text in the second language. | 0.5 |
5,485,544 | 1 | 3 | 1. In an interactive processing system having a function of outputting a help message, a help control method, comprising the steps of: storing help messages in a message database; storing inference rules in a rule database; obtaining through use of a user program at least a history of past statuses resulting from execution of commands by said user program; applying inference rules, stored in said rule database, to said history of past statuses for selecting held messages, each of said inference rules being related to a relationship between a status of said user program and a help message to be outputted; and obtaining, from help messages stored in said message database, a help message selected on the basis of a result of said applying step. | 1. In an interactive processing system having a function of outputting a help message, a help control method, comprising the steps of: storing help messages in a message database; storing inference rules in a rule database; obtaining through use of a user program at least a history of past statuses resulting from execution of commands by said user program; applying inference rules, stored in said rule database, to said history of past statuses for selecting held messages, each of said inference rules being related to a relationship between a status of said user program and a help message to be outputted; and obtaining, from help messages stored in said message database, a help message selected on the basis of a result of said applying step. 3. A help control method according to claim 1, wherein said inference rules are applied to a current status and said history of past statuses of said user program in said applying step. | 0.513158 |
8,959,654 | 1 | 3 | 1. A document review and security system comprising: a processor; and storage coupled to the processor, wherein the storage stores a computer program, and wherein the computer program, when executed by the processor, is configured to: divide a page image of a document into a plurality of sub-images forming geometric parts, wherein each of the sub-images includes a contiguous area of the document that is less than the entire area of the document, and wherein each of the sub-images is at least partially different from the other sub-images; present a first sub-image of a first portion of a document to a first reviewer by identifying a first element within the document that is contextually related to a second element within the document in accordance with predefined contextual relationship criteria and including the first element within the first portion without the second element; in response to receiving a request from the first reviewer to present a second sub-image, determine an extent of the second sub-image to be shown based on predefined criteria for a depth from the border of the second sub-image, wherein the second sub-image is adjacent to the first sub-image; and present the first sub-image and the second sub-image to the determined extent to the first reviewer; present a third sub-image of a second portion of the document to a second reviewer; and in response to receiving review action inputs from the first reviewer and the second reviewer, determine a disposition of the document from a plurality of dispositions, and wherein the plurality of dispositions include redaction of the document accordance with the review action inputs. | 1. A document review and security system comprising: a processor; and storage coupled to the processor, wherein the storage stores a computer program, and wherein the computer program, when executed by the processor, is configured to: divide a page image of a document into a plurality of sub-images forming geometric parts, wherein each of the sub-images includes a contiguous area of the document that is less than the entire area of the document, and wherein each of the sub-images is at least partially different from the other sub-images; present a first sub-image of a first portion of a document to a first reviewer by identifying a first element within the document that is contextually related to a second element within the document in accordance with predefined contextual relationship criteria and including the first element within the first portion without the second element; in response to receiving a request from the first reviewer to present a second sub-image, determine an extent of the second sub-image to be shown based on predefined criteria for a depth from the border of the second sub-image, wherein the second sub-image is adjacent to the first sub-image; and present the first sub-image and the second sub-image to the determined extent to the first reviewer; present a third sub-image of a second portion of the document to a second reviewer; and in response to receiving review action inputs from the first reviewer and the second reviewer, determine a disposition of the document from a plurality of dispositions, and wherein the plurality of dispositions include redaction of the document accordance with the review action inputs. 3. The system of claim 1 , wherein the computer program, when executed by the processor, is configured to perform the disposition of the document by at least one of: assigning a classification to the document and imposing a security constraint upon the document. | 0.73374 |
9,658,735 | 6 | 7 | 6. The system of claim 3 , wherein one or more of the aspects of the user interface pertain to any of priority of fields, color contrast, whitespace, alignment, field labels, element labels, redundancy, tool tips, progress indicators, and display resolution. | 6. The system of claim 3 , wherein one or more of the aspects of the user interface pertain to any of priority of fields, color contrast, whitespace, alignment, field labels, element labels, redundancy, tool tips, progress indicators, and display resolution. 7. The system of claim 6 , wherein one or more of the aspects of the user interface pertain to whitespace in at least one of tables and sections of the user interface. | 0.747734 |
5,396,228 | 12 | 14 | 12. A paging method according to claim 11, further comprising the steps of: classifying each word of said page message other than said at least one of said plurality of words, and associating with each classified word a header code identifying the classification of said word. | 12. A paging method according to claim 11, further comprising the steps of: classifying each word of said page message other than said at least one of said plurality of words, and associating with each classified word a header code identifying the classification of said word. 14. The paging method according to claim 12, wherein said step of classifying includes the step of: recognizing a predetermined series of bits representing an integer. | 0.553476 |
8,856,142 | 1 | 8 | 1. A computer-implemented method for an interactive graphical search interface, the method comprising: identifying, from a search engine database, a plurality of related search parameters based on one or more initial search parameters; generating, by a processor, a multi-dimensional search space, based on the one or more initial search parameters and plurality of related search parameters, wherein the multi-dimensional search space has a perimeter defined by the one or more initial parameters and the plurality of related search parameters; transmitting a graphical interface projecting the multi-dimensional search space, along with one or more elements by which adjustments to a weighting of one or more of the one or more initial search parameters and the plurality of related search parameters by interacting with one or more of the elements; and transmitting a plurality of search results automatically updated in real time based on adjustments to the weighting of the one or more initial search parameters and the plurality of related search parameters, wherein each of the one or more user elements is movable toward or away from a center of the multi-dimensional search space to change the weighting of one or more of the one or more initial search parameters and the plurality of related search parameters. | 1. A computer-implemented method for an interactive graphical search interface, the method comprising: identifying, from a search engine database, a plurality of related search parameters based on one or more initial search parameters; generating, by a processor, a multi-dimensional search space, based on the one or more initial search parameters and plurality of related search parameters, wherein the multi-dimensional search space has a perimeter defined by the one or more initial parameters and the plurality of related search parameters; transmitting a graphical interface projecting the multi-dimensional search space, along with one or more elements by which adjustments to a weighting of one or more of the one or more initial search parameters and the plurality of related search parameters by interacting with one or more of the elements; and transmitting a plurality of search results automatically updated in real time based on adjustments to the weighting of the one or more initial search parameters and the plurality of related search parameters, wherein each of the one or more user elements is movable toward or away from a center of the multi-dimensional search space to change the weighting of one or more of the one or more initial search parameters and the plurality of related search parameters. 8. The method of claim 1 , further comprising: enabling the user to simultaneously examine multiple data sets; and searching for an intersection by joining parameters common to each data set, by joining search spaces of each data set. | 0.690476 |
8,423,583 | 1 | 10 | 1. A user-interface method of selecting and presenting a collection of content items, the method comprising: providing access to a set of content items; determining an organizational or social relationship of the user to at least one other person and inferring a likelihood of the user wanting to contact the other person based on the organizational or social relationship; determining a relevance of at least one content item of the set of content items to the other person; associating a relevance weight with the at least one content item, wherein the associated relevance weight is based in part on the likelihood of the user wanting to contact the other person; receiving input entered by the user for identifying desired content items; in response to the input entered by the user, selecting and presenting a subset of content items to the user as a hierarchy of content items browsable by the user, wherein the content items are ordered at least in part by the initial associated relevance weights of the content items. | 1. A user-interface method of selecting and presenting a collection of content items, the method comprising: providing access to a set of content items; determining an organizational or social relationship of the user to at least one other person and inferring a likelihood of the user wanting to contact the other person based on the organizational or social relationship; determining a relevance of at least one content item of the set of content items to the other person; associating a relevance weight with the at least one content item, wherein the associated relevance weight is based in part on the likelihood of the user wanting to contact the other person; receiving input entered by the user for identifying desired content items; in response to the input entered by the user, selecting and presenting a subset of content items to the user as a hierarchy of content items browsable by the user, wherein the content items are ordered at least in part by the initial associated relevance weights of the content items. 10. The method of claim 1 , wherein the organizational relationship is a hierarchy containing superiors, peers, and subordinates. | 0.81882 |
8,370,282 | 24 | 25 | 24. The method of claim 21 , wherein computing a Web page quality score comprises computing the Web page quality score based on a function of the initial quality scores and characteristics of the Web page. | 24. The method of claim 21 , wherein computing a Web page quality score comprises computing the Web page quality score based on a function of the initial quality scores and characteristics of the Web page. 25. The method of claim 24 , wherein the characteristics include sizes of the images. | 0.5 |
7,734,996 | 25 | 33 | 25. A documentation browsing program stored in a program memory characterized by causing a computer to execute the process of: generating correspondence between voices or images included in audio data or image data with a document included in document data; displaying the voices or the images included in said audio data or said image data and the document included in said document data associated with each other based on said correspondence; and updating said document data associated based on user editing instruction; displaying a displaying location of a document included in document data on a display screen in association with time information which indicates an elapsed time of voices or images; and outputting recalculation instruction information for instructing recalculation of relationship between a document and voices or images and recalculating said relationship when said document data is updated. | 25. A documentation browsing program stored in a program memory characterized by causing a computer to execute the process of: generating correspondence between voices or images included in audio data or image data with a document included in document data; displaying the voices or the images included in said audio data or said image data and the document included in said document data associated with each other based on said correspondence; and updating said document data associated based on user editing instruction; displaying a displaying location of a document included in document data on a display screen in association with time information which indicates an elapsed time of voices or images; and outputting recalculation instruction information for instructing recalculation of relationship between a document and voices or images and recalculating said relationship when said document data is updated. 33. The documentation browsing program according to claim 25 , causing a computer to execute the process of displaying the length of each section of document data on a display screen by the length in proportion to the amount of documents in documents associated with said each section. | 0.759696 |
8,170,867 | 4 | 11 | 4. A system for extracting information from a natural-language text, said system comprising: an input unit for receiving said natural-language text; a lexicon file in which less than 1000 tool words with predefined grammatical functions are recorded, said tool words being essentially constituted by articles, prepositions, conjunctions and verbal auxiliaries; an analysis processor connected to said input unit, and to the lexicon file, and organized to act in a first stage to encode the words of the natural-language text by evaluating the grammatical function of each word by comparing each word with the contents of said lexicon file of tool words, so as to identify the tool words in the text and so as to evaluate the functions of the other words which are not recognized as being tool words, by comparing their locations relative to the locations of the words recognized as being tool words, and, in a second stage, to search subsets of the resulting succession of encoded words to look for groups of encoded words that comply with predefined syntactical rules, so as to identify nominal groups; and an output unit connected to said analysis processor for receiving the groups of encoded words recognized as being syntactical patterns. | 4. A system for extracting information from a natural-language text, said system comprising: an input unit for receiving said natural-language text; a lexicon file in which less than 1000 tool words with predefined grammatical functions are recorded, said tool words being essentially constituted by articles, prepositions, conjunctions and verbal auxiliaries; an analysis processor connected to said input unit, and to the lexicon file, and organized to act in a first stage to encode the words of the natural-language text by evaluating the grammatical function of each word by comparing each word with the contents of said lexicon file of tool words, so as to identify the tool words in the text and so as to evaluate the functions of the other words which are not recognized as being tool words, by comparing their locations relative to the locations of the words recognized as being tool words, and, in a second stage, to search subsets of the resulting succession of encoded words to look for groups of encoded words that comply with predefined syntactical rules, so as to identify nominal groups; and an output unit connected to said analysis processor for receiving the groups of encoded words recognized as being syntactical patterns. 11. A system according to claim 4 , wherein the analysis processor further comprises means for regularizing the text received at the input unit so as to remove the amalgams of signs. | 0.619247 |
7,987,172 | 5 | 6 | 5. The method of claim 2 , further comprising, identifying a first average interval between times where the document's content has not changed; identifying a second average interval between times where the document's content has changed; and updating the web crawl interval of the document based on the first average interval and the second average interval. | 5. The method of claim 2 , further comprising, identifying a first average interval between times where the document's content has not changed; identifying a second average interval between times where the document's content has changed; and updating the web crawl interval of the document based on the first average interval and the second average interval. 6. The method of claim 5 , wherein the web crawl interval is not updated if the first average interval is greater than the second average interval. | 0.779279 |
8,037,084 | 13 | 14 | 13. The computing device of claim 12 wherein the one or more schema instructions to locate said some of the subset of data comprise a directional reference to indicate that the position of the some of the subset of data relative to a particular signature comprises one of: 1) before a particular signature; 2) after the particular signature; or 3) both before and after the particular signature. | 13. The computing device of claim 12 wherein the one or more schema instructions to locate said some of the subset of data comprise a directional reference to indicate that the position of the some of the subset of data relative to a particular signature comprises one of: 1) before a particular signature; 2) after the particular signature; or 3) both before and after the particular signature. 14. The computing device of claim 13 wherein the one or more schema instructions to locate said some of the subset of data further comprise: at least one of: i) a start reference; or ii) an end reference, said start reference and end reference respectively indicating a starting location and ending location for the some of the subset of data relative to the signature and in accordance with the direction indicated by the directional reference. | 0.5 |
8,407,169 | 19 | 20 | 19. The system according to claim 15 wherein said system further comprises: a quality attribute type. | 19. The system according to claim 15 wherein said system further comprises: a quality attribute type. 20. The system according to claim 19 wherein said quality attribute type further comprises: an inherent static quality of a class of object. | 0.51049 |
9,558,186 | 13 | 15 | 13. A system for extracting facts comprising: one or more processors; and memory storing one or more programs to be executed by the one or more processors; the one or more programs comprising instructions for: identifying a first fact having an attribute and a value obtained from a first document; retrieving a second document that contains the attribute and the value of the first fact; identifying in the second document a contextual pattern associated with the attribute and value of the first fact; extracting a second fact from the second document using the contextual pattern, the second fact having an attribute that is different than the attribute of the first fact and having a value that is different than the value of the first fact, and storing the first fact and the second fact in a fact repository. | 13. A system for extracting facts comprising: one or more processors; and memory storing one or more programs to be executed by the one or more processors; the one or more programs comprising instructions for: identifying a first fact having an attribute and a value obtained from a first document; retrieving a second document that contains the attribute and the value of the first fact; identifying in the second document a contextual pattern associated with the attribute and value of the first fact; extracting a second fact from the second document using the contextual pattern, the second fact having an attribute that is different than the attribute of the first fact and having a value that is different than the value of the first fact, and storing the first fact and the second fact in a fact repository. 15. The system of claim 13 , further comprising: instructions for associating the first fact with a first object. | 0.599291 |
9,998,484 | 1 | 12 | 1. A method comprising: obtaining at least a first software module not classified as benign or potentially malicious; extracting a set of features associated with the first software module, the set of features comprising one or more static features, one or more behavior features and one or more context features; computing distance metrics between the extracted feature set of the first software module and feature sets of a plurality of clusters, the plurality of clusters comprising: one or more clusters of software modules previously classified as benign and exhibiting a first threshold level of similarity relative to one another; and one or more clusters of software modules previously classified as potentially malicious and exhibiting a second threshold level of similarity relative to one another; classifying the first software module as belonging to a given one of the plurality of clusters based at least in part on the computed distance metrics; and modifying access by a given client device to the first software module responsive to the given cluster being one of the one or more clusters of software modules previously classified as potentially malicious; wherein the method is performed by at least one processing device comprising a processor coupled to a memory; and wherein extracting the set of features associated with the first software module comprises: extracting the one or more static features from the first software module; and obtaining the one or more behavior features and the one or more context features of the first software module from at least one of a plurality of client devices on which the first software module is installed. | 1. A method comprising: obtaining at least a first software module not classified as benign or potentially malicious; extracting a set of features associated with the first software module, the set of features comprising one or more static features, one or more behavior features and one or more context features; computing distance metrics between the extracted feature set of the first software module and feature sets of a plurality of clusters, the plurality of clusters comprising: one or more clusters of software modules previously classified as benign and exhibiting a first threshold level of similarity relative to one another; and one or more clusters of software modules previously classified as potentially malicious and exhibiting a second threshold level of similarity relative to one another; classifying the first software module as belonging to a given one of the plurality of clusters based at least in part on the computed distance metrics; and modifying access by a given client device to the first software module responsive to the given cluster being one of the one or more clusters of software modules previously classified as potentially malicious; wherein the method is performed by at least one processing device comprising a processor coupled to a memory; and wherein extracting the set of features associated with the first software module comprises: extracting the one or more static features from the first software module; and obtaining the one or more behavior features and the one or more context features of the first software module from at least one of a plurality of client devices on which the first software module is installed. 12. The method of claim 1 wherein classifying the first software module comprises comparing distance metrics between static features in the extracted feature set of the first software module and corresponding static features of previously classified software modules in the plurality of clusters. | 0.717557 |
9,876,901 | 1 | 4 | 1. A computer-implemented method to evaluate audio quality of a real-time communication system that includes at least two communication devices, comprising: receiving a reference script, the reference script containing linguistic contents in text form of an audio signal sent to at least one of the communication devices, wherein the reference script excludes audio; receiving the audio signal; generating an evaluation transcript in text form by applying speech recognition to the audio signal; comparing the reference script with the evaluation transcript; generating a call quality metric of the real-time communication system based on the comparison; determining a duration of a speaking turn; determining a duration of a listening turn from the audio signal being received by one of the communication devices; and estimating a communication delay of the audio signal based on the duration of the speaking turn and the listening turn. | 1. A computer-implemented method to evaluate audio quality of a real-time communication system that includes at least two communication devices, comprising: receiving a reference script, the reference script containing linguistic contents in text form of an audio signal sent to at least one of the communication devices, wherein the reference script excludes audio; receiving the audio signal; generating an evaluation transcript in text form by applying speech recognition to the audio signal; comparing the reference script with the evaluation transcript; generating a call quality metric of the real-time communication system based on the comparison; determining a duration of a speaking turn; determining a duration of a listening turn from the audio signal being received by one of the communication devices; and estimating a communication delay of the audio signal based on the duration of the speaking turn and the listening turn. 4. The computer-implemented method of claim 1 , said determining a duration of the listening turn including: activating a voice activity detection process based on the duration of the speaking turn; and determining when the received speech in the listening turn ends using the voice activity detection process, wherein determining the duration of the listening turn is based on determining when the listening turn ends. | 0.5 |
8,429,158 | 13 | 18 | 13. A system for searching among multiple documents and searching for subsections within individual documents using a single search interface on an input-constrained user device having a screen and a keypad, the system comprising: computer memory store comprising instructions in computer readable form that when executed cause a computer system to: display, in a first portion of the screen, a user interface text input component operable to receive search query input entered using the keypad; receive search query input entered into the text input component by a user of the device; receive, responsive to the received query input, a set of document index section indicators, wherein each document index section indicator uniquely identifies a specific point within an associated document and is associated with a subsection within said associated document, wherein the subsection associated with the specific point matches at least a portion of the query input, and wherein the set of document index section indicators includes a first document index section indicator associated with a first document and a second document index section indicator associated with a second document, the first document and the second document being different documents; receive, responsive to the received query input, a set of document pointers, where each pointer uniquely identifies a document; display, in a second portion of the screen, said document index section indicators and document pointers; receive browse actions from the user to browse through and to select one of said document index section indicators and document pointers; display, if a document index section indicator is selected, the identified document, beginning at the identified point within said document so that the user is presented with the subsection within said document that is relatively more relevant to the query input without having to first scan through one or more other subsections within said document that are relatively less relevant to the query input, or displaying, if a document pointer is selected, the beginning of the identified document; set, responsive to the document selection, a query context that includes at least one document context associated with the selected document, wherein the document context represents an attribute of the selected document; subsequent to displaying the selected document, receive subsequent search query input entered into the text input component by the user of the device; and display, responsive to the subsequent search query input and the set query context, a set of document index section indicators for the selected document in the second portion of the screen. | 13. A system for searching among multiple documents and searching for subsections within individual documents using a single search interface on an input-constrained user device having a screen and a keypad, the system comprising: computer memory store comprising instructions in computer readable form that when executed cause a computer system to: display, in a first portion of the screen, a user interface text input component operable to receive search query input entered using the keypad; receive search query input entered into the text input component by a user of the device; receive, responsive to the received query input, a set of document index section indicators, wherein each document index section indicator uniquely identifies a specific point within an associated document and is associated with a subsection within said associated document, wherein the subsection associated with the specific point matches at least a portion of the query input, and wherein the set of document index section indicators includes a first document index section indicator associated with a first document and a second document index section indicator associated with a second document, the first document and the second document being different documents; receive, responsive to the received query input, a set of document pointers, where each pointer uniquely identifies a document; display, in a second portion of the screen, said document index section indicators and document pointers; receive browse actions from the user to browse through and to select one of said document index section indicators and document pointers; display, if a document index section indicator is selected, the identified document, beginning at the identified point within said document so that the user is presented with the subsection within said document that is relatively more relevant to the query input without having to first scan through one or more other subsections within said document that are relatively less relevant to the query input, or displaying, if a document pointer is selected, the beginning of the identified document; set, responsive to the document selection, a query context that includes at least one document context associated with the selected document, wherein the document context represents an attribute of the selected document; subsequent to displaying the selected document, receive subsequent search query input entered into the text input component by the user of the device; and display, responsive to the subsequent search query input and the set query context, a set of document index section indicators for the selected document in the second portion of the screen. 18. The system according to claim 13 , wherein the keypad is an overloaded keypad. | 0.877246 |
8,972,253 | 11 | 12 | 11. The method of claim 1 , further comprising: receiving a Gaussian Mixture Model (GMM)-Hidden Markov Model (HMM) system that is trained to undertake automatic speech recognition; and converting the GMM-HMM to the DBN-HMM. | 11. The method of claim 1 , further comprising: receiving a Gaussian Mixture Model (GMM)-Hidden Markov Model (HMM) system that is trained to undertake automatic speech recognition; and converting the GMM-HMM to the DBN-HMM. 12. The method of claim 11 , further comprising: utilizing an unsupervised training algorithm to initialize weights of the connections in the DBN; and utilizing back-propagation to refine the weights of the connections in the DBN. | 0.5 |
7,647,212 | 1 | 2 | 1. A computer-based method for carrying out a negotiation concerning set of actions to execute a print job performed by selected ones of a plurality of participants, wherein at least one of the plurality of participants encapsulates a constraint solver in a service, comprising: defining processing instructions in a memory of the system for carrying out the negotiation using the service encapsulating the constraint solver to facilitate printing via a processor; and executing the processing instructions, via the processor, to carry out the negotiation with the service encapsulating the constraint solver; wherein said executing the processing instructions for carrying out the negotiation with the service encapsulating the constraint solver further comprises: (A) establishing encapsulation input in the memory that includes: (a) a mapping between one or more of a price, a size, and a delivery date of print-job parameters of the service and corresponding variables of the constraint solver, (b) a translation between negotiation statements on the one or more of a price, a size, and a delivery date of the print-job parameters of the service and domain constraints imposed on the corresponding variables of the constraint solver, and (c) a set of semantic constraints of the service on variables of the constraint solver; (B) constructing a graph in the memory for negotiating the set of actions to be performed, wherein each action corresponds to one or more invocation patterns, each node of the graph defining a negotiation context that has associated therewith a constraint store with at least a set of domain constraints stored therein; (C) propagating constraints defined by the set of semantic constraints and the set of domain constraints associated with nodes of the graph to other participants in the negotiation as domain constraints augment the set of semantic constraints during the negotiation utilizing a protocol defined by one or more primitives that are instantiated by the one or more invocation patterns; and (D) executing one or more actions based at least in part upon the interdependencies between the one or more invocation patterns, the one or more actions facilitate printing of at least one print job, each print job creates at least one hard copy document based at least in part upon the processing instructions. | 1. A computer-based method for carrying out a negotiation concerning set of actions to execute a print job performed by selected ones of a plurality of participants, wherein at least one of the plurality of participants encapsulates a constraint solver in a service, comprising: defining processing instructions in a memory of the system for carrying out the negotiation using the service encapsulating the constraint solver to facilitate printing via a processor; and executing the processing instructions, via the processor, to carry out the negotiation with the service encapsulating the constraint solver; wherein said executing the processing instructions for carrying out the negotiation with the service encapsulating the constraint solver further comprises: (A) establishing encapsulation input in the memory that includes: (a) a mapping between one or more of a price, a size, and a delivery date of print-job parameters of the service and corresponding variables of the constraint solver, (b) a translation between negotiation statements on the one or more of a price, a size, and a delivery date of the print-job parameters of the service and domain constraints imposed on the corresponding variables of the constraint solver, and (c) a set of semantic constraints of the service on variables of the constraint solver; (B) constructing a graph in the memory for negotiating the set of actions to be performed, wherein each action corresponds to one or more invocation patterns, each node of the graph defining a negotiation context that has associated therewith a constraint store with at least a set of domain constraints stored therein; (C) propagating constraints defined by the set of semantic constraints and the set of domain constraints associated with nodes of the graph to other participants in the negotiation as domain constraints augment the set of semantic constraints during the negotiation utilizing a protocol defined by one or more primitives that are instantiated by the one or more invocation patterns; and (D) executing one or more actions based at least in part upon the interdependencies between the one or more invocation patterns, the one or more actions facilitate printing of at least one print job, each print job creates at least one hard copy document based at least in part upon the processing instructions. 2. The method according to claim 1 , wherein the processing instructions are stored in memory of the system and are executed by one or more processors of the system. | 0.638158 |
9,195,705 | 4 | 5 | 4. The computer-implemented method of claim 1 , wherein the incremental feature store is a first incremental feature store, further comprising: maintaining, by the online system, a second incremental feature store; marking the first incremental feature store as inactive at a subsequent time point; and updating features of the second incremental feature store responsive to user actions received by the online system after the subsequent time point. | 4. The computer-implemented method of claim 1 , wherein the incremental feature store is a first incremental feature store, further comprising: maintaining, by the online system, a second incremental feature store; marking the first incremental feature store as inactive at a subsequent time point; and updating features of the second incremental feature store responsive to user actions received by the online system after the subsequent time point. 5. The computer-implemented method of claim 4 , further comprising: calculating, by the computer processor, a weighted combination of feature values from the first incremental feature store, from the second incremental feature store, and from the cumulative feature store. | 0.5 |
8,171,393 | 1 | 10 | 1. A method for producing and organizing electronically stored information, the method comprising: identifying, with one or more processors associated with one or more computer systems, a plurality of documents from the electronically stored information as satisfying similarity criteria; identifying, with the one or more processors associated with one or more computer systems, a first document in the plurality of documents as a pivot document for the plurality of documents that satisfy the similarity criteria, the pivot document being representative of the plurality of documents that satisfy the similarity criteria; generating, with the one or more processors associated with one or more computer systems, information configured to display a graphical user interface that enables users of the graphical user interface to associate review content with each pivot document in a collection of pivot documents visually represented in the graphical user interface; receiving, at the one or more computer systems, the review content that is indicative of textual information or one or more annotations provided by a user of the graphical user interface; associating, with the one or more processors associated with one or more computer systems, the review content indicative of the textual information or the one or more annotations with the pivot document; and propagating, with the one or more processors associated with one or more computer systems, the review content indicative of the textual information or the one or more annotations from the pivot document to one or more documents in the plurality of documents that satisfy the similarity criteria. | 1. A method for producing and organizing electronically stored information, the method comprising: identifying, with one or more processors associated with one or more computer systems, a plurality of documents from the electronically stored information as satisfying similarity criteria; identifying, with the one or more processors associated with one or more computer systems, a first document in the plurality of documents as a pivot document for the plurality of documents that satisfy the similarity criteria, the pivot document being representative of the plurality of documents that satisfy the similarity criteria; generating, with the one or more processors associated with one or more computer systems, information configured to display a graphical user interface that enables users of the graphical user interface to associate review content with each pivot document in a collection of pivot documents visually represented in the graphical user interface; receiving, at the one or more computer systems, the review content that is indicative of textual information or one or more annotations provided by a user of the graphical user interface; associating, with the one or more processors associated with one or more computer systems, the review content indicative of the textual information or the one or more annotations with the pivot document; and propagating, with the one or more processors associated with one or more computer systems, the review content indicative of the textual information or the one or more annotations from the pivot document to one or more documents in the plurality of documents that satisfy the similarity criteria. 10. The method of claim 1 further comprising organizing the plurality of documents in accordance with the review content, wherein the plurality of documents is adapted to be searched in accordance to the review content. | 0.763499 |
8,913,187 | 1 | 3 | 1. A system to detect garbled closed captioning data, comprising: a closed captioning data detector to detect closed captioning data in a video data stream; a word extractor/counter to extract individual words from the closed captioning data, to store a count of the total number of words in the closed captioning data in a memory, and to store a count of the total number of words having a desired word length or range of word lengths in the closed captioning data in the memory; a percentage threshold detector to determine a percentage of words having the desired length or range of lengths in the closed captioning data as a ratio of the count of the number of words in the closed captioning data having the desired length or range of lengths to the count of the total number of words in the closed captioning data; and an alert that is provided when the determined percentage exceeds a predetermined threshold. | 1. A system to detect garbled closed captioning data, comprising: a closed captioning data detector to detect closed captioning data in a video data stream; a word extractor/counter to extract individual words from the closed captioning data, to store a count of the total number of words in the closed captioning data in a memory, and to store a count of the total number of words having a desired word length or range of word lengths in the closed captioning data in the memory; a percentage threshold detector to determine a percentage of words having the desired length or range of lengths in the closed captioning data as a ratio of the count of the number of words in the closed captioning data having the desired length or range of lengths to the count of the total number of words in the closed captioning data; and an alert that is provided when the determined percentage exceeds a predetermined threshold. 3. The system recited in claim 1 , further comprising at least one encoder to encode decoded data received from at least one data source and a multiplexer to multiplex the encoded data into a transport stream to be processed by the word extractor/counter. | 0.5 |
7,711,738 | 29 | 33 | 29. A program storage device readable by a machine tangibly embodying a program of instructions executable by the machine to perform a method for accessing electronic records obtained from at least one electronic records database search, the method enabling users to select for retrieval at least one raw data set related to the electronic records, the device comprising: selecting one of a plurality of user input, stored electronic records search requests from a queued search database to execute next based upon one or more selection criteria; executing the selected electronic records search request and retrieving at least one electronic record from at least one storage location during the executing; determining which of two or more different types of communication medium can be used to access at least one of a plurality of electronic records databases associated with the selected one of the electronic records search request; retrieving instructions for accessing the at least one of a plurality of electronic records databases based on at least one of the determined types of communication medium which can be used to access the at least one of the plurality of electronic records databases; accessing the at least one of the plurality of electronic records databases with the retrieved instructions; retrieving at least one electronic record from at least one storage location, wherein the at least one electronic record comprises results of an executed electronic records search request, at least one criterion used in formulating the electronic records search request and data related to at least one electronic database associated with the electronic records search request; parsing the electronic records to convert one or more raw data sets into user-selectable objects; determining at least one data parsing algorithm that should be used for parsing the at least one retrieved electronic record based upon a content of the at least one retrieved electronic record; executing the parsing using the at least one determined data parsing algorithm; and causing the user-selectable objects to be displayed. | 29. A program storage device readable by a machine tangibly embodying a program of instructions executable by the machine to perform a method for accessing electronic records obtained from at least one electronic records database search, the method enabling users to select for retrieval at least one raw data set related to the electronic records, the device comprising: selecting one of a plurality of user input, stored electronic records search requests from a queued search database to execute next based upon one or more selection criteria; executing the selected electronic records search request and retrieving at least one electronic record from at least one storage location during the executing; determining which of two or more different types of communication medium can be used to access at least one of a plurality of electronic records databases associated with the selected one of the electronic records search request; retrieving instructions for accessing the at least one of a plurality of electronic records databases based on at least one of the determined types of communication medium which can be used to access the at least one of the plurality of electronic records databases; accessing the at least one of the plurality of electronic records databases with the retrieved instructions; retrieving at least one electronic record from at least one storage location, wherein the at least one electronic record comprises results of an executed electronic records search request, at least one criterion used in formulating the electronic records search request and data related to at least one electronic database associated with the electronic records search request; parsing the electronic records to convert one or more raw data sets into user-selectable objects; determining at least one data parsing algorithm that should be used for parsing the at least one retrieved electronic record based upon a content of the at least one retrieved electronic record; executing the parsing using the at least one determined data parsing algorithm; and causing the user-selectable objects to be displayed. 33. The device of claim 29 wherein the parsing further comprises extracting the at least one raw data set from the retrieved electronic records. | 0.795455 |
7,965,923 | 13 | 16 | 13. The method of claim 1 comprising selecting one or more captions and subtitles from the one or more segments. | 13. The method of claim 1 comprising selecting one or more captions and subtitles from the one or more segments. 16. The method of claim 13 comprising: querying an index maintaining one or more index entries identifying terms and phrases associated with the selected captions and subtitles from the one or more segments; retrieving the one or more terms and phrases associated with the selected captions and subtitles; and generating one or more descriptions of the video and audio content corresponding to the selected captions and subtitles using the one or more retrieved terms and phrases. | 0.5 |
9,196,248 | 21 | 22 | 21. The computer program product of claim 15 , wherein the processor readable medium further comprises processor executable program code to determine a speech recognition confidence level associated with the voice-based query. | 21. The computer program product of claim 15 , wherein the processor readable medium further comprises processor executable program code to determine a speech recognition confidence level associated with the voice-based query. 22. The computer program product of claim 21 , wherein the processor executable program code to provide the at least one response to the user comprises processor executable program code to provide the at least one response to the user in the form of voice-based assistance in accordance with both the speech recognition confidence level and the emotional state of the user. | 0.5 |
9,710,239 | 14 | 15 | 14. The non-transitory computer readable medium of claim 13 , further having stored thereon at least one additional instruction comprising executable code which when executed by the processor, causes the processor to perform at least one additional step comprising prompting a user to input a required outcome and a decision factor via a provided user interface, wherein the decision factor comprises a combination of input and desired output factors and requirement-to-requirement modeling, requirement-to-tasks modeling, requirement-to-test cases modeling, test cases-to-test cases modeling, or requirement-to-end-to-end solution modeling. | 14. The non-transitory computer readable medium of claim 13 , further having stored thereon at least one additional instruction comprising executable code which when executed by the processor, causes the processor to perform at least one additional step comprising prompting a user to input a required outcome and a decision factor via a provided user interface, wherein the decision factor comprises a combination of input and desired output factors and requirement-to-requirement modeling, requirement-to-tasks modeling, requirement-to-test cases modeling, test cases-to-test cases modeling, or requirement-to-end-to-end solution modeling. 15. The non-transitory computer readable medium of claim 14 , wherein the obtaining further comprises populating one or more keywords for selection based on the required outcome and the decision factor. | 0.5 |
9,239,824 | 74 | 75 | 74. The apparatus of claim 73 , wherein the processor is further configured to collect an automated data log of input in real-time, including being configured to store a record of at least each spelled letter. | 74. The apparatus of claim 73 , wherein the processor is further configured to collect an automated data log of input in real-time, including being configured to store a record of at least each spelled letter. 75. The apparatus of claim 74 , wherein the collecting is done by the processor using a Language Activity Monitor (LAM). | 0.5 |
8,868,637 | 15 | 17 | 15. One or more computer-readable non-transitory storage media embodying software that is operable when executed to: by a code segment executing on a client computing device and embedded in a first structured document rendered by the client computing device, detect an event on the first structured document, the event directing the client application to generate a first request for a second structured document from a remote server; by the code segment, intercept the first request; by the code segment, identify one or more resources specified in the first request that are not currently stored on the client computing device; by the code segment, generate a second request for resources to be sent to the remote server, wherein the second request specifies only one or more of the resources specified in the first request that are not currently stored on the client computing device; send the second request to the remote server; receive, in response to the second request, one or more of the resources specified in the second request; and render the second structured document with: one or more of the resources specified in the first request that are currently stored on the client computing device; and one or more of the resources received in response to the second request. | 15. One or more computer-readable non-transitory storage media embodying software that is operable when executed to: by a code segment executing on a client computing device and embedded in a first structured document rendered by the client computing device, detect an event on the first structured document, the event directing the client application to generate a first request for a second structured document from a remote server; by the code segment, intercept the first request; by the code segment, identify one or more resources specified in the first request that are not currently stored on the client computing device; by the code segment, generate a second request for resources to be sent to the remote server, wherein the second request specifies only one or more of the resources specified in the first request that are not currently stored on the client computing device; send the second request to the remote server; receive, in response to the second request, one or more of the resources specified in the second request; and render the second structured document with: one or more of the resources specified in the first request that are currently stored on the client computing device; and one or more of the resources received in response to the second request. 17. The media of claim 15 , wherein the software is further operable when executed to extract a Uniform Resource Locator (URL) for the second structured document. | 0.821978 |
8,503,624 | 1 | 5 | 1. A method of processing an incoming voice message, the method comprising: at a recipient system, receiving an incoming voice message from a message communicator; using a processor to automatically analyze message content of the incoming voice message to identity at least one keyword included in the message content, the message content analysis being performed while a caller is connected with the message communicator; identifying a predefined action associated with the at least one keyword, the predefined action including associating a priority with the incoming voice message; and performing the predefined action when the at least one keyword is identified in the message content, the predefined action including a search action wherein the message content includes a spoken search term used to obtain an equivalent textual search term which is used to search a database of stored incoming voice messages for the textual equivalent search term to identify any stored incoming voice messages including the spoken search term. | 1. A method of processing an incoming voice message, the method comprising: at a recipient system, receiving an incoming voice message from a message communicator; using a processor to automatically analyze message content of the incoming voice message to identity at least one keyword included in the message content, the message content analysis being performed while a caller is connected with the message communicator; identifying a predefined action associated with the at least one keyword, the predefined action including associating a priority with the incoming voice message; and performing the predefined action when the at least one keyword is identified in the message content, the predefined action including a search action wherein the message content includes a spoken search term used to obtain an equivalent textual search term which is used to search a database of stored incoming voice messages for the textual equivalent search term to identify any stored incoming voice messages including the spoken search term. 5. The method of claim 1 , wherein identifying the predefined action comprises investigating a keyword database including a plurality of keywords and at least one predefined action associated with each keyword. | 0.725849 |
8,122,047 | 12 | 13 | 12. A computer implemented method as in claim 1 wherein the query includes the keywords to be expanded, where the keywords to be expanded describe targeting criteria for an advertisement. | 12. A computer implemented method as in claim 1 wherein the query includes the keywords to be expanded, where the keywords to be expanded describe targeting criteria for an advertisement. 13. A computer implemented method as in claim 12 wherein the advertisement is delivered in response to a user having one or more keywords in their profile that are the same as the keywords associated with the advertisement. | 0.5 |
8,190,550 | 1 | 15 | 1. A method comprising: partitioning a region of interest into a plurality of soft bin regions that span the region of interest; estimating an integral over each soft bin region of a function defined over the region of interest; and outputting a value equal to or derived from the sum of the estimated integrals over the soft bin regions spanning the region of interest. | 1. A method comprising: partitioning a region of interest into a plurality of soft bin regions that span the region of interest; estimating an integral over each soft bin region of a function defined over the region of interest; and outputting a value equal to or derived from the sum of the estimated integrals over the soft bin regions spanning the region of interest. 15. A storage medium storing instructions executable by a computer to perform a method as set forth in claim 1 . | 0.914894 |
9,208,472 | 1 | 10 | 1. In a computing environment, a system, comprising: an authoring tool, implemented on at least one processor, configured to allow one or more authors from among crowd contributors to author a model containing one or more of the following: rules, constraints, and equations, the model configured to: generate a plan comprising plan objects; and obtain the plan objects for the plan based on one or more of the following: the rules, the constraints, and the equations; and a presentation mechanism configured to produce an interactive presentation of the plan to a first user based upon the plan objects generated by the model; an interaction mechanism configured to allow one or more changes to the plan objects during the interactive presentation of the plan, wherein interaction with one or more of the plan objects during the interactive presentation prompts the authoring tool to generate a new model; and a search mechanism configured to locate the new model for a second user; wherein the authoring tool is further configured to generate a second plan from the new model based upon the new model and input from the second user; and wherein the presentation mechanism is further configured to produce a second interactive presentation from the second plan for presenting to the second user. | 1. In a computing environment, a system, comprising: an authoring tool, implemented on at least one processor, configured to allow one or more authors from among crowd contributors to author a model containing one or more of the following: rules, constraints, and equations, the model configured to: generate a plan comprising plan objects; and obtain the plan objects for the plan based on one or more of the following: the rules, the constraints, and the equations; and a presentation mechanism configured to produce an interactive presentation of the plan to a first user based upon the plan objects generated by the model; an interaction mechanism configured to allow one or more changes to the plan objects during the interactive presentation of the plan, wherein interaction with one or more of the plan objects during the interactive presentation prompts the authoring tool to generate a new model; and a search mechanism configured to locate the new model for a second user; wherein the authoring tool is further configured to generate a second plan from the new model based upon the new model and input from the second user; and wherein the presentation mechanism is further configured to produce a second interactive presentation from the second plan for presenting to the second user. 10. The system of claim 1 wherein the model is selected by the first user and consumed by the first user by receiving user input data corresponding to one or more input parameters of the model to generate a plan for the first user, and wherein the interaction mechanism is configured to allow one or more changes to the user input data by which the model generates the second plan comprising a different set of plan objects, the presentation mechanism configured to generate the second interactive presentation based on the different set of plan objects. | 0.594436 |
7,870,206 | 7 | 9 | 7. A computer program product for making non-shared linked documents in email messages accessible to recipients, comprising a computer readable storage medium storing computer program code, wherein the computer program code when executed on a computer, causes the computer to: upon initiation of sending of an email message by a user, automatically parse through the MIME to detect URL tags indicating that a linked document is contained within the email message, upon detection of a URL tag, check a prefix of the URL tag to determine if the linked document is accessible to a recipient, if the prefix indicates that the linked document is not accessible to the recipient, provide for selection of at least sending the linked document as an in-line document by converting the document into HTML format and embedding it into a multi part MIME message; and if the sender is sending the email message with a linked Notes email and upon determining that the recipient of the email was originally a recipient of the Notes email, converting a Notes Universal ID of the linked Notes email to a MIME id of the Notes email, wherein the MIME id of the linked Notes email provides the recipient with access to the linked Notes email message. | 7. A computer program product for making non-shared linked documents in email messages accessible to recipients, comprising a computer readable storage medium storing computer program code, wherein the computer program code when executed on a computer, causes the computer to: upon initiation of sending of an email message by a user, automatically parse through the MIME to detect URL tags indicating that a linked document is contained within the email message, upon detection of a URL tag, check a prefix of the URL tag to determine if the linked document is accessible to a recipient, if the prefix indicates that the linked document is not accessible to the recipient, provide for selection of at least sending the linked document as an in-line document by converting the document into HTML format and embedding it into a multi part MIME message; and if the sender is sending the email message with a linked Notes email and upon determining that the recipient of the email was originally a recipient of the Notes email, converting a Notes Universal ID of the linked Notes email to a MIME id of the Notes email, wherein the MIME id of the linked Notes email provides the recipient with access to the linked Notes email message. 9. The computer program product of claim 7 , wherein the computer readable medium further causes the computer to provide for selection of an option of not sending the message. | 0.719551 |
7,668,858 | 11 | 12 | 11. The computer program product as recited in claim 10 , wherein the at least one attribute of the set of attributes is a subsystem attribute. | 11. The computer program product as recited in claim 10 , wherein the at least one attribute of the set of attributes is a subsystem attribute. 12. The computer program product as recited in claim 11 , further comprising instructions for defining a search scope for assembling the set of system objects. | 0.548295 |
8,918,408 | 13 | 14 | 13. A computing machine comprising: a memory for receiving an input string through an input device; a predictive input engine having an input for receiving the input string and an input for receiving an input history, and an output providing a list of candidate strings from the input history that match the input string, wherein the predictive input engine selects matching strings by both recency and frequency, and sorts the selected matching strings by recency and selects dissimilar strings to present at the top of the sorted list of candidate strings; and a selector allowing the user to select a string from the list of candidate strings to provide as an input to an application. | 13. A computing machine comprising: a memory for receiving an input string through an input device; a predictive input engine having an input for receiving the input string and an input for receiving an input history, and an output providing a list of candidate strings from the input history that match the input string, wherein the predictive input engine selects matching strings by both recency and frequency, and sorts the selected matching strings by recency and selects dissimilar strings to present at the top of the sorted list of candidate strings; and a selector allowing the user to select a string from the list of candidate strings to provide as an input to an application. 14. The computing machine of claim 13 , wherein the selector has an input for receiving an indication of a selection from the final list of candidate strings. | 0.822072 |
9,244,904 | 3 | 4 | 3. The method according to claim 1 , further comprising: updating said data of occurrence according to said files. | 3. The method according to claim 1 , further comprising: updating said data of occurrence according to said files. 4. The method according to claim 3 , wherein updating said data of occurrence is performed upon modification of said files. | 0.5 |
9,613,161 | 6 | 7 | 6. The system of claim 4 , wherein the threshold is based on a determination that a first refinement option of the one or more refinement options has scrolled off of the display device. | 6. The system of claim 4 , wherein the threshold is based on a determination that a first refinement option of the one or more refinement options has scrolled off of the display device. 7. The system of claim 6 , wherein the refinement data is a refinement option and the non-scrollable element is operable to select the refinement option. | 0.5 |
10,055,501 | 13 | 14 | 13. The method of claim 12 , wherein the positive client-based feedback strengthens a concept-oriented node stored in the knowledge base that generated the suggested response. | 13. The method of claim 12 , wherein the positive client-based feedback strengthens a concept-oriented node stored in the knowledge base that generated the suggested response. 14. The method of claim 13 , wherein the concept-oriented node is strengthened by redistributing weights assigned to concepts associated with the concept-oriented node. | 0.5 |
9,977,584 | 15 | 16 | 15. A non-transitory computer-readable storage medium including instructions that, when executed by at least one processor of a computing system, cause the computing system to: display a first plurality of segments associated with a media content item, each of the segments having a successive respective start time and end time bounded by a start time and an end time associated with the media content item; receive an instruction to navigate through the first plurality of segments; display a second plurality of segments associated with the media content item, each of the segments having a successive respective start time and end time bounded by the start time and the end time associated with the media content item, wherein at least one of the segments in the second plurality of segments is different from one of the first plurality of segments; receive an indication of a selected segment from the second plurality of segments; and play a portion of the media content item corresponding to the selected segment. | 15. A non-transitory computer-readable storage medium including instructions that, when executed by at least one processor of a computing system, cause the computing system to: display a first plurality of segments associated with a media content item, each of the segments having a successive respective start time and end time bounded by a start time and an end time associated with the media content item; receive an instruction to navigate through the first plurality of segments; display a second plurality of segments associated with the media content item, each of the segments having a successive respective start time and end time bounded by the start time and the end time associated with the media content item, wherein at least one of the segments in the second plurality of segments is different from one of the first plurality of segments; receive an indication of a selected segment from the second plurality of segments; and play a portion of the media content item corresponding to the selected segment. 16. The non-transitory computer-readable storage medium of claim 15 wherein the media content item comprises a song including music and lyrics. | 0.757627 |
9,372,930 | 17 | 18 | 17. A non-transitory machine-readable storage medium comprising instructions that, when executed by processors of a machine, cause the machine to perform operations comprising: by an access module that comprises one or more of the processors of the machine, accessing person profiles that each describe a different person but reference a common entity, a portion of the accessed person profiles each including a common token that describes a corresponding different person, the entity having an entity profile that lacks the common token; by a determination module that comprises one or more of the processors of the machine, generating a first probability that the common token occurs within the accessed person profiles; by the determination module that comprises one or more of the processors of the machine, accessing a second probability that the common token occurs within a superset of person profiles that includes the accessed person profiles; by the determination module that comprises one or more of the processors of the machine, determining that the common token is descriptive of the entity based on a statistical divergence between the first and second probabilities, the statistical divergence indicating that the common token is overrepresented among other tokens shared in common by the accessed person profiles; and by a generation module that comprises one or more of the processors of the machine, generating a supplemental profile for the entity, the supplemental profile including the overrepresented common token determined to be descriptive of the entity based on the statistical divergence between the first and second probabilities. | 17. A non-transitory machine-readable storage medium comprising instructions that, when executed by processors of a machine, cause the machine to perform operations comprising: by an access module that comprises one or more of the processors of the machine, accessing person profiles that each describe a different person but reference a common entity, a portion of the accessed person profiles each including a common token that describes a corresponding different person, the entity having an entity profile that lacks the common token; by a determination module that comprises one or more of the processors of the machine, generating a first probability that the common token occurs within the accessed person profiles; by the determination module that comprises one or more of the processors of the machine, accessing a second probability that the common token occurs within a superset of person profiles that includes the accessed person profiles; by the determination module that comprises one or more of the processors of the machine, determining that the common token is descriptive of the entity based on a statistical divergence between the first and second probabilities, the statistical divergence indicating that the common token is overrepresented among other tokens shared in common by the accessed person profiles; and by a generation module that comprises one or more of the processors of the machine, generating a supplemental profile for the entity, the supplemental profile including the overrepresented common token determined to be descriptive of the entity based on the statistical divergence between the first and second probabilities. 18. The non-transitory machine-readable storage medium of claim 17 , wherein the operations further comprise: receiving indications that each different person described by the accessed person profiles has decided to be associated with the entity; and modifying the accessed person profiles to each describe each different person as being voluntarily associated with the entity. | 0.5 |
9,530,100 | 1 | 11 | 1. A computer-based medical reasoning engine comprising: a medical data interface configured to acquire medical data associated with treatment of a patient; and at least one medical inference server coupled with the medical data interface and configured to: obtain the medical data via the medical data interface; recognize, from the medical data, a treatment protocol and result related to the treatment of the patient, the treatment protocol and result each comprising object attributes; select a reasoning rules set from available reasoning rules sets as a function of the medical data and object attributes of the treatment protocol and results; establish at least one outcome hypothesis according to the selected reasoning rules set as a function of patient data, the at least one outcome hypothesis representing that the treatment protocol and result have a suspected correlation with respect to the patient; and configure an output device to present the at least one outcome hypothesis along with reasoning supporting the at least one outcome hypothesis. | 1. A computer-based medical reasoning engine comprising: a medical data interface configured to acquire medical data associated with treatment of a patient; and at least one medical inference server coupled with the medical data interface and configured to: obtain the medical data via the medical data interface; recognize, from the medical data, a treatment protocol and result related to the treatment of the patient, the treatment protocol and result each comprising object attributes; select a reasoning rules set from available reasoning rules sets as a function of the medical data and object attributes of the treatment protocol and results; establish at least one outcome hypothesis according to the selected reasoning rules set as a function of patient data, the at least one outcome hypothesis representing that the treatment protocol and result have a suspected correlation with respect to the patient; and configure an output device to present the at least one outcome hypothesis along with reasoning supporting the at least one outcome hypothesis. 11. The engine of claim 1 , wherein the object attributes adhere to a normalized namespace. | 0.835145 |
8,270,592 | 1 | 20 | 1. A computer-implemented method for distributing a customer initiated call to one or more agents associated with a call center, comprising: receiving the customer call, wherein the call center is arranged to process the customer call on behalf of a client; detecting a language of the caller associated with the received call by an Interactive Voice Recognition (IVR) subsystem; determining customer information from a call origination identifier comprising an Automated Number Identification (ANI) number; modifying the ANI number such that information associated with the client is overloaded to the ANI number; forwarding the call to a call management center, wherein the forwarded call includes the ANI number and a call destination identifier comprising a Dialed Number Identification Service (DNIS) number; determining the language of the caller from the DNIS number at the call management center; assigning an agent to the received call based on the ANI number and the language of the caller; and forwarding the call to the assigned agent. | 1. A computer-implemented method for distributing a customer initiated call to one or more agents associated with a call center, comprising: receiving the customer call, wherein the call center is arranged to process the customer call on behalf of a client; detecting a language of the caller associated with the received call by an Interactive Voice Recognition (IVR) subsystem; determining customer information from a call origination identifier comprising an Automated Number Identification (ANI) number; modifying the ANI number such that information associated with the client is overloaded to the ANI number; forwarding the call to a call management center, wherein the forwarded call includes the ANI number and a call destination identifier comprising a Dialed Number Identification Service (DNIS) number; determining the language of the caller from the DNIS number at the call management center; assigning an agent to the received call based on the ANI number and the language of the caller; and forwarding the call to the assigned agent. 20. The computer-implemented method as defined in claim 1 , further comprising: detecting an accent of the customer by the IVR subsystem. | 0.798529 |
9,043,306 | 14 | 17 | 14. A method performed by a search engine service, the method comprising: receiving, at a search engine server from an end user computing device, a plurality of content signatures signature of a web page, the plurality of content signatures signature having been automatically generated at the end user computing device from content of the web page downloaded and displayed by the end user computing device, the web page having been downloaded by the end user user's computing device from one or more content servers separate from the search engine server when an end user employed the end user computing device to access the web page during a web browsing session, each content signature corresponding with a different portion of the content of the web page, each portion comprising one of text, images, video, and audio; analyzing, at the search engine server, the plurality of content signatures signature to identify a portion of the content that has changed on the change in the content of the web page by determining a difference between at least one of the plurality of content signatures and a content signature accessible by the search engine server the content signature and a second content signature of the web page accessible by the search engine server; and controlling crawling of the web page by the search engine server based on the portion of the content that has changed on the web page identifying the change in the content of the web page. | 14. A method performed by a search engine service, the method comprising: receiving, at a search engine server from an end user computing device, a plurality of content signatures signature of a web page, the plurality of content signatures signature having been automatically generated at the end user computing device from content of the web page downloaded and displayed by the end user computing device, the web page having been downloaded by the end user user's computing device from one or more content servers separate from the search engine server when an end user employed the end user computing device to access the web page during a web browsing session, each content signature corresponding with a different portion of the content of the web page, each portion comprising one of text, images, video, and audio; analyzing, at the search engine server, the plurality of content signatures signature to identify a portion of the content that has changed on the change in the content of the web page by determining a difference between at least one of the plurality of content signatures and a content signature accessible by the search engine server the content signature and a second content signature of the web page accessible by the search engine server; and controlling crawling of the web page by the search engine server based on the portion of the content that has changed on the web page identifying the change in the content of the web page. 17. The method of claim 14 , wherein analyzing the plurality of content signatures comprises determining an extent to which the content of the web page has pages have changed. | 0.77154 |
8,239,206 | 21 | 23 | 21. A computer-implemented method, comprising: receiving, by a computing device, an orally-provided voice query and generating data that represents content of the voice query; providing the data by the computing device to a server system; receiving, by the computing device and from the server system, a textual query that has been determined by a speech recognizer at the server system to be a textual form of at least part of the data; determining that the textual query includes a carrier phrase of one or more words that is reserved by a first third-party application program installed on the computing device; selecting the first third-party application, from a group of one or more third-party applications, to receive all or a part of the textual query; and providing, by the computing device, all or a part of the textual query to the selected first application program. | 21. A computer-implemented method, comprising: receiving, by a computing device, an orally-provided voice query and generating data that represents content of the voice query; providing the data by the computing device to a server system; receiving, by the computing device and from the server system, a textual query that has been determined by a speech recognizer at the server system to be a textual form of at least part of the data; determining that the textual query includes a carrier phrase of one or more words that is reserved by a first third-party application program installed on the computing device; selecting the first third-party application, from a group of one or more third-party applications, to receive all or a part of the textual query; and providing, by the computing device, all or a part of the textual query to the selected first application program. 23. The computer-implemented method of claim 21 , wherein the data represents an audio recording of the orally-provided voice query, and wherein the orally-provided voice query was received by the computing device in response to a user selection of a button that is provided by the computing device for submitting voice queries. | 0.615023 |
9,774,641 | 1 | 13 | 1. A method comprising: maintaining a profile for the user at a social networking system including a processor, the profile including one or more information items associated with data describing characteristics of the user; identifying one or more information items that have not been updated within a threshold amount of time from a current time from the maintained profile; obtaining a plurality of questions associated with the one or more identified information items at the social networking system; determining, for each of the plurality of questions associated with the one or more identified information items, a response probability based at least in part on one or a combination of a format and a content of the question, the response probability indicating a likelihood of the social networking system receiving a response to the question when presented; determining a data acquisition value for each of the one or more identified information items, the data acquisition value of an identified information item based at least in part on a value to the social networking system of data associated with the identified information item and the determined response probability; selecting a particular identified information item from the one or more identified information items by the social networking system based at least in part on the data acquisition values; and selecting, by the social networking system, a question associated with the particular identified information item for presentation to the user based at least in part on the response probabilities of one or more questions associated with the particular identified information item. | 1. A method comprising: maintaining a profile for the user at a social networking system including a processor, the profile including one or more information items associated with data describing characteristics of the user; identifying one or more information items that have not been updated within a threshold amount of time from a current time from the maintained profile; obtaining a plurality of questions associated with the one or more identified information items at the social networking system; determining, for each of the plurality of questions associated with the one or more identified information items, a response probability based at least in part on one or a combination of a format and a content of the question, the response probability indicating a likelihood of the social networking system receiving a response to the question when presented; determining a data acquisition value for each of the one or more identified information items, the data acquisition value of an identified information item based at least in part on a value to the social networking system of data associated with the identified information item and the determined response probability; selecting a particular identified information item from the one or more identified information items by the social networking system based at least in part on the data acquisition values; and selecting, by the social networking system, a question associated with the particular identified information item for presentation to the user based at least in part on the response probabilities of one or more questions associated with the particular identified information item. 13. The method of claim 1 , wherein the value to the social networking system of associating data with the particular identified information item is based at least in part on user engagement with the social networking system based on content selected using the data associated with the particular identified information item. | 0.833675 |
9,576,582 | 1 | 5 | 1. A method comprising: obtaining, by a system comprising a processor, information associated with an acoustic model, wherein the acoustic model is trained on native speech in a target dialect; and updating, by the system, the information associated with the acoustic model to replace a first phoneme in the acoustic model with a second phoneme, wherein the second phoneme comprises a sum of values associated with plausible phonemes in a lattice of plausible phonemes associated with a type of speaker. | 1. A method comprising: obtaining, by a system comprising a processor, information associated with an acoustic model, wherein the acoustic model is trained on native speech in a target dialect; and updating, by the system, the information associated with the acoustic model to replace a first phoneme in the acoustic model with a second phoneme, wherein the second phoneme comprises a sum of values associated with plausible phonemes in a lattice of plausible phonemes associated with a type of speaker. 5. The method of claim 1 , wherein the updating the information associated with the acoustic model is based on evaluating an objective function. | 0.71875 |
8,651,873 | 8 | 11 | 8. The method of claim 1 , wherein each evidence model used for generating an assessment corresponds to a task model. | 8. The method of claim 1 , wherein each evidence model used for generating an assessment corresponds to a task model. 11. The method of claim 8 wherein generating one or more evidence models comprises: generating at least one rule for parsing a response to a task; and generating at least one value for the parsed response. | 0.749389 |
9,646,257 | 8 | 9 | 8. A method for evaluating probabilistic assertions, comprising: transforming, via a processor, a program comprising a probabilistic assertion and an input into an intermediate representation, the intermediate representation comprising a Bayesian network of nodes representing distributions, wherein the probabilistic assertion comprises a probabilistic logical statement based on random variables, a probability, and a confidence value; maintaining a concrete heap and a stack instead of constructing the nodes in the Bayesian network in response to receiving non-probabilistic values; verifying, via the processor, the probabilistic assertion in the program using the intermediate representation; and changing, via the processor, the program to meet a desired specification or correctly express a probabilistic property of the program if the probabilistic assertion is verified as false. | 8. A method for evaluating probabilistic assertions, comprising: transforming, via a processor, a program comprising a probabilistic assertion and an input into an intermediate representation, the intermediate representation comprising a Bayesian network of nodes representing distributions, wherein the probabilistic assertion comprises a probabilistic logical statement based on random variables, a probability, and a confidence value; maintaining a concrete heap and a stack instead of constructing the nodes in the Bayesian network in response to receiving non-probabilistic values; verifying, via the processor, the probabilistic assertion in the program using the intermediate representation; and changing, via the processor, the program to meet a desired specification or correctly express a probabilistic property of the program if the probabilistic assertion is verified as false. 9. The method of claim 8 , wherein transforming the program comprises representing loop bodies as supernodes in the intermediate representation and marginalizing conditions to produce unconditional distributions. | 0.537118 |
8,112,432 | 1 | 10 | 1. A system comprising: one or more devices configured to: receive a first search query; determine that the first search query includes a first entity name and that the first entity name does not correspond to one of a plurality of common words or phrases; rewrite the first search query to include a first restrict identifier that restricts a search, based on the rewritten first search query, to a first domain associated with the first entity name, in response to determining that the first search query includes a first entity name and that the first entity name does not correspond to one of the plurality of common words or phrases; perform a search, based on the rewritten first search query, to obtain first search results; and present the first search results. | 1. A system comprising: one or more devices configured to: receive a first search query; determine that the first search query includes a first entity name and that the first entity name does not correspond to one of a plurality of common words or phrases; rewrite the first search query to include a first restrict identifier that restricts a search, based on the rewritten first search query, to a first domain associated with the first entity name, in response to determining that the first search query includes a first entity name and that the first entity name does not correspond to one of the plurality of common words or phrases; perform a search, based on the rewritten first search query, to obtain first search results; and present the first search results. 10. The system of claim 1 , where the rewritten search query restricts the search to search results associated with a single source. | 0.890909 |
9,594,756 | 30 | 32 | 30. The system of claim 29 , wherein the ranking calculator is configured to calculate the interim ranking values in an iterative process that comprises calculating the interim ranking values in a calculation sequence, the system further comprising a sequencing module to determine the calculation sequence based at least in part on respective initial ranking values, with lower initial ranking values being earlier in the calculation sequence. | 30. The system of claim 29 , wherein the ranking calculator is configured to calculate the interim ranking values in an iterative process that comprises calculating the interim ranking values in a calculation sequence, the system further comprising a sequencing module to determine the calculation sequence based at least in part on respective initial ranking values, with lower initial ranking values being earlier in the calculation sequence. 32. The system of claim 30 , wherein the sequencing module is further configured to determine the calculation sequence based at least in part on a document volume parameter that indicates a quantity of documents to which respective contributors contributed, the ranking calculator further being configure to calculate the ranking values in an operation comprising: determining that a plurality of the contributors have equal initial ranking values; and forming the sequence such that, of the plurality of contributors, those with higher document volume parameters are later in the sequence. | 0.5 |
9,928,439 | 1 | 9 | 1. A method of removing text in an image by at least one computing device, the method comprising: identifying, by the at least one computing device, a region of interest in the image including text; transforming, by the at least one computing device, the region of interest to correct distortion based at least in part on a homography; using, by the at least one computing device, an optical character recognizer to recognize a character based on a detected font used within the text; receiving, by the at least one computing device, a user input to remove the character; removing, by the at least one computing device, the character from the image based on a content aware fill process; and outputting, by the at least one computing device, a result of the removing of the character from the image. | 1. A method of removing text in an image by at least one computing device, the method comprising: identifying, by the at least one computing device, a region of interest in the image including text; transforming, by the at least one computing device, the region of interest to correct distortion based at least in part on a homography; using, by the at least one computing device, an optical character recognizer to recognize a character based on a detected font used within the text; receiving, by the at least one computing device, a user input to remove the character; removing, by the at least one computing device, the character from the image based on a content aware fill process; and outputting, by the at least one computing device, a result of the removing of the character from the image. 9. The method of claim 1 , further comprising: receiving, as part of the user input, new text; transforming the new text using a transformation matrix; and replacing at least some of the text in the region of interest with the transformed new text. | 0.628743 |
9,342,588 | 11 | 14 | 11. A computer-readable storage comprising computer-usable program code that creates a statistical classification model for a classifier within a natural language understanding system, the computer-readable storage comprising: computer-usable program code that processes training data using an existing statistical classification model; computer-usable program code that selects sentences of the training data correctly classified into a selected class of the existing statistical classification model; computer-usable program code that assigns each selected sentence of the training data to a fringe group or a core group according to confidence score; computer-usable program code that updates the training data by associating the fringe group with a fringe subclass of the selected class and the core group with a core subclass of the selected class; computer-usable program code that builds a new statistical classification model from the updated training data; and computer-usable program code that outputs the new statistical classification model, wherein the computer-readable storage is not a transitory, propagating signal per se. | 11. A computer-readable storage comprising computer-usable program code that creates a statistical classification model for a classifier within a natural language understanding system, the computer-readable storage comprising: computer-usable program code that processes training data using an existing statistical classification model; computer-usable program code that selects sentences of the training data correctly classified into a selected class of the existing statistical classification model; computer-usable program code that assigns each selected sentence of the training data to a fringe group or a core group according to confidence score; computer-usable program code that updates the training data by associating the fringe group with a fringe subclass of the selected class and the core group with a core subclass of the selected class; computer-usable program code that builds a new statistical classification model from the updated training data; and computer-usable program code that outputs the new statistical classification model, wherein the computer-readable storage is not a transitory, propagating signal per se. 14. The computer-readable storage of claim 11 , wherein the computer-usable program code that assigns the selected sentences further comprises computer-usable program code that, for each selected sentence, assigns the selected sentence to the fringe group or the core group according to which range of a plurality of ranges comprises a confidence score of the selected sentence. | 0.695161 |
10,049,362 | 13 | 14 | 13. A voice biometric system comprising a processor and a memory, wherein the memory includes a non-transitory computer readable storage medium including executable instructions, which when executed by the processor, cause the processor to: obtain a user voiceprint based on a voice input from the user received through a network connection coupled to the processor; receive a request for authentication associated with a financial transaction from a requestor; obtain a spoken message from the user, the spoken message including word content and the word content including a financial transaction detail for the financial transaction; authenticate the word content included in the spoken message as spoken by the user based on the user voiceprint and the word content of the spoken message; and provide a result of the authentication, including the authenticated word content, to the requestor when the user is authenticated, thereby permitting the requestor to compare the authenticated word content to information related to the financial transaction to provide a degree of confidence that the financial transaction is not fraudulent. | 13. A voice biometric system comprising a processor and a memory, wherein the memory includes a non-transitory computer readable storage medium including executable instructions, which when executed by the processor, cause the processor to: obtain a user voiceprint based on a voice input from the user received through a network connection coupled to the processor; receive a request for authentication associated with a financial transaction from a requestor; obtain a spoken message from the user, the spoken message including word content and the word content including a financial transaction detail for the financial transaction; authenticate the word content included in the spoken message as spoken by the user based on the user voiceprint and the word content of the spoken message; and provide a result of the authentication, including the authenticated word content, to the requestor when the user is authenticated, thereby permitting the requestor to compare the authenticated word content to information related to the financial transaction to provide a degree of confidence that the financial transaction is not fraudulent. 14. The voice biometric system as claimed in claim 13 , wherein the executable instructions, when executed by the processor, further cause the processor to recognize the word content of the spoken message, and provide the authenticated recognized word content to the requestor. | 0.5 |
9,626,555 | 19 | 22 | 19. A non-transitory storage device having instructions for classifying a document image based on its content stored thereon that, when executed by data processing apparatus, cause the data processing apparatus to perform operations comprising: accessing a set of features stored in memory; analyzing the document image to determine blocks layout; recognizing the document image to obtain digital content data representing text content or the potential graphical content; calculating, based on one or more features from the set of features accessed in the memory, feature values of the document image for the one or more features from the set of features, wherein the feature values are based on the digital content data and the blocks layout; and classifying the document image as belonging to a document class from a set of document classes based on the calculated feature values. | 19. A non-transitory storage device having instructions for classifying a document image based on its content stored thereon that, when executed by data processing apparatus, cause the data processing apparatus to perform operations comprising: accessing a set of features stored in memory; analyzing the document image to determine blocks layout; recognizing the document image to obtain digital content data representing text content or the potential graphical content; calculating, based on one or more features from the set of features accessed in the memory, feature values of the document image for the one or more features from the set of features, wherein the feature values are based on the digital content data and the blocks layout; and classifying the document image as belonging to a document class from a set of document classes based on the calculated feature values. 22. The non-transitory storage device of claim 19 , further comprising: performing preliminary processing of the document image to improve visual quality of the document image before the image analyzing and the image recognition steps. | 0.817829 |
9,075,961 | 1 | 5 | 1. A method of encoding information in text documents, the method comprising: obtaining a text document having dimensions and at least a first character and a second character; determining a length between the first character and the second character to define an inter-character space; determining a reference length, the reference length being a function of the dimensions; determining a threshold length, the threshold length being a minimum length wherein information is not encoded in the inter-character space when the inter-character space is less than the threshold length; encoding the information into an altered inter-character space wherein a length of the altered inter-character space is an integral multiple of the reference length or a non-integral multiple of the reference length; and determining whether the length of the altered inter-character space is within a threshold margin, wherein the threshold margin is a predetermined minimum length on both sides of the threshold length to define a lower threshold margin and an upper threshold margin. | 1. A method of encoding information in text documents, the method comprising: obtaining a text document having dimensions and at least a first character and a second character; determining a length between the first character and the second character to define an inter-character space; determining a reference length, the reference length being a function of the dimensions; determining a threshold length, the threshold length being a minimum length wherein information is not encoded in the inter-character space when the inter-character space is less than the threshold length; encoding the information into an altered inter-character space wherein a length of the altered inter-character space is an integral multiple of the reference length or a non-integral multiple of the reference length; and determining whether the length of the altered inter-character space is within a threshold margin, wherein the threshold margin is a predetermined minimum length on both sides of the threshold length to define a lower threshold margin and an upper threshold margin. 5. The method according to claim 1 , wherein the dimensions include a width of the first character and the second character and the reference length is based on the width of the first character and the second character. | 0.880719 |
8,667,519 | 14 | 15 | 14. The apparatus of claim 13 , wherein: the computing device receives a user eligibility to participate in a preview study related to the viewed multimedia content from the remote computing system, wherein the user eligibility is determined based on the user-specific report of the response to the viewed multimedia content. | 14. The apparatus of claim 13 , wherein: the computing device receives a user eligibility to participate in a preview study related to the viewed multimedia content from the remote computing system, wherein the user eligibility is determined based on the user-specific report of the response to the viewed multimedia content. 15. The apparatus of claim 14 , wherein: the user eligibility is further determined based on at least one of a percentage of program episodes associated with the multimedia content viewed by the one or more users and an average response to each program episode viewed by the one or more users. | 0.554711 |
9,811,321 | 1 | 2 | 1. A system comprising: a data store configured to store: a first set of computer-executable instructions, one or more pre-compiled chunks, wherein each of the one or more chunks comprises portions of a script compiled into computer-executable instructions, and one or more chunk hashes, each of the one or more chunk hashes corresponding to a respective chunk of the one or more chunks; and a processor in communication with the data store, the processor, when executing the first set of computer-executable instructions, configured to: receive, from a rendering engine of a browser application executing on a client computing device, a request to compile a first script, the first script comprising a first one or more lines of source code that are compilable into computer-executable instructions; divide the first script into at least a first portion and a second portion, each portion comprising a respective subset of the first one or more lines of source code; calculate a first portion hash based at last in part on the first portion and a second portion hash based at least in part on the second portion; obtain, from the data store, the one or more chunk hashes; determine that a first chunk hash of the one or more chunk hashes matches the first portion hash; determine that none of the one or more chunk hashes matches the second portion hash; obtain, from the data store, a first chunk corresponding to the first chunk hash; compile the second portion into a second chunk; assemble the first chunk and the second chunk into a compiled set of computer-executable instructions corresponding to the first script; and transmit the compiled set of computer-executable instructions to the rendering engine. | 1. A system comprising: a data store configured to store: a first set of computer-executable instructions, one or more pre-compiled chunks, wherein each of the one or more chunks comprises portions of a script compiled into computer-executable instructions, and one or more chunk hashes, each of the one or more chunk hashes corresponding to a respective chunk of the one or more chunks; and a processor in communication with the data store, the processor, when executing the first set of computer-executable instructions, configured to: receive, from a rendering engine of a browser application executing on a client computing device, a request to compile a first script, the first script comprising a first one or more lines of source code that are compilable into computer-executable instructions; divide the first script into at least a first portion and a second portion, each portion comprising a respective subset of the first one or more lines of source code; calculate a first portion hash based at last in part on the first portion and a second portion hash based at least in part on the second portion; obtain, from the data store, the one or more chunk hashes; determine that a first chunk hash of the one or more chunk hashes matches the first portion hash; determine that none of the one or more chunk hashes matches the second portion hash; obtain, from the data store, a first chunk corresponding to the first chunk hash; compile the second portion into a second chunk; assemble the first chunk and the second chunk into a compiled set of computer-executable instructions corresponding to the first script; and transmit the compiled set of computer-executable instructions to the rendering engine. 2. The system of claim 1 , wherein the processor is further configured to store the compiled second chunk and the second chunk hash in the data store. | 0.605263 |
4,387,364 | 14 | 15 | 14. In a method of recording a digital information signal comprised of a plurality of N-bit data words by means of a recording apparatus which imperfectly transmits DC components of said digital information signal, the steps of: selectively generating M-bit data words in which M is an even integer larger than N and each of said N-bit and M-bit data words is comprised of a plurality of logic level "1" bits and logic level "0" bits; weighting each of said M-bit data words on the basis of a first value corresponding to a number of boundaries between adjacent "1" and "0" bits in the M-bit data word, a second value corresponding to the number of said "1" bits in the M-bit data word, and a third value corresponding to the numbers, in the M-bit data word, of isolated "1" and "0" bits and of isolated pairs of "1" and "0" bits bounded on both sides by "0" and "1" bits, respectively; grouping the weighted M-bit data words in accordance with the run length of data thereof; classifying the grouped M-bit data words into a first group consisting of said M-bit data words which have an equal number of said "1" and "0" bits, a second group consisting of said M-bit data words which have a number of said "1" bits greater than the number of said "0" bits, and a third group consisting of said M-bit data words which have a number of said "0" bits greater than the number of said "1" bits; assigning each of said N-bit data words to at least a respective one of said M-bit data words in accordance with the generation frequencies of said N-bit data words so that the run lengths of the assigned M-bit data words will vary generally inversely in respect to the generation frequencies of the respective N-bit data words, with some of said N-bit data words being assigned alternately to said M-bit data words of said second and third groups and the remainder of said N-bit data words being assigned to said M-bit data words of said first group; converting said N-bit data words to said respective assigned M-bit data words so as to minimize DC components of the digital information signal, as converted, and to concentrate its frequency spectrum; and recording on a record medium said M-bit data words to which said N-bit data words have been converted. | 14. In a method of recording a digital information signal comprised of a plurality of N-bit data words by means of a recording apparatus which imperfectly transmits DC components of said digital information signal, the steps of: selectively generating M-bit data words in which M is an even integer larger than N and each of said N-bit and M-bit data words is comprised of a plurality of logic level "1" bits and logic level "0" bits; weighting each of said M-bit data words on the basis of a first value corresponding to a number of boundaries between adjacent "1" and "0" bits in the M-bit data word, a second value corresponding to the number of said "1" bits in the M-bit data word, and a third value corresponding to the numbers, in the M-bit data word, of isolated "1" and "0" bits and of isolated pairs of "1" and "0" bits bounded on both sides by "0" and "1" bits, respectively; grouping the weighted M-bit data words in accordance with the run length of data thereof; classifying the grouped M-bit data words into a first group consisting of said M-bit data words which have an equal number of said "1" and "0" bits, a second group consisting of said M-bit data words which have a number of said "1" bits greater than the number of said "0" bits, and a third group consisting of said M-bit data words which have a number of said "0" bits greater than the number of said "1" bits; assigning each of said N-bit data words to at least a respective one of said M-bit data words in accordance with the generation frequencies of said N-bit data words so that the run lengths of the assigned M-bit data words will vary generally inversely in respect to the generation frequencies of the respective N-bit data words, with some of said N-bit data words being assigned alternately to said M-bit data words of said second and third groups and the remainder of said N-bit data words being assigned to said M-bit data words of said first group; converting said N-bit data words to said respective assigned M-bit data words so as to minimize DC components of the digital information signal, as converted, and to concentrate its frequency spectrum; and recording on a record medium said M-bit data words to which said N-bit data words have been converted. 15. The method according to claim 14; in which said M-bit data words of one of said second and third groups are each inverted with respect to corresponding M-bit data words of the other of said second and third groups. | 0.60219 |
10,140,279 | 21 | 22 | 21. The system of claim 20 , wherein the detecting a semantic organization event comprises detecting a selection of the first set of data cells. | 21. The system of claim 20 , wherein the detecting a semantic organization event comprises detecting a selection of the first set of data cells. 22. The system of claim 21 , wherein the detecting a semantic organization event further comprises detecting a merge operation on the first set of data cells. | 0.5 |
9,972,340 | 13 | 15 | 13. A method for searching recorded content, the method comprising: receiving, by one or more computer processors, a search query for a non-speech sound, wherein the search query includes a descriptive term or phrase of the non-speech sound; searching, by one or more computer processors, recorded content for a match for the descriptive term or phrase, wherein the recorded content is of a communication between a plurality of participants and includes speech from one or more of the plurality of participants; automatically identifying, by one or more computer processors, a searchable tag, in the recorded content, that matches the descriptive term or phrase, wherein the searchable tag: (i) includes a classification of the non-speech sound, determined using a trained classification function, (ii) corresponds to a point-in-time at which the non-speech sound was transmitted to the plurality of participants during recording of the recorded content, and (iii) includes an automatically generated phonetic translation of the non-speech sound navigating, by one or more computer processors, to a location in the recorded content corresponding to the point-in-time; and playing, by one or more computer processors, the recorded content starting at the point-in-time. | 13. A method for searching recorded content, the method comprising: receiving, by one or more computer processors, a search query for a non-speech sound, wherein the search query includes a descriptive term or phrase of the non-speech sound; searching, by one or more computer processors, recorded content for a match for the descriptive term or phrase, wherein the recorded content is of a communication between a plurality of participants and includes speech from one or more of the plurality of participants; automatically identifying, by one or more computer processors, a searchable tag, in the recorded content, that matches the descriptive term or phrase, wherein the searchable tag: (i) includes a classification of the non-speech sound, determined using a trained classification function, (ii) corresponds to a point-in-time at which the non-speech sound was transmitted to the plurality of participants during recording of the recorded content, and (iii) includes an automatically generated phonetic translation of the non-speech sound navigating, by one or more computer processors, to a location in the recorded content corresponding to the point-in-time; and playing, by one or more computer processors, the recorded content starting at the point-in-time. 15. The method of claim 13 , further comprising: responding to the search query, by one or more computer processors, with the recorded content and an indication of the point-in-time. | 0.574766 |
9,386,139 | 7 | 8 | 7. An apparatus comprising: at least one processor; and at least one memory including computer program code for one or more programs, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following, initiate presentation of a plurality of descriptors on a user equipment, wherein each of the descriptors contains one or more words corresponding to an emotion of a user of the user equipment; determining an association between one or more options and a selected one of the descriptors without user intervention; initiate presentation of the one or more options on the user equipment; invoke an application corresponding to a selected one of the options at the user equipment; and initiate sharing of one or more of the descriptors and one or more associated options via a peer-to-peer protocol within a community of users. | 7. An apparatus comprising: at least one processor; and at least one memory including computer program code for one or more programs, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following, initiate presentation of a plurality of descriptors on a user equipment, wherein each of the descriptors contains one or more words corresponding to an emotion of a user of the user equipment; determining an association between one or more options and a selected one of the descriptors without user intervention; initiate presentation of the one or more options on the user equipment; invoke an application corresponding to a selected one of the options at the user equipment; and initiate sharing of one or more of the descriptors and one or more associated options via a peer-to-peer protocol within a community of users. 8. An apparatus of claim 7 , wherein the apparatus is further caused to: cause, at least in part, a suggestion of one of the descriptors at the user equipment via monitoring one or more user actions and matching one or more of the monitored user actions against one or more user actions predetermined as associated with one or more of the descriptors, prior to the user selecting the one of the descriptors, wherein the options include accessing services, applications, content, or a combination thereof available to the user equipment. | 0.5 |
9,910,833 | 1 | 10 | 1. A method performed on a computing device comprising an operating system, comprising: causing elements to be recognized that correspond to one or more browser-supported programming languages in an application by traversing a model of at least a portion of the application, wherein the recognized elements are those elements in the model that can be converted to native user interface elements in the operating system and rendered on a display of the computing device; converting the elements in the one or more browser-supported programming languages to native user interface elements; causing the native user interface elements to be rendered on the display of the computing device, wherein a native rendering process performs at least the converting the elements and causing the native user interface elements to be rendered and a web rendering process performs at least the causing the elements to be recognized, and performing both a web rendering of the application and a native rendering of the application in parallel by performing at least the following: the web rendering process, in response to a change in the model, calling the native renderer process to cause the native rendering process to render native user interface elements corresponding to recognized elements in a changed portion of the model; and the native rendering process, in response to an event occurring in the native rendering, injecting code corresponding to the event into the web rendering causing the web rendering process to be hidden from the display. | 1. A method performed on a computing device comprising an operating system, comprising: causing elements to be recognized that correspond to one or more browser-supported programming languages in an application by traversing a model of at least a portion of the application, wherein the recognized elements are those elements in the model that can be converted to native user interface elements in the operating system and rendered on a display of the computing device; converting the elements in the one or more browser-supported programming languages to native user interface elements; causing the native user interface elements to be rendered on the display of the computing device, wherein a native rendering process performs at least the converting the elements and causing the native user interface elements to be rendered and a web rendering process performs at least the causing the elements to be recognized, and performing both a web rendering of the application and a native rendering of the application in parallel by performing at least the following: the web rendering process, in response to a change in the model, calling the native renderer process to cause the native rendering process to render native user interface elements corresponding to recognized elements in a changed portion of the model; and the native rendering process, in response to an event occurring in the native rendering, injecting code corresponding to the event into the web rendering causing the web rendering process to be hidden from the display. 10. The method of claim 1 , wherein the native rendering process is performed on the computing device, but the web rendering process is performed on a device different from the computing device. | 0.86202 |
9,280,610 | 17 | 18 | 17. A system, comprising: one or more processors; and memory storing instructions, the instructions, when executed by the one or more processors, cause the processors to perform operations comprising: receiving a user request from a mobile client device, the user request including at least a speech input and seeks an informational answer or performance of a task; detecting a failure to provide a satisfactory response to the user request; in response to detecting the failure, crowd-sourcing information relevant to the user request by querying one or more crowd sourcing information sources; receiving one or more answers from the crowd sourcing information sources; and generating a response to the user request based on at least one of the one or more answers received from the one or more crowd sourcing information sources. | 17. A system, comprising: one or more processors; and memory storing instructions, the instructions, when executed by the one or more processors, cause the processors to perform operations comprising: receiving a user request from a mobile client device, the user request including at least a speech input and seeks an informational answer or performance of a task; detecting a failure to provide a satisfactory response to the user request; in response to detecting the failure, crowd-sourcing information relevant to the user request by querying one or more crowd sourcing information sources; receiving one or more answers from the crowd sourcing information sources; and generating a response to the user request based on at least one of the one or more answers received from the one or more crowd sourcing information sources. 18. The system of claim 17 , wherein crowd-sourcing the information relevant to the user request further comprises: generating one or more queries based on the user request; and sending the one or more queries to the one or more crowd sourcing information sources. | 0.75419 |
9,569,729 | 13 | 14 | 13. The computer readable medium of claim 1 further comprising producing results for an interface to receive a matrix display. | 13. The computer readable medium of claim 1 further comprising producing results for an interface to receive a matrix display. 14. The computer readable medium of claim 13 where the matrix display provides for displaying a user-selected demographic dimension being an at least one of the group of location, seniority, mood, topic, and topic area. | 0.5 |
7,788,250 | 3 | 4 | 3. The method of claim 1 , further comprising combining the supplier links and the parameter names in order to obtain universal resource locators for sending the user requests to the suppliers. | 3. The method of claim 1 , further comprising combining the supplier links and the parameter names in order to obtain universal resource locators for sending the user requests to the suppliers. 4. The method of claim 3 , further comprising: receiving from the user a set of search terms indicating a set of values assigned to a the set of parameters; retrieving from the database the new request type satisfying the search terms, the request type associated with the supplier links; sending the set of values to the suppliers as indicated by the supplier links; receiving a set of results from the suppliers in response; and sending the set of results to the user. | 0.5 |
10,055,128 | 13 | 18 | 13. The one or more non-transitory computer-readable media of claim 12 , wherein the instructions further include instructions which, when executed by one or more hardware processors, cause determining whether a suitability metric evaluated over the sub-tree rooted at said each node exceeds a threshold value. | 13. The one or more non-transitory computer-readable media of claim 12 , wherein the instructions further include instructions which, when executed by one or more hardware processors, cause determining whether a suitability metric evaluated over the sub-tree rooted at said each node exceeds a threshold value. 18. The one or more non-transitory computer-readable media of claim 13 , wherein the instructions further include instructions which, when executed by one or more hardware processors, cause automatically determining the threshold value based on capabilities of a computer that stores the XML document. | 0.62931 |
8,977,555 | 25 | 27 | 25. A non-transitory computer readable medium comprising executable code that, when executed by a processor, causes a computing device to perform a process comprising: receiving, from a speech processing system: an audio presentation comprising a first portion corresponding to a first item and a second portion corresponding to a second item; a first marker corresponding to the first item; and a second marker corresponding to the second item; presenting the audio presentation; and transmitting, to the speech processing system: audio data received via an audio input component of the computing device; and marker data comprising at least one of the first marker or the second marker. | 25. A non-transitory computer readable medium comprising executable code that, when executed by a processor, causes a computing device to perform a process comprising: receiving, from a speech processing system: an audio presentation comprising a first portion corresponding to a first item and a second portion corresponding to a second item; a first marker corresponding to the first item; and a second marker corresponding to the second item; presenting the audio presentation; and transmitting, to the speech processing system: audio data received via an audio input component of the computing device; and marker data comprising at least one of the first marker or the second marker. 27. The non-transitory computer readable medium of claim 25 , wherein the marker data and the audio data are transmitted in a single data stream. | 0.823171 |
9,262,407 | 1 | 2 | 1. A method for optimizing a multi-language user interface layout via reverse pseudo-translation, the method comprising: selecting at least one user interface page from a group of user interface pages in a language; selecting at least one target language from a group of target languages to pseudo-translate the at least one user interface page; specifying at least one layout requirement for formatting the selected at least one user interface page; performing pseudo-translation of the at least one user interface page based on the selected at least one target language; modifying, by a merge algorithm, the at least one pseudo-translated user interface page according to the at least one specified layout requirement, wherein the merge algorithm comprises: applying the at least one specified layout requirement to the at least one pseudo-translated user interface page, wherein the at least one specified layout requirement is applied to the at least one pseudo-translated user interface page in a hierarchy from a most shared selected layout property among the at least one selected target language to a least shared selected layout property among the at least one selected target language; and implementing a reverse pseudo-translation of the at least one modified pseudo-translated user interface page. | 1. A method for optimizing a multi-language user interface layout via reverse pseudo-translation, the method comprising: selecting at least one user interface page from a group of user interface pages in a language; selecting at least one target language from a group of target languages to pseudo-translate the at least one user interface page; specifying at least one layout requirement for formatting the selected at least one user interface page; performing pseudo-translation of the at least one user interface page based on the selected at least one target language; modifying, by a merge algorithm, the at least one pseudo-translated user interface page according to the at least one specified layout requirement, wherein the merge algorithm comprises: applying the at least one specified layout requirement to the at least one pseudo-translated user interface page, wherein the at least one specified layout requirement is applied to the at least one pseudo-translated user interface page in a hierarchy from a most shared selected layout property among the at least one selected target language to a least shared selected layout property among the at least one selected target language; and implementing a reverse pseudo-translation of the at least one modified pseudo-translated user interface page. 2. The method of claim 1 further comprising: examining the at least one modified pseudo-translated user interface page for nonconformity with the at least one specified layout requirement; and editing, the at least one modified pseudo-translated user interface page. | 0.648148 |
10,002,608 | 16 | 17 | 16. The computer-readable storage device of claim 15 , having additional instructions stored which, when executed by the computing device, result in operations comprising generating a finite state transducer according to composing the reweighted word lattice. | 16. The computer-readable storage device of claim 15 , having additional instructions stored which, when executed by the computing device, result in operations comprising generating a finite state transducer according to composing the reweighted word lattice. 17. The computer-readable storage device of claim 16 , having additional instructions stored which, when executed by the computing device, result in operations comprising reranking, according to the finite state transducer, the word lattice generated by the automatic speech recognizer. | 0.5 |
6,125,361 | 1 | 5 | 1. A computer including a data storage device including a computer usable medium having computer usable code means for ranking documents in a set of documents in response to a query, the computer usable code means having: computer readable code means for identifying a reference to a second document in a first document; computer readable code means for receiving a lexical distance, the lexical distance defining a number of document terms; computer readable code means for receiving a query including one or more query terms; and computer readable code means for determining a number of times at least one of the query terms is present in the first document within the lexical distance of the reference to the second document, for ranking the documents based thereon. | 1. A computer including a data storage device including a computer usable medium having computer usable code means for ranking documents in a set of documents in response to a query, the computer usable code means having: computer readable code means for identifying a reference to a second document in a first document; computer readable code means for receiving a lexical distance, the lexical distance defining a number of document terms; computer readable code means for receiving a query including one or more query terms; and computer readable code means for determining a number of times at least one of the query terms is present in the first document within the lexical distance of the reference to the second document, for ranking the documents based thereon. 5. The computer of claim 1, further comprising: computer readable code means for receiving a set "U" of documents; computer readable code means for, for at least one test document "u" in the set "U", defining as neighbor documents "N(u)" documents in the set "U" that include at least one reference to the test document "u"; computer readable code means for determining, for at least one document term in at least one neighbor document "N(u)", whether the at least one document term is within a predetermined distance of a reference in the neighbor document "N(u)" to the test document "u"; and computer readable code means for outputting a signal in response to the means for determining whether the at least one document term is within a predetermined distance of a reference. | 0.5 |
8,209,347 | 1 | 4 | 1. A computer-implemented method, comprising: receiving an original query; selecting a plurality of documents responsive to the original query according to a ranking of the respective documents; generating a plurality of term vectors, the plurality of term vectors including a term vector for each document; truncating each term vector to include only highest-weighted terms from the respective document to provide a plurality of truncated term vectors; combining the plurality of truncated term vectors containing the highest-weighted terms to produce a search query centroid; searching a centroid repository for previously stored centroids matching the search query centroid; converting each of a first number of the most highly-ranked centroids into a respective candidate query; examining the candidate queries; adding each candidate query to a set of query suggestions if the respective candidate query contains a threshold number of terms that are not included in the original query; and providing the set of query suggestions in response to the original query. | 1. A computer-implemented method, comprising: receiving an original query; selecting a plurality of documents responsive to the original query according to a ranking of the respective documents; generating a plurality of term vectors, the plurality of term vectors including a term vector for each document; truncating each term vector to include only highest-weighted terms from the respective document to provide a plurality of truncated term vectors; combining the plurality of truncated term vectors containing the highest-weighted terms to produce a search query centroid; searching a centroid repository for previously stored centroids matching the search query centroid; converting each of a first number of the most highly-ranked centroids into a respective candidate query; examining the candidate queries; adding each candidate query to a set of query suggestions if the respective candidate query contains a threshold number of terms that are not included in the original query; and providing the set of query suggestions in response to the original query. 4. The method of claim 1 , further comprising: calculating a dot product of each previously stored centroid and the search query centroid, the dot product indicating a degree of similarity between each previously stored centroid and the search query centroid; and sorting the previously stored centroids by the respective dot products to produce a ranked list of centroids, where the most highly-ranked centroids most closely match the search query centroid. | 0.5 |
9,286,358 | 9 | 11 | 9. A computer program product for generating and utilizing a dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects, the computer program product comprising a non-transitory computer readable storage medium having program code embodied therewith, the program code readable and executable by a processor to perform a method comprising: associating a non-contextual data object with a context object to define a synthetic context-based object, wherein the non-contextual data object ambiguously relates to multiple subject-matters, and wherein the context object provides a context that identifies a specific subject-matter, from the multiple subject-matters, of the non-contextual data object; associating the synthetic context-based object with at least one specific data store, wherein said at least one specific data store comprises data that is associated with data contained in the non-contextual data object and the context object; and constructing a dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects, wherein synthetic context-based objects within a same dimension of the dimensionally constrained hierarchical synthetic context-based object library share data from a same context object, and wherein synthetic context-based objects within the same dimension of the dimensionally constrained hierarchical synthetic context-based object library contain disparate data from different non-contextual data objects. | 9. A computer program product for generating and utilizing a dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects, the computer program product comprising a non-transitory computer readable storage medium having program code embodied therewith, the program code readable and executable by a processor to perform a method comprising: associating a non-contextual data object with a context object to define a synthetic context-based object, wherein the non-contextual data object ambiguously relates to multiple subject-matters, and wherein the context object provides a context that identifies a specific subject-matter, from the multiple subject-matters, of the non-contextual data object; associating the synthetic context-based object with at least one specific data store, wherein said at least one specific data store comprises data that is associated with data contained in the non-contextual data object and the context object; and constructing a dimensionally constrained hierarchical synthetic context-based object library for multiple synthetic context-based objects, wherein synthetic context-based objects within a same dimension of the dimensionally constrained hierarchical synthetic context-based object library share data from a same context object, and wherein synthetic context-based objects within the same dimension of the dimensionally constrained hierarchical synthetic context-based object library contain disparate data from different non-contextual data objects. 11. The computer program product of claim 9 , wherein the specific subject-matter for a particular data store in the data structure is exclusive to only said particular data store. | 0.759358 |
9,098,719 | 1 | 11 | 1. A machine-readable non-transitory storage medium having instructions therein, which when executed by a machine, causes the machine to perform a method, the method comprising: in response to receiving a first request associated with a document, updating the document in a first domain, the updated document associated with a mechanism for secure activation of active content referred to by a hyperlink; storing the active content in a second domain without filtering the active content; in response to receiving a subsequent request from a client to retrieve the updated document in the first domain, generating, at a device, a one time token uniquely for the subsequent request, the one time token to authorize an access to the active content of the second domain via a hyperlink having the one time token; sending the updated document modified with the hyperlink having the one time token to the client, the active content accessible via the hyperlink having the one time token when the client presents the updated document; in response to receiving a second request addressing the active content of the second domain, extracting a token from the second request, the token dynamically generated for a request to retrieve the updated document in the first domain; verifying, at the device, whether the second request is valid using the token extracted from the second request, the second request being valid when the token matches the one time token; and sending the active content for the second request if validity of the second request is verified based on the token to allow the secure activation of the active content in the updated document. | 1. A machine-readable non-transitory storage medium having instructions therein, which when executed by a machine, causes the machine to perform a method, the method comprising: in response to receiving a first request associated with a document, updating the document in a first domain, the updated document associated with a mechanism for secure activation of active content referred to by a hyperlink; storing the active content in a second domain without filtering the active content; in response to receiving a subsequent request from a client to retrieve the updated document in the first domain, generating, at a device, a one time token uniquely for the subsequent request, the one time token to authorize an access to the active content of the second domain via a hyperlink having the one time token; sending the updated document modified with the hyperlink having the one time token to the client, the active content accessible via the hyperlink having the one time token when the client presents the updated document; in response to receiving a second request addressing the active content of the second domain, extracting a token from the second request, the token dynamically generated for a request to retrieve the updated document in the first domain; verifying, at the device, whether the second request is valid using the token extracted from the second request, the second request being valid when the token matches the one time token; and sending the active content for the second request if validity of the second request is verified based on the token to allow the secure activation of the active content in the updated document. 11. The medium of claim 1 , wherein the updated document includes a frame element associated with the hyperlink with the one time token. | 0.835749 |
8,712,989 | 1 | 6 | 1. A method comprising: accepting a request to a wild card auto completion service including an input term at least partly in a target language and at least partly in an initial language, wherein the initial language and the target language are two different languages, the service employing a syntax to accept the input term including zero to multiple wild card characters in the target language or in the initial language in a first part and a delimiter indicating a second part, the second part comprising the target language or the initial language such that: if the language of the first part includes the initial language, the second part includes the target language and if the language of the first part includes the target language, the second part includes the initial language, and the second part identifying at least one of a context or a domain for the wild card auto completion service; identifying an initial-target language pair for the request; aggregating two or more consecutive homogenous wild card characters, wherein the aggregating comprises replacing the two or more consecutive homogenous wild card characters with a single wild card character of a same type as the homogenous wild card character; parsing the input term to identify a pattern of the input term; selecting a matcher corresponding to the pattern of the input term; matching the input term to an entry using the matcher selected; and returning the entry. | 1. A method comprising: accepting a request to a wild card auto completion service including an input term at least partly in a target language and at least partly in an initial language, wherein the initial language and the target language are two different languages, the service employing a syntax to accept the input term including zero to multiple wild card characters in the target language or in the initial language in a first part and a delimiter indicating a second part, the second part comprising the target language or the initial language such that: if the language of the first part includes the initial language, the second part includes the target language and if the language of the first part includes the target language, the second part includes the initial language, and the second part identifying at least one of a context or a domain for the wild card auto completion service; identifying an initial-target language pair for the request; aggregating two or more consecutive homogenous wild card characters, wherein the aggregating comprises replacing the two or more consecutive homogenous wild card characters with a single wild card character of a same type as the homogenous wild card character; parsing the input term to identify a pattern of the input term; selecting a matcher corresponding to the pattern of the input term; matching the input term to an entry using the matcher selected; and returning the entry. 6. A method as recited in claim 1 , wherein the returning the entry includes refining the entry to enhance presentation. | 0.877049 |
7,818,274 | 1 | 2 | 1. A system for automatic event handling rule generation, comprising: an event handling device comprising memory and one or more processors for automatically handling events associated with an operation of one or more computers; a system log file, comprising a specific syslog entry associated with a particular event; a rule module, coupled to the system log file and including a solution template corresponding to said specific syslog entry, wherein the rule module is configured to generate a new rule to modify an existing behavior of the event handling device in response to a condition corresponding to the particular event associated with the specific syslog entry; a syslog entry format database coupled to the rule module, wherein the syslog entry database comprises descriptions of a plurality of syslog entry formats, wherein the specific syslog entry is compared to the syslog entry format database to associate a particular syslog entry format with the specific syslog entry; a causal database coupled to the rule module, wherein the causal database comprises a description of a problem behavior known to cause the specific syslog entry wherein the causal database comprises a plurality of causes each mapping to a corresponding rule template and wherein information parsed from a system log entry is associated with the cause for the system log entry; and a parser configured to parse information from the specific syslog entry based on the particular syslog entry format, wherein the rule module is configured to select a rule template based on the syslog entry format, the problem behavior and the system log entry information and to use the rule template to automatically generate the new rule to alter the existing behavior of the event handling device in response to the condition and to take a corrective action based on the automatically generated new rule when the condition next occurs. | 1. A system for automatic event handling rule generation, comprising: an event handling device comprising memory and one or more processors for automatically handling events associated with an operation of one or more computers; a system log file, comprising a specific syslog entry associated with a particular event; a rule module, coupled to the system log file and including a solution template corresponding to said specific syslog entry, wherein the rule module is configured to generate a new rule to modify an existing behavior of the event handling device in response to a condition corresponding to the particular event associated with the specific syslog entry; a syslog entry format database coupled to the rule module, wherein the syslog entry database comprises descriptions of a plurality of syslog entry formats, wherein the specific syslog entry is compared to the syslog entry format database to associate a particular syslog entry format with the specific syslog entry; a causal database coupled to the rule module, wherein the causal database comprises a description of a problem behavior known to cause the specific syslog entry wherein the causal database comprises a plurality of causes each mapping to a corresponding rule template and wherein information parsed from a system log entry is associated with the cause for the system log entry; and a parser configured to parse information from the specific syslog entry based on the particular syslog entry format, wherein the rule module is configured to select a rule template based on the syslog entry format, the problem behavior and the system log entry information and to use the rule template to automatically generate the new rule to alter the existing behavior of the event handling device in response to the condition and to take a corrective action based on the automatically generated new rule when the condition next occurs. 2. The system of claim 1 , further comprising: a user interface, coupled to the system log file; and an input device, coupled to the user interface, wherein the user interface and the input device are configured to allow selection of the specific syslog entry. | 0.505703 |
10,133,737 | 1 | 7 | 1. A method performed by data processing apparatus, the method comprising: receiving, with one or more processors at a server, an input string having a plurality of terms, the input string being in a first form, wherein a given sequence of the plurality of terms refers to a geographic feature, wherein the given sequence is annotated with a geographic-feature type selected from a plurality of geographic-feature types each indicating a characteristic of an entity in the physical world corresponding to the geographic feature, and wherein the given sequence is stored in an annotated format with the geographic-feature type in a database of geographic labels prior to receiving the input string; transforming, with one or more processors, the input string from the first form to a second form, the transforming including: applying one or more rules to the input string to identify one or more terms for translation, the one or more identified terms being fewer than the plurality of terms, wherein at least some of the rules are applied in response to a match between a feature type of the respective rule and the geographic-feature type with which the given sequence is annotated to indicate the characteristic of the corresponding entity in the physical world, translating the identified one or more terms to one or more translated terms in the second form, and transliterating at least some of the remaining terms of the plurality of terms into transliterated terms in the second form, including selecting one or more transliteration rules for application in accordance with the indicated characteristic of the entity, wherein when the given sequence of the plurality of terms is annotated with a first geographic-feature type of the plurality of geographic-feature types, a first rule of the one or more rules identifies a specific term in the input string for translation in response to a match between a first feature type of the first rule and the first geographic-feature type, and when the given sequence of the plurality of terms is annotated with a second geographic-feature type of the plurality of geographic-feature types, a second rule of the one or more rules identifies the same specific term in the input string for transliteration in response to a match between a second feature type of the second rule and the second geographic-feature type, wherein the specific term is translated or transliterated to a term having the same grammatical form as the specific term; the method further comprising: concatenating, with one or more processors, at least the translated and transliterated terms to form a hybrid output string in the second form; and storing the hybrid output string in the database of geographic labels; and when a map of a geographic region including the entity is requested for display: (i) retrieving the hybrid output string from the database and (ii) providing, via a network interface, the hybrid output string along with map data for presenting the map with the hybrid output string at a client device. | 1. A method performed by data processing apparatus, the method comprising: receiving, with one or more processors at a server, an input string having a plurality of terms, the input string being in a first form, wherein a given sequence of the plurality of terms refers to a geographic feature, wherein the given sequence is annotated with a geographic-feature type selected from a plurality of geographic-feature types each indicating a characteristic of an entity in the physical world corresponding to the geographic feature, and wherein the given sequence is stored in an annotated format with the geographic-feature type in a database of geographic labels prior to receiving the input string; transforming, with one or more processors, the input string from the first form to a second form, the transforming including: applying one or more rules to the input string to identify one or more terms for translation, the one or more identified terms being fewer than the plurality of terms, wherein at least some of the rules are applied in response to a match between a feature type of the respective rule and the geographic-feature type with which the given sequence is annotated to indicate the characteristic of the corresponding entity in the physical world, translating the identified one or more terms to one or more translated terms in the second form, and transliterating at least some of the remaining terms of the plurality of terms into transliterated terms in the second form, including selecting one or more transliteration rules for application in accordance with the indicated characteristic of the entity, wherein when the given sequence of the plurality of terms is annotated with a first geographic-feature type of the plurality of geographic-feature types, a first rule of the one or more rules identifies a specific term in the input string for translation in response to a match between a first feature type of the first rule and the first geographic-feature type, and when the given sequence of the plurality of terms is annotated with a second geographic-feature type of the plurality of geographic-feature types, a second rule of the one or more rules identifies the same specific term in the input string for transliteration in response to a match between a second feature type of the second rule and the second geographic-feature type, wherein the specific term is translated or transliterated to a term having the same grammatical form as the specific term; the method further comprising: concatenating, with one or more processors, at least the translated and transliterated terms to form a hybrid output string in the second form; and storing the hybrid output string in the database of geographic labels; and when a map of a geographic region including the entity is requested for display: (i) retrieving the hybrid output string from the database and (ii) providing, via a network interface, the hybrid output string along with map data for presenting the map with the hybrid output string at a client device. 7. The method of claim 1 , wherein transliterating the remaining terms includes: tokenizing the string into a plurality of tokens; transliterating each token from the first form to a second form; and concatenating at least the transliterated tokens in the second form to form a transliterated output string in the second form. | 0.755255 |
7,925,369 | 1 | 7 | 1. A method, comprising: defining a reference model of a system for modeling data associated with the system, the reference model having a plurality of terms; generating a reference fit error metric for the reference model; generating a set of evaluation models each having one term different than the reference model; generating an evaluation fit error metric for each of the evaluation models; replacing the reference model with a selected evaluation model responsive to the selected evaluation model having an evaluation fit error metric less than the reference fit error metric; repeating, based on the replaced reference model, the generating of the reference fit error metric, the generating of the set of evaluation models, the generating of the evaluation fit error metrics, and the replacing of the reference model until no evaluation model has an evaluation fit error metric less than the reference fit error metric; training the reference model in which no evaluation model has a smaller evaluation fit metric by using the data associated with the system; and employing the trained reference model to determine at least one characteristic of the system. | 1. A method, comprising: defining a reference model of a system for modeling data associated with the system, the reference model having a plurality of terms; generating a reference fit error metric for the reference model; generating a set of evaluation models each having one term different than the reference model; generating an evaluation fit error metric for each of the evaluation models; replacing the reference model with a selected evaluation model responsive to the selected evaluation model having an evaluation fit error metric less than the reference fit error metric; repeating, based on the replaced reference model, the generating of the reference fit error metric, the generating of the set of evaluation models, the generating of the evaluation fit error metrics, and the replacing of the reference model until no evaluation model has an evaluation fit error metric less than the reference fit error metric; training the reference model in which no evaluation model has a smaller evaluation fit metric by using the data associated with the system; and employing the trained reference model to determine at least one characteristic of the system. 7. The method of claim 1 , wherein the terms of the reference model are selected from a set of potential terms, and generating the set of evaluation models comprises generating at least one evaluation model for each of the terms in the set of potential terms not selected for the reference model. | 0.694845 |
9,396,171 | 15 | 17 | 15. A computer-readable storage medium in which is embedded computer-readable code that when loaded on a computer causes the computer to perform steps of: receiving a sparse representation document failing to satisfy a predefined schema, the sparse representation document comprising a plurality of sparsely-encoded XML elements comprising valid XML code portions that are limited to defining attribute values without corresponding tags; parsing the sparse representation document according to a predefined set of XML parsing rules, wherein the parsing generates a XML document having a valid XML structure according to the predefined schema; responsive to encountering a first sparsely-encoded XML element among the plurality of sparsely-encoded XML elements during the parsing, applying a mapping function to the first sparsely-encoded XML element, wherein the mapping function is configured to map the first sparsely-encoded XML element to a first nested location in the XML document; and responsive to encountering a second sparsely-encoded XML element among the plurality of sparsely-encoded XML elements during the parsing, applying the mapping function to the second sparsely-encoded XML element, wherein the mapping function is configured to utilize a heuristic to map the second sparsely-encoded XML element to a second nested location in the XML document, and wherein the heuristic handles at least one mapping by selecting a most recently encountered element. | 15. A computer-readable storage medium in which is embedded computer-readable code that when loaded on a computer causes the computer to perform steps of: receiving a sparse representation document failing to satisfy a predefined schema, the sparse representation document comprising a plurality of sparsely-encoded XML elements comprising valid XML code portions that are limited to defining attribute values without corresponding tags; parsing the sparse representation document according to a predefined set of XML parsing rules, wherein the parsing generates a XML document having a valid XML structure according to the predefined schema; responsive to encountering a first sparsely-encoded XML element among the plurality of sparsely-encoded XML elements during the parsing, applying a mapping function to the first sparsely-encoded XML element, wherein the mapping function is configured to map the first sparsely-encoded XML element to a first nested location in the XML document; and responsive to encountering a second sparsely-encoded XML element among the plurality of sparsely-encoded XML elements during the parsing, applying the mapping function to the second sparsely-encoded XML element, wherein the mapping function is configured to utilize a heuristic to map the second sparsely-encoded XML element to a second nested location in the XML document, and wherein the heuristic handles at least one mapping by selecting a most recently encountered element. 17. The computer-readable storage medium of claim 15 , wherein the first nested location is determined by user-specified rule. | 0.760456 |
9,674,683 | 1 | 6 | 1. A vehicle communication system, comprising: a processor configured to: in response to an emergency condition detection signal, output a computer generated speech signal for vehicle parameter data to an emergency response center over a voice channel via a wireless communication, the speech signal being in a language selected based on a geographic location of a vehicle; and transmit the vehicle parameter data as digits if an error occurs during generation of the speech signal. | 1. A vehicle communication system, comprising: a processor configured to: in response to an emergency condition detection signal, output a computer generated speech signal for vehicle parameter data to an emergency response center over a voice channel via a wireless communication, the speech signal being in a language selected based on a geographic location of a vehicle; and transmit the vehicle parameter data as digits if an error occurs during generation of the speech signal. 6. The vehicle communication system of claim 1 , wherein the wireless communication includes a cellular phone. | 0.853333 |
9,256,825 | 1 | 3 | 1. An emotion script generating method, comprising: receiving, at a user terminal, a user's emotion data; generating, with a processor, emotion script using the emotion data based on a predefined template; the generated emotion script being computer readable program code; providing the generated emotion script to the user so that the user experiences an emotion corresponding to the emotion script in which providing the emotion script to the user comprises: determining configurations of the predefined template including a category of an emotion; adding values describing the emotion data to a number of categories within the predefined template according to the configurations of the predefined template; providing the generated emotion script to an emotion data adjustment interface and presenting the emotion data adjustment interface to the user; and providing the generated emotion script to a number of devices that affect the user's environment; and receiving adjustments to the emotion script comprising: after the user experiences the emotion, receiving adjustments to the generated emotion script at the emotion data adjustment interface adjusted by the user; replacing the stored emotion script with the adjusted emotion script; and associating the adjusted emotion script with a specific emotion felt by the user. | 1. An emotion script generating method, comprising: receiving, at a user terminal, a user's emotion data; generating, with a processor, emotion script using the emotion data based on a predefined template; the generated emotion script being computer readable program code; providing the generated emotion script to the user so that the user experiences an emotion corresponding to the emotion script in which providing the emotion script to the user comprises: determining configurations of the predefined template including a category of an emotion; adding values describing the emotion data to a number of categories within the predefined template according to the configurations of the predefined template; providing the generated emotion script to an emotion data adjustment interface and presenting the emotion data adjustment interface to the user; and providing the generated emotion script to a number of devices that affect the user's environment; and receiving adjustments to the emotion script comprising: after the user experiences the emotion, receiving adjustments to the generated emotion script at the emotion data adjustment interface adjusted by the user; replacing the stored emotion script with the adjusted emotion script; and associating the adjusted emotion script with a specific emotion felt by the user. 3. The method of claim 1 , in which receiving emotion data comprises: receiving user physiological parameters that are acquired by a physiological parameter sensor or a biological signal detector. | 0.5 |
8,229,944 | 1 | 3 | 1. A method performed by one or more processors comprising: parsing a search query into one or more constituent terms; retrieving first and second members of one or more domains based upon a correspondence between the constituent terms and the first and second members of the one or more domains, the first and second members corresponding to first and second attributes included in one or more database tables; performing a database operation on the one or more database tables, the database operation to generate a set of related data; extracting an attribute from the set of related data; automatically relating, using the one or more processors, first and second members of the one or more domains to a semantic phrase, based on a probability value associated with the semantic phrase, the semantic phrase representing a semantic relationship between the first and second members of the one or more domains; and generating a semantic query using the semantic phrase and the first and second members of the one or more domains. | 1. A method performed by one or more processors comprising: parsing a search query into one or more constituent terms; retrieving first and second members of one or more domains based upon a correspondence between the constituent terms and the first and second members of the one or more domains, the first and second members corresponding to first and second attributes included in one or more database tables; performing a database operation on the one or more database tables, the database operation to generate a set of related data; extracting an attribute from the set of related data; automatically relating, using the one or more processors, first and second members of the one or more domains to a semantic phrase, based on a probability value associated with the semantic phrase, the semantic phrase representing a semantic relationship between the first and second members of the one or more domains; and generating a semantic query using the semantic phrase and the first and second members of the one or more domains. 3. The method of claim 1 , further comprising selecting a semantic phrase using, at least in part, a default relation or an Artificial Intelligence (AI) algorithm. | 0.73366 |
10,157,220 | 10 | 15 | 10. A computer system with a search engine, the computer system comprising: one or more computer processors; one or more computer readable storage medium; program instructions of the search engine stored on the computer readable storage medium for execution by at least one of the one or more processors, the program instructions comprising: program instructions to receive a search expression; program instructions to extract, using a search term extractor of the search engine, two or more query terms of the search expression; program instructions to determine two or more nodes representing a first term of the two or more query terms and at least one node representing a second term of the two or more query terms, wherein the two or more nodes each have an associated text for search term expansion and represent at least one concept in a semantic graph of nodes that represents a domain of semantically related concepts; program instructions to determine a center of focus within the semantic graph for the two or more nodes based, at least in part, on a spreading activation in the semantic graph; program instructions to determine a contextual relevance for the two or more nodes with respect to the center of focus based, at least in part, on an assessment of semantic similarity for the two or more nodes with respect to the center of focus; program instructions to select for a query term, which is included in the two or more query terms of the search expression, at least one node from the two or more nodes based, at least in part, on a contextual relevance between the at least one node and the determined center of focus; program instructions to generate an expanded search expression by expanding the search expression using an associated text of the at least one node; and program instructions to generate, by the search engine, an output of search results by executing a search using the expanded search expression. | 10. A computer system with a search engine, the computer system comprising: one or more computer processors; one or more computer readable storage medium; program instructions of the search engine stored on the computer readable storage medium for execution by at least one of the one or more processors, the program instructions comprising: program instructions to receive a search expression; program instructions to extract, using a search term extractor of the search engine, two or more query terms of the search expression; program instructions to determine two or more nodes representing a first term of the two or more query terms and at least one node representing a second term of the two or more query terms, wherein the two or more nodes each have an associated text for search term expansion and represent at least one concept in a semantic graph of nodes that represents a domain of semantically related concepts; program instructions to determine a center of focus within the semantic graph for the two or more nodes based, at least in part, on a spreading activation in the semantic graph; program instructions to determine a contextual relevance for the two or more nodes with respect to the center of focus based, at least in part, on an assessment of semantic similarity for the two or more nodes with respect to the center of focus; program instructions to select for a query term, which is included in the two or more query terms of the search expression, at least one node from the two or more nodes based, at least in part, on a contextual relevance between the at least one node and the determined center of focus; program instructions to generate an expanded search expression by expanding the search expression using an associated text of the at least one node; and program instructions to generate, by the search engine, an output of search results by executing a search using the expanded search expression. 15. The computer system according to claim 10 , the program instructions comprising: program instructions to build the graph using data from at least one of a structured data source and an unstructured data source. | 0.806159 |
9,304,744 | 9 | 13 | 9. A non-transitory computer-readable storage medium embodying a set of instructions, which when executed by one or more processors of one or more computer systems, cause the one or more processors to perform a method comprising: allowing software code associated with one or more of a plurality of a plurality of programming building blocks to be concurrently edited and executed within a programming environment, including, responsive to advancement of time or input by an end user of the programming environment, revising a current situation relating to the plurality of programming building blocks or revising the software code: receiving (i) information regarding the plurality of programming building blocks and (ii) information indicative of the current situation; and evaluating the plurality of programming building blocks based on the current situation; and responsive to said evaluating, facilitating detection of one or more logical errors in one or more of the plurality of programming building blocks by proactively providing real-time, human perceptible semantic feedback regarding those of the plurality of programming building blocks to which the current situation is relevant to the end user based on the evaluating, wherein the real-time, human perceptible semantic feedback comprises annotating one or more of the plurality of programming building blocks. | 9. A non-transitory computer-readable storage medium embodying a set of instructions, which when executed by one or more processors of one or more computer systems, cause the one or more processors to perform a method comprising: allowing software code associated with one or more of a plurality of a plurality of programming building blocks to be concurrently edited and executed within a programming environment, including, responsive to advancement of time or input by an end user of the programming environment, revising a current situation relating to the plurality of programming building blocks or revising the software code: receiving (i) information regarding the plurality of programming building blocks and (ii) information indicative of the current situation; and evaluating the plurality of programming building blocks based on the current situation; and responsive to said evaluating, facilitating detection of one or more logical errors in one or more of the plurality of programming building blocks by proactively providing real-time, human perceptible semantic feedback regarding those of the plurality of programming building blocks to which the current situation is relevant to the end user based on the evaluating, wherein the real-time, human perceptible semantic feedback comprises annotating one or more of the plurality of programming building blocks. 13. The non-transitory computer-readable storage medium of claim 9 , wherein the current situation includes data describing a collection of agents instantiated by an operational program. | 0.864431 |
9,978,259 | 7 | 12 | 7. A method of providing information related to state information to a user, the method comprising: determining, by circuitry of an information processing apparatus, at least one action of the user based on motion data received from a motion sensor, determining, by the circuitry, at least one event associated with text information, the text information being obtained from at least one of social media content and audio data, generating, by the circuitry, the state information of the user based on the at least one action and the at least one event, and providing, by the circuitry, the information related to the state information to the user, wherein the state information includes an attainment level indicating a current attainment level with respect to a goal, a current value related to a current state of the goal, which is acquired by the at least one action, and a comparison value obtained by comparing the current value related to the current state of the goal and a past value related to a past state of the goal, the comparison value being a value acquired from the at least one action. | 7. A method of providing information related to state information to a user, the method comprising: determining, by circuitry of an information processing apparatus, at least one action of the user based on motion data received from a motion sensor, determining, by the circuitry, at least one event associated with text information, the text information being obtained from at least one of social media content and audio data, generating, by the circuitry, the state information of the user based on the at least one action and the at least one event, and providing, by the circuitry, the information related to the state information to the user, wherein the state information includes an attainment level indicating a current attainment level with respect to a goal, a current value related to a current state of the goal, which is acquired by the at least one action, and a comparison value obtained by comparing the current value related to the current state of the goal and a past value related to a past state of the goal, the comparison value being a value acquired from the at least one action. 12. The method according to claim 7 , wherein the method further includes presenting, to the user, an action having an effect that is opposite to an effect of an action of high frequency among a plurality of actions that have previously provided negative contribution levels in a case where the attainment level is below a predetermined threshold. | 0.553985 |
9,218,417 | 10 | 13 | 10. A computer-readable storage device, having computer-executable instructions for integrating usage analytics with search results for a system, comprising: receiving an ad hoc query in a content management system; submitting the query to obtain search results from the system; obtaining search results from the system; integrating usage analytics with the search results, wherein the usage analytics comprise analysis of collected usage information from the system; determining a list comprising at least one refiner that reflects a best refinement candidate comprising at least one query property for filtering of the received ad hoc query, wherein determining the list comprises dynamically altering the at least one refiner based on the search results for a current ad hoc query in the usage analytics; and displaying the search results within a search results window, wherein displaying the search results comprises: displaying, in a first portion of the search results window, the at least one refiner and a number of the search results for at least one refiner in the list, and displaying, in a second portion of the search results window, a preview of the search results, the preview comprising a recommended search result corresponding to the at least one refiner. | 10. A computer-readable storage device, having computer-executable instructions for integrating usage analytics with search results for a system, comprising: receiving an ad hoc query in a content management system; submitting the query to obtain search results from the system; obtaining search results from the system; integrating usage analytics with the search results, wherein the usage analytics comprise analysis of collected usage information from the system; determining a list comprising at least one refiner that reflects a best refinement candidate comprising at least one query property for filtering of the received ad hoc query, wherein determining the list comprises dynamically altering the at least one refiner based on the search results for a current ad hoc query in the usage analytics; and displaying the search results within a search results window, wherein displaying the search results comprises: displaying, in a first portion of the search results window, the at least one refiner and a number of the search results for at least one refiner in the list, and displaying, in a second portion of the search results window, a preview of the search results, the preview comprising a recommended search result corresponding to the at least one refiner. 13. The computer-readable storage device of claim 10 , further comprising determining when a portion of the usage analytics are stored within a search index of the system. | 0.660714 |
9,412,392 | 49 | 50 | 49. The method of claim 47 , further comprising: determining whether the at least a portion of the recorded voice command includes specific keywords, wherein the stored contextual information includes contextual information of the electronic device associated with the specific keywords. | 49. The method of claim 47 , further comprising: determining whether the at least a portion of the recorded voice command includes specific keywords, wherein the stored contextual information includes contextual information of the electronic device associated with the specific keywords. 50. The method of claim 49 , wherein the stored contextual information includes only contextual information of the electronic device associated with the specific keywords. | 0.5 |
9,939,980 | 13 | 16 | 13. A non-transitory computer-readable medium having stored thereon computer executable instructions which, when executed by a computer, cause the computer to: receive user input for an application; analyze the user input to detect a stress level or a mood; determine, based at least in part on the stress level or the mood, to invoke a push notification; and present the push notification, wherein the push notification comprises at least one suggestion for phrasing a user input request for the application, and wherein the suggestion comprises feedback on how to fix an inaccurate interaction with the application. | 13. A non-transitory computer-readable medium having stored thereon computer executable instructions which, when executed by a computer, cause the computer to: receive user input for an application; analyze the user input to detect a stress level or a mood; determine, based at least in part on the stress level or the mood, to invoke a push notification; and present the push notification, wherein the push notification comprises at least one suggestion for phrasing a user input request for the application, and wherein the suggestion comprises feedback on how to fix an inaccurate interaction with the application. 16. The non-transitory computer-readable medium of claim 13 , wherein the instructions that cause the computer to present the push notification comprise instructions that cause the computer to display the push notification in a hints panel. | 0.5 |
8,219,552 | 16 | 18 | 16. A method of searching and merging search results across heterogeneous indices, comprising: identifying a query from a user; splitting the query into sub-queries; calculating information content for each of the sub-queries, said information content representing information requirements of the user; executing each of the sub-queries by searching across heterogeneous indices, including structured, unstructured and semi-structured data sources, to obtain a multitude of search results; combining the search results based on the information content calculated for the sub-queries; wherein: the executing each of the sub-queries includes identifying a multitude of entities for at least one of the sub-queries, and executing each of the sub-queries in a respective one of a plurality of heterogeneous indices; said sub-queries include a first sub-query and a second sub-query; the executing each of the sub-queries includes executing the first sub-query to identify a plurality of first class entities, and executing the second sub-query to identify a multitude of second class entities, each of the second class entities being associated, according to a defined criteria, with a respective single first class entity; the combining includes clustering the second class entities into a plurality of clusters based on the first class entity to which each of the second class entities belongs, and assigning a relevance score to each of the clusters; the combining includes determining an importance value for each of the first class entities; and the assigning includes assigning a relevance score to each of the clusters based on the importance value of the first class entity with which the second class entities of said each cluster are associated. | 16. A method of searching and merging search results across heterogeneous indices, comprising: identifying a query from a user; splitting the query into sub-queries; calculating information content for each of the sub-queries, said information content representing information requirements of the user; executing each of the sub-queries by searching across heterogeneous indices, including structured, unstructured and semi-structured data sources, to obtain a multitude of search results; combining the search results based on the information content calculated for the sub-queries; wherein: the executing each of the sub-queries includes identifying a multitude of entities for at least one of the sub-queries, and executing each of the sub-queries in a respective one of a plurality of heterogeneous indices; said sub-queries include a first sub-query and a second sub-query; the executing each of the sub-queries includes executing the first sub-query to identify a plurality of first class entities, and executing the second sub-query to identify a multitude of second class entities, each of the second class entities being associated, according to a defined criteria, with a respective single first class entity; the combining includes clustering the second class entities into a plurality of clusters based on the first class entity to which each of the second class entities belongs, and assigning a relevance score to each of the clusters; the combining includes determining an importance value for each of the first class entities; and the assigning includes assigning a relevance score to each of the clusters based on the importance value of the first class entity with which the second class entities of said each cluster are associated. 18. The method according to claim 16 , wherein: the combining includes grouping said multitude of search results into a plurality of clusters, and computing the relevance score for each of said clusters based on relevance scores of the search results which form the cluster. | 0.5 |
9,508,338 | 1 | 2 | 1. A computer-implemented method of generating speech including audible breath sounds, the method comprising: receiving input text for text-to-speech (TTS) processing; identifying punctuation in the input text; determining a first location in the input text for insertion of a breath sound based at least in part on the punctuation; determining a second location in the input text for insertion of a breath sound based at least in part on the punctuation; determining a linguistic distance between the first location and second location; using a cost function to identify a first breath unit for the first location, the cost function based at least in part on the identified punctuation, the linguistic distance between the first location and second location, and a linguistic context of the first location; using the cost function to identify a second breath unit for the second location, the cost function based at least in part on the identified punctuation, the linguistic distance between the first location and second location, and a linguistic context of the second location; and synthesizing speech corresponding to the input text, wherein the synthesized speech comprises a first breath sound corresponding to the first breath unit at the first location and a second breath sound corresponding to the second breath unit at the second location. | 1. A computer-implemented method of generating speech including audible breath sounds, the method comprising: receiving input text for text-to-speech (TTS) processing; identifying punctuation in the input text; determining a first location in the input text for insertion of a breath sound based at least in part on the punctuation; determining a second location in the input text for insertion of a breath sound based at least in part on the punctuation; determining a linguistic distance between the first location and second location; using a cost function to identify a first breath unit for the first location, the cost function based at least in part on the identified punctuation, the linguistic distance between the first location and second location, and a linguistic context of the first location; using the cost function to identify a second breath unit for the second location, the cost function based at least in part on the identified punctuation, the linguistic distance between the first location and second location, and a linguistic context of the second location; and synthesizing speech corresponding to the input text, wherein the synthesized speech comprises a first breath sound corresponding to the first breath unit at the first location and a second breath sound corresponding to the second breath unit at the second location. 2. The computer-implemented method of claim 1 , further comprising identifying an intonational phrase in the input text, wherein: the first location occurs at a beginning of the intontational phrase; the second location occurs at an end of the intonational phrase; using the cost function to identify the first breath unit is further based at least in part on linguistic features of the intonational phrase; and using the cost function to identify the second breath unit is further based at least in part on the linguistic features of the intonational phrase. | 0.5 |
8,560,941 | 1 | 2 | 1. A method being performed on a computer processor, said method comprising: receiving a schema comprising a first configurable parameter and a first attribute for said first configurable parameter; receiving a rule template comprising a rule for said configurable parameter, said rule comprising a limit for said configurable parameter; selecting a user interface tool based on said rule template, said user interface tool having a first limiting value; creating a data object for said first configurable parameter; causing said user interface tool to be displayed on a user interface; binding said data object to said user interface tool; receiving a data value from said user interface; storing said data value in said data object; identifying a rule type based on a second configurable parameter defined in said schema; selecting a predefined generic rule based on said rule type from a rule library, said rule library comprising a plurality of generic rules, said plurality of generic rules comprising a references to a second user interface tool; creating a second data object for said second configurable parameter; binding said second data object to said second user interface tool; and displaying said second user interface tool. | 1. A method being performed on a computer processor, said method comprising: receiving a schema comprising a first configurable parameter and a first attribute for said first configurable parameter; receiving a rule template comprising a rule for said configurable parameter, said rule comprising a limit for said configurable parameter; selecting a user interface tool based on said rule template, said user interface tool having a first limiting value; creating a data object for said first configurable parameter; causing said user interface tool to be displayed on a user interface; binding said data object to said user interface tool; receiving a data value from said user interface; storing said data value in said data object; identifying a rule type based on a second configurable parameter defined in said schema; selecting a predefined generic rule based on said rule type from a rule library, said rule library comprising a plurality of generic rules, said plurality of generic rules comprising a references to a second user interface tool; creating a second data object for said second configurable parameter; binding said second data object to said second user interface tool; and displaying said second user interface tool. 2. The method of claim 1 , said first limiting value being defined in said rule. | 0.835391 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.