patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|---|---|---|
9,691,376 | 1 | 2 | 1. A method comprising: synthesizing speech from a text; identifying an acoustic unit sequential pair in the speech; searching for a concatenation cost for the acoustic unit sequential pair in a database using a hash table for the database; and when the concatenation cost is not found in the database, assigning a default value as the concatenation cost for the acoustic unit sequential pair. | 1. A method comprising: synthesizing speech from a text; identifying an acoustic unit sequential pair in the speech; searching for a concatenation cost for the acoustic unit sequential pair in a database using a hash table for the database; and when the concatenation cost is not found in the database, assigning a default value as the concatenation cost for the acoustic unit sequential pair. 2. The method of claim 1 , further comprising synthesizing future speech using the default value as the concatenation cost. | 0.642442 |
10,049,153 | 1 | 6 | 1. A method, in an information handling system comprising a processor and a memory, of dynamically prioritizing questions for response processing based on extracted question parameters, the method comprising: receiving, by the information handling system, a plurality of questions; extracting, by the information handling system, a plurality of question priority parameters comprising one or more question topics and a plurality of question context parameters for each question; identifying, by the information handling system, system performance parameters for the information handling system comprising processor utilization data, available memory space data, and bandwidth utilization data; determining, by the information handling system, a target priority value for each question based on the system performance parameters and the plurality of question priority parameters identified for said question; dynamically prioritizing, by the information handling system, response processing of the plurality of questions by comparing the target priority values for each of the plurality of questions to generate a prioritized plurality of questions; storing, by a prioritization manager subsystem of the information handling system, the prioritized plurality of questions in a question queue at the information handling system which is configured to support asynchronous delivery of the prioritized plurality of questions; and passing the prioritized plurality of questions as messages between one or more question answering systems such that the prioritization manager subsystem and the one or more question answering systems do not need to interact with the question queue at the same time. | 1. A method, in an information handling system comprising a processor and a memory, of dynamically prioritizing questions for response processing based on extracted question parameters, the method comprising: receiving, by the information handling system, a plurality of questions; extracting, by the information handling system, a plurality of question priority parameters comprising one or more question topics and a plurality of question context parameters for each question; identifying, by the information handling system, system performance parameters for the information handling system comprising processor utilization data, available memory space data, and bandwidth utilization data; determining, by the information handling system, a target priority value for each question based on the system performance parameters and the plurality of question priority parameters identified for said question; dynamically prioritizing, by the information handling system, response processing of the plurality of questions by comparing the target priority values for each of the plurality of questions to generate a prioritized plurality of questions; storing, by a prioritization manager subsystem of the information handling system, the prioritized plurality of questions in a question queue at the information handling system which is configured to support asynchronous delivery of the prioritized plurality of questions; and passing the prioritized plurality of questions as messages between one or more question answering systems such that the prioritization manager subsystem and the one or more question answering systems do not need to interact with the question queue at the same time. 6. The method of claim 1 , further comprising quantifying, by the information handling system, one or more priority attribute features for each question based on the system performance parameters to indicate operational performance-related data for the information handling system. | 0.689159 |
10,007,662 | 1 | 33 | 1. A method of sequence recognition, comprising the steps of: receiving an input sequence; converting the input sequence to an input sequence SSM Sequence Model (SSM) Matrix; comparing the input sequence SSM Matrix to a plurality of known SSM Matrices representing a plurality of known sequences; matching the input sequence to the known sequence based on the step of comparing. | 1. A method of sequence recognition, comprising the steps of: receiving an input sequence; converting the input sequence to an input sequence SSM Sequence Model (SSM) Matrix; comparing the input sequence SSM Matrix to a plurality of known SSM Matrices representing a plurality of known sequences; matching the input sequence to the known sequence based on the step of comparing. 33. The method of claim 1 , wherein the step of converting comprises the steps of: counting all open trigrams for the input sequence; forming the input sequence SSM Matrix as a three dimensional SSM Matrix from the open trigrams. | 0.848945 |
8,311,835 | 10 | 16 | 10. A computer implemented method for performing recognition and/or audible prompting on a client device in a client/server system, the method comprising: generating client-side markups having recognition and audible prompting at a web server for execution on a client having recognition capabilities; providing controls, organized in collections, for generating the client side markups at the web server, wherein the providing controls includes setting values to properties associated with the controls according to speech controls inheritance, wherein the providing controls for the web server includes providing companion controls associated with corresponding primary controls and including a semantic map to provide recognition and audible prompting; obtaining information pertaining to a plurality of topics using a dialog constructed from the controls, each collection of controls configured to create a separate dialog associated with a separate topic; providing speech recognition processing to received voice data at a recognition server based on a grammar or language model provided with the received voice data to produce speech recognition results; providing the speech recognition results to the web server; processing voice data at a telephone voice browser; providing semantic items for the semantic map; forming an association between a visual domain of the primary controls and a non-visual recognition domain of the companion controls using the semantic items; providing at least one question for the dialog via a prompt object; providing at least one answer; providing a grammar object to define a grammar for recognition of input data and related processing on the input; and providing an answer property associating a recognized result with a semantic item in the semantic map. | 10. A computer implemented method for performing recognition and/or audible prompting on a client device in a client/server system, the method comprising: generating client-side markups having recognition and audible prompting at a web server for execution on a client having recognition capabilities; providing controls, organized in collections, for generating the client side markups at the web server, wherein the providing controls includes setting values to properties associated with the controls according to speech controls inheritance, wherein the providing controls for the web server includes providing companion controls associated with corresponding primary controls and including a semantic map to provide recognition and audible prompting; obtaining information pertaining to a plurality of topics using a dialog constructed from the controls, each collection of controls configured to create a separate dialog associated with a separate topic; providing speech recognition processing to received voice data at a recognition server based on a grammar or language model provided with the received voice data to produce speech recognition results; providing the speech recognition results to the web server; processing voice data at a telephone voice browser; providing semantic items for the semantic map; forming an association between a visual domain of the primary controls and a non-visual recognition domain of the companion controls using the semantic items; providing at least one question for the dialog via a prompt object; providing at least one answer; providing a grammar object to define a grammar for recognition of input data and related processing on the input; and providing an answer property associating a recognized result with a semantic item in the semantic map. 16. The computer implemented method of claim 10 further comprising associating the recognized input with one of the primary controls and, when input is received through a graphical user interface, replicating the received input in a corresponding semantic item and setting status information for the input as being confirmed via a companion control. | 0.809706 |
9,268,822 | 1 | 8 | 1. A method for operating a database to determine an organizational hierarchy from contact data, the database being configured to store the contact data as a plurality of contact records, each contact record having a defined set of entities, including at least a name and a title, comprising: receiving contact data at the database including a phrase representing a title, the phrase having a plurality of terms; converting each term of the phrase to lower case; concatenating the plurality of converted terms using a symbol to separate the terms thereby forming a normalized phrase, then setting a test phrase equal to the normalized phrase; generating one or more sets of defined phrases; and comparing the test phrase to the sets of defined phrases, the sets of defined phrases representing known titles and stored in one or more lookup table as normalized phrases, each of the lookup table including organizational hierarchy information corresponding to each known title and a rank and a weight associated with the organizational hierarchy information; wherein, if the test phrase matches a first phrase in the set of defined phrases, a contact record for the received contact data is updated to include the organizational hierarchy information and the rank and weight corresponding with the matching first phrase in the lookup table; and wherein, if the test phrase does not match any phrase in the set of defined phrases, the test phrase is shortened by removing a term, and the comparison step is repeated with the shortened test phrase. | 1. A method for operating a database to determine an organizational hierarchy from contact data, the database being configured to store the contact data as a plurality of contact records, each contact record having a defined set of entities, including at least a name and a title, comprising: receiving contact data at the database including a phrase representing a title, the phrase having a plurality of terms; converting each term of the phrase to lower case; concatenating the plurality of converted terms using a symbol to separate the terms thereby forming a normalized phrase, then setting a test phrase equal to the normalized phrase; generating one or more sets of defined phrases; and comparing the test phrase to the sets of defined phrases, the sets of defined phrases representing known titles and stored in one or more lookup table as normalized phrases, each of the lookup table including organizational hierarchy information corresponding to each known title and a rank and a weight associated with the organizational hierarchy information; wherein, if the test phrase matches a first phrase in the set of defined phrases, a contact record for the received contact data is updated to include the organizational hierarchy information and the rank and weight corresponding with the matching first phrase in the lookup table; and wherein, if the test phrase does not match any phrase in the set of defined phrases, the test phrase is shortened by removing a term, and the comparison step is repeated with the shortened test phrase. 8. The method of claim 1 , the step of updating the contact record further comprising creating or updating the contact record. | 0.582781 |
9,039,572 | 1 | 14 | 1. An apparatus comprising: a processor; and a memory storing instructions that, when executed by the processor, cause the apparatus at least to perform operations comprising: processing input specifying a plurality of athletic activities; processing input specifying a heart rate threshold for a particular one of the activities; generating an electronic training script including the heart rate threshold for the particular activity and defining a sequence in which to perform the plurality of activities; measuring a physiological characteristic of a user during the plurality of athletic activities; and prompting the user to perform a next activity in the sequence based on a measurement of the physiological characteristic indicating completion of a previous activity in the sequence. | 1. An apparatus comprising: a processor; and a memory storing instructions that, when executed by the processor, cause the apparatus at least to perform operations comprising: processing input specifying a plurality of athletic activities; processing input specifying a heart rate threshold for a particular one of the activities; generating an electronic training script including the heart rate threshold for the particular activity and defining a sequence in which to perform the plurality of activities; measuring a physiological characteristic of a user during the plurality of athletic activities; and prompting the user to perform a next activity in the sequence based on a measurement of the physiological characteristic indicating completion of a previous activity in the sequence. 14. The apparatus recited in claim 1 , wherein the prompting of the user comprises presenting an instruction to rest for a predetermined period of time. | 0.755627 |
8,099,278 | 9 | 12 | 9. The device of claim 1 , wherein the one or more processors are further configured to: receive a request for age verification from a service provider; and provide the query to the user in response to the request. | 9. The device of claim 1 , wherein the one or more processors are further configured to: receive a request for age verification from a service provider; and provide the query to the user in response to the request. 12. The device of claim 9 , wherein the one or more processors are further configured to transmit the likely age range associated with the user to the service provider. | 0.5 |
9,864,808 | 1 | 7 | 1. A computer-implemented method of identifying search results based on entity-based knowledge, the method comprising: enumerating one or more entities that may match entities in a search query that includes at least one entity; identifying, as a potential target of the search query, one or more potentially matching entities from the enumerated entities; ranking the identified potentially matching entities so as to distinguish a relative level of match between each identified potential target and the entities included in the search query; selecting one or more of the identified potentially matching entities as matching entities for an entity-based search; performing an entity-based search that narrows results by applying one or more of top ranked, selected ones of the identified potentially matching entities; ranking the results of the entity-based search to yield results ordered by relevance to the search query, by (i) identifying a first group of one or more results each without an entity identifier; (ii) identifying a second group of one or more results, different from the first group, each with an entity identifier; and (iii) comparing members of the first group with members of the second group, and then (iv) grouping results by entities with which the results are associated; and providing ranked results to a display device, in response to the search query. | 1. A computer-implemented method of identifying search results based on entity-based knowledge, the method comprising: enumerating one or more entities that may match entities in a search query that includes at least one entity; identifying, as a potential target of the search query, one or more potentially matching entities from the enumerated entities; ranking the identified potentially matching entities so as to distinguish a relative level of match between each identified potential target and the entities included in the search query; selecting one or more of the identified potentially matching entities as matching entities for an entity-based search; performing an entity-based search that narrows results by applying one or more of top ranked, selected ones of the identified potentially matching entities; ranking the results of the entity-based search to yield results ordered by relevance to the search query, by (i) identifying a first group of one or more results each without an entity identifier; (ii) identifying a second group of one or more results, different from the first group, each with an entity identifier; and (iii) comparing members of the first group with members of the second group, and then (iv) grouping results by entities with which the results are associated; and providing ranked results to a display device, in response to the search query. 7. The method of claim 1 , wherein the selecting comprises receiving a disambiguating input from a user. | 0.805243 |
9,111,456 | 12 | 17 | 12. A method comprising: logging a test taker into an online testing platform prior to beginning an online test; using a web browser in association with a computing facility; placing the test taker in a virtual waiting room following the login; sending a signal to a proctor interface that the test taker has logged in and is waiting; presenting the test taker a practice test question while in the virtual waiting room; polling the web browser to obtain data relating to a performance criterion of the test taker in association with the practice test question; analyzing the data in association with a performance rule; and determining a preparedness level of the test taker to take a test based at least in part on a result of the analysis. | 12. A method comprising: logging a test taker into an online testing platform prior to beginning an online test; using a web browser in association with a computing facility; placing the test taker in a virtual waiting room following the login; sending a signal to a proctor interface that the test taker has logged in and is waiting; presenting the test taker a practice test question while in the virtual waiting room; polling the web browser to obtain data relating to a performance criterion of the test taker in association with the practice test question; analyzing the data in association with a performance rule; and determining a preparedness level of the test taker to take a test based at least in part on a result of the analysis. 17. The method of claim 12 , wherein the test taker's testing environment comprises a font size or a volume. | 0.674699 |
8,269,722 | 1 | 2 | 1. A gesture recognition system, comprising: an image pick-up device, for capturing an image data containing a hand image; a template database, for recording multiple gesture templates representing different gestures, wherein the gesture templates are classified by angles and are respectively stored in gesture template libraries of different angle classes; a processor, for communicating with the image pick-up device and obtaining the image data, finding out a skin part from the image data, producing a skin edge by using an edge detection means, and then classifying the skin edge into multiple edge parts of different angle classes according to angles of the skin edge; an operation engine, having multiple parallel operation units respectively for performing template matching at different angles, wherein the edge parts of different angle classes are respectively sent to different parallel operation units for template matching, so as to find out the gesture templates most resembling the edge parts in the corresponding gesture template libraries of different angle classes; an optimal template selection means, for further selecting an optimal gesture template from the resembling gesture templates found out by the parallel operation units; and a display terminal, for displaying a gesture image represented by the optimal gesture template. | 1. A gesture recognition system, comprising: an image pick-up device, for capturing an image data containing a hand image; a template database, for recording multiple gesture templates representing different gestures, wherein the gesture templates are classified by angles and are respectively stored in gesture template libraries of different angle classes; a processor, for communicating with the image pick-up device and obtaining the image data, finding out a skin part from the image data, producing a skin edge by using an edge detection means, and then classifying the skin edge into multiple edge parts of different angle classes according to angles of the skin edge; an operation engine, having multiple parallel operation units respectively for performing template matching at different angles, wherein the edge parts of different angle classes are respectively sent to different parallel operation units for template matching, so as to find out the gesture templates most resembling the edge parts in the corresponding gesture template libraries of different angle classes; an optimal template selection means, for further selecting an optimal gesture template from the resembling gesture templates found out by the parallel operation units; and a display terminal, for displaying a gesture image represented by the optimal gesture template. 2. The gesture recognition system according to claim 1 , wherein the image data is a color image. | 0.949374 |
7,657,515 | 1 | 7 | 1. A computer-implemented document search method comprising, by execution of program instructions by a computer system that comprises one or more computing devices: in response to receiving a query including first and second lists of query terms, logically combining terms from the first and second lists to form document search sub-queries, each sub-query comprising at least one term from the first list and at least one term from the second list; searching a data store by executing the sub-queries such that at least two of the document search sub-queries are executed in parallel, to identify responsive documents; obtaining results from executing the document search sub-queries, the results including location information identifying the location of any of the terms from the first and second lists in the responsive documents; combining the results from all sub-queries to form a single query result that includes the location information; and returning the query result. | 1. A computer-implemented document search method comprising, by execution of program instructions by a computer system that comprises one or more computing devices: in response to receiving a query including first and second lists of query terms, logically combining terms from the first and second lists to form document search sub-queries, each sub-query comprising at least one term from the first list and at least one term from the second list; searching a data store by executing the sub-queries such that at least two of the document search sub-queries are executed in parallel, to identify responsive documents; obtaining results from executing the document search sub-queries, the results including location information identifying the location of any of the terms from the first and second lists in the responsive documents; combining the results from all sub-queries to form a single query result that includes the location information; and returning the query result. 7. The method of claim 1 , wherein the first list includes more than a thousand terms. | 0.778351 |
7,849,186 | 27 | 28 | 27. The system according to claim 26 , wherein said packet arrival similarity evaluation module is adapted to obtain the data in respect of the packet arrival times associated with a real-time conversational media session directly from a bit-stream associated with the real-time conversational media session. | 27. The system according to claim 26 , wherein said packet arrival similarity evaluation module is adapted to obtain the data in respect of the packet arrival times associated with a real-time conversational media session directly from a bit-stream associated with the real-time conversational media session. 28. The system according to claim 27 , wherein the data in respect of the packet arrival times includes one or more of the following: packet inter-arrival times and packet sizes. | 0.5 |
7,908,125 | 1 | 10 | 1. A computer-readable storage medium having computer-readable program instructions embedded therein for directing operation of a computer system, wherein the computer-readable program instructions, when executed by a processor on the computer system, enable the computing system implement a data processing system, that comprises: a model service system receiving, as an input, an object model description, indicative of a first object model that represents business data, and generating a dimensional model based on the input; an entity generator generating a second object model based on the dimensional model, the second object model representing business data represented by the dimensional model; a navigation service identifying a data navigation path from relationships between individual sets of data that comprise the business data, and outputting the data navigation path for navigation by a user from a first data set to a related second data set wherein the navigation service comprises: a plurality of navigation providers each associated with a specific type of navigation; a navigation service layer transmitting a navigation service request to one or more of the navigation providers that are registered with the navigation service layer; and a metadata service providing the plurality of navigation providers with access to a metadata store, each navigation provider responding to a received data navigation request by interacting with the metadata service to identify at least one data navigation path and returning the at least one identified data navigation path to the navigation service layer for output to the user; and a computer processor being a functional component of the data processing system and activated by the model service system, the entity generator and the navigation service to facilitate receiving the object model, generating the second object model and identifying the navigation path. | 1. A computer-readable storage medium having computer-readable program instructions embedded therein for directing operation of a computer system, wherein the computer-readable program instructions, when executed by a processor on the computer system, enable the computing system implement a data processing system, that comprises: a model service system receiving, as an input, an object model description, indicative of a first object model that represents business data, and generating a dimensional model based on the input; an entity generator generating a second object model based on the dimensional model, the second object model representing business data represented by the dimensional model; a navigation service identifying a data navigation path from relationships between individual sets of data that comprise the business data, and outputting the data navigation path for navigation by a user from a first data set to a related second data set wherein the navigation service comprises: a plurality of navigation providers each associated with a specific type of navigation; a navigation service layer transmitting a navigation service request to one or more of the navigation providers that are registered with the navigation service layer; and a metadata service providing the plurality of navigation providers with access to a metadata store, each navigation provider responding to a received data navigation request by interacting with the metadata service to identify at least one data navigation path and returning the at least one identified data navigation path to the navigation service layer for output to the user; and a computer processor being a functional component of the data processing system and activated by the model service system, the entity generator and the navigation service to facilitate receiving the object model, generating the second object model and identifying the navigation path. 10. The computer-readable storage medium of claim 1 wherein at least one of the plurality of navigation providers is associated with navigation between two data units that share a dimension. | 0.832155 |
9,330,422 | 10 | 11 | 10. A method comprising: querying historical linguistic data sets of exchanges between customers and customer relations representatives over social media; extracting conversations from the historical linguistic data sets between said customers and said customer relations representatives; wherein extracting conversations uses a customer relations representative identifier and extracts all messages sent by said customer relations representative identifier or to said customer relations representative identifier; wherein said messages are grouped by a customer using a customer associated identifier; ordering chronologically a list of all said messages by said customer associated identifier; extracting from the list of all said messages groups of messages, wherein each group of messages is related to an individual subject; aggregating said groups of messages into pseudo synchronous conversations; separating each pseudo synchronous conversation of the pseudo synchronous conversations into one or more segments and associating one or more classes to each of the one or more segments; labeling each segment in said each pseudo synchronous conversation according to conversation analysis; and, computing engagement metrics from said labels of each said segment, wherein said engagement metrics are selected from the group consisting of: resolution rate, properly handled threads rate, customer hang-up, conversion rate, and happy customer rate. | 10. A method comprising: querying historical linguistic data sets of exchanges between customers and customer relations representatives over social media; extracting conversations from the historical linguistic data sets between said customers and said customer relations representatives; wherein extracting conversations uses a customer relations representative identifier and extracts all messages sent by said customer relations representative identifier or to said customer relations representative identifier; wherein said messages are grouped by a customer using a customer associated identifier; ordering chronologically a list of all said messages by said customer associated identifier; extracting from the list of all said messages groups of messages, wherein each group of messages is related to an individual subject; aggregating said groups of messages into pseudo synchronous conversations; separating each pseudo synchronous conversation of the pseudo synchronous conversations into one or more segments and associating one or more classes to each of the one or more segments; labeling each segment in said each pseudo synchronous conversation according to conversation analysis; and, computing engagement metrics from said labels of each said segment, wherein said engagement metrics are selected from the group consisting of: resolution rate, properly handled threads rate, customer hang-up, conversion rate, and happy customer rate. 11. The method of claim 10 , wherein said data sets are asynchronous and decentralized. | 0.835227 |
9,483,643 | 9 | 16 | 9. A system for creating behavioral signatures used to detect malware, the system comprising: a database module, stored in memory, that maintains a database that identifies: known malicious files and behaviors exhibited by the known malicious files; known non-malicious files and behaviors exhibited by the known non-malicious files; a signature module, stored in memory, that creates a behavioral signature used to detect malware by: determining a combination of behaviors exhibited by at least one of the known malicious files identified within the database; identifying the number of known malicious files that exhibit each behavior within the combination of behaviors; identifying the number of known non-malicious files that exhibit each behavior within the combination of behaviors; determining that the number of known malicious files that exhibit each behavior within the combination exceeds the number of known non-malicious files that exhibit each behavior within the combination by a certain threshold; incorporating representations of each behavior within the combination of behaviors into the behavioral signature; at least one physical processor configured to execute the database module and the signature module. | 9. A system for creating behavioral signatures used to detect malware, the system comprising: a database module, stored in memory, that maintains a database that identifies: known malicious files and behaviors exhibited by the known malicious files; known non-malicious files and behaviors exhibited by the known non-malicious files; a signature module, stored in memory, that creates a behavioral signature used to detect malware by: determining a combination of behaviors exhibited by at least one of the known malicious files identified within the database; identifying the number of known malicious files that exhibit each behavior within the combination of behaviors; identifying the number of known non-malicious files that exhibit each behavior within the combination of behaviors; determining that the number of known malicious files that exhibit each behavior within the combination exceeds the number of known non-malicious files that exhibit each behavior within the combination by a certain threshold; incorporating representations of each behavior within the combination of behaviors into the behavioral signature; at least one physical processor configured to execute the database module and the signature module. 16. The system of claim 9 , wherein the signature module further creates a behavioral signature used to detect non-malicious files by: determining an additional combination of behaviors exhibited by at least one of the known non-malicious files identified within the database; identifying the number of known non-malicious files that exhibit each behavior within the additional combination of behaviors; identifying the number of known malicious files that exhibit each behavior within the additional combination of behaviors; determining that the number of known non-malicious files that exhibit each behavior within the additional combination exceeds the number of known malicious files that exhibit each behavior within the additional combination by another threshold. | 0.5 |
10,102,848 | 1 | 10 | 1. A computer system comprising: one or more computing devices; a hotword manager, on the one or more computing devices, configured to maintain, for each hotword of a plurality of hotwords, information that maps a unique identifier of the hotword to a visual representation of the hotword, wherein the visual representation of a first hotword of the plurality of hotwords is visually different from the visual representation of a second hotword of the plurality of hotwords; a hotword detection module, on the one or more computing devices, configured to listen for spoken input and to detect instances of spoken input that correspond to particular ones of the plurality of hotwords; and a browsing application, on the one or more computing devices, configured to: (i) receive code for an electronic document, the code including a hotword instruction that is dedicated to activating, in a presentation of the electronic document, a hotword detection capability for a particular hotword of the plurality of hotwords identified by the hotword instruction, (ii) identify the hotword instruction in the code for the electronic document, (iii) generate the presentation of the electronic document, including as a result of the hotword instruction identifying the particular hotword in the code for the electronic document: (a) activating the hotword detection capability for the particular hotword including enabling the computer system to respond to instances of spoken input that correspond to the particular hotword, and (b) selecting the visual representation of the particular hotword for display in the presentation of the electronic document, so as to indicate that the computer system is configured to respond to instances of spoken input that correspond to the particular hotword, wherein the browsing application obtains the visual representation of the particular hotword from the hotword manager using the unique identifier of the particular hotword, and (iv) perform, in response to identifying spoken input that corresponds to the particular hotword during presentation of the electronic document, a set of operations assigned to the particular hotword. | 1. A computer system comprising: one or more computing devices; a hotword manager, on the one or more computing devices, configured to maintain, for each hotword of a plurality of hotwords, information that maps a unique identifier of the hotword to a visual representation of the hotword, wherein the visual representation of a first hotword of the plurality of hotwords is visually different from the visual representation of a second hotword of the plurality of hotwords; a hotword detection module, on the one or more computing devices, configured to listen for spoken input and to detect instances of spoken input that correspond to particular ones of the plurality of hotwords; and a browsing application, on the one or more computing devices, configured to: (i) receive code for an electronic document, the code including a hotword instruction that is dedicated to activating, in a presentation of the electronic document, a hotword detection capability for a particular hotword of the plurality of hotwords identified by the hotword instruction, (ii) identify the hotword instruction in the code for the electronic document, (iii) generate the presentation of the electronic document, including as a result of the hotword instruction identifying the particular hotword in the code for the electronic document: (a) activating the hotword detection capability for the particular hotword including enabling the computer system to respond to instances of spoken input that correspond to the particular hotword, and (b) selecting the visual representation of the particular hotword for display in the presentation of the electronic document, so as to indicate that the computer system is configured to respond to instances of spoken input that correspond to the particular hotword, wherein the browsing application obtains the visual representation of the particular hotword from the hotword manager using the unique identifier of the particular hotword, and (iv) perform, in response to identifying spoken input that corresponds to the particular hotword during presentation of the electronic document, a set of operations assigned to the particular hotword. 10. The computer system of claim 1 , wherein the browsing application is configured to visually distinguish the visual representation of the particular hotword in the presentation of the electronic document from other content shown in the presentation of the electronic document. | 0.715886 |
8,753,125 | 4 | 5 | 4. The game apparatus of claim 1 wherein a plurality of sets of lists of words are provided, each set corresponding to a different level of difficulty for sentence construction. | 4. The game apparatus of claim 1 wherein a plurality of sets of lists of words are provided, each set corresponding to a different level of difficulty for sentence construction. 5. The game apparatus of claim 4 comprising twelve levels of difficulty for sentence construction. | 0.5 |
7,869,988 | 18 | 25 | 18. A system, comprising: an entertainment module configured to deliver a video presentation to a display device to simultaneously display the video presentation to a plurality of users, the entertainment module configured to deliver a plurality of mixed known language-foreign language streams to a plurality of output devices configured to simultaneously deliver the plurality of mixed known language-foreign language streams to the plurality of users, the plurality of mixed known language-foreign language streams including a first mixed known language-foreign language stream having a grammar syntax associated with a known language and a second mixed known language-foreign language stream having a grammar syntax associated with a foreign language, each of the plurality of mixed known language-foreign language streams corresponding to the video presentation, the entertainment module configured to selectively deliver one of the first mixed known language-foreign language stream or the second mixed known language-foreign language stream to an output device from the plurality of output devices associated with a user based, at least in part, on a proficiency level of the user associated with the foreign language. | 18. A system, comprising: an entertainment module configured to deliver a video presentation to a display device to simultaneously display the video presentation to a plurality of users, the entertainment module configured to deliver a plurality of mixed known language-foreign language streams to a plurality of output devices configured to simultaneously deliver the plurality of mixed known language-foreign language streams to the plurality of users, the plurality of mixed known language-foreign language streams including a first mixed known language-foreign language stream having a grammar syntax associated with a known language and a second mixed known language-foreign language stream having a grammar syntax associated with a foreign language, each of the plurality of mixed known language-foreign language streams corresponding to the video presentation, the entertainment module configured to selectively deliver one of the first mixed known language-foreign language stream or the second mixed known language-foreign language stream to an output device from the plurality of output devices associated with a user based, at least in part, on a proficiency level of the user associated with the foreign language. 25. The system of claim 18 , wherein the entertainment module is configured to produce dynamically the first known language-foreign language stream based on individualized proficiency data associated with the first user, the second known language-foreign language stream being one of a plurality of predefined known language-foreign language streams. | 0.676525 |
10,019,989 | 14 | 17 | 14. A non-transitory computer storage medium encoded with a computer program, the computer program comprising instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising: transmitting a virtual communication session in substantially real-time to the plurality of end user devices; receiving, by one or more processors, a combined media stream comprising a plurality of media sub-streams each associated with one of the plurality of end user devices, wherein each of the plurality of media sub-streams in the combined media stream comprises a respective video component and a respective audio component; for each of the plurality of media sub-streams, separating, by the one or more processors, the respective audio component from the respective video component; for each separate audio component, transcribing, by the one or more processors, at least a portion of speech from the audio component to text; providing a transcription in substantially real-time; and annotating the text for the audio component of each respective media sub-stream to include additional content, wherein annotating the text comprises: determining one or more keywords of the text; selecting, based on the one or more keywords, one or more advertisements or a link; and updating the transcription with the one or more advertisements or the link in association with at least a portion of the text. | 14. A non-transitory computer storage medium encoded with a computer program, the computer program comprising instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising: transmitting a virtual communication session in substantially real-time to the plurality of end user devices; receiving, by one or more processors, a combined media stream comprising a plurality of media sub-streams each associated with one of the plurality of end user devices, wherein each of the plurality of media sub-streams in the combined media stream comprises a respective video component and a respective audio component; for each of the plurality of media sub-streams, separating, by the one or more processors, the respective audio component from the respective video component; for each separate audio component, transcribing, by the one or more processors, at least a portion of speech from the audio component to text; providing a transcription in substantially real-time; and annotating the text for the audio component of each respective media sub-stream to include additional content, wherein annotating the text comprises: determining one or more keywords of the text; selecting, based on the one or more keywords, one or more advertisements or a link; and updating the transcription with the one or more advertisements or the link in association with at least a portion of the text. 17. The computer storage medium of claim 14 , wherein annotating the text for the audio component of each respective media sub-stream to include additional content further comprises: selecting, based on the one or more keywords, one or more hyperlinks; and inserting at least one of the one or more hyperlinks into the text. | 0.5 |
8,825,828 | 11 | 16 | 11. A computer for implementing notifications, the computer comprising: a memory for storing data defining notification operations, the data defining notification operations comprising a hierarchy of Uniform Resource Identifiers (URIs) and Extensible Markup Language (XML) document schema defining XML documents; an interface for receiving a notification command comprising an URI identifying a notification resource and a Hypertext Transfer Protocol (HTTP) GET method; and a processor for: determining a notification operation based on the data defining notification operations stored in the memory and the notification command received; obtaining a list of notifications indicated in the notification; and returning a NotificationList XML document. | 11. A computer for implementing notifications, the computer comprising: a memory for storing data defining notification operations, the data defining notification operations comprising a hierarchy of Uniform Resource Identifiers (URIs) and Extensible Markup Language (XML) document schema defining XML documents; an interface for receiving a notification command comprising an URI identifying a notification resource and a Hypertext Transfer Protocol (HTTP) GET method; and a processor for: determining a notification operation based on the data defining notification operations stored in the memory and the notification command received; obtaining a list of notifications indicated in the notification; and returning a NotificationList XML document. 16. The computer according to claim 11 , wherein the interface is further operable to receive a second notification command comprising an HTTP OPTIONS method and an URI identifying a notification resource, and the processor is further operable to execute a second notification operation comprising obtaining a list of HTTP methods associated with the URI and returning an AllowedMethods XML document. | 0.589322 |
9,043,331 | 1 | 16 | 1. A method comprising: maintaining a URL database comprising a plurality of URLs; retrieving, without user intervention, a first document associated with a first URL from the plurality of URLs; parsing, using at least one processor, the first document to identify one or more additional URLs within the first document; comparing the one or more additional URLs to the URL database to determine if the URL database includes the one or more additional URLs; if it is determined that the URL database does not include the one or more additional URLs, updating the URL database to include the one or more additional URLs; determining if the one or more additional URLs are root URLs based on a set of predefined rules; when it is determined that the one or more additional URLs are root URLs, classifying the one or more additional URLs as root URLs in the URL database and updating the URL database to add the classification that the one or more additional URLs are root URLs; querying a third-party database for additional information associated with the one or more additional URLs; updating the URL database to include the additional information associated with the one or more additional URLs; and repeating the steps of retrieving, parsing, comparing, and updating for each of the one or more additional URLs. | 1. A method comprising: maintaining a URL database comprising a plurality of URLs; retrieving, without user intervention, a first document associated with a first URL from the plurality of URLs; parsing, using at least one processor, the first document to identify one or more additional URLs within the first document; comparing the one or more additional URLs to the URL database to determine if the URL database includes the one or more additional URLs; if it is determined that the URL database does not include the one or more additional URLs, updating the URL database to include the one or more additional URLs; determining if the one or more additional URLs are root URLs based on a set of predefined rules; when it is determined that the one or more additional URLs are root URLs, classifying the one or more additional URLs as root URLs in the URL database and updating the URL database to add the classification that the one or more additional URLs are root URLs; querying a third-party database for additional information associated with the one or more additional URLs; updating the URL database to include the additional information associated with the one or more additional URLs; and repeating the steps of retrieving, parsing, comparing, and updating for each of the one or more additional URLs. 16. The method of claim 1 , wherein the URL database comprises a URL index. | 0.902344 |
8,286,171 | 1 | 15 | 1. A computer implemented method for preventing unauthorized disclosure of secure information, the computer implemented method comprising: receiving information including a first text, by a computer system having at least a processor for executing instructions, said first text including a plurality of words; normalizing, by said computer system, said first text into a first canonical text expression, said first canonical text expression including a plurality of normalized words; generating, at said computer system, a first word hash list for said first canonical text expression, where said first word hash list is generated at a word level; generating, at said computer system, a first set of fingerprints for said first word hash list; wherein generating said first word hash list includes converting said plurality of normalized words into a plurality of word-value hashes, each specific one of said word-value hashes representing a specific normalized word; and wherein said generating said first set of fingerprints includes: assigning a sliding window of size W, wherein said sliding window is used for reading a W number of said word-value hashes from said first word hash list; using said sliding window to read said W number of said word-level hashes from said first word hash list; designating said word-value hash with a distinct value within said sliding window as an anchor; and generating a fingerprint using a fingerprint hash function, wherein said fingerprint hash function is applied over all said word-value hashes contained within a start of said sliding window to where said anchor resides in said sliding window. | 1. A computer implemented method for preventing unauthorized disclosure of secure information, the computer implemented method comprising: receiving information including a first text, by a computer system having at least a processor for executing instructions, said first text including a plurality of words; normalizing, by said computer system, said first text into a first canonical text expression, said first canonical text expression including a plurality of normalized words; generating, at said computer system, a first word hash list for said first canonical text expression, where said first word hash list is generated at a word level; generating, at said computer system, a first set of fingerprints for said first word hash list; wherein generating said first word hash list includes converting said plurality of normalized words into a plurality of word-value hashes, each specific one of said word-value hashes representing a specific normalized word; and wherein said generating said first set of fingerprints includes: assigning a sliding window of size W, wherein said sliding window is used for reading a W number of said word-value hashes from said first word hash list; using said sliding window to read said W number of said word-level hashes from said first word hash list; designating said word-value hash with a distinct value within said sliding window as an anchor; and generating a fingerprint using a fingerprint hash function, wherein said fingerprint hash function is applied over all said word-value hashes contained within a start of said sliding window to where said anchor resides in said sliding window. 15. A computer implemented method for preventing unauthorized disclosure of secure information as recited in claim 1 , where an ordering of said plurality of word-value hashes in said word hash list corresponds to an original ordering of said plurality of normalized words. | 0.828086 |
7,870,147 | 7 | 8 | 7. The method of claim 5 , wherein the user satisfaction score is determined by an inverse revision frequency. | 7. The method of claim 5 , wherein the user satisfaction score is determined by an inverse revision frequency. 8. The method of claim 7 , wherein the inverse revision frequency is the inverse of a number of times the alternative query is revised divided by the query occurrence frequency of the alternative query. | 0.5 |
6,073,102 | 1 | 11 | 1. A speech recognition system which identifies an action to be taken upon receipt of a command that is given to the system by a user's speech, comprising: (a) at least one speech recognition unit EM via which the command is received and recognized, (b) an input memory ESP in which the command is stored, (c) an action determination unit (AE) which identifies at least one action which is indicated by an action indicator, the action determination unit (AE) is being constructed such that (1) a first set of actions is formed in which the actions are stored wherein all action indicators coincide with at least one part of prescribable key concepts that are allocated to an action, (2) that a second set of actions is formed in which the actions are stored wherein at least a part of the action indicators coincide with at least the part of the prescribable key concepts, and (3) the first set of actions and/or the second set of actions is employed as a basis for the unambiguous determination of the action indicated by the command, and (d) a parameter parser (PP) with which action parameters prescribable from the command that are allocated to an action and are employed for the execution of the action are identified. | 1. A speech recognition system which identifies an action to be taken upon receipt of a command that is given to the system by a user's speech, comprising: (a) at least one speech recognition unit EM via which the command is received and recognized, (b) an input memory ESP in which the command is stored, (c) an action determination unit (AE) which identifies at least one action which is indicated by an action indicator, the action determination unit (AE) is being constructed such that (1) a first set of actions is formed in which the actions are stored wherein all action indicators coincide with at least one part of prescribable key concepts that are allocated to an action, (2) that a second set of actions is formed in which the actions are stored wherein at least a part of the action indicators coincide with at least the part of the prescribable key concepts, and (3) the first set of actions and/or the second set of actions is employed as a basis for the unambiguous determination of the action indicated by the command, and (d) a parameter parser (PP) with which action parameters prescribable from the command that are allocated to an action and are employed for the execution of the action are identified. 11. The system of claim 1 wherein the system is a voice mail handling system. | 0.5 |
9,134,811 | 15 | 18 | 15. A non-transitory tangible computer readable medium having stored thereon computer instructions that, when executed by a processor of a device, cause the processor to perform operations comprising: receiving a selection of a key of a plurality of keys, wherein the key is associated with a question and wherein the selection of the key indicates an answer to the question; after receiving the selection of the key of the plurality of keys, assigning a prediction value to at least a portion of the plurality of keys based on the answer to the question associated with the key selected; and adjusting an acceptable angle for one of the at least a portion of the plurality of keys relative to the prediction value assigned to the one of the at least a portion of the plurality of keys, the acceptable angle being measured by a plurality of contacts arranged around a center of the one of the at least a portion of the plurality of keys, the plurality of contacts comprising a plurality of upper contacts and a plurality of lower contacts, wherein adjusting the acceptable angle comprises: in response to the one of the at least a portion of the plurality of keys being assigned a lower prediction value, increasing a number of the plurality of upper contacts of the one of the at least a portion of the plurality of keys required to contact a number of the plurality of lower contacts of the one of the at least a portion of the plurality of keys to constitute an entry of the one of the at least a portion of the plurality of keys, and in response to the one of the at least a portion of the plurality of keys being assigned an higher prediction value, decreasing the number of the plurality of upper contacts of the one of the at least a portion of the plurality of keys required to contact the number of the plurality of lower contacts of the one of the at least a portion of the plurality of keys to constitute the entry of the one of the at least a portion of the plurality of keys. | 15. A non-transitory tangible computer readable medium having stored thereon computer instructions that, when executed by a processor of a device, cause the processor to perform operations comprising: receiving a selection of a key of a plurality of keys, wherein the key is associated with a question and wherein the selection of the key indicates an answer to the question; after receiving the selection of the key of the plurality of keys, assigning a prediction value to at least a portion of the plurality of keys based on the answer to the question associated with the key selected; and adjusting an acceptable angle for one of the at least a portion of the plurality of keys relative to the prediction value assigned to the one of the at least a portion of the plurality of keys, the acceptable angle being measured by a plurality of contacts arranged around a center of the one of the at least a portion of the plurality of keys, the plurality of contacts comprising a plurality of upper contacts and a plurality of lower contacts, wherein adjusting the acceptable angle comprises: in response to the one of the at least a portion of the plurality of keys being assigned a lower prediction value, increasing a number of the plurality of upper contacts of the one of the at least a portion of the plurality of keys required to contact a number of the plurality of lower contacts of the one of the at least a portion of the plurality of keys to constitute an entry of the one of the at least a portion of the plurality of keys, and in response to the one of the at least a portion of the plurality of keys being assigned an higher prediction value, decreasing the number of the plurality of upper contacts of the one of the at least a portion of the plurality of keys required to contact the number of the plurality of lower contacts of the one of the at least a portion of the plurality of keys to constitute the entry of the one of the at least a portion of the plurality of keys. 18. The non-transitory tangible computer readable medium of claim 15 , wherein the operations further comprise illuminating an indicator associated with the question based on the selection of the key associated with the question. | 0.617057 |
9,940,389 | 11 | 20 | 11. A computer-implemented system for generating an issue network from a document corpus, the computer-implemented system comprising a processor and a non-transitory computer-readable medium storing computer readable instructions that, when executed by the processor, cause the processor to: search the document corpus for a set of documents discussing a starting issue, wherein the starting issue is one of a plurality of normalized issues found within the document corpus and the documents within the document corpus are linked by citations; determine a set of normalized issues discussed by the set of documents discussing the starting issue, wherein the set of normalized issues also includes the starting issue; determine co-occurrences of individual normalized issues of the set of normalized issues within individual cases of the set of documents; and link individual normalized issues of the set of normalized issues based on their co-occurrences within the set of documents, wherein the linked individual normalized issues at least in part define the issue network; and store the linked individual normalized issues in the non-transitory computer-readable medium. | 11. A computer-implemented system for generating an issue network from a document corpus, the computer-implemented system comprising a processor and a non-transitory computer-readable medium storing computer readable instructions that, when executed by the processor, cause the processor to: search the document corpus for a set of documents discussing a starting issue, wherein the starting issue is one of a plurality of normalized issues found within the document corpus and the documents within the document corpus are linked by citations; determine a set of normalized issues discussed by the set of documents discussing the starting issue, wherein the set of normalized issues also includes the starting issue; determine co-occurrences of individual normalized issues of the set of normalized issues within individual cases of the set of documents; and link individual normalized issues of the set of normalized issues based on their co-occurrences within the set of documents, wherein the linked individual normalized issues at least in part define the issue network; and store the linked individual normalized issues in the non-transitory computer-readable medium. 20. The computer-implemented system of claim 11 , wherein the issue network comprises nodes representing individual normalized issues of the set of normalized issues that co-occur within the individual documents above a co-occurrence threshold. | 0.759843 |
9,165,554 | 1 | 5 | 1. A method comprising: performing, via a processor, a first pass of entries in a database to generate a shortlist of the entries, the first pass comprising: utilizing a phonotactic grammar to perform speech recognition on received speech and to generate a phoneme lattice, wherein the utilizing ignores inter-field constraints of the phonotactic grammar; and generating the shortlist of the entries in the database based on a normalization of the phoneme lattice; and performing a second pass on the shortlist of the entries in the database to obtain a final result, the second pass comprising: generating a grammar from the shortlist of the entries in the database, to yield a generated grammar having inter-field constraints; and identifying data from the database for each of the input field based on the received speech, the generated grammar, and the inter-field constraints. | 1. A method comprising: performing, via a processor, a first pass of entries in a database to generate a shortlist of the entries, the first pass comprising: utilizing a phonotactic grammar to perform speech recognition on received speech and to generate a phoneme lattice, wherein the utilizing ignores inter-field constraints of the phonotactic grammar; and generating the shortlist of the entries in the database based on a normalization of the phoneme lattice; and performing a second pass on the shortlist of the entries in the database to obtain a final result, the second pass comprising: generating a grammar from the shortlist of the entries in the database, to yield a generated grammar having inter-field constraints; and identifying data from the database for each of the input field based on the received speech, the generated grammar, and the inter-field constraints. 5. The method of claim 1 , wherein the generated grammar comprises common variations of the input field. | 0.849711 |
8,407,216 | 11 | 15 | 11. A method for automatically generating tag terms for objects in databases of a web site that is automatically created based on a subject, comprising: receiving a plurality of search terms related to the subject to create the web site; searching Internet web sites to identify information associated with the plurality of search terms on the Internet web sites to automatically create the web site; storing an identified information associated with the plurality of search terms as an object to a database of the web site; processing the identified information to determine which one of the plurality of search terms the identified information is associated with; wherein the identified information associated with the plurality of search terms to be used as content of the web site includes one or more of photos, music, videos, and articles; automatically generating a tag term for the identified information in the database using the one of the plurality of search terms determined to be associated with the identified information; processing and parsing any additional metadata of the identified information stored as an object to determine keywords to be used as additional tag terms for the identified information, the processing and parsing removing symbols and words without functionality as tag terms for the identified information; and automatically storing the additional tag terms as automatically generated tag terms for the identified information in the database; wherein the automatically generated tag terms for the identified information enable the identified information to be searched and to be associated with other objects in the databases on the web site without user involvement; generating a web page of the web site, the web page defining a content area related to the subject of the web site; populating the content area of the web page based on a search of the automatically generated tag terms. | 11. A method for automatically generating tag terms for objects in databases of a web site that is automatically created based on a subject, comprising: receiving a plurality of search terms related to the subject to create the web site; searching Internet web sites to identify information associated with the plurality of search terms on the Internet web sites to automatically create the web site; storing an identified information associated with the plurality of search terms as an object to a database of the web site; processing the identified information to determine which one of the plurality of search terms the identified information is associated with; wherein the identified information associated with the plurality of search terms to be used as content of the web site includes one or more of photos, music, videos, and articles; automatically generating a tag term for the identified information in the database using the one of the plurality of search terms determined to be associated with the identified information; processing and parsing any additional metadata of the identified information stored as an object to determine keywords to be used as additional tag terms for the identified information, the processing and parsing removing symbols and words without functionality as tag terms for the identified information; and automatically storing the additional tag terms as automatically generated tag terms for the identified information in the database; wherein the automatically generated tag terms for the identified information enable the identified information to be searched and to be associated with other objects in the databases on the web site without user involvement; generating a web page of the web site, the web page defining a content area related to the subject of the web site; populating the content area of the web page based on a search of the automatically generated tag terms. 15. The method of claim 11 , further comprising: determining the subject for the web site prior to receiving the plurality of search terms related to the subject. | 0.72449 |
7,773,806 | 10 | 18 | 10. A system for segmenting an object in a set of image data using one or more prior instances of the object, comprising: a processor; computer software operable on the processor, the computer software being capable of: determining a nonparametric estimate of a statistical shape distribution from the one or more prior instances of the object in a subspace spanned by the one or more prior instances of the object by a kernel density estimator; determining a nonparametric estimate of a statistical intensity distribution from the one or more prior instances of the object by a kernel density estimator; combining the kernel density estimator of the statistical shape distribution with the kernel density estimator of the statistical intensity distribution in a Bayesian expression conditioned on the set of image data, wherein the expression is provided in accordance with: E ( α , h , θ ) = - ∫ Ω ( H ϕ log p in ( I ) + ( 1 - H ϕ ) log p out ( I ) ) ⅆ x - log ( 1 N σ ∑ i = 1 N K ( α - α i σ ) ) ; and selecting a segmentation of the object in the set of image data by executing a level set method which optimizes the Bayesian expression. | 10. A system for segmenting an object in a set of image data using one or more prior instances of the object, comprising: a processor; computer software operable on the processor, the computer software being capable of: determining a nonparametric estimate of a statistical shape distribution from the one or more prior instances of the object in a subspace spanned by the one or more prior instances of the object by a kernel density estimator; determining a nonparametric estimate of a statistical intensity distribution from the one or more prior instances of the object by a kernel density estimator; combining the kernel density estimator of the statistical shape distribution with the kernel density estimator of the statistical intensity distribution in a Bayesian expression conditioned on the set of image data, wherein the expression is provided in accordance with: E ( α , h , θ ) = - ∫ Ω ( H ϕ log p in ( I ) + ( 1 - H ϕ ) log p out ( I ) ) ⅆ x - log ( 1 N σ ∑ i = 1 N K ( α - α i σ ) ) ; and selecting a segmentation of the object in the set of image data by executing a level set method which optimizes the Bayesian expression. 18. The system as claimed in claim 10 , wherein the object is a prostate. | 0.832569 |
6,121,534 | 4 | 7 | 4. A natural-scale tone-generator apparatus having input connections to a conventional power supply, input connections to MIDI key-selection signals of a MIDI keyboard, and output connections to a conventional amplifier-speaker system, and with the tone-generator apparatus having a plurality of notes corresponding to the keys of the MIDI keyboard, and with the tone-generator apparatus responsive to a tuning method that corrects the tuning of MIDI key-selected notes of the tone-generator apparatus from the tempered scale to the natural scale, and with the tone-generator apparatus comprising in combination: a voltage-controllable oscillator element as a respective, independently-tuneable tone generator for each note of the tone-generator apparatus, and with said oscillator element having terminals for tuning capacitors, resistive tuning components, filter components, and control-voltage access, and with the components connected so that said voltage-controllable oscillator can operate independently, and a respective, switching-multiplexer integrated-circuit element for each note, and with said multiplexer having a single output, at least three binary inputs, and a plurality of, at least, eight digitally-switchable inputs, and with a control-voltage bias resistor connected from the output of said multiplexer to the control-voltage-access terminal of said voltage-controllable oscillator, and a resistive voltage-divider element with the switchable inputs of said multiplexer connected to respective voltage levels at respective resistor junctions of said voltage divider, and with respective frequency decoupling capacitors connected from a ground of the power supply to the respective resistor junctions of the switchable inputs of said resistive voltage divider, and with said resistive voltage divider connected at one end through a voltage-level adjusting potentiometer to a positive voltage of the power supply, and with the other end of said resistive voltage divider connected through a pair of forward-biased, temperature-compensating diodes to the ground of the power supply, and with means for tuning said oscillator by digitally switching a voltage level value from the voltage-divider junctions to the control-voltage bias resistor of said voltage-controllable oscillator element with a binary code at the binary inputs of said multiplexer, and with the voltage level values of said resistive voltage divider connected to respective, switchable-multiplexer inputs of other notes, and a respective flip-flop integrated-circuit element, for each note, having a clock terminal, a clear terminal, and at least three flip-flops connected as a binary storage latch, and another flip-flop connected as a note on-off latch, and with the binary inputs of said multiplexer connected in a weighted manner to the outputs of the storage latch, and the clock terminal connected to the note on-off latch as an input, and with the storage latch actuated by the clock input of the note on-off latch, and with the clear terminal of said flip-flop integrated circuit connected to a conventional reset circuit for the tone generator apparatus, and a microcomputer element having, as a minimum, a parallel interface with a first and a second output port of, at least, eight-bit architecture, and with the storage latch of said flip-flop element for each note, having inputs connected to the first output port, in a weighted manner, starting at the lowest significant bit of the first output port of said microcomputer, and with said flip-flop element having means of transferring a binary tuning code from an output port of said microcomputer element to the addressable inputs of said multiplexer element, and with said microcomputer having a serial port with conventional software and hardware for a MIDI serial interface, and with the MIDI key-selection input signals connected to the serial interface, and a key-selection matrix element having, as unit parts, a 3-to-8 line decoder integrated circuit, a 4-to-6 line decoder integrated circuit, and a plurality of OR-gate integrated circuits, and with the second output port of said microcomputer connected, in a weighted manner, to the digital input lines of the 4-to-16 line decoder, starting from the least significant bit of the second output port, and with the 4-to-16 line decoder having hexadecimal output lines numbered 0 to F inclusive at vertical connection points of said matrix, and with the second output port connected in a weighted manner to the digital input lines of the 3-to-8 line decoder, and with the input lines of the 3-to-8 line decoder connected to the second output port with the least significant bit following the most significant bit of the 4-to-16 line decoder, and with the 3-to-8 line decoder having hexadecimal output lines numbered 2 to 6 inclusive at horizontal connection points of said matrix, and with the horizontal and vertical hexadecimal-digit lines of the decoders arranged to form said key-selection matrix, and with the horizontal and vertical hexadecimal-digit line numbers identifying at each intersection of said matrix a MIDI key number for a respective note and connection points for inputs of a respective OR gate, and with the output of the respective OR gate connected to the clock input of the respective note on-off latch for the respective note in said matrix, and a respective voicing element, for each note, having, as component parts, a frequency-divider integrated circuit with an on-off gate terminal, a voice-summing amplifier integrated circuit and associated resistors and capacitors for adjusting overall gain and tone quality, and with the output of the note on-off latch connected through a coupling resistor to the on-off terminal of the frequency-divider integrated circuit, and with a square-wave frequency output terminal of said voltage-controllable oscillator connected to a frequency-dividing input terminal of the divider integrated circuit, and with a plurality of divided frequencies at output terminals of the divider integrated circuit connected by respective voice-summing resistors to an inverting input of the voice-summing amplifier, and with the plurality of divided frequencies corresponding to a fundamental organ tone and harmonics, and with the inverting input of the voice-summing amplifier connected to the voice-summing resistors of other notes, and with the output of the voice-summing amplifier connected to one end of a coupling capacitor, and with the other end of the coupling capacitor connected to one end of an output-summing resistor, and an output-summing amplifier integrated-circuit component with the free end of output-summing resistors of all voice-summing amplifiers for one audio channel connected to a negative input of the output-summing amplifier, and with the output of the output-summing amplifier connected by a coupling capacitor to the conventional amplifier-speaker system, and with said key-selection matrix element having means of selecting a voicing element for a particular note by being presented with a key selection code, at it's binary inputs, from an output port of said microcomputer element, and with the voice-summing amplifiers and output-summing amplifier components providing means for summing the harmonic output of all of the voicing elements to the input channels of the conventional amplifier speaker system, and a tuning program element for the tuning method that corrects the tone generators of MIDI key selection to the natural scale, so that said microcomputer with said tuning program loaded in memory has means for programming the natural-scale tuning of the tone generators, actuated by the MIDI key-selection input signals, by outputting a key-selection signal to said key-selection matrix corresponding to a respective voicing element of each actuated tone generator, and outputting a corresponding tuning code to said respective storage latch of each actuated tone generator. | 4. A natural-scale tone-generator apparatus having input connections to a conventional power supply, input connections to MIDI key-selection signals of a MIDI keyboard, and output connections to a conventional amplifier-speaker system, and with the tone-generator apparatus having a plurality of notes corresponding to the keys of the MIDI keyboard, and with the tone-generator apparatus responsive to a tuning method that corrects the tuning of MIDI key-selected notes of the tone-generator apparatus from the tempered scale to the natural scale, and with the tone-generator apparatus comprising in combination: a voltage-controllable oscillator element as a respective, independently-tuneable tone generator for each note of the tone-generator apparatus, and with said oscillator element having terminals for tuning capacitors, resistive tuning components, filter components, and control-voltage access, and with the components connected so that said voltage-controllable oscillator can operate independently, and a respective, switching-multiplexer integrated-circuit element for each note, and with said multiplexer having a single output, at least three binary inputs, and a plurality of, at least, eight digitally-switchable inputs, and with a control-voltage bias resistor connected from the output of said multiplexer to the control-voltage-access terminal of said voltage-controllable oscillator, and a resistive voltage-divider element with the switchable inputs of said multiplexer connected to respective voltage levels at respective resistor junctions of said voltage divider, and with respective frequency decoupling capacitors connected from a ground of the power supply to the respective resistor junctions of the switchable inputs of said resistive voltage divider, and with said resistive voltage divider connected at one end through a voltage-level adjusting potentiometer to a positive voltage of the power supply, and with the other end of said resistive voltage divider connected through a pair of forward-biased, temperature-compensating diodes to the ground of the power supply, and with means for tuning said oscillator by digitally switching a voltage level value from the voltage-divider junctions to the control-voltage bias resistor of said voltage-controllable oscillator element with a binary code at the binary inputs of said multiplexer, and with the voltage level values of said resistive voltage divider connected to respective, switchable-multiplexer inputs of other notes, and a respective flip-flop integrated-circuit element, for each note, having a clock terminal, a clear terminal, and at least three flip-flops connected as a binary storage latch, and another flip-flop connected as a note on-off latch, and with the binary inputs of said multiplexer connected in a weighted manner to the outputs of the storage latch, and the clock terminal connected to the note on-off latch as an input, and with the storage latch actuated by the clock input of the note on-off latch, and with the clear terminal of said flip-flop integrated circuit connected to a conventional reset circuit for the tone generator apparatus, and a microcomputer element having, as a minimum, a parallel interface with a first and a second output port of, at least, eight-bit architecture, and with the storage latch of said flip-flop element for each note, having inputs connected to the first output port, in a weighted manner, starting at the lowest significant bit of the first output port of said microcomputer, and with said flip-flop element having means of transferring a binary tuning code from an output port of said microcomputer element to the addressable inputs of said multiplexer element, and with said microcomputer having a serial port with conventional software and hardware for a MIDI serial interface, and with the MIDI key-selection input signals connected to the serial interface, and a key-selection matrix element having, as unit parts, a 3-to-8 line decoder integrated circuit, a 4-to-6 line decoder integrated circuit, and a plurality of OR-gate integrated circuits, and with the second output port of said microcomputer connected, in a weighted manner, to the digital input lines of the 4-to-16 line decoder, starting from the least significant bit of the second output port, and with the 4-to-16 line decoder having hexadecimal output lines numbered 0 to F inclusive at vertical connection points of said matrix, and with the second output port connected in a weighted manner to the digital input lines of the 3-to-8 line decoder, and with the input lines of the 3-to-8 line decoder connected to the second output port with the least significant bit following the most significant bit of the 4-to-16 line decoder, and with the 3-to-8 line decoder having hexadecimal output lines numbered 2 to 6 inclusive at horizontal connection points of said matrix, and with the horizontal and vertical hexadecimal-digit lines of the decoders arranged to form said key-selection matrix, and with the horizontal and vertical hexadecimal-digit line numbers identifying at each intersection of said matrix a MIDI key number for a respective note and connection points for inputs of a respective OR gate, and with the output of the respective OR gate connected to the clock input of the respective note on-off latch for the respective note in said matrix, and a respective voicing element, for each note, having, as component parts, a frequency-divider integrated circuit with an on-off gate terminal, a voice-summing amplifier integrated circuit and associated resistors and capacitors for adjusting overall gain and tone quality, and with the output of the note on-off latch connected through a coupling resistor to the on-off terminal of the frequency-divider integrated circuit, and with a square-wave frequency output terminal of said voltage-controllable oscillator connected to a frequency-dividing input terminal of the divider integrated circuit, and with a plurality of divided frequencies at output terminals of the divider integrated circuit connected by respective voice-summing resistors to an inverting input of the voice-summing amplifier, and with the plurality of divided frequencies corresponding to a fundamental organ tone and harmonics, and with the inverting input of the voice-summing amplifier connected to the voice-summing resistors of other notes, and with the output of the voice-summing amplifier connected to one end of a coupling capacitor, and with the other end of the coupling capacitor connected to one end of an output-summing resistor, and an output-summing amplifier integrated-circuit component with the free end of output-summing resistors of all voice-summing amplifiers for one audio channel connected to a negative input of the output-summing amplifier, and with the output of the output-summing amplifier connected by a coupling capacitor to the conventional amplifier-speaker system, and with said key-selection matrix element having means of selecting a voicing element for a particular note by being presented with a key selection code, at it's binary inputs, from an output port of said microcomputer element, and with the voice-summing amplifiers and output-summing amplifier components providing means for summing the harmonic output of all of the voicing elements to the input channels of the conventional amplifier speaker system, and a tuning program element for the tuning method that corrects the tone generators of MIDI key selection to the natural scale, so that said microcomputer with said tuning program loaded in memory has means for programming the natural-scale tuning of the tone generators, actuated by the MIDI key-selection input signals, by outputting a key-selection signal to said key-selection matrix corresponding to a respective voicing element of each actuated tone generator, and outputting a corresponding tuning code to said respective storage latch of each actuated tone generator. 7. The natural-scale tone-generator apparatus of claim 4 wherein said switching-multiplexer element is a 4051 multiplexer integrated circuit having three binary inputs for selecting one of eight switchable inputs, and wherein said resistive voltage-divider has eight successive resistors connected in series between the voltage-level adjusting potentiometer and the temperature-compensating diodes, and with the switchable inputs arranged in a sequence of 4, 7, 5, 0, 2, 6, 1, and 3, for connection to successive resistor junctions of the eight successive resistors, and with the connections arranged so that input 4 of the sequence is connected to the resistor junction between the voltage-level adjusting potentiometer and the first resistor of the series, and so that input 3 of the sequence is connected to the resistor junction between the seventh and eighth resistor of the series. | 0.753885 |
9,117,308 | 9 | 15 | 9. A computer-aided design system comprising: a processor operatively coupled to a data storage system, the data storage system storing a three-dimensional model; and a data storage memory operatively coupled to the processor and comprising instructions to configure the processor to: enable selection of one or more features of the three-dimensional model for conversion to one or more direct-edit features; determine other features of the three-dimensional model to convert based on an order of creation of one or more selected features; and convert the selected features and the other features to one or more direct-edit features, resulting in the three-dimensional model including history-based features and direct-edit features. | 9. A computer-aided design system comprising: a processor operatively coupled to a data storage system, the data storage system storing a three-dimensional model; and a data storage memory operatively coupled to the processor and comprising instructions to configure the processor to: enable selection of one or more features of the three-dimensional model for conversion to one or more direct-edit features; determine other features of the three-dimensional model to convert based on an order of creation of one or more selected features; and convert the selected features and the other features to one or more direct-edit features, resulting in the three-dimensional model including history-based features and direct-edit features. 15. The computer-aided design system of claim 9 , wherein the processor is further configured to enable direct-edit modeling operations to be performed on the direct-edit features of the model. | 0.844605 |
8,984,398 | 1 | 2 | 1. A method comprising: extracting, by a computing platform comprising one or more processors, a group of two or more sentences of an electronic document; segmenting individual sentences of said of said two or more sentences into a first phrase and at least a second phrase, said first phrase comprising at least one word not contained within said at least a second phrase; determining two or more paths between phrases of said individual sentences, individual paths of said two or more paths comprising no more than one phrase from individual ones of said individual sentences; at least partially in response to receiving a search query, determining respective scores for said individual paths based at least in part on a utility metric and a ranking of said two or more sentences with respect to said search query; generating an abstract of said electronic document, said abstract comprising individual ones of said phrases associated with a first path of said two or more paths, said first path being associated with a highest of said respective scores, wherein a first phrase of said phrases associated with said first path is different from a second phrase of said phrases associated with said first path; and transmitting one or more search results comprising at least said abstract to a user at least partially in response to receiving said search query from said user. | 1. A method comprising: extracting, by a computing platform comprising one or more processors, a group of two or more sentences of an electronic document; segmenting individual sentences of said of said two or more sentences into a first phrase and at least a second phrase, said first phrase comprising at least one word not contained within said at least a second phrase; determining two or more paths between phrases of said individual sentences, individual paths of said two or more paths comprising no more than one phrase from individual ones of said individual sentences; at least partially in response to receiving a search query, determining respective scores for said individual paths based at least in part on a utility metric and a ranking of said two or more sentences with respect to said search query; generating an abstract of said electronic document, said abstract comprising individual ones of said phrases associated with a first path of said two or more paths, said first path being associated with a highest of said respective scores, wherein a first phrase of said phrases associated with said first path is different from a second phrase of said phrases associated with said first path; and transmitting one or more search results comprising at least said abstract to a user at least partially in response to receiving said search query from said user. 2. The method of claim 1 , further comprising excluding redundant phrases during said generation of an abstract. | 0.919192 |
9,038,008 | 1 | 3 | 1. A method for containing analog verification intellectual property (IP) for circuit simulation, the method comprising: using a computer, reading an analog verification file containing at least one analog verification unit (vunit) that contains properties describing analog circuit design verification requirements including checks for specified simulation results, wherein the analog verification file is separate from input design IP; binding the vunit to one of a top-level circuit, a subcircuit master, and a subcircuit instance during circuit hierarchy expansion, to set vunit scope; performing a circuit simulation with a computer-operated circuit simulation tool combining the input design IP and the analog circuit design verification requirements; and tangibly outputting circuit simulation and verification results. | 1. A method for containing analog verification intellectual property (IP) for circuit simulation, the method comprising: using a computer, reading an analog verification file containing at least one analog verification unit (vunit) that contains properties describing analog circuit design verification requirements including checks for specified simulation results, wherein the analog verification file is separate from input design IP; binding the vunit to one of a top-level circuit, a subcircuit master, and a subcircuit instance during circuit hierarchy expansion, to set vunit scope; performing a circuit simulation with a computer-operated circuit simulation tool combining the input design IP and the analog circuit design verification requirements; and tangibly outputting circuit simulation and verification results. 3. The method of claim 1 wherein the vunit is a text file. | 0.888462 |
9,978,067 | 1 | 2 | 1. A system for mitigating digital abuse and/or digital fraud committed using one or more online services of a service provider, the system comprising: an application programming interface that is in operable communication with a remote digital threat mitigation platform and that is configured to generate a request for a global digital threat score; the remote digital threat mitigation platform comprising one or more computing servers that receive, via a network, the request for the global digital threat score and collects digital event data associated with one or more online services of the service provider, wherein the digital threat mitigation platform implementing: a machine learning system that: uses the collected digital event data, as input, into a first machine learning ensemble to generate a global digital threat score, wherein the global digital threat score is agnostic to a category of digital abuse type, and generates the global digital threat score; a machine learning classifier that: generates a digital abuse label that identifies one specific digital abuse type of a plurality of specific digital abuse types based on the collected digital event data, wherein the one specific digital abuse type indicates a category of digital fraud or digital abuse activity that was perpetrated in the collected digital event data by a user; a warping system that: uses input of the generated digital abuse label to warp the first machine learning ensemble to a second machine learning ensemble that generates a specific digital threat score for the one specific digital abuse type, wherein the specific digital threat score indicates a probability or likelihood that the one specific digital abuse type was committed by the user. | 1. A system for mitigating digital abuse and/or digital fraud committed using one or more online services of a service provider, the system comprising: an application programming interface that is in operable communication with a remote digital threat mitigation platform and that is configured to generate a request for a global digital threat score; the remote digital threat mitigation platform comprising one or more computing servers that receive, via a network, the request for the global digital threat score and collects digital event data associated with one or more online services of the service provider, wherein the digital threat mitigation platform implementing: a machine learning system that: uses the collected digital event data, as input, into a first machine learning ensemble to generate a global digital threat score, wherein the global digital threat score is agnostic to a category of digital abuse type, and generates the global digital threat score; a machine learning classifier that: generates a digital abuse label that identifies one specific digital abuse type of a plurality of specific digital abuse types based on the collected digital event data, wherein the one specific digital abuse type indicates a category of digital fraud or digital abuse activity that was perpetrated in the collected digital event data by a user; a warping system that: uses input of the generated digital abuse label to warp the first machine learning ensemble to a second machine learning ensemble that generates a specific digital threat score for the one specific digital abuse type, wherein the specific digital threat score indicates a probability or likelihood that the one specific digital abuse type was committed by the user. 2. The system of claim 1 , wherein the warping system comprises a second machine learning ensemble comprising a plurality of machine learning models designed to predict a likelihood of an existence of the digital abuse type in the collected digital event data. | 0.865979 |
8,341,158 | 10 | 15 | 10. A machine-readable medium having instructions tangibly stored thereon for execution by a processor to perform a method comprising: obtaining a dataset representing a plurality of users, a plurality of items, and a plurality of ratings given to items by users; clustering the plurality of users into a plurality of user-groups such that at least one user belongs to more than one user-group; clustering the plurality of items into a plurality of item-groups such that at least one item belongs to more than one item-group; inducing a model describing a probabilistic relationship between the plurality of users, items, ratings, user-groups, and item-groups, the induced model defined by a plurality of model parameters; and predicting a rating of a user for an item using the induced model. | 10. A machine-readable medium having instructions tangibly stored thereon for execution by a processor to perform a method comprising: obtaining a dataset representing a plurality of users, a plurality of items, and a plurality of ratings given to items by users; clustering the plurality of users into a plurality of user-groups such that at least one user belongs to more than one user-group; clustering the plurality of items into a plurality of item-groups such that at least one item belongs to more than one item-group; inducing a model describing a probabilistic relationship between the plurality of users, items, ratings, user-groups, and item-groups, the induced model defined by a plurality of model parameters; and predicting a rating of a user for an item using the induced model. 15. The machine-readable medium of claim 10 , the method further comprising predicting the rating of the user by: receiving a query from the user; and generating a predicted rating based on the received query. | 0.748798 |
10,002,608 | 9 | 10 | 9. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: receiving a word lattice generated by an automatic speech recognizer a query, wherein the word lattice is weighted according to the query; identifying a policy which allows use of a user emotional state in responding to a user who produced the query; performing a prosodic analysis of the query, wherein the prosodic analysis identifies an audible gesture in the query and a rhythm of words spoken in the query; identifying, according to the prosodic analysis, the user emotional state; reweighting the word lattice according to the prosodic analysis, the user emotional state and one of a time of day, a time of year, and a behavioral history of the user to yield a reweighted word lattice; determining, according to the reweighted word lattice, a response to the query, the response addressing the audible gesture; and presenting to the user the response to the query. | 9. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: receiving a word lattice generated by an automatic speech recognizer a query, wherein the word lattice is weighted according to the query; identifying a policy which allows use of a user emotional state in responding to a user who produced the query; performing a prosodic analysis of the query, wherein the prosodic analysis identifies an audible gesture in the query and a rhythm of words spoken in the query; identifying, according to the prosodic analysis, the user emotional state; reweighting the word lattice according to the prosodic analysis, the user emotional state and one of a time of day, a time of year, and a behavioral history of the user to yield a reweighted word lattice; determining, according to the reweighted word lattice, a response to the query, the response addressing the audible gesture; and presenting to the user the response to the query. 10. The system of claim 9 , wherein the prosodic analysis examines metalinguistic information of the query according to one or more of a tonality, a volume, a stress, an intonation, and a speed of the query. | 0.5 |
7,809,716 | 9 | 10 | 9. An apparatus of establishing relationship between documents in term of a user's operation upon a document search result, wherein the document search result is obtained from a search based on one or more search queries: the apparatus comprising: a log monitor for monitoring the user's operation upon the search result, and obtaining one or more documents selected by the user according to the operation; a log repository for storing a related document list for the selected document(s), the related document list being different from the search result; a log analyzer for obtaining a document relationship according to the related document list and creating a document relationship table containing a relevance degree of the document relationship between at least one pair of the documents in the search result; and a document relationship repository for storing said relevance degree of said document relationship, wherein, the document relationship is depicted at least by using the one or more search queries; at least one of the selected documents is opened by the user for browsing, in the search result, and the relevance degree between said pair of documents is a query-based relevance degree averaged over at least two search queries; and said at least one of the documents selected meets a criteria for being a related document, the criteria comprises one or more following conditions: whether the duration of the selected document being opened exceeds a predefined period; the number of times of the selected document being opened exceeds a predefined value; the selected document is opened within a predefined time frame; and the selected document is opened in a predefined opening sequence. | 9. An apparatus of establishing relationship between documents in term of a user's operation upon a document search result, wherein the document search result is obtained from a search based on one or more search queries: the apparatus comprising: a log monitor for monitoring the user's operation upon the search result, and obtaining one or more documents selected by the user according to the operation; a log repository for storing a related document list for the selected document(s), the related document list being different from the search result; a log analyzer for obtaining a document relationship according to the related document list and creating a document relationship table containing a relevance degree of the document relationship between at least one pair of the documents in the search result; and a document relationship repository for storing said relevance degree of said document relationship, wherein, the document relationship is depicted at least by using the one or more search queries; at least one of the selected documents is opened by the user for browsing, in the search result, and the relevance degree between said pair of documents is a query-based relevance degree averaged over at least two search queries; and said at least one of the documents selected meets a criteria for being a related document, the criteria comprises one or more following conditions: whether the duration of the selected document being opened exceeds a predefined period; the number of times of the selected document being opened exceeds a predefined value; the selected document is opened within a predefined time frame; and the selected document is opened in a predefined opening sequence. 10. The apparatus of claim 9 , further comprising: a means for determining whether the at least one of the documents selected by the user meets the criteria for being a related document, and if the document meets the criteria, storing the document as a related document, otherwise not storing the document as a related document. | 0.574026 |
9,876,901 | 12 | 15 | 12. An apparatus to evaluate audio quality of a real-time communication system that includes at least two communication devices, comprising: a processor and a non-transitory storage device storing instructions that are operable, when executed by the processor, to cause the processor to perform operations including: 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. | 12. An apparatus to evaluate audio quality of a real-time communication system that includes at least two communication devices, comprising: a processor and a non-transitory storage device storing instructions that are operable, when executed by the processor, to cause the processor to perform operations including: 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. 15. The apparatus of claim 12 , said determining a duration of the listening turn including: activating a voice activity detector based on the duration of the speaking turn; and determining when the received speech in the listening turn ends using the voice activity detector, wherein determining the duration of the listening turn is based on when the listening turn ends as determined using the voice activity detector. | 0.5 |
9,876,751 | 6 | 7 | 6. The method of claim 1 , wherein a topic represented by a respective node of the plurality of nodes is presented as a label proximate to the respective node. | 6. The method of claim 1 , wherein a topic represented by a respective node of the plurality of nodes is presented as a label proximate to the respective node. 7. The method of claim 6 , wherein causing the computer display to present the radial arrangement of the plurality of topics further includes: in response to interaction with the label presented near the respective node within the radial arrangement, updating the radial arrangement using the topic represented by the respective node as an updated main topic represented by the center node. | 0.5 |
10,165,307 | 1 | 5 | 1. A computer-implemented method, comprising computer-executable instructions that, when executed by a hardware processor, cause the hardware processor to perform acts of: accessing information related to an event; identifying a named entity and an associated entity attribute from the information related to the event, the associated entity attribute including an entity type and an entity popularity parameter, wherein the entity type includes at least one of an organization, person, or location, and the entity popularity parameter defines at least a popularity of the named entity in the information related to the event; accessing trending information based on the named entity and the associated entity attribute; collecting, by using the trending information, training data for identification of one or more entities in a video related to the event, wherein the training data is image data of at least one entity likely associated with the event; training a model using the training data, to learn features of the one or more entities, while presenting the video; performing recognition processing of the one or more entities in the video to identify the one or more entities while the video is being presented, wherein the recognition processing is performed using the trained model; performing a search to retrieve content relevant to the one or more entities identified by the recognition processing; and presenting, in real-time during presenting of the video, the content relevant to the one or more entities identified. | 1. A computer-implemented method, comprising computer-executable instructions that, when executed by a hardware processor, cause the hardware processor to perform acts of: accessing information related to an event; identifying a named entity and an associated entity attribute from the information related to the event, the associated entity attribute including an entity type and an entity popularity parameter, wherein the entity type includes at least one of an organization, person, or location, and the entity popularity parameter defines at least a popularity of the named entity in the information related to the event; accessing trending information based on the named entity and the associated entity attribute; collecting, by using the trending information, training data for identification of one or more entities in a video related to the event, wherein the training data is image data of at least one entity likely associated with the event; training a model using the training data, to learn features of the one or more entities, while presenting the video; performing recognition processing of the one or more entities in the video to identify the one or more entities while the video is being presented, wherein the recognition processing is performed using the trained model; performing a search to retrieve content relevant to the one or more entities identified by the recognition processing; and presenting, in real-time during presenting of the video, the content relevant to the one or more entities identified. 5. The method of claim 1 , wherein the accessing of the information, the collecting of the training data, the performing of the recognition processing, and the presenting of the content are performed while the video captures a live version of event. | 0.5 |
8,886,536 | 1 | 4 | 1. A computer-implemented method of providing promotional content related to one or more natural language utterances and/or responses, the method being implemented by a computer system that includes one or more physical processors executing one or more computer program instructions which, when executed, perform the method, the method comprising: receiving, at the one or more physical processors, a first natural language utterance; providing, by the one or more physical processors, a response to the first natural language utterance; receiving, at the one or more physical processors, a second natural language utterance relating to the first natural language utterance; performing, by the one or more physical processors, speech recognition to recognize one or more words of the second natural language utterance; determining, by the one or more physical processors, domain information for the one or more recognized words based on the first natural language utterance; processing, by the one or more physical processors, based on the domain information, the one or more recognized words to determine an interpretation of the second natural language utterance, wherein processing the one or more recognized words comprises: providing the one or more recognized words to a first domain agent associated with a first domain and a second domain agent associated with a second domain; obtaining a first interpretation of the second natural language utterance from the first domain agent; obtaining a second interpretation of the second natural language utterance from the second domain agent; and determining the interpretation based on one or more of the first interpretation or the second interpretation; determining, by the one or more physical processors, promotional content based on the interpretation; and presenting, by the one or more physical processors, the promotional content to a user. | 1. A computer-implemented method of providing promotional content related to one or more natural language utterances and/or responses, the method being implemented by a computer system that includes one or more physical processors executing one or more computer program instructions which, when executed, perform the method, the method comprising: receiving, at the one or more physical processors, a first natural language utterance; providing, by the one or more physical processors, a response to the first natural language utterance; receiving, at the one or more physical processors, a second natural language utterance relating to the first natural language utterance; performing, by the one or more physical processors, speech recognition to recognize one or more words of the second natural language utterance; determining, by the one or more physical processors, domain information for the one or more recognized words based on the first natural language utterance; processing, by the one or more physical processors, based on the domain information, the one or more recognized words to determine an interpretation of the second natural language utterance, wherein processing the one or more recognized words comprises: providing the one or more recognized words to a first domain agent associated with a first domain and a second domain agent associated with a second domain; obtaining a first interpretation of the second natural language utterance from the first domain agent; obtaining a second interpretation of the second natural language utterance from the second domain agent; and determining the interpretation based on one or more of the first interpretation or the second interpretation; determining, by the one or more physical processors, promotional content based on the interpretation; and presenting, by the one or more physical processors, the promotional content to a user. 4. The method of claim 1 , wherein the first interpretation is determined by the first domain agent based on the first domain, and wherein the second interpretation is determined by the second domain agent based on the second domain. | 0.865162 |
4,031,374 | 11 | 14 | 11. A protective system for preventing data word losses in the presence of a nuclear radiation event, or the like, while a memory is being accessed, said memory having at least one block of multi-bit data words stored therein, said block containing a particular number of data words at known memory locations, and said memory further including a multi-bit error correction word in said system including: means coupled to the member for accessing the multi-bit data words in the block of the different memory locations; first register means coupled to the accessing means for storing the address of each data word as the same is being accessed by the accessing means; second means coupled to the accessing means for altering the data word assessed thereby causing the data word to assume a predetermined bit configuration; second register means; logic circuit means coupled to the accessing means for forming a computed error correction word on all the words in the block including the altered data word and the error correction word, and for introducing the computed error correction word to the second register means for introduction into the memory to replace the altered word in the block at the memory location of the altered word; and nuclear radiation detection means for initiating the operation of the system. | 11. A protective system for preventing data word losses in the presence of a nuclear radiation event, or the like, while a memory is being accessed, said memory having at least one block of multi-bit data words stored therein, said block containing a particular number of data words at known memory locations, and said memory further including a multi-bit error correction word in said system including: means coupled to the member for accessing the multi-bit data words in the block of the different memory locations; first register means coupled to the accessing means for storing the address of each data word as the same is being accessed by the accessing means; second means coupled to the accessing means for altering the data word assessed thereby causing the data word to assume a predetermined bit configuration; second register means; logic circuit means coupled to the accessing means for forming a computed error correction word on all the words in the block including the altered data word and the error correction word, and for introducing the computed error correction word to the second register means for introduction into the memory to replace the altered word in the block at the memory location of the altered word; and nuclear radiation detection means for initiating the operation of the system. 14. The protective system defined in claim 11, and which includes third register means coupled to the accessing means for storing each data word being accessed by the accessing means; fourth register means; and further logic circuitry coupled to the accessing means and to the third register means for up-dating the error correction word when any data word is replaced in the block by a different data word, and for inserting the up-dated error correction word into the fourth register means for the introduction of the up-dated error correction word into the memory to replace the original error correction word at the memory location of the original error correction word. | 0.5 |
7,877,257 | 20 | 21 | 20. The method of claim 19 , wherein the spoken language dialog system is on board the motor vehicle. | 20. The method of claim 19 , wherein the spoken language dialog system is on board the motor vehicle. 21. The method of claim 20 , wherein different settings of the at least one parameter are provided to a user for user-selection of one of the different settings. | 0.5 |
8,140,559 | 1 | 16 | 1. A computer implemented method for displaying a ranked plurality of resources based upon at least one user supplied input, the method comprising: performing at least one input evaluation function for generating a plurality of extracted inputs from the at least one user supplied input; decomposing a plurality of resources into a plurality of nodes using natural language parsing to perform word classification based upon parts of speech; generating an answer space by performing at least one knowledge correlation function on a node pool based upon the plurality of extracted inputs, each node of the node pool comprising a data structure sufficient to independently convey meaning and including a subject, an attribute and a bond therebetween, the knowledge correlation function comprising iteratively adding nodes from the node pool onto an end of a chain of nodes by searching the node pool for a match between an attribute of a chained node and a subject of another unchained node in the node pool; determining a plurality of most significant resources based upon the answer space; ranking in significance the plurality of most significant resources to thereby generate the ranked plurality of resources; and displaying the ranked plurality of resources. | 1. A computer implemented method for displaying a ranked plurality of resources based upon at least one user supplied input, the method comprising: performing at least one input evaluation function for generating a plurality of extracted inputs from the at least one user supplied input; decomposing a plurality of resources into a plurality of nodes using natural language parsing to perform word classification based upon parts of speech; generating an answer space by performing at least one knowledge correlation function on a node pool based upon the plurality of extracted inputs, each node of the node pool comprising a data structure sufficient to independently convey meaning and including a subject, an attribute and a bond therebetween, the knowledge correlation function comprising iteratively adding nodes from the node pool onto an end of a chain of nodes by searching the node pool for a match between an attribute of a chained node and a subject of another unchained node in the node pool; determining a plurality of most significant resources based upon the answer space; ranking in significance the plurality of most significant resources to thereby generate the ranked plurality of resources; and displaying the ranked plurality of resources. 16. The method according to claim 1 wherein the most significant resources are transitively associated with the at least one user supplied input through resources used to create the answer space. | 0.68241 |
8,380,507 | 18 | 19 | 18. The computer readable media of claim 17 , further comprising additional computer readable instructions recorded thereon for: assigning a priority to each of the plurality of text strings; and selecting a language associated with a high priority text string for generating the speech content. | 18. The computer readable media of claim 17 , further comprising additional computer readable instructions recorded thereon for: assigning a priority to each of the plurality of text strings; and selecting a language associated with a high priority text string for generating the speech content. 19. The computer readable media of claim 18 , further comprising additional computer readable instructions recorded thereon for: identifying a default language associated with an electronic device providing the speech content; determining that the identified languages are speakable in the default language; and selecting the default language for generating the speech content. | 0.5 |
8,321,225 | 1 | 14 | 1. A method implemented by a system of one or more computers, comprising: receiving, at the system, text to be synthesized as a spoken utterance; analyzing, by the system, the received text to determine attributes of the received text; selecting, by the system, one or more candidate utterances from a database of stored utterances based on a comparison between the determined attributes of the received text and corresponding attributes of text representing the stored utterances; determining, by the system for each candidate utterance, a distance between a prosodic contour of the candidate utterance and a hypothetical prosodic contour of the spoken utterance to be synthesized, the determination based on a model that relates a) distances between prosodic contours of pairs of the stored utterances to b) relationships between attributes of text of each of the respective pairs, wherein the model is embodied by information including, for each of the stored utterances: a prosodic contour of the respective stored utterance, one or more attributes of text of the respective stored utterance, and first data relating a difference between the prosodic contour of the respective stored utterance to the prosodic contour of a second stored utterance to a difference between a first attribute of the text of the respective stored utterance and the first attribute of the text of the second stored utterance, second data relating a difference between the prosodic contour of the respective stored utterance to the prosodic contour of a third stored utterance to a difference between the first attribute of the text of the respective stored utterance and the first attribute of the text of the third stored utterance, wherein the second stored utterance and the third stored utterance are in the stored utterances, and wherein prosodic contours represent prosodic characteristics of speech at different times; selecting, by the system, a final candidate utterance having a prosodic contour with a closest distance to the hypothetical prosodic contour; and generating, by the system, a prosodic contour for the text to be synthesized based on the contour of the final candidate utterance. | 1. A method implemented by a system of one or more computers, comprising: receiving, at the system, text to be synthesized as a spoken utterance; analyzing, by the system, the received text to determine attributes of the received text; selecting, by the system, one or more candidate utterances from a database of stored utterances based on a comparison between the determined attributes of the received text and corresponding attributes of text representing the stored utterances; determining, by the system for each candidate utterance, a distance between a prosodic contour of the candidate utterance and a hypothetical prosodic contour of the spoken utterance to be synthesized, the determination based on a model that relates a) distances between prosodic contours of pairs of the stored utterances to b) relationships between attributes of text of each of the respective pairs, wherein the model is embodied by information including, for each of the stored utterances: a prosodic contour of the respective stored utterance, one or more attributes of text of the respective stored utterance, and first data relating a difference between the prosodic contour of the respective stored utterance to the prosodic contour of a second stored utterance to a difference between a first attribute of the text of the respective stored utterance and the first attribute of the text of the second stored utterance, second data relating a difference between the prosodic contour of the respective stored utterance to the prosodic contour of a third stored utterance to a difference between the first attribute of the text of the respective stored utterance and the first attribute of the text of the third stored utterance, wherein the second stored utterance and the third stored utterance are in the stored utterances, and wherein prosodic contours represent prosodic characteristics of speech at different times; selecting, by the system, a final candidate utterance having a prosodic contour with a closest distance to the hypothetical prosodic contour; and generating, by the system, a prosodic contour for the text to be synthesized based on the contour of the final candidate utterance. 14. The method of claim 1 , wherein the determined attributes of the received text include an indication of whether or not the received text begins with a stressed portion. | 0.732919 |
9,390,137 | 12 | 13 | 12. An apparatus of claim 11 , wherein the apparatus is further caused to: determine one or more object contextual attributes associated with the one or more results, wherein the at least one ordering metric is further based, at least in part, on the one or more object contextual attributes. | 12. An apparatus of claim 11 , wherein the apparatus is further caused to: determine one or more object contextual attributes associated with the one or more results, wherein the at least one ordering metric is further based, at least in part, on the one or more object contextual attributes. 13. An apparatus of claim 12 , wherein the apparatus is further caused to: determine an accuracy, a precision, a resolution, or a combination thereof of the one or more object contextual attributes; and cause, at least in part, a display of one or more representations of the accuracy, the precision, the resolution, or a combination thereof. | 0.5 |
7,716,219 | 11 | 13 | 11. A database search system comprising: a storage element storing keywords entered by at least one user for a plurality of search terms and information related to converted transactions associated with a plurality of searches, the plurality of searches having been performed on the keywords; and a processing system coupled to the storage element, the processing system operative to perform steps comprising: estimating a general transaction probability; estimating unigram keyword probabilities; determining conditional probability values associated with the keywords based on the converted transactions; estimating keyword transaction probabilities based on the general transaction probability, the unigram keyword probabilities, and the conditional probability values; and generating expected transaction values based on the keyword transaction probabilities, wherein the expected transaction values are generated according to: E ( T ❘ k , S ) = P ( T ❘ k , S ) * ∑ ∀ t R ( t ❘ k , S ) C ( t ❘ k , S ) , where C(t|k,S) is a non-zero value. | 11. A database search system comprising: a storage element storing keywords entered by at least one user for a plurality of search terms and information related to converted transactions associated with a plurality of searches, the plurality of searches having been performed on the keywords; and a processing system coupled to the storage element, the processing system operative to perform steps comprising: estimating a general transaction probability; estimating unigram keyword probabilities; determining conditional probability values associated with the keywords based on the converted transactions; estimating keyword transaction probabilities based on the general transaction probability, the unigram keyword probabilities, and the conditional probability values; and generating expected transaction values based on the keyword transaction probabilities, wherein the expected transaction values are generated according to: E ( T ❘ k , S ) = P ( T ❘ k , S ) * ∑ ∀ t R ( t ❘ k , S ) C ( t ❘ k , S ) , where C(t|k,S) is a non-zero value. 13. The database search system of claim 11 , wherein the processing system is further operative to perform a step of periodically updating the expected transaction values. | 0.706186 |
8,037,069 | 1 | 6 | 1. A system, comprising: a data structure populated with document tokens selected from signatures of documents and member tokens selected from database members, the data structure including entries identifying co-occurrences of the document tokens and the member tokens; a filter component configured to identify individual documents that cannot match individual database members using the co-occurrences identified in the data structure; a verification component configured to receive a remainder of the documents and to verify whether sub-strings of the remainder of the documents match the individual database members; and at least one computing device configured to execute one or more of the filter component or the verification component. | 1. A system, comprising: a data structure populated with document tokens selected from signatures of documents and member tokens selected from database members, the data structure including entries identifying co-occurrences of the document tokens and the member tokens; a filter component configured to identify individual documents that cannot match individual database members using the co-occurrences identified in the data structure; a verification component configured to receive a remainder of the documents and to verify whether sub-strings of the remainder of the documents match the individual database members; and at least one computing device configured to execute one or more of the filter component or the verification component. 6. The system of claim 1 , wherein the data structure comprises an inverted signature-based hashtable. | 0.811111 |
8,055,642 | 1 | 2 | 1. A method comprising: providing a first set of instructions configured to cause a client device to: parse a displayed portion of content, locate a set of terms in the displayed portion of content, based on the parsing; and, in response to locating the set of terms, send the set of terms to a server; receiving, at the server, from the client device, a first request comprising the set of terms; based on the set of terms, the server identifying one or more coupon offers; in response to the first request, the server sending to the client device a second set of instructions configured to cause the client device to: display, in association with a particular term in the displayed portion of content, an interface comprising information about the one or more coupon offers and a control for selecting a particular coupon offer of the one or more coupon offers; and, upon a user selecting the control, send information identifying the particular coupon offer to a coupon distribution server; wherein the second set of instructions is further configured to cause display of a plurality of interfaces, each interface of the plurality of interfaces configured to appear in association with a different term of the set of terms, and each interface of the plurality of interfaces comprising information about at least one coupon offer, of the one or more coupon offers, that was identified by the server based on the different term in association with which the interface is configured to appear; receiving, at the coupon distribution server, from the client device, a second request identifying the particular coupon offer; in response to the second request, the coupon distribution server providing the user with a coupon corresponding to the particular coupon offer; wherein at least the steps of identifying one or more coupon offers and providing the coupon are performed by one or more computing devices. | 1. A method comprising: providing a first set of instructions configured to cause a client device to: parse a displayed portion of content, locate a set of terms in the displayed portion of content, based on the parsing; and, in response to locating the set of terms, send the set of terms to a server; receiving, at the server, from the client device, a first request comprising the set of terms; based on the set of terms, the server identifying one or more coupon offers; in response to the first request, the server sending to the client device a second set of instructions configured to cause the client device to: display, in association with a particular term in the displayed portion of content, an interface comprising information about the one or more coupon offers and a control for selecting a particular coupon offer of the one or more coupon offers; and, upon a user selecting the control, send information identifying the particular coupon offer to a coupon distribution server; wherein the second set of instructions is further configured to cause display of a plurality of interfaces, each interface of the plurality of interfaces configured to appear in association with a different term of the set of terms, and each interface of the plurality of interfaces comprising information about at least one coupon offer, of the one or more coupon offers, that was identified by the server based on the different term in association with which the interface is configured to appear; receiving, at the coupon distribution server, from the client device, a second request identifying the particular coupon offer; in response to the second request, the coupon distribution server providing the user with a coupon corresponding to the particular coupon offer; wherein at least the steps of identifying one or more coupon offers and providing the coupon are performed by one or more computing devices. 2. The method of claim 1 , wherein providing the first set of instructions comprises sending the first set of instructions to the client device. | 0.843818 |
9,619,439 | 1 | 8 | 1. A computer-implemented method for providing a font, the method comprising: receiving a request from a client device to download a font; accessing the requested font, wherein the accessed font comprises a requested character map and a requested glyph table; creating a supported character list and a modified font based on the requested character map, wherein the modified font comprises a modified character map and a modified glyph table, and wherein the modified character map comprises placeholder data for at least one character of the accessed font; compressing the modified font; sending the supported character list and the compressed modified font to the client device; sending, to the client device after sending the supported character list and the compressed modified font to the client device, character data comprising character map data for the at least one character in the modified font, and glyph data for the at least one character in the modified font, and location data for the character map data and the glyph data; wherein the character map data is for filling in the placeholder data for the at least one character in the modified character map in the modified font based on the location data; and wherein the glyph data is for merging the at least one character into the modified glyph table based on the location data. | 1. A computer-implemented method for providing a font, the method comprising: receiving a request from a client device to download a font; accessing the requested font, wherein the accessed font comprises a requested character map and a requested glyph table; creating a supported character list and a modified font based on the requested character map, wherein the modified font comprises a modified character map and a modified glyph table, and wherein the modified character map comprises placeholder data for at least one character of the accessed font; compressing the modified font; sending the supported character list and the compressed modified font to the client device; sending, to the client device after sending the supported character list and the compressed modified font to the client device, character data comprising character map data for the at least one character in the modified font, and glyph data for the at least one character in the modified font, and location data for the character map data and the glyph data; wherein the character map data is for filling in the placeholder data for the at least one character in the modified character map in the modified font based on the location data; and wherein the glyph data is for merging the at least one character into the modified glyph table based on the location data. 8. The computer-implemented method of claim 1 , wherein the glyph data for merging into the modified glyph table based on the location data is merged based on positional offset data provided by the location data. | 0.811052 |
8,897,550 | 4 | 5 | 4. The method of claim 1 , comprising propagating the initial landmark locations from a first set of images to a second set of images that is larger than the first set of images using a computer in response to algorithmic software. | 4. The method of claim 1 , comprising propagating the initial landmark locations from a first set of images to a second set of images that is larger than the first set of images using a computer in response to algorithmic software. 5. The method of claim 4 , wherein the first set of images is within an object class and the second sets of images is within the object class. | 0.5 |
7,747,607 | 11 | 12 | 11. A volatile or non-volatile machine-readable storage medium as recited in claim 9 , wherein the one or more sequences of instructions, when executed by one or more processors, further causes the one or more processors to perform: storing data identifying the sub-strings of said string that are logically related to said string; and wherein the one ore more sequences of instructions, when executed by the one or more processors, causes the search engine to suggest alternative queries to a user based on said data. | 11. A volatile or non-volatile machine-readable storage medium as recited in claim 9 , wherein the one or more sequences of instructions, when executed by one or more processors, further causes the one or more processors to perform: storing data identifying the sub-strings of said string that are logically related to said string; and wherein the one ore more sequences of instructions, when executed by the one or more processors, causes the search engine to suggest alternative queries to a user based on said data. 12. A volatile or non-volatile machine-readable storage medium as recited in claim 11 , wherein the one or more sequences of instructions, when executed by the one or more processors, causes the search engine to suggest alternative queries to a user based on said data by performing: receiving, from said user, a user-formulated query; determining that said user-formulated query contains said string; reading said data to determine the sub-strings of said string that are logically related to said string; and generating one or more alternative queries based on the sub-strings of said string that are logically related to said string. | 0.5 |
9,954,970 | 1 | 4 | 1. An apparatus for providing content to a network browser based on a reported latency comprising: a memory operative to store an item of content for a web page; and a processor operative to: receive a latency measurement from the web browser or a plug-in of the web browser, the latency measurement being based on an amount of time that has passed between two network browser events and a type of action that resulted in the network browser transitioning its display between the two events; and modify data associated with the item of content for the web page with a different form of the data to account for the received latency measurement. | 1. An apparatus for providing content to a network browser based on a reported latency comprising: a memory operative to store an item of content for a web page; and a processor operative to: receive a latency measurement from the web browser or a plug-in of the web browser, the latency measurement being based on an amount of time that has passed between two network browser events and a type of action that resulted in the network browser transitioning its display between the two events; and modify data associated with the item of content for the web page with a different form of the data to account for the received latency measurement. 4. The apparatus of claim 1 , wherein the processor is operative to modify data associated with the item of content when the received latency measurement indicates a high latency. | 0.757453 |
9,727,556 | 7 | 12 | 7. A system for summarizing a document, the system comprising: a processor that is adapted to execute stored instructions; and a memory device that stores instructions, the memory device comprising processor-executable code, that when executed by the processor, is adapted to: detect, for each sentence in said document, a concept in said sentence; associate each detected concept with a weight, wherein said weight represents a degree of similarity between the detected concept and its corresponding reference concept in a concept library available over the Internet; represent each sentence with a vector comprising concept-weight pairs; according to the detected concepts, compute relevance measures between the sentences, wherein the relevance measures are based on a respective vector representation of each sentence; construct a concept-aware graph, wherein a node in said graph represents each said sentence in the document and an edge between two nodes represents the relevance measure between two sentences represented by the two nodes; utilize the concept-aware graph to rank the sentences in the document; and summarize the document by selecting representative sentences based on the ranks. | 7. A system for summarizing a document, the system comprising: a processor that is adapted to execute stored instructions; and a memory device that stores instructions, the memory device comprising processor-executable code, that when executed by the processor, is adapted to: detect, for each sentence in said document, a concept in said sentence; associate each detected concept with a weight, wherein said weight represents a degree of similarity between the detected concept and its corresponding reference concept in a concept library available over the Internet; represent each sentence with a vector comprising concept-weight pairs; according to the detected concepts, compute relevance measures between the sentences, wherein the relevance measures are based on a respective vector representation of each sentence; construct a concept-aware graph, wherein a node in said graph represents each said sentence in the document and an edge between two nodes represents the relevance measure between two sentences represented by the two nodes; utilize the concept-aware graph to rank the sentences in the document; and summarize the document by selecting representative sentences based on the ranks. 12. The system of claim 7 , further comprising instructions adapted to determine relevance scores between the detected concepts, and wherein the relevance measures between two sentences are based on the relevance scores between pairs of the detected concepts in the sentences. | 0.574074 |
8,195,693 | 13 | 16 | 13. A non-transitory storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform a method of automatically matching schemas, said method comprising: extracting source and target schemas from sources and targets; extracting source and target attributes from said schemas, wherein each source schema extracted from said sources will have multiple source attributes and each target schema extracted from said targets will have multiple target attributes; representing said source attributes and said target attributes as nodes in a bipartite graph, wherein said bipartite graph has edges between source and target nodes that are related to each other; defining a plurality of similarity scores between each set of related nodes, wherein each of said similarity scores is based on a different context-specific cue of said attributes that said nodes represent, wherein context-specific cues comprise lexical name, semantic name, type, structure, and functional mappings; computing an overall weight for each edge in said bipartite graph by combining said similarity scores of each set of nodes that form an edge; obtaining an optimal matching between said source and target schemas by maximizing the number of nodes matched and maximizing the weight of selected edges to produce a matching score; ranking such matching according to weights of said edges between said related nodes, for matchings having the same number of nodes; and outputting the matching nodes, said extracting of said schemas from said sources and targets comprising matching an output message of an operation in a source to an input message of a target. | 13. A non-transitory storage device readable by machine, tangibly embodying a program of instructions executable by the machine to perform a method of automatically matching schemas, said method comprising: extracting source and target schemas from sources and targets; extracting source and target attributes from said schemas, wherein each source schema extracted from said sources will have multiple source attributes and each target schema extracted from said targets will have multiple target attributes; representing said source attributes and said target attributes as nodes in a bipartite graph, wherein said bipartite graph has edges between source and target nodes that are related to each other; defining a plurality of similarity scores between each set of related nodes, wherein each of said similarity scores is based on a different context-specific cue of said attributes that said nodes represent, wherein context-specific cues comprise lexical name, semantic name, type, structure, and functional mappings; computing an overall weight for each edge in said bipartite graph by combining said similarity scores of each set of nodes that form an edge; obtaining an optimal matching between said source and target schemas by maximizing the number of nodes matched and maximizing the weight of selected edges to produce a matching score; ranking such matching according to weights of said edges between said related nodes, for matchings having the same number of nodes; and outputting the matching nodes, said extracting of said schemas from said sources and targets comprising matching an output message of an operation in a source to an input message of a target. 16. The program storage device according to claim 13 , wherein said defining of said plurality of similarity scores comprises determining similarity of type by recursively traversing at least one of language type hierarchy and abstract data type hierarchy in said source and target schemas. | 0.5 |
8,117,237 | 1 | 5 | 1. A method making it possible to manage named entities that are presented in different graphical or syntactic forms and refer to the same entity contained in a database ( 3 ), wherein it comprises at least the following steps: applying a Levenshtein method to said entities E i in the database in order to create a similarity between said entities, defining the measurement of similarity between two entities in the following manner S l ( Ei , E j ) = 1 - D ( E i , E j ) max ( E i , E j ) with S l being the measurement of similarity between the two entities (E i ,E j ) in the database, D being the Levenshtein distance between the two entities, |E i | respectively |E j | being the number of characters of E i , respectively E j , using the n-grams method to create a similarity S n (E i ,E j ) between the A entities constituting the database, by extracting from the two entities E i and E j the sets N i of the n-grams of E i and the set N j of the n-grams of E j , then defining the number of n-grams |N i | deduced from E i and the number of n-grams |N j | deduced from E j , the similarity between E 1 and E j is then defined by: S n ( E i , E j ) = N i ⋂ N j min ( N i , N j ) ; using a method of merging the data on said entities in the database in order to construct at least 2 classifications, respectively relating to the n-grams similarity with n greater than or equal to 2, said classifications corresponding to sets of entity partitions P i , wherein the partitions Pi correspond with the classifications of all the entities in the database; finding the consensus partition P c between the M partitions found, using the canonic form entity E c to view the result or else modify the entities present in the database through the canonic form entity. | 1. A method making it possible to manage named entities that are presented in different graphical or syntactic forms and refer to the same entity contained in a database ( 3 ), wherein it comprises at least the following steps: applying a Levenshtein method to said entities E i in the database in order to create a similarity between said entities, defining the measurement of similarity between two entities in the following manner S l ( Ei , E j ) = 1 - D ( E i , E j ) max ( E i , E j ) with S l being the measurement of similarity between the two entities (E i ,E j ) in the database, D being the Levenshtein distance between the two entities, |E i | respectively |E j | being the number of characters of E i , respectively E j , using the n-grams method to create a similarity S n (E i ,E j ) between the A entities constituting the database, by extracting from the two entities E i and E j the sets N i of the n-grams of E i and the set N j of the n-grams of E j , then defining the number of n-grams |N i | deduced from E i and the number of n-grams |N j | deduced from E j , the similarity between E 1 and E j is then defined by: S n ( E i , E j ) = N i ⋂ N j min ( N i , N j ) ; using a method of merging the data on said entities in the database in order to construct at least 2 classifications, respectively relating to the n-grams similarity with n greater than or equal to 2, said classifications corresponding to sets of entity partitions P i , wherein the partitions Pi correspond with the classifications of all the entities in the database; finding the consensus partition P c between the M partitions found, using the canonic form entity E c to view the result or else modify the entities present in the database through the canonic form entity. 5. The method according to claim 1 wherein it comprises a step for sending a request from a user to find the canonic entities in a database and replace said entities with the canonic entity found. | 0.5 |
8,458,189 | 7 | 8 | 7. A non-transitory computer readable storage medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising: generating a first search query based on one or more rules, the first search query querying a database comprising values of attributes of a plurality of objects, the first search query querying data associated with a first object without accounting for a last update stamp of the first object; receiving a first search result in response to the querying by the first search query, the first search result comprising values of attributes of the first object for a plurality of instances of the first object, each instance of the first object including an internal instance key characterizing an identifier associated with an instance of the first object, the instance comprising the internal instance key and the values of attributes of the first object, the internal instance key and the values of attributes being included within a tagger identifier; generating a second search query comprising a plurality of subqueries, each subquery including values of corresponding one or more attributes of the first object, the plurality of subqueries querying data associated with a second object tagged with the first object; receiving a second search result in response to the querying by the plurality of subqueries, the second search result including a plurality of instances of the second object; and generating, based on the first search result and the second search result, cross-relationships between one or more instances of the first object with one or more instances of the second object, the cross-relationship characterizing associations between one or more internal instance key and values of one or more attributes. | 7. A non-transitory computer readable storage medium storing instructions that, when executed by at least one programmable processor, cause the at least one programmable processor to perform operations comprising: generating a first search query based on one or more rules, the first search query querying a database comprising values of attributes of a plurality of objects, the first search query querying data associated with a first object without accounting for a last update stamp of the first object; receiving a first search result in response to the querying by the first search query, the first search result comprising values of attributes of the first object for a plurality of instances of the first object, each instance of the first object including an internal instance key characterizing an identifier associated with an instance of the first object, the instance comprising the internal instance key and the values of attributes of the first object, the internal instance key and the values of attributes being included within a tagger identifier; generating a second search query comprising a plurality of subqueries, each subquery including values of corresponding one or more attributes of the first object, the plurality of subqueries querying data associated with a second object tagged with the first object; receiving a second search result in response to the querying by the plurality of subqueries, the second search result including a plurality of instances of the second object; and generating, based on the first search result and the second search result, cross-relationships between one or more instances of the first object with one or more instances of the second object, the cross-relationship characterizing associations between one or more internal instance key and values of one or more attributes. 8. The computer readable storage medium of claim 7 , wherein each rule is a conditional rule that is associated with one or more conditions. | 0.832134 |
8,712,956 | 25 | 28 | 25. A system comprising: a semantic layer; a computer to provide a Web Server to: (a) receive a Web Service call that is associated with: (i) a part of a report and (ii) a Web Service, the report part associated with queries of the semantic layer, the report including a report part other than the report part associated with the Web Service call, the Web Service not associated with a Web Service call that is associated with the other report part, and (b) determine, based on the Web Service call that is associated with the part of the report and the Web Service, a query to return contents of the report part; and a computer to provide a report server to receive the query and to return the contents of the report part to the Web Server; wherein the Web Service includes a plurality of descriptions of Web Service calls that are to return contents of the report part and are stored in a repository. | 25. A system comprising: a semantic layer; a computer to provide a Web Server to: (a) receive a Web Service call that is associated with: (i) a part of a report and (ii) a Web Service, the report part associated with queries of the semantic layer, the report including a report part other than the report part associated with the Web Service call, the Web Service not associated with a Web Service call that is associated with the other report part, and (b) determine, based on the Web Service call that is associated with the part of the report and the Web Service, a query to return contents of the report part; and a computer to provide a report server to receive the query and to return the contents of the report part to the Web Server; wherein the Web Service includes a plurality of descriptions of Web Service calls that are to return contents of the report part and are stored in a repository. 28. A system according to claim 25 , wherein the Web Server is further to create an HTTP message including the contents of the report part. | 0.859596 |
7,831,437 | 37 | 38 | 37. The system of claim 30 , wherein each categorization entry in the plurality of categorization entries in the outline library further includes a hierarchical framework of information groupings. | 37. The system of claim 30 , wherein each categorization entry in the plurality of categorization entries in the outline library further includes a hierarchical framework of information groupings. 38. The system of claim 37 , wherein each information grouping comprises one or more pointer structures corresponding respectively to one or more stored data items. | 0.752266 |
8,038,537 | 17 | 18 | 17. A computerized gaming system comprising: a processor; a memory; a game rules script, said game rules script comprising text defining a set of displayable game elements used in the wagering game, the text further including a set of winning outcomes for a game, each of the set of winning outcomes including a set of match rules expressed in terms of the set of displayable game elements; a parser operable to parse the game rules script into a game rules data structure; and a gaming application operable in connection with the processor and the memory to: generate a game outcome, the game outcome including selected elements of the set of displayable game elements; determine if the game outcome matches at least one winning outcome in the set of winning outcomes in accordance with evaluation of the selected elements against the one or more rules provided by the game rules data structure by repeating, until all rules are compared: a comparison of the selected elements against the set of match rules provided by the game rules data structure; and a removal of a matching rule from the set of match rules and a removal of matching elements from the selected elements responsive to matching of the matching elements and the matching rule. | 17. A computerized gaming system comprising: a processor; a memory; a game rules script, said game rules script comprising text defining a set of displayable game elements used in the wagering game, the text further including a set of winning outcomes for a game, each of the set of winning outcomes including a set of match rules expressed in terms of the set of displayable game elements; a parser operable to parse the game rules script into a game rules data structure; and a gaming application operable in connection with the processor and the memory to: generate a game outcome, the game outcome including selected elements of the set of displayable game elements; determine if the game outcome matches at least one winning outcome in the set of winning outcomes in accordance with evaluation of the selected elements against the one or more rules provided by the game rules data structure by repeating, until all rules are compared: a comparison of the selected elements against the set of match rules provided by the game rules data structure; and a removal of a matching rule from the set of match rules and a removal of matching elements from the selected elements responsive to matching of the matching elements and the matching rule. 18. The computerized gaming system of claim 17 , wherein the set of winning outcomes comprise winning outcomes for a card game. | 0.805215 |
8,819,022 | 2 | 5 | 2. The computer-implemented method of claim 1 , wherein managing the topical content comprises updating the navigational structure of the website based on the revised set of topics for the second level of popularity. | 2. The computer-implemented method of claim 1 , wherein managing the topical content comprises updating the navigational structure of the website based on the revised set of topics for the second level of popularity. 5. The computer-implemented method of claim 2 , wherein updating the navigational structure of the website comprises dynamically updating a taxonomy of the website. | 0.541899 |
7,725,291 | 12 | 13 | 12. The method set forth in claim 8 wherein selecting the test includes, if the indication is that the data is continuous, seeking an indication as to the number of samples from which the data are drawn. | 12. The method set forth in claim 8 wherein selecting the test includes, if the indication is that the data is continuous, seeking an indication as to the number of samples from which the data are drawn. 13. The method set forth in claim 12 wherein selecting the test includes seeking an indication of sample size. | 0.5 |
8,713,025 | 19 | 20 | 19. A system, comprising: a computing device and a storage device having computer-executable instructions stored therein which, if executed by the computing device, cause the computing device to perform operations comprising: obtaining a subject entity definition of a subject entity, a node depth criteria and an impact cutoff criteria; aggregating and preparing a plurality of data items that include data related to the subject entity for processing, wherein the data comprises at least one entity function, one or more entity function measures and a creation date for each of the plurality of data items; storing the aggregated plurality of data items in one or more context layers by a component of context; developing a subject entity situation summary by analyzing the subject entity related data, wherein the subject entity situation summary comprises a linear or nonlinear regression model of each of the one or more entity function measures, a relevance for each of the measures and one or more of the context layers; using the subject entity situation summary, the node depth criteria and the impact cutoff criteria to identify components of context to include in a composite index; creating a composite index for the data associated with the identified components of context, wherein the composite index comprises a column for the creation dates of the plurality of data items, a column for each of the identified components of context and a ranking for each of the plurality of data items of the composite index; receiving a search request from a mobile access device, and providing a plurality of search results in response to the search request, wherein the plurality of search results are prioritized using a weight comprised of a mathematical combination of an index position ranking and a ranking provided by a relevance measure, and wherein at least part of the data and the search request are obtained from a mobile device. | 19. A system, comprising: a computing device and a storage device having computer-executable instructions stored therein which, if executed by the computing device, cause the computing device to perform operations comprising: obtaining a subject entity definition of a subject entity, a node depth criteria and an impact cutoff criteria; aggregating and preparing a plurality of data items that include data related to the subject entity for processing, wherein the data comprises at least one entity function, one or more entity function measures and a creation date for each of the plurality of data items; storing the aggregated plurality of data items in one or more context layers by a component of context; developing a subject entity situation summary by analyzing the subject entity related data, wherein the subject entity situation summary comprises a linear or nonlinear regression model of each of the one or more entity function measures, a relevance for each of the measures and one or more of the context layers; using the subject entity situation summary, the node depth criteria and the impact cutoff criteria to identify components of context to include in a composite index; creating a composite index for the data associated with the identified components of context, wherein the composite index comprises a column for the creation dates of the plurality of data items, a column for each of the identified components of context and a ranking for each of the plurality of data items of the composite index; receiving a search request from a mobile access device, and providing a plurality of search results in response to the search request, wherein the plurality of search results are prioritized using a weight comprised of a mathematical combination of an index position ranking and a ranking provided by a relevance measure, and wherein at least part of the data and the search request are obtained from a mobile device. 20. The system of claim 19 , wherein the linear or nonlinear regression model is developed using automated learning, and wherein the automated learning comprises: completing a multi-stage process, wherein each stage of the multi-stage process comprises an automated selection of an output from a plurality of outputs produced by a plurality of modeling algorithms after processing at least part of the data, wherein linearity of the linear or nonlinear regression model is determined by learning from the data, and wherein the plurality of modeling algorithms are selected from the group consisting of: neural network; classification and regression tree; generalized autoregressive conditional heteroskedasticity; projection pursuit regression; generalized additive model; linear regression, path analysis; Bayesian; multivariate adaptive regression spline and support vector method. | 0.5 |
9,378,293 | 5 | 6 | 5. The method of claim 4 , further comprising: reading a set of dynamic content data; and inserting the dynamic content data into an output page according to the second page markup language data. | 5. The method of claim 4 , further comprising: reading a set of dynamic content data; and inserting the dynamic content data into an output page according to the second page markup language data. 6. The method of claim 5 , wherein the set of dynamic content data is transformed into a format described by a set of one or more result markup language files. | 0.5 |
8,452,795 | 22 | 23 | 22. The method of claim 21 , further comprising determining an order for the query suggestions and presenting the query suggestions according to the order. | 22. The method of claim 21 , further comprising determining an order for the query suggestions and presenting the query suggestions according to the order. 23. The method of claim 22 , wherein determining the order comprises determining an order that separates the obtained candidate queries from the query specializations. | 0.528249 |
9,516,004 | 1 | 7 | 1. A system, comprising: a non-transitory memory storing a list of common credentials; a network interface component, configured to receive a credential associated with a user authentication attempt; and one or more hardware processors configured to execute instructions to cause the system to perform operations comprising: determining if the received credential is correct; comparing the received credential to the list of common credentials when the received credential is not correct; and when the received credential matches a common credential on the list of common credentials: increasing a score by a weighted factor based on the received credential matching the common credential, wherein increasing the score indicates an increased likelihood that an attacker is entering common credentials in a horizontal attack in order to gain access to a user account; storing a time associated with the score increase; and making a security determination based on the score; wherein the weighted factor is lower when a time since a previous score increase is greater than a threshold time than when the time since the previous score increase is less than or equal to the threshold time. | 1. A system, comprising: a non-transitory memory storing a list of common credentials; a network interface component, configured to receive a credential associated with a user authentication attempt; and one or more hardware processors configured to execute instructions to cause the system to perform operations comprising: determining if the received credential is correct; comparing the received credential to the list of common credentials when the received credential is not correct; and when the received credential matches a common credential on the list of common credentials: increasing a score by a weighted factor based on the received credential matching the common credential, wherein increasing the score indicates an increased likelihood that an attacker is entering common credentials in a horizontal attack in order to gain access to a user account; storing a time associated with the score increase; and making a security determination based on the score; wherein the weighted factor is lower when a time since a previous score increase is greater than a threshold time than when the time since the previous score increase is less than or equal to the threshold time. 7. The system of claim 1 , wherein the weighted factor is based on a recentness of a successful authentication attempt by the user. | 0.636111 |
9,646,609 | 2 | 5 | 2. The method of claim 1 , wherein storing the first and second pronunciations for the first named entity in the shared pronunciation lexicon comprises: determining one or more first context tags for the first pronunciation for the first named entity; storing the first pronunciation for the first named entity in association with the determined one or more first context tags; determining one or more second context tags for the second pronunciation for the first named entity; and storing the second pronunciation for the first named entity in association with the determined one or more second context tags. | 2. The method of claim 1 , wherein storing the first and second pronunciations for the first named entity in the shared pronunciation lexicon comprises: determining one or more first context tags for the first pronunciation for the first named entity; storing the first pronunciation for the first named entity in association with the determined one or more first context tags; determining one or more second context tags for the second pronunciation for the first named entity; and storing the second pronunciation for the first named entity in association with the determined one or more second context tags. 5. The method of claim 2 , wherein the one or more first context tags comprise a language tag identifying a language associated with the first pronunciation for the first named entity. | 0.528205 |
9,329,874 | 10 | 11 | 10. The computer-implemented method of claim 7 , wherein the menu document and the string document use extensible markup language (XML). | 10. The computer-implemented method of claim 7 , wherein the menu document and the string document use extensible markup language (XML). 11. The computer-implemented method of claim 10 , further comprising verifying an extensible markup language (XML) schema employed by the menu document or the string document. | 0.5 |
9,519,872 | 15 | 16 | 15. The method according to claim 10 , further comprising an act of determining an aspect of software using the determined business ontology. | 15. The method according to claim 10 , further comprising an act of determining an aspect of software using the determined business ontology. 16. The method according to claim 15 , further comprising an act of determining an information model using the determined business ontology. | 0.5 |
9,444,935 | 16 | 27 | 16. An apparatus, comprising: at least one processor; and a memory having stored therein machine executable instructions, that when executed by the at least one processor, cause the apparatus to: generate a plurality of test scripts, a test script from among the plurality of test scripts generated by performing: initiating a voice call interaction with a speech application, the speech application comprising a network of interaction nodes; and repeatedly performing, until a stopping condition is encountered, the steps of: executing the voice call interaction with the speech application by traversing through one or more interaction nodes from among the network of interaction nodes until an interaction node requiring a response is encountered; selecting an utterance generation mode corresponding to the interaction node; determining a response to be provided corresponding to the interaction node of the speech application based on the utterance generation mode; and providing the response to the speech application, wherein the test script comprises instructions for traversing interaction nodes involved during a course of the voice call interaction, and, instructions for provisioning one or more responses to the speech application during the course of the voice call interaction; identify one or more test scripts from among the plurality of test scripts based on a pre-determined objective; and provide the one or more test scripts to a user for facilitating testing of the speech application. | 16. An apparatus, comprising: at least one processor; and a memory having stored therein machine executable instructions, that when executed by the at least one processor, cause the apparatus to: generate a plurality of test scripts, a test script from among the plurality of test scripts generated by performing: initiating a voice call interaction with a speech application, the speech application comprising a network of interaction nodes; and repeatedly performing, until a stopping condition is encountered, the steps of: executing the voice call interaction with the speech application by traversing through one or more interaction nodes from among the network of interaction nodes until an interaction node requiring a response is encountered; selecting an utterance generation mode corresponding to the interaction node; determining a response to be provided corresponding to the interaction node of the speech application based on the utterance generation mode; and providing the response to the speech application, wherein the test script comprises instructions for traversing interaction nodes involved during a course of the voice call interaction, and, instructions for provisioning one or more responses to the speech application during the course of the voice call interaction; identify one or more test scripts from among the plurality of test scripts based on a pre-determined objective; and provide the one or more test scripts to a user for facilitating testing of the speech application. 27. The apparatus of claim 16 , wherein the apparatus is further caused to: score the plurality of test scripts based at least in part on a number of interaction nodes of the speech application traversed during the course of respective voice call interaction and a number of steps involved in traversing the number of interaction nodes, wherein each test script is associated with a respective score upon scoring of the plurality of tests scripts; and rank the plurality of test scripts based on the respective score of the each test script. | 0.522928 |
8,055,669 | 1 | 12 | 1. A method of modifying a search query, performed by a server device, the method comprising: determining, by the server device, one or more alternative terms for one or more terms in the search query; obtaining, by the server device, search results based on the search query and based on an indexed corpus of documents, each search result identifying one or more documents in the indexed corpus of documents; defining, by the server device, a query context as a plurality of the documents identified by the search results; comparing, by the server device, the query context to the alternative terms to generate one or more valid ones of the alternative terms; and incorporating, by the server device, one or more of the valid ones of the alternative terms into the search query to obtain a modified search query. | 1. A method of modifying a search query, performed by a server device, the method comprising: determining, by the server device, one or more alternative terms for one or more terms in the search query; obtaining, by the server device, search results based on the search query and based on an indexed corpus of documents, each search result identifying one or more documents in the indexed corpus of documents; defining, by the server device, a query context as a plurality of the documents identified by the search results; comparing, by the server device, the query context to the alternative terms to generate one or more valid ones of the alternative terms; and incorporating, by the server device, one or more of the valid ones of the alternative terms into the search query to obtain a modified search query. 12. The method of claim 1 , where the search results were generated using a previously performed search. | 0.876485 |
8,438,279 | 15 | 18 | 15. A non-transitory computer readable storage system having stored thereon instructions that, when executed, direct a computing system to perform operations comprising: obtaining a URL request from a user computing device, the URL request specifying a URL that includes a name of a domain followed by a character string; determining whether the character string references an invalid location; in response to determining that the character string references an invalid location, generating a modified character string at least partly by replacing a non-URL escape sequence in the character string with a corresponding special character associated with the non-URL escape sequence, wherein generating the modified character string comprises at least one of the following: (a) performing URL decoding on the character string two times to repair a doubly URL encoded portion of the character string, and (b) removing malicious content embedded in the URL; determining whether the modified character string resolves to valid content; when the modified character string is determined to resolve to valid content, providing a modified URL including the name of the domain and the modified character string; and when the modified character string is determined to not resolve to valid content, identifying a substitute URL and providing the substitute URL. | 15. A non-transitory computer readable storage system having stored thereon instructions that, when executed, direct a computing system to perform operations comprising: obtaining a URL request from a user computing device, the URL request specifying a URL that includes a name of a domain followed by a character string; determining whether the character string references an invalid location; in response to determining that the character string references an invalid location, generating a modified character string at least partly by replacing a non-URL escape sequence in the character string with a corresponding special character associated with the non-URL escape sequence, wherein generating the modified character string comprises at least one of the following: (a) performing URL decoding on the character string two times to repair a doubly URL encoded portion of the character string, and (b) removing malicious content embedded in the URL; determining whether the modified character string resolves to valid content; when the modified character string is determined to resolve to valid content, providing a modified URL including the name of the domain and the modified character string; and when the modified character string is determined to not resolve to valid content, identifying a substitute URL and providing the substitute URL. 18. The non-transitory computer readable storage system of claim 15 , wherein providing the substitute URL comprises providing the substitute URL to a web server in communication with the user computing device, the web server configured to serve content associated with the substitute URL to the user computing device. | 0.558333 |
7,779,342 | 12 | 13 | 12. The device of claim 11 , wherein the temporal document is video or audio material. | 12. The device of claim 11 , wherein the temporal document is video or audio material. 13. The device of claim 12 , wherein the video material is stored on a video server. | 0.5 |
9,385,972 | 19 | 20 | 19. The apparatus of claim 10 further comprising the decision tree for processing responses to the suggested reaction and providing modification to weight to the suggestion module, the decision tree coupled to receive user responses from the user interface module and coupled to output modifications to the suggestion module. | 19. The apparatus of claim 10 further comprising the decision tree for processing responses to the suggested reaction and providing modification to weight to the suggestion module, the decision tree coupled to receive user responses from the user interface module and coupled to output modifications to the suggestion module. 20. The apparatus of claim 19 wherein the decision tree is an artificial intelligence-based decision tree. | 0.5 |
7,729,916 | 7 | 9 | 7. The method of claim 1 , further comprising the step of maintaining the context of each active task. | 7. The method of claim 1 , further comprising the step of maintaining the context of each active task. 9. The method of claim 7 , wherein the step of maintaining the context comprises maintaining one of query arguments, I/O events, application state, conversational arguments, application events, and a combination thereof, associated with the active task. | 0.5 |
9,008,490 | 1 | 4 | 1. A computer-implemented method comprising: receiving data encoding sounds produced by a human voice; extracting a monophonic melody line from an audio channel of the data encoding the sounds produced by the human voice; providing, to a recognizer that recognizes songs from sounds produced by a human voice, the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice; comparing, at the recognizer that recognizes songs from sounds produced by a human voice, the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice with one or more monophonic melody lines of candidate videos of a subset of a set of candidate videos that are each (i) identified as being associated with a particular song, and (ii) are classified as a cappella video recordings; determining, based on the comparison, that the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice matches one or more of the one or more monophonic melody lines of the candidate videos of the subset; and in response to determining that the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice matches one or more of the one or more monophonic melody lines of the candidate videos of the subset, providing an identifier of the particular song for output. | 1. A computer-implemented method comprising: receiving data encoding sounds produced by a human voice; extracting a monophonic melody line from an audio channel of the data encoding the sounds produced by the human voice; providing, to a recognizer that recognizes songs from sounds produced by a human voice, the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice; comparing, at the recognizer that recognizes songs from sounds produced by a human voice, the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice with one or more monophonic melody lines of candidate videos of a subset of a set of candidate videos that are each (i) identified as being associated with a particular song, and (ii) are classified as a cappella video recordings; determining, based on the comparison, that the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice matches one or more of the one or more monophonic melody lines of the candidate videos of the subset; and in response to determining that the monophonic melody line extracted from the audio channel of the data encoding the sounds produced by the human voice matches one or more of the one or more monophonic melody lines of the candidate videos of the subset, providing an identifier of the particular song for output. 4. The method of claim 1 , wherein providing the identifier of the particular song for output comprises providing, for output, one or more of a name of the particular song, a name of an artist associated with the particular song, an advertisement associated with purchasing the particular song, or a link associated with purchasing the particular song. | 0.854905 |
8,435,038 | 26 | 27 | 26. The method of claim 25 , further comprising: allowing the teacher to annotate the demonstration video feed. | 26. The method of claim 25 , further comprising: allowing the teacher to annotate the demonstration video feed. 27. The method of claim 26 , further comprising: allowing the teacher to add a vocal commentary to the demonstration video feed. | 0.5 |
10,062,081 | 13 | 14 | 13. The system of claim 11 , wherein the module is further configured for transporting the business context instance of the thread from one application server to another. | 13. The system of claim 11 , wherein the module is further configured for transporting the business context instance of the thread from one application server to another. 14. The system of claim 13 , wherein the module is further configured for: determining if the business context is directed to be transported across a Java messaging service (JMS) in an application message; and, on condition that the business context is directed to be transported across a JMS in an application message, formatting the business context and corresponding properties into an extensible markup language (XML) document and transporting the formatted business context as a JMS header property in an application message. | 0.5 |
7,934,264 | 1 | 2 | 1. A method for using metadata to detect alteration of audio data, image data, or both, the method comprising: recording a first set of metadata characteristics for a first set of data representing original data, the first set of metadata characteristics including at least one respective semantic description for the first set of data; recording a second set of metadata characteristics for a second set of data representing data under test, the second set of metadata characteristics including at least one corresponding semantic description for the second set of data; comparing the first and second sets of metadata characteristics wherein, in the event the first and second sets of metadata characteristics are not identical, then the second set of data is identified as an altered version of the first set of data, and performing the comparing by comparing the first and second sets of metadata characteristics to identify one or more of: at least one location in the first set of data that have been altered, or at least one metadata characteristic that has changed from the first set of data to the second set of data, wherein the at least one metadata characteristic that has changed is identified using the at least one semantic description for the first set of data and the at least one corresponding semantic description for the second set of data; and at least one metadata characteristic that has changed from the first set of data to the second set of data is identified using the at least one semantic description for the first set of data and the at least one corresponding semantic description for the second set of data, the method further comprising using the identified at least one metadata characteristic to define a change of semantic meaning between the first set of data and the second set of data, determining whether or not the defined change of semantic meaning changes an overall meaning of a message defined by the first set of data and, if so, generating an alert indicative of a possible criminal intent in altering the message corresponding to the first set of data. | 1. A method for using metadata to detect alteration of audio data, image data, or both, the method comprising: recording a first set of metadata characteristics for a first set of data representing original data, the first set of metadata characteristics including at least one respective semantic description for the first set of data; recording a second set of metadata characteristics for a second set of data representing data under test, the second set of metadata characteristics including at least one corresponding semantic description for the second set of data; comparing the first and second sets of metadata characteristics wherein, in the event the first and second sets of metadata characteristics are not identical, then the second set of data is identified as an altered version of the first set of data, and performing the comparing by comparing the first and second sets of metadata characteristics to identify one or more of: at least one location in the first set of data that have been altered, or at least one metadata characteristic that has changed from the first set of data to the second set of data, wherein the at least one metadata characteristic that has changed is identified using the at least one semantic description for the first set of data and the at least one corresponding semantic description for the second set of data; and at least one metadata characteristic that has changed from the first set of data to the second set of data is identified using the at least one semantic description for the first set of data and the at least one corresponding semantic description for the second set of data, the method further comprising using the identified at least one metadata characteristic to define a change of semantic meaning between the first set of data and the second set of data, determining whether or not the defined change of semantic meaning changes an overall meaning of a message defined by the first set of data and, if so, generating an alert indicative of a possible criminal intent in altering the message corresponding to the first set of data. 2. The method of claim 1 wherein recording a first set of metadata characteristics and recording a second set of metadata characteristics are performed using at least one of speech recognition, image recognition, or biometrics recognition. | 0.724018 |
9,117,125 | 15 | 20 | 15. A computer-readable, non-transitory storage medium having stored thereon a computer program which is executable by a computer, the computer program controlling the computer to execute functions of: displaying on a screen a handwritten document including a plurality of strokes described by handwriting; transmitting to a system a handwritten part designated by a select range on the screen; receiving from the system a reshaping result corresponding to the handwritten part; changing a line kind or a color of a plurality of strokes included in the handwritten part; and displaying the reshaping result in a manner to at least partially overlap with a display area of the handwritten part. | 15. A computer-readable, non-transitory storage medium having stored thereon a computer program which is executable by a computer, the computer program controlling the computer to execute functions of: displaying on a screen a handwritten document including a plurality of strokes described by handwriting; transmitting to a system a handwritten part designated by a select range on the screen; receiving from the system a reshaping result corresponding to the handwritten part; changing a line kind or a color of a plurality of strokes included in the handwritten part; and displaying the reshaping result in a manner to at least partially overlap with a display area of the handwritten part. 20. The storage medium of claim 15 , wherein the computer program further controls the computer to execute functions of: when the handwritten part includes one or more strokes corresponding to a handwritten character and one or more strokes other than a handwritten character, erasing a locus of the one or more strokes corresponding to the handwritten character from the screen; changing a line kind or a color of the one or more strokes other than the handwritten character; and displaying a display area of the reshaping result and a display area of the handwritten part in a partly overlapping manner. | 0.5 |
9,612,669 | 1 | 6 | 1. A computer-implemented method for text input, the method comprising: receiving a sequence of input characters corresponding to a user actuating multiple areas of an input device; computing a first probability for a candidate word of multiple words in a dictionary, wherein the first probability for the candidate word is computed by combining multiple character difference probabilities, wherein each character difference probability is computed, for each selected character in the sequence of input characters, by applying a probability distribution that indicates, for the selected character, that a character of multiple characters of the candidate word was intended when the area of the input device corresponding to the selected character was actuated; obtaining a second probability for the candidate word, wherein the second probability for the candidate word indicates a likelihood, independent of the sequence of input characters, of occurrence of the candidate word; and in response to receiving the sequence of input characters, selecting the candidate word, using one or more processors, based on a combination of the first probability for the candidate word and the second probability for the candidate word. | 1. A computer-implemented method for text input, the method comprising: receiving a sequence of input characters corresponding to a user actuating multiple areas of an input device; computing a first probability for a candidate word of multiple words in a dictionary, wherein the first probability for the candidate word is computed by combining multiple character difference probabilities, wherein each character difference probability is computed, for each selected character in the sequence of input characters, by applying a probability distribution that indicates, for the selected character, that a character of multiple characters of the candidate word was intended when the area of the input device corresponding to the selected character was actuated; obtaining a second probability for the candidate word, wherein the second probability for the candidate word indicates a likelihood, independent of the sequence of input characters, of occurrence of the candidate word; and in response to receiving the sequence of input characters, selecting the candidate word, using one or more processors, based on a combination of the first probability for the candidate word and the second probability for the candidate word. 6. The computer-implemented method of claim 1 , wherein values in the probability distribution are customized based on: a category associated with the user compromising handedness of the user, wherein the user is identified as being a right-handed user; and wherein values in the probability distribution are customized to right-handed users. | 0.685662 |
9,883,026 | 9 | 10 | 9. A computer-implemented method, comprising: executing, by a processor, a test cycle for generating a test script, the test script generated by performing: initiating a voice call interaction with an interactive voice response (IVR) application, the IVR application comprising a hierarchy of interaction nodes; and repeatedly performing, until a stopping condition is encountered, the steps of: executing the voice call interaction with the IVR application by traversing through one or more interaction nodes from among the hierarchy of interaction nodes until an interaction node requiring a response is encountered; selecting an utterance generation mode corresponding to the interaction node; determining a response to be provided corresponding to the interaction node of the speech application based on the utterance generation mode; and providing the response to the IVR application, wherein the test script comprises instructions for traversing interaction nodes involved during a course of the voice call interaction, and, instructions for provisioning one or more responses to the IVR application during the course of the voice call interaction; and facilitating, by the processor, testing of the IVR application using the test script. | 9. A computer-implemented method, comprising: executing, by a processor, a test cycle for generating a test script, the test script generated by performing: initiating a voice call interaction with an interactive voice response (IVR) application, the IVR application comprising a hierarchy of interaction nodes; and repeatedly performing, until a stopping condition is encountered, the steps of: executing the voice call interaction with the IVR application by traversing through one or more interaction nodes from among the hierarchy of interaction nodes until an interaction node requiring a response is encountered; selecting an utterance generation mode corresponding to the interaction node; determining a response to be provided corresponding to the interaction node of the speech application based on the utterance generation mode; and providing the response to the IVR application, wherein the test script comprises instructions for traversing interaction nodes involved during a course of the voice call interaction, and, instructions for provisioning one or more responses to the IVR application during the course of the voice call interaction; and facilitating, by the processor, testing of the IVR application using the test script. 10. The method of claim 9 , wherein the stopping condition is one of: an error event comprising detection of at least one error during the execution of the voice call interaction; an interaction transfer event comprising detection of a transfer of the voice call interaction to a customer support representative; an interaction termination event comprising detection of a termination of the voice call interaction; and a goal realization event comprising detection of a realization of a pre-determined goal for testing of the IVR application. | 0.516071 |
9,811,795 | 1 | 5 | 1. A method for managing operations for organizations over a network using one or more network computers that include one or more processors that perform actions, comprising: employing a plurality of provided Operations events to perform further actions, including: providing, by the one or more processors, one or more event clusters that are associated with one or more Operations events; associating, by the one or more processors, one or more resolution metrics with the one or more event clusters; employing, by the one or more processors, a modeling engine to train one or more models based on the one or more Operations events, the one or more event clusters, and the one or more resolution metrics, wherein the one or more trained models are stored in a datastore; and retrieving, by the one or more processors, the one or more trained models, from the datastore, that are used to identify the one or more resolution metrics that are associated with one or more real-time Operations events. | 1. A method for managing operations for organizations over a network using one or more network computers that include one or more processors that perform actions, comprising: employing a plurality of provided Operations events to perform further actions, including: providing, by the one or more processors, one or more event clusters that are associated with one or more Operations events; associating, by the one or more processors, one or more resolution metrics with the one or more event clusters; employing, by the one or more processors, a modeling engine to train one or more models based on the one or more Operations events, the one or more event clusters, and the one or more resolution metrics, wherein the one or more trained models are stored in a datastore; and retrieving, by the one or more processors, the one or more trained models, from the datastore, that are used to identify the one or more resolution metrics that are associated with one or more real-time Operations events. 5. The method of claim 1 , further comprising training the one or more training models based on characterizing and measuring one or more of coefficients, convergence values and error values for the one or more training models. | 0.64127 |
8,566,263 | 1 | 5 | 1. A method comprising: generating a first communication from syntactically structured phrases for delivery to a user, wherein the first communication forms a first natural language sentence; assessing a behavior of the user in response to the first communication; modifying a phrase frequency distribution for the syntactically structured phrases based, at least in part, on the behavior of the user; and generating a second communication from the syntactically structured phrases for delivery to the user based on the phrase frequency distribution, wherein the second communication forms a second natural language sentence. | 1. A method comprising: generating a first communication from syntactically structured phrases for delivery to a user, wherein the first communication forms a first natural language sentence; assessing a behavior of the user in response to the first communication; modifying a phrase frequency distribution for the syntactically structured phrases based, at least in part, on the behavior of the user; and generating a second communication from the syntactically structured phrases for delivery to the user based on the phrase frequency distribution, wherein the second communication forms a second natural language sentence. 5. The method of claim 1 further comprising: identifying demeanor categories for the syntactically structured phrases; and generating the second communication based on the demeanor categories for the syntactically structured phrases. | 0.741111 |
8,069,028 | 13 | 14 | 13. A handheld electronic device, comprising: a keyboard having a plurality of input members, at least some of the input members having assigned thereto a plurality of linguistic elements; a display; a processor apparatus comprising a processor and a memory in electronic communication with the processor, the memory having stored therein a plurality of input method languages and a text disambiguation function structured to employ one of the plurality of the input method languages, the processor apparatus being structured to: input an actuation of one or more of the input members; detect a selection of an input method language; detect as an ambiguous input the actuation of one or more of the input members; output a plurality of language objects that correspond with the ambiguous input to enable one of the plurality of language objects to be selected; output at a location adjacent to the plurality of language objects an indicator specifying one of the plurality of input method languages which is currently employed by the disambiguation function to enable the indicator to be selected in lieu of one of the plurality of language objects; and upon the indicator being selected in lieu of one of the plurality of language objects, enable a selection of one of a plurality of alternate indicators adjacent to the indicator specifying an alternate one of the plurality of input method languages to be selected, wherein the selection of one of the plurality of alternate indicators is enabled while the inputting an actuation of one or more of the input members is ongoing. | 13. A handheld electronic device, comprising: a keyboard having a plurality of input members, at least some of the input members having assigned thereto a plurality of linguistic elements; a display; a processor apparatus comprising a processor and a memory in electronic communication with the processor, the memory having stored therein a plurality of input method languages and a text disambiguation function structured to employ one of the plurality of the input method languages, the processor apparatus being structured to: input an actuation of one or more of the input members; detect a selection of an input method language; detect as an ambiguous input the actuation of one or more of the input members; output a plurality of language objects that correspond with the ambiguous input to enable one of the plurality of language objects to be selected; output at a location adjacent to the plurality of language objects an indicator specifying one of the plurality of input method languages which is currently employed by the disambiguation function to enable the indicator to be selected in lieu of one of the plurality of language objects; and upon the indicator being selected in lieu of one of the plurality of language objects, enable a selection of one of a plurality of alternate indicators adjacent to the indicator specifying an alternate one of the plurality of input method languages to be selected, wherein the selection of one of the plurality of alternate indicators is enabled while the inputting an actuation of one or more of the input members is ongoing. 14. The handheld electronic device of claim 13 , wherein the output of the plurality of language objects and the indicator is a visual output. | 0.813158 |
9,367,742 | 2 | 3 | 2. The object monitoring apparatus of claim 1 , further comprising: an updater configured to update the candidate object into the reference image when the object-of-interest determiner determines that the candidate object is not the object-of-interest. | 2. The object monitoring apparatus of claim 1 , further comprising: an updater configured to update the candidate object into the reference image when the object-of-interest determiner determines that the candidate object is not the object-of-interest. 3. The object monitoring apparatus of claim 2 , wherein the updater is configured to update the candidate object into the reference image, when the candidate object has pixels exhibiting no change in value differences for longer than a predetermined time period and has a size less than a preset size. | 0.5 |
8,649,566 | 1 | 10 | 1. A method for detecting motion quality error of printed documents in a printing system comprising: printing a document having text lines, each text line comprising a plurality of characters; scanning the printed document to generate a scanned image, the scanned image having the text lines and the characters; determining the orientation of the text lines in the scanned image with respect to a process direction of the printing system; detecting positions in the process direction of the printing system of one of the text lines and the characters in the scanned image; determining position errors in the process direction in the printed document based on the detected process direction positions of one of the text lines and the characters in the scanned image and the determined orientation of the text lines; determining at least one motion quality error of the printing system in the process direction based on the determined process direction position errors; and initiating an activity associated with said printing system in response to a motion quality error having been determined. | 1. A method for detecting motion quality error of printed documents in a printing system comprising: printing a document having text lines, each text line comprising a plurality of characters; scanning the printed document to generate a scanned image, the scanned image having the text lines and the characters; determining the orientation of the text lines in the scanned image with respect to a process direction of the printing system; detecting positions in the process direction of the printing system of one of the text lines and the characters in the scanned image; determining position errors in the process direction in the printed document based on the detected process direction positions of one of the text lines and the characters in the scanned image and the determined orientation of the text lines; determining at least one motion quality error of the printing system in the process direction based on the determined process direction position errors; and initiating an activity associated with said printing system in response to a motion quality error having been determined. 10. The method according to claim 1 , wherein, if an original digital image corresponding to the printed document is available, registering the scanned image with a first non-background scanline of the original digital image. | 0.744898 |
8,824,879 | 1 | 3 | 1. A system comprising: (a) a camera that is operable to take and store pictures, and that includes: (i) a lens, (ii) an image sensor, (iii) at least one microphone, (iv) a voice recognizer, and (v) a camera controller; (b) the camera controller including a control program having instructions to control and respond to the voice recognizer; (c) the voice recognizer coupled to at least one microphone and the camera controller, and configured to receive and process sounds into recognized words; (d) the camera further configured to maintain and store a plurality of recognizable words having different plain meanings and commonly associated with taking a picture, the recognition of any of which will cause the camera to take a picture; (e) wherein the voice recognizer is operable to receive a first and a second human sound spoken by the same person, and to recognize: (i) the first human sound as a first word from among the plurality that is assigned by the control program to be a command for the camera to take a picture; and (ii) the second human sound as a second word from among the plurality that is different from the first word and is also assigned by the control program to be the same camera command for the camera to take a picture. | 1. A system comprising: (a) a camera that is operable to take and store pictures, and that includes: (i) a lens, (ii) an image sensor, (iii) at least one microphone, (iv) a voice recognizer, and (v) a camera controller; (b) the camera controller including a control program having instructions to control and respond to the voice recognizer; (c) the voice recognizer coupled to at least one microphone and the camera controller, and configured to receive and process sounds into recognized words; (d) the camera further configured to maintain and store a plurality of recognizable words having different plain meanings and commonly associated with taking a picture, the recognition of any of which will cause the camera to take a picture; (e) wherein the voice recognizer is operable to receive a first and a second human sound spoken by the same person, and to recognize: (i) the first human sound as a first word from among the plurality that is assigned by the control program to be a command for the camera to take a picture; and (ii) the second human sound as a second word from among the plurality that is different from the first word and is also assigned by the control program to be the same camera command for the camera to take a picture. 3. The system of claim 1 wherein one of the words is “cheese.” | 0.945709 |
8,922,485 | 10 | 11 | 10. The computer-implemented method of claim 1 , further comprising training the first and second Bayesian networks based on real movement trajectories during multiple iterations of the gesture. | 10. The computer-implemented method of claim 1 , further comprising training the first and second Bayesian networks based on real movement trajectories during multiple iterations of the gesture. 11. The computer-implemented method of claim 10 , wherein the training the first and second Bayesian networks comprises aligning accelerometer timeseries data for each real movement trajectory. | 0.5 |
8,330,760 | 26 | 27 | 26. The system of claim 23 , where modifying horizontal stems includes expanding the spacing between edges of the horizontal stem. | 26. The system of claim 23 , where modifying horizontal stems includes expanding the spacing between edges of the horizontal stem. 27. The system of claim 26 , where expanding the spacing for a particular horizontal stem includes modifying coordinates of an upper edge of the horizontal stem. | 0.5 |
7,836,043 | 3 | 8 | 3. A data indexing and perusal system comprising: an index module that enables generation of a searchable index of a plurality of selected source files, including HTML files; wherein the searchable index stores word locations of words in the source files, including the starting positions of words in HTML files that can be used to identify and highlight words in HTML files while those files are displayed in HTML format; a search module that enables a search to be performed of the index according to a search criterion to locate words and phrases in the plurality of selected source files; a display utility that displays at least portions of files in the plurality of selected source files that meet the search criterion; and an annotation module that enables users to generate annotations of the plurality of selected source files, the annotations being displayable by the display utility; wherein the annotation module enables designation of a link term and designation of one of the plurality of selected source files to be linked to the designated link term. | 3. A data indexing and perusal system comprising: an index module that enables generation of a searchable index of a plurality of selected source files, including HTML files; wherein the searchable index stores word locations of words in the source files, including the starting positions of words in HTML files that can be used to identify and highlight words in HTML files while those files are displayed in HTML format; a search module that enables a search to be performed of the index according to a search criterion to locate words and phrases in the plurality of selected source files; a display utility that displays at least portions of files in the plurality of selected source files that meet the search criterion; and an annotation module that enables users to generate annotations of the plurality of selected source files, the annotations being displayable by the display utility; wherein the annotation module enables designation of a link term and designation of one of the plurality of selected source files to be linked to the designated link term. 8. The data indexing and perusal system of claim 3 , wherein the annotation module is operable to automatically generate links between all instances of a designated link term within the plurality of selected source files and the designated file. | 0.631024 |
7,660,813 | 6 | 9 | 6. A system embodied on a computer readable storage medium for enhancing query results provided independent of a search engine, the system comprising: a module that sends a query to a search engine separate from the computer; a module that receives query results from the search engine; a module that retrieves documents identified by the query results; a module that enhances the query based at least in part upon a user model; a module that applies the enhanced query to the retrieved documents; and a module that generated information regarding relevancy of the retrieved documents based at least in part upon the enhanced query and the user model, wherein a name of a person and name of a company are identified with the retrieved documents and a relationship between the person and company is identified, the module that generates information regarding relevancy provides links to retrieved documents that contain the name of the person and the name of the company mentioned in the identified relationship. | 6. A system embodied on a computer readable storage medium for enhancing query results provided independent of a search engine, the system comprising: a module that sends a query to a search engine separate from the computer; a module that receives query results from the search engine; a module that retrieves documents identified by the query results; a module that enhances the query based at least in part upon a user model; a module that applies the enhanced query to the retrieved documents; and a module that generated information regarding relevancy of the retrieved documents based at least in part upon the enhanced query and the user model, wherein a name of a person and name of a company are identified with the retrieved documents and a relationship between the person and company is identified, the module that generates information regarding relevancy provides links to retrieved documents that contain the name of the person and the name of the company mentioned in the identified relationship. 9. The system of claim 6 , further containing a module that re-ranks the query results based on information contained in the retrieved documents and upon the user model. | 0.548128 |
9,092,228 | 7 | 8 | 7. A method comprising the steps of: receiving source code that is restricted to a subset of valid statements of a high-level language; and translating the source code to a low-level language; wherein the low-level language comprises a specialized instruction set; wherein each statement of the subset of the high-level language directly maps to an instruction of the low-level language; and wherein the translating step generates an error message in response to an attempt to translate an otherwise-valid statement of the high-level language if the statement is outside of the subset. | 7. A method comprising the steps of: receiving source code that is restricted to a subset of valid statements of a high-level language; and translating the source code to a low-level language; wherein the low-level language comprises a specialized instruction set; wherein each statement of the subset of the high-level language directly maps to an instruction of the low-level language; and wherein the translating step generates an error message in response to an attempt to translate an otherwise-valid statement of the high-level language if the statement is outside of the subset. 8. The method of claim 7 wherein the subset of the high-level language comprises a definition of a type that is not built into the standard high-level language, but that adheres to the semantics of the high-level language. | 0.5 |
8,548,153 | 13 | 18 | 13. A non-transitory computer-readable storage medium that stores a set of executable instructions for implementing customized rules for controlling incoming customer communications, the set of executable instructions, when executed by a processor of a computer, causing the computer to perform acts including: providing an initial menu for customizing rules for controlling incoming customer communications, the initial menu including a selectable option to modify an existing customized rule for controlling incoming customer communications and a selectable option to create a new customized rule for controlling incoming customer communications, wherein the new customized rule is configured to challenge a source of inbound communications for information configured to authorize the inbound communications; processing a request to create a new customized rule for controlling incoming customer communications; providing an initial selection criteria menu to create the new customized rule for controlling incoming customer communications, the initial selection criteria menu indicating whether the new customized rule will be built using a preexisting template or starting from initial blank rule criteria; and processing a response indicating whether the new customized rule will be built using a preexisting template or starting from initial blank rule criteria; when the new customized rule will be built using a preexisting template, providing a list of preexisting templates for creating new customized rules for controlling incoming customer communications, processing a received selection of a preexisting template from the list of preexisting templates, accepting input to populate the selected preexisting template, and storing a new customized rule based on the selected preexisting template and including any accepted input; and when the new customized rule will be built starting from initial blank rule criteria, providing initial blank rule criteria for a new customized rule for controlling incoming customer communications, processing a received selection of initial criteria from the initial blank rule criteria, providing a list of rule conditions for the selected initial criteria for the new customized rule, processing a received selection of rule conditions for the selected initial criteria for the new customized rule, and creating and storing a new customized rule based on the selected initial criteria and the selected rule conditions; wherein the stored new customized rule is specified to apply to inbound communications, wherein the stored new customized rule is implemented at an internal network node of a communications service provider to process communications in accordance with requests and selections received from customers using customer equipment, and wherein the stored new customized rule further includes a selected disposition for when the selected initial criteria and selected rule conditions are met. | 13. A non-transitory computer-readable storage medium that stores a set of executable instructions for implementing customized rules for controlling incoming customer communications, the set of executable instructions, when executed by a processor of a computer, causing the computer to perform acts including: providing an initial menu for customizing rules for controlling incoming customer communications, the initial menu including a selectable option to modify an existing customized rule for controlling incoming customer communications and a selectable option to create a new customized rule for controlling incoming customer communications, wherein the new customized rule is configured to challenge a source of inbound communications for information configured to authorize the inbound communications; processing a request to create a new customized rule for controlling incoming customer communications; providing an initial selection criteria menu to create the new customized rule for controlling incoming customer communications, the initial selection criteria menu indicating whether the new customized rule will be built using a preexisting template or starting from initial blank rule criteria; and processing a response indicating whether the new customized rule will be built using a preexisting template or starting from initial blank rule criteria; when the new customized rule will be built using a preexisting template, providing a list of preexisting templates for creating new customized rules for controlling incoming customer communications, processing a received selection of a preexisting template from the list of preexisting templates, accepting input to populate the selected preexisting template, and storing a new customized rule based on the selected preexisting template and including any accepted input; and when the new customized rule will be built starting from initial blank rule criteria, providing initial blank rule criteria for a new customized rule for controlling incoming customer communications, processing a received selection of initial criteria from the initial blank rule criteria, providing a list of rule conditions for the selected initial criteria for the new customized rule, processing a received selection of rule conditions for the selected initial criteria for the new customized rule, and creating and storing a new customized rule based on the selected initial criteria and the selected rule conditions; wherein the stored new customized rule is specified to apply to inbound communications, wherein the stored new customized rule is implemented at an internal network node of a communications service provider to process communications in accordance with requests and selections received from customers using customer equipment, and wherein the stored new customized rule further includes a selected disposition for when the selected initial criteria and selected rule conditions are met. 18. The storage medium according to claim 13 , wherein the stored new customized rule is associated with an override indicator such that an originator of a communication can enter the override indication to override the stored new customized rule. | 0.5 |
8,674,855 | 26 | 31 | 26. A system, comprising: an imaging device configured to generate an image of a document; a converting device configured to convert a portion of the image of the document into digital data; an analyzing device configured to: generate a sample from the digital data; and compare a target code with a portion of the sample, wherein the target code is generated by: identifying a key symbol string from a target passage of the text, identifying a first position at which the key symbol string occurs within the target passage of the text, identifying a second position at which the key symbol string occurs within the passage of the text, and determining a distance between the first position and the second position; and a controller configured to initiate an action upon determination that the portion of the sample includes the target code. | 26. A system, comprising: an imaging device configured to generate an image of a document; a converting device configured to convert a portion of the image of the document into digital data; an analyzing device configured to: generate a sample from the digital data; and compare a target code with a portion of the sample, wherein the target code is generated by: identifying a key symbol string from a target passage of the text, identifying a first position at which the key symbol string occurs within the target passage of the text, identifying a second position at which the key symbol string occurs within the passage of the text, and determining a distance between the first position and the second position; and a controller configured to initiate an action upon determination that the portion of the sample includes the target code. 31. The system of claim 26 , further comprising a printer coupled to the controller to produce physical copies of the image of the document. | 0.76431 |
8,543,375 | 8 | 10 | 8. A computer-implemented method, comprising: receiving, at a computing device having one or more processors, composition inputs; determining, at the computing device, a set of candidate selections based on the composition inputs, each candidate selection of the set of candidate selections corresponding to a representation of the composition inputs in one language of a plurality of languages; determining, at the computing device, a first language context value for each candidate selection, each candidate selection being associated with a specific language of the plurality of languages, each first language context value indicating a likelihood that its associated candidate selection corresponds to the composition inputs when compared against other candidate selections in the specific language; determining, at the computing device, a second language context value for each of the plurality of languages based on the composition inputs, each second language context value indicating a likelihood that the composition inputs correspond to its associated language of the plurality of languages; and providing for display, from the computing device, a list of candidate selections based on at least one of: (i) the first language context values, and (ii) the second language context values, the list of candidate selections including at least one candidate selection in each of two or more of the plurality of languages, wherein the list of candidate selections is a single, interleaved list of candidate selections that (i) includes at least one candidate selection in each of the two or more of the plurality of languages and (ii) identifies a rank for each of the candidate selections, each rank being indicative of a relative likelihood that its corresponding candidate selection was intended from the composition inputs. | 8. A computer-implemented method, comprising: receiving, at a computing device having one or more processors, composition inputs; determining, at the computing device, a set of candidate selections based on the composition inputs, each candidate selection of the set of candidate selections corresponding to a representation of the composition inputs in one language of a plurality of languages; determining, at the computing device, a first language context value for each candidate selection, each candidate selection being associated with a specific language of the plurality of languages, each first language context value indicating a likelihood that its associated candidate selection corresponds to the composition inputs when compared against other candidate selections in the specific language; determining, at the computing device, a second language context value for each of the plurality of languages based on the composition inputs, each second language context value indicating a likelihood that the composition inputs correspond to its associated language of the plurality of languages; and providing for display, from the computing device, a list of candidate selections based on at least one of: (i) the first language context values, and (ii) the second language context values, the list of candidate selections including at least one candidate selection in each of two or more of the plurality of languages, wherein the list of candidate selections is a single, interleaved list of candidate selections that (i) includes at least one candidate selection in each of the two or more of the plurality of languages and (ii) identifies a rank for each of the candidate selections, each rank being indicative of a relative likelihood that its corresponding candidate selection was intended from the composition inputs. 10. The method of claim 8 , further comprising determining a most likely language of the composition inputs based on the second language context values, wherein the list of candidate selections displayed include only those candidate selections in the most likely language. | 0.919953 |
7,970,721 | 10 | 11 | 10. The system of claim 1 , wherein the inference at least one of predicts quality of the one or more objects of interest, predicts an adjustment of the context, or identifies one or more patterns based upon graphical properties of the one or more sub graphs. | 10. The system of claim 1 , wherein the inference at least one of predicts quality of the one or more objects of interest, predicts an adjustment of the context, or identifies one or more patterns based upon graphical properties of the one or more sub graphs. 11. The system of claim 10 , wherein the quality of the one or more objects of interest is associated with individual objects from the one or more objects of interest, a sub set of the one or more objects of interest, or the entire set of one or more objects of interest. | 0.589394 |
7,574,652 | 14 | 16 | 14. A method according to claim 1 , wherein said transformation is an n-ary operation involving at least two data operands, and solutions in which a sequence of binary transforms are performed with the first operand of each step in the transform sequence being the result of the previous step are considered. | 14. A method according to claim 1 , wherein said transformation is an n-ary operation involving at least two data operands, and solutions in which a sequence of binary transforms are performed with the first operand of each step in the transform sequence being the result of the previous step are considered. 16. A method according to claim 14 , wherein said n-ary transforms include operations selected from the group consisting of mm, max and sum. | 0.5 |
7,831,545 | 1 | 3 | 1. A computer-implemented method of processing a set of documents for generating a facts database, comprising: at a system having one or more processors and memory storing one or more modules to be executed by the one or more processors; accessing a source document from a document host; extracting one or more facts from the source document, each fact including an attribute-value pair and a list of documents that include the fact; identifying a set of linking documents that have one or more links to the source document, wherein a respective link contains anchor text; generating a set of candidate labels from the anchor text of the linking documents; assigning a score to each candidate label based on a number of linking documents having the candidate label in the anchor text; selecting the candidate label with a highest score as a unifying subject of the one or more facts; and for the unifying subject, storing in the facts database an object distinct from the source document, wherein the object includes the unifying subject, one or more entries corresponding to the one or more facts extracted from the source document, and information associating the source document with at least one of the facts extracted from the source document and included in the object. | 1. A computer-implemented method of processing a set of documents for generating a facts database, comprising: at a system having one or more processors and memory storing one or more modules to be executed by the one or more processors; accessing a source document from a document host; extracting one or more facts from the source document, each fact including an attribute-value pair and a list of documents that include the fact; identifying a set of linking documents that have one or more links to the source document, wherein a respective link contains anchor text; generating a set of candidate labels from the anchor text of the linking documents; assigning a score to each candidate label based on a number of linking documents having the candidate label in the anchor text; selecting the candidate label with a highest score as a unifying subject of the one or more facts; and for the unifying subject, storing in the facts database an object distinct from the source document, wherein the object includes the unifying subject, one or more entries corresponding to the one or more facts extracted from the source document, and information associating the source document with at least one of the facts extracted from the source document and included in the object. 3. The method of claim 1 , wherein selecting the candidate label comprises: for each of the set of candidate labels: determining a set of frequencies of one or more substrings of the respective candidate label; generating a frequency vector associated with the respective candidate label based on the set of frequencies; determining a centroid vector based on the frequency vectors of the candidate labels, wherein the selected candidate label is associated with the respective frequency vector having a shortest distance to the centroid vector. | 0.5 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.