patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
---|---|---|---|---|---|
8,894,489 | 11 | 14 | 11. A user interface method for use with a touch gesture user interface for implementing global or universal gestures and context-specific gestures for the control of user applications executing on a device comprising, the method comprising Recognizing at least one posture of a finger in contact with a tactile sensor, Recognizing a touch gesture from a plurality of possible touch gestures by recognizing specific changes within postures, the changes comprising at least one recognized change in the angle of finger contact with the tactile sensor, Assigning a user interface function to the recognized touch gesture, Directing executing software to perform a user interface operation associated with the recognized touch gesture, the user interface operation selected from a plurality of possible from a user interface operations, and the association from plurality of possible associations, the plurality of possible associations comprising at least a global type and a second type, the first type of association being common across applications and the second type of association being an application-specific association that is specific to an application, and Wherein the executing software is responsive to the recognized touch gesture. | 11. A user interface method for use with a touch gesture user interface for implementing global or universal gestures and context-specific gestures for the control of user applications executing on a device comprising, the method comprising Recognizing at least one posture of a finger in contact with a tactile sensor, Recognizing a touch gesture from a plurality of possible touch gestures by recognizing specific changes within postures, the changes comprising at least one recognized change in the angle of finger contact with the tactile sensor, Assigning a user interface function to the recognized touch gesture, Directing executing software to perform a user interface operation associated with the recognized touch gesture, the user interface operation selected from a plurality of possible from a user interface operations, and the association from plurality of possible associations, the plurality of possible associations comprising at least a global type and a second type, the first type of association being common across applications and the second type of association being an application-specific association that is specific to an application, and Wherein the executing software is responsive to the recognized touch gesture. 14. The method of claim 11 wherein the tactile sensor is comprised by a touchscreen. | 0.801887 |
9,892,414 | 8 | 10 | 8. A system for presenting information about a resource to a user, the system comprising: at least one computer comprising at least one processor and at least one memory, the at least one computer configured to: receive a first message from a customer; compute a message encoding vector by processing text of the first message with a message encoding model, wherein the message encoding vector represents the first message; update a state vector by processing the message encoding vector with a state update model; select a first action from a plurality of available actions by processing the state vector with an action model, wherein the first action corresponds to transmitting an API request to a server computer; perform the first action by (i) generating data corresponding to the API request by processing the state vector with an API request model, (ii) transmitting the data corresponding to the API request to the server computer, and (iii) generating an API request vector that represents the data corresponding to the API request; update the state vector by processing the API request vector with the state update model; receive an API response from the server computer; compute an API response vector by processing the API response with an API response encoding model, wherein the API response vector represent the API response; update the state vector by processing the API response vector with the state update model; select a second action from the plurality of available actions by processing the state vector with the action model, wherein the second action corresponds to transmitting a message to the customer; perform the second action by (i) generating text corresponding to a second message by processing the state vector with a message generation model, (ii) transmitting the second message to the customer, and (iii) generating a message generation vector that represents the second message; and update the state vector by processing the message generation vector with the state update model. | 8. A system for presenting information about a resource to a user, the system comprising: at least one computer comprising at least one processor and at least one memory, the at least one computer configured to: receive a first message from a customer; compute a message encoding vector by processing text of the first message with a message encoding model, wherein the message encoding vector represents the first message; update a state vector by processing the message encoding vector with a state update model; select a first action from a plurality of available actions by processing the state vector with an action model, wherein the first action corresponds to transmitting an API request to a server computer; perform the first action by (i) generating data corresponding to the API request by processing the state vector with an API request model, (ii) transmitting the data corresponding to the API request to the server computer, and (iii) generating an API request vector that represents the data corresponding to the API request; update the state vector by processing the API request vector with the state update model; receive an API response from the server computer; compute an API response vector by processing the API response with an API response encoding model, wherein the API response vector represent the API response; update the state vector by processing the API response vector with the state update model; select a second action from the plurality of available actions by processing the state vector with the action model, wherein the second action corresponds to transmitting a message to the customer; perform the second action by (i) generating text corresponding to a second message by processing the state vector with a message generation model, (ii) transmitting the second message to the customer, and (iii) generating a message generation vector that represents the second message; and update the state vector by processing the message generation vector with the state update model. 10. The system of claim 8 , wherein the at least one computer is configured to perform the second action by presenting the second message to a customer service representative and receiving approval from the customer service representative to transmit the second message to the customer. | 0.566667 |
9,639,449 | 4 | 5 | 4. An error detection method for a programming language on a PLC (Programmable Logic Controller) automation system, the method comprising: preparing a program using the programming language; converting the prepared program to a sequence; removing information related to variables of the programming language in response to a user selection by removing variable information used by the program; detecting same logic relative to the sequence by dividing the sequence into a minimum unit of a plurality of program languages; calculating hash codes according to the divided minimum unit; comparing each of the calculated hash codes; calculating an LCS (Longest Common Subsequence) relative to the divided sequence; detecting similar logic relative to the sequence by applying the calculated LCS to an LCS algorithm; and setting a similarity threshold of the sequence according to a user input and changing the similarity threshold when either similar logic is not detected or an amount of detected similar logic exceeds the set similarity threshold, wherein the programming language comprises IEC61131-3 programming language of which a minimum unit is rung. | 4. An error detection method for a programming language on a PLC (Programmable Logic Controller) automation system, the method comprising: preparing a program using the programming language; converting the prepared program to a sequence; removing information related to variables of the programming language in response to a user selection by removing variable information used by the program; detecting same logic relative to the sequence by dividing the sequence into a minimum unit of a plurality of program languages; calculating hash codes according to the divided minimum unit; comparing each of the calculated hash codes; calculating an LCS (Longest Common Subsequence) relative to the divided sequence; detecting similar logic relative to the sequence by applying the calculated LCS to an LCS algorithm; and setting a similarity threshold of the sequence according to a user input and changing the similarity threshold when either similar logic is not detected or an amount of detected similar logic exceeds the set similarity threshold, wherein the programming language comprises IEC61131-3 programming language of which a minimum unit is rung. 5. The error detection method of claim 4 , further comprising: determining that a relevant sequence is same logic when each calculated hash code for each minimum unit is same; and determining that a relevant sequence is similar logic when the calculated LCS is greater than the set similarity threshold. | 0.5 |
8,103,099 | 3 | 5 | 3. A method for providing characters and character groups from a roundel image comprising the steps of: vertically-aligning a region of electronically represented text in the roundel image; determining a point at which the roundel image starts; electronically analyzing the region to produce characters and character confidences; dividing the roundel image into sections according to the point; selecting the characters associated with highest character confidence values of the character confidences; computing character group confidences by summing the highest character confidence values for each of the selected characters that form the character groups; selecting the character groups with highest character group confidence values of the character group confidences as the selected character groups; marking each of the selected character groups as flipped; creating flipped marked character groups if the selected character group meets pre-determined criteria; marking each of the selected character groups in one of the sections as unflipped if none of the selected character groups in the one section is flipped, or if the one section includes predetermined text that is unflipped; if there are the flipped marked character groups, creating an image by rearranging the underlying representation of the flipped marked character groups; electronically analyzing the image to produce new characters each associated with new character confidences; selecting final characters according to the associated new character confidences; and providing the final characters to an electronic sink. | 3. A method for providing characters and character groups from a roundel image comprising the steps of: vertically-aligning a region of electronically represented text in the roundel image; determining a point at which the roundel image starts; electronically analyzing the region to produce characters and character confidences; dividing the roundel image into sections according to the point; selecting the characters associated with highest character confidence values of the character confidences; computing character group confidences by summing the highest character confidence values for each of the selected characters that form the character groups; selecting the character groups with highest character group confidence values of the character group confidences as the selected character groups; marking each of the selected character groups as flipped; creating flipped marked character groups if the selected character group meets pre-determined criteria; marking each of the selected character groups in one of the sections as unflipped if none of the selected character groups in the one section is flipped, or if the one section includes predetermined text that is unflipped; if there are the flipped marked character groups, creating an image by rearranging the underlying representation of the flipped marked character groups; electronically analyzing the image to produce new characters each associated with new character confidences; selecting final characters according to the associated new character confidences; and providing the final characters to an electronic sink. 5. The method as in claim 3 wherein said step of marking each of the selected character groups as flipped comprises the steps of: combining adjacent characters to form combined character groups; computing combined confidence values for each of the combined character groups; computing flipped combined confidence values for each of the flipped combined character groups; marking one the combined character groups as flipped after comparing if the flipped combined confidence value for the associated flipped combined character group is greater by a pre-determined amount than the combined confidence value for the corresponding character group; and performing pre-determined functions on the combined character groups according to the character length of the combined character groups. | 0.5 |
8,671,123 | 7 | 8 | 7. A computer readable medium storing instructions thereon which when executed by a processor cause the processor to: provide by the processor a user interface displaying a first moveable row of a first set of icons, wherein each icon in the first set of icons represents a person or a group of persons, the first set of icons comprising a subset of a first superset of icons; display by the processor on the user interface a control that changes a value of a likelihood of interest between a user and each person or group of persons represented by the first set of icons, wherein changing the value of the likelihood of interest one of reduces or increases a quantity of one of persons or groups of persons corresponding to the first set of icons able to be displayed in the first moveable row of the first set of icons; display by the processor on the user interface a second moveable row of a second set of icons, wherein each icon in the second set of icons represents a type of information, the second set of icons comprising a subset of a second superset of icons; display by the processor on the user interface a center column within the user interface identifying a selected first icon from the first set of icons and a selected second icon from the second set of icons when a user manipulates the first moveable row of the first set of icons and the second moveable row of the second set of icons; receive a search request at the processor indicating the selected first icon from the first set of icons and the second selected icon from the second set of icons; and provide and display on the user interface a search result from the processor, the search result comprising a name of at least one file, wherein the name of the at least one file is associated with the person or the group of persons represented by the selected first icon and the name of the at least one file is further associated with the type of information represented by the second selected icon. | 7. A computer readable medium storing instructions thereon which when executed by a processor cause the processor to: provide by the processor a user interface displaying a first moveable row of a first set of icons, wherein each icon in the first set of icons represents a person or a group of persons, the first set of icons comprising a subset of a first superset of icons; display by the processor on the user interface a control that changes a value of a likelihood of interest between a user and each person or group of persons represented by the first set of icons, wherein changing the value of the likelihood of interest one of reduces or increases a quantity of one of persons or groups of persons corresponding to the first set of icons able to be displayed in the first moveable row of the first set of icons; display by the processor on the user interface a second moveable row of a second set of icons, wherein each icon in the second set of icons represents a type of information, the second set of icons comprising a subset of a second superset of icons; display by the processor on the user interface a center column within the user interface identifying a selected first icon from the first set of icons and a selected second icon from the second set of icons when a user manipulates the first moveable row of the first set of icons and the second moveable row of the second set of icons; receive a search request at the processor indicating the selected first icon from the first set of icons and the second selected icon from the second set of icons; and provide and display on the user interface a search result from the processor, the search result comprising a name of at least one file, wherein the name of the at least one file is associated with the person or the group of persons represented by the selected first icon and the name of the at least one file is further associated with the type of information represented by the second selected icon. 8. The computer readable medium of claim 7 , wherein the operation of providing the user interface displaying the first set of icons further comprises: receive a context indicator that defines a set of individuals having a common affiliation; ascertain the subset of the first superset of icons from the first superset of icons using the context indicator; and provide the user interface comprising the first set of icons. | 0.5 |
8,533,195 | 10 | 11 | 10. The topic modeling system as recited in claim 1 , wherein the minimizing the first equation while holding the topic-document matrix V fixed includes the regularization of column vectors of the term-topic matrix U, and the minimizing the first equation while holding the term-topic matrix U fixed includes the regularization of column vectors of the topic-document matrix V. | 10. The topic modeling system as recited in claim 1 , wherein the minimizing the first equation while holding the topic-document matrix V fixed includes the regularization of column vectors of the term-topic matrix U, and the minimizing the first equation while holding the term-topic matrix U fixed includes the regularization of column vectors of the topic-document matrix V. 11. The topic modeling system as recited in claim 10 , wherein the regularization of column vectors of the term-topic matrix U is based on an l 1 norm and the regularization column vectors of the topic-document matrix V is based on an l 2 norm. | 0.5 |
8,447,766 | 13 | 14 | 13. A non-transitory computer-readable medium comprising computer program code for, if executed on a computer, causing the computer to: define a query for retrieving a numerical answer, the query comprising one or more search terms and a tolerance for the numerical answer; define a set of document portions from a collection of electronic documents, wherein each document portion in the set is extracted from one of the electronic documents and comprises at least one term relevant to at least one of the one or more search terms and a numerical value associated with the at least one term; arrange the associated numerical values contained in the set in an order; define a plurality of results groups, each results group comprising an interval of the arranged numerical values, wherein each interval is determined based on a difference between two of the arranged numerical values in the set, and wherein each interval has a range not exceeding the tolerance; rank the plurality of results groups; and return at least one interval of a highest ranked results group as a response to the query. | 13. A non-transitory computer-readable medium comprising computer program code for, if executed on a computer, causing the computer to: define a query for retrieving a numerical answer, the query comprising one or more search terms and a tolerance for the numerical answer; define a set of document portions from a collection of electronic documents, wherein each document portion in the set is extracted from one of the electronic documents and comprises at least one term relevant to at least one of the one or more search terms and a numerical value associated with the at least one term; arrange the associated numerical values contained in the set in an order; define a plurality of results groups, each results group comprising an interval of the arranged numerical values, wherein each interval is determined based on a difference between two of the arranged numerical values in the set, and wherein each interval has a range not exceeding the tolerance; rank the plurality of results groups; and return at least one interval of a highest ranked results group as a response to the query. 14. A non-transitory computer-readable medium of claim 13 , wherein the computer program code causing the computer to define the plurality of results groups comprises computer program code causing the computer to repeatedly: select a previously unselected first numerical value from the arranged numerical values; and define all results groups intervals ranging from the selected first numerical value to a subsequent numerical value in the arranged numerical values for which the interval range does not exceed the tolerance; until all but the last numerical value of the arranged numerical values have been selected as the first numerical value. | 0.5 |
9,122,727 | 18 | 23 | 18. A system including memory and one or more processors operable to execute instructions, stored in the memory, comprising instructions to perform the operations of: identifying a respective ordered list of search result documents for each query in a plurality of queries; identifying: a given query in the plurality of queries; a first and second grouping in the ordered list for the given query; and a first and second grouping in the ordered list for each of the remaining queries in the plurality of queries; determining non-overlap scores between the given query and each of the remaining queries in the plurality of queries, wherein the non-overlap scores measure dissimilarities between the search result documents within the first grouping in the ordered list for the given query and the first grouping in the ordered list for each of the remaining queries in the plurality of queries; selecting one or more candidate queries from the remaining queries in the plurality of queries based on the non-overlap scores; determining overlap scores between the given query and each of the candidate queries, wherein the overlap scores measure similarities between the search result documents within the second grouping in the ordered list for the given query and the second grouping in the ordered list for each of the candidate queries; selecting one or more related queries from the candidate queries based on the overlap scores; and storing data associating the related queries with the given query. | 18. A system including memory and one or more processors operable to execute instructions, stored in the memory, comprising instructions to perform the operations of: identifying a respective ordered list of search result documents for each query in a plurality of queries; identifying: a given query in the plurality of queries; a first and second grouping in the ordered list for the given query; and a first and second grouping in the ordered list for each of the remaining queries in the plurality of queries; determining non-overlap scores between the given query and each of the remaining queries in the plurality of queries, wherein the non-overlap scores measure dissimilarities between the search result documents within the first grouping in the ordered list for the given query and the first grouping in the ordered list for each of the remaining queries in the plurality of queries; selecting one or more candidate queries from the remaining queries in the plurality of queries based on the non-overlap scores; determining overlap scores between the given query and each of the candidate queries, wherein the overlap scores measure similarities between the search result documents within the second grouping in the ordered list for the given query and the second grouping in the ordered list for each of the candidate queries; selecting one or more related queries from the candidate queries based on the overlap scores; and storing data associating the related queries with the given query. 23. The system of claim 18 , wherein: the overlap scores are determined based on similarity scores between the search result documents within the second grouping in the ordered list for the given query and the search result documents within the second grouping in the ordered list for each of the candidate queries. | 0.564917 |
8,180,633 | 16 | 18 | 16. A neural network implemented in a computer readable non-transitory storage medium comprising a computer readable program, wherein the computer readable program when executed on a computer performs semantic extraction and semantic role labeling, comprising: an indexer configured to index an input sentence and provide position information for a word of interest and a verb of interest; at least one lookup table for converting words into vectors using features obtained from the indexer for the input sentence; a first linear layer configured to integrate verb position in the input sentence of the verb of interest into a block-column structure that is adapted to the input sentence; and a second linear layer configured to perform a linear transformation using the block-column structure and the word vectors; and a squashing layer configured to interpret outputs of the linear layer as class probabilities for semantic role labels for the input sentence. | 16. A neural network implemented in a computer readable non-transitory storage medium comprising a computer readable program, wherein the computer readable program when executed on a computer performs semantic extraction and semantic role labeling, comprising: an indexer configured to index an input sentence and provide position information for a word of interest and a verb of interest; at least one lookup table for converting words into vectors using features obtained from the indexer for the input sentence; a first linear layer configured to integrate verb position in the input sentence of the verb of interest into a block-column structure that is adapted to the input sentence; and a second linear layer configured to perform a linear transformation using the block-column structure and the word vectors; and a squashing layer configured to interpret outputs of the linear layer as class probabilities for semantic role labels for the input sentence. 18. The neural network as recited in claim 16 , wherein each column of the block-column structure depends on a position of an i th word in the input sentence with respect to a position of the word of interest and with respect to a position of the verb of interest. | 0.5 |
9,626,431 | 7 | 15 | 7. A system comprising: at least one computing device; and a search application executable in the at least one computing device, the search application configured to at least: obtain a search query comprising at least one search term; detect a language associated with the search query; determine that the language associated with the search query differs from an expected language; in response to determining that the language differs from the expected language, generate a plurality of search results from a catalog comprising at least one alternative search result, wherein the at least one alternative search result comprises at least one search result differing from a search using the search query in the expected language; identify a foreign language page template associated with the language; and generate a page for display including the plurality of search results based at least in part on the foreign language template corresponding to the language. | 7. A system comprising: at least one computing device; and a search application executable in the at least one computing device, the search application configured to at least: obtain a search query comprising at least one search term; detect a language associated with the search query; determine that the language associated with the search query differs from an expected language; in response to determining that the language differs from the expected language, generate a plurality of search results from a catalog comprising at least one alternative search result, wherein the at least one alternative search result comprises at least one search result differing from a search using the search query in the expected language; identify a foreign language page template associated with the language; and generate a page for display including the plurality of search results based at least in part on the foreign language template corresponding to the language. 15. The system of claim 7 , wherein the search application is further configured to at least: identify a site corresponding to a locale associated with the language; transmit the search query to the site; and obtain the at least one alternative search result from the site. | 0.731299 |
7,689,615 | 3 | 4 | 3. The system of claim 2 , the plurality of ranking algorithms comprising: at least an initial ranking algorithm trained to rank the initial set of items; and one or more subsequent ranking algorithms subsequently trained on ranked subset of items taken from a previous re-ranked subsets of items from a previous ranking algorithm. | 3. The system of claim 2 , the plurality of ranking algorithms comprising: at least an initial ranking algorithm trained to rank the initial set of items; and one or more subsequent ranking algorithms subsequently trained on ranked subset of items taken from a previous re-ranked subsets of items from a previous ranking algorithm. 4. The system of claim 3 , a first subset of items comprises items in the highest order positions in a ranking. | 0.5 |
7,536,673 | 36 | 37 | 36. The article of claim 33 , wherein the instructions are further operable to cause one or more machines to perform operations comprising determining whether a portion of the script should be sent for processing. | 36. The article of claim 33 , wherein the instructions are further operable to cause one or more machines to perform operations comprising determining whether a portion of the script should be sent for processing. 37. The article of claim 36 , wherein determining whether a portion of a script should be sent for processing comprises determining whether a portion of the script is associated with a specific processing engine. | 0.654723 |
8,195,599 | 10 | 11 | 10. The tool of claim 9 , wherein the inference module is configured to reason across different levels of abstraction to determine whether the one or more particular system-level properties can be inferred from the constraint model. | 10. The tool of claim 9 , wherein the inference module is configured to reason across different levels of abstraction to determine whether the one or more particular system-level properties can be inferred from the constraint model. 11. The tool of claim 10 , wherein the inference module includes forms of reasoning that includes composition, embedding, and abstraction. | 0.5 |
8,805,756 | 8 | 9 | 8. The method as set forth in claim 1 further comprising, subsequent to the providing a user of an answer, continuing to provide additional crowd-source enhancements to the deep question-answer computing system, and responsive to a change in a confidence factor, to a potential answer, or to both a confidence factor and a potential answer, providing to the user via the user interface an updated possible answer reflecting the continued crowd-source enhancements. | 8. The method as set forth in claim 1 further comprising, subsequent to the providing a user of an answer, continuing to provide additional crowd-source enhancements to the deep question-answer computing system, and responsive to a change in a confidence factor, to a potential answer, or to both a confidence factor and a potential answer, providing to the user via the user interface an updated possible answer reflecting the continued crowd-source enhancements. 9. The method as set forth in claim 8 wherein the updated possible answer comprises one or more answers selected from the group consisting of a pharmaceutical drug prescription, a therapy prescription, and a medical diagnosis. | 0.5 |
8,423,546 | 12 | 15 | 12. A computer program product for use at a computer system, the computer program product for implementing a method for identifying key phrases within a document, the computer program product comprising one or more computer storage devices having stored thereon computer-executable instructions that, when executed at a processor, cause the computer system to perform the method, including the following: access a document; calculate the frequency of occurrence of a plurality of different textual phrases within the document, each textual phrase including one or more individual words of a specified language, and output a list that contains at least some of the textual phrases together with the frequency of occurrence of output phrases within the document; access a language model for the specified language, the language model defining expected frequencies of occurrence at least for individual words of the specified language; for each textual phrase in the output list, determine the expected frequency of each such textual phrase by using the expected frequencies of at least some of the individual words of the language model to interpolate from the expected frequencies of said at least some individual words the expected frequency of each such textual phrase contained in said list; for each textual phrase in the output list compute a cross-entropy value computed from the frequency of occurrence of the textual phrase within the document and the determined expected frequency of occurrence of the textual phrase within the language model; select a specified number of key textual phrases based on the computed cross-entropy values; and populate a key phrase data structure with data representative of each of the selected specified number of key textual phrases. | 12. A computer program product for use at a computer system, the computer program product for implementing a method for identifying key phrases within a document, the computer program product comprising one or more computer storage devices having stored thereon computer-executable instructions that, when executed at a processor, cause the computer system to perform the method, including the following: access a document; calculate the frequency of occurrence of a plurality of different textual phrases within the document, each textual phrase including one or more individual words of a specified language, and output a list that contains at least some of the textual phrases together with the frequency of occurrence of output phrases within the document; access a language model for the specified language, the language model defining expected frequencies of occurrence at least for individual words of the specified language; for each textual phrase in the output list, determine the expected frequency of each such textual phrase by using the expected frequencies of at least some of the individual words of the language model to interpolate from the expected frequencies of said at least some individual words the expected frequency of each such textual phrase contained in said list; for each textual phrase in the output list compute a cross-entropy value computed from the frequency of occurrence of the textual phrase within the document and the determined expected frequency of occurrence of the textual phrase within the language model; select a specified number of key textual phrases based on the computed cross-entropy values; and populate a key phrase data structure with data representative of each of the selected specified number of key textual phrases. 15. The computer program product as recited in claim 12 , further comprising computer-executable instructions that, when executed, cause the computer system to use a weighting function to weight the statistically significance of the textual phrases in said list relative to one another. | 0.702083 |
9,268,997 | 17 | 18 | 17. The method of claim 15 , further comprising: displaying on the user device the command included in the confirmation message; and in response to the displaying of the command, receiving through the user-input interface of the user device a corrective input indicative of an error in the displayed command. | 17. The method of claim 15 , further comprising: displaying on the user device the command included in the confirmation message; and in response to the displaying of the command, receiving through the user-input interface of the user device a corrective input indicative of an error in the displayed command. 18. The method of claim 17 , further comprising: in response to receiving the corrective input, transmitting from the user device to the application server a corrective command indicative of the error in the displayed command. | 0.5 |
4,780,906 | 12 | 13 | 12. An electronic device comprising: integrated circuit means including memory means having digital speech data stored therein, a first portion of said memory means being devoted to a plurality of reference templates of digital speech data respectively representative of individual words comprising the vocabulary of a word recognition capability, the vocabulary consisting of a relatively small number of words with each of the words included in the vocabulary being represented by a reference template defined by a predetermined plurality of reference vectors arranged in a predetermined sequence and comprising an acoustic description of an individual word in a time-ordered sequence, each of said reference templates corresponding to a word acoustically distinct from other words included in the vocabulary, said memory means having a second portion thereof devoted to digital speech data from which words, phrases and sentences of synthesized speech may be derived, controller means for selectively accessing digital speech data from said first portion of said memory means devoted to said plurality of reference templates and from said second portion of said memory means devoted to said digital speech data from which synthesized speech may be derived, and speech synthesizer means operably coupled to said controller means and to said memory means for selectively accessing digital speech data in response to instructions from said controller means and generating analog speech signals representative of human speech in response to the selectively accessed digital speech data from said memory means; signal conditioning means for receiving an input analog speech signal representative of a spoken word and providing word-discriminationn information as a sequence of feature vectors defining acoustic descriptions of the word; said controller means and said first portion of said memory means devoted to said plurality of reference templates cooperating to define word recognition means for receiving said word-discrimination information representative of said input analog speech signal; said controller means including comparator means for comparing each feature vector of said input analog speech signal with the corresponding reference vectors of each of said reference templates stored within said first portion of said memory means to provide a distance measure with respect to each of the reference vectors in the predetermined sequences defining acoustic descriptions of the respective words as represented by said plurality of reference templates; said controller means further including logic circuit means for determining which one of the plurality of reference templates is the closest match to said input analog speech signal based upon a cumulative cost profile as defined by the respective distance measures provided by comparisons of each feature vector of said input analog speech signal with the reference vectors included in the predetermined sequences of reference vectors defining the plurality of reference templates; said controller means being responsive to the recognition of the word represented by said input analog speech signal based upon the particular reference template decided upon by said logic circuit means to selectively access digital speech data from the second portion of said memory means reflective of the word recognition; said speech synthesizer means being responsive to the selectively accessed digital speech data reflective of the word recognition for generating analog speech signals representative of human speech in some way related to the recognized word; and audio means coupled to the output of said speech synthesizer means for producing audible human speech from said analog speech signals generated by said speech synthesizer means having some relationship to the recognized word. | 12. An electronic device comprising: integrated circuit means including memory means having digital speech data stored therein, a first portion of said memory means being devoted to a plurality of reference templates of digital speech data respectively representative of individual words comprising the vocabulary of a word recognition capability, the vocabulary consisting of a relatively small number of words with each of the words included in the vocabulary being represented by a reference template defined by a predetermined plurality of reference vectors arranged in a predetermined sequence and comprising an acoustic description of an individual word in a time-ordered sequence, each of said reference templates corresponding to a word acoustically distinct from other words included in the vocabulary, said memory means having a second portion thereof devoted to digital speech data from which words, phrases and sentences of synthesized speech may be derived, controller means for selectively accessing digital speech data from said first portion of said memory means devoted to said plurality of reference templates and from said second portion of said memory means devoted to said digital speech data from which synthesized speech may be derived, and speech synthesizer means operably coupled to said controller means and to said memory means for selectively accessing digital speech data in response to instructions from said controller means and generating analog speech signals representative of human speech in response to the selectively accessed digital speech data from said memory means; signal conditioning means for receiving an input analog speech signal representative of a spoken word and providing word-discriminationn information as a sequence of feature vectors defining acoustic descriptions of the word; said controller means and said first portion of said memory means devoted to said plurality of reference templates cooperating to define word recognition means for receiving said word-discrimination information representative of said input analog speech signal; said controller means including comparator means for comparing each feature vector of said input analog speech signal with the corresponding reference vectors of each of said reference templates stored within said first portion of said memory means to provide a distance measure with respect to each of the reference vectors in the predetermined sequences defining acoustic descriptions of the respective words as represented by said plurality of reference templates; said controller means further including logic circuit means for determining which one of the plurality of reference templates is the closest match to said input analog speech signal based upon a cumulative cost profile as defined by the respective distance measures provided by comparisons of each feature vector of said input analog speech signal with the reference vectors included in the predetermined sequences of reference vectors defining the plurality of reference templates; said controller means being responsive to the recognition of the word represented by said input analog speech signal based upon the particular reference template decided upon by said logic circuit means to selectively access digital speech data from the second portion of said memory means reflective of the word recognition; said speech synthesizer means being responsive to the selectively accessed digital speech data reflective of the word recognition for generating analog speech signals representative of human speech in some way related to the recognized word; and audio means coupled to the output of said speech synthesizer means for producing audible human speech from said analog speech signals generated by said speech synthesizer means having some relationship to the recognized word. 13. An electronic device as set forth in claim 12, wherein said integrated circuit means is a single semiconductor chip. | 0.863014 |
8,687,806 | 1 | 3 | 1. A method for decrypting an encrypted transport stream, comprising: receiving the encrypted transport stream over a content delivery network, wherein the encrypted transport stream was encrypted using a first control word that serves as an encryption/decryption key; receiving a variable control word over the content delivery network; receiving a multiple bit fixed control word over a communication path that is different than the content delivery network; and processing the variable control word with the multiple bit fixed control word to create a mathematically constrained second control word, wherein a first plurality of bits of the second control word are equal to corresponding bits of the variable control word, and a second plurality of bits of the second control word are formed using bits of the fixed control word, and wherein the created second control word is mathematically constrained with respect to the variable control word; and decrypting the encrypted transport stream using the second control word if the second control word is the same as the first control word. | 1. A method for decrypting an encrypted transport stream, comprising: receiving the encrypted transport stream over a content delivery network, wherein the encrypted transport stream was encrypted using a first control word that serves as an encryption/decryption key; receiving a variable control word over the content delivery network; receiving a multiple bit fixed control word over a communication path that is different than the content delivery network; and processing the variable control word with the multiple bit fixed control word to create a mathematically constrained second control word, wherein a first plurality of bits of the second control word are equal to corresponding bits of the variable control word, and a second plurality of bits of the second control word are formed using bits of the fixed control word, and wherein the created second control word is mathematically constrained with respect to the variable control word; and decrypting the encrypted transport stream using the second control word if the second control word is the same as the first control word. 3. The method of claim 1 wherein processing the variable control word to create the mathematically constrained second control word comprises concatenating the variable control word and the fixed control word. | 0.666667 |
8,321,442 | 9 | 10 | 9. The method of claim 8 wherein the generating the one or more input keys comprises generating one or more radical keys based on the one or more sets of Latin characters. | 9. The method of claim 8 wherein the generating the one or more input keys comprises generating one or more radical keys based on the one or more sets of Latin characters. 10. The method of claim 9 wherein the generating the one or more radical keys comprises replacing any Latin character in the set of Latin characters that is associated with a radical that has a corresponding looks-alike radical. | 0.5 |
9,789,394 | 15 | 16 | 15. The method of claim 13 , further comprising, prior to said presenting, generating different degraded versions of the electronic image automatically by performing image processing on the electronic image. | 15. The method of claim 13 , further comprising, prior to said presenting, generating different degraded versions of the electronic image automatically by performing image processing on the electronic image. 16. The method of claim 15 , wherein the image processing comprises at least one of altering a pixelation, noise, or resolution of the electronic image such that the concept is less detectable in the different degraded versions. | 0.5 |
7,877,780 | 1 | 8 | 1. A computer implemented method for enforcing functionality in computer software through policy, the method comprising: creating a natural language policy to define how the computer software should be operating to achieve a predetermined level of security or functionality; converting the natural language policy to a sample code template including variable name placeholders, wherein the natural language policy is represented by logical patterns enforcing centralization of critical functionality of the policy in the computer software to enforce execution of the critical functions at their centralized sources in a source code of the computer software; automatically creating one or more static analysis rules from the sample code template to identify code in the computer software which does not conform to the natural language policy; substituting the variable name placeholders in the sample code template with parameters from the computer software; and electronically enforcing the created one or more static analysis rules for the computer software to check whether any code in the computer software matches patterns that indicate violations of the natural language policy. | 1. A computer implemented method for enforcing functionality in computer software through policy, the method comprising: creating a natural language policy to define how the computer software should be operating to achieve a predetermined level of security or functionality; converting the natural language policy to a sample code template including variable name placeholders, wherein the natural language policy is represented by logical patterns enforcing centralization of critical functionality of the policy in the computer software to enforce execution of the critical functions at their centralized sources in a source code of the computer software; automatically creating one or more static analysis rules from the sample code template to identify code in the computer software which does not conform to the natural language policy; substituting the variable name placeholders in the sample code template with parameters from the computer software; and electronically enforcing the created one or more static analysis rules for the computer software to check whether any code in the computer software matches patterns that indicate violations of the natural language policy. 8. The method of claim 1 , wherein the converting a natural language policy to sample code template comprises applying one or more of the group encapsulation, centralization, consistency, and preference to the logical patterns. | 0.63738 |
8,701,004 | 1 | 5 | 1. Method for executing a software application relating to an audio-visual presentation, wherein the audio-visual presentation is one of a plurality of titles stored on a first storage medium, the method comprising the steps of detecting a title selection request, and in response to the title selection request performing the steps of: reading data from the first storage medium, the data comprising files with audio-visual presentation data and software application data, the software application data having a language label associated; generating or updating a virtual file system based on the files and software application data read from the first storage medium; generating a first audio-visual presentation based on said audio-visual presentation data, wherein the first audio-visual presentation starts automatically, and during the first audio-visual presentation performing the steps of comparing, within said virtual file system, the language label associated with the read software application data with a preferred language identifier; selecting, within said virtual file system, software application data that are associated with a language label matching the preferred language identifier; and caching the selected software application data that are associated with a language label matching the preferred language identifier in a cache memory; upon termination of said caching, performing the steps of terminating said first audio-visual presentation; generating a second audio-visual presentation from said audio-visual presentation data; executing a software application based on the cached data while generating said second audio-visual presentation, wherein the software application is distinct from the audio-visual presentation and the software application modifies the audio-visual presentation, and wherein said title selection request refers to the title of the second audio-visual presentation. | 1. Method for executing a software application relating to an audio-visual presentation, wherein the audio-visual presentation is one of a plurality of titles stored on a first storage medium, the method comprising the steps of detecting a title selection request, and in response to the title selection request performing the steps of: reading data from the first storage medium, the data comprising files with audio-visual presentation data and software application data, the software application data having a language label associated; generating or updating a virtual file system based on the files and software application data read from the first storage medium; generating a first audio-visual presentation based on said audio-visual presentation data, wherein the first audio-visual presentation starts automatically, and during the first audio-visual presentation performing the steps of comparing, within said virtual file system, the language label associated with the read software application data with a preferred language identifier; selecting, within said virtual file system, software application data that are associated with a language label matching the preferred language identifier; and caching the selected software application data that are associated with a language label matching the preferred language identifier in a cache memory; upon termination of said caching, performing the steps of terminating said first audio-visual presentation; generating a second audio-visual presentation from said audio-visual presentation data; executing a software application based on the cached data while generating said second audio-visual presentation, wherein the software application is distinct from the audio-visual presentation and the software application modifies the audio-visual presentation, and wherein said title selection request refers to the title of the second audio-visual presentation. 5. Method according to claim 1 , wherein software application data that have a pre-defined default language label are cached if no software application data has a language label matching the preferred language identifier, and wherein software application data that have a language label not matching the preferred language identifier and not matching the predefined default language label are not cached. | 0.528037 |
8,386,889 | 1 | 11 | 1. A control module comprising: an encoder module configured to (i) receive data, and (ii) based on the data, generate a first code word for a plurality of drives; a detector module configured to, in response to detecting an error in a first drive of the plurality of drives subsequent to generation of the first code word, initiate replacement of the first drive with a second drive, wherein the encoder module is configured to generate a second code word for the second drive; a mapping module configured to (i) map physical locations of the data in the plurality of drives to logical locations of the first code word, (ii) assign a predetermined value to one of the logical locations corresponding to the first drive to identify an unused one of the logical locations, and (iii) assign the unused one of the logical locations to the second drive based on the predetermined value; and a difference module configured to generate a third code word based on each of the first code word and the second code word, wherein the encoder module is configured to generate an updated code word for the plurality of drives based on the first code word and the third code word. | 1. A control module comprising: an encoder module configured to (i) receive data, and (ii) based on the data, generate a first code word for a plurality of drives; a detector module configured to, in response to detecting an error in a first drive of the plurality of drives subsequent to generation of the first code word, initiate replacement of the first drive with a second drive, wherein the encoder module is configured to generate a second code word for the second drive; a mapping module configured to (i) map physical locations of the data in the plurality of drives to logical locations of the first code word, (ii) assign a predetermined value to one of the logical locations corresponding to the first drive to identify an unused one of the logical locations, and (iii) assign the unused one of the logical locations to the second drive based on the predetermined value; and a difference module configured to generate a third code word based on each of the first code word and the second code word, wherein the encoder module is configured to generate an updated code word for the plurality of drives based on the first code word and the third code word. 11. The control module of claim 1 , wherein the unused one of the logical locations is a highest unused one of the logical locations. | 0.811615 |
9,026,425 | 2 | 4 | 2. The method of claim 1 wherein the domain-adapted feature comprises at least one of: a domain-adapted lexical feature; and a domain-adapted phrasal feature. | 2. The method of claim 1 wherein the domain-adapted feature comprises at least one of: a domain-adapted lexical feature; and a domain-adapted phrasal feature. 4. The method of claim 2 , wherein the domain-adapted feature comprises at least one domain-adapted phrasal feature and wherein the domain-adapted phrasal feature is computed as a function of a parallel phrase probability and a monolingual phrase probability for each of a plurality of phrases of one of the source text string and the target text string, each parallel phrase probability being a function of co-occurrence, in a parallel corpus of source and target strings, of that phrase with a corresponding phrase of the other of the source text string and target text string, each monolingual phrase probability being a function of the occurrence of that phrase in a respective monolingual corpus. | 0.5 |
10,157,070 | 1 | 3 | 1. A computer-implemented method, comprising: receiving, by at least one processor in a computing system, at least one parameter relating to a document; generating, by the at least one processor, at least one narrative based on the received parameter; generating, by the at least one processor, at least one document mapping based on the at least one generated narrative; wherein the at least one document mapping includes: (i) a plurality of magnet component identifiers, (ii) a plurality of pivot component identifiers, and (iii) a plurality of glow component identifiers; displaying to a user, by the at least one processor, the plurality of magnet component identifiers, the plurality of pivot component identifiers, and the plurality of glow component identifiers; receiving from the user, by the at least one processor, a selected magnet component identifier from the plurality of magnet component identifiers; receiving from the user, by the at least one processor, a selected pivot component identifier from the plurality of pivot component identifiers; receiving from the user, by the at least one processor, a selected glow component identifier from the plurality of glow component identifiers; generating, by the at least one processor, a user-selected map based on the selected magnet component identifier, the selected pivot component identifier, and the selected glow component identifier; and combining, by the at least one processor, the user-selected map and the at least one generated narrative to generate the document. | 1. A computer-implemented method, comprising: receiving, by at least one processor in a computing system, at least one parameter relating to a document; generating, by the at least one processor, at least one narrative based on the received parameter; generating, by the at least one processor, at least one document mapping based on the at least one generated narrative; wherein the at least one document mapping includes: (i) a plurality of magnet component identifiers, (ii) a plurality of pivot component identifiers, and (iii) a plurality of glow component identifiers; displaying to a user, by the at least one processor, the plurality of magnet component identifiers, the plurality of pivot component identifiers, and the plurality of glow component identifiers; receiving from the user, by the at least one processor, a selected magnet component identifier from the plurality of magnet component identifiers; receiving from the user, by the at least one processor, a selected pivot component identifier from the plurality of pivot component identifiers; receiving from the user, by the at least one processor, a selected glow component identifier from the plurality of glow component identifiers; generating, by the at least one processor, a user-selected map based on the selected magnet component identifier, the selected pivot component identifier, and the selected glow component identifier; and combining, by the at least one processor, the user-selected map and the at least one generated narrative to generate the document. 3. The method according to claim 1 , wherein the at least one narrative includes at least one of the following: an audio, a video, a text, a data, a metadata, a graphic and any combination thereof. | 0.636531 |
5,577,239 | 1 | 4 | 1. A method of generating computer search keys for every atom in a chemical structure for searching chemical structures stored in a relational database, the method comprising the following steps: choosing a starting atom in an input chemical structure; adding a code for said starting atom to a key string; ordering bonds that are adjacent to said starting atom; and adding codes for said ordered bonds to said key string whereby a search key is generated based upon said codes for said ordered bonds and atoms. | 1. A method of generating computer search keys for every atom in a chemical structure for searching chemical structures stored in a relational database, the method comprising the following steps: choosing a starting atom in an input chemical structure; adding a code for said starting atom to a key string; ordering bonds that are adjacent to said starting atom; and adding codes for said ordered bonds to said key string whereby a search key is generated based upon said codes for said ordered bonds and atoms. 4. The method of generating search keys of claim 1, wherein said chemical structures are stored in a relational database. | 0.654286 |
7,624,114 | 8 | 9 | 8. The method as recited in claim 6 , wherein the act of automatically formulating a dynamic query configured to query a database table comprises an act formulating a dynamic query for one or more of sorting, deleting, adding, and modifying records in the database table. | 8. The method as recited in claim 6 , wherein the act of automatically formulating a dynamic query configured to query a database table comprises an act formulating a dynamic query for one or more of sorting, deleting, adding, and modifying records in the database table. 9. The method as recited in claim 8 , wherein the act of formulating a dynamic query for sorting records in the database table comprises an act formulating a dynamic query that can toggle between sorting records of the database table in ascending and descending order based on values in one of fields of the records. | 0.5 |
8,032,537 | 1 | 6 | 1. A method for generating a list of frequently used words for an email application on a server computer, the method comprising: receiving a request on the server computer to provide a list of frequently used word in email message stored in a user's mailbox on the server computer; determining if a word frequency list exists in the user's mailbox; if a word frequency list exist, returning the word frequency list; if a word frequency list does not exist, starting a asynchronous process on the server computer to generate a word frequency list; if a word frequency list does exist and the age of the word frequency list is greater than an aging limit, starting the same asynchronous process on the server computer to regenerate the word frequency list; storing the word frequency list in the user's mailbox; and storing a timestamp in the user's mailbox, the time stamp indicating the date and time when the word frequency list was created or updated; wherein the asynchronous process generates the word frequency list by performing steps comprising: sampling email messages from one or more random memory blocks on the server computer; parsing a predetermined number of email messages from the user's mailbox from the one or more random memory blocks, the parsing resulting in generating one or more unique words for each email message; generating a word frequency list for the one or more unique words, the word frequency list providing a count number of the number of emails in the predetermined number of email message in which each unique word is found. | 1. A method for generating a list of frequently used words for an email application on a server computer, the method comprising: receiving a request on the server computer to provide a list of frequently used word in email message stored in a user's mailbox on the server computer; determining if a word frequency list exists in the user's mailbox; if a word frequency list exist, returning the word frequency list; if a word frequency list does not exist, starting a asynchronous process on the server computer to generate a word frequency list; if a word frequency list does exist and the age of the word frequency list is greater than an aging limit, starting the same asynchronous process on the server computer to regenerate the word frequency list; storing the word frequency list in the user's mailbox; and storing a timestamp in the user's mailbox, the time stamp indicating the date and time when the word frequency list was created or updated; wherein the asynchronous process generates the word frequency list by performing steps comprising: sampling email messages from one or more random memory blocks on the server computer; parsing a predetermined number of email messages from the user's mailbox from the one or more random memory blocks, the parsing resulting in generating one or more unique words for each email message; generating a word frequency list for the one or more unique words, the word frequency list providing a count number of the number of emails in the predetermined number of email message in which each unique word is found. 6. The method of claim 1 , wherein the voice mail transcription application uses the word frequency list to transcribe a voice mail message into text, the word frequency list being used to help distinguish between similarly sounding words in the voice mail message. | 0.5 |
8,725,490 | 13 | 18 | 13. At least one non-transitory computer readable storage medium having computer program instructions stored thereon that are arranged to perform the following operations: in response to an image/video being obtained by a camera of the mobile device, displaying the obtained image/video in a display of the mobile device; in response to an image/video being obtained by the camera of the mobile device and a translation option being selected on the mobile device, sending the image/video from the mobile device to an image recognition server for processing the image/video to determine whether the image/video contains a first text string in a first language; in response to receiving from the image recognition server a determination that the image/video contains the first text string in the first language, sending the first text string to a translation server for obtaining a translation of the first text string into a second text string in a second language that has been associated with a user of the mobile device or the mobile device; after the translation of the first text string into the second text string in the second language is obtained, displaying in the display of the mobile device the second text string in the second language transposed over the first text string in the image/video captured by the camera; and as the camera continuously obtains a new image/video, repeating displaying the new image/video, determining whether the new image/video contains a new text string, obtaining a translation for the new text string, and displaying the translation of the new text string transposed over the new text string in the new image/video. | 13. At least one non-transitory computer readable storage medium having computer program instructions stored thereon that are arranged to perform the following operations: in response to an image/video being obtained by a camera of the mobile device, displaying the obtained image/video in a display of the mobile device; in response to an image/video being obtained by the camera of the mobile device and a translation option being selected on the mobile device, sending the image/video from the mobile device to an image recognition server for processing the image/video to determine whether the image/video contains a first text string in a first language; in response to receiving from the image recognition server a determination that the image/video contains the first text string in the first language, sending the first text string to a translation server for obtaining a translation of the first text string into a second text string in a second language that has been associated with a user of the mobile device or the mobile device; after the translation of the first text string into the second text string in the second language is obtained, displaying in the display of the mobile device the second text string in the second language transposed over the first text string in the image/video captured by the camera; and as the camera continuously obtains a new image/video, repeating displaying the new image/video, determining whether the new image/video contains a new text string, obtaining a translation for the new text string, and displaying the translation of the new text string transposed over the new text string in the new image/video. 18. At least one computer readable storage medium as recited claim 13 , wherein the image/video is processed for multiple first text strings, which are translated into multiple second text strings, each second text string being positioned near its corresponding first text string. | 0.589443 |
9,100,183 | 4 | 6 | 4. A non-transitory computer readable medium that stores instructions for: receiving, by a first computerized entity and over a communication network, encrypted text that comprises multiple random tokens and a plurality of plaintext symbols; wherein the multiple random tokens are generated by a second computerized entity; wherein a value of each random token that represents a plaintext symbol is responsive to values of random tokens that represents plaintext symbols that have a lower lexicographic value than the plaintext symbol; and processing the encrypted text by the first computerized entity, wherein the processing is selected from a group consisting of sorting and searching. | 4. A non-transitory computer readable medium that stores instructions for: receiving, by a first computerized entity and over a communication network, encrypted text that comprises multiple random tokens and a plurality of plaintext symbols; wherein the multiple random tokens are generated by a second computerized entity; wherein a value of each random token that represents a plaintext symbol is responsive to values of random tokens that represents plaintext symbols that have a lower lexicographic value than the plaintext symbol; and processing the encrypted text by the first computerized entity, wherein the processing is selected from a group consisting of sorting and searching. 6. The non-transitory computer readable medium according to claim 4 wherein the first computerized entity supports a data base application. | 0.539735 |
7,694,311 | 16 | 19 | 16. The article of manufacture of claim 11 , wherein each task is associated with at least one attribute associated with at least one of the following entities: user, user's computer, user's account, subject matter of the task, and application. | 16. The article of manufacture of claim 11 , wherein each task is associated with at least one attribute associated with at least one of the following entities: user, user's computer, user's account, subject matter of the task, and application. 19. The article of manufacture of claim 16 , wherein each task is analyzed based on at least one of the following said attributes: demography, location, department, job, and title. | 0.5 |
9,292,101 | 10 | 12 | 10. A mobile communication device having a display and a keyboard, comprising: a memory containing: a plurality of character sets associated with languages, each language character set having language variant characters; and a set of instructions; and one or more processors configured to execute the instructions to: receive a first input of a character; in response to the first input, display available language character sets associated with the character at a position in a first menu; receive a second input reflecting a first directional swipe toward a position of a particular language character set on the first menu; in response to the second input, display available language variant characters associated with the character and the particular language character set at a position in the first menu, the available language variant characters replacing the available language character sets associated with the character in the first menu; receive a third input reflecting a second directional swipe toward a position of a particular language variant character on the first menu; and in response to the third input, output the particular language variant character as a selected character. | 10. A mobile communication device having a display and a keyboard, comprising: a memory containing: a plurality of character sets associated with languages, each language character set having language variant characters; and a set of instructions; and one or more processors configured to execute the instructions to: receive a first input of a character; in response to the first input, display available language character sets associated with the character at a position in a first menu; receive a second input reflecting a first directional swipe toward a position of a particular language character set on the first menu; in response to the second input, display available language variant characters associated with the character and the particular language character set at a position in the first menu, the available language variant characters replacing the available language character sets associated with the character in the first menu; receive a third input reflecting a second directional swipe toward a position of a particular language variant character on the first menu; and in response to the third input, output the particular language variant character as a selected character. 12. The mobile communication device of claim 10 , wherein displaying the available language character sets associated with the character at the position in the first menu is determined from a persistent association between a plurality of the available language character sets and positions on the first menu. | 0.5 |
9,472,196 | 1 | 6 | 1. A computer-implemented method comprising: receiving data specifying a new voice action submitted by an application developer, the data identifying (i) an application, and (ii) a voice command trigger term; validating the received data; generating a data structure instance that specifies (i) the application, (ii) the voice command trigger term, and (iii) one or more alternate voice command trigger terms that are each determined based at least on the voice command trigger term; after generating the data structure instance, enabling triggering of the new voice action by a spoken utterance based at least on storing the data structure instance at a database that comprises one or more other data structure instances, wherein one or more of the other data structure instances specify (i) an application, and (ii) one or more voice command trigger terms that includes at least one voice command trigger term that is determined based at least on another voice command trigger term in the same data structure instance; after enabling triggering of the new voice action by a spoken utterance and based at least on determining that a transcription of a spoken utterance includes a particular one of the alternate voice command trigger terms that are each determined based at least on the voice command trigger term, selecting a particular data structure instance from the database that specifies the particular one of the alternate voice command trigger terms that are each determined based at least on the voice command trigger term; and identifying a particular application that is specified by the particular data structure instance. | 1. A computer-implemented method comprising: receiving data specifying a new voice action submitted by an application developer, the data identifying (i) an application, and (ii) a voice command trigger term; validating the received data; generating a data structure instance that specifies (i) the application, (ii) the voice command trigger term, and (iii) one or more alternate voice command trigger terms that are each determined based at least on the voice command trigger term; after generating the data structure instance, enabling triggering of the new voice action by a spoken utterance based at least on storing the data structure instance at a database that comprises one or more other data structure instances, wherein one or more of the other data structure instances specify (i) an application, and (ii) one or more voice command trigger terms that includes at least one voice command trigger term that is determined based at least on another voice command trigger term in the same data structure instance; after enabling triggering of the new voice action by a spoken utterance and based at least on determining that a transcription of a spoken utterance includes a particular one of the alternate voice command trigger terms that are each determined based at least on the voice command trigger term, selecting a particular data structure instance from the database that specifies the particular one of the alternate voice command trigger terms that are each determined based at least on the voice command trigger term; and identifying a particular application that is specified by the particular data structure instance. 6. The computer-implemented method of claim 1 , comprising: based on identifying the particular application that is specified by the particular data structure instance, causing a task to be performed. | 0.904671 |
8,411,086 | 1 | 8 | 1. A computer-implemented method for defining a model comprising: at a computer system having one or more processors and memory storing one or more programs that when executed by the one or more processors cause the computer system to perform the method: analyzing one or more images of a physical space that include a plurality of distinctive visual features, wherein: the plurality of distinctive visual features include a first marker associated with first semantic information and a second marker associated with second semantic information; the first semantic information and the second semantic information are defined in accordance with a markup language that specifies rules for combining semantic information from a plurality of markers; and analyzing the one or more images includes: determining a pose of the first marker; and determining a pose of the second marker; and defining a model based at least in part on the pose of the first marker, the pose of the second marker, the first semantic information and the second semantic information, wherein defining the model includes: approximating a first model component based on the pose of the first marker and the first semantic information; and modifying the first model component based on the pose of the second marker and the second semantic information. | 1. A computer-implemented method for defining a model comprising: at a computer system having one or more processors and memory storing one or more programs that when executed by the one or more processors cause the computer system to perform the method: analyzing one or more images of a physical space that include a plurality of distinctive visual features, wherein: the plurality of distinctive visual features include a first marker associated with first semantic information and a second marker associated with second semantic information; the first semantic information and the second semantic information are defined in accordance with a markup language that specifies rules for combining semantic information from a plurality of markers; and analyzing the one or more images includes: determining a pose of the first marker; and determining a pose of the second marker; and defining a model based at least in part on the pose of the first marker, the pose of the second marker, the first semantic information and the second semantic information, wherein defining the model includes: approximating a first model component based on the pose of the first marker and the first semantic information; and modifying the first model component based on the pose of the second marker and the second semantic information. 8. The method of claim 1 , wherein the model includes a plurality of model aspects selected from the set consisting of: a model component; a pose of a model component; and a description of the visual appearance of a model component. | 0.609428 |
9,135,267 | 11 | 14 | 11. A system for establishing a bridge between two documents, comprising a server, configured to store the two documents; a receiver, coupled to the server, for receiving a first document represented by a hierarchical data structure model having a plurality of first nodes; a first processor, coupled to the server, for generating a second document represented by a flat data structure model having a plurality of flat data structure elements, the second document being an online collaboratively editable document, and for establishing the bridge between the first document and the second document, wherein establishing the bridge includes: linking each of the plurality of first nodes to the plurality of flat data structure elements via a linkage, such that at least a portion of contents of the plurality of first nodes is copied to the plurality of flat data structure elements; and maintaining the bridge, such that an edit to the first document, represented in at least one of the first nodes, is applied to at least one corresponding flat data structure element, thereby applying the edit to the second document. | 11. A system for establishing a bridge between two documents, comprising a server, configured to store the two documents; a receiver, coupled to the server, for receiving a first document represented by a hierarchical data structure model having a plurality of first nodes; a first processor, coupled to the server, for generating a second document represented by a flat data structure model having a plurality of flat data structure elements, the second document being an online collaboratively editable document, and for establishing the bridge between the first document and the second document, wherein establishing the bridge includes: linking each of the plurality of first nodes to the plurality of flat data structure elements via a linkage, such that at least a portion of contents of the plurality of first nodes is copied to the plurality of flat data structure elements; and maintaining the bridge, such that an edit to the first document, represented in at least one of the first nodes, is applied to at least one corresponding flat data structure element, thereby applying the edit to the second document. 14. The system of claim 11 , further comprising a transceiver, configured to transmit a copy of the second document to a user device including a second processor, wherein the copy is represented by an additional flat data structure having a plurality of additional flat data structure elements; and wherein the first processor is configured to establish an additional bridge between the copy and the second document, such that a first edit to the second document is applied to the copy. | 0.669388 |
7,822,704 | 23 | 24 | 23. The method in claim 22 , wherein said selecting process searches multiple databases. | 23. The method in claim 22 , wherein said selecting process searches multiple databases. 24. The method in claim 23 , wherein said selecting process creates shared dimensions for databases that do not share common attributes. | 0.5 |
9,064,436 | 1 | 4 | 1. A system comprising: at least one processor; a head-mountable display that provides a wearer field-of-view when worn; a touch interface arranged on the head-mountable display such that the touch interface is outside of the wearer field-of-view when the head-mountable display is worn; a non-transitory computer readable medium; and program instructions stored on the non-transitory computer readable medium and executable by the at least one processor to perform functions comprising: providing, on the touch interface, a user-interface comprising a set of input areas, wherein each of the input areas is associated with a character from a set of characters; receiving, on the touch interface, first touch input data indicating a selection of a first input area from the set of input areas and a direction relative to the first input area; determining a first subset of input areas from the set of input areas, wherein the first subset includes a range of one or more adjacent input areas extending from the selected first input area in the indicated direction relative to the selected first input area; receiving, on the touch interface, second touch input data indicating a sequence of one or more successive selections of respective second input areas from the set of input areas and respective directions relative to each selected second input area, wherein each selected second input area is located to a first side of a previously selected second input area; determining one or more second subsets of input areas from the set of input areas, wherein each second subset includes a range extending from the selected second input area in the indicated direction relative to the second input area, wherein the range is exclusive of input areas that are located to a second side of previously selected second input area, and wherein the second side is opposite the first side; determining a word that includes respective characters corresponding to input areas within the first subset of input areas and the one or more second subsets of input areas; and causing a visual depiction of the determined word to be provided on a head-mountable graphical display. | 1. A system comprising: at least one processor; a head-mountable display that provides a wearer field-of-view when worn; a touch interface arranged on the head-mountable display such that the touch interface is outside of the wearer field-of-view when the head-mountable display is worn; a non-transitory computer readable medium; and program instructions stored on the non-transitory computer readable medium and executable by the at least one processor to perform functions comprising: providing, on the touch interface, a user-interface comprising a set of input areas, wherein each of the input areas is associated with a character from a set of characters; receiving, on the touch interface, first touch input data indicating a selection of a first input area from the set of input areas and a direction relative to the first input area; determining a first subset of input areas from the set of input areas, wherein the first subset includes a range of one or more adjacent input areas extending from the selected first input area in the indicated direction relative to the selected first input area; receiving, on the touch interface, second touch input data indicating a sequence of one or more successive selections of respective second input areas from the set of input areas and respective directions relative to each selected second input area, wherein each selected second input area is located to a first side of a previously selected second input area; determining one or more second subsets of input areas from the set of input areas, wherein each second subset includes a range extending from the selected second input area in the indicated direction relative to the second input area, wherein the range is exclusive of input areas that are located to a second side of previously selected second input area, and wherein the second side is opposite the first side; determining a word that includes respective characters corresponding to input areas within the first subset of input areas and the one or more second subsets of input areas; and causing a visual depiction of the determined word to be provided on a head-mountable graphical display. 4. The system of claim 1 , wherein receiving, on the touch interface, second touch input data indicating a sequence of one or more successive selections of respective second input areas comprises, for at least one of the one or more successive selections of second input areas, receiving data indicating a drag input across one or more second input areas adjacent to the selected second input area, wherein the respective range consists of the one or more second input areas. | 0.621815 |
9,280,970 | 8 | 13 | 8. A non-transitory computer readable storage medium storing instructions executable by a data processing apparatus and that upon such execution causes the data processing apparatus to perform operations comprising: receiving, by a data processing apparatus, lattice parse data describing a lattice parse of a command sentence input at a user device as a voice command input sentence and converted to a plurality of terms, the lattice parse data defining a plurality of N nodes and edges connecting the N nodes, each respective edge corresponding to a respective term in the command sentence and connecting a respective first node to a respective second node, wherein one of the first nodes is a source node having only one edge corresponding to a first term in the command sentence and one of the second nodes is a sink node; annotating each respective term of an edge as one of a terminal or a non-terminal; accessing, by the data processing apparatus, a plurality of parsing rules, each parsing rule defined by one or more constituent parsing rules and each parsing rule associated with a particular action, wherein at least some of the paring rules include constituent parsing rules that include non-terminals, and wherein each particular action is an action to be taken by the user device in response to a successful parse of a command sentence by the parsing rule; for each of the parsing rules, determining lattice spans of two or more nodes that define corresponding term spans in the command sentence that are consumed by one or more constituent parsing rules; for each parsing rule for which the determined lattice spans from the source node to the sink node of the lattice parse, selecting the parsing rule as a candidate parse of the command sentence; determining, from the candidate parses of the command sentence, an action to be performed in response to the command sentence; and causing the determined action to be performed. | 8. A non-transitory computer readable storage medium storing instructions executable by a data processing apparatus and that upon such execution causes the data processing apparatus to perform operations comprising: receiving, by a data processing apparatus, lattice parse data describing a lattice parse of a command sentence input at a user device as a voice command input sentence and converted to a plurality of terms, the lattice parse data defining a plurality of N nodes and edges connecting the N nodes, each respective edge corresponding to a respective term in the command sentence and connecting a respective first node to a respective second node, wherein one of the first nodes is a source node having only one edge corresponding to a first term in the command sentence and one of the second nodes is a sink node; annotating each respective term of an edge as one of a terminal or a non-terminal; accessing, by the data processing apparatus, a plurality of parsing rules, each parsing rule defined by one or more constituent parsing rules and each parsing rule associated with a particular action, wherein at least some of the paring rules include constituent parsing rules that include non-terminals, and wherein each particular action is an action to be taken by the user device in response to a successful parse of a command sentence by the parsing rule; for each of the parsing rules, determining lattice spans of two or more nodes that define corresponding term spans in the command sentence that are consumed by one or more constituent parsing rules; for each parsing rule for which the determined lattice spans from the source node to the sink node of the lattice parse, selecting the parsing rule as a candidate parse of the command sentence; determining, from the candidate parses of the command sentence, an action to be performed in response to the command sentence; and causing the determined action to be performed. 13. The non-transitory computer readable storage medium of claim 8 , wherein determining, from the candidate parses of the command sentence, an action to be performed in response to the command sentence comprises: for each candidate parse, generating an action score for the parse; and selecting the particular action associated with the candidate parse having a highest action score relative to the actions scores for the other candidate parses. | 0.554 |
9,251,279 | 1 | 32 | 1. A database search method comprising the computer implemented steps of: providing access to a database having a plurality of records in respective categories of information, each record having one or more facets to the respective category of information; receiving user input of a first search term formed of a first parameter indicative of at least one category of information of the database; searching the database for records of the at least one category of information; in response to the user input of the first search term, simultaneously displaying both in a same screen view: (a) a set of search results, including records from the database of the at least one category of information, and (b) a listing of any one or combination of facets and facet values of the records in the set of search results, the listing serving as suggested additional parameters for further refining the first search term upon user selection of the any one or combination of facets and facet values; enabling user input of a second search term formed of a second parameter; and in response to user selection of any one or combination of facets and facet values from the listing or user input of the second search term, refining the first search term based on the user selection of the any one or combination of facets and facet values from the listing or user input of the second search term, resulting in (i) a refined search term formed of the first parameter plus the user-selected any one or combination of facets and facet values or user-inputted second search term, and (ii) a search of the database using the refined search term, wherein at least one of the any one or combination of facets and facet values is defined by a community of users and corresponds to content generated by the community of users. | 1. A database search method comprising the computer implemented steps of: providing access to a database having a plurality of records in respective categories of information, each record having one or more facets to the respective category of information; receiving user input of a first search term formed of a first parameter indicative of at least one category of information of the database; searching the database for records of the at least one category of information; in response to the user input of the first search term, simultaneously displaying both in a same screen view: (a) a set of search results, including records from the database of the at least one category of information, and (b) a listing of any one or combination of facets and facet values of the records in the set of search results, the listing serving as suggested additional parameters for further refining the first search term upon user selection of the any one or combination of facets and facet values; enabling user input of a second search term formed of a second parameter; and in response to user selection of any one or combination of facets and facet values from the listing or user input of the second search term, refining the first search term based on the user selection of the any one or combination of facets and facet values from the listing or user input of the second search term, resulting in (i) a refined search term formed of the first parameter plus the user-selected any one or combination of facets and facet values or user-inputted second search term, and (ii) a search of the database using the refined search term, wherein at least one of the any one or combination of facets and facet values is defined by a community of users and corresponds to content generated by the community of users. 32. A method as claimed in claim 1 , wherein facet value display is limited to facet values with a facet value count above some minimum number. | 0.831765 |
9,606,900 | 1 | 7 | 1. A computerized method for intelligent automation of computer software test scripts and code requirements, the method comprising: automatically scanning, by a server computing device, a plurality of code files stored in a code repository that comprise one or more lines of application source code to identify changes made to the code files, including: determining, by the server computing device, whether a timestamp of each of the code files has changed, and extracting, by the server computing device, one or more data elements associated with the code file and storing the data elements in a database, if the timestamp of the code file has changed, wherein the changes made to the code files include one or more of: changes to a folder structure in which the code file is located, changes to a configuration file of an application associated with the code file, changes to one or more lines of application source code contained in the code file, and changes to a build file of an application in which the code file is included; selecting, by the server computing device, one or more test automation script files from a test script repository that are related to the changed code files; parsing, by the server computing device, each selected test automation script file to determine whether the selected test automation script file includes changes that correspond to the changes made to the related code files, including: extracting, by the server computing device, one or more data elements associated with the selected test automation script file and storing the data elements in the database, wherein the changes to the selected test automation script file include one or more of: changes to a folder structure in which the code file is located, and changes to one or more lines of script code contained in the selected test automation script file; if the selected test automation script file includes the corresponding changes: determining, by the server computing device, whether a current version of the selected test automation script file is located on each of one or more test server computing devices; and installing, by the server computing device, the current version of the selected test automation script file on each test server computing device that does not have the current version; and if the selected test automation script file does not include the corresponding changes: transmitting, by the server computing device, a notification message to a remote computing device to indicate that the selected test automation script file requires the corresponding changes. | 1. A computerized method for intelligent automation of computer software test scripts and code requirements, the method comprising: automatically scanning, by a server computing device, a plurality of code files stored in a code repository that comprise one or more lines of application source code to identify changes made to the code files, including: determining, by the server computing device, whether a timestamp of each of the code files has changed, and extracting, by the server computing device, one or more data elements associated with the code file and storing the data elements in a database, if the timestamp of the code file has changed, wherein the changes made to the code files include one or more of: changes to a folder structure in which the code file is located, changes to a configuration file of an application associated with the code file, changes to one or more lines of application source code contained in the code file, and changes to a build file of an application in which the code file is included; selecting, by the server computing device, one or more test automation script files from a test script repository that are related to the changed code files; parsing, by the server computing device, each selected test automation script file to determine whether the selected test automation script file includes changes that correspond to the changes made to the related code files, including: extracting, by the server computing device, one or more data elements associated with the selected test automation script file and storing the data elements in the database, wherein the changes to the selected test automation script file include one or more of: changes to a folder structure in which the code file is located, and changes to one or more lines of script code contained in the selected test automation script file; if the selected test automation script file includes the corresponding changes: determining, by the server computing device, whether a current version of the selected test automation script file is located on each of one or more test server computing devices; and installing, by the server computing device, the current version of the selected test automation script file on each test server computing device that does not have the current version; and if the selected test automation script file does not include the corresponding changes: transmitting, by the server computing device, a notification message to a remote computing device to indicate that the selected test automation script file requires the corresponding changes. 7. The method of claim 1 , wherein the step of extracting one or more data elements associated with the selected test automation script file comprises parsing, by the server computing device, the one or more lines of script code contained in the selected test automation script file to identify one or more data elements associated with the selected test automation script file. | 0.639313 |
7,809,575 | 15 | 16 | 15. The computer program product of claim 13 , wherein the computer program instructions capable of loading any currently unloaded global grammars in the loaded multimodal web page further comprise computer program instructions capable of: identifying in dependence upon markup in the loaded multimodal web page a global grammar; determining that the identified global grammar is not currently loaded; and loading the identified global grammar. | 15. The computer program product of claim 13 , wherein the computer program instructions capable of loading any currently unloaded global grammars in the loaded multimodal web page further comprise computer program instructions capable of: identifying in dependence upon markup in the loaded multimodal web page a global grammar; determining that the identified global grammar is not currently loaded; and loading the identified global grammar. 16. The computer program product of claim 15 , wherein the computer program instructions capable of identifying in dependence upon markup in the loaded multimodal web page a global grammar further comprise computer program instructions capable of identifying a scope attribute for a VoiceXML form in an X+V document. | 0.5 |
9,104,738 | 16 | 21 | 16. The method of claim 15 , further including the step of automatically generating one or more client applications. | 16. The method of claim 15 , further including the step of automatically generating one or more client applications. 21. The method of claim 16 , wherein the metadata controls dynamic menus that enable users of the client applications to invoke a particular function. | 0.5 |
8,542,195 | 1 | 5 | 1. A method comprising: selecting multiple languages for a keyboard; obtaining a text corpus for each of the multiple languages; and obtaining, for each of the multiple languages, a mean time to input each of a plurality of characters in the text corpus to the keyboard for one of the multiple languages; simultaneously optimizing the keyboard for the selected multiple languages by: analyzing the text corpus for each of the multiple languages to obtain a digram frequency table; selecting key positions for characters on the keyboard based on an average distance traveled to type one of the characters and a frequency of moving from one of the characters to another one of the characters; selecting constraints for the key positions for the characters on the keyboard; and using a Metropolis method to average the obtained mean times to input one of the characters to the keyboard for each of the multiple languages and determine placement for the positions of the characters on the keyboard for higher user input speed on the keyboard, based on the digram frequency table and additional constraints. | 1. A method comprising: selecting multiple languages for a keyboard; obtaining a text corpus for each of the multiple languages; and obtaining, for each of the multiple languages, a mean time to input each of a plurality of characters in the text corpus to the keyboard for one of the multiple languages; simultaneously optimizing the keyboard for the selected multiple languages by: analyzing the text corpus for each of the multiple languages to obtain a digram frequency table; selecting key positions for characters on the keyboard based on an average distance traveled to type one of the characters and a frequency of moving from one of the characters to another one of the characters; selecting constraints for the key positions for the characters on the keyboard; and using a Metropolis method to average the obtained mean times to input one of the characters to the keyboard for each of the multiple languages and determine placement for the positions of the characters on the keyboard for higher user input speed on the keyboard, based on the digram frequency table and additional constraints. 5. The method of claim 1 , wherein the method is repeated with different constraints including constraints on size, number of rows, and number of columns. | 0.5 |
8,762,390 | 1 | 2 | 1. A method for image retrieval, comprising: capturing images from a camera sensor or from a computer generated display memory; constructing a plurality of graphs including a first graph for candidate images retrieved based upon holistic features of a query image and a second graph for candidate images retrieved based upon local features of the query image, wherein constructing includes weighting connected images based upon a Jaccard similarity coefficient determined as: w ( q , d ) = α N k ( q ) ⋂ N k ( d ) N k ( q ) ⋃ N k ( d ) where w is weight of an edge for images q and d that are reciprocal neighbors, N represents a neighborhood, and α is a decay coefficient related to number of hops to the query; fusing the plurality of graphs to provide a fused graph; and ranking, using a processor, candidate images of the fused graph to provide retrieval results of the query image. | 1. A method for image retrieval, comprising: capturing images from a camera sensor or from a computer generated display memory; constructing a plurality of graphs including a first graph for candidate images retrieved based upon holistic features of a query image and a second graph for candidate images retrieved based upon local features of the query image, wherein constructing includes weighting connected images based upon a Jaccard similarity coefficient determined as: w ( q , d ) = α N k ( q ) ⋂ N k ( d ) N k ( q ) ⋃ N k ( d ) where w is weight of an edge for images q and d that are reciprocal neighbors, N represents a neighborhood, and α is a decay coefficient related to number of hops to the query; fusing the plurality of graphs to provide a fused graph; and ranking, using a processor, candidate images of the fused graph to provide retrieval results of the query image. 2. The method as recited in claim 1 , wherein fusing includes combining weights of the connected images from each of the plurality of graphs. | 0.5 |
9,081,550 | 21 | 26 | 21. A method for automatically speech enabling a graphical user interface (GUI), the method comprising: at design time of the GUI, receiving first input from a GUI designer for design of the GUI; at design time of the GUI, including a VUIcontroller in the GUI that will be executed at run time of the GUI; at design time of the GUI, receiving second input the GUI designer that specifies a voice-enabling property of a first control of the GUI being designed; at design time of the GUI, receiving third input from the GUI designer that disables voice control of a second control of the GUI being designed; at run time of the GUI, automatically executing the VUIcontroller that was included in the GUI at design time of the GUI, wherein the VUIcontroller instantiates acts of: analyzing the GUI from within a process that executes the GUI; generating a voice-enabled GUI based on the analysis; generating, from the analysis of the GUI, a voice command set corresponding to voice-enabled controls of the GUI; and making the generated voice command set available to a speech-recognition engine. | 21. A method for automatically speech enabling a graphical user interface (GUI), the method comprising: at design time of the GUI, receiving first input from a GUI designer for design of the GUI; at design time of the GUI, including a VUIcontroller in the GUI that will be executed at run time of the GUI; at design time of the GUI, receiving second input the GUI designer that specifies a voice-enabling property of a first control of the GUI being designed; at design time of the GUI, receiving third input from the GUI designer that disables voice control of a second control of the GUI being designed; at run time of the GUI, automatically executing the VUIcontroller that was included in the GUI at design time of the GUI, wherein the VUIcontroller instantiates acts of: analyzing the GUI from within a process that executes the GUI; generating a voice-enabled GUI based on the analysis; generating, from the analysis of the GUI, a voice command set corresponding to voice-enabled controls of the GUI; and making the generated voice command set available to a speech-recognition engine. 26. A method according to claim 21 , further comprising, at run time of the GUI, in response to a change in the GUI, revising the generated voice command set according to the changes in the GUI. | 0.736413 |
9,412,369 | 17 | 20 | 17. A method comprising: accessing a medical history repository, the medical history repository storing medical history information, the medical history information being associated with a plurality of patients; receiving event audio data, the event audio data being based on verbal utterances, the verbal utterances being associated with a pharmaceutical event, the pharmaceutical event being associated with at least one of the patients; obtaining at least one text string, wherein the at least one text string matches at least one interpretation of the received event audio data, wherein the obtaining the at least one text string includes transforming physical audio data into electrical data via an input device, the obtaining the at least one text string is based on information obtained from a pharmaceutical speech repository, the obtaining the at least one text string is based on information obtained from a speech accent repository, and the obtaining the at least one text string is based on a drug matching function, wherein the at least one text string is associated with a pharmaceutical drug, wherein the drug matching function includes an alternative drug matching function that determines the at least one text string, wherein the determining the at least one text string includes determining a name that is associated with an alternative drug, wherein the alternative drug is associated with the pharmaceutical drug; obtaining medical history information, the obtained medical history information being associated with the at least one of the patients; determining, via at least one device processor, one or more adverse drug event (ADE) alerts, the determining the one or more ADE alerts being based on results of a matching operation that compares a first set of information with ADE attributes, the determining the one or more ADE alerts including receiving the ADE attributes from an ADE repository, wherein the first set of information includes the at least one text string and includes medical history attributes which are associated with the at least one of the patients, the ADE repository being hosted on another system that is configured separately from a hosting system that hosts the medical history repository; and initiating a transmission of an audio alert to an audio output device, wherein the audio alert is associated with the one or more ADE alerts. | 17. A method comprising: accessing a medical history repository, the medical history repository storing medical history information, the medical history information being associated with a plurality of patients; receiving event audio data, the event audio data being based on verbal utterances, the verbal utterances being associated with a pharmaceutical event, the pharmaceutical event being associated with at least one of the patients; obtaining at least one text string, wherein the at least one text string matches at least one interpretation of the received event audio data, wherein the obtaining the at least one text string includes transforming physical audio data into electrical data via an input device, the obtaining the at least one text string is based on information obtained from a pharmaceutical speech repository, the obtaining the at least one text string is based on information obtained from a speech accent repository, and the obtaining the at least one text string is based on a drug matching function, wherein the at least one text string is associated with a pharmaceutical drug, wherein the drug matching function includes an alternative drug matching function that determines the at least one text string, wherein the determining the at least one text string includes determining a name that is associated with an alternative drug, wherein the alternative drug is associated with the pharmaceutical drug; obtaining medical history information, the obtained medical history information being associated with the at least one of the patients; determining, via at least one device processor, one or more adverse drug event (ADE) alerts, the determining the one or more ADE alerts being based on results of a matching operation that compares a first set of information with ADE attributes, the determining the one or more ADE alerts including receiving the ADE attributes from an ADE repository, wherein the first set of information includes the at least one text string and includes medical history attributes which are associated with the at least one of the patients, the ADE repository being hosted on another system that is configured separately from a hosting system that hosts the medical history repository; and initiating a transmission of an audio alert to an audio output device, wherein the audio alert is associated with the one or more ADE alerts. 20. The method of claim 17 , wherein the drug matching function includes: a user history matching function configured to determine the at least one text string, wherein the determining the at least one text string is based on a history of selected text strings, wherein the history of selected text strings is associated with a user. | 0.5 |
10,068,132 | 1 | 4 | 1. A system comprising: a memory that stores instructions; and one or more processors configured by the instructions to perform operations comprising: accessing an image comprising a depiction of a page region; determining portions of the image depicting text within the page region; identifying a line segment depicted in the image, the line segment having a first part within one or more of the portions of the image depicting text and a second part outside of the portions of the image depicting text; identifying a color of the line segment, based on the second part of the line segment depicted in the image outside of the portions of the image depicting text; determining a difference value between the color of the line segment and a color of each element of the portions of the image depicting text; and identifying the text by performing optical character recognition on the portions of the image depicting text while ignoring elements within the portions of the image depicting text that have the color of the line segment. | 1. A system comprising: a memory that stores instructions; and one or more processors configured by the instructions to perform operations comprising: accessing an image comprising a depiction of a page region; determining portions of the image depicting text within the page region; identifying a line segment depicted in the image, the line segment having a first part within one or more of the portions of the image depicting text and a second part outside of the portions of the image depicting text; identifying a color of the line segment, based on the second part of the line segment depicted in the image outside of the portions of the image depicting text; determining a difference value between the color of the line segment and a color of each element of the portions of the image depicting text; and identifying the text by performing optical character recognition on the portions of the image depicting text while ignoring elements within the portions of the image depicting text that have the color of the line segment. 4. The system of claim 1 , wherein the identifying of the color of the line segment comprises applying a binary classifier to a portion of the image to identify a portion of the image depicting the line segment. | 0.755787 |
8,781,810 | 2 | 3 | 2. The method of claim 1 , wherein the merging system comprises the set of heuristics. | 2. The method of claim 1 , wherein the merging system comprises the set of heuristics. 3. The method of claim 2 , wherein in the first heuristic, two consecutive words in the string are considered for merging the first word of the two consecutive words is recognized as a compound modifier and if the observed frequency f 1 of the two consecutive words as a closed compound word is larger than the observed frequency f 2 of the two consecutive words as a bigram. | 0.631631 |
9,836,778 | 14 | 20 | 14. A computer-implemented method, comprising: building a scan event model from historical product scan messages previously received from a plurality of mobile scanning devices associated with a plurality of users, each of the historical product scan messages having a product association and a scan location association; receiving a query from a specific mobile scanning device associated with a specific user, the query including a product identifier; identifying, by at least one hardware processor, a subset of the historical scan messages, wherein each historical scan message in the subset is associated with a product definition that matches the received product identifier; and generating a recommendation for the specific user based on a merchant identified by a plurality of different retail locations represented in the subset of historical scan messages. | 14. A computer-implemented method, comprising: building a scan event model from historical product scan messages previously received from a plurality of mobile scanning devices associated with a plurality of users, each of the historical product scan messages having a product association and a scan location association; receiving a query from a specific mobile scanning device associated with a specific user, the query including a product identifier; identifying, by at least one hardware processor, a subset of the historical scan messages, wherein each historical scan message in the subset is associated with a product definition that matches the received product identifier; and generating a recommendation for the specific user based on a merchant identified by a plurality of different retail locations represented in the subset of historical scan messages. 20. The computer-implemented method of claim 14 , wherein the historical product scan messages are received responsive to each of the respective mobile scanning devices scanning a universal product code (UPC) attached to a product. | 0.75 |
8,672,683 | 25 | 26 | 25. The system of claim 24 , wherein the means for formulating a measure of user mastery comprises means for measuring user mastery corresponding to plurality of mathematical concept categories. | 25. The system of claim 24 , wherein the means for formulating a measure of user mastery comprises means for measuring user mastery corresponding to plurality of mathematical concept categories. 26. The system of claim 25 , wherein the means for generating a series of mathematical problems comprises means for randomly selecting types of mathematical problems from the plurality of mathematical concept categories. | 0.5 |
7,921,360 | 16 | 17 | 16. The method of claim 13 , further comprising: setting a flag in said substitute Web document indicating activation of said restricted editing. | 16. The method of claim 13 , further comprising: setting a flag in said substitute Web document indicating activation of said restricted editing. 17. The method of claim 16 wherein said restricting is activated in response to said flag. | 0.5 |
8,024,408 | 17 | 21 | 17. A non-transitory computer-readable storage media comprising information that, when executed by a computer, cause the computer to perform a method comprising: monitoring one or more email documents in an information stream associated with a first electronic forum; comparing information about the one or more email documents to two or more rules, wherein the comparison is between newer of the one or more email documents and older of the one or more email documents to determine when a new topic of conversation has begun; querying a set consisting of users participating in the first electronic forum when at least two of the two or more rules are satisfied; creating a new electronic forum based on one or more replies from the set of users; and subscribing each queried user of the set indicating interest in the new electronic forum to the new electronic forum, but not subscribing to the new electronic forum users of the set who do not indicate interest, wherein the two or more rules comprise at least two of the following: how long the electronic forum has been in use; how many email messages have been exchanged on the electronic forum; whether there has been a suggestion to create a new discussion forum; whether a certain number of email messages on a particular topic have been received within a predetermined time period; whether a rate of email messages exchanged on a particular topic is statistically greater than normal; or whether a certain number of forum members exchanged email messages on a particular topic within a predetermined time period. | 17. A non-transitory computer-readable storage media comprising information that, when executed by a computer, cause the computer to perform a method comprising: monitoring one or more email documents in an information stream associated with a first electronic forum; comparing information about the one or more email documents to two or more rules, wherein the comparison is between newer of the one or more email documents and older of the one or more email documents to determine when a new topic of conversation has begun; querying a set consisting of users participating in the first electronic forum when at least two of the two or more rules are satisfied; creating a new electronic forum based on one or more replies from the set of users; and subscribing each queried user of the set indicating interest in the new electronic forum to the new electronic forum, but not subscribing to the new electronic forum users of the set who do not indicate interest, wherein the two or more rules comprise at least two of the following: how long the electronic forum has been in use; how many email messages have been exchanged on the electronic forum; whether there has been a suggestion to create a new discussion forum; whether a certain number of email messages on a particular topic have been received within a predetermined time period; whether a rate of email messages exchanged on a particular topic is statistically greater than normal; or whether a certain number of forum members exchanged email messages on a particular topic within a predetermined time period. 21. The non-transitory computer-readable storage media of claim 17 , wherein the information comparison is based on a rule-based model and a statistical-based model. | 0.636564 |
7,870,253 | 11 | 12 | 11. The system of claim 1 , wherein the plurality of websites are affiliated in a business hierarchy. | 11. The system of claim 1 , wherein the plurality of websites are affiliated in a business hierarchy. 12. The system of claim 11 , wherein the franchise business hierarchy is a vehicle dealer franchise hierarchy. | 0.5 |
9,002,702 | 6 | 9 | 6. A system for assigning a confidence level to an axiom extracted from a text of a transcription of a voice recording, comprising: a memory medium comprising instructions; a bus coupled to the memory medium; and an audio transcription tool coupled to the bus that when executing the instructions causes the system to: receive the text of the transcription; compare every word from the text to a customer specific dictionary and a dictionary of common language words; determine a number of inaccurately spelled words in the transcription based on the comparing; assign, using a Gaussian distribution, a confidence level to the text of the transcription based on the determining; estimate an accuracy of the text based on the assigned confidence level; gather external information related to words in the text by retrieving a set of axioms that further define the words in the text of the transcription from a set of sources, each axiom in the set of axioms comprising a proposition that is regarded as being at least one of established, accepted, and self-evidently true; determine a confidence level of each source of the set of sources; and assign a confidence level to each axiom of the set of axioms based on a combination of the confidence level of the set of sources and the accuracy of the text estimated based on the assigned confidence level. | 6. A system for assigning a confidence level to an axiom extracted from a text of a transcription of a voice recording, comprising: a memory medium comprising instructions; a bus coupled to the memory medium; and an audio transcription tool coupled to the bus that when executing the instructions causes the system to: receive the text of the transcription; compare every word from the text to a customer specific dictionary and a dictionary of common language words; determine a number of inaccurately spelled words in the transcription based on the comparing; assign, using a Gaussian distribution, a confidence level to the text of the transcription based on the determining; estimate an accuracy of the text based on the assigned confidence level; gather external information related to words in the text by retrieving a set of axioms that further define the words in the text of the transcription from a set of sources, each axiom in the set of axioms comprising a proposition that is regarded as being at least one of established, accepted, and self-evidently true; determine a confidence level of each source of the set of sources; and assign a confidence level to each axiom of the set of axioms based on a combination of the confidence level of the set of sources and the accuracy of the text estimated based on the assigned confidence level. 9. The system of claim 6 , wherein the axiom is stored in a knowledge base. | 0.814356 |
4,597,057 | 13 | 14 | 13. Apparatus of claim 12 further including means for storing a plurality of tables of characters coded as bytes, each table having a portion of the characters addressable by a single nibble and a portion of the character addressable by two nibbles, the characters stored respectively in the two portions being different for each table, means for selecting one of the tables to operate with said means for comparing each byte with characters stored in a character table. | 13. Apparatus of claim 12 further including means for storing a plurality of tables of characters coded as bytes, each table having a portion of the characters addressable by a single nibble and a portion of the character addressable by two nibbles, the characters stored respectively in the two portions being different for each table, means for selecting one of the tables to operate with said means for comparing each byte with characters stored in a character table. 14. Apparatus of claim 13 further including means responsive to the value of the byte in the stored group preceeding the byte being compared for selecting one of said plurality of character tables, each character having an associated table of characters arranged in the two portions of the table according to the frequency in which each character in the table follows the associated preceeding character in standard English words. | 0.5 |
8,707,313 | 5 | 8 | 5. A method of scheduling a search engine crawler using a scheduler system, comprising: at a server with one or more processors and memory, and one or more programs stored in the memory that execute on the one or more processors: selecting a first subset of document identifiers from a set of document identifiers corresponding to documents on a network; computing priority scores for the first subset of document identifiers; forming a second subset of document identifiers based on the priority scores and status data collected during one or more previous crawls by the search engine crawler and by removing from the first subset one or more document identifiers identified as unreachable in a plurality of prior crawls or associated with download errors in a plurality of prior crawls; and scheduling for crawling the second subset of document identifiers; wherein each priority score is computed as a product of a respective page importance and a respective boost factor, the respective boost factor being a scalar that is used to demote or promote the priority score of the respective document identifier. | 5. A method of scheduling a search engine crawler using a scheduler system, comprising: at a server with one or more processors and memory, and one or more programs stored in the memory that execute on the one or more processors: selecting a first subset of document identifiers from a set of document identifiers corresponding to documents on a network; computing priority scores for the first subset of document identifiers; forming a second subset of document identifiers based on the priority scores and status data collected during one or more previous crawls by the search engine crawler and by removing from the first subset one or more document identifiers identified as unreachable in a plurality of prior crawls or associated with download errors in a plurality of prior crawls; and scheduling for crawling the second subset of document identifiers; wherein each priority score is computed as a product of a respective page importance and a respective boost factor, the respective boost factor being a scalar that is used to demote or promote the priority score of the respective document identifier. 8. The method of claim 5 , further comprising: storing unscheduled document identifiers for crawling at a later time. | 0.713235 |
8,885,184 | 31 | 32 | 31. The medium of claim 29 wherein the method further comprises: receiving the print data and the first job ticket at the server; analyzing the first job ticket to identify the second job ticket wrapped within the first job ticket at the server; extracting the second job ticket from the first job ticket at the server; transmitting the print data to a print controller for printing; and transmitting the second job ticket to the print controller for processing. | 31. The medium of claim 29 wherein the method further comprises: receiving the print data and the first job ticket at the server; analyzing the first job ticket to identify the second job ticket wrapped within the first job ticket at the server; extracting the second job ticket from the first job ticket at the server; transmitting the print data to a print controller for printing; and transmitting the second job ticket to the print controller for processing. 32. The medium of claim 31 wherein the method further comprises: receiving the print data at the print controller; receiving a communication at the print controller that encapsulates the second job ticket; analyzing the communication to identify the second job ticket; extracting the second job ticket from the communication; and processing the received print data in accordance with the second job ticket. | 0.5 |
7,957,968 | 1 | 3 | 1. A computer based method for automatically generating a hierarchical grammar associated with a plurality of tasks comprising the steps of: creating a sub-grammar for each of the plurality of tasks, wherein creating a sub-grammar for a task comprises: receiving data representing the task based from responses received from a distributed database; automatically tagging the data into parts of speech to form tagged data using a processor executing instructions included in a memory coupled to the processor; identifying filler words and core words from said tagged data by applying rules to differentiate between filler words and core words using the processor executing instructions included in the memory coupled to the processor; automatically modeling sentence structure based upon said tagged data using a set of modeling rules retrieved from the memory coupled to the processor; automatically identifying synonyms of said core words; and automatically creating a sub-grammar using the modeled sentence structure, the tagged data, the identified synonyms, and the identified core words; and creating a high-level grammar by combining filler words identified in the creation of the sub-grammars. | 1. A computer based method for automatically generating a hierarchical grammar associated with a plurality of tasks comprising the steps of: creating a sub-grammar for each of the plurality of tasks, wherein creating a sub-grammar for a task comprises: receiving data representing the task based from responses received from a distributed database; automatically tagging the data into parts of speech to form tagged data using a processor executing instructions included in a memory coupled to the processor; identifying filler words and core words from said tagged data by applying rules to differentiate between filler words and core words using the processor executing instructions included in the memory coupled to the processor; automatically modeling sentence structure based upon said tagged data using a set of modeling rules retrieved from the memory coupled to the processor; automatically identifying synonyms of said core words; and automatically creating a sub-grammar using the modeled sentence structure, the tagged data, the identified synonyms, and the identified core words; and creating a high-level grammar by combining filler words identified in the creation of the sub-grammars. 3. The method of claim 1 , wherein said hierarchical grammar is combined with a statistical language model to recognize speech. | 0.5 |
8,571,857 | 16 | 17 | 16. A computer-readable storage device having instructions stored which, when executed by a computing device, cause the computing device to perform operations comprising: receiving, from a separate entity, of a request to generate a model, input data and a seed model; receiving a cost function associated with generation of the model, the cost function indicating accuracy and one of speed and memory usage, wherein the cost function is formulated as:
Accscore( ASR ( Xi ))= f ( Xi )→word accuracy and speed where the following definitions apply:
f min( Xi )=−1* (word accuracy−β*speed),
speed=(CPU time)/(audio time), β=a weighting factor to speed that provides a tradeoff between accuracy and speed, Xi=a set of parameters that affect accuracy and speed, such as beam width, LM scale, MAP multiplier, maximum active arcs, duration scale; processing the input data based on the seed model and based on parameters that modify the accuracy and the one of speed and memory usage of the cost function, to yield an updated model; and outputting the updated model. | 16. A computer-readable storage device having instructions stored which, when executed by a computing device, cause the computing device to perform operations comprising: receiving, from a separate entity, of a request to generate a model, input data and a seed model; receiving a cost function associated with generation of the model, the cost function indicating accuracy and one of speed and memory usage, wherein the cost function is formulated as:
Accscore( ASR ( Xi ))= f ( Xi )→word accuracy and speed where the following definitions apply:
f min( Xi )=−1* (word accuracy−β*speed),
speed=(CPU time)/(audio time), β=a weighting factor to speed that provides a tradeoff between accuracy and speed, Xi=a set of parameters that affect accuracy and speed, such as beam width, LM scale, MAP multiplier, maximum active arcs, duration scale; processing the input data based on the seed model and based on parameters that modify the accuracy and the one of speed and memory usage of the cost function, to yield an updated model; and outputting the updated model. 17. The computer-readable storage device of claim 16 , wherein the updated model is ready for implementation in an automatic speech recognizer. | 0.698312 |
9,047,642 | 1 | 9 | 1. A system to facilitate conducting a social choice survey of members of an online community associated with a computer network, the system comprising: a computer accessible to the computer network, the computer defining a social choice administrator server, the social choice administrator server having a memory coupled to a processor; operational instructions stored in the memory of the social choice administrator server that, when executed by the processor of the social choice administrator server, cause the social choice administrator server to selectively perform the operations of: generate a first user interface on a computer display associated with a survey administrator, prompt the survey administrator with the first user interface to define the social choice survey type selected from a slider bar survey, a yes/no survey, a drag and drop survey, and a select one survey, receive the social choice survey defined by the survey administrator with the first user interface, prompt the survey administrator with the first user interface to define a group of participants from the members of the online community to participate in the social choice survey, wherein the group of participants consists of friends of a single user on a social media website, receive the group of participants defined by the survey administrator with the first user interface, generate a second user interface on a computer display associated with each of the participants, the second user interface providing an interactive portion to receive a participant's response to the social choice survey and being posted on each participant's social media account on the social media website, receive and register each of the participants' responses to the social choice survey collected with the second user interface, prompt the survey administrator to view and to select a progress of the social choice survey, in response to the selection of the progress of the social choice survey, generate a display of the progress of the social choice survey, including at least one of a list of participants who have participated in the social choice survey and a list of participants who have not participated in the social choice survey, amalgamate the participants' responses to the social choice survey to thereby determine a result of the social choice survey, and show the result of the social choice survey on a computer display of the survey administrator. | 1. A system to facilitate conducting a social choice survey of members of an online community associated with a computer network, the system comprising: a computer accessible to the computer network, the computer defining a social choice administrator server, the social choice administrator server having a memory coupled to a processor; operational instructions stored in the memory of the social choice administrator server that, when executed by the processor of the social choice administrator server, cause the social choice administrator server to selectively perform the operations of: generate a first user interface on a computer display associated with a survey administrator, prompt the survey administrator with the first user interface to define the social choice survey type selected from a slider bar survey, a yes/no survey, a drag and drop survey, and a select one survey, receive the social choice survey defined by the survey administrator with the first user interface, prompt the survey administrator with the first user interface to define a group of participants from the members of the online community to participate in the social choice survey, wherein the group of participants consists of friends of a single user on a social media website, receive the group of participants defined by the survey administrator with the first user interface, generate a second user interface on a computer display associated with each of the participants, the second user interface providing an interactive portion to receive a participant's response to the social choice survey and being posted on each participant's social media account on the social media website, receive and register each of the participants' responses to the social choice survey collected with the second user interface, prompt the survey administrator to view and to select a progress of the social choice survey, in response to the selection of the progress of the social choice survey, generate a display of the progress of the social choice survey, including at least one of a list of participants who have participated in the social choice survey and a list of participants who have not participated in the social choice survey, amalgamate the participants' responses to the social choice survey to thereby determine a result of the social choice survey, and show the result of the social choice survey on a computer display of the survey administrator. 9. The system of claim 1 , wherein the operational instructions, that, when executed by the processor, cause the social choice administrator server to further perform the operations of: amalgamating the participants' responses to the social choice survey using a single-winner election algorithm. | 0.644231 |
8,032,482 | 16 | 17 | 16. A computer-implemented method for providing a document preview on a computer, the method comprising: exposing a preview host interface at an electronic mail client application running on the computer, the preview host interface comprising: a get previewer method through which a preview handler transmits a query to the electronic mail client application and receives a response to the query from the electronic mail client application, the preview handler transmitting the query in response to receiving a request from the electronic mail client application to generate a visual preview of an attached document of an electronic mail message, the query including a file extension of the attached document for requesting the electronic mail client application to identify a previewer designated by the electronic mail client application for generating the visual preview of the attached document based on the file extension of the attached document, the response to the query from the electronic mail client application comprising an identity of a previewer if the electronic mail client application designates a previewer for the document type of the attached document, a get previewer class identifier method through which the preview handler may transmit a subsequent query to the electronic mail client application if the get previewer method does not return an identity of a previewer, the response to the subsequent query from the electronic mail client application comprising a previewer class identifier if the electronic mail client application does not designate a previewer for the document type of the attached document, wherein: the preview handler is to identify a previewer for the document type of the attached document for generating the visual preview of the attached document from a plurality of separately executable previewers based on the response from the electronic mail client application, each previewer of the plurality of previewers is separately executable from each other previewer and is registered with the preview handler as a previewer for previewing documents of a particular document type, and the plurality of previewers includes at least one of a word processor application program and a spreadsheet application program that is registered with the preview handler as a previewer for previewing documents of the document type of the attached document, capable of providing the visual preview of the attached document, and capable of being launched by the electronic mail client application for editing the attached document, a get interface method through which the preview handler may obtain pointers to other interfaces provided by the electronic mail client application, and a done loading method through which the preview handler may inform the electronic mail client application that the attached document to be visually previewed has been loaded; and loading the word processor application or the spreadsheet application as the previewer for the document type of the attached document for providing the visual preview of the attached document, wherein: the word processor application or the spreadsheet application is designated by the electronic mail client application as a loaded previewer for generating visual previews of other documents of the document type of the attached document when loaded, and the loaded previewer provides one or more interfaces for receiving user input allowing the visual preview of the attached document to be paged through and navigated. | 16. A computer-implemented method for providing a document preview on a computer, the method comprising: exposing a preview host interface at an electronic mail client application running on the computer, the preview host interface comprising: a get previewer method through which a preview handler transmits a query to the electronic mail client application and receives a response to the query from the electronic mail client application, the preview handler transmitting the query in response to receiving a request from the electronic mail client application to generate a visual preview of an attached document of an electronic mail message, the query including a file extension of the attached document for requesting the electronic mail client application to identify a previewer designated by the electronic mail client application for generating the visual preview of the attached document based on the file extension of the attached document, the response to the query from the electronic mail client application comprising an identity of a previewer if the electronic mail client application designates a previewer for the document type of the attached document, a get previewer class identifier method through which the preview handler may transmit a subsequent query to the electronic mail client application if the get previewer method does not return an identity of a previewer, the response to the subsequent query from the electronic mail client application comprising a previewer class identifier if the electronic mail client application does not designate a previewer for the document type of the attached document, wherein: the preview handler is to identify a previewer for the document type of the attached document for generating the visual preview of the attached document from a plurality of separately executable previewers based on the response from the electronic mail client application, each previewer of the plurality of previewers is separately executable from each other previewer and is registered with the preview handler as a previewer for previewing documents of a particular document type, and the plurality of previewers includes at least one of a word processor application program and a spreadsheet application program that is registered with the preview handler as a previewer for previewing documents of the document type of the attached document, capable of providing the visual preview of the attached document, and capable of being launched by the electronic mail client application for editing the attached document, a get interface method through which the preview handler may obtain pointers to other interfaces provided by the electronic mail client application, and a done loading method through which the preview handler may inform the electronic mail client application that the attached document to be visually previewed has been loaded; and loading the word processor application or the spreadsheet application as the previewer for the document type of the attached document for providing the visual preview of the attached document, wherein: the word processor application or the spreadsheet application is designated by the electronic mail client application as a loaded previewer for generating visual previews of other documents of the document type of the attached document when loaded, and the loaded previewer provides one or more interfaces for receiving user input allowing the visual preview of the attached document to be paged through and navigated. 17. The method of claim 16 , further comprising exposing a preview handler interface at the preview handler, the preview handler interface comprising: an initialize method for initializing the preview handler, a load method for instructing the preview handler to identify a previewer for the document type of the attached document and loading the attached document to be visually previewed into the previewer for the document type of the attached document, a show method for displaying the visual preview of the attached document, a window changed method for instructing the preview handler that a window in which the visual preview of the attached document was displayed has changed, and an uninitialize method for uninitializing the operation of the preview handler. | 0.5 |
7,822,626 | 16 | 20 | 16. A computer-implemented system for review and export of a clinical content structure, the system comprising: a server configured to provide a first authoring environment that operates on a first set of one or more programmed computers associated with a first protocol and a second authoring environment that operates on a second set of one or more programmed computers associated with a second protocol, wherein the first set of one or more programmed computers and the second set of one or more programmed computers are communicatively coupled to a server via a network, the first protocol and the second protocol are different, and the clinical content structure comprises a set of one or more evidence-based options that are selectable by a clinician during patient care; a server configured to display, at the first authoring environment and the second authoring environment, a default clinical content structure; a server configured to receive first modification data from the one or more users of the first authoring environment and second modification data from one or more users of the second authoring environment; a server configured to modify the default clinical content structure based on the first modification data and the second modification data to create a modified clinical content structure; a server configured to store a first plurality of data translation rules associated with the first authoring environment, wherein each data translation rule of the first plurality of data translation rules maps at least one term associated with the first authoring environment to one or more terms of one or more standard term libraries; a server configured to store a second plurality of data translation rules associated with the second authoring environment, wherein each data translation rule of the second plurality of data translation rules maps at least one term associated with the second authoring environment to one or more terms of the one or more standard term libraries; a server configured to automatically translate the modified clinical content structure into a first standard structure using the first plurality of data translation rules; a server configured to automatically translate the modified clinical content structure into a second standard structure using the second plurality of data translation rules; a server configured to convert the first standard structure into a first export structure that comprises an Extensible Markup Language (XML) export format and is executable by the first protocol of the first set of one or more programmed computers; a server configured to convert the second standard structure into a second export structure that comprises an Extensible Markup Language (XML) export format and is executable by the second protocol of the second set of one or more programmed computers; and a server configured to transmit the first export structure to the first set of one or more programmed computers and the second export structure to the second set of one or more programmed computers. | 16. A computer-implemented system for review and export of a clinical content structure, the system comprising: a server configured to provide a first authoring environment that operates on a first set of one or more programmed computers associated with a first protocol and a second authoring environment that operates on a second set of one or more programmed computers associated with a second protocol, wherein the first set of one or more programmed computers and the second set of one or more programmed computers are communicatively coupled to a server via a network, the first protocol and the second protocol are different, and the clinical content structure comprises a set of one or more evidence-based options that are selectable by a clinician during patient care; a server configured to display, at the first authoring environment and the second authoring environment, a default clinical content structure; a server configured to receive first modification data from the one or more users of the first authoring environment and second modification data from one or more users of the second authoring environment; a server configured to modify the default clinical content structure based on the first modification data and the second modification data to create a modified clinical content structure; a server configured to store a first plurality of data translation rules associated with the first authoring environment, wherein each data translation rule of the first plurality of data translation rules maps at least one term associated with the first authoring environment to one or more terms of one or more standard term libraries; a server configured to store a second plurality of data translation rules associated with the second authoring environment, wherein each data translation rule of the second plurality of data translation rules maps at least one term associated with the second authoring environment to one or more terms of the one or more standard term libraries; a server configured to automatically translate the modified clinical content structure into a first standard structure using the first plurality of data translation rules; a server configured to automatically translate the modified clinical content structure into a second standard structure using the second plurality of data translation rules; a server configured to convert the first standard structure into a first export structure that comprises an Extensible Markup Language (XML) export format and is executable by the first protocol of the first set of one or more programmed computers; a server configured to convert the second standard structure into a second export structure that comprises an Extensible Markup Language (XML) export format and is executable by the second protocol of the second set of one or more programmed computers; and a server configured to transmit the first export structure to the first set of one or more programmed computers and the second export structure to the second set of one or more programmed computers. 20. The computer-implemented system of claim 16 wherein the first authoring environment and the second authoring environment comprise a content editor. | 0.522152 |
9,275,155 | 1 | 13 | 1. A system comprising: a processing apparatus comprising one or more computer processors; a storage apparatus comprising computer memory and storing: a search engine index including searchable content for a plurality of documents, wherein each document is associated with a unique identifier, with a table, and with a join key based upon which the document can be associated with other documents having an identical join key, a join mapping that maps between documents and join keys for a join field, and a bitset index that maps ordinal locations in a join bitset to join keys for a join field; and a search engine operating on the one or more processors, wherein the search engine is configured to execute queries against the search engine index, wherein the processing apparatus is configured to: receive a composite join query comprising a specification of a user query, a specification of a root table, a specification of a join table, and a specification of a join field, wherein the specification of the user query comprises one or more Boolean operations applied to one or more unitary queries; for each of the unitary queries, execute the unitary query against the search engine index using the search engine, filter results of the execution of the unitary query for documents contained in at least one of the root table and the join table, and identify join keys from the join field that correspond to the filtered results by setting bits in a join bitset according to the bitset index; for each of the Boolean operations, apply the Boolean operation according to the user query to one or more join bitsets, wherein the one or more join bitsets are obtained from executed unitary queries, from other applied Boolean operations or from both, to create a join bitset, until all of the one or more Boolean operations have beenapplied; store the join bitset created from an application of a last one of the one or more Boolean operations; retrieve a set of documents from the root table; filter the set of documents from the root table to obtain a set of documents having join keys that match join keys identified by the stored join bitset; and provide the filtered set of documents as a result for the composite join query. | 1. A system comprising: a processing apparatus comprising one or more computer processors; a storage apparatus comprising computer memory and storing: a search engine index including searchable content for a plurality of documents, wherein each document is associated with a unique identifier, with a table, and with a join key based upon which the document can be associated with other documents having an identical join key, a join mapping that maps between documents and join keys for a join field, and a bitset index that maps ordinal locations in a join bitset to join keys for a join field; and a search engine operating on the one or more processors, wherein the search engine is configured to execute queries against the search engine index, wherein the processing apparatus is configured to: receive a composite join query comprising a specification of a user query, a specification of a root table, a specification of a join table, and a specification of a join field, wherein the specification of the user query comprises one or more Boolean operations applied to one or more unitary queries; for each of the unitary queries, execute the unitary query against the search engine index using the search engine, filter results of the execution of the unitary query for documents contained in at least one of the root table and the join table, and identify join keys from the join field that correspond to the filtered results by setting bits in a join bitset according to the bitset index; for each of the Boolean operations, apply the Boolean operation according to the user query to one or more join bitsets, wherein the one or more join bitsets are obtained from executed unitary queries, from other applied Boolean operations or from both, to create a join bitset, until all of the one or more Boolean operations have beenapplied; store the join bitset created from an application of a last one of the one or more Boolean operations; retrieve a set of documents from the root table; filter the set of documents from the root table to obtain a set of documents having join keys that match join keys identified by the stored join bitset; and provide the filtered set of documents as a result for the composite join query. 13. The system of claim 1 , wherein the specification of the root table and the specification of the join table are separate from the specification of the user query in the composite join query. | 0.83218 |
8,078,557 | 1 | 9 | 1. A system for identifying keywords in search results comprising: a processor; a memory coupled to the processor, wherein the memory includes instructions that when executed by the processor perform operations comprising: connecting a plurality of neurons as a bidirectional neural network, the neurons being associated with words and documents, the neurons associated with words forming a first layer, and the neurons associated with documents forming a second layer, each neuron having multiple inputs from other neurons, a single output connecting the neuron to other neurons, and a threshold function at the single output, wherein at least some of the neurons of the first layer have connections between them and represent keywords in the documents; displaying to a user, on a display device, words of the search query and additional keywords from the documents and identifying the neurons that correspond to keywords associated with at least one of the documents; and changing positions of the keywords on a display relative to each other based on input from the user, wherein the change in position of one keyword changes the position of other displayed keywords. | 1. A system for identifying keywords in search results comprising: a processor; a memory coupled to the processor, wherein the memory includes instructions that when executed by the processor perform operations comprising: connecting a plurality of neurons as a bidirectional neural network, the neurons being associated with words and documents, the neurons associated with words forming a first layer, and the neurons associated with documents forming a second layer, each neuron having multiple inputs from other neurons, a single output connecting the neuron to other neurons, and a threshold function at the single output, wherein at least some of the neurons of the first layer have connections between them and represent keywords in the documents; displaying to a user, on a display device, words of the search query and additional keywords from the documents and identifying the neurons that correspond to keywords associated with at least one of the documents; and changing positions of the keywords on a display relative to each other based on input from the user, wherein the change in position of one keyword changes the position of other displayed keywords. 9. The system of claim 1 , wherein the user can inhibit neurons of the neural network by indicating irrelevance of a selected keyword. | 0.720833 |
7,970,648 | 16 | 18 | 16. A method for managing the creation of business listings in a communication network, comprising: providing location-based services over a publically accessible unsecured network with a location-based services system; storing user specific information of a plurality of consumer subscribers that are subscribed to said location-based services system as patrons, and a plurality of business subscribers that are subscribed to said location-based services system as business listing customers of said location-based services system, said user specific information of said consumer subscribers comprising a location-based services information access history of each of said consumer subscribers; said location-based services system transmitting a business listing entry form over said publically accessible unsecured network for receipt by a business remote terminal of one of said business subscribers; receiving over said publically accessible unsecured network business listing data comprising a description of products or services of said one of said business subscribers, a business name of a business owned by said one of said business subscribers, a geographic location of said business, and conditions for transmitting said business listing data to said consumer subscribers comprising a geographic targeting restriction, and a historical consumer subscriber access restriction, said business listing data and said conditions entered into said business listing entry form using said business remote terminal by said one of said business subscribers; creating a business listing with said location based services system based on said business listing data, said business listing descriptive of said products or services of said one of said business subscribers; storing said business listing in a business profile database included in said location-based services system, said business listing stored in association with said user specific information of said business subscriber; said location-based services system receiving over said publically accessible unsecured network a request for information for goods or services from a wireless consumer remote terminal of a consumer subscriber, and a remote terminal identifier of said wireless consumer remote terminal; said location-based services system determining a current geographic location of said wireless consumer remote terminal in response to receipt of said request for information for goods or services, said location-based services system determining, in response to receipt of said request for information for goods or services and said remote terminal identifier, if said consumer subscriber meets said historical consumer subscriber access restriction based on said stored location-based services information access history of said consumer subscriber; and said location-based services system transmitting a geographically targeted response responsive to said request, said geographically targeted response comprising information extracted from said business listing of said one of said business subscribers having goods or services responsive to said request, said geographically targeted response transmitted by said location-based services system in response to said one of said consumer subscribers from which said request is received being determined by said location-based services system to meet said historical consumer subscriber access restriction, and said determined current geographic location of said wireless consumer remote terminal being within said geographic targeting restriction. | 16. A method for managing the creation of business listings in a communication network, comprising: providing location-based services over a publically accessible unsecured network with a location-based services system; storing user specific information of a plurality of consumer subscribers that are subscribed to said location-based services system as patrons, and a plurality of business subscribers that are subscribed to said location-based services system as business listing customers of said location-based services system, said user specific information of said consumer subscribers comprising a location-based services information access history of each of said consumer subscribers; said location-based services system transmitting a business listing entry form over said publically accessible unsecured network for receipt by a business remote terminal of one of said business subscribers; receiving over said publically accessible unsecured network business listing data comprising a description of products or services of said one of said business subscribers, a business name of a business owned by said one of said business subscribers, a geographic location of said business, and conditions for transmitting said business listing data to said consumer subscribers comprising a geographic targeting restriction, and a historical consumer subscriber access restriction, said business listing data and said conditions entered into said business listing entry form using said business remote terminal by said one of said business subscribers; creating a business listing with said location based services system based on said business listing data, said business listing descriptive of said products or services of said one of said business subscribers; storing said business listing in a business profile database included in said location-based services system, said business listing stored in association with said user specific information of said business subscriber; said location-based services system receiving over said publically accessible unsecured network a request for information for goods or services from a wireless consumer remote terminal of a consumer subscriber, and a remote terminal identifier of said wireless consumer remote terminal; said location-based services system determining a current geographic location of said wireless consumer remote terminal in response to receipt of said request for information for goods or services, said location-based services system determining, in response to receipt of said request for information for goods or services and said remote terminal identifier, if said consumer subscriber meets said historical consumer subscriber access restriction based on said stored location-based services information access history of said consumer subscriber; and said location-based services system transmitting a geographically targeted response responsive to said request, said geographically targeted response comprising information extracted from said business listing of said one of said business subscribers having goods or services responsive to said request, said geographically targeted response transmitted by said location-based services system in response to said one of said consumer subscribers from which said request is received being determined by said location-based services system to meet said historical consumer subscriber access restriction, and said determined current geographic location of said wireless consumer remote terminal being within said geographic targeting restriction. 18. The method of claim 16 , wherein said business listing data further comprises a business category of said one of said business subscribers, a product type of said one of said business subscribers, a service type of said one of said business subscribers, a business URL of said one of said business subscribers, and an operating hours indication of said one of said business subscribers. | 0.528986 |
10,043,022 | 19 | 20 | 19. The computer implemented method of claim 18 , wherein the step of causing the non-transitory programmable device to undertake the step of deriving the sixth data includes the step of causing the non-transitory programmable device to undertake the step of deriving the sixth data in response to receipt of a further user request. | 19. The computer implemented method of claim 18 , wherein the step of causing the non-transitory programmable device to undertake the step of deriving the sixth data includes the step of causing the non-transitory programmable device to undertake the step of deriving the sixth data in response to receipt of a further user request. 20. The computer implemented method of claim 19 , wherein the third data includes a first numeric value, the fifth data includes a second numeric value, and the step of causing the non-transitory programmable device to undertake the step of deriving the sixth value includes the step of causing the non-transitory programmable device to sum the first numeric value and the second numeric value. | 0.5 |
7,890,762 | 15 | 21 | 15. A data processing system that is configured to provide input to a workflow application, comprising: a digitizer that is configured to receive a source document having an original signature but no digital signature, and that is configured to generate a digital representation of the source document, wherein the source document comprises a paper document, and wherein the digital representation of the source document includes the original signature represented digitally but no digital signature; a user interface that is configured to receive, from a user, a correspondence of the digital representation to the source document; and a digital signature generator that is configured to sign, in response to receiving the correspondence, the digital representation with a differentiated proxy digital signature, wherein the differentiated proxy digital signature stands for the correspondence of the digital representation to the source document and to a presence of the original signature on the source document, wherein the differentiated proxy digital signature does not stand for an authenticity and an integrity of the source document, wherein the differentiated proxy digital signature is annotated with metadata indicating the quality of the original signature, and wherein the differentiated proxy digital signature indicates the digital representation corresponds to the source document, and further indicates the original signature is actually present on the source document. | 15. A data processing system that is configured to provide input to a workflow application, comprising: a digitizer that is configured to receive a source document having an original signature but no digital signature, and that is configured to generate a digital representation of the source document, wherein the source document comprises a paper document, and wherein the digital representation of the source document includes the original signature represented digitally but no digital signature; a user interface that is configured to receive, from a user, a correspondence of the digital representation to the source document; and a digital signature generator that is configured to sign, in response to receiving the correspondence, the digital representation with a differentiated proxy digital signature, wherein the differentiated proxy digital signature stands for the correspondence of the digital representation to the source document and to a presence of the original signature on the source document, wherein the differentiated proxy digital signature does not stand for an authenticity and an integrity of the source document, wherein the differentiated proxy digital signature is annotated with metadata indicating the quality of the original signature, and wherein the differentiated proxy digital signature indicates the digital representation corresponds to the source document, and further indicates the original signature is actually present on the source document. 21. The data processing system of claim 15 , further comprising: an interface to the workflow application that is configured to provide the digital representation signed with the differentiated proxy digital signature and the metadata to the workflow application as input documents. | 0.533113 |
8,412,735 | 14 | 15 | 14. The method of claim 9 , wherein said predetermined expectation comprises an estimate of how many different data points a candidate conditional functional dependency would apply to. | 14. The method of claim 9 , wherein said predetermined expectation comprises an estimate of how many different data points a candidate conditional functional dependency would apply to. 15. The method of claim 14 , wherein said predetermined expectation further comprises an error estimate of how many different data points would fail a candidate conditional functional dependency. | 0.5 |
7,761,287 | 19 | 20 | 19. The computer-readable medium of claim 16 including providing an opinion data store that specifies sequences of parts of speech that may express an opinion, a probability that each sequence contains a word that may express an opinion, and a probability that each word expresses an opinion. | 19. The computer-readable medium of claim 16 including providing an opinion data store that specifies sequences of parts of speech that may express an opinion, a probability that each sequence contains a word that may express an opinion, and a probability that each word expresses an opinion. 20. The computer-readable medium of claim 19 wherein the opinion data store is generated by identifying from training data sequences of parts of speech that may express an opinion, calculating from the training data a probability that each sequence contains a word that may express an opinion, and calculating from the training data a probability that each word expresses an opinion. | 0.5 |
9,697,822 | 1 | 8 | 1. A machine-implemented method, comprising: determining that a first user of a first mobile communication device is engaged in a call over a communications network; providing an adaptive speech recognition model comprising a speaker-dependent speech recognition model; after providing the adaptive speech recognition model, analyzing an outbound audio channel of a baseband unit of the first mobile communication device to obtain a call audio signal corresponding to audio input from one or more microphones of the first mobile communication device; and updating the adaptive speech recognition model with training data derived from the call audio signal. | 1. A machine-implemented method, comprising: determining that a first user of a first mobile communication device is engaged in a call over a communications network; providing an adaptive speech recognition model comprising a speaker-dependent speech recognition model; after providing the adaptive speech recognition model, analyzing an outbound audio channel of a baseband unit of the first mobile communication device to obtain a call audio signal corresponding to audio input from one or more microphones of the first mobile communication device; and updating the adaptive speech recognition model with training data derived from the call audio signal. 8. The method of claim 1 , wherein the training data derived from the call audio signal includes one or more speaker-dependent sound units; and updating the adaptive speech recognition model comprises: comparing at least a subset of the one or more speaker-dependent sound units to the adaptive speech recognition model; generating one or more adaptive speech vectors based on the comparison; and modifying the adaptive speech recognition model based on at least a subset of the one or more adaptive speech vectors. | 0.565767 |
7,617,511 | 3 | 6 | 3. The method as recited in claim 1 , wherein entering a preference rating comprises entering a numerical value to be associated with the program attribute value, the numerical value indicating the degree of like or dislike of the program attribute value. | 3. The method as recited in claim 1 , wherein entering a preference rating comprises entering a numerical value to be associated with the program attribute value, the numerical value indicating the degree of like or dislike of the program attribute value. 6. The method as recited in claim 3 , wherein the numerical value is a numerical value in a range from one to ten. | 0.688525 |
9,165,084 | 6 | 9 | 6. A wireless communication device comprising: a communication interface to communicate with a web site via an established communication link; a processing circuit configured to: establish the communication link between the communication interface and a network server hosting the web site; automatically detect whether the web site provides a search engine based on data received from the web site; and configure a browser application executing on the wireless communication device to perform a search using the detected search engine; a user interface to display the results of the search; and wherein the processing circuit is configured to automatically detect whether the data received from the web site includes an embedded indicator, and wherein the embedded indicator comprises meta data received from the web site via the established communication link, and identifies a file that defines the search capabilities of the detected search engine. | 6. A wireless communication device comprising: a communication interface to communicate with a web site via an established communication link; a processing circuit configured to: establish the communication link between the communication interface and a network server hosting the web site; automatically detect whether the web site provides a search engine based on data received from the web site; and configure a browser application executing on the wireless communication device to perform a search using the detected search engine; a user interface to display the results of the search; and wherein the processing circuit is configured to automatically detect whether the data received from the web site includes an embedded indicator, and wherein the embedded indicator comprises meta data received from the web site via the established communication link, and identifies a file that defines the search capabilities of the detected search engine. 9. The device of claim 6 further comprising memory, and wherein the processing circuit is configured to store a search capability file for each web site visited by the user that provides a search engine. | 0.715686 |
9,679,263 | 5 | 8 | 5. At least one non-transitory computer-readable storage medium storing computer-executable code that, when executed by one or more processors, perform a method of executing search requests, the method comprising: receiving from a user a search request for travel reservation information, the search request including at least one first constraint to be met by results returned by a search; selecting at least one additional constraint not included in the search request; constructing a first query based on the at least one first constraint and the at least one additional constraint such that fewer search results are obtained in response to executing the first query than would be obtained in response to executing a query constructed without the at least one additional constraint; executing the first query to obtain first phase query results; providing the first phase query results for presentation to the user; constructing a second query that includes the at least one first constraint but does not include the at least one additional constraint; executing the second query to obtain second phase query results; and providing the second phase query results to update the presentation to the user and providing an indication to the user that the second phase query results are available; wherein the providing an indication to the user comprises presenting to the user a summary of the second phase query results without presenting the second phase query results. | 5. At least one non-transitory computer-readable storage medium storing computer-executable code that, when executed by one or more processors, perform a method of executing search requests, the method comprising: receiving from a user a search request for travel reservation information, the search request including at least one first constraint to be met by results returned by a search; selecting at least one additional constraint not included in the search request; constructing a first query based on the at least one first constraint and the at least one additional constraint such that fewer search results are obtained in response to executing the first query than would be obtained in response to executing a query constructed without the at least one additional constraint; executing the first query to obtain first phase query results; providing the first phase query results for presentation to the user; constructing a second query that includes the at least one first constraint but does not include the at least one additional constraint; executing the second query to obtain second phase query results; and providing the second phase query results to update the presentation to the user and providing an indication to the user that the second phase query results are available; wherein the providing an indication to the user comprises presenting to the user a summary of the second phase query results without presenting the second phase query results. 8. The at least one non-transitory computer-readable storage medium of claim 5 , further comprising presenting the second phase query results to the user responsive to the user requesting to view the second phase query results. | 0.5 |
9,858,358 | 14 | 16 | 14. A non-transitory computer storage medium encoded with a computer program, the program comprising instructions that when executed by a data processing apparatus cause the data processing apparatus to perform operations comprising: receiving, during a current search session for a user device, a set of queries; identifying, as similar search sessions, multiple previous user search sessions based on a query path that the current search session shares with the similar search sessions, each similar search session including at least a threshold percentage of search queries that match search queries in the set of queries of the current search session; identifying, as concluding search queries, each search query that concluded at least one of the similar search sessions by being a final search query received during the at least one similar search session; determining, for each concluding search query, a popularity of the concluding search query based on a total number of the similar search sessions that the concluding search query concluded; selecting, from the concluding search queries and as a most popular query modification, a given concluding search query in response to (i) the popularity of the given search query being greater than the popularity of each other concluding search query and (ii) the popularity of the given concluding search query being greater than a suggestion threshold; and providing, to the user device, query suggestion data that initiates presentation of the given search query as the most popular query modification associated with the current search session at the user device. | 14. A non-transitory computer storage medium encoded with a computer program, the program comprising instructions that when executed by a data processing apparatus cause the data processing apparatus to perform operations comprising: receiving, during a current search session for a user device, a set of queries; identifying, as similar search sessions, multiple previous user search sessions based on a query path that the current search session shares with the similar search sessions, each similar search session including at least a threshold percentage of search queries that match search queries in the set of queries of the current search session; identifying, as concluding search queries, each search query that concluded at least one of the similar search sessions by being a final search query received during the at least one similar search session; determining, for each concluding search query, a popularity of the concluding search query based on a total number of the similar search sessions that the concluding search query concluded; selecting, from the concluding search queries and as a most popular query modification, a given concluding search query in response to (i) the popularity of the given search query being greater than the popularity of each other concluding search query and (ii) the popularity of the given concluding search query being greater than a suggestion threshold; and providing, to the user device, query suggestion data that initiates presentation of the given search query as the most popular query modification associated with the current search session at the user device. 16. The non-transitory computer storage medium of claim 14 , wherein the similar search sessions are identified from a set of previous search sessions for multiple different users. | 0.860465 |
7,640,158 | 19 | 20 | 19. The computer program product of claim 15 , wherein (A) comprises: (A)(1) comparing documents in the original document corpus to corresponding documents in the edited document corpus to identify differences between them, the differences comprising at least one word that appears in the original document corpus in a particular context C 0 and that does not appear in the edited document corpus in the context C 0 ; and (A)(2) generating the plurality of editing patterns to reflect the identified differences between the documents in the original document corpus and the documents in the edited document corpus. | 19. The computer program product of claim 15 , wherein (A) comprises: (A)(1) comparing documents in the original document corpus to corresponding documents in the edited document corpus to identify differences between them, the differences comprising at least one word that appears in the original document corpus in a particular context C 0 and that does not appear in the edited document corpus in the context C 0 ; and (A)(2) generating the plurality of editing patterns to reflect the identified differences between the documents in the original document corpus and the documents in the edited document corpus. 20. The computer program product of claim 19 , wherein (A)(1) comprises: (A)(1)(a) aligning a first document in the original document corpus and a corresponding document in the edited document corpus; and (A)(1)(b) identifying the differences between the original document corpus and the edited document corpus based on the alignment. | 0.5 |
10,050,918 | 1 | 5 | 1. A method for creating at least one new thread associated with an online conversation, the method comprising: determining if a predetermined time period has elapsed; in response to determining the predetermined time period has elapsed, monitoring the online conversation to detect a new or updated element of the online conversation; extracting the detected new or updated element; analyzing the online conversation and the extracted detected new or updated element to determine if a new online conversation has started; extracting a plurality of members associated with the online conversation based on the determination that a new online conversation has started; extracting a plurality of content associated with the extracted detected new or updated element based on the determination that a new online conversation has started; prompting a user to determine if a new online conversation should be created, wherein the user created the extracted detected new or updated element; creating the new online conversation based on the user determining that the new conversation should be created; in response to creating the new online conversation and in response to the user triggering an interface gesture to start the new online conversation, creating a user profile for the user; notifying the plurality of extracted members about the created new online conversation; suggesting a plurality of new participants to the user; prompting the user to select a plurality of required and optional members from the notified plurality of extracted members and the suggested plurality of new participants to participate in the created new online conversation; and enabling the added plurality of required and optional members to participate in the created new online conversation. | 1. A method for creating at least one new thread associated with an online conversation, the method comprising: determining if a predetermined time period has elapsed; in response to determining the predetermined time period has elapsed, monitoring the online conversation to detect a new or updated element of the online conversation; extracting the detected new or updated element; analyzing the online conversation and the extracted detected new or updated element to determine if a new online conversation has started; extracting a plurality of members associated with the online conversation based on the determination that a new online conversation has started; extracting a plurality of content associated with the extracted detected new or updated element based on the determination that a new online conversation has started; prompting a user to determine if a new online conversation should be created, wherein the user created the extracted detected new or updated element; creating the new online conversation based on the user determining that the new conversation should be created; in response to creating the new online conversation and in response to the user triggering an interface gesture to start the new online conversation, creating a user profile for the user; notifying the plurality of extracted members about the created new online conversation; suggesting a plurality of new participants to the user; prompting the user to select a plurality of required and optional members from the notified plurality of extracted members and the suggested plurality of new participants to participate in the created new online conversation; and enabling the added plurality of required and optional members to participate in the created new online conversation. 5. The method of claim 1 , wherein creating the new online conversation comprises adding at least one link to the online conversation at a point which the online conversation diverged. | 0.65019 |
6,073,099 | 4 | 5 | 4. The method of claim 1, wherein the step of obtaining the phonemic transformation weights includes the substep of determining the phonemic transformation weight of a transformation between two phonemes based on Hidden Markov Models of the phonemes. | 4. The method of claim 1, wherein the step of obtaining the phonemic transformation weights includes the substep of determining the phonemic transformation weight of a transformation between two phonemes based on Hidden Markov Models of the phonemes. 5. The method of claim 4, wherein the phonemic transformation weights obtained in the substep of determining the phonemic transformation weight of the transformation between two phonemes is calculated using the equation: ##EQU6## where n represents the number of states used to model a phoneme, v.sub.i is a heuristically set weight for each said state used to model the phoneme, and H(x.sub.i, y.sub.i) represents relative entropy between probability mixtures of a state I of phoneme x and a state I of phoneme y. | 0.5 |
9,485,211 | 1 | 10 | 1. A social networking website system that supports user interactions in a plurality of social networks, the social networking website system comprising: a server enabling a user to participate in a plurality of social networks based on a current location information; the server monitoring the current location information of the user, and, based on changes to the current location, adjusting the user's membership to, or participation in, the social networks and social groups; the server automatically enabling communication among a plurality of mobile devices used by a corresponding plurality of users via the plurality of social networks, each of the plurality of mobile devices identifies a corresponding current location information based on GPS coordinates; and the server automatically, without employing invitations and explicit user acceptance, automatically registering and including a first user among the plurality of users in a new social network based on GPS coordinates of the current location of the first user's mobile device among the plurality of mobile devices; wherein a current location to social networks mapping is employed to determine appropriate social networks and associated social groups for the first user based on the current location. | 1. A social networking website system that supports user interactions in a plurality of social networks, the social networking website system comprising: a server enabling a user to participate in a plurality of social networks based on a current location information; the server monitoring the current location information of the user, and, based on changes to the current location, adjusting the user's membership to, or participation in, the social networks and social groups; the server automatically enabling communication among a plurality of mobile devices used by a corresponding plurality of users via the plurality of social networks, each of the plurality of mobile devices identifies a corresponding current location information based on GPS coordinates; and the server automatically, without employing invitations and explicit user acceptance, automatically registering and including a first user among the plurality of users in a new social network based on GPS coordinates of the current location of the first user's mobile device among the plurality of mobile devices; wherein a current location to social networks mapping is employed to determine appropriate social networks and associated social groups for the first user based on the current location. 10. The social networking website system of claim 1 wherein the plurality of social groups to which a user is automatically included based on the current location also comprise, as members, agents of local banks that lends funds, agents of local insurance companies, local experts, local meteorologists, local service providers, and local contract labor. | 0.549618 |
9,742,753 | 8 | 17 | 8. A computer implemented multimedia method of capturing, storing, retrieving and disseminating personal and/or group legacy and history information comprising the steps of: a. providing a secure computer technology-based software platform for access by one or more authorized users over a computer network using one or more multimedia computer devices, the one or more computer devices capable of recording content in audio, video, photographic, and/or text format and/or combinations thereof; b. providing a graphical user interface for use by the one or more users with the one or more multimedia computer devices for interfacing with the platform over the network; c. interfacing the one or more computer devices with the platform; d. providing the ability within the platform for the one or more users to record new multimedia content from the one or more computer devices; e. providing the ability within the platform for the one or more users to access previously existing multimedia content available to the one or more computer devices; f. providing the ability for the one or more users to review or play back the new or previously existing content from the one or more computer devices from within the platform; g. providing the ability for the one or more users to edit the new or previously existing content from the one or more computer devices from within the platform; h. providing the ability for the one or more users to delete the new or previously existing content from the one or more computer devices; i. providing a platform server or platform cloud-based storage system for use by the one or more users for storing the recorded content within the platform; j. storing the recorded content onto the platform server or platform cloud-based storage; and k. providing the one or more users with the ability to retrieve the stored content from the platform server or platform cloud-based storage; wherein said graphical user interface further comprises a log-in process module for accessing a secure computer technology-based software platform for use by one or more authorized users over a computer network using one or more multimedia computer devices, the one or more computer devices capable of recording content in audio, video, photographic, and/or text format and/or combinations thereof; an auto question prompt module for prompting the user with a series of questions, one or more visual content images, audio files, music files, and/or one or more visual content videos stored within the system pertaining to topics of interest to prompt the user to provide answers to such questions to form part of the content; a tell a story process module for creating a recorded audio visual story capable of being played back by the one or more users by permitting the one or more users to access previously existing multimedia content available to the one or more computer devices, to review the new or previously existing content from the one or more computer devices from within the platform, to edit the new or previously existing content from the one or more computer devices from within the platform, and/or to delete the new or previously existing content from the one or more computer devices; wherein the step of editing the preexisting one or more visual content images and/or one or more visual content videos comprises selecting the desired visual content for display within the audio visual story, recording any desired audio content to accompany any of such selected visual content, such audio content being tied to such respective visual content so that such audio content becomes audible when such selected visual content is displayed during the playback of the recorded story; a save a story process module for permitting the one or more users to store the recorded content on the one or more computer devices, a platform server or a platform cloud-based storage system; and a share a story process module for permitting the one or more users to share the recorded content with others. | 8. A computer implemented multimedia method of capturing, storing, retrieving and disseminating personal and/or group legacy and history information comprising the steps of: a. providing a secure computer technology-based software platform for access by one or more authorized users over a computer network using one or more multimedia computer devices, the one or more computer devices capable of recording content in audio, video, photographic, and/or text format and/or combinations thereof; b. providing a graphical user interface for use by the one or more users with the one or more multimedia computer devices for interfacing with the platform over the network; c. interfacing the one or more computer devices with the platform; d. providing the ability within the platform for the one or more users to record new multimedia content from the one or more computer devices; e. providing the ability within the platform for the one or more users to access previously existing multimedia content available to the one or more computer devices; f. providing the ability for the one or more users to review or play back the new or previously existing content from the one or more computer devices from within the platform; g. providing the ability for the one or more users to edit the new or previously existing content from the one or more computer devices from within the platform; h. providing the ability for the one or more users to delete the new or previously existing content from the one or more computer devices; i. providing a platform server or platform cloud-based storage system for use by the one or more users for storing the recorded content within the platform; j. storing the recorded content onto the platform server or platform cloud-based storage; and k. providing the one or more users with the ability to retrieve the stored content from the platform server or platform cloud-based storage; wherein said graphical user interface further comprises a log-in process module for accessing a secure computer technology-based software platform for use by one or more authorized users over a computer network using one or more multimedia computer devices, the one or more computer devices capable of recording content in audio, video, photographic, and/or text format and/or combinations thereof; an auto question prompt module for prompting the user with a series of questions, one or more visual content images, audio files, music files, and/or one or more visual content videos stored within the system pertaining to topics of interest to prompt the user to provide answers to such questions to form part of the content; a tell a story process module for creating a recorded audio visual story capable of being played back by the one or more users by permitting the one or more users to access previously existing multimedia content available to the one or more computer devices, to review the new or previously existing content from the one or more computer devices from within the platform, to edit the new or previously existing content from the one or more computer devices from within the platform, and/or to delete the new or previously existing content from the one or more computer devices; wherein the step of editing the preexisting one or more visual content images and/or one or more visual content videos comprises selecting the desired visual content for display within the audio visual story, recording any desired audio content to accompany any of such selected visual content, such audio content being tied to such respective visual content so that such audio content becomes audible when such selected visual content is displayed during the playback of the recorded story; a save a story process module for permitting the one or more users to store the recorded content on the one or more computer devices, a platform server or a platform cloud-based storage system; and a share a story process module for permitting the one or more users to share the recorded content with others. 17. The method of claim 8 further comprising the step of providing audio/video-to-text transcription of such recorded content. | 0.792079 |
9,218,804 | 8 | 12 | 8. A system comprising: a processor; and a computer-readable medium having instructions which, when executed by the processor, cause the processor to perform operations comprising: identifying a speech synthesis context; determining, based on a local cache of text-to-speech units for a text-to-speech voice and based on the speech synthesis context, additional text-to-speech units which are not in the local cache; requesting from a server the additional text-to-speech units; storing the additional text-to-speech units in the local cache; and synthesizing speech using the text-to-speech units and the additional text-to-speech units in the local cache. | 8. A system comprising: a processor; and a computer-readable medium having instructions which, when executed by the processor, cause the processor to perform operations comprising: identifying a speech synthesis context; determining, based on a local cache of text-to-speech units for a text-to-speech voice and based on the speech synthesis context, additional text-to-speech units which are not in the local cache; requesting from a server the additional text-to-speech units; storing the additional text-to-speech units in the local cache; and synthesizing speech using the text-to-speech units and the additional text-to-speech units in the local cache. 12. The system of claim 8 , wherein the computer-readable medium stores further instructions which result in further operations comprising: determining parameters relating to speech synthesis; and determining, based on the parameters, how many additional text-to-speech units to request. | 0.701042 |
8,539,365 | 10 | 16 | 10. A non-transitory computer readable storage medium comprising computer executable instructions for operating a communications device, the computer executable instructions comprising instructions for: maintaining a first list of at least one instant messaging conversation in a graphical user interface for engaging in a plurality of instant messaging conversations; monitoring conversation activity for the instant messaging conversations in the first list; automatically removing a particular instant messaging conversation from the first list after an idle period of conversation activity and only if all messages of the particular conversation have been read; archiving the particular instant messaging conversation to an instant messaging conversation archive for making the particular instant messaging conversation accessible via the graphical user interface; providing a second list of at least one archived instant messaging conversation in said graphical user interface separate from said first list for accessing archived conversations of the instant messaging conversation archive; and removing at least one instant messaging conversation from the second list. | 10. A non-transitory computer readable storage medium comprising computer executable instructions for operating a communications device, the computer executable instructions comprising instructions for: maintaining a first list of at least one instant messaging conversation in a graphical user interface for engaging in a plurality of instant messaging conversations; monitoring conversation activity for the instant messaging conversations in the first list; automatically removing a particular instant messaging conversation from the first list after an idle period of conversation activity and only if all messages of the particular conversation have been read; archiving the particular instant messaging conversation to an instant messaging conversation archive for making the particular instant messaging conversation accessible via the graphical user interface; providing a second list of at least one archived instant messaging conversation in said graphical user interface separate from said first list for accessing archived conversations of the instant messaging conversation archive; and removing at least one instant messaging conversation from the second list. 16. The non-transitory computer readable storage medium of claim 10 , further comprising instructions for enabling all or one or more portions of the archived IM conversations to be saved to a persistent store. | 0.50237 |
6,122,628 | 51 | 63 | 51. A computer program product comprising: a computer usable medium having computer readable program code means embodied therein for representing multidimensional data, the computer readable program code means in said computer program product comprising: computer readable program code clustering means for causing a computer to effect (a) partitioning the multidimensional data into one or more clusters; computer readable program code means, coupled to said clustering means, for causing a computer to effect (b) generating and storing clustering information for said one or more clusters; computer readable program code dimensionality reduction means, coupled to said clustering means, for causing a computer to effect, (c) generating one or more reduced dimensionality clusters and dimensionality reduction information for said one or more clusters; computer readable program code means, coupled to said dimensionality reduction means, for causing a computer to (d) effect storing the dimensionality reduction information; computer readable program code means for causing a computer to effect creating a hierarchy of reduced dimensionality clusters by recursively applying said steps a) through d); and computer readable program code means for causing a computer to effect generating and storing one or more low-dimensional indexes for clusters at a lowest level of said hierarchy. | 51. A computer program product comprising: a computer usable medium having computer readable program code means embodied therein for representing multidimensional data, the computer readable program code means in said computer program product comprising: computer readable program code clustering means for causing a computer to effect (a) partitioning the multidimensional data into one or more clusters; computer readable program code means, coupled to said clustering means, for causing a computer to effect (b) generating and storing clustering information for said one or more clusters; computer readable program code dimensionality reduction means, coupled to said clustering means, for causing a computer to effect, (c) generating one or more reduced dimensionality clusters and dimensionality reduction information for said one or more clusters; computer readable program code means, coupled to said dimensionality reduction means, for causing a computer to (d) effect storing the dimensionality reduction information; computer readable program code means for causing a computer to effect creating a hierarchy of reduced dimensionality clusters by recursively applying said steps a) through d); and computer readable program code means for causing a computer to effect generating and storing one or more low-dimensional indexes for clusters at a lowest level of said hierarchy. 63. The computer program product of claim 51, for performing an exact search, comprising: means for causing a computer to effect associating specified data to one of the clusters based on stored clustering information; means for causing a computer to effect reducing the dimensionality of the specified data based on stored dimensionality reduction information for a reduced dimensionality version of a cluster, in response to said associating step; and means for causing a computer to effect searching, based on reduced dimensionality specified data, for the reduced dimensionality version of the cluster matching the specified data. | 0.773733 |
8,972,958 | 19 | 26 | 19. An apparatus comprising: one or more computer processors implementing: a compiler adapted to: parse statements of input program code to generate custom instructions for an instruction set loadable upon a reconfigurable processor, wherein a single custom instruction of the instruction set is generated by aggregating the statements of input program code according to one or more constraints that, based upon physical limitations imposed by a framework generator, prevent a terminal conflict resulting from an assumption that, independently of hardware latency requirements of the reconfigurable processor, the single custom instruction may be accomplished in a single clock cycle of the reconfigurable processor; generate a custom instruction description file including the custom instructions; analyze the statements of the input program code to determine capabilities of the reconfigurable processor that are being utilized by the custom instructions, wherein the capabilities of the reconfigurable processor comprise information regarding: access capabilities of the custom instructions; calling capabilities of the custom instructions; and support capabilities of the custom instructions; generate a framework capabilities description file including information regarding capabilities of the reconfigurable processor that are being utilized by the custom instructions; a timing manager configured to: adapt the custom instruction description file for hardware timing of the reconfigurable processor, thereby generating a timing adapted custom instruction description file; and adapt the framework capabilities description file to include information regarding the adapting of the custom instruction description file, thereby generating a timing adapted framework capabilities description file; and at least one memory coupled to the one or more computer processors. | 19. An apparatus comprising: one or more computer processors implementing: a compiler adapted to: parse statements of input program code to generate custom instructions for an instruction set loadable upon a reconfigurable processor, wherein a single custom instruction of the instruction set is generated by aggregating the statements of input program code according to one or more constraints that, based upon physical limitations imposed by a framework generator, prevent a terminal conflict resulting from an assumption that, independently of hardware latency requirements of the reconfigurable processor, the single custom instruction may be accomplished in a single clock cycle of the reconfigurable processor; generate a custom instruction description file including the custom instructions; analyze the statements of the input program code to determine capabilities of the reconfigurable processor that are being utilized by the custom instructions, wherein the capabilities of the reconfigurable processor comprise information regarding: access capabilities of the custom instructions; calling capabilities of the custom instructions; and support capabilities of the custom instructions; generate a framework capabilities description file including information regarding capabilities of the reconfigurable processor that are being utilized by the custom instructions; a timing manager configured to: adapt the custom instruction description file for hardware timing of the reconfigurable processor, thereby generating a timing adapted custom instruction description file; and adapt the framework capabilities description file to include information regarding the adapting of the custom instruction description file, thereby generating a timing adapted framework capabilities description file; and at least one memory coupled to the one or more computer processors. 26. The apparatus of claim 19 , wherein the one or more computer processors further implement: the framework generator, wherein the framework generator is adapted to generate a framework file comprising an executable description of the instruction set using the custom instructions of the timing adapted custom instruction description file and the information regarding capabilities of the reconfigurable processor of the timing adapted framework capabilities description file. | 0.5 |
8,762,969 | 10 | 15 | 10. A parsing method, comprising: employing at least one processor configured to execute computer-executable instructions stored in memory to perform the following acts: parsing an input stream with one or more immutable parser configurations including an immutable stack and immutable lookahead buffer; and producing an immutable parse tree as a function of the parsing. | 10. A parsing method, comprising: employing at least one processor configured to execute computer-executable instructions stored in memory to perform the following acts: parsing an input stream with one or more immutable parser configurations including an immutable stack and immutable lookahead buffer; and producing an immutable parse tree as a function of the parsing. 15. The method of claim 10 further comprising producing different versions of the stack and lookahead buffer that share common unchanged elements. | 0.657277 |
9,424,321 | 1 | 3 | 1. A method comprising: receiving, by at least one data processor, a plurality of data files from a plurality of data sources that comprise textual content; categorizing, by the at least one data processor, the plurality of data files into a taxonomy of categories in which each category has associated sample textual content defining a concept for the category and each category is a run-length encoded collection of at least one identification corresponding to at least one of the plurality of data files, the categorizing comprising, for each category: comparing, by the at least one data processor, for each of the plurality of data files, the textual content of the data file with the sample textual content for the category; calculating, by the at least one data processor, based on the comparing and for each of the plurality of data files, a file score corresponding to the degree of similarity between the defined concept of the category and a determined concept for the data file; and generating, by the at least one data processor, the identification stored in the run-length encoded collection by at least associating, for each of the plurality of data files, the data file with the category if the file score is equal to or greater than a pre-determined minimum score for the category; and providing, by the at least one data processor, at least a portion of the data file and/or the associated file score. | 1. A method comprising: receiving, by at least one data processor, a plurality of data files from a plurality of data sources that comprise textual content; categorizing, by the at least one data processor, the plurality of data files into a taxonomy of categories in which each category has associated sample textual content defining a concept for the category and each category is a run-length encoded collection of at least one identification corresponding to at least one of the plurality of data files, the categorizing comprising, for each category: comparing, by the at least one data processor, for each of the plurality of data files, the textual content of the data file with the sample textual content for the category; calculating, by the at least one data processor, based on the comparing and for each of the plurality of data files, a file score corresponding to the degree of similarity between the defined concept of the category and a determined concept for the data file; and generating, by the at least one data processor, the identification stored in the run-length encoded collection by at least associating, for each of the plurality of data files, the data file with the category if the file score is equal to or greater than a pre-determined minimum score for the category; and providing, by the at least one data processor, at least a portion of the data file and/or the associated file score. 3. The method of claim 1 , wherein the associating is between the data file and only one category, the category being the category generating the highest file score equal to or greater than the minimum score. | 0.849275 |
4,471,459 | 21 | 22 | 21. Means according to claim 16 wherein the first and second compare type indications are formed using a query character in a first character position and a second query character in a second higher valued character position of the query word, the means for processing and utilizing comprising: means for utilizing at least the first compare type indication for forming a first tentative spelling classification indication; and means for utilizing at least the second compare type indication and the first tentative spelling classification indication for forming a second tentative spelling classification indication. | 21. Means according to claim 16 wherein the first and second compare type indications are formed using a query character in a first character position and a second query character in a second higher valued character position of the query word, the means for processing and utilizing comprising: means for utilizing at least the first compare type indication for forming a first tentative spelling classification indication; and means for utilizing at least the second compare type indication and the first tentative spelling classification indication for forming a second tentative spelling classification indication. 22. Means according to claim 21 comprising means for utilizing the second tentative spelling classification indication in forming said spelling classification indication. | 0.5 |
7,822,605 | 24 | 29 | 24. An apparatus for determining whether a speaker uttering a tested utterance belongs to a predetermined set comprising an at least one known speaker, wherein an at least one training utterance is available for each of the at least one known speaker, the apparatus comprising: a feature extraction component for extracting a feature group of the tested utterance or of each of the at least one training utterance; a fast scoring component for scoring a part of the feature group associated with part of the tested utterance against an at least one model for obtaining a fast intermediate score, determining an at least one fast model score using the fast intermediate score, and selecting an at least one probable model associated with a fast intermediate score which is higher than other fast intermediate scores; a frame scoring component for scoring the feature group against an at least one probable model, to obtain an at least one intermediate score; a total model scoring component for determining an at least one model score using the at least one intermediate score; and a maximal score determination component for selecting a maximal score from the at least one model score. | 24. An apparatus for determining whether a speaker uttering a tested utterance belongs to a predetermined set comprising an at least one known speaker, wherein an at least one training utterance is available for each of the at least one known speaker, the apparatus comprising: a feature extraction component for extracting a feature group of the tested utterance or of each of the at least one training utterance; a fast scoring component for scoring a part of the feature group associated with part of the tested utterance against an at least one model for obtaining a fast intermediate score, determining an at least one fast model score using the fast intermediate score, and selecting an at least one probable model associated with a fast intermediate score which is higher than other fast intermediate scores; a frame scoring component for scoring the feature group against an at least one probable model, to obtain an at least one intermediate score; a total model scoring component for determining an at least one model score using the at least one intermediate score; and a maximal score determination component for selecting a maximal score from the at least one model score. 29. The apparatus of claim 24 further comprising a gender detection component for determining whether a speaker in the tested utterance or in the at least one training utterance is a male or a female. | 0.5 |
7,650,286 | 250 | 251 | 250. The computer program product of claim 225 , wherein the job description further includes a required salary range comprising a minimum required salary and a maximum required salary. | 250. The computer program product of claim 225 , wherein the job description further includes a required salary range comprising a minimum required salary and a maximum required salary. 251. The computer program product of claim 250 , wherein the matching resume that satisfies the job description includes an expected salary that falls within the required salary range. | 0.5 |
9,471,705 | 8 | 9 | 8. A system comprising: one or more processors; and a memory coupled by the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to: receive a request from a client device for a target structured document; in response to the received request from the client device and in a first response phase: access a data structure comprising an entry for the target structured document and one or more first resources associated with the target structured document; for each of one or more of the first resources associated with the target structured document: compute a probability for the first resource that represents a likelihood that the first resource will be included in a response to a future request for the target structured document; compare the probability to a first predetermined threshold; and when the probability exceeds the first predetermined threshold, identify the first resource as a selected first resource for the target structured document; generate a first response portion comprising one or more of: one or more of the selected first resources; or one or more references to one or more of the selected first resources; send the first response portion to the client device; and further in response to the received request from the client device and in a second response phase taking place after sending the first response portion: for each of one or more second resources associated with the target structured document: compute a probability for the second resource that represents a likelihood that the second resource will be included in a response to a future request for the target structured document; compare the probability to a second predetermined threshold; and when the probability exceeds the second predetermined threshold, identify the second resource as a selected second resource for the target structured document; generate a second response portion comprising structured document language code for the target structured document and one or more of: one or more of the selected second resources associated with the target structured document; or one or more references to one or more of the selected second resources; and send the second response portion to the same client device. | 8. A system comprising: one or more processors; and a memory coupled by the processors comprising instructions executable by the processors, the processors being operable when executing the instructions to: receive a request from a client device for a target structured document; in response to the received request from the client device and in a first response phase: access a data structure comprising an entry for the target structured document and one or more first resources associated with the target structured document; for each of one or more of the first resources associated with the target structured document: compute a probability for the first resource that represents a likelihood that the first resource will be included in a response to a future request for the target structured document; compare the probability to a first predetermined threshold; and when the probability exceeds the first predetermined threshold, identify the first resource as a selected first resource for the target structured document; generate a first response portion comprising one or more of: one or more of the selected first resources; or one or more references to one or more of the selected first resources; send the first response portion to the client device; and further in response to the received request from the client device and in a second response phase taking place after sending the first response portion: for each of one or more second resources associated with the target structured document: compute a probability for the second resource that represents a likelihood that the second resource will be included in a response to a future request for the target structured document; compare the probability to a second predetermined threshold; and when the probability exceeds the second predetermined threshold, identify the second resource as a selected second resource for the target structured document; generate a second response portion comprising structured document language code for the target structured document and one or more of: one or more of the selected second resources associated with the target structured document; or one or more references to one or more of the selected second resources; and send the second response portion to the same client device. 9. The system of claim 8 , wherein: the target structured document comprises a Hyper Text Markup Language (HTML) document; the HTML document comprises a head element and one or more other HTML elements; the first response portion comprises a first portion of the head element; and the second response portion comprises the remainder of the HTML document including a second portion of the head element. | 0.5 |
4,215,680 | 1 | 7 | 1. A chair for hypnotherapy comprising: a base having front and back portions; a seat mounted to said base and rotatable to frontward and backward positions relative to said base; a back having a lower section mounted to said seat for vertical adjustment relative to said seat; an upper section mounted to said lower section for forward and backward rotation relative to said lower section; a head rest mounted to said upper section for vertical adjustment relative to said upper section and for forward and rearward rotation relative to said upper section; and a control means to provide rearward rotation of said head rest relative to said upper section, rearward rotation of said upper section relative to said lower section, rearward rotation of said seat relative to said base, and abrupt forward restoration of the rearwardly rotated parts of said chair to an upright position; whereby a patient seated in said chair is subjected to tensioned positions during rearward rotation of said parts of said chair and to a relaxed position upon abrupt restoration of said chair to an upright position. | 1. A chair for hypnotherapy comprising: a base having front and back portions; a seat mounted to said base and rotatable to frontward and backward positions relative to said base; a back having a lower section mounted to said seat for vertical adjustment relative to said seat; an upper section mounted to said lower section for forward and backward rotation relative to said lower section; a head rest mounted to said upper section for vertical adjustment relative to said upper section and for forward and rearward rotation relative to said upper section; and a control means to provide rearward rotation of said head rest relative to said upper section, rearward rotation of said upper section relative to said lower section, rearward rotation of said seat relative to said base, and abrupt forward restoration of the rearwardly rotated parts of said chair to an upright position; whereby a patient seated in said chair is subjected to tensioned positions during rearward rotation of said parts of said chair and to a relaxed position upon abrupt restoration of said chair to an upright position. 7. The chair of claim 1, further including means for repeatedly giving mechanical stimuli to the nape of a person seated in said chair. | 0.543919 |
8,125,669 | 3 | 5 | 3. The method of claim 2 , wherein spoofing scenarios as to an Internet browser are examined. | 3. The method of claim 2 , wherein spoofing scenarios as to an Internet browser are examined. 5. The method of claim 3 wherein the spoofing scenario includes non-markup language navigation. | 0.568182 |
10,019,983 | 14 | 15 | 14. The system of claim 10 , wherein the at least one feature vector is determined comprising: a. converting the input into a sequence of phonemes; and b. performing morphological analysis of words in a language. | 14. The system of claim 10 , wherein the at least one feature vector is determined comprising: a. converting the input into a sequence of phonemes; and b. performing morphological analysis of words in a language. 15. The system of claim 14 , wherein the converting is performed using statistics for phonemes and phoneme confusion matrix. | 0.5 |
9,767,409 | 13 | 15 | 13. The computer-implemented method of claim 7 , wherein an item identifier included in the item of identifiers comprises a nonword string of alphanumeric characters that uniquely identify an item within the system. | 13. The computer-implemented method of claim 7 , wherein an item identifier included in the item of identifiers comprises a nonword string of alphanumeric characters that uniquely identify an item within the system. 15. The non-transitory computer readable medium of claim 13 , wherein the model comprises a recurrent neural network language model. | 0.86747 |
7,936,472 | 1 | 9 | 1. A method of processing by a host comprising: receiving, by the host, an image-only PDF document comprising at least one embedded portable document format (PDF) image with an embedded PDF image format, wherein the image-only PDF document is directed to an imaging device; determining, by the host, a set of capabilities associated with the imaging device; based on the determined set of capabilities, if the imaging device is adapted to support a device-based image-only PDF process adapted to process image-only PDF documents, then transmitting to the imaging device the image-only PDF document for rendering by the imaging device; and otherwise, if the imaging device is not adapted to support the device-based image-only PDF process but adapted to support an image document format compatible with the embedded PDF image format, then: transforming, by the host, the at least one embedded PDF image of the image-only PDF document into a transformed image document with the image document format compatible with the embedded PDF image format; and transmitting, by the host, to the imaging device the transformed image document with the image document format compatible with the embedded PDF image format, for rendering by the imaging device. | 1. A method of processing by a host comprising: receiving, by the host, an image-only PDF document comprising at least one embedded portable document format (PDF) image with an embedded PDF image format, wherein the image-only PDF document is directed to an imaging device; determining, by the host, a set of capabilities associated with the imaging device; based on the determined set of capabilities, if the imaging device is adapted to support a device-based image-only PDF process adapted to process image-only PDF documents, then transmitting to the imaging device the image-only PDF document for rendering by the imaging device; and otherwise, if the imaging device is not adapted to support the device-based image-only PDF process but adapted to support an image document format compatible with the embedded PDF image format, then: transforming, by the host, the at least one embedded PDF image of the image-only PDF document into a transformed image document with the image document format compatible with the embedded PDF image format; and transmitting, by the host, to the imaging device the transformed image document with the image document format compatible with the embedded PDF image format, for rendering by the imaging device. 9. The method of claim 1 , wherein transforming the at least one embedded PDF image of the image-only PDF document into a transformed image document with the image document format compatible with the embedded PDF image format is based on the decrypted image-only PDF document. | 0.808333 |
9,734,219 | 1 | 9 | 1. A computer server system coupleable to a network for personalization of network search results and search result rankings, the server system comprising: a network input and output interface for network data transmission and reception, the network input and output interface adapted to receive at least one query from a respondent or co-respondent via the network; to transmit a plurality of return queries to the respondent or co-respondent via the network; to receive a plurality of responses to the return queries from the respondent or co-respondent via the network; and to transmit personalized network search results and search result rankings to the respondent or co-respondent via the network; at least one data storage device storing a plurality of return queries; and one or more processors coupled to the at least one data storage device and network input and output interface, the one or more processors adapted to access the at least one data storage device and using the at least one query, to select the plurality of return queries for transmission; to generate a digital filter from each plurality of responses to the return queries to form a plurality of digital filters; to search the at least one data storage device for corresponding pluralities of responses to the return queries from one or more co-respondents or respondents, respectively; to comparatively pair-wise score the plurality of responses to the return queries against the corresponding pluralities of responses to the return queries using a variance determination or a difference determination to compare a selected combination of respondent and co-respondent digital filters, of the plurality of digital filters, to generate a pair-wise alignment score for the selected respondent and co-respondent combination to form a plurality of pair-wise alignment scores for a plurality of respondent and co-respondent combinations; to sort and rank the plurality of respondent and co-respondent combinations according to the plurality of pair-wise alignment scores; and to output a listing of the sorted and ranked respondents or co-respondents to form the personalized network search results and search result rankings. | 1. A computer server system coupleable to a network for personalization of network search results and search result rankings, the server system comprising: a network input and output interface for network data transmission and reception, the network input and output interface adapted to receive at least one query from a respondent or co-respondent via the network; to transmit a plurality of return queries to the respondent or co-respondent via the network; to receive a plurality of responses to the return queries from the respondent or co-respondent via the network; and to transmit personalized network search results and search result rankings to the respondent or co-respondent via the network; at least one data storage device storing a plurality of return queries; and one or more processors coupled to the at least one data storage device and network input and output interface, the one or more processors adapted to access the at least one data storage device and using the at least one query, to select the plurality of return queries for transmission; to generate a digital filter from each plurality of responses to the return queries to form a plurality of digital filters; to search the at least one data storage device for corresponding pluralities of responses to the return queries from one or more co-respondents or respondents, respectively; to comparatively pair-wise score the plurality of responses to the return queries against the corresponding pluralities of responses to the return queries using a variance determination or a difference determination to compare a selected combination of respondent and co-respondent digital filters, of the plurality of digital filters, to generate a pair-wise alignment score for the selected respondent and co-respondent combination to form a plurality of pair-wise alignment scores for a plurality of respondent and co-respondent combinations; to sort and rank the plurality of respondent and co-respondent combinations according to the plurality of pair-wise alignment scores; and to output a listing of the sorted and ranked respondents or co-respondents to form the personalized network search results and search result rankings. 9. The computer server system of claim 1 , wherein the one or more processors are further adapted to store the plurality of pair-wise alignment scores for the plurality of respondent and co-respondent combinations in the at least one data storage device, and to store the listing of the sorted and ranked respondents or co-respondents in the at least one data storage device. | 0.66277 |
9,858,051 | 50 | 51 | 50. The security appliance of claim 49 wherein the processor is further configured to: if the first hash value is present in the EC cache table, set the stored set of NFA states mapped to the first hash value in the EC cache table as an epsilon closure of the set of NFA states received. | 50. The security appliance of claim 49 wherein the processor is further configured to: if the first hash value is present in the EC cache table, set the stored set of NFA states mapped to the first hash value in the EC cache table as an epsilon closure of the set of NFA states received. 51. The security appliance of claim 50 wherein the processor is further configured to: if the first hash value is not present in the EC cache table, compute an epsilon closure of the set of NFA states received; and add a new entry into the EC cache table, the new entry mapping the first hash value of the set of NFA states received to the epsilon closure computed of the set of NFA states received. | 0.5 |
8,595,010 | 18 | 19 | 18. The Hidden Markov Model generation system according to claim 11 , comprising a model-to-be-used selection section that selects, from the scheduled-to-be-used model group, Hidden Markov Models to be used for generating filler models, as models to be used, and the filler model generation section generates Hidden Markov Models to be used as filler models by the given speech recognition system based on the Hidden Markov Model group selected as the models to be used. | 18. The Hidden Markov Model generation system according to claim 11 , comprising a model-to-be-used selection section that selects, from the scheduled-to-be-used model group, Hidden Markov Models to be used for generating filler models, as models to be used, and the filler model generation section generates Hidden Markov Models to be used as filler models by the given speech recognition system based on the Hidden Markov Model group selected as the models to be used. 19. The Hidden Markov Model generation system according to claim 18 , wherein the model-to-be-used selection section detects elements necessary for speech recognition of designated vocabulary or sentence, and selects Hidden Markov Models of elements other than the detected elements as the models to be used. | 0.5 |
8,745,094 | 1 | 2 | 1. A method for distributed tokenization of sensitive strings of characters in a local server, the method comprising: receiving at the local server from a central server one or more token lookup tables having a plurality of tokens, each token comprising at least one character; receiving a sensitive string of characters at the local server; selecting a substring of the sensitive string of characters; replacing the selected substring of the sensitive string of characters with a first token from the received token lookup tables to form an intermediate tokenized string of characters; selecting a substring of the intermediate tokenized string of characters, the selected substring of the intermediate tokenized string of characters including at least one character replaced by the first token; and replacing the selected substring of the intermediate tokenized string of characters with a second token from the received token lookup tables to form a final tokenized string of characters, the second token being different from the first token. | 1. A method for distributed tokenization of sensitive strings of characters in a local server, the method comprising: receiving at the local server from a central server one or more token lookup tables having a plurality of tokens, each token comprising at least one character; receiving a sensitive string of characters at the local server; selecting a substring of the sensitive string of characters; replacing the selected substring of the sensitive string of characters with a first token from the received token lookup tables to form an intermediate tokenized string of characters; selecting a substring of the intermediate tokenized string of characters, the selected substring of the intermediate tokenized string of characters including at least one character replaced by the first token; and replacing the selected substring of the intermediate tokenized string of characters with a second token from the received token lookup tables to form a final tokenized string of characters, the second token being different from the first token. 2. The method of claim 1 , wherein the final tokenized string of characters comprises characters that have not been replaced by the first and second tokens, the characters thus being identical to the corresponding characters of the sensitive string of characters. | 0.764337 |
8,233,726 | 1 | 26 | 1. A computer-implemented method of identifying a writing system associated with a document image containing one or more words written in the writing system, the method comprising: identifying a document image fragment based on the document image, wherein the document image fragment contains one or more pixels from one or more of the words in the document image; generating a set of sequential features associated with the document image fragment, wherein each sequential feature describes one dimensional graphic information derived from the one or more pixels in the document image fragment; identifying a plurality of n-grams based on the set of sequential features, wherein each n-gram comprises an ordered subset of sequential features; generating a classification score for the document image fragment based at least in part on a frequency of occurrence of the n-grams in sets of sequential features associated with known writing systems, the classification score indicating a likelihood that the document image fragment is written in the writing system; and identifying the writing system associated with the document image based at least in part on the classification score for the document image fragment. | 1. A computer-implemented method of identifying a writing system associated with a document image containing one or more words written in the writing system, the method comprising: identifying a document image fragment based on the document image, wherein the document image fragment contains one or more pixels from one or more of the words in the document image; generating a set of sequential features associated with the document image fragment, wherein each sequential feature describes one dimensional graphic information derived from the one or more pixels in the document image fragment; identifying a plurality of n-grams based on the set of sequential features, wherein each n-gram comprises an ordered subset of sequential features; generating a classification score for the document image fragment based at least in part on a frequency of occurrence of the n-grams in sets of sequential features associated with known writing systems, the classification score indicating a likelihood that the document image fragment is written in the writing system; and identifying the writing system associated with the document image based at least in part on the classification score for the document image fragment. 26. The method of claim 1 , wherein at least some of the n-grams in the plurality include overlapping ones of the sequential features. | 0.919374 |
7,788,582 | 5 | 7 | 5. A computer readable medium including at least computer program code stored thereon for searching through a group of media items, said computer readable medium comprising: computer program code for presenting a search box capable of receiving a user input; computer program code for determining whether a user input is present in the search box; and computer program code for automatically displaying a search assistant when it is determined that a user input is present in the search box, wherein the search assistant facilitates selection of search criteria for use when searching for the text string within the group of media items, and wherein the searching is confined to the search criteria selected using the search assistant, wherein the search assistant includes a category section having a plurality of predetermined categories, and a fields section having a plurality of predetermined fields, and wherein the plurality of predetermined categories and the plurality of predetermined fields are simultaneously displayed in a horizontal row prior to performing a search in accordance with the text string, wherein the predetermined categories horizontally depicted in the search assistant pertain to at least a music category and a video category, when the music category is selected, the one or more fields being horizontally depicted include at least one of artist, album, composer and song, and when the video category is selected, the one or more fields being horizontally depicted include at least one of artist, album and title. | 5. A computer readable medium including at least computer program code stored thereon for searching through a group of media items, said computer readable medium comprising: computer program code for presenting a search box capable of receiving a user input; computer program code for determining whether a user input is present in the search box; and computer program code for automatically displaying a search assistant when it is determined that a user input is present in the search box, wherein the search assistant facilitates selection of search criteria for use when searching for the text string within the group of media items, and wherein the searching is confined to the search criteria selected using the search assistant, wherein the search assistant includes a category section having a plurality of predetermined categories, and a fields section having a plurality of predetermined fields, and wherein the plurality of predetermined categories and the plurality of predetermined fields are simultaneously displayed in a horizontal row prior to performing a search in accordance with the text string, wherein the predetermined categories horizontally depicted in the search assistant pertain to at least a music category and a video category, when the music category is selected, the one or more fields being horizontally depicted include at least one of artist, album, composer and song, and when the video category is selected, the one or more fields being horizontally depicted include at least one of artist, album and title. 7. A computer readable medium as recited in claim 5 , wherein the fields presented in the search assistant are dynamically determined and are different depending on a selection of one of the categories. | 0.678344 |