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
1
|
---|---|---|---|---|---|
8,639,507 | 1 | 3 | 1. A voice recognition system which recognizes keywords included in input voice, comprising: a first voice recognition processing means for generating a recognition hypothesis graph which indicates a structure of hypothesis that is derived according to a first grammar together with a score associated with respective connections of a recognition unit by executing a voice recognition process based on said first grammar to a voice feature amount of input voice; and a second voice recognition processing means for outputting a recognition result from total score of a hypothesis which is derived according to a second grammar after acquiring said structure and said score of said garbage section from said recognition hypothesis graph, and executing a voice recognition process according to said second grammar that is specified to accept a section other than keywords in input voice as a garbage section to a voice feature amount of input voice, wherein said second voice recognition processing means, to said hypothesis reached to said garbage section in said second grammar, selects no smaller than one voice section having a node which can connected with said hypothesis as a starting point in said recognition hypothesis graph, and connects said structure and said score of a selected voice section with said hypothesis as said structure and said score of said garbage section. | 1. A voice recognition system which recognizes keywords included in input voice, comprising: a first voice recognition processing means for generating a recognition hypothesis graph which indicates a structure of hypothesis that is derived according to a first grammar together with a score associated with respective connections of a recognition unit by executing a voice recognition process based on said first grammar to a voice feature amount of input voice; and a second voice recognition processing means for outputting a recognition result from total score of a hypothesis which is derived according to a second grammar after acquiring said structure and said score of said garbage section from said recognition hypothesis graph, and executing a voice recognition process according to said second grammar that is specified to accept a section other than keywords in input voice as a garbage section to a voice feature amount of input voice, wherein said second voice recognition processing means, to said hypothesis reached to said garbage section in said second grammar, selects no smaller than one voice section having a node which can connected with said hypothesis as a starting point in said recognition hypothesis graph, and connects said structure and said score of a selected voice section with said hypothesis as said structure and said score of said garbage section. 3. The voice recognition system according to claim 1 , wherein said second voice recognition processing means selects said voice section having a node which can be a vocabulary word termination as a ending point in a language of input voice when selecting said voice section which is connected with said hypothesis that reached said garbage section from said recognition hypothesis graph. | 0.656637 |
7,490,092 | 36 | 42 | 36. A method of indexing and searching timed media files, as recited in claim 35 , wherein said processing of language that is spoken within the timed media file includes analyzing the logical structure of the language. | 36. A method of indexing and searching timed media files, as recited in claim 35 , wherein said processing of language that is spoken within the timed media file includes analyzing the logical structure of the language. 42. A method of indexing and searching timed media files, as recited in claim 36 , wherein said analysis of the logical structure of the language includes identifying indications of continuation of topic. | 0.908356 |
9,443,209 | 1 | 3 | 1. A system comprising: a memory to store an index comprising a plurality of brand relationships based on an analysis of a collection of user queries, each of the brand relationships comprising a first brand-category pair of a first brand and a first category, a second brand-category pair of a second brand and a second category, and a recommendation score calculated between the first brand-category pair and the second brand-category pair, the recommendation score of each brand relationship determined from user sessions having queries of both the first brand and first category and the second brand and second category; a processor to implement a recommendation module to provide a recommendation based on an identified brand preference from an activity of a user by querying the index in the memory using the first brand and first category of the identified brand preference to identify the second brand-category pair having a highest recommendation score in the index; and an expansion module to expand a seed set of brands corresponding to a category by analyzing the collection of user queries to determine a new brand to add to the seed set, the analyzing including mining a corpus containing a plurality of user queries by evaluating user queries containing a disjunction of brand terms. | 1. A system comprising: a memory to store an index comprising a plurality of brand relationships based on an analysis of a collection of user queries, each of the brand relationships comprising a first brand-category pair of a first brand and a first category, a second brand-category pair of a second brand and a second category, and a recommendation score calculated between the first brand-category pair and the second brand-category pair, the recommendation score of each brand relationship determined from user sessions having queries of both the first brand and first category and the second brand and second category; a processor to implement a recommendation module to provide a recommendation based on an identified brand preference from an activity of a user by querying the index in the memory using the first brand and first category of the identified brand preference to identify the second brand-category pair having a highest recommendation score in the index; and an expansion module to expand a seed set of brands corresponding to a category by analyzing the collection of user queries to determine a new brand to add to the seed set, the analyzing including mining a corpus containing a plurality of user queries by evaluating user queries containing a disjunction of brand terms. 3. The system of claim 1 , wherein the expansion module is further to identify the brand relationship between the first brand and the second brand based on an analysis of the collection of user queries. | 0.722527 |
8,321,402 | 1 | 6 | 1. A method on a back-end computer system for building user interfaces for performing custom searches of a database, where access to the database is restricted based on a role for a user comprising: responsive to receiving at a front-end computer system a name identifying a search definition and the role of the user: determining on the back-end computer system a target database using the name; retrieving result fields from the target database using the name; restricting result fields based on the role of the user, building a search parameter user interface at the back-end computer system for entering values for search parameters, wherein the search parameters are result fields accessible based on the role of the user, transmitting the search parameter user interface to the front-end computer system of the user, receiving the values for the search parameters from the front-end computer system on the back-end computer system, querying the target database using the received values for the search parameters, receiving values for the result fields, building a results user interface at the back-end computer system for viewing the values for the result fields, transmitting the results user interface to the front-end computer system, providing a user interface for the user to define the search parameters, the result fields, and the name of the custom search, and storing the search parameters and result fields indexed by the name for the custom search. | 1. A method on a back-end computer system for building user interfaces for performing custom searches of a database, where access to the database is restricted based on a role for a user comprising: responsive to receiving at a front-end computer system a name identifying a search definition and the role of the user: determining on the back-end computer system a target database using the name; retrieving result fields from the target database using the name; restricting result fields based on the role of the user, building a search parameter user interface at the back-end computer system for entering values for search parameters, wherein the search parameters are result fields accessible based on the role of the user, transmitting the search parameter user interface to the front-end computer system of the user, receiving the values for the search parameters from the front-end computer system on the back-end computer system, querying the target database using the received values for the search parameters, receiving values for the result fields, building a results user interface at the back-end computer system for viewing the values for the result fields, transmitting the results user interface to the front-end computer system, providing a user interface for the user to define the search parameters, the result fields, and the name of the custom search, and storing the search parameters and result fields indexed by the name for the custom search. 6. The method of claim 1 , wherein querying further comprises: transmitting the received values for the search parameters and the result fields to a proprietary database query module. | 0.904588 |
8,504,507 | 10 | 12 | 10. A computer system operable to provide content based on an estimated actual age, the system comprising: a communications device operable to exchange information over a communications network; a memory storing program instructions to be executed by a processor; and a processor operable to communicate with the communications device and the memory and to read and execute the program instructions from the memory to perform the following operations: identifying a set of related members for a first member, wherein the first member and each member in the set of related members are members of a social networking website, and wherein each member in the set of related members is connected to the first member in the social network website; examining age information associated with one or more members in the set of related members in the set of related members; when a threshold number of members in the set of related members have an estimated actual age within a certain age range, estimating an actual age of the first member based on the estimated actual age of the members in the set of related members; and providing content to the first member based on the first member's estimated actual age. | 10. A computer system operable to provide content based on an estimated actual age, the system comprising: a communications device operable to exchange information over a communications network; a memory storing program instructions to be executed by a processor; and a processor operable to communicate with the communications device and the memory and to read and execute the program instructions from the memory to perform the following operations: identifying a set of related members for a first member, wherein the first member and each member in the set of related members are members of a social networking website, and wherein each member in the set of related members is connected to the first member in the social network website; examining age information associated with one or more members in the set of related members in the set of related members; when a threshold number of members in the set of related members have an estimated actual age within a certain age range, estimating an actual age of the first member based on the estimated actual age of the members in the set of related members; and providing content to the first member based on the first member's estimated actual age. 12. The computer system of claim 10 , wherein the content includes one or more of: advertisements and messages. | 0.815615 |
9,866,536 | 4 | 5 | 4. The method of claim 1 , wherein the request comprises a request for encrypted information related to a domain name. | 4. The method of claim 1 , wherein the request comprises a request for encrypted information related to a domain name. 5. The method of claim 4 , wherein the at least one tokenized string is contained in the store of tokenized strings, and further comprising determining that the encrypted information is available, and returning the encrypted information. | 0.925891 |
9,378,299 | 11 | 12 | 11. The system of claim 10 further comprising program code for: calculating a score for a candidate page in the set, the score indicating a measure of how interesting the candidate page is likely to be to a user of the client. | 11. The system of claim 10 further comprising program code for: calculating a score for a candidate page in the set, the score indicating a measure of how interesting the candidate page is likely to be to a user of the client. 12. The system of claim 11 wherein program code for calculating the score for the candidate page comprises program code for: retrieving extrinsic components including a measurement of a number of quality of interactions with the candidate page by a plurality of users of the electronic document; and calculating the score responsive to the extrinsic components of the candidate page. | 0.816042 |
9,858,269 | 1 | 3 | 1. A computer-implemented method for Chinese name transliteration, by a Chinese transliterator, into a Romanized form of the Chinese name, wherein the Chinese transliteration module includes a standardized transliteration module, comprising: receiving, by the transliterator, a sequence of characters representing a Chinese surname and a Chinese given name; parsing, by a name parsing module of the transliterator, the received sequence of characters into a Chinese surname and a Chinese given name by: first, identifying any dual-character Chinese surnames in the received sequence of characters, by referencing a list of known Chinese surnames, second, identifying any single-character Chinese surnames in the received sequence of characters, by referencing the list of known Chinese surnames, and third, identifying, all remaining characters not belonging to a dual-character or a single-character Chinese surname in the received sequence of characters as a given name; transliterating, by a transliteration module of the transliterator, the identified Chinese surname and the identified Chinese given name into a Mandarin Pinyin representation, wherein transliterating further comprises: determining whether a pronunciation of a character is sensitive to the name field in which the character occurs, in response to determining that the pronunciation of the character is not sensitive to the name field, transliterating the character using a Han-Latin module, and in response to determining that the pronunciation of the character is sensitive to the name field, bypassing the Han-Latin module and using a context-sensitive exception rule; and normalizing, by a normalization module of the transliterator, the Mandarin Pinyin representation into a Mandarin Pinyin representation having no diacritic symbols. | 1. A computer-implemented method for Chinese name transliteration, by a Chinese transliterator, into a Romanized form of the Chinese name, wherein the Chinese transliteration module includes a standardized transliteration module, comprising: receiving, by the transliterator, a sequence of characters representing a Chinese surname and a Chinese given name; parsing, by a name parsing module of the transliterator, the received sequence of characters into a Chinese surname and a Chinese given name by: first, identifying any dual-character Chinese surnames in the received sequence of characters, by referencing a list of known Chinese surnames, second, identifying any single-character Chinese surnames in the received sequence of characters, by referencing the list of known Chinese surnames, and third, identifying, all remaining characters not belonging to a dual-character or a single-character Chinese surname in the received sequence of characters as a given name; transliterating, by a transliteration module of the transliterator, the identified Chinese surname and the identified Chinese given name into a Mandarin Pinyin representation, wherein transliterating further comprises: determining whether a pronunciation of a character is sensitive to the name field in which the character occurs, in response to determining that the pronunciation of the character is not sensitive to the name field, transliterating the character using a Han-Latin module, and in response to determining that the pronunciation of the character is sensitive to the name field, bypassing the Han-Latin module and using a context-sensitive exception rule; and normalizing, by a normalization module of the transliterator, the Mandarin Pinyin representation into a Mandarin Pinyin representation having no diacritic symbols. 3. The method of claim 1 , wherein the name parsing is applied only when the received sequence of characters is six characters or shorter in length. | 0.626263 |
9,269,097 | 19 | 21 | 19. The method of claim 1 , further comprising: facilitating, by the computer system, delivery of the product or service responsive to determining that the pronoun refers to one or more of the product or service or the provider of the product or service. | 19. The method of claim 1 , further comprising: facilitating, by the computer system, delivery of the product or service responsive to determining that the pronoun refers to one or more of the product or service or the provider of the product or service. 21. The method of claim 19 , wherein the product or service comprises a particular product, and wherein facilitating delivery of the product or service includes providing the particular product to a user device of the user. | 0.906538 |
5,577,163 | 3 | 4 | 3. A speech categorization system for recognizing at least one spoken itemized expression appearing in a communication, comprising: an amplifier receiving said communication and amplifying said speech to produce a speech signal; a comparator connected to said amplifier, said comparator comparing the speech signal to a threshold value and generating a high amplitude signal when the speech signal is greater than the threshold value and generating a low amplitude signal when said speech signal is less than the threshold value; a timer for counting the duration of the high amplitude signal and the duration of the low amplitude signal; and means for determining if a spoken itemized expression has occurred by relating the duration of the high amplitude signal and the duration of the low amplitude signal. | 3. A speech categorization system for recognizing at least one spoken itemized expression appearing in a communication, comprising: an amplifier receiving said communication and amplifying said speech to produce a speech signal; a comparator connected to said amplifier, said comparator comparing the speech signal to a threshold value and generating a high amplitude signal when the speech signal is greater than the threshold value and generating a low amplitude signal when said speech signal is less than the threshold value; a timer for counting the duration of the high amplitude signal and the duration of the low amplitude signal; and means for determining if a spoken itemized expression has occurred by relating the duration of the high amplitude signal and the duration of the low amplitude signal. 4. A system as in claim 3, wherein said determining means produces an output signal indicative of a spoken itemized expression when the duration of the high amplitude signal is less than the duration of the low amplitude signal. | 0.837838 |
9,536,281 | 1 | 2 | 1. A method for image scaling including low resolution text areas, the method comprising: determining, by one or more processors, one or more areas of text in an image to be scaled for display on a screen; scaling, by one or more processors, the one or more areas of text using two or more scaling algorithms to a required resolution to acquire two or more scaled versions of the text area; selecting a clearest text in a text area from two or more scaled versions of the text area to create an overall image; removing, by one or more processors, one or more identified text areas from the overall image displayed on the screen; filling in, by one or more processors, the removed one or more identified text areas with an image matching a background area surrounding an area from which the identified text is removed; marking, by one or more processors, an area of the removed one or more identified text areas with a distinguishing color before filling with a matching overall image; scaling, by one or more processors, the overall image to the required resolution; applying, by one or more processors, shaders to a scaled overall image prior to merging the scaled overall image with selected versions of each text area; merging, by one or more processors, the scaled overall image with the selected scaled version of each text area to create a merged image; and displaying, by one or more processors, the merged image on the screen. | 1. A method for image scaling including low resolution text areas, the method comprising: determining, by one or more processors, one or more areas of text in an image to be scaled for display on a screen; scaling, by one or more processors, the one or more areas of text using two or more scaling algorithms to a required resolution to acquire two or more scaled versions of the text area; selecting a clearest text in a text area from two or more scaled versions of the text area to create an overall image; removing, by one or more processors, one or more identified text areas from the overall image displayed on the screen; filling in, by one or more processors, the removed one or more identified text areas with an image matching a background area surrounding an area from which the identified text is removed; marking, by one or more processors, an area of the removed one or more identified text areas with a distinguishing color before filling with a matching overall image; scaling, by one or more processors, the overall image to the required resolution; applying, by one or more processors, shaders to a scaled overall image prior to merging the scaled overall image with selected versions of each text area; merging, by one or more processors, the scaled overall image with the selected scaled version of each text area to create a merged image; and displaying, by one or more processors, the merged image on the screen. 2. The method as claimed in claim 1 , wherein one of the scaling algorithms is a linear algorithm for scaling the original text. | 0.875969 |
7,979,375 | 20 | 21 | 20. A method as recited in claim 16 , wherein the tradeoff value corresponds to an ideal profile for required goods and the ranked list of alternatives corresponds to bids. | 20. A method as recited in claim 16 , wherein the tradeoff value corresponds to an ideal profile for required goods and the ranked list of alternatives corresponds to bids. 21. A method as recited in claim 20 , further comprising: receiving bid information from at least two bidders, generating a heterogeneous matrix of alternatives and attributes based on the bid information, scoring the bids according to the homogenous matrix of scores, wherein the ranked list of alternatives comprises the bid information. | 0.841589 |
4,604,698 | 1 | 3 | 1. An electronic translator comprising: means for introducing a word of a first language, said introduced word having more than one meaning; means for translating said introduced word into a second language word having a same said meaning as said introduced word, said introduced word; means for retranslating said translated word back to said first language word to provide a retranslated word; means for providing a comment representative of the said meaning in said second language of said retranslated word in said first language; and means for indicating said introduced word, said translated word, said retranslated word, and said comment. | 1. An electronic translator comprising: means for introducing a word of a first language, said introduced word having more than one meaning; means for translating said introduced word into a second language word having a same said meaning as said introduced word, said introduced word; means for retranslating said translated word back to said first language word to provide a retranslated word; means for providing a comment representative of the said meaning in said second language of said retranslated word in said first language; and means for indicating said introduced word, said translated word, said retranslated word, and said comment. 3. An electronic translator according to claim 1, further comprising means for marking said introduced word to indicate the availabilities of another said meaning of said introduced word, and means for recalling said marked introducing word. | 0.899917 |
9,274,646 | 1 | 4 | 1. An apparatus, comprising least one processor and at least one memory including computer program code, the memory and the computer program code configured to, working with the processor, cause the apparatus to perform at least the following: receive a multiple touch input comprising a first touch input having a first text position within a first word such that the first text position is a text position between a first character of the first word and a last letter of the first word, and a second touch input having a second text position such that the second text position is a text position between a first character of a second word and a last letter of the second word; determine a first text selection point positioned outside of the first word based at least in part on the first text position being within the first word, such that the first text selection point is at least one of a text position preceding a first character of the first word, or a text position following a last letter of the first word; determine a second text selection point positioned outside of the second word based at least in part on the second text position, such that the second text selection point is at least one of a text position preceding a first character of the second word, or a text position following a last letter of the second word; and select text information between the first text selection point and the second text selection point. | 1. An apparatus, comprising least one processor and at least one memory including computer program code, the memory and the computer program code configured to, working with the processor, cause the apparatus to perform at least the following: receive a multiple touch input comprising a first touch input having a first text position within a first word such that the first text position is a text position between a first character of the first word and a last letter of the first word, and a second touch input having a second text position such that the second text position is a text position between a first character of a second word and a last letter of the second word; determine a first text selection point positioned outside of the first word based at least in part on the first text position being within the first word, such that the first text selection point is at least one of a text position preceding a first character of the first word, or a text position following a last letter of the first word; determine a second text selection point positioned outside of the second word based at least in part on the second text position, such that the second text selection point is at least one of a text position preceding a first character of the second word, or a text position following a last letter of the second word; and select text information between the first text selection point and the second text selection point. 4. The apparatus of claim 1 , wherein the memory includes computer program code configured to, working with the processor, cause the apparatus to determine the first text selection point based at least in part on a text distance between the first text position and a text position related to a beginning of a word. | 0.801517 |
10,007,648 | 13 | 14 | 13. The method according to claim 12 , further comprising: referencing the screen character string control table, and inserting the master table identifier associated with the incorporating screen character string into the user-interface by associating with the character string. | 13. The method according to claim 12 , further comprising: referencing the screen character string control table, and inserting the master table identifier associated with the incorporating screen character string into the user-interface by associating with the character string. 14. The method according to claim 13 , further comprising: recording a translated character strings, into the screen character string control table, wherein the screen character string control table includes a set of the master identifiers associated with the character string before modification; associating the translated screen character strings with respective master identifiers that are associated with the character strings corresponding to the translated screen character strings; associating the category information associated with the character strings before modification with the corresponding translated screen character strings; associating the first appearance positional information associated with the character strings before modification with the corresponding translated screen character strings; and associating the second appearance positional information associated with the screen character strings before modification with the corresponding translated screen character strings; and wherein maintaining consistency comprises replacing the character string before modification that is associated with the acquired second appearance positional information with the translated screen character string. | 0.778582 |
9,313,153 | 20 | 38 | 20. An apparatus for dynamic message routing between publishing nodes and subscribing nodes sent throughout a network without regard to how a topology of the network changes, the apparatus comprising: a processor; and a memory, coupled to the processor, having code and data stored therein, wherein the code is executable by the processor to transform the apparatus into a machine to: receive a plurality of subscription requests at a plurality of brokers; consolidate the received plurality of subscription requests; determining whether to propagate the consolidated subscriptions requests; receive the message and a topic at a broker via a network; identify one or more subscribers for the topic received; obtain up-to-date network path configuration information; reconfigure broker network path information based on revisions to the network path configuration information to determine a path for sending the message via the network, including performing real-time adjustment of the path; and sending the message to the identified subscribers; wherein to perform real-time adjustment of the path comprises to: monitor changes to the topology of the network; determine in real-time whether any connections within the network are unavailable to dynamically maintain subscriptions; and automatically calculate a path for any subscribers affected by any unavailable connections. | 20. An apparatus for dynamic message routing between publishing nodes and subscribing nodes sent throughout a network without regard to how a topology of the network changes, the apparatus comprising: a processor; and a memory, coupled to the processor, having code and data stored therein, wherein the code is executable by the processor to transform the apparatus into a machine to: receive a plurality of subscription requests at a plurality of brokers; consolidate the received plurality of subscription requests; determining whether to propagate the consolidated subscriptions requests; receive the message and a topic at a broker via a network; identify one or more subscribers for the topic received; obtain up-to-date network path configuration information; reconfigure broker network path information based on revisions to the network path configuration information to determine a path for sending the message via the network, including performing real-time adjustment of the path; and sending the message to the identified subscribers; wherein to perform real-time adjustment of the path comprises to: monitor changes to the topology of the network; determine in real-time whether any connections within the network are unavailable to dynamically maintain subscriptions; and automatically calculate a path for any subscribers affected by any unavailable connections. 38. The apparatus of claim 20 , wherein the code is further executable by the processor to: identify a cluster to which to send the message; wherein to determine a path to send the message includes determining a best path for sending the message to the identified cluster; and wherein to send the message is performed by sending the message to the identified cluster using the best path for to the message to the identified cluster. | 0.501155 |
8,291,377 | 1 | 12 | 1. A method for identifying a particular processing context for running script in a computing system such that the default context is modified, the method comprising: at a computing system, using one or more processors to: access a script, wherein the script is just a portion of a script pipelined command: interpret a script to identify a plurality of executable components to invoke, wherein the plurality of executable components have a default context in which they are each run within a first process; identify one or more properties of a first of the plurality of identified executable components, the one or more properties being contained within the script; identify one or more processing context configuration files associated with the first of the plurality of identified executable components by using the one or more properties, the one or more processing context configuration files being separate from the script; and use the one or more processing context configuration files to identify a processing context for the identified first executable component, wherein the identified processing context for the first executable component is different than the default context and defines a modified context in which the first executable component is removed from the first process and is run within a second process that is different than the first process and wherein a particular version of an interpreter is required to run any process in which the first executable component is run. | 1. A method for identifying a particular processing context for running script in a computing system such that the default context is modified, the method comprising: at a computing system, using one or more processors to: access a script, wherein the script is just a portion of a script pipelined command: interpret a script to identify a plurality of executable components to invoke, wherein the plurality of executable components have a default context in which they are each run within a first process; identify one or more properties of a first of the plurality of identified executable components, the one or more properties being contained within the script; identify one or more processing context configuration files associated with the first of the plurality of identified executable components by using the one or more properties, the one or more processing context configuration files being separate from the script; and use the one or more processing context configuration files to identify a processing context for the identified first executable component, wherein the identified processing context for the first executable component is different than the default context and defines a modified context in which the first executable component is removed from the first process and is run within a second process that is different than the first process and wherein a particular version of an interpreter is required to run any process in which the first executable component is run. 12. A method in accordance with claim 1 , further comprising: instantiating a first interpreter, the first interpreter being specific to the first process; and instantiating a second interpreter, the second interpreter being specific to the second process, such that the first and second processes each have their own interpreters. | 0.850766 |
7,788,248 | 46 | 47 | 46. A machine-implemented method comprising: receiving text input within an integrated search field of a web browser application, through a hardware input device; determining, based on characteristics of the text input, whether the text input triggers an automatic submission of a query to a search engine; determining, based on characteristics of the text input, whether to delay the trigger for automatic submission, wherein the query is automatically submitted to the search engine if the text input satisfies a temporal trigger, wherein the temporal trigger is based upon a connection speed to the search engine; automatically submitting the query to the search engine, the query based on the received search input; displaying, within the web browser application, a web page returned from the search engine based on the query; and automatically maintaining a focus within the integrated search field after the returned web page is displayed, the focus designating where the text input is directed. | 46. A machine-implemented method comprising: receiving text input within an integrated search field of a web browser application, through a hardware input device; determining, based on characteristics of the text input, whether the text input triggers an automatic submission of a query to a search engine; determining, based on characteristics of the text input, whether to delay the trigger for automatic submission, wherein the query is automatically submitted to the search engine if the text input satisfies a temporal trigger, wherein the temporal trigger is based upon a connection speed to the search engine; automatically submitting the query to the search engine, the query based on the received search input; displaying, within the web browser application, a web page returned from the search engine based on the query; and automatically maintaining a focus within the integrated search field after the returned web page is displayed, the focus designating where the text input is directed. 47. The method of claim 46 , further comprising preventing the returned web page from controlling the focus. | 0.936694 |
9,773,336 | 1 | 2 | 1. A system, comprising: at least one processor; and a memory coupled to the at least one processor and storing program instructions-executable by the at least one processor to perform operations including: displaying, via a graphical user interface, a representation of a document including an animation that is renderable by executing programmatic elements of the document to manipulate a structure of the document; displaying the document in a natural state that corresponds to an initial point of the animation and represents a version of the document that a search engine configured to analyze only static structural elements of a document encounters during a search; rendering the animation starting from the initial point of the animation by executing programmatic elements of the document; responsive to receiving a selection of a point of the animation that occurs in between the initial point of the animation and an end point of the animation, designating the selected point of the animation as a new base state of the document; altering the version of the document that the search engine encounters during a search to correspond to the new base state without changing the natural state of the document such that any subsequent rendering of the animation still starts from the initial point of the animation that corresponds to the natural state; and maintaining the natural state of the document and the new base state so that any subsequent rendering of the animation starts from the initial point of the animation while the version of the document that the search engine encounters during a search corresponds to the selected point of the animation that occurs in between the initial point of the animation and the end point of the animation. | 1. A system, comprising: at least one processor; and a memory coupled to the at least one processor and storing program instructions-executable by the at least one processor to perform operations including: displaying, via a graphical user interface, a representation of a document including an animation that is renderable by executing programmatic elements of the document to manipulate a structure of the document; displaying the document in a natural state that corresponds to an initial point of the animation and represents a version of the document that a search engine configured to analyze only static structural elements of a document encounters during a search; rendering the animation starting from the initial point of the animation by executing programmatic elements of the document; responsive to receiving a selection of a point of the animation that occurs in between the initial point of the animation and an end point of the animation, designating the selected point of the animation as a new base state of the document; altering the version of the document that the search engine encounters during a search to correspond to the new base state without changing the natural state of the document such that any subsequent rendering of the animation still starts from the initial point of the animation that corresponds to the natural state; and maintaining the natural state of the document and the new base state so that any subsequent rendering of the animation starts from the initial point of the animation while the version of the document that the search engine encounters during a search corresponds to the selected point of the animation that occurs in between the initial point of the animation and the end point of the animation. 2. The system of claim 1 , wherein the document includes a HyperText Markup Language (HTML) document, and wherein the operations further include, responsive to said altering, recalculating a scripting language command for the document such that upon loading of the document by a web browser, the document is rendered based on the natural state. | 0.698774 |
7,689,938 | 1 | 6 | 1. A method of displaying in a calculator, comprising: receiving a first mathematical expression in an expression entry area on the calculator; displaying results in a first window on the calculator, wherein the results displayed in the first window comprise a result for the first mathematical expression; displaying, in a second window on the calculator, a usage history comprising the first mathematical expression, a second mathematical expression, and results displayed in the second window, wherein the results displayed in the second window comprise the result for the first mathematical expression and a result for the second mathematical expression, wherein the usage history is displayed in a hierarchical tree such that a result for a given mathematical expression is displayed in the second window on a different hierarchical level than the given mathematical expression; and displaying organizational tabs for the second window, wherein each organizational tab is operable to display a given category of data associated with the usage history, and wherein the results in the first window and the results in the second window are displayed simultaneously. | 1. A method of displaying in a calculator, comprising: receiving a first mathematical expression in an expression entry area on the calculator; displaying results in a first window on the calculator, wherein the results displayed in the first window comprise a result for the first mathematical expression; displaying, in a second window on the calculator, a usage history comprising the first mathematical expression, a second mathematical expression, and results displayed in the second window, wherein the results displayed in the second window comprise the result for the first mathematical expression and a result for the second mathematical expression, wherein the usage history is displayed in a hierarchical tree such that a result for a given mathematical expression is displayed in the second window on a different hierarchical level than the given mathematical expression; and displaying organizational tabs for the second window, wherein each organizational tab is operable to display a given category of data associated with the usage history, and wherein the results in the first window and the results in the second window are displayed simultaneously. 6. The method of claim 1 , wherein the given mathematical expression is displayed on a parent level and the result for the given mathematical expression is displayed on a child level under the given mathematical expression. | 0.800893 |
10,026,393 | 1 | 2 | 1. A system that converts text to speech, the system comprising: a response engine to generate a response text and a response intent based on user input; a non-lexical cue insertion engine to: receive the response text and the response intent representative of intended meaning to be conveyed by non-lexical cues; determine insertion points of non-lexical cues based on the received response intent; and insert a non-lexical cue at the insertion point within the response text to generate augmented text; and a speech synthesizer to synthesize speech from the augmented text using speech units associated with the response text and the inserted response intent. | 1. A system that converts text to speech, the system comprising: a response engine to generate a response text and a response intent based on user input; a non-lexical cue insertion engine to: receive the response text and the response intent representative of intended meaning to be conveyed by non-lexical cues; determine insertion points of non-lexical cues based on the received response intent; and insert a non-lexical cue at the insertion point within the response text to generate augmented text; and a speech synthesizer to synthesize speech from the augmented text using speech units associated with the response text and the inserted response intent. 2. The system of claim 1 , further comprising a response engine to analyze the user input and the user input intent, and to select the response text and the response intent based on the user input and the user input intent. | 0.811655 |
10,061,850 | 1 | 8 | 1. A method comprising: at a server having one or more processors and memory storing programs executable by the processors, receiving from a first user a query for one or more items of interest, the query including at least one search term; obtaining and storing results responsive to the query; after obtaining and storing the results responsive to the query: receiving from the first user a separate navigational query for a first website, wherein the navigational query includes a first identifier of the first web site, and wherein the at least one search term is absent from the navigational query; and in response to receiving the navigational query, when the query is a recent query, obtaining the at least one search term from the recent query and executing an alternate query of the first web site to yield alternate search results responsive to the alternate query within a domain of the first website, the alternate query including the at least one search term and the navigational query; and formatting for display and transmitting to the first user the alternate search results, at least one top ranking navigational search result, and at least one remaining navigational search result, wherein the at least one top ranking navigational search result, the alternate search results, and the at least one remaining navigational search result are associated with a priority attribute that indicates a priority level for display, wherein a first priority attribute is associated with the at least one top ranking navigational search result and indicates that the at least one top ranking navigational search result is to be displayed above other search results displayed on a search result page, a second priority attribute is associated with the alternate query search result and indicates that the alternate query search result is to be displayed below the at least one top ranking navigational search result in the search result page, and a third priority attribute is associated with the at least one remaining navigational search result and indicates that the at least one remaining navigational search result is to be displayed below the alternate query search result in the search result page, the first priority attribute having a highest priority level and the third priority attribute having a lowest priority level. | 1. A method comprising: at a server having one or more processors and memory storing programs executable by the processors, receiving from a first user a query for one or more items of interest, the query including at least one search term; obtaining and storing results responsive to the query; after obtaining and storing the results responsive to the query: receiving from the first user a separate navigational query for a first website, wherein the navigational query includes a first identifier of the first web site, and wherein the at least one search term is absent from the navigational query; and in response to receiving the navigational query, when the query is a recent query, obtaining the at least one search term from the recent query and executing an alternate query of the first web site to yield alternate search results responsive to the alternate query within a domain of the first website, the alternate query including the at least one search term and the navigational query; and formatting for display and transmitting to the first user the alternate search results, at least one top ranking navigational search result, and at least one remaining navigational search result, wherein the at least one top ranking navigational search result, the alternate search results, and the at least one remaining navigational search result are associated with a priority attribute that indicates a priority level for display, wherein a first priority attribute is associated with the at least one top ranking navigational search result and indicates that the at least one top ranking navigational search result is to be displayed above other search results displayed on a search result page, a second priority attribute is associated with the alternate query search result and indicates that the alternate query search result is to be displayed below the at least one top ranking navigational search result in the search result page, and a third priority attribute is associated with the at least one remaining navigational search result and indicates that the at least one remaining navigational search result is to be displayed below the alternate query search result in the search result page, the first priority attribute having a highest priority level and the third priority attribute having a lowest priority level. 8. The method of claim 1 , further comprising receiving a plurality of the recent queries included in most recent N queries received from the user, wherein N is a predefined number. | 0.888957 |
8,204,213 | 1 | 10 | 1. A processor-implemented method of performing a similarity measure of a plurality of privacy-protected data, comprising: selecting, in a processor, a first value and a first context related to one or more attributes of the first value; dividing, in the processor, the first value into a first plurality of substrings in an order preserving way; processing, in the processor, each substring of the first plurality of substrings through an obfuscation function to produce a first plurality of order preserved obfuscated substrings; selecting, in the processor, a second value and a second context related to one or more attributes of the second value; dividing, in the processor, the second value into a second plurality of substrings in the order preserving way; processing, in the processor, each substring of the second plurality of substrings through the obfuscation function to produce a second plurality of order preserved obfuscated substrings; comparing, in the processor, the first and second plurality of order preserved obfuscated substrings, and determining a value similarity measure for a comparison of the first and second values based on the comparison of the first and second plurality of order preserved obfuscated substrings; comparing, in the processor, the first context and the second context, and determining a context similarity measure for the first context and the second context based on the comparison of the first and second contexts, wherein the context similarity measure indicates a validity of the comparison between the first and second values; and determining a closeness degree between the first and second values from the context similarity measure and the value similarity measure. | 1. A processor-implemented method of performing a similarity measure of a plurality of privacy-protected data, comprising: selecting, in a processor, a first value and a first context related to one or more attributes of the first value; dividing, in the processor, the first value into a first plurality of substrings in an order preserving way; processing, in the processor, each substring of the first plurality of substrings through an obfuscation function to produce a first plurality of order preserved obfuscated substrings; selecting, in the processor, a second value and a second context related to one or more attributes of the second value; dividing, in the processor, the second value into a second plurality of substrings in the order preserving way; processing, in the processor, each substring of the second plurality of substrings through the obfuscation function to produce a second plurality of order preserved obfuscated substrings; comparing, in the processor, the first and second plurality of order preserved obfuscated substrings, and determining a value similarity measure for a comparison of the first and second values based on the comparison of the first and second plurality of order preserved obfuscated substrings; comparing, in the processor, the first context and the second context, and determining a context similarity measure for the first context and the second context based on the comparison of the first and second contexts, wherein the context similarity measure indicates a validity of the comparison between the first and second values; and determining a closeness degree between the first and second values from the context similarity measure and the value similarity measure. 10. The method of claim 1 , further comprising indicating whether the first and second values are unrelated based on a percentage of similarity. | 0.84141 |
9,836,456 | 12 | 14 | 12. A computer-implemented method, comprising: capturing, by a camera in electronic communication with a computing system having one or more processors, a first image of an object comprising a text in a source language; receiving, at the computing system and from the camera, the first image; performing, by the computing system, optical character recognition (OCR) on the first image to obtain a set of possible OCR texts, wherein each possible OCR text has a corresponding OCR score indicative of a degree of likelihood that the possible OCR text is the text; selecting, by the computing system, the possible OCR text having a highest corresponding OCR score relative to the OCR scores of the other possible OCR texts to obtain an OCR text; and when the OCR score of the OCR text is less than an OCR score threshold indicative of an acceptable degree of likelihood: outputting, by the computing system, a user instruction to capture a set of second images of at least a portion of the object using the camera; adjusting, by the computing system, an intensity of a light source while capturing, by the camera, the second set of images to increase a likelihood that an OCR score of a modified OCR text corresponding to the text and obtained from at least one of the second set of images will achieve the OCR score threshold, the light source being in electronic communication with at least one of the camera and the computing system; receiving, at the computing system and from the camera, the set of second images; performing, by the computing system, OCR on the at least one of the set of second images to obtain the modified OCR text; and outputting, by the computing system, the modified OCR text. | 12. A computer-implemented method, comprising: capturing, by a camera in electronic communication with a computing system having one or more processors, a first image of an object comprising a text in a source language; receiving, at the computing system and from the camera, the first image; performing, by the computing system, optical character recognition (OCR) on the first image to obtain a set of possible OCR texts, wherein each possible OCR text has a corresponding OCR score indicative of a degree of likelihood that the possible OCR text is the text; selecting, by the computing system, the possible OCR text having a highest corresponding OCR score relative to the OCR scores of the other possible OCR texts to obtain an OCR text; and when the OCR score of the OCR text is less than an OCR score threshold indicative of an acceptable degree of likelihood: outputting, by the computing system, a user instruction to capture a set of second images of at least a portion of the object using the camera; adjusting, by the computing system, an intensity of a light source while capturing, by the camera, the second set of images to increase a likelihood that an OCR score of a modified OCR text corresponding to the text and obtained from at least one of the second set of images will achieve the OCR score threshold, the light source being in electronic communication with at least one of the camera and the computing system; receiving, at the computing system and from the camera, the set of second images; performing, by the computing system, OCR on the at least one of the set of second images to obtain the modified OCR text; and outputting, by the computing system, the modified OCR text. 14. The computer-implemented method of claim 12 , further comprising: when the OCR score is less than the OCR score threshold, identifying, by the computing system, a portion of the first image causing the OCR score to be less than the OCR score threshold, wherein the user instruction is to capture the set of second images with respect to the identified portion of the first image. | 0.685033 |
8,436,753 | 1 | 2 | 1. A method comprising: reading compressed audio data from a first audio file, the first audio file comprising audio data compressed using a first compression algorithm and bookkeeping data having a first format, the bookkeeping data specifying a location of the compressed audio data within the first audio file; and generating a universal representation of the first audio file without decompressing and recompressing the audio data, the universal representation having bookkeeping data of a second format specifying the location of compressed audio data within the universal representation. | 1. A method comprising: reading compressed audio data from a first audio file, the first audio file comprising audio data compressed using a first compression algorithm and bookkeeping data having a first format, the bookkeeping data specifying a location of the compressed audio data within the first audio file; and generating a universal representation of the first audio file without decompressing and recompressing the audio data, the universal representation having bookkeeping data of a second format specifying the location of compressed audio data within the universal representation. 2. The method as in claim 1 wherein generating the universal representation comprises: packing the audio data compressed using the first compression algorithm into a plurality of sample buffers. | 0.891741 |
8,214,390 | 17 | 23 | 17. The non-transitory computer-readable medium of claim 14 , further comprising instructions for: generating a second set of bits based on the first set of bits wherein the second set of bits conveys at least the same information as the first set of bits; associating the second set of bits with a second version identifier that identifies a second format that is different than the first format; wherein the second set of bits comprises a second plurality of distinct subsets of bits: wherein each subset of bits of the second plurality of distinct subsets of bits corresponds to a different topic of a second set of topics; and wherein a topic represented in each of the second plurality of distinct subsets of bits, respectively, is determined according to the second format. | 17. The non-transitory computer-readable medium of claim 14 , further comprising instructions for: generating a second set of bits based on the first set of bits wherein the second set of bits conveys at least the same information as the first set of bits; associating the second set of bits with a second version identifier that identifies a second format that is different than the first format; wherein the second set of bits comprises a second plurality of distinct subsets of bits: wherein each subset of bits of the second plurality of distinct subsets of bits corresponds to a different topic of a second set of topics; and wherein a topic represented in each of the second plurality of distinct subsets of bits, respectively, is determined according to the second format. 23. The non-transitory computer-readable medium of claim 17 , further comprising instructions for: identifying a third subset of bits of the second set of bits that represents the first topic; and causing the third subset of bits to represent a value that is proportional to a value represented by the first subset of bits. | 0.911893 |
4,763,278 | 1 | 14 | 1. A method for recognizing speech independent of the speaker thereof, said method comprising: receiving an analog input speech signal; conditioning said analog speech signal to produce a sequence of rectangular waveforms of polarity signs alternating between plus and minus polarities as a digital waveform signal; counting the number of polarity transitions in the digital waveform signal to obtain a zero-crossing count for each frame of the digital waveform signal; measuring the time duration intervals between zero-crossings of the digital waveform signal; providing a sequence of binary feature vectors based upon the measurements of the time duration intervals between zero-crossings of the digital waveform signal and corresponding to respective frames of the digital waveform signal; providing a vocabulary consisting of a relatively small number of words, wherein each of the words included in the vocabulary is represented by a plurality of binary reference vectors which have been organized in sequences with each of said binary reference vector sequences corresponding to a word acoustically distinct from the other words included in the vocabulary; comparing each of said binary feature vectors with each of said plurality of binary reference vectors; determining a distance measure with respect to each of said binary reference vectors for each successive binary feature vector in said sequence of binary feature vectors in response to the comparison therebetween; and recognizing words in accordance with the distance measures between each of said binary reference vector sequences and successively received binary feature vectors corresponding to respective frames of the digital waveform signal. | 1. A method for recognizing speech independent of the speaker thereof, said method comprising: receiving an analog input speech signal; conditioning said analog speech signal to produce a sequence of rectangular waveforms of polarity signs alternating between plus and minus polarities as a digital waveform signal; counting the number of polarity transitions in the digital waveform signal to obtain a zero-crossing count for each frame of the digital waveform signal; measuring the time duration intervals between zero-crossings of the digital waveform signal; providing a sequence of binary feature vectors based upon the measurements of the time duration intervals between zero-crossings of the digital waveform signal and corresponding to respective frames of the digital waveform signal; providing a vocabulary consisting of a relatively small number of words, wherein each of the words included in the vocabulary is represented by a plurality of binary reference vectors which have been organized in sequences with each of said binary reference vector sequences corresponding to a word acoustically distinct from the other words included in the vocabulary; comparing each of said binary feature vectors with each of said plurality of binary reference vectors; determining a distance measure with respect to each of said binary reference vectors for each successive binary feature vector in said sequence of binary feature vectors in response to the comparison therebetween; and recognizing words in accordance with the distance measures between each of said binary reference vector sequences and successively received binary feature vectors corresponding to respective frames of the digital waveform signal. 14. The method of claim 1, wherein said conditioning step includes the performance of an operation corresponding to differentiation of said analog input speech signal. | 0.947682 |
9,275,139 | 12 | 15 | 12. A system to search audio data, comprising: a receiver configured to receive audio data representing speech; a receiver configured to receive a search query related to the audio data; a processor configured to compile the search query into a hierarchy of scored speech recognition sub-searches; an audio search engine operating in an audio domain configured to search the audio data for speech identified by one or more of the sub-searches to produce hits; and a processor configured to combine the hits by use of at least one combination function to provide a composite search score of the audio data, wherein at least one of the combination functions comprises an at-least-M-of-N function, wherein the at-least-M-of-N function produces a high score when at least M of N function inputs exceed a predetermined threshold value, wherein the composite search score may be determined in accordance with the following relationship: L ab ( x ) = 1 1 + ⅇ a ( x - b ) , wherein: x comprises a vector of scores associated with the hits; a and b comprise sensitivity vectors; and L ab (x) comprises the composite search score. | 12. A system to search audio data, comprising: a receiver configured to receive audio data representing speech; a receiver configured to receive a search query related to the audio data; a processor configured to compile the search query into a hierarchy of scored speech recognition sub-searches; an audio search engine operating in an audio domain configured to search the audio data for speech identified by one or more of the sub-searches to produce hits; and a processor configured to combine the hits by use of at least one combination function to provide a composite search score of the audio data, wherein at least one of the combination functions comprises an at-least-M-of-N function, wherein the at-least-M-of-N function produces a high score when at least M of N function inputs exceed a predetermined threshold value, wherein the composite search score may be determined in accordance with the following relationship: L ab ( x ) = 1 1 + ⅇ a ( x - b ) , wherein: x comprises a vector of scores associated with the hits; a and b comprise sensitivity vectors; and L ab (x) comprises the composite search score. 15. The system of claim 12 wherein the composite search score comprises an attribute with an associated score and or more associated time intervals. | 0.655814 |
10,158,639 | 9 | 11 | 9. The non-transitory, tangible computer-readable medium of claim 8 , wherein the instructions to generate a redacted credit report template from among the plurality of redacted credit report templates comprises instructions that, when executed by the processor, cause the processor to: open an unredacted credit report, which contains personal information and is formatted in portable document format (PDF), via a first software application; remove the personal information contained in the unredacted credit report via the first software application to generate a redacted credit report in PDF; save the redacted credit report in PDF via the first software application; open the redacted credit report in PDF with a second software application, the second software application being associated with word processing functionality, wherein upon opening the redacted credit report with the second software application, the second software application causes the redacted credit report in PDF to be reflowed and formatted into an editable word processing file; and edit and save the redacted credit report with the second software application to generate the redacted credit report template. | 9. The non-transitory, tangible computer-readable medium of claim 8 , wherein the instructions to generate a redacted credit report template from among the plurality of redacted credit report templates comprises instructions that, when executed by the processor, cause the processor to: open an unredacted credit report, which contains personal information and is formatted in portable document format (PDF), via a first software application; remove the personal information contained in the unredacted credit report via the first software application to generate a redacted credit report in PDF; save the redacted credit report in PDF via the first software application; open the redacted credit report in PDF with a second software application, the second software application being associated with word processing functionality, wherein upon opening the redacted credit report with the second software application, the second software application causes the redacted credit report in PDF to be reflowed and formatted into an editable word processing file; and edit and save the redacted credit report with the second software application to generate the redacted credit report template. 11. The non-transitory, tangible computer-readable medium of claim 9 , further storing machine readable instructions that, when executed by a processor, cause the processor to: compare content included in the portions of the sent email messages as specified by the detection rule to content included in each of the plurality of credit report templates; and calculate, for each comparison made between the content included in portions of the sent email messages and content included in each of the plurality of credit report templates, an initial document exposure score, wherein the initial document exposure score is a scaled percentage that indicates, for a higher percentage value, a greater similarity between the content included in portions of the sent email messages and content included in each of the plurality of credit report templates. | 0.703015 |
9,589,198 | 10 | 11 | 10. A computer system for text input and detection of a keyword within a printed page or a screen, the computer system comprising: a processor; and a memory with computer code instructions stored thereon, the processor and the memory, with the computer code instructions, being configured to cause the system to: detect a plurality of word blocks contained in a captured image of a printed page or a screen; determine candidate keyword blocks among the plurality of word blocks according to a keyword probability determination rule that results in a respective probability value for each word block, wherein the keyword probability determination rule is based at least in part on a spatial analysis of the word blocks relative to at least a portion of the captured image, the spatial analysis being relative to an indication of a user intention of a keyword to obtain for selection and where the candidate keyword blocks are identified among the plurality of word blocks based upon each respective probability value of the candidate keyword blocks being above a threshold; and upon selection of a candidate keyword block, forward content of the selected keyword block as text input to an application. | 10. A computer system for text input and detection of a keyword within a printed page or a screen, the computer system comprising: a processor; and a memory with computer code instructions stored thereon, the processor and the memory, with the computer code instructions, being configured to cause the system to: detect a plurality of word blocks contained in a captured image of a printed page or a screen; determine candidate keyword blocks among the plurality of word blocks according to a keyword probability determination rule that results in a respective probability value for each word block, wherein the keyword probability determination rule is based at least in part on a spatial analysis of the word blocks relative to at least a portion of the captured image, the spatial analysis being relative to an indication of a user intention of a keyword to obtain for selection and where the candidate keyword blocks are identified among the plurality of word blocks based upon each respective probability value of the candidate keyword blocks being above a threshold; and upon selection of a candidate keyword block, forward content of the selected keyword block as text input to an application. 11. The computer system of claim 10 wherein the processor and the memory, with the computer code instructions, are further configured to cause the system to: display the captured image; perform digital image filtering of the captured image that includes at least one of contrast enhancement, shadow compensation, unwarping, and rotation of the captured image to obtain an artifact reduce image with a substantially horizontal text alignment, wherein the detection of the plurality of word blocks is based on the artifact reduced image; perform optical character recognition (OCR) within each word block to obtain its text content; assign an attribute to each candidate keyword block; indicate the candidate keyword blocks in the display by a frame or a background color and display the attributes as overlays within the artifact reduced and displayed image for the selection of the keyword; the selection of the candidate keyword block based on the displayed attribute; and upon the selection of the candidate keyword block, display the text content of the selected candidate keyword block. | 0.500458 |
4,674,066 | 1 | 2 | 1. A digital data processing apparatus for information retrieval, said apparatus comprising A. input means for accepting a signal representative of a search linguistic expression in conventional textual reoresentation. B database storage means for storing signals representative of plural textual expressions and information pertaining thereto, C. database matching means in circuit with said input means and with said database storage means for locating within said database a linguistic expression matching or similar to said search linguistic expression, said database matching means including skeletonization means for converting at least one said database linguistic expression to a linguistically salient word skeleton, and for converting said search linguistic expression, or a modified form thereof, to a linguistically salient word skeleton, said converting means comprising i. means for eliminating from the word skeleton produced thereby a selected alpha set, if any, of the expression being converted which lacks isomorphy with a phonetic representation of that selected set, and ii means for replacing with a different linguistic symbol another selected alpha set, if any, of the expression being converted which lacks isomorphy with a phonetic representation of that other selected set, D. output means in circuit with said matching means for generating a signal indicative of the success of locating at least one database linguistic expression matching or similar to said search linguistic expression and for generating signals representative of information pertaining to the matching or similar database linguistic expressions, if any. | 1. A digital data processing apparatus for information retrieval, said apparatus comprising A. input means for accepting a signal representative of a search linguistic expression in conventional textual reoresentation. B database storage means for storing signals representative of plural textual expressions and information pertaining thereto, C. database matching means in circuit with said input means and with said database storage means for locating within said database a linguistic expression matching or similar to said search linguistic expression, said database matching means including skeletonization means for converting at least one said database linguistic expression to a linguistically salient word skeleton, and for converting said search linguistic expression, or a modified form thereof, to a linguistically salient word skeleton, said converting means comprising i. means for eliminating from the word skeleton produced thereby a selected alpha set, if any, of the expression being converted which lacks isomorphy with a phonetic representation of that selected set, and ii means for replacing with a different linguistic symbol another selected alpha set, if any, of the expression being converted which lacks isomorphy with a phonetic representation of that other selected set, D. output means in circuit with said matching means for generating a signal indicative of the success of locating at least one database linguistic expression matching or similar to said search linguistic expression and for generating signals representative of information pertaining to the matching or similar database linguistic expressions, if any. 2. An apparatus according to claim 1 wherein said database matching means comprises target modification means in circuit with said skeletonization means for executing the steps of A. selectively modifying said search word skeleton by replacing a set of one or more skeleton symbols with a different set of such symbols, B. comparing said modified search skeleton with a linguistically salient word skeleton of at least one said database linguistic expression, and C. selectively repeating said modifying step and said comparing step. | 0.500936 |
10,083,031 | 17 | 18 | 17. The computer program product of claim 16 , wherein said product is a software application product, said product further comprising instructions for: storing, at the memory, features data relating to said software application, the feature data spanning at least one or more software application versions released over time; automatically extracting said stored feature related data of said product, said stored feature data comprising one or more of: an application description and version release logs relating to said released software application product versions; and implementing, by said programmed processor, natural language processing (NLP) applied to said application description and version release logs to identify said one or more structured features, said structured features comprising: umbrella features (UF) and low-level features each release version introduces, improves or deletes. | 17. The computer program product of claim 16 , wherein said product is a software application product, said product further comprising instructions for: storing, at the memory, features data relating to said software application, the feature data spanning at least one or more software application versions released over time; automatically extracting said stored feature related data of said product, said stored feature data comprising one or more of: an application description and version release logs relating to said released software application product versions; and implementing, by said programmed processor, natural language processing (NLP) applied to said application description and version release logs to identify said one or more structured features, said structured features comprising: umbrella features (UF) and low-level features each release version introduces, improves or deletes. 18. The computer program product of claim 17 , wherein for building a behavior evolution model for a software application, said product further comprising instructions causing the processor to perform: obtaining the application name, historical version labels, release timestamps from each released version, and rating information of each version of the application; and tracking application versions by linking versions with release timestamps and said rating information, said building said behavior evolution model comprising linking features and release versions with change labels, said change labels being labels introduced, deleted or refined. | 0.821722 |
8,909,708 | 1 | 7 | 1. A computer-implemented method for confirming authorship of documents, performed on a server having at least one processor and memory storing at least one program for execution by the at least one processor to perform the method, comprising: accessing a first document hosted on a first website of a first domain, the first document being indirectly linked to a second document through at least one link in a chain of links, a respective link in the chain of links including a first predefined authorship attribute asserting authorship of a respective document including the respective link by a respective entity associated with a respective target document of the respective link; and conditionally confirming authorship of the first document by an entity associated with the second document when the second document includes a second link to the first website of the first domain, the second link including a second predefined authorship attribute indicating that the entity associated with the second document is an author of or contributor to content at the first website of the first domain. | 1. A computer-implemented method for confirming authorship of documents, performed on a server having at least one processor and memory storing at least one program for execution by the at least one processor to perform the method, comprising: accessing a first document hosted on a first website of a first domain, the first document being indirectly linked to a second document through at least one link in a chain of links, a respective link in the chain of links including a first predefined authorship attribute asserting authorship of a respective document including the respective link by a respective entity associated with a respective target document of the respective link; and conditionally confirming authorship of the first document by an entity associated with the second document when the second document includes a second link to the first website of the first domain, the second link including a second predefined authorship attribute indicating that the entity associated with the second document is an author of or contributor to content at the first website of the first domain. 7. The computer-implemented method of claim 1 , wherein the second link links to a root of the first website of the first domain. | 0.873529 |
8,358,747 | 1 | 5 | 1. A computer-implemented method of recognizing a voice input received by an interactive voice recognition system, the computer-implemented method comprising: receiving an initial caller voice input from a caller, wherein the initial caller voice input is the caller saying an unintelligible phrase caused by a speech limitation of the caller; a processor determining that the initial caller voice input is a computer-unintelligible voice input that does not match any entry from a lexicon of known voice inputs; prompting the caller to transmit a secondary input to clarify the computer-unintelligible voice input, wherein the secondary input is a dual-tone multi-frequency (DTMF) phone keypad input from the caller that identifies a user-requested activity that the caller was requesting when saying the unintelligible phrase; utilizing the secondary input to match the computer-unintelligible voice input with a specific known voice input from the lexicon of known voice inputs; and updating the lexicon of known voice inputs with the computer-unintelligible voice input, wherein the computer-unintelligible voice input is matched to the specific known voice input from the lexicon of known voice inputs; matching the unintelligible phrase to the user-requested activity in a database that is specific for the caller; receiving the unintelligible phrase in a subsequent phone call from the user; and matching the unintelligible phrase to the user-requested activity for the caller. | 1. A computer-implemented method of recognizing a voice input received by an interactive voice recognition system, the computer-implemented method comprising: receiving an initial caller voice input from a caller, wherein the initial caller voice input is the caller saying an unintelligible phrase caused by a speech limitation of the caller; a processor determining that the initial caller voice input is a computer-unintelligible voice input that does not match any entry from a lexicon of known voice inputs; prompting the caller to transmit a secondary input to clarify the computer-unintelligible voice input, wherein the secondary input is a dual-tone multi-frequency (DTMF) phone keypad input from the caller that identifies a user-requested activity that the caller was requesting when saying the unintelligible phrase; utilizing the secondary input to match the computer-unintelligible voice input with a specific known voice input from the lexicon of known voice inputs; and updating the lexicon of known voice inputs with the computer-unintelligible voice input, wherein the computer-unintelligible voice input is matched to the specific known voice input from the lexicon of known voice inputs; matching the unintelligible phrase to the user-requested activity in a database that is specific for the caller; receiving the unintelligible phrase in a subsequent phone call from the user; and matching the unintelligible phrase to the user-requested activity for the caller. 5. The computer-implemented method of claim 1 , wherein the lexicon of known voice inputs is exclusive to the caller. | 0.942421 |
8,330,844 | 12 | 14 | 12. A non-transitory computer readable medium storing a computer program for processing a plurality of images on a device, said computer program comprising: a set of instructions for displaying, in a first display area, different groups of images imported during different import sessions; a set of instructions for associating different sets of images from the first display area with different digital photo albums; a set of instructions for displaying each particular digital photo album as a user selectable item, wherein a selection of a selectable item corresponding to a particular digital photo album causes the first display area to only display a set of images associated with the particular digital photo album, wherein the first display area displays all the images imported when no selectable item corresponding to a digital album is selected; a set of instructions for receiving a selection of a grouping tool; and a set of instructions for grouping, in response to the selection of the grouping tool, the images in the first display area into the different groups according to the different import sessions by displaying a group divider icon between each of two different groups of images. | 12. A non-transitory computer readable medium storing a computer program for processing a plurality of images on a device, said computer program comprising: a set of instructions for displaying, in a first display area, different groups of images imported during different import sessions; a set of instructions for associating different sets of images from the first display area with different digital photo albums; a set of instructions for displaying each particular digital photo album as a user selectable item, wherein a selection of a selectable item corresponding to a particular digital photo album causes the first display area to only display a set of images associated with the particular digital photo album, wherein the first display area displays all the images imported when no selectable item corresponding to a digital album is selected; a set of instructions for receiving a selection of a grouping tool; and a set of instructions for grouping, in response to the selection of the grouping tool, the images in the first display area into the different groups according to the different import sessions by displaying a group divider icon between each of two different groups of images. 14. The non-transitory computer readable medium of claim 12 , wherein the computer program further comprises a set of instructions for editing a particular image selected in the first display area by removing redeye from the particular image. | 0.831944 |
7,761,298 | 10 | 12 | 10. The non-transitory computer-readable storage medium of claim 9 , wherein documents relates to a first document based at least on a frame of time. | 10. The non-transitory computer-readable storage medium of claim 9 , wherein documents relates to a first document based at least on a frame of time. 12. The non-transitory computer-readable storage medium of claim 10 , the method further comprising adding at least one word from the documents to the first document. | 0.905251 |
9,753,921 | 1 | 2 | 1. A method in a document management system, wherein each user of the document management system is associated with a user identifier, the method comprising: storing a document in a document management system, wherein the document comprises text portions, each text portion authored by a user; receiving a comment for the document, the comment associated with a selected text span in the document; creating a thread, the thread having a comment list, a text span element, an audience, and a notification element; associating the selected text span with the text span element of the thread; associating the comment with the comment list of the thread; determining each user who authored a text portion of the document that overlaps the text span for the thread, and including the user identifier of each determined user in the audience element of the thread; identifying in the selected text span each user primitive mentioning a user, each user primitive comprising a predetermined token followed by a user name of a user, and including a user identifier associated with each identified user primitive in the audience element of the thread; transmitting to each user having a user identifier in the audience element of the thread a notification message, the notification message including a link including addressing information to access the document and the comment in the document management system. | 1. A method in a document management system, wherein each user of the document management system is associated with a user identifier, the method comprising: storing a document in a document management system, wherein the document comprises text portions, each text portion authored by a user; receiving a comment for the document, the comment associated with a selected text span in the document; creating a thread, the thread having a comment list, a text span element, an audience, and a notification element; associating the selected text span with the text span element of the thread; associating the comment with the comment list of the thread; determining each user who authored a text portion of the document that overlaps the text span for the thread, and including the user identifier of each determined user in the audience element of the thread; identifying in the selected text span each user primitive mentioning a user, each user primitive comprising a predetermined token followed by a user name of a user, and including a user identifier associated with each identified user primitive in the audience element of the thread; transmitting to each user having a user identifier in the audience element of the thread a notification message, the notification message including a link including addressing information to access the document and the comment in the document management system. 2. The method of claim 1 , further comprising: identifying in the received comment each user primitive mentioning a user; and including the user identifier associated with each identified user primitive in the audience element of the thread. | 0.847468 |
8,886,650 | 7 | 12 | 7. A method for optimizing content on a topic page, comprising: receiving a query for a topic; identifying a plurality of content modules from anyone of a branded source or an un-branded source that match one or more parameters of the query; computing one or more module performance indicators for each of the identified plurality of content modules for the topic based on the one or more parameters, the module performance indicator defined as a product of weight of each module performance indicator and value associated with the module performance indicator of each of the identified plurality of content modules; generating an aggregate module performance indicator for each of the plurality of content modules; selecting one or more of the content modules from the identified plurality of content modules from anyone of the branded or un-branded sources for rendering on the topic page based on the aggregate module performance indicators associated with each content module for the topic so as to provide optimal content for the query, wherein the topic page includes content modules from just the branded source, just the un-branded source or an aggregate of both the branded source and un branded source, wherein a module performance indicator for each of the one or more content modules is computed by measuring deviation of actual user interaction at the respective content module against an expected user interaction for the content module, wherein the expected user interaction is available at a source of the content module and actual user interaction is obtained from a historical log maintained for the content module. | 7. A method for optimizing content on a topic page, comprising: receiving a query for a topic; identifying a plurality of content modules from anyone of a branded source or an un-branded source that match one or more parameters of the query; computing one or more module performance indicators for each of the identified plurality of content modules for the topic based on the one or more parameters, the module performance indicator defined as a product of weight of each module performance indicator and value associated with the module performance indicator of each of the identified plurality of content modules; generating an aggregate module performance indicator for each of the plurality of content modules; selecting one or more of the content modules from the identified plurality of content modules from anyone of the branded or un-branded sources for rendering on the topic page based on the aggregate module performance indicators associated with each content module for the topic so as to provide optimal content for the query, wherein the topic page includes content modules from just the branded source, just the un-branded source or an aggregate of both the branded source and un branded source, wherein a module performance indicator for each of the one or more content modules is computed by measuring deviation of actual user interaction at the respective content module against an expected user interaction for the content module, wherein the expected user interaction is available at a source of the content module and actual user interaction is obtained from a historical log maintained for the content module. 12. The method of claim 7 , wherein measuring deviation of actual user interaction is by measuring click rates at the content module of a plurality of users with similar demographics as a current user and comparing against expected click rate for the content module from the source of the content module. | 0.690428 |
8,065,609 | 6 | 7 | 6. A computer program product comprising a computer readable storage device storing executable instructions for generating a survey, the executable instructions comprising: instructions for storing an XML survey document in a memory of a first computer system, wherein the XML survey document comprises a plurality of questions and corresponding answer options, a root node and a plurality of sub-nodes branching from the root node, wherein each question and corresponding answer options are defined as XML data elements, wherein attributes define the associations among the XML data elements and define question branches; instructions for sending programming instructions to a second computer system for execution as an applet in a browser of the second computer system and a document type definition file, wherein the execution of the programming instructions as an applet causes the second computer system to parse the data elements into a plurality of data arrays using the document type definition file, wherein each data array in the plurality of data arrays comprises a hash table and cross-references defining associations among each question and corresponding answer options in the plurality of questions and corresponding answer options and identifying additional questions and corresponding answer options; instructions for providing a question and corresponding answer options, from the plurality of questions and corresponding answer options, to a user on the second computer system; instructions for receiving a user input comprising user selected answer options responsive to the provided question; instructions for traversing the each data array to determine whether the user selected answer options identifies additional questions and corresponding answer options; and instructions for presenting the additional questions and corresponding answer options to the user on the second computer system responsive to determining that the user selected answer options identifies the additional questions and corresponding answer options. | 6. A computer program product comprising a computer readable storage device storing executable instructions for generating a survey, the executable instructions comprising: instructions for storing an XML survey document in a memory of a first computer system, wherein the XML survey document comprises a plurality of questions and corresponding answer options, a root node and a plurality of sub-nodes branching from the root node, wherein each question and corresponding answer options are defined as XML data elements, wherein attributes define the associations among the XML data elements and define question branches; instructions for sending programming instructions to a second computer system for execution as an applet in a browser of the second computer system and a document type definition file, wherein the execution of the programming instructions as an applet causes the second computer system to parse the data elements into a plurality of data arrays using the document type definition file, wherein each data array in the plurality of data arrays comprises a hash table and cross-references defining associations among each question and corresponding answer options in the plurality of questions and corresponding answer options and identifying additional questions and corresponding answer options; instructions for providing a question and corresponding answer options, from the plurality of questions and corresponding answer options, to a user on the second computer system; instructions for receiving a user input comprising user selected answer options responsive to the provided question; instructions for traversing the each data array to determine whether the user selected answer options identifies additional questions and corresponding answer options; and instructions for presenting the additional questions and corresponding answer options to the user on the second computer system responsive to determining that the user selected answer options identifies the additional questions and corresponding answer options. 7. The computer program product of claim 6 wherein each sub-node in the plurality of the sub-nodes comprises attributes defining categories for each question and corresponding answer options in the plurality of questions and corresponding answer options. | 0.930752 |
8,527,893 | 1 | 2 | 1. A system, comprising: a processor; and a taxonomy editor configured to execute on the processor to generate a visual representation of a taxonomy associated with a set of scientific papers, the taxonomy editor comprising: a properties module configured to identify one or more properties relating to an individual node of the taxonomy, the one or more properties reflecting a number of scientific papers assigned to the individual node in recent years; a statistics module configured to determine a trend relating to the number of scientific papers assigned to the individual node in recent years; and a suggestion module configured to utilize the one or more properties and the trend to, in at least one instance when the individual node is not a leaf node and the trend indicates that the number of scientific papers assigned to the individual node in recent years is decreasing, provide a suggested modification to a user to collapse at least two children leaf nodes of the individual node into the individual node and cause the individual node to become a leaf node of the taxonomy. | 1. A system, comprising: a processor; and a taxonomy editor configured to execute on the processor to generate a visual representation of a taxonomy associated with a set of scientific papers, the taxonomy editor comprising: a properties module configured to identify one or more properties relating to an individual node of the taxonomy, the one or more properties reflecting a number of scientific papers assigned to the individual node in recent years; a statistics module configured to determine a trend relating to the number of scientific papers assigned to the individual node in recent years; and a suggestion module configured to utilize the one or more properties and the trend to, in at least one instance when the individual node is not a leaf node and the trend indicates that the number of scientific papers assigned to the individual node in recent years is decreasing, provide a suggested modification to a user to collapse at least two children leaf nodes of the individual node into the individual node and cause the individual node to become a leaf node of the taxonomy. 2. The system of claim 1 , wherein the properties module is further configured to populate a node properties region of the visual representation with the one or more properties. | 0.777078 |
9,864,674 | 19 | 20 | 19. A system comprising: a communication interface configured to receive, from an application prototyping tool: an interactive wireframe representation of a graphical user interface (GUI) of an application, and application behavior data for the application, wherein both the interactive wireframe representation and the application behavior data were captured by the application prototyping tool; a GUI information database configured to store the interactive wireframe representation and the application behavior data after the prototyping tool captures the interactive wireframe representation and the application behavior data; test case generation circuitry in communication with the GUI information database, the test case generation circuitry configured to: extract GUI information from the interactive wireframe representation and the application behavior data stored in the GUI information database, wherein the GUI information comprises Graphical User Interface Components (GUIC), GUIC behavior, and GUIC events for the GUI, wherein the GUIC comprises a screen component, a display component, an input/output component, an actionable component, or any combination thereof; determine relationships between the GUICs and the GUIC events as part of the GUI information, wherein the GUI information comprises component conditional event clauses (CCEC) specifying conditions and component events, wherein the CCEC further comprises component conditional clauses (CCC) and component event clauses (CEC), wherein the test case generation circuitry is configured to associate the CCC and the CEC with the GUIC to determine the relationships; determine semantic knowledge from the relationships between the GUICs and the GUIC events, and store the semantic knowledge in a semantic knowledge database; generate a summarized model of the GUI from the GUI information that describes GUI components categorized into one of at least a screen component, an actionable component, an input/output component, or a display component; generate a screen model for selected screens of the GUI using a subset of extracted GUI information in the summarized model, wherein the screen model comprises a behavioral flow for each of the selected screens, and the subset of the extracted GUI information for generating the screen model comprises the relationships between the GUICs and structural positioning of the GUICs; generate an application model by combining the screen models for each of the selected screens into a unified representation according to the behavioral flow for each of the selected screens; traverse the application model to generate a test path comprising a sequence of the GUICs and event types for the GUICs; and generate test cases using the sequence of the GUICs and the event types included in the test path and the semantic knowledge stored in the semantic knowledge database for the GUI; and display generation circuitry configured to display the screen model and the application model as a control flow graph, and display the generated test cases in a test case window. | 19. A system comprising: a communication interface configured to receive, from an application prototyping tool: an interactive wireframe representation of a graphical user interface (GUI) of an application, and application behavior data for the application, wherein both the interactive wireframe representation and the application behavior data were captured by the application prototyping tool; a GUI information database configured to store the interactive wireframe representation and the application behavior data after the prototyping tool captures the interactive wireframe representation and the application behavior data; test case generation circuitry in communication with the GUI information database, the test case generation circuitry configured to: extract GUI information from the interactive wireframe representation and the application behavior data stored in the GUI information database, wherein the GUI information comprises Graphical User Interface Components (GUIC), GUIC behavior, and GUIC events for the GUI, wherein the GUIC comprises a screen component, a display component, an input/output component, an actionable component, or any combination thereof; determine relationships between the GUICs and the GUIC events as part of the GUI information, wherein the GUI information comprises component conditional event clauses (CCEC) specifying conditions and component events, wherein the CCEC further comprises component conditional clauses (CCC) and component event clauses (CEC), wherein the test case generation circuitry is configured to associate the CCC and the CEC with the GUIC to determine the relationships; determine semantic knowledge from the relationships between the GUICs and the GUIC events, and store the semantic knowledge in a semantic knowledge database; generate a summarized model of the GUI from the GUI information that describes GUI components categorized into one of at least a screen component, an actionable component, an input/output component, or a display component; generate a screen model for selected screens of the GUI using a subset of extracted GUI information in the summarized model, wherein the screen model comprises a behavioral flow for each of the selected screens, and the subset of the extracted GUI information for generating the screen model comprises the relationships between the GUICs and structural positioning of the GUICs; generate an application model by combining the screen models for each of the selected screens into a unified representation according to the behavioral flow for each of the selected screens; traverse the application model to generate a test path comprising a sequence of the GUICs and event types for the GUICs; and generate test cases using the sequence of the GUICs and the event types included in the test path and the semantic knowledge stored in the semantic knowledge database for the GUI; and display generation circuitry configured to display the screen model and the application model as a control flow graph, and display the generated test cases in a test case window. 20. The system of claim 19 , wherein the GUI information further comprises annotations, wherein: the test case generation circuitry is configured to use the annotations to capture an internal behavioral event, or an external behavior event, or semantic knowledge associated with the GUIC, or any combination thereof; and the test case generation circuitry is configured to capture the annotations by prefixing a pre-selected tag, followed by an annotation category, where the annotation category comprises the internal behavioral event, the external behavior event, and the semantic knowledge wherein: the internal behavioral event comprises a backward dependency component (BDC), a forward dependency component (FDC), the CCEC and component direct event clause (CDEC), and the external behavioral event comprises an external user interface application (EUIA), external service call (ESC), and functional semantics (FS). | 0.500543 |
9,997,157 | 1 | 4 | 1. One or more computer storage media having computer-executable instructions embodied thereon that, when executed by a computing system having a processor and memory, cause the computing system to personalize a language model for a particular target user based on user history information, the computer-executable instructions causing the computing system to: receive usage history information for a target user from one or more sources; parse the usage history information to identify entities and user actions associated with the entities; access a generalized knowledge source that is not personalized for the user, wherein the generalized knowledge source comprises indicators of relationships between entities in a domain; map the identified entities and the identified user actions to the generalized knowledge source, thereby creating a personalized knowledge source, the personalized knowledge source comprising indicators of relationships between the identified entities and the identified user actions, and the entities in the domain, the indicators comprising probabilities associated with the relationships, and the mapping comprising at least one of incrementing a count of one or more entities or calculating a weight of one or more entities; utilize the entities, relationships, and probabilities in the personalized knowledge source to build a personal language model for the target user; and utilize the personal language model for computer-performed speech recognition or spoken language understanding for the target user. | 1. One or more computer storage media having computer-executable instructions embodied thereon that, when executed by a computing system having a processor and memory, cause the computing system to personalize a language model for a particular target user based on user history information, the computer-executable instructions causing the computing system to: receive usage history information for a target user from one or more sources; parse the usage history information to identify entities and user actions associated with the entities; access a generalized knowledge source that is not personalized for the user, wherein the generalized knowledge source comprises indicators of relationships between entities in a domain; map the identified entities and the identified user actions to the generalized knowledge source, thereby creating a personalized knowledge source, the personalized knowledge source comprising indicators of relationships between the identified entities and the identified user actions, and the entities in the domain, the indicators comprising probabilities associated with the relationships, and the mapping comprising at least one of incrementing a count of one or more entities or calculating a weight of one or more entities; utilize the entities, relationships, and probabilities in the personalized knowledge source to build a personal language model for the target user; and utilize the personal language model for computer-performed speech recognition or spoken language understanding for the target user. 4. The one or more computer storage media of claim 1 , wherein the one or more sources comprise one or more query logs associated with the target user, websites visited by the target user, online purchase history of the target user; social networking interactions performed by the target user, or actions taken on a user device by the target user. | 0.609234 |
9,761,247 | 11 | 13 | 11. A conversational understanding system comprising: a processor; and memory storing computer-executable instructions that, when executed, causes the processor to perform a method comprising: receive an utterance from a user; parse the utterance into one or more speech segments; extract prosodic features from the one or more speech segments; generate a score for the received utterance based on the prosodic features, wherein generating the score is word-independent, context-independent, and speaker-independent; determine an intended addressee of the received utterance based on the generated score, wherein the intended addressee is one of a human and a computer; in response to determining that the intended addressee is the processor, generate a response for the received utterance; and output the response to the user. | 11. A conversational understanding system comprising: a processor; and memory storing computer-executable instructions that, when executed, causes the processor to perform a method comprising: receive an utterance from a user; parse the utterance into one or more speech segments; extract prosodic features from the one or more speech segments; generate a score for the received utterance based on the prosodic features, wherein generating the score is word-independent, context-independent, and speaker-independent; determine an intended addressee of the received utterance based on the generated score, wherein the intended addressee is one of a human and a computer; in response to determining that the intended addressee is the processor, generate a response for the received utterance; and output the response to the user. 13. The system of claim 11 , wherein the method further comprises: extracting energy-related features from the received utterance using fixed-length temporal windows within the received utterance; and determining the intended addressee based on the energy-related features. | 0.632075 |
10,056,083 | 6 | 7 | 6. The method of claim 5 , further comprising: updating the predefined weight of each of the one or more first nodes and the predefined weight of each of the one or more second nodes in the generated graph. | 6. The method of claim 5 , further comprising: updating the predefined weight of each of the one or more first nodes and the predefined weight of each of the one or more second nodes in the generated graph. 7. The method of claim 6 , wherein the updating of the predefined weight comprises determining a weight for each node of the one or more first nodes and the one or more second nodes using
minΣ( i,j )∈ E|a i −a j | where E corresponds to an extended keyword graph, a i corresponds to a weight by which a unigram probability estimate for keyword I is incremented, and a j is defined for keywords in set M=L∪D, L and D correspond to nodes and edges. | 0.892925 |
8,271,864 | 39 | 43 | 39. A method for representing a position-coded product in a digital pen system, the method comprising: creating an electronic document file of a predetermined format, the electronic document file comprising a set of document pages; adding to the electronic document file at least one pattern license file including addresses corresponding to a set of pattern pages having a given ordering, the at least one pattern license file further including a starting page address and a license parameter identifying at least one property of the at least one pattern license file, each of the addresses in the at least one pattern license file identifying at least one pattern page included in the set of pattern pages, wherein each of the pattern pages is a unique part of a position-coding pattern, and the at least one pattern license file associates the set of pattern pages with the position-coding pattern before and independent of an action of printing copies of the position-coded product; activating the electronic document file for a number of product copies, wherein each product copy contains the set of document pages, and wherein the document pages are implicitly associated, in copy for copy order, with the pattern pages identified by the at least one pattern license file; printing a second number of the activated product copies by deriving the document pages and the associated pattern pages based on the electronic document file; and indicating the activated product copies thus-printed in the electronic document file. | 39. A method for representing a position-coded product in a digital pen system, the method comprising: creating an electronic document file of a predetermined format, the electronic document file comprising a set of document pages; adding to the electronic document file at least one pattern license file including addresses corresponding to a set of pattern pages having a given ordering, the at least one pattern license file further including a starting page address and a license parameter identifying at least one property of the at least one pattern license file, each of the addresses in the at least one pattern license file identifying at least one pattern page included in the set of pattern pages, wherein each of the pattern pages is a unique part of a position-coding pattern, and the at least one pattern license file associates the set of pattern pages with the position-coding pattern before and independent of an action of printing copies of the position-coded product; activating the electronic document file for a number of product copies, wherein each product copy contains the set of document pages, and wherein the document pages are implicitly associated, in copy for copy order, with the pattern pages identified by the at least one pattern license file; printing a second number of the activated product copies by deriving the document pages and the associated pattern pages based on the electronic document file; and indicating the activated product copies thus-printed in the electronic document file. 43. The method of claim 39 , further comprising providing the activated electronic document file, or part thereof, to an application program for processing position data recorded by a digital pen from one or more of the printed product copies. | 0.582474 |
10,147,038 | 4 | 5 | 4. The method of claim 1 , wherein the plurality of tasks comprise game tasks. | 4. The method of claim 1 , wherein the plurality of tasks comprise game tasks. 5. The method of claim 4 , wherein the plurality of tasks comprise character action tasks. | 0.95648 |
8,626,862 | 1 | 19 | 1. A method comprising: accessing, by one or more computers of a first person, information for a graphical user interface that when rendered by the one or more computers displays an identifying characteristic associated with a second person's contact information; detecting, by the one or more computers, the first's person selection of a hotkey combination that specifies that the first user has selected textual information in the graphical user interface; identifying, based on detection of the hotkey combination, that the selected textual information is the identifying characteristic displayed in the graphical user interface; determining, by the one or more computers, a type of the identifying characteristic that is selected in the graphical user interface and that is identified by the selection of the hotkey combination, with the type of the identifying characteristic comprising one or more of a telephone number for the second person, a name of the second person, and an image associated with the second person; determining, based on the identifying characteristic that is selected in the graphical user interface and that is identified by the selection of the hotkey combination and the type of the identifying characteristic that is selected in the graphical user interface and that is identified by the selection of the hotkey combination, contact information for the second person; and launching a communication mode, with the communication mode using the contact information for the second person to establish a communication with the second person. | 1. A method comprising: accessing, by one or more computers of a first person, information for a graphical user interface that when rendered by the one or more computers displays an identifying characteristic associated with a second person's contact information; detecting, by the one or more computers, the first's person selection of a hotkey combination that specifies that the first user has selected textual information in the graphical user interface; identifying, based on detection of the hotkey combination, that the selected textual information is the identifying characteristic displayed in the graphical user interface; determining, by the one or more computers, a type of the identifying characteristic that is selected in the graphical user interface and that is identified by the selection of the hotkey combination, with the type of the identifying characteristic comprising one or more of a telephone number for the second person, a name of the second person, and an image associated with the second person; determining, based on the identifying characteristic that is selected in the graphical user interface and that is identified by the selection of the hotkey combination and the type of the identifying characteristic that is selected in the graphical user interface and that is identified by the selection of the hotkey combination, contact information for the second person; and launching a communication mode, with the communication mode using the contact information for the second person to establish a communication with the second person. 19. The method of claim 1 wherein the identifying characteristic comprises a name of the second person. | 0.909331 |
7,653,876 | 23 | 41 | 23. A software product tangibly stored on a machine-readable medium, the software product comprising instructions that cause a programmable processor to perform operations for reversing a format of a reversible electronic document comprising two formatting states, the operations comprising: in a first document conversion for reversing an electronic document in a binary format into a markup language format, transforming the electronic document from the binary format into the markup language format by extracting a subset of information from the electronic document in the binary format according to predefined extraction parameters, inserting the subset of the information into portions of the electronic document in the markup language format, and inserting a reduced-information version of the electronic document in the binary format into a storage location of the electronic document in the markup language format such that the version of the electronic document in the binary format is retrievable upon reversal of the electronic document in the markup language format in a second document conversion, wherein the reduced-information version comprises data that is unconvertible to the markup language format; and in the second document conversion for reversing an electronic document in the markup language format into the binary format, transforming the electronic document from the markup language format into the binary format by extracting a first subset of information, from the electronic document in the markup language format, that is recognized in the binary format, extracting a second subset of information, from the electronic document in the markup language format, that is not recognized in the binary format, inserting the first subset of information, from the electronic document in the markup language format, into portions of the electronic document in the binary format, and placing the second subset of information from the electronic document in the markup language format into a storage location of the electronic document in the binary format such that the unrecognized information is retrievable upon reversal of the electronic document in the binary format in the first document conversion, wherein the second subset of information comprises data that is unconvertible to the binary format. | 23. A software product tangibly stored on a machine-readable medium, the software product comprising instructions that cause a programmable processor to perform operations for reversing a format of a reversible electronic document comprising two formatting states, the operations comprising: in a first document conversion for reversing an electronic document in a binary format into a markup language format, transforming the electronic document from the binary format into the markup language format by extracting a subset of information from the electronic document in the binary format according to predefined extraction parameters, inserting the subset of the information into portions of the electronic document in the markup language format, and inserting a reduced-information version of the electronic document in the binary format into a storage location of the electronic document in the markup language format such that the version of the electronic document in the binary format is retrievable upon reversal of the electronic document in the markup language format in a second document conversion, wherein the reduced-information version comprises data that is unconvertible to the markup language format; and in the second document conversion for reversing an electronic document in the markup language format into the binary format, transforming the electronic document from the markup language format into the binary format by extracting a first subset of information, from the electronic document in the markup language format, that is recognized in the binary format, extracting a second subset of information, from the electronic document in the markup language format, that is not recognized in the binary format, inserting the first subset of information, from the electronic document in the markup language format, into portions of the electronic document in the binary format, and placing the second subset of information from the electronic document in the markup language format into a storage location of the electronic document in the binary format such that the unrecognized information is retrievable upon reversal of the electronic document in the binary format in the first document conversion, wherein the second subset of information comprises data that is unconvertible to the binary format. 41. The software product of claim 23 , wherein at least one of the subsets of information comprises asset management information, configuration information and data source information. | 0.872222 |
9,224,107 | 15 | 16 | 15. The computer program product of claim 14 , wherein each task comprises a plurality of settings that specify application program behavior related to the feature associated with the task, and wherein activation of the selected tasks' feature in the application program maintains the plurality of settings in corresponding customizing tables that specify the application program behavior related to the feature associated with the task. | 15. The computer program product of claim 14 , wherein each task comprises a plurality of settings that specify application program behavior related to the feature associated with the task, and wherein activation of the selected tasks' feature in the application program maintains the plurality of settings in corresponding customizing tables that specify the application program behavior related to the feature associated with the task. 16. The computer program product of claim 15 , wherein the modification of settings in the customizing table occurs after the selection of the set of tasks and in response to the receipt of a forth user input that is not a selection of a task. | 0.943118 |
7,783,644 | 1 | 5 | 1. A system for presenting entities mentioned in books, comprising: a non-transitory computer-readable storage medium storing executable computer program instructions comprising: an entity importance engine for assigning query-independent importance scores to entities of an entity type mentioned by books in a corpus, the entity importance engine comprising a references module for identifying third party references to sections of a book in which an entity is mentioned, assigning importance values to the sections of the book, and calculating an importance score for the entity responsive at least in part to the importance values, wherein the importance values for sections of the book referenced by third parties are elevated relative to the importance values for sections of the book not referenced by third parties; a search module for receiving a search query from a requestor and identifying a list of a plurality of books in the corpus that at least partially satisfy the query, and ranking the books in the list in an order based at least in part on the query-independent importance scores assigned to entities mentioned by the books; and a presentation module for presenting the plurality of books to the requestor in the ranked order; and a processor for executing the computer program instructions. | 1. A system for presenting entities mentioned in books, comprising: a non-transitory computer-readable storage medium storing executable computer program instructions comprising: an entity importance engine for assigning query-independent importance scores to entities of an entity type mentioned by books in a corpus, the entity importance engine comprising a references module for identifying third party references to sections of a book in which an entity is mentioned, assigning importance values to the sections of the book, and calculating an importance score for the entity responsive at least in part to the importance values, wherein the importance values for sections of the book referenced by third parties are elevated relative to the importance values for sections of the book not referenced by third parties; a search module for receiving a search query from a requestor and identifying a list of a plurality of books in the corpus that at least partially satisfy the query, and ranking the books in the list in an order based at least in part on the query-independent importance scores assigned to entities mentioned by the books; and a presentation module for presenting the plurality of books to the requestor in the ranked order; and a processor for executing the computer program instructions. 5. The system of claim 1 , wherein there are a plurality of entity types, and wherein the presentation module presents entities of a single type in a particular style selected based at least in part on the entity type. | 0.922198 |
8,442,973 | 1 | 19 | 1. A method for dynamically modifying search results comprising: receiving one or more keywords for use as search terms from a user; providing a set of search result objects on a first page of results displayed to said user; providing title and display text with each of said search result objects in said set of search result objects; monitoring which of said objects is selected by said user; compiling information to infer user intent based on the content of said document the user clicks; and by the time said user returns from said document to said set of search result objects including said document, immediately automatically re-ranking said set of search result objects based on user intent inferred from said analyzing of the content of said document said user clicks on, so that a user clicking on a single document from said set of search result objects results in a re-ranking of said set of search result objects, so that upon said user returning from said document to said set of search result objects including said document, without the user resubmitting the search, the re-ranked results will be visible; using terms from the title and display text corresponding to a selected object in an algorithm for generating said re-ranking of said set of search result objects on at least said first page; wherein said re-ranking includes moving at least one object from a subsequent page, not originally visible to said user on said first page, onto said first page; wherein said at least one object moved onto said first page is displayed in a manner to indicate to the user that it has been inserted between other objects on said first page, with said display providing an indication that the object is from a subsequent page and was not originally displayed on said first page. | 1. A method for dynamically modifying search results comprising: receiving one or more keywords for use as search terms from a user; providing a set of search result objects on a first page of results displayed to said user; providing title and display text with each of said search result objects in said set of search result objects; monitoring which of said objects is selected by said user; compiling information to infer user intent based on the content of said document the user clicks; and by the time said user returns from said document to said set of search result objects including said document, immediately automatically re-ranking said set of search result objects based on user intent inferred from said analyzing of the content of said document said user clicks on, so that a user clicking on a single document from said set of search result objects results in a re-ranking of said set of search result objects, so that upon said user returning from said document to said set of search result objects including said document, without the user resubmitting the search, the re-ranked results will be visible; using terms from the title and display text corresponding to a selected object in an algorithm for generating said re-ranking of said set of search result objects on at least said first page; wherein said re-ranking includes moving at least one object from a subsequent page, not originally visible to said user on said first page, onto said first page; wherein said at least one object moved onto said first page is displayed in a manner to indicate to the user that it has been inserted between other objects on said first page, with said display providing an indication that the object is from a subsequent page and was not originally displayed on said first page. 19. The method of claim 1 further comprising: re-ranking only search results of said set of search result objects on search result pages the user has not yet navigated to. | 0.870258 |
9,529,914 | 13 | 16 | 13. A non-transitory computer-readable medium having instructions stored thereon that, when executed by a processor, cause performance of a set of acts comprising: accessing web-traffic data associated with a web page hosted by a first computing-device, wherein the web page comprises meta-tag data; using the accessed web-traffic data to determine that the first computing-device received a threshold amount of requests that (i) were for the web page and (ii) originated from a particular geographical region; responsive to determining that the first computing-device received the threshold amount of requests that (i) were for the web page and (ii) originated from the particular geographical region, modifying the meta-tag data based on the particular geographical region; and transmitting the modified meta-tag data to a second computing-device, wherein the second computing-device is configured for (i) receiving the transmitted modified meta-tag data, (ii) receiving a request for a list of search results based on a set of search terms, (iii) responsive to receiving the request, using the set of search terms and the modified meta-tag data to perform a web search, thereby generating a list of search results, and (iv) transmitting the list of generated search results to a third computing-device. | 13. A non-transitory computer-readable medium having instructions stored thereon that, when executed by a processor, cause performance of a set of acts comprising: accessing web-traffic data associated with a web page hosted by a first computing-device, wherein the web page comprises meta-tag data; using the accessed web-traffic data to determine that the first computing-device received a threshold amount of requests that (i) were for the web page and (ii) originated from a particular geographical region; responsive to determining that the first computing-device received the threshold amount of requests that (i) were for the web page and (ii) originated from the particular geographical region, modifying the meta-tag data based on the particular geographical region; and transmitting the modified meta-tag data to a second computing-device, wherein the second computing-device is configured for (i) receiving the transmitted modified meta-tag data, (ii) receiving a request for a list of search results based on a set of search terms, (iii) responsive to receiving the request, using the set of search terms and the modified meta-tag data to perform a web search, thereby generating a list of search results, and (iv) transmitting the list of generated search results to a third computing-device. 16. The computer-readable medium of claim 13 , wherein modifying the meta-tag data based on the particular geographical region comprises increasing a priority level assigned to a meta-tag keyword within a group of meta-tag keywords of the web page, wherein the meta-tag keyword identifies the particular geographical region. | 0.674044 |
9,058,613 | 19 | 20 | 19. The computer storage medium of claim 15 , wherein the instructions further cause the one or more computers to perform operations comprising determining a category to which the requesting property has been assigned, the category being determined independent of the page keywords for the requesting web property. | 19. The computer storage medium of claim 15 , wherein the instructions further cause the one or more computers to perform operations comprising determining a category to which the requesting property has been assigned, the category being determined independent of the page keywords for the requesting web property. 20. The computer storage medium of claim 19 , wherein the instructions further cause the one or more computers to perform operations comprising identifying advertisements for which presentation of the advertisements is conditioned on the requesting web property being assigned to the category. | 0.918384 |
9,355,093 | 1 | 12 | 1. A natural language generation method for generating a referring noun phrase for an intended referent found in one or more messages within a document plan, the method comprising: arranging, using a processor, one or more messages in a document plan, wherein messages represent a phrase or a simple sentence and are created in an instance in which an input data stream comprises data that satisfies one or more message requirements, and wherein at least a portion of the input data stream comprises non-linguistic data; identifying an intended referent in a message of the one or more messages to be referred to in a textual output; determining a lowest common ancestor for the intended referent and a previously referred-to entity within a part-of hierarchy; determining a salient ancestor of the intended referent within the part-of hierarchy; generating a referring noun phrase for the intended referent to be included in a textual output by traversing the part-of hierarchy from the salient ancestor to the lowest common ancestor such that a default descriptor is added to a queue for at least a portion of entities traversed in the part-of-hierarchy, wherein the reference noun phrase comprises a default descriptor of the intended referent and one or more default descriptors of one or more parts of the part-of hierarchy that are traversed; generating the textual output comprising the referring noun phrase such that it is displayable on a user interface, wherein the textual output linguistically describes at least a portion of the input data stream; and displaying the textual output via a display device. | 1. A natural language generation method for generating a referring noun phrase for an intended referent found in one or more messages within a document plan, the method comprising: arranging, using a processor, one or more messages in a document plan, wherein messages represent a phrase or a simple sentence and are created in an instance in which an input data stream comprises data that satisfies one or more message requirements, and wherein at least a portion of the input data stream comprises non-linguistic data; identifying an intended referent in a message of the one or more messages to be referred to in a textual output; determining a lowest common ancestor for the intended referent and a previously referred-to entity within a part-of hierarchy; determining a salient ancestor of the intended referent within the part-of hierarchy; generating a referring noun phrase for the intended referent to be included in a textual output by traversing the part-of hierarchy from the salient ancestor to the lowest common ancestor such that a default descriptor is added to a queue for at least a portion of entities traversed in the part-of-hierarchy, wherein the reference noun phrase comprises a default descriptor of the intended referent and one or more default descriptors of one or more parts of the part-of hierarchy that are traversed; generating the textual output comprising the referring noun phrase such that it is displayable on a user interface, wherein the textual output linguistically describes at least a portion of the input data stream; and displaying the textual output via a display device. 12. A method according to claim 1 , wherein generating the referring noun phrase further comprises: removing a first element in the queue, wherein the first element is designated as a head noun in the referring noun phase. | 0.714653 |
7,822,729 | 6 | 10 | 6. A system comprising: a processor; a data bus coupled to the processor; a memory coupled to the data bus; and a computer-usable medium embodying computer program code, the computer program code comprising instructions executable by the processor and configured for swapping multiple alias names for multiple objects in a database management system by performing the steps of: compiling a single Structured Query Language (SQL) swap alias command to create a compiled SQL swap alias command, wherein the single SQL swap alias command is a single SQL statement that comprises a list of multiple different objects whose aliases are to be swapped and which, when compiled and executed, causes a global alias swap of at least one alias name swap for different objects among the multiple different objects in the database management system, wherein the global alias swap of the at least one alias name swap for the multiple different objects is triggered by execution of the compiled SQL swap alias command; and issuing the compiled SQL swap alias command to an SQL interface for the database management system, wherein the compiled SQL swap alias command performs the steps of: in response to determining that an issuer of the swap alias command is authorized to issue the SQL swap alias command, determining if a particular underlying object, for a particular alias name, is locked to prevent changing the particular alias name; in response to determining that the particular alias name is locked, determining if the issuer of the swap alias command has an authority to force the alias name swap of the particular alias name; in response to determining that the issuer has the authority to force the alias name swap of the particular alias name, swapping alias names of the particular alias name for the multiple objects in the database management system that have been listed in the single SQL swap alias command, thereby forcing all locked resources to be freed, wherein said swapping is performed as a global alias swap via execution of the compiled SQL swap alias command generated from the single SQL swap alias command; when the issuer does not have the authority to force the alias name swap of the particular alias name: issuing an error message if the SQL swap alias command fails because the issuer is not authorized to force the alias name swap of the particular object; and swapping only the alias names of each of multiple other objects whose alias names are non-locked or for which the issuer has authority to force the alias name swap, wherein said swapping is performed as a global alias swap via execution of the compiled SQL swap alias command generated from the single SQL swap alias command. | 6. A system comprising: a processor; a data bus coupled to the processor; a memory coupled to the data bus; and a computer-usable medium embodying computer program code, the computer program code comprising instructions executable by the processor and configured for swapping multiple alias names for multiple objects in a database management system by performing the steps of: compiling a single Structured Query Language (SQL) swap alias command to create a compiled SQL swap alias command, wherein the single SQL swap alias command is a single SQL statement that comprises a list of multiple different objects whose aliases are to be swapped and which, when compiled and executed, causes a global alias swap of at least one alias name swap for different objects among the multiple different objects in the database management system, wherein the global alias swap of the at least one alias name swap for the multiple different objects is triggered by execution of the compiled SQL swap alias command; and issuing the compiled SQL swap alias command to an SQL interface for the database management system, wherein the compiled SQL swap alias command performs the steps of: in response to determining that an issuer of the swap alias command is authorized to issue the SQL swap alias command, determining if a particular underlying object, for a particular alias name, is locked to prevent changing the particular alias name; in response to determining that the particular alias name is locked, determining if the issuer of the swap alias command has an authority to force the alias name swap of the particular alias name; in response to determining that the issuer has the authority to force the alias name swap of the particular alias name, swapping alias names of the particular alias name for the multiple objects in the database management system that have been listed in the single SQL swap alias command, thereby forcing all locked resources to be freed, wherein said swapping is performed as a global alias swap via execution of the compiled SQL swap alias command generated from the single SQL swap alias command; when the issuer does not have the authority to force the alias name swap of the particular alias name: issuing an error message if the SQL swap alias command fails because the issuer is not authorized to force the alias name swap of the particular object; and swapping only the alias names of each of multiple other objects whose alias names are non-locked or for which the issuer has authority to force the alias name swap, wherein said swapping is performed as a global alias swap via execution of the compiled SQL swap alias command generated from the single SQL swap alias command. 10. The system of claim 6 , wherein the SQL swap alias command has a syntax of “SWAP ALIASGROUPS [alias_n becomes object_n] [multiple iterations] [force]”, wherein “alias_n” defines an alias name that is redirected to point to “object_n”, “multiple iterations” defines that the swap alias command is to be applied to multiple objects in the database management system, wherein one or more [alias_x becomes object_x] can be defined, and “force” defines whether the command is to force the alias name swap. | 0.50099 |
9,165,064 | 1 | 5 | 1. A method for providing context aware prompts and alerts in a note taking system, the method comprising: (a) providing a note taking function to allow a user to create a note on a user device, wherein the note is stored; (b) enriching the note by associating a local contextual trait with the note, wherein the local contextual trait is automatically gathered at the user device while the user creates the note on the user device; (c) providing a binding function to establish one or more binding rules for the note, wherein the binding rules determine one or more services where the note is to be bound, and wherein the binding rules are changeable; (d) assigning one or more prompts or alerts to the note using a prompt and alert service, wherein the assigning comprises assigning the local contextual trait associated with the note to the one or more prompts or alerts; (e) providing a registering function to allow one or more people to join the prompt and alert service, wherein the registering comprises defining one or more of the contextual traits for receiving a prompt or alert; and (f) the one or more people receiving one or more of the prompts or alerts based on one or more of the defined and registered contextual traits. | 1. A method for providing context aware prompts and alerts in a note taking system, the method comprising: (a) providing a note taking function to allow a user to create a note on a user device, wherein the note is stored; (b) enriching the note by associating a local contextual trait with the note, wherein the local contextual trait is automatically gathered at the user device while the user creates the note on the user device; (c) providing a binding function to establish one or more binding rules for the note, wherein the binding rules determine one or more services where the note is to be bound, and wherein the binding rules are changeable; (d) assigning one or more prompts or alerts to the note using a prompt and alert service, wherein the assigning comprises assigning the local contextual trait associated with the note to the one or more prompts or alerts; (e) providing a registering function to allow one or more people to join the prompt and alert service, wherein the registering comprises defining one or more of the contextual traits for receiving a prompt or alert; and (f) the one or more people receiving one or more of the prompts or alerts based on one or more of the defined and registered contextual traits. 5. The method as set forth in claim 1 , wherein the user is a professional service provider. | 0.95459 |
4,441,201 | 17 | 18 | 17. A speech synthesis system comprising: means for providing frames of speech data including digital speech values and frame rate data, wherein said frame rate data is indicative of a variable time interval between the start of a current frame of speech data and the start of the next successive frame of speech data; speech synthesizer means having an input for respectively receiving successive frames of speech data and for selectively converting said digital speech values into analog speech signals representative of human speech; frame control means responsive to said frame rate data for enabling the acceptance of a new frame of speech data by the input of said speech synthesizer means succeeding the previous frame of speech data, the time interval between the acceptance of successive new frames of speech data by the input of said speech synthesizer means as enabled by said frame control means being variable and being determined by said frame rate data of each frame of speech data, the input of said speech synthesizer means thereby being responsive to said frame control means for respectively receiving successive frames of speech data in variably timed relation to each other; and audio means coupled to said speech synthesizer means for converting said analog speech signals representative of human speech into audible sounds. | 17. A speech synthesis system comprising: means for providing frames of speech data including digital speech values and frame rate data, wherein said frame rate data is indicative of a variable time interval between the start of a current frame of speech data and the start of the next successive frame of speech data; speech synthesizer means having an input for respectively receiving successive frames of speech data and for selectively converting said digital speech values into analog speech signals representative of human speech; frame control means responsive to said frame rate data for enabling the acceptance of a new frame of speech data by the input of said speech synthesizer means succeeding the previous frame of speech data, the time interval between the acceptance of successive new frames of speech data by the input of said speech synthesizer means as enabled by said frame control means being variable and being determined by said frame rate data of each frame of speech data, the input of said speech synthesizer means thereby being responsive to said frame control means for respectively receiving successive frames of speech data in variably timed relation to each other; and audio means coupled to said speech synthesizer means for converting said analog speech signals representative of human speech into audible sounds. 18. The speech synthesizer system according to claim 17, further including interpolator means coupled to said frame control means for providing a variable number of interpolation calculations to define interpolated speech values between successive frames of speech data from last implemented speech data in which the number of interpolation calculations in a given instance is determined by said frame rate data; and said speech synthesizer means respectively receiving frames of speech data and interpolated speech values for selectively converting said digital speech values and said interpolated values thereof into said analog speech signals representative of human speech. | 0.62965 |
9,378,276 | 1 | 5 | 1. A method for generating navigation filters, the method comprising: receiving, at a processing circuit, a set of data entries comprising raw textual data, the data entries representing at least one of archetypal headings or archetypal items for a navigation filter; normalizing the data entries to convert the raw textual data into a standard form, the normalized data entries comprising at least one of potential navigation filter headings or potential navigation filter items; identifying occurrences of the normalized data entries in an electronic resource; determining a path to each of the identified occurrences of a normalized data entry in the electronic resource, wherein determining the path comprises: selecting a root element of the electronic resource; and for each identified occurrence of a normalized data entry in the electronic resource, identifying one or more intermediate tags of the electronic resource between the root element and the normalized data entry; and determining a path from the root element to the normalized data entry through the one or more intermediate tags; using the path to an identified occurrence to construct a query for at least one of potential navigation filter headings or potential navigation filter items that have the same path as the identified occurrence in the electronic resource; and generating a navigation filter by associating one or more of the potential navigation filter items with one of the potential navigation filter headings. | 1. A method for generating navigation filters, the method comprising: receiving, at a processing circuit, a set of data entries comprising raw textual data, the data entries representing at least one of archetypal headings or archetypal items for a navigation filter; normalizing the data entries to convert the raw textual data into a standard form, the normalized data entries comprising at least one of potential navigation filter headings or potential navigation filter items; identifying occurrences of the normalized data entries in an electronic resource; determining a path to each of the identified occurrences of a normalized data entry in the electronic resource, wherein determining the path comprises: selecting a root element of the electronic resource; and for each identified occurrence of a normalized data entry in the electronic resource, identifying one or more intermediate tags of the electronic resource between the root element and the normalized data entry; and determining a path from the root element to the normalized data entry through the one or more intermediate tags; using the path to an identified occurrence to construct a query for at least one of potential navigation filter headings or potential navigation filter items that have the same path as the identified occurrence in the electronic resource; and generating a navigation filter by associating one or more of the potential navigation filter items with one of the potential navigation filter headings. 5. The method of claim 1 , wherein identifying occurrences of the normalized data entries in the electronic resource comprises: identifying one or more tags in the electronic resource; parsing content text associated with each of the identified tags to determine whether the content text matches a normalized data entry; and marking an identified tag of the electronic resource with a navigation filter heading annotation in response to a determination that the content text associated with the identified tag matches one or more of the normalized data entries. | 0.644487 |
8,515,934 | 21 | 23 | 21. A system comprising: a storage medium having instructions stored thereon; and data processing apparatus programmed to execute the instructions to perform operations comprising: receiving a search query in a first language; receiving a plurality of search results responsive to the search query, wherein the search results comprise one or more first search results and a plurality of second search results, wherein each first result identifies a respective document in the first language and a corresponding respective document in a different second language, and wherein the second search results each identify a respective document in the first language; ordering the search results based on, at least, a respective number of documents identified by each of the search results; and providing the ordered search results in response to the search query. | 21. A system comprising: a storage medium having instructions stored thereon; and data processing apparatus programmed to execute the instructions to perform operations comprising: receiving a search query in a first language; receiving a plurality of search results responsive to the search query, wherein the search results comprise one or more first search results and a plurality of second search results, wherein each first result identifies a respective document in the first language and a corresponding respective document in a different second language, and wherein the second search results each identify a respective document in the first language; ordering the search results based on, at least, a respective number of documents identified by each of the search results; and providing the ordered search results in response to the search query. 23. The system of claim 21 wherein a particular document in the second language is a document originating in the second language concerning a topic similar to a topic of the corresponding document in the first language. | 0.665138 |
9,244,887 | 19 | 28 | 19. A system comprising: one or more processors; one or more computer-readable storage mediums containing instructions configured to cause the one or more processors to perform operations including: analyzing, using a time series engine, a distribution of unstructured time-stamped data to identify a plurality of potential time series data hierarchies for structuring the unstructured time-stamped data, wherein a potential time series data hierarchy is a framework for structuring the data through use of multiple time series, and wherein the time series engine is at a server layer of a time series computing system; performing, using the time series engine, an analysis of the plurality of potential time series data hierarchies, wherein performing the analysis of the plurality of potential time series data hierarchies includes determining an optimal time series frequency and a data sufficiency metric for each of the plurality of potential time series data hierarchies; comparing data sufficiency metrics for the plurality of potential time series data hierarchies; selecting a hierarchy of the plurality of potential time series data hierarchies based on the comparison of the data sufficiency metrics; structuring the unstructured time-stamped data into structured time-stamped data according to the hierarchy and the optimal time series frequency, wherein structuring the transformed time-stamped data into the structured time-stamped data is performed using a single pass of the unstructured time-stamped data through the time series engine; computing a plurality of transformations of the structured time-stamped data using the single pass of the structured time-stamped data through the time series engine; transforming the structured time-stamped data into transformed time-stamped data according to the plurality of transformations; and providing, using an application programming interface, the transformed time-stamped data for visual presentation. | 19. A system comprising: one or more processors; one or more computer-readable storage mediums containing instructions configured to cause the one or more processors to perform operations including: analyzing, using a time series engine, a distribution of unstructured time-stamped data to identify a plurality of potential time series data hierarchies for structuring the unstructured time-stamped data, wherein a potential time series data hierarchy is a framework for structuring the data through use of multiple time series, and wherein the time series engine is at a server layer of a time series computing system; performing, using the time series engine, an analysis of the plurality of potential time series data hierarchies, wherein performing the analysis of the plurality of potential time series data hierarchies includes determining an optimal time series frequency and a data sufficiency metric for each of the plurality of potential time series data hierarchies; comparing data sufficiency metrics for the plurality of potential time series data hierarchies; selecting a hierarchy of the plurality of potential time series data hierarchies based on the comparison of the data sufficiency metrics; structuring the unstructured time-stamped data into structured time-stamped data according to the hierarchy and the optimal time series frequency, wherein structuring the transformed time-stamped data into the structured time-stamped data is performed using a single pass of the unstructured time-stamped data through the time series engine; computing a plurality of transformations of the structured time-stamped data using the single pass of the structured time-stamped data through the time series engine; transforming the structured time-stamped data into transformed time-stamped data according to the plurality of transformations; and providing, using an application programming interface, the transformed time-stamped data for visual presentation. 28. The system of claim 19 , further comprising instructions, which when executed by the one or more processors, cause the computing device to perform operations including: selecting additional hierarchies of the plurality of potential time series data hierarchies based on the comparison of the data sufficiency metrics; and structuring the unstructured time-stamped data into structured time-stamped data according to the additional hierarchies and the optimal time series frequency, wherein structuring the unstructured time-stamped data using a hierarchy of the additional hierarchies is executed with a corresponding process thread. | 0.500784 |
9,454,517 | 1 | 5 | 1. A device, comprising: a single touch-screen display configured to display a virtual keyboard and a document area displaying an editing document inputted via the virtual keyboard; and a controller configured to maintain displaying of the virtual keyboard on the single touch-screen display while switching the editing document over from a first document to a second document in a case in which a touch operation to switch the editing document over from the first document to the second document is performed in the document area displayed on the single touch-screen display, wherein in the case in which the touch operation to switch the editing document over from the first document to the second document is performed, the controller is configured to cause the single touch-screen display to display that the first document displayed in the document area moves in a direction of the touch operation, and cause the single touch-screen display to display, without superimposing on the virtual keyboard, an indication confirming whether the first document should be stored. | 1. A device, comprising: a single touch-screen display configured to display a virtual keyboard and a document area displaying an editing document inputted via the virtual keyboard; and a controller configured to maintain displaying of the virtual keyboard on the single touch-screen display while switching the editing document over from a first document to a second document in a case in which a touch operation to switch the editing document over from the first document to the second document is performed in the document area displayed on the single touch-screen display, wherein in the case in which the touch operation to switch the editing document over from the first document to the second document is performed, the controller is configured to cause the single touch-screen display to display that the first document displayed in the document area moves in a direction of the touch operation, and cause the single touch-screen display to display, without superimposing on the virtual keyboard, an indication confirming whether the first document should be stored. 5. The device according to claim 1 , wherein, in a case in which a second gesture is detected through the single touch-screen display, the controller is configured to stop an editor application that edits documents. | 0.777893 |
7,505,968 | 1 | 8 | 1. A method of evaluating a particular document relating to property, the method comprising: from a set of pre-selected documents, selecting the particular document, wherein each pre-selected document has associated therewith one or more search linkages that identify how the pre-selected document was selected, using user-supplied inputs, from a larger set of documents relating to property and wherein the set of pre-selected documents also have associated therewith one or more organizational linkages, each of which organizational linkages identifies a relationship between at least two pre-selected documents; using the one or more search linkages associated with the particular document to determine a relevance factor associated with the document, wherein using the one or more search linkages associated with the particular document to determine a relevance factor associated with the document comprises determining a baseline relevance factor and thereafter adjusting the relevance factor based on one or more specific comparisons; further comprising using the one or more organizational linkages to determine the relevance factor associated with the particular document, wherein using the one or more organizational linkages to determine the relevance factor associated with the particular document comprises adjusting a baseline relevance factor if a record date of the particular document predates a specific good stop associated with the document; and displaying to a user information relating to the document, wherein the information includes the relevance factor. | 1. A method of evaluating a particular document relating to property, the method comprising: from a set of pre-selected documents, selecting the particular document, wherein each pre-selected document has associated therewith one or more search linkages that identify how the pre-selected document was selected, using user-supplied inputs, from a larger set of documents relating to property and wherein the set of pre-selected documents also have associated therewith one or more organizational linkages, each of which organizational linkages identifies a relationship between at least two pre-selected documents; using the one or more search linkages associated with the particular document to determine a relevance factor associated with the document, wherein using the one or more search linkages associated with the particular document to determine a relevance factor associated with the document comprises determining a baseline relevance factor and thereafter adjusting the relevance factor based on one or more specific comparisons; further comprising using the one or more organizational linkages to determine the relevance factor associated with the particular document, wherein using the one or more organizational linkages to determine the relevance factor associated with the particular document comprises adjusting a baseline relevance factor if a record date of the particular document predates a specific good stop associated with the document; and displaying to a user information relating to the document, wherein the information includes the relevance factor. 8. The method of claim 1 , wherein adjusting the relevance factor based on one or more specific comparisons comprises adjusting the baseline relevance factor based on a comparison between an address associated with the particular document and an address supplied by a user. | 0.776596 |
9,501,469 | 1 | 7 | 1. A method performed by at least one computer processor, the method comprising: (A) obtaining, from a user, first data representing a first part of a sentence, wherein the first part of the sentence comprises a first one of a subject, a predicate, and an object; (B) obtaining, from the user, second data representing a second part of the sentence, wherein the second part of the sentence comprises a second one of the subject, the predicate, and the object; (C) identifying a synonym of the first part of the sentence; (D) identifying a synonym of the second part of the sentence; (E) forming a first query from the synonym of the first part of the sentence and the synonym of the second part of the sentence, comprising: (E)(1) selecting a first form for the first query, wherein the first form specifies a first one of the following sequences: subject, predicate, object; subject, predicate; subject, object; predicate, object; (E)(2) forming the first query in the first form the forming comprising: (E)(2)(a) if the first form specifies the sequence subject, predicate, object, then forming the first query to include a subject followed by a predicate followed by an object, wherein the subject, predicate, and object are selected from the first part of the sentence, the second part of the sentence, the synonym of the first part of the sentence, and the synonym of the second part of the sentence; (E)(2)(b) if the first form specifies the sequence subject, predicate, then forming the first query to include a subject followed by a predicate, wherein the subject and predicate are selected from the first part of the sentence, the second part of the sentence, the synonym of the first part of the sentence, and the synonym of the second part of the sentence; (E)(2)(c) if the first form specifies the sequence subject, object, then forming the first query to include a subject followed by an object, wherein the subject and object are selected from the first part of the sentence, the second part of the sentence, the synonym of the first part of the sentence, and the synonym of the second part of the sentence; and (E)(2)(d) if the first form specifies the sequence predicate, object, then forming the first query to include a predicate followed by an object, wherein the predicate and object are selected from the first part of the sentence, the second part of the sentence, the synonym of the first part of the sentence, and the synonym of the second part of the sentence; and (F) searching a dataset in memory using the first query to identify a first subset of the dataset; (G) providing, to the user, executed by the computer processor, output representing the subset of the dataset wherein the sentence differs from the first query. | 1. A method performed by at least one computer processor, the method comprising: (A) obtaining, from a user, first data representing a first part of a sentence, wherein the first part of the sentence comprises a first one of a subject, a predicate, and an object; (B) obtaining, from the user, second data representing a second part of the sentence, wherein the second part of the sentence comprises a second one of the subject, the predicate, and the object; (C) identifying a synonym of the first part of the sentence; (D) identifying a synonym of the second part of the sentence; (E) forming a first query from the synonym of the first part of the sentence and the synonym of the second part of the sentence, comprising: (E)(1) selecting a first form for the first query, wherein the first form specifies a first one of the following sequences: subject, predicate, object; subject, predicate; subject, object; predicate, object; (E)(2) forming the first query in the first form the forming comprising: (E)(2)(a) if the first form specifies the sequence subject, predicate, object, then forming the first query to include a subject followed by a predicate followed by an object, wherein the subject, predicate, and object are selected from the first part of the sentence, the second part of the sentence, the synonym of the first part of the sentence, and the synonym of the second part of the sentence; (E)(2)(b) if the first form specifies the sequence subject, predicate, then forming the first query to include a subject followed by a predicate, wherein the subject and predicate are selected from the first part of the sentence, the second part of the sentence, the synonym of the first part of the sentence, and the synonym of the second part of the sentence; (E)(2)(c) if the first form specifies the sequence subject, object, then forming the first query to include a subject followed by an object, wherein the subject and object are selected from the first part of the sentence, the second part of the sentence, the synonym of the first part of the sentence, and the synonym of the second part of the sentence; and (E)(2)(d) if the first form specifies the sequence predicate, object, then forming the first query to include a predicate followed by an object, wherein the predicate and object are selected from the first part of the sentence, the second part of the sentence, the synonym of the first part of the sentence, and the synonym of the second part of the sentence; and (F) searching a dataset in memory using the first query to identify a first subset of the dataset; (G) providing, to the user, executed by the computer processor, output representing the subset of the dataset wherein the sentence differs from the first query. 7. The method of claim 1 , wherein (C) comprises: (C)(1) identifying a plurality of synonyms of the first part of the sentence; (C)(2) providing output representing the plurality of synonyms of the first part of the sentence; and (C)(3) receiving user input selecting one of the plurality of synonyms of the first part of the sentence. | 0.787437 |
6,144,938 | 43 | 70 | 43. A method for a voice user interface with personality, the method comprising: storing a recognition grammar in a memory, the recognition grammar comprising multiple phrases that a virtual assistant with a personality can recognize when spoken by a user, the recognition grammar being selected based on the personality of the virtual assistant; executing a voice user interface, the voice user interface outputting first voice signals, the voice user interface recognizing speech signals; and controlling the voice user interface to provide the voice user interface with a verbal personality. | 43. A method for a voice user interface with personality, the method comprising: storing a recognition grammar in a memory, the recognition grammar comprising multiple phrases that a virtual assistant with a personality can recognize when spoken by a user, the recognition grammar being selected based on the personality of the virtual assistant; executing a voice user interface, the voice user interface outputting first voice signals, the voice user interface recognizing speech signals; and controlling the voice user interface to provide the voice user interface with a verbal personality. 70. The method as recited in claim 43 wherein the controlling the voice user interface comprises selecting an approximation prompt. | 0.861814 |
9,600,842 | 82 | 90 | 82. The computer program product of claim 29 , wherein the computer program product is configured for identifying taxonomy software elements in connection with at least one source data document. | 82. The computer program product of claim 29 , wherein the computer program product is configured for identifying taxonomy software elements in connection with at least one source data document. 90. The computer program product of claim 82 , wherein the computer program product is configured such that at least one of: at least one of said taxonomy software elements includes a Numerator Document Object Model; said taxonomy software elements include at least one attribute; said taxonomy software elements include a level attribute; said taxonomy software elements reflect the multiple hierarchical relationships by representing corresponding elements of an eXtensible Business Reporting Language (XBRL) taxonomy document; said taxonomy software elements reflect the multiple hierarchical relationships by having a format associated with the hierarchal relationships; or said at least one computer-readable semantic tag includes at least one of a schema tag, an annotation tag, an element tag, a documentation tag, an appinfo tag, a rollup tag, a label tag, a reference tag, or an XBLR tag. | 0.922912 |
8,644,755 | 10 | 11 | 10. Software for managing offline presentation of electronic learning materials, the software comprising computer readable instructions embodied on tangible media and operable when executed to: generate electronic learning materials for offline presentation, wherein the electronic learning materials include a plurality of knowledge items; assign the plurality of knowledge items to a plurality of identification strings, wherein each of the plurality of knowledge items is mapped to a different identification string in the plurality of identification strings; store the assignment between the plurality of knowledge items to the plurality of identification strings; transmit to a learner device the generated electronic learning materials and the plurality of identification strings, wherein the plurality of identification strings are presented to the learner during offline presentation in connection with completion of assigned knowledge items; receive, from a user device different from the learner device, an identification string from the plurality of identification strings, wherein the identification string is presented to the learner during the offline presentation of in connection with completion of an assigned knowledge item in the generated electronic learning materials, and the learner transmits the identification string using the user device different from the learner device; and determine progress of the learner with respect to the generated electronic learning materials based on comparing the received identification string to the stored assignment of identification strings. | 10. Software for managing offline presentation of electronic learning materials, the software comprising computer readable instructions embodied on tangible media and operable when executed to: generate electronic learning materials for offline presentation, wherein the electronic learning materials include a plurality of knowledge items; assign the plurality of knowledge items to a plurality of identification strings, wherein each of the plurality of knowledge items is mapped to a different identification string in the plurality of identification strings; store the assignment between the plurality of knowledge items to the plurality of identification strings; transmit to a learner device the generated electronic learning materials and the plurality of identification strings, wherein the plurality of identification strings are presented to the learner during offline presentation in connection with completion of assigned knowledge items; receive, from a user device different from the learner device, an identification string from the plurality of identification strings, wherein the identification string is presented to the learner during the offline presentation of in connection with completion of an assigned knowledge item in the generated electronic learning materials, and the learner transmits the identification string using the user device different from the learner device; and determine progress of the learner with respect to the generated electronic learning materials based on comparing the received identification string to the stored assignment of identification strings. 11. The software of claim 10 further operable to identifying a listing of words, wherein assigning the plurality of identification strings includes selecting at least one word from the listing of words. | 0.815018 |
8,700,652 | 7 | 9 | 7. A method to generate a synonym dictionary, the method comprising: generating demand information based on a first plurality of queries, the generating the demand information further comprising: identifying search results based on a first query, the search results including a first item, receiving a selection over a network from a user that identifies the first item in the search results and responsive to the receiving the selection: identifying the first item as a first product, and storing an association between the first query and the first product as an instance of demand information, the generating being performed by using a computer processor; identifying a second plurality of queries as a first cluster of queries from the first plurality of queries based on the demand information, the demand information associated with the first cluster of queries is associated with a first plurality of search results that are associated with selections that identify items that are identified as the first product; and identifying a first synonym set based on an association map that comprises a first plurality of constraints identified from the second plurality of queries, the second plurality of queries including a second query including at least two constraints and a third query including at least two constraints, the identifying the first synonym set including utilizing the association map to identify at least one constraint in the second query that matches at least one constraint in the third query; and storing the first synonym set in a synonym dictionary. | 7. A method to generate a synonym dictionary, the method comprising: generating demand information based on a first plurality of queries, the generating the demand information further comprising: identifying search results based on a first query, the search results including a first item, receiving a selection over a network from a user that identifies the first item in the search results and responsive to the receiving the selection: identifying the first item as a first product, and storing an association between the first query and the first product as an instance of demand information, the generating being performed by using a computer processor; identifying a second plurality of queries as a first cluster of queries from the first plurality of queries based on the demand information, the demand information associated with the first cluster of queries is associated with a first plurality of search results that are associated with selections that identify items that are identified as the first product; and identifying a first synonym set based on an association map that comprises a first plurality of constraints identified from the second plurality of queries, the second plurality of queries including a second query including at least two constraints and a third query including at least two constraints, the identifying the first synonym set including utilizing the association map to identify at least one constraint in the second query that matches at least one constraint in the third query; and storing the first synonym set in a synonym dictionary. 9. The method of claim 7 , wherein the first cluster of queries comprises the first query and wherein the first query comprises a first and second constraint and wherein the identifying the first synonym set comprises generating a distance matrix that identifies a distance between the first and second constraint. | 0.735245 |
7,636,886 | 1 | 8 | 1. A computer-implemented method for organizing a plurality of pages of an electronic tax document based on a plurality of tax preparation categories, comprising: defining a bookmark profile comprising a plurality of tax preparation categories listed in a predefined bookmark order; defining a first bookmark and a second bookmark, the first bookmark and the second bookmark each containing at least one tax preparation category; associating the first bookmark with a first page of the electronic tax document; associating the second bookmark with a second page of the electronic tax document, the second page subsequent in order to the first page in the electronic tax document; associating the first bookmark with a first plurality of pages corresponding to all pages of the electronic tax document between the first page and the second page; associating the second bookmark with a second plurality of pages corresponding to all pages of the electronic tax document subsequent to the second page; displaying the first bookmark and the second bookmark; and arranging the first and second plurality of pages of the electronic tax document into the predefined bookmark order based on the plurality of tax preparation categories, the predefined bookmark order different than a previous order of the pages of the electronic tax document. | 1. A computer-implemented method for organizing a plurality of pages of an electronic tax document based on a plurality of tax preparation categories, comprising: defining a bookmark profile comprising a plurality of tax preparation categories listed in a predefined bookmark order; defining a first bookmark and a second bookmark, the first bookmark and the second bookmark each containing at least one tax preparation category; associating the first bookmark with a first page of the electronic tax document; associating the second bookmark with a second page of the electronic tax document, the second page subsequent in order to the first page in the electronic tax document; associating the first bookmark with a first plurality of pages corresponding to all pages of the electronic tax document between the first page and the second page; associating the second bookmark with a second plurality of pages corresponding to all pages of the electronic tax document subsequent to the second page; displaying the first bookmark and the second bookmark; and arranging the first and second plurality of pages of the electronic tax document into the predefined bookmark order based on the plurality of tax preparation categories, the predefined bookmark order different than a previous order of the pages of the electronic tax document. 8. The method of claim 1 , further comprising: generating a table of contents using a bookmark profile; determining the number of pages of the table of contents; shifting the plurality of pages to accommodate for the table of contents; and inserting the table of contents before the plurality of pages. | 0.62531 |
7,672,932 | 21 | 22 | 21. A computer-implemented method of providing speculative search results, comprising the steps of: receiving a search query from a client node, wherein said search query is not-yet-submitted; as characters are added or removed from said not-yet-submitted search query, determining whether said not-yet-submitted search query matches at least one phrase in a collection of pre-defined phrases; as long as said not-yet-submitted search query does not match at least one phrase in the collection of pre-defined phrases, then not determining a speculative search result; only when said not-yet-submitted search query matches at least one phrase in the collection of pre-defined phrases, then performing: determining a speculative search result for said not-yet-submitted search query prior to receiving an indication from said client node that said not-yet-submitted search query is completely formed, and providing said speculative search result to said client node, wherein said speculative search result identifies at least one item that satisfies said not-yet submitted search query; receiving input that indicates that said search query is submitted; and performing a search based on said submitted search query; wherein the steps are performed on one or more computing devices. | 21. A computer-implemented method of providing speculative search results, comprising the steps of: receiving a search query from a client node, wherein said search query is not-yet-submitted; as characters are added or removed from said not-yet-submitted search query, determining whether said not-yet-submitted search query matches at least one phrase in a collection of pre-defined phrases; as long as said not-yet-submitted search query does not match at least one phrase in the collection of pre-defined phrases, then not determining a speculative search result; only when said not-yet-submitted search query matches at least one phrase in the collection of pre-defined phrases, then performing: determining a speculative search result for said not-yet-submitted search query prior to receiving an indication from said client node that said not-yet-submitted search query is completely formed, and providing said speculative search result to said client node, wherein said speculative search result identifies at least one item that satisfies said not-yet submitted search query; receiving input that indicates that said search query is submitted; and performing a search based on said submitted search query; wherein the steps are performed on one or more computing devices. 22. A computer-readable storage medium storing one or more sequences of instructions which, when executed by one or more processors, causes the one or more processors to perform the method recited in claim 21 . | 0.933036 |
9,026,915 | 4 | 5 | 4. The method of claim 1 , wherein the list of keyphrases is used to populate a menu available to the user. | 4. The method of claim 1 , wherein the list of keyphrases is used to populate a menu available to the user. 5. The method of claim 4 , wherein the user can use the menu of key phrases to select searchable presentation source files. | 0.966264 |
9,384,735 | 4 | 6 | 4. The system of claim 2 , wherein the computing device is further configured to transmit the one or more alternate transcriptions to the client device. | 4. The system of claim 2 , wherein the computing device is further configured to transmit the one or more alternate transcriptions to the client device. 6. The system of claim 4 , wherein the one or more alternate transcriptions each have a transcription confidence value that satisfies a threshold. | 0.92364 |
7,882,124 | 18 | 19 | 18. The non-transitory computer-readable storage medium of claim 16 , further comprising instructions for: constructing, based on a set of data, the bipartite representation; wherein the bipartite representation represents a bipartite graph including a first partition and a second partition; wherein the first partition comprises the first set of nodes; wherein the second partition comprises a second set of nodes; wherein each node in the second set of nodes represents a visual word representing visual content in the set of visual words; wherein the instructions for identifying association scores between a linguistic word that is equivalent to the at least one query term and one or more other linguistic words in the set of linguistic words, further comprises instructions for: for each linguistic word in the one or more other linguistic words in the set of linguistic words, for the first node of the bipartite graph that represents the linguistic word, which is associated with the at least one query term and the second node of the bipartite graph, which represents one or more other linguistic words associated with one or more other query terms, deriving, based on the bipartite graph, the association score between the first node and the second node. | 18. The non-transitory computer-readable storage medium of claim 16 , further comprising instructions for: constructing, based on a set of data, the bipartite representation; wherein the bipartite representation represents a bipartite graph including a first partition and a second partition; wherein the first partition comprises the first set of nodes; wherein the second partition comprises a second set of nodes; wherein each node in the second set of nodes represents a visual word representing visual content in the set of visual words; wherein the instructions for identifying association scores between a linguistic word that is equivalent to the at least one query term and one or more other linguistic words in the set of linguistic words, further comprises instructions for: for each linguistic word in the one or more other linguistic words in the set of linguistic words, for the first node of the bipartite graph that represents the linguistic word, which is associated with the at least one query term and the second node of the bipartite graph, which represents one or more other linguistic words associated with one or more other query terms, deriving, based on the bipartite graph, the association score between the first node and the second node. 19. The non-transitory computer-readable storage medium of claim 18 wherein the instructions for deriving the association score between the first node and the second node includes: generating a first set of scores based on a random walk through the bipartite graph; generating a second set of scores based on a random walk, with restart from the first node, through the bipartite graph; and deriving the association score based on the first set of scores and the second set of scores. | 0.805934 |
8,180,810 | 1 | 5 | 1. A method for schema integration, the method comprising: recasting a first source schema into a first graph of concepts with HasA relationships; recasting a second source schema into a second graph of concepts with HasA relationships; identifying matching concepts in the first graph and the second graph based on correspondences between attributes of the concepts of the first and second graphs; enumerating the first graph of concepts and the second graph of concepts to output a plurality of integrated schemas that consider choices of concepts that merge and concepts that do not merge; applying enumeration constraints to determine how the concepts merge; producing an integrated schema from the plurality of integrated schemas, based on a fixed specification of matching concepts to merge; and generating a mapping from the first source schema to the integrated schema and from the second source schema to the integrated schema. | 1. A method for schema integration, the method comprising: recasting a first source schema into a first graph of concepts with HasA relationships; recasting a second source schema into a second graph of concepts with HasA relationships; identifying matching concepts in the first graph and the second graph based on correspondences between attributes of the concepts of the first and second graphs; enumerating the first graph of concepts and the second graph of concepts to output a plurality of integrated schemas that consider choices of concepts that merge and concepts that do not merge; applying enumeration constraints to determine how the concepts merge; producing an integrated schema from the plurality of integrated schemas, based on a fixed specification of matching concepts to merge; and generating a mapping from the first source schema to the integrated schema and from the second source schema to the integrated schema. 5. The method as claimed in claim 1 wherein the integrated schema preserves all attributes and relationships of the first source schema and the second source schema. | 0.766289 |
8,600,930 | 8 | 11 | 8. An information processing method to be performed by an information processing device including a memory unit storing data, comprising the step of receiving a character input representing one of a plurality of expressions of a keyword, wherein said data contains a plurality of stored keywords, a plurality of contents, each being stored in association with at least one of said plurality of stored keywords, and keyword data indicating each keyword of said plurality of stored keywords as being associated with a plurality of potential character inputs corresponding semantically to the keyword but differing in expression, said information processing method further comprising the steps of: retrieving, from among said plurality of stored keywords based on said keyword data, a keyword stored in association with the plurality of potential character inputs which plurality includes the character input that was received; and outputting one of said plurality of contents corresponding to the retrieved keyword. | 8. An information processing method to be performed by an information processing device including a memory unit storing data, comprising the step of receiving a character input representing one of a plurality of expressions of a keyword, wherein said data contains a plurality of stored keywords, a plurality of contents, each being stored in association with at least one of said plurality of stored keywords, and keyword data indicating each keyword of said plurality of stored keywords as being associated with a plurality of potential character inputs corresponding semantically to the keyword but differing in expression, said information processing method further comprising the steps of: retrieving, from among said plurality of stored keywords based on said keyword data, a keyword stored in association with the plurality of potential character inputs which plurality includes the character input that was received; and outputting one of said plurality of contents corresponding to the retrieved keyword. 11. The information processing method according to claim 8 , wherein said keyword data associates one of said plurality of keywords with a plurality of partial character inputs, and in said step of retrieving one of said plurality of keywords, when all of said plurality of partial character inputs are received, the one of said plurality of keywords corresponding to said plurality of partial character inputs is retrieved. | 0.598485 |
7,634,779 | 6 | 7 | 6. The processor as recited in claim 2 , wherein said audio control module comprises: a subtitle control module; and an audio track component module. | 6. The processor as recited in claim 2 , wherein said audio control module comprises: a subtitle control module; and an audio track component module. 7. The processor as recited in claim 6 , wherein said subtitle control module is implemented using an API. | 0.969801 |
7,624,105 | 21 | 22 | 21. The search engine of claim 18 , wherein: a second of the commands comprises a count command embodying the specified range of instances; and a second of the co-processors is dedicated to execute the count command to generate a range signal indicating whether the number of input characters in the selected portion falls within the specified range of instances. | 21. The search engine of claim 18 , wherein: a second of the commands comprises a count command embodying the specified range of instances; and a second of the co-processors is dedicated to execute the count command to generate a range signal indicating whether the number of input characters in the selected portion falls within the specified range of instances. 22. The search engine of claim 21 , wherein: the count command includes one or more boundary values that define the specified range of instances; and the second co-processor compares the number of input characters determined to be members of the specified set of characters to the one or more boundary values to generate the range signal. | 0.834476 |
9,659,218 | 12 | 16 | 12. A client device comprising: a display device; a memory; and a processing device communicably coupled to the display device and the memory, wherein the processing device is to: provide, via a user interface (UI) rendered on the display device, a first content item for playback; receive identification of a content item segment of the first content item, the identified content item segment determined based on a salience score of the identified content item segment that is calculated using a machine-learned model trained on user interaction signals and audio-visual content features of a training set of training content item segments, wherein the user interaction signals comprise scrubbing in the training content item segments; and playback, via the UI, the first content item from a starting point of the identified content item segment. | 12. A client device comprising: a display device; a memory; and a processing device communicably coupled to the display device and the memory, wherein the processing device is to: provide, via a user interface (UI) rendered on the display device, a first content item for playback; receive identification of a content item segment of the first content item, the identified content item segment determined based on a salience score of the identified content item segment that is calculated using a machine-learned model trained on user interaction signals and audio-visual content features of a training set of training content item segments, wherein the user interaction signals comprise scrubbing in the training content item segments; and playback, via the UI, the first content item from a starting point of the identified content item segment. 16. The client device of claim 12 , wherein the playback of the first content item comprises auto-play of the first content item via starting the playback of the first content item at the starting point of the identified content item segment without any user intervention. | 0.832718 |
7,644,101 | 2 | 10 | 2. The system of claim 1 , wherein the first keyword information is selected by the first user directly from the first document data that is displayed when the search task is performed. | 2. The system of claim 1 , wherein the first keyword information is selected by the first user directly from the first document data that is displayed when the search task is performed. 10. The system of claim 2 , further comprising: an advertisement manager configured to search through a plurality of advertisement contents that correspond to the one or more document data indicated by the information obtained from the search result or the document list. | 0.941845 |
9,165,086 | 20 | 28 | 20. One or more non-transitory storage media storing instructions which, when executed by one or more computing devices, cause a method for storing an XML document of a plurality of documents, the method comprising steps of: storing in a persistent repository a persistent representation of the XML document that includes a navigable representation and a streamable representation that is separate from said navigable representation, wherein the XML document includes a tree of nodes in a hierarchical relationship, each node of the tree of nodes having an immediate hierarchical relationship with at least one other node in the tree of nodes, wherein the streamable representation contains nodes of the tree of nodes that are in document order, wherein the navigable representation contains a subset of nodes of the tree of nodes, the subset of nodes including less than all nodes of the tree of nodes, and wherein each particular node of the subset of nodes in the navigable representation includes at least one pointer to content, of said each particular node, that is contained in the streamable representation, and at least one pointer to another node of the subset of nodes in the navigable representation, said at least one pointer to the other node in the navigable representation being one of: a pointer to a parent node of said each particular node, a pointer to a child node of said each particular node, a pointer to a sibling node of said each particular node, or a pointer to a previous sibling node of said each particular node; wherein the steps are performed by one or more computing devices. | 20. One or more non-transitory storage media storing instructions which, when executed by one or more computing devices, cause a method for storing an XML document of a plurality of documents, the method comprising steps of: storing in a persistent repository a persistent representation of the XML document that includes a navigable representation and a streamable representation that is separate from said navigable representation, wherein the XML document includes a tree of nodes in a hierarchical relationship, each node of the tree of nodes having an immediate hierarchical relationship with at least one other node in the tree of nodes, wherein the streamable representation contains nodes of the tree of nodes that are in document order, wherein the navigable representation contains a subset of nodes of the tree of nodes, the subset of nodes including less than all nodes of the tree of nodes, and wherein each particular node of the subset of nodes in the navigable representation includes at least one pointer to content, of said each particular node, that is contained in the streamable representation, and at least one pointer to another node of the subset of nodes in the navigable representation, said at least one pointer to the other node in the navigable representation being one of: a pointer to a parent node of said each particular node, a pointer to a child node of said each particular node, a pointer to a sibling node of said each particular node, or a pointer to a previous sibling node of said each particular node; wherein the steps are performed by one or more computing devices. 28. The one or more non-transitory storage media of claim 20 , wherein one or more nodes are contained in both the navigable representation and the streamable representation; and wherein, for each node of said one or more nodes, the navigable representation contains a pointer to said each node contained in the streamable representation. | 0.711111 |
9,349,371 | 1 | 2 | 1. A speech recognition terminal device capable of communicating with a speech recognition server that carries out speech recognition, the speech recognition terminal device comprising: a speech acquisition device that acquires a speech command spoken by a user; a request device that requests the speech recognition server to carry out the speech recognition of the speech command acquired by the speech acquisition device; a prediction device that predicts a present delay time until a result of the speech recognition of the speech command requested from the request device is obtained from the speech recognition server; a determination device that determines a filler word with a time length in accordance with the present delay time predicted by the prediction device; a filler speaking device that outputs the filler word determined by the determination device as speech information during a waiting time until the result of the speech recognition requested from the request device is obtained from the speech recognition server; a response device that, when the result of the speech recognition is acquired from the speech recognition server, executes a process of responding to the user based on the acquired result of the speech recognition; and an acquiring device that acquires time information expressing past delay times when the communication has been carried out with the speech recognition server in past, wherein based on the past delay times expressed by the time information acquired by the acquisition device, the prediction device predicts the present delay time until the result of the speech recognition requested from the request device is obtained from the speech recognition server. | 1. A speech recognition terminal device capable of communicating with a speech recognition server that carries out speech recognition, the speech recognition terminal device comprising: a speech acquisition device that acquires a speech command spoken by a user; a request device that requests the speech recognition server to carry out the speech recognition of the speech command acquired by the speech acquisition device; a prediction device that predicts a present delay time until a result of the speech recognition of the speech command requested from the request device is obtained from the speech recognition server; a determination device that determines a filler word with a time length in accordance with the present delay time predicted by the prediction device; a filler speaking device that outputs the filler word determined by the determination device as speech information during a waiting time until the result of the speech recognition requested from the request device is obtained from the speech recognition server; a response device that, when the result of the speech recognition is acquired from the speech recognition server, executes a process of responding to the user based on the acquired result of the speech recognition; and an acquiring device that acquires time information expressing past delay times when the communication has been carried out with the speech recognition server in past, wherein based on the past delay times expressed by the time information acquired by the acquisition device, the prediction device predicts the present delay time until the result of the speech recognition requested from the request device is obtained from the speech recognition server. 2. The speech recognition terminal device according to claim 1 , wherein: the acquiring device acquires time information expressing the present delay time when the speech recognition is requested of the speech recognition server by the request device and the result of the speech recognition pertaining to the request is obtained from the speech recognition server. | 0.658879 |
9,653,093 | 1 | 2 | 1. A system comprising: a computer-readable memory storing executable instructions; and one or more physical computer processors in communication with the computer-readable memory, wherein the one or more physical computer processors are programmed by the executable instructions to at least: obtain audio data regarding a user utterance, the audio data comprising a sequence of frames; identify, for a current frame of the sequence of frames, (1) one or more speech recognition decoding graph states corresponding to the current frame, and (2) a window of frames preceding the current frame in the sequence of frames; generate, for a first state of the one or more speech recognition decoding graph states, a parameter of a probability density function, wherein the parameter is generated using an artificial neural network, and wherein input into the artificial neural network comprises data regarding the first state and a plurality of feature vectors corresponding to the window of frames; generate, for the first state of the one or more speech recognition decoding graph states, a first score using a feature vector corresponding to the current frame and the parameter of the probability density function generated using the first state; and select at least one state to add to the speech recognition decoding graph based at least partly on the first score and the first state. | 1. A system comprising: a computer-readable memory storing executable instructions; and one or more physical computer processors in communication with the computer-readable memory, wherein the one or more physical computer processors are programmed by the executable instructions to at least: obtain audio data regarding a user utterance, the audio data comprising a sequence of frames; identify, for a current frame of the sequence of frames, (1) one or more speech recognition decoding graph states corresponding to the current frame, and (2) a window of frames preceding the current frame in the sequence of frames; generate, for a first state of the one or more speech recognition decoding graph states, a parameter of a probability density function, wherein the parameter is generated using an artificial neural network, and wherein input into the artificial neural network comprises data regarding the first state and a plurality of feature vectors corresponding to the window of frames; generate, for the first state of the one or more speech recognition decoding graph states, a first score using a feature vector corresponding to the current frame and the parameter of the probability density function generated using the first state; and select at least one state to add to the speech recognition decoding graph based at least partly on the first score and the first state. 2. The system of claim 1 , wherein the probability density function models a distribution of feature vectors that correspond to a given state and a given set of preceding frames. | 0.801782 |
9,864,803 | 13 | 14 | 13. A non-transitory computer-readable medium having computer program for, when being executed by a processor, performing a method for multimodal clue based personalized app function recommendation, the method comprising: receiving an app search query from a user; obtaining a plurality of real-time clues collected from the user; extracting a plurality of features to represent the plurality of real-time clues collected from the user, wherein the plurality of features include structured features and text features; based on the plurality of extracted features, generating a joint representation of a multimodal clue, comprising: using a multimodal Deep Boltzmann Machine (DBM) to construct two separate two-layer DBMs to model distribution over the structured features and the text features respectively; and combining the two separate two-layer DBMs by adding an additional layer of binary hidden units on the top of the two-layer DBMs; based on the joint representation of the multimodal clue, creating a logistic regression model; ranking a list of app functions using the logistic regression model; and displaying a ranked app function list for the user. | 13. A non-transitory computer-readable medium having computer program for, when being executed by a processor, performing a method for multimodal clue based personalized app function recommendation, the method comprising: receiving an app search query from a user; obtaining a plurality of real-time clues collected from the user; extracting a plurality of features to represent the plurality of real-time clues collected from the user, wherein the plurality of features include structured features and text features; based on the plurality of extracted features, generating a joint representation of a multimodal clue, comprising: using a multimodal Deep Boltzmann Machine (DBM) to construct two separate two-layer DBMs to model distribution over the structured features and the text features respectively; and combining the two separate two-layer DBMs by adding an additional layer of binary hidden units on the top of the two-layer DBMs; based on the joint representation of the multimodal clue, creating a logistic regression model; ranking a list of app functions using the logistic regression model; and displaying a ranked app function list for the user. 14. The non-transitory computer-readable medium according to claim 13 , wherein obtaining the plurality of real-time clues collected from the user further includes: collecting structured spatiotemporal signals captured by multiple types of sensors, wherein the structured spatiotemporal signals include time, latitude, longitude, speed, and GPS accuracy; and collecting unstructured text data from one of app content pages and the user. | 0.694678 |
8,909,513 | 9 | 15 | 9. A system comprising: one or more computers programmed to perform operations comprising: selecting one or more segments from a text field, wherein each of the segments is in proximity to a current position of an input cursor in the text field; analyzing the segments to determine a respective context for each of the segments, wherein the context is at least one of a respective target subtext or a respective target meaning of the segment; for one or more of the segments, identifying a respective candidate emoticon for the segment based on an association between the candidate emoticon and the context of the segment, the association exceeding a threshold value and being based on, at least, statistical usage of the candidate emoticon for the context by one or more users, wherein a strength of the association varies according to the statistical usage; providing one or more of the candidate emoticons for user selection, the candidate emoticons for user selection being based on at least one of a user preference, user-related information, and recipient-related information; receiving user selection of one or more of the provided emoticons and inserting the selected emoticons into the text field at the current position of the input cursor; and updating the statistical usage of at least one of the provided emoticons based on the user selection. | 9. A system comprising: one or more computers programmed to perform operations comprising: selecting one or more segments from a text field, wherein each of the segments is in proximity to a current position of an input cursor in the text field; analyzing the segments to determine a respective context for each of the segments, wherein the context is at least one of a respective target subtext or a respective target meaning of the segment; for one or more of the segments, identifying a respective candidate emoticon for the segment based on an association between the candidate emoticon and the context of the segment, the association exceeding a threshold value and being based on, at least, statistical usage of the candidate emoticon for the context by one or more users, wherein a strength of the association varies according to the statistical usage; providing one or more of the candidate emoticons for user selection, the candidate emoticons for user selection being based on at least one of a user preference, user-related information, and recipient-related information; receiving user selection of one or more of the provided emoticons and inserting the selected emoticons into the text field at the current position of the input cursor; and updating the statistical usage of at least one of the provided emoticons based on the user selection. 15. The system of claim 9 wherein the user-related information includes a user interest, a user ethnicity, a user religion, a user geographic location, a user age, a user relational status, and a user occupation. | 0.752336 |
8,229,747 | 19 | 20 | 19. The non-transitory computer-readable storage medium of claim 15 , the instructions further comprising: controlling the processor to generate a final letter string based on the database of words. | 19. The non-transitory computer-readable storage medium of claim 15 , the instructions further comprising: controlling the processor to generate a final letter string based on the database of words. 20. The non-transitory computer-readable storage medium of claim 19 , wherein the final letter string based on the database of words further comprises using a finite state network that accepts only valid letter strings. | 0.848128 |
10,007,712 | 1 | 3 | 1. One or more non-transitory computer-readable media storing computer-executable instructions that, when executed by one or more processors of a computing device, cause the one or more processors to perform acts comprising: receiving, at the computing device, a plurality of transaction phrase tokens, individual ones of the plurality of transaction phrase tokens being associated with one or more user-specified storage rules identifying different storage locations in a memory of the computing device and one or more user-specified communication rules identifying different sets of one or more destination computer devices that are external to the computing device; storing the plurality of transaction phrase tokens, the one or more user-specified storage rules, and the one or more user-specified communication rules in the memory of the computing device; receiving, at the computing device from a user device over a network, a message having a syntax that includes a transaction phrase token, a customized content type indicator, and a content element; interpreting the message to extract the transaction phrase token, the customized content type indicator, and the content element; identifying, in the memory, the transaction phrase token within the plurality of transaction phrase tokens; identifying, in the memory, a particular user-specified storage rule within the one or more user-specified storage rules that is associated with a combination of the transaction phrase token and the customized content type indicator; storing the content element in the storage location identified by the particular user-specified storage rule; identifying, in the memory, a particular user-specified communication rule within the one or more user-specified communication rules that is associated with the combination of the transaction phrase token and the customized content type indicator; and causing the content element, or information associated with the content element, to be sent over the network to the one or more destination computer devices identified by the particular user-specified communication rule. | 1. One or more non-transitory computer-readable media storing computer-executable instructions that, when executed by one or more processors of a computing device, cause the one or more processors to perform acts comprising: receiving, at the computing device, a plurality of transaction phrase tokens, individual ones of the plurality of transaction phrase tokens being associated with one or more user-specified storage rules identifying different storage locations in a memory of the computing device and one or more user-specified communication rules identifying different sets of one or more destination computer devices that are external to the computing device; storing the plurality of transaction phrase tokens, the one or more user-specified storage rules, and the one or more user-specified communication rules in the memory of the computing device; receiving, at the computing device from a user device over a network, a message having a syntax that includes a transaction phrase token, a customized content type indicator, and a content element; interpreting the message to extract the transaction phrase token, the customized content type indicator, and the content element; identifying, in the memory, the transaction phrase token within the plurality of transaction phrase tokens; identifying, in the memory, a particular user-specified storage rule within the one or more user-specified storage rules that is associated with a combination of the transaction phrase token and the customized content type indicator; storing the content element in the storage location identified by the particular user-specified storage rule; identifying, in the memory, a particular user-specified communication rule within the one or more user-specified communication rules that is associated with the combination of the transaction phrase token and the customized content type indicator; and causing the content element, or information associated with the content element, to be sent over the network to the one or more destination computer devices identified by the particular user-specified communication rule. 3. One or more non-transitory computer-readable media as recited in claim 1 , wherein the content element comprises a string of text, a link, a web page, an image, or a video. | 0.870944 |
7,996,416 | 10 | 11 | 10. The machine-readable storage medium of claim 9 , wherein the method further comprises mapping the first SQL query statement with the predicted data type of the wildcard parameter to a corresponding data entry of the relational database based on metadata that defines a set of rules for mapping a query statement to one compatible with the format of the relational database. | 10. The machine-readable storage medium of claim 9 , wherein the method further comprises mapping the first SQL query statement with the predicted data type of the wildcard parameter to a corresponding data entry of the relational database based on metadata that defines a set of rules for mapping a query statement to one compatible with the format of the relational database. 11. The machine-readable storage medium of claim 10 , wherein the method further comprises performing a query analysis on the first SQL query statement to generate the syntax tree. | 0.945718 |
7,650,282 | 5 | 6 | 5. The method of claim 4 wherein the component events include subword units. | 5. The method of claim 4 wherein the component events include subword units. 6. The method of claim 5 wherein the subword units include phonemes. | 0.977333 |
9,697,180 | 17 | 18 | 17. The system of claim 16 , wherein the processor also: places a second portion of the text string within the second plurality of segments. | 17. The system of claim 16 , wherein the processor also: places a second portion of the text string within the second plurality of segments. 18. The system of claim 17 , wherein the first line band comprises a first text height, wherein the second line band comprises a second text height, and wherein the first text height and second text height are different. | 0.951542 |
9,069,746 | 2 | 5 | 2. The method of claim 1 , wherein the electronic clinical document comprises a plurality of sections. | 2. The method of claim 1 , wherein the electronic clinical document comprises a plurality of sections. 5. The method of claim 2 , wherein the plurality of sections are displayed within a single tab. | 0.960679 |
8,612,432 | 15 | 20 | 15. A system comprising: at least one computing device; and a provider that: receives item category data, wherein the item category data comprises a plurality of nodes and each node is associated with an item category of a plurality of item categories; receives a plurality of queries; for each query of the plurality of queries, provides an indicator of one or more items that are responsive to the query of a plurality of items, wherein the plurality of items comprise at least one of products or services; for each query of the plurality of queries, receives a selection of an item indicated by the provided indicator of one or more items; receives item data that associates an item category of a plurality of item categories with each item of the plurality of items; based on the item selected for each query of the plurality of queries and the item category associated with each item, generates training data, wherein the training data comprises a mapping of queries to item categories; for each query and item category in the mapping, determines a count of the number of times that the item category is associated with the query in the mapping ; combine the training data and item category data by, for each determined count for each item category, associating the determined count with the node of the plurality of nodes associated with the item category; receives another query; receives a classifier, wherein the classifier, when applied to a node of plurality of nodes using the received query by the provider, results in a generated probability that the received query is intended for the item category associated with the node; applies the classifier to the plurality of nodes using the received query until a generated probability for a node is below a threshold probability resulting in list of item categories and a generated probability for each item category; ranks the item categories in the list of item categories based on the generated probabilities and a popularity associated with each item category; and provides the item categories in a ranked order. | 15. A system comprising: at least one computing device; and a provider that: receives item category data, wherein the item category data comprises a plurality of nodes and each node is associated with an item category of a plurality of item categories; receives a plurality of queries; for each query of the plurality of queries, provides an indicator of one or more items that are responsive to the query of a plurality of items, wherein the plurality of items comprise at least one of products or services; for each query of the plurality of queries, receives a selection of an item indicated by the provided indicator of one or more items; receives item data that associates an item category of a plurality of item categories with each item of the plurality of items; based on the item selected for each query of the plurality of queries and the item category associated with each item, generates training data, wherein the training data comprises a mapping of queries to item categories; for each query and item category in the mapping, determines a count of the number of times that the item category is associated with the query in the mapping ; combine the training data and item category data by, for each determined count for each item category, associating the determined count with the node of the plurality of nodes associated with the item category; receives another query; receives a classifier, wherein the classifier, when applied to a node of plurality of nodes using the received query by the provider, results in a generated probability that the received query is intended for the item category associated with the node; applies the classifier to the plurality of nodes using the received query until a generated probability for a node is below a threshold probability resulting in list of item categories and a generated probability for each item category; ranks the item categories in the list of item categories based on the generated probabilities and a popularity associated with each item category; and provides the item categories in a ranked order. 20. The system of claim 15 , wherein the provider further adjusts the threshold probability to increase the precision of the ranked item categories or to provide more specific item categories. | 0.845907 |
8,346,303 | 7 | 10 | 7. A system comprising: a communication device comprising a microphone, a speaker, an input device, a display, and an antenna; a voice communicating implementer, wherein voice communication is implemented with another device in a wireless fashion; a bold formatting implementer, wherein the alphanumeric data selected by the user is changed to bold; an italic formatting implementer, wherein the alphanumeric data selected by the user is changed to italic; and a multiple language mode implementer, wherein the language mode selected by the user is implemented, wherein said language mode selected is one of a plurality of language modes including a first language mode and a second language mode; wherein when said first language mode is selected by the user, a first command which is the command for the user to manipulate said communication device in a first manner and a second command which is the command for the user to manipulate said communication device in a second manner are displayed by utilizing a first language data; wherein when said second language mode is selected by the user, said first command which is the command for the user to manipulate said communication device in said first manner and said second command which is the command for the user to manipulate said communication device in said second manner are displayed by utilizing a second language data; wherein when said communication device is powered off under said first language mode and powered on thereafter, said first command and said second command after said communication device is powered on are automatically displayed by utilizing said first language data; and wherein when said communication device is powered off under said second language mode and powered on thereafter, said first command and said second command after said communication device is powered on are automatically displayed by utilizing said second language data. | 7. A system comprising: a communication device comprising a microphone, a speaker, an input device, a display, and an antenna; a voice communicating implementer, wherein voice communication is implemented with another device in a wireless fashion; a bold formatting implementer, wherein the alphanumeric data selected by the user is changed to bold; an italic formatting implementer, wherein the alphanumeric data selected by the user is changed to italic; and a multiple language mode implementer, wherein the language mode selected by the user is implemented, wherein said language mode selected is one of a plurality of language modes including a first language mode and a second language mode; wherein when said first language mode is selected by the user, a first command which is the command for the user to manipulate said communication device in a first manner and a second command which is the command for the user to manipulate said communication device in a second manner are displayed by utilizing a first language data; wherein when said second language mode is selected by the user, said first command which is the command for the user to manipulate said communication device in said first manner and said second command which is the command for the user to manipulate said communication device in said second manner are displayed by utilizing a second language data; wherein when said communication device is powered off under said first language mode and powered on thereafter, said first command and said second command after said communication device is powered on are automatically displayed by utilizing said first language data; and wherein when said communication device is powered off under said second language mode and powered on thereafter, said first command and said second command after said communication device is powered on are automatically displayed by utilizing said second language data. 10. The system of claim 7 , wherein said voice communication and one of said first language mode and said second language mode selected by the user are implemented simultaneously. | 0.596847 |
7,870,130 | 1 | 3 | 1. A method of facilitating identification of a matching search term in one or more images within a document, comprising: displaying a document on a display; selecting at least a portion of an image that is included within the document; receiving, via an input device, location coordinates for the selected portion of the image, wherein the location coordinates provide a location portion that identifies a location of the selected portion of the image within the document; and creating search enriched metadata for the document, wherein the search enriched metadata includes a text portion that provides one or more search terms that are associated with the selected portion of the image and the location portion. | 1. A method of facilitating identification of a matching search term in one or more images within a document, comprising: displaying a document on a display; selecting at least a portion of an image that is included within the document; receiving, via an input device, location coordinates for the selected portion of the image, wherein the location coordinates provide a location portion that identifies a location of the selected portion of the image within the document; and creating search enriched metadata for the document, wherein the search enriched metadata includes a text portion that provides one or more search terms that are associated with the selected portion of the image and the location portion. 3. The method of claim 1 , wherein the input device is a mouse. | 0.934511 |
8,478,735 | 1 | 13 | 1. A method for obtaining ranked search results including names of ranked experts who are members of a social network and presenting the ranked search results to a user performing a search from a user interface of a user device, the user being registered on the social network and having connections thereon, the method comprising: collecting, by a social search server, searchable data representative of different activities of the members of the social network, the social search server being connected to a server hosting the social network via a communication network, wherein the data being collected represent different combinations of: posting, liking, commenting on, providing links, living in a given location, sharing content, providing articles, and providing videos; indexing, by an indexing engine, the data representative of the different activities of the members on the social network to produce indexed activity data; receiving, by the social search server, a search query relative to a subject along with a user identifier from the user device; using the search query and the user identifier, ranking, by the social search server, members from only the user's connections based on their activities on the social network related to the subject to obtain the names of ranked experts for the subject, the ranking comprising assigning a weight to each different activity whereby the ranking of the members will be influenced by the different activities performed and the ranking assigned to each different activity; returning, by the social search server, the names of ranked experts for the subject to the user device; and presenting, on the user interface, the names of ranked experts for the subject. | 1. A method for obtaining ranked search results including names of ranked experts who are members of a social network and presenting the ranked search results to a user performing a search from a user interface of a user device, the user being registered on the social network and having connections thereon, the method comprising: collecting, by a social search server, searchable data representative of different activities of the members of the social network, the social search server being connected to a server hosting the social network via a communication network, wherein the data being collected represent different combinations of: posting, liking, commenting on, providing links, living in a given location, sharing content, providing articles, and providing videos; indexing, by an indexing engine, the data representative of the different activities of the members on the social network to produce indexed activity data; receiving, by the social search server, a search query relative to a subject along with a user identifier from the user device; using the search query and the user identifier, ranking, by the social search server, members from only the user's connections based on their activities on the social network related to the subject to obtain the names of ranked experts for the subject, the ranking comprising assigning a weight to each different activity whereby the ranking of the members will be influenced by the different activities performed and the ranking assigned to each different activity; returning, by the social search server, the names of ranked experts for the subject to the user device; and presenting, on the user interface, the names of ranked experts for the subject. 13. The method of claim 1 , wherein the social network comprises a plurality of social networks and the step of indexing data thereby comprises indexing data representative of activities of members of the plurality of social networks. | 0.634375 |
8,522,140 | 30 | 33 | 30. A computer-implemented method for automatically positioning a plurality of text elements in an area of a markup language design of at least a portion of a document, the markup language design defining a plurality of text elements each having a defined relative vertical positioning order, and further defining one or more vertical spacing distances, the one or more vertical spacing distances comprising one or more of either or both of a defined vertical spacing distance between adjacent text elements in the markup language design and a defined vertical spacing distance between data within the text elements in the markup language design, the method comprising: storing one or more design tools configured to allow a user to specify text content for one or more of the text elements in the markup language design, and further configured to determine which of the plurality of text elements have specified text content, determine at least the height of each of the determined text elements having specified text content, and based on at least the determined text element heights, the one or more vertical spacing distances, and the defined positioning order, position each of those text elements having specified text content in the area such that each text element in the area is vertically separated from each adjacent text element by a defined spacing distance, whereby the layout of the text elements having specified text content is determined; and downloading said one or more design tools to a client computer system for execution at the client computer system. | 30. A computer-implemented method for automatically positioning a plurality of text elements in an area of a markup language design of at least a portion of a document, the markup language design defining a plurality of text elements each having a defined relative vertical positioning order, and further defining one or more vertical spacing distances, the one or more vertical spacing distances comprising one or more of either or both of a defined vertical spacing distance between adjacent text elements in the markup language design and a defined vertical spacing distance between data within the text elements in the markup language design, the method comprising: storing one or more design tools configured to allow a user to specify text content for one or more of the text elements in the markup language design, and further configured to determine which of the plurality of text elements have specified text content, determine at least the height of each of the determined text elements having specified text content, and based on at least the determined text element heights, the one or more vertical spacing distances, and the defined positioning order, position each of those text elements having specified text content in the area such that each text element in the area is vertically separated from each adjacent text element by a defined spacing distance, whereby the layout of the text elements having specified text content is determined; and downloading said one or more design tools to a client computer system for execution at the client computer system. 33. The method of claim 30 wherein the one or more design tools are further configured to determine the total combined height of the text elements having specified text content and the one or more vertical spacing distances before determining a position for the text elements and, if the total combined height is greater than the height of the area, to iteratively reduce at least the text font size of at least some of the text elements, determine a new height of each text element having text content at the reduced font size, and determine a new total combined height until the total combined height is less than or equal to the available height of the area. | 0.738528 |
7,613,722 | 8 | 10 | 8. In a computer network, a method comprising, receiving at an information source first preference information of a user; determining at the information source that a notification is to be sent; accessing the first preference information received at the information source to set information in the notification; receiving the notification from the information source; accessing second preference information of the user stored in a main preference store; modifying the set information in the notification based on the second preference information; and sending the notification including the information modified therein to a device of the user; wherein the notification, the first preference information and the second preference information are each regularized according to a notification schema, a source preference schema and a main preference schema, respectively; and wherein the source preference schema and the main preference schema comprise a common schema. | 8. In a computer network, a method comprising, receiving at an information source first preference information of a user; determining at the information source that a notification is to be sent; accessing the first preference information received at the information source to set information in the notification; receiving the notification from the information source; accessing second preference information of the user stored in a main preference store; modifying the set information in the notification based on the second preference information; and sending the notification including the information modified therein to a device of the user; wherein the notification, the first preference information and the second preference information are each regularized according to a notification schema, a source preference schema and a main preference schema, respectively; and wherein the source preference schema and the main preference schema comprise a common schema. 10. The method of claim 8 , further comprising, selecting a device to which the notification is to be sent, and further comprising, further modifying information in the notification based on properties of the device. | 0.769723 |
9,224,172 | 8 | 14 | 8. An apparatus, comprising: one or more processors; one or more network interfaces; a memory for tangibly storing thereon program logic for execution by the processor, the program logic comprising: detecting logic executed by the processor for detecting the presence of a first user of an online social network; delivering logic executed by the processor for delivering content to the first user via the one or more network interfaces, the content allowing enhancement by the first user; receiving logic executed by the processor for receiving via the one or more network interfaces one or more enhancements to the content by the first user; detecting logic executed by the processor for detecting via the one or more network interfaces the presence of a second user on the social network, the second user different than the first user, the detecting the presence of the second user comprising detecting that a first client node to which the content may be displayed is geographically proximate to a second client node associated with the second user; determining logic executed by the processor for determining a social context of the second user, the social context comprising data associated with the second user with respect to the social network, the data associated with the second user with respect to the social network comprising data related to an interaction with the particular content by friends or contacts of the second user; modifying logic executed by the processor for modifying the content, the modifying based on the determined social context of the second user and the one or more enhancements to the content by the first user; notifying logic executed by the processor for notifying the second user that the content has been modified by the first user, the notifying comprising displaying at least a portion of the modified content; and delivering logic executed by the processor for delivering the modified content to the second user via the one or more network interfaces, the delivering comprising displaying the modified content to the first client node in response to the determination that the first client node is geographically proximate to the second client node. | 8. An apparatus, comprising: one or more processors; one or more network interfaces; a memory for tangibly storing thereon program logic for execution by the processor, the program logic comprising: detecting logic executed by the processor for detecting the presence of a first user of an online social network; delivering logic executed by the processor for delivering content to the first user via the one or more network interfaces, the content allowing enhancement by the first user; receiving logic executed by the processor for receiving via the one or more network interfaces one or more enhancements to the content by the first user; detecting logic executed by the processor for detecting via the one or more network interfaces the presence of a second user on the social network, the second user different than the first user, the detecting the presence of the second user comprising detecting that a first client node to which the content may be displayed is geographically proximate to a second client node associated with the second user; determining logic executed by the processor for determining a social context of the second user, the social context comprising data associated with the second user with respect to the social network, the data associated with the second user with respect to the social network comprising data related to an interaction with the particular content by friends or contacts of the second user; modifying logic executed by the processor for modifying the content, the modifying based on the determined social context of the second user and the one or more enhancements to the content by the first user; notifying logic executed by the processor for notifying the second user that the content has been modified by the first user, the notifying comprising displaying at least a portion of the modified content; and delivering logic executed by the processor for delivering the modified content to the second user via the one or more network interfaces, the delivering comprising displaying the modified content to the first client node in response to the determination that the first client node is geographically proximate to the second client node. 14. The apparatus of claim 8 , wherein the delivered modified content is based on at least one of a temporal context, a geographical context, and a behavioral context of at least one of the first user and the second user. | 0.776316 |
9,753,555 | 9 | 11 | 9. A method for controlling a pen type multimedia device, the method comprises: providing the pen type multimedia device, the pen type multimedia device comprising a body having a rollable display and a groove formed on one side of the body, a size of the groove corresponds to a size of the rollable display; acquiring an image via a camera of the pen type multimedia device; sensing a pattern of movement of the pen type multimedia device via an accelerometer sensor of the pen type multimedia device; converting the pattern sensed through the accelerometer sensor to a handwriting using the sensor within an input time, wherein the input time is a predetermined time from a time the image is acquired; displaying the image on the rollable display; when the handwriting comprises a text, adding the text to the image displayed on the rollable display; and when the handwriting comprises a geometric shape and a text, performing a specific function within the pen type multimedia device corresponding to the handwriting for processing the image. | 9. A method for controlling a pen type multimedia device, the method comprises: providing the pen type multimedia device, the pen type multimedia device comprising a body having a rollable display and a groove formed on one side of the body, a size of the groove corresponds to a size of the rollable display; acquiring an image via a camera of the pen type multimedia device; sensing a pattern of movement of the pen type multimedia device via an accelerometer sensor of the pen type multimedia device; converting the pattern sensed through the accelerometer sensor to a handwriting using the sensor within an input time, wherein the input time is a predetermined time from a time the image is acquired; displaying the image on the rollable display; when the handwriting comprises a text, adding the text to the image displayed on the rollable display; and when the handwriting comprises a geometric shape and a text, performing a specific function within the pen type multimedia device corresponding to the handwriting for processing the image. 11. The method of claim 9 , wherein, when the handwriting comprises a geometrical shape corresponding to a storage folder selection input and the text, the specific function is storing the image to a folder corresponding to the text. | 0.715159 |
4,735,515 | 9 | 11 | 9. A printing apparatus connectible to a different keyboard for a different country, comprising: a processor of stored-program type with a data bus and an address bus for controlling the printing operation sequence of the apparatus; a keyboard for entering character codes; buffer means for storing a character code entered by said keyboard; a character generator connected to the output of said buffer means to be addressed by the character code stored in said buffer means for generating one of a group of character patterns common to countries, which corresponds to the addressed one, at the output thereof, wherein said processor controls said buffer means to address said character generator by the character code stored in said buffer means for generating one of said group of character patterns; identification means for generating an identification signal representative of the country which corresponds to said keyboard; a processor-accessible memory connected to the address bus of said processor to be addressed by an address signal issued from said processor and producing data at the addressed location on the data bus, said memory storing character patterns other than the group of character patterns; and interrupt means for generating an interrupt signal when the character code stored in said buffer means is determined to correspond to one of said other character patterns by referring to the identification signal, wherein said processor in response to the interrupt signal halts said buffer means to generate one of said group of character patterns and instead receives the character code stored in said buffer means to convert the received character code into an address signal and accesses said memory by the converted address signal through the address bus for generating one of the other character patterns on the data bus. | 9. A printing apparatus connectible to a different keyboard for a different country, comprising: a processor of stored-program type with a data bus and an address bus for controlling the printing operation sequence of the apparatus; a keyboard for entering character codes; buffer means for storing a character code entered by said keyboard; a character generator connected to the output of said buffer means to be addressed by the character code stored in said buffer means for generating one of a group of character patterns common to countries, which corresponds to the addressed one, at the output thereof, wherein said processor controls said buffer means to address said character generator by the character code stored in said buffer means for generating one of said group of character patterns; identification means for generating an identification signal representative of the country which corresponds to said keyboard; a processor-accessible memory connected to the address bus of said processor to be addressed by an address signal issued from said processor and producing data at the addressed location on the data bus, said memory storing character patterns other than the group of character patterns; and interrupt means for generating an interrupt signal when the character code stored in said buffer means is determined to correspond to one of said other character patterns by referring to the identification signal, wherein said processor in response to the interrupt signal halts said buffer means to generate one of said group of character patterns and instead receives the character code stored in said buffer means to convert the received character code into an address signal and accesses said memory by the converted address signal through the address bus for generating one of the other character patterns on the data bus. 11. A printing apparatus according to claim 9, wherein said interrupt means also generates a selection signal to select said character generator when the character code stored in said buffer means is common to countries by referring to the identification signal from said identification means. | 0.501701 |
8,700,612 | 15 | 22 | 15. A non-transitory computer-readable storage medium storing instructions that, when executed, cause a processing device to perform a method comprising: receiving a search input; selecting a first cell within a matrix of cells in response to the search input, wherein each cell within the matrix of cells includes searchable data, the first cell is selected based upon the first cell including searchable data related to the search input, and the first cell further includes a first link assigned a causal context relationship and providing a navigation link from the first cell to a causal context cell corresponding to the first cell, a second link assigned an inclusion contextual relationship and providing a navigation link from the first cell to an inclusion context cell corresponding to the first cell, a third link assigned a temporal contextual relationship and providing a navigation link from the first cell to a temporal context cell corresponding to the first cell, and fourth link assigned a spatial contextual relationship and providing a navigation link from the first cell to a spatial context cell corresponding to the first cell; displaying, in response to the search input, a portion of the searchable data of the first cell and first, second, third, and fourth selectable objects, the first selectable object corresponding to the first link, the second selectable object corresponding to the second link, the third selectable object corresponding to the third link, and the fourth selectable object corresponding to the fourth link; receiving selection of the first, second, third, or fourth of the plurality of selectable objects; and utilizing the corresponding link to display a context cell corresponding to the first cell, wherein selection of a first of the plurality of selectable objects results in the computer utilizing the first link to select and display the causal context cell corresponding to the first cell, the display of the causal context cell including displaying a subject of the first cell as causing or influencing one or more subjects of other cells or as being caused or influenced by one or more subjects of other cells, wherein selection of a second of the plurality of selectable objects results in the computer utilizing the second link to select and display the inclusion context cell corresponding to the first cell, the display of the inclusion context cell including displaying the subject of the first cell within a category along with subjects of other cells included within the category, wherein selection of a third of the plurality of selectable objects results in the computer utilizing the third link to select and display the temporal context cell corresponding to the first cell, the display of the temporal context cell including displaying the subject of the first cell within a timeline along with subjects of other cells of relevance within the timeline, wherein selection of a fourth of the plurality of selectable objects results in the computer utilizing the fourth link to select and display the spatial context cell corresponding to the first cell, the display of the spatial context cell including displaying a location corresponding to the subject of the first cell within a map, and when the received selection is of the first of the plurality of selectable objects, the method further comprising receiving a command to alter the zoom of the display of the corresponding portion of the data of the first cell and the first set of other data and, in response to the zoom command, adding or removing subjects that served as a cause of or influence upon the subject of the first cell, or adding or removing subjects that were caused or influenced by the subject of the first cell. | 15. A non-transitory computer-readable storage medium storing instructions that, when executed, cause a processing device to perform a method comprising: receiving a search input; selecting a first cell within a matrix of cells in response to the search input, wherein each cell within the matrix of cells includes searchable data, the first cell is selected based upon the first cell including searchable data related to the search input, and the first cell further includes a first link assigned a causal context relationship and providing a navigation link from the first cell to a causal context cell corresponding to the first cell, a second link assigned an inclusion contextual relationship and providing a navigation link from the first cell to an inclusion context cell corresponding to the first cell, a third link assigned a temporal contextual relationship and providing a navigation link from the first cell to a temporal context cell corresponding to the first cell, and fourth link assigned a spatial contextual relationship and providing a navigation link from the first cell to a spatial context cell corresponding to the first cell; displaying, in response to the search input, a portion of the searchable data of the first cell and first, second, third, and fourth selectable objects, the first selectable object corresponding to the first link, the second selectable object corresponding to the second link, the third selectable object corresponding to the third link, and the fourth selectable object corresponding to the fourth link; receiving selection of the first, second, third, or fourth of the plurality of selectable objects; and utilizing the corresponding link to display a context cell corresponding to the first cell, wherein selection of a first of the plurality of selectable objects results in the computer utilizing the first link to select and display the causal context cell corresponding to the first cell, the display of the causal context cell including displaying a subject of the first cell as causing or influencing one or more subjects of other cells or as being caused or influenced by one or more subjects of other cells, wherein selection of a second of the plurality of selectable objects results in the computer utilizing the second link to select and display the inclusion context cell corresponding to the first cell, the display of the inclusion context cell including displaying the subject of the first cell within a category along with subjects of other cells included within the category, wherein selection of a third of the plurality of selectable objects results in the computer utilizing the third link to select and display the temporal context cell corresponding to the first cell, the display of the temporal context cell including displaying the subject of the first cell within a timeline along with subjects of other cells of relevance within the timeline, wherein selection of a fourth of the plurality of selectable objects results in the computer utilizing the fourth link to select and display the spatial context cell corresponding to the first cell, the display of the spatial context cell including displaying a location corresponding to the subject of the first cell within a map, and when the received selection is of the first of the plurality of selectable objects, the method further comprising receiving a command to alter the zoom of the display of the corresponding portion of the data of the first cell and the first set of other data and, in response to the zoom command, adding or removing subjects that served as a cause of or influence upon the subject of the first cell, or adding or removing subjects that were caused or influenced by the subject of the first cell. 22. The non-transitory computer-readable medium of claim 15 , wherein the instructions, when executed, cause the processing device to perform a method further comprising: prompting a user to select a different zoom level or a second cell based upon a compiled history for the user. | 0.725586 |
9,817,949 | 2 | 4 | 2. The method of claim 1 further comprising: determining by the one or more computers a prediction of mental health status of the groups. | 2. The method of claim 1 further comprising: determining by the one or more computers a prediction of mental health status of the groups. 4. The method of claim 2 wherein the prediction is suicidal ideation. | 0.975823 |