patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|---|---|---|
7,548,913 | 3 | 4 | 3. The method of claim 1 , wherein obtaining information about the topic further comprises: assigning the topic to one or more categories; and determining whether the topic is ambiguous based on the one or more categories to which the topic is assigned. | 3. The method of claim 1 , wherein obtaining information about the topic further comprises: assigning the topic to one or more categories; and determining whether the topic is ambiguous based on the one or more categories to which the topic is assigned. 4. The method of claim 3 , wherein the topic may be determined to be ambiguous if the topic is assigned to more than one category. | 0.779661 |
8,954,526 | 18 | 19 | 18. A system that provides data source abstraction layer for an application, the system comprising: a client computing device embedded with memory and a processor, wherein said memory further comprises: a communication manager configured to: create and hold one or more communication channels for obtaining a resource from an external source, receive a request to obtain the resource from the external source, identify a communication channel configured to handle the request, and cause the communication channel to obtain the resource from the external source; a URL object that resource and is configured to: cause a data update to be implemented on the resource in response to receiving a call from a user interface component to implement the data update; a bind operation handler that is configured to: create a binding between a user interface component associated with the application and the resource by associating the user interface component with the URL object; and a document manager configured to provide a request to the communication manager to obtain the resource if the resource is accessible from the external source and hold one or more document objects that allows the application to access the resource; wherein the bind operation handler and the URL object are provided by a virtual machine; and wherein program logic of the application is defined separately from the virtual machine. | 18. A system that provides data source abstraction layer for an application, the system comprising: a client computing device embedded with memory and a processor, wherein said memory further comprises: a communication manager configured to: create and hold one or more communication channels for obtaining a resource from an external source, receive a request to obtain the resource from the external source, identify a communication channel configured to handle the request, and cause the communication channel to obtain the resource from the external source; a URL object that resource and is configured to: cause a data update to be implemented on the resource in response to receiving a call from a user interface component to implement the data update; a bind operation handler that is configured to: create a binding between a user interface component associated with the application and the resource by associating the user interface component with the URL object; and a document manager configured to provide a request to the communication manager to obtain the resource if the resource is accessible from the external source and hold one or more document objects that allows the application to access the resource; wherein the bind operation handler and the URL object are provided by a virtual machine; and wherein program logic of the application is defined separately from the virtual machine. 19. The system as recited in claim 18 , wherein the document object provides a runtime representation of an XML document having methods for performing a plurality of data manipulation primitives on the XML document. | 0.5 |
8,527,307 | 7 | 8 | 7. The system according to claim 6 , further comprising: one or more clients connected to said network communications channel, said one or more clients being configured to allow input of said feedback for said aspect of said retail establishment of said one or more retail establishments, said one or more clients being configured to send inquiries from said user with respect to said one or more retail establishments; said one or more clients being configured to communicate to a server of said one or more servers a respective location of said user. | 7. The system according to claim 6 , further comprising: one or more clients connected to said network communications channel, said one or more clients being configured to allow input of said feedback for said aspect of said retail establishment of said one or more retail establishments, said one or more clients being configured to send inquiries from said user with respect to said one or more retail establishments; said one or more clients being configured to communicate to a server of said one or more servers a respective location of said user. 8. The system according to claim 7 , wherein said trans-retail establishment server has deployed thereon said tool for enabling real-time distribution of said feedback collected to said user of said one or more retail establishments and to additional users of other retail establishments different than said one or more retail establishments, and wherein said additional users comprise at least one of: customers that have inputted said feedback and customers that have not inputted said feedback collected. | 0.5 |
8,250,077 | 1 | 3 | 1. A method comprising: receiving, over a network, from a user, a network search query comprising at least one token, the network search query being a program search query for searching an online programming guide; selecting, using a computing device, a plurality of suggested search terms from a suggested search term database that match the network search query, each of the plurality of suggested search terms being assigned to one of a plurality of categories, the suggested search term database relating to the online programming guide; ranking, using the computing device, the plurality of suggested search terms within each of the plurality of categories; determining, using the computing device, a number of suggested search terms to be returned to the user, n c , for each of the plurality of categories, n c being equal to a ratio of the number of suggested search terms in the respective category to a total number of suggested search terms multiplied by a total number of displayed search terms, the suggested search terms being selected from the list: a description of a channel, a program title and a name of a cast member, the plurality of categories comprising the categories: channel, program title, and cast member, where a respective timestamp is associated with every suggested search term, and search terms having a timestamp less than the current time are not selected, where the timestamp relates to a channel, the timestamp is equivalent to an end time for the last program scheduled for the channel, where the timestamp relates to a program title, the timestamp is equivalent to a last end time for the program scheduled on a channel and where timestamp relates to a cast member, the timestamp is equivalent to a last end time for a program associated with the cast member is scheduled on a channel; creating, using the computing device, a consolidated result set by adding, for each of the plurality of categories, the top ranked n c suggested search terms in the respective category to the consolidated result set; transmitting, over the network, to the user, the consolidated result set; receiving, over the network, from the user, a selection of a suggested search term; and conducting, using the computing device, a network search using the selected suggested search term. | 1. A method comprising: receiving, over a network, from a user, a network search query comprising at least one token, the network search query being a program search query for searching an online programming guide; selecting, using a computing device, a plurality of suggested search terms from a suggested search term database that match the network search query, each of the plurality of suggested search terms being assigned to one of a plurality of categories, the suggested search term database relating to the online programming guide; ranking, using the computing device, the plurality of suggested search terms within each of the plurality of categories; determining, using the computing device, a number of suggested search terms to be returned to the user, n c , for each of the plurality of categories, n c being equal to a ratio of the number of suggested search terms in the respective category to a total number of suggested search terms multiplied by a total number of displayed search terms, the suggested search terms being selected from the list: a description of a channel, a program title and a name of a cast member, the plurality of categories comprising the categories: channel, program title, and cast member, where a respective timestamp is associated with every suggested search term, and search terms having a timestamp less than the current time are not selected, where the timestamp relates to a channel, the timestamp is equivalent to an end time for the last program scheduled for the channel, where the timestamp relates to a program title, the timestamp is equivalent to a last end time for the program scheduled on a channel and where timestamp relates to a cast member, the timestamp is equivalent to a last end time for a program associated with the cast member is scheduled on a channel; creating, using the computing device, a consolidated result set by adding, for each of the plurality of categories, the top ranked n c suggested search terms in the respective category to the consolidated result set; transmitting, over the network, to the user, the consolidated result set; receiving, over the network, from the user, a selection of a suggested search term; and conducting, using the computing device, a network search using the selected suggested search term. 3. The method of claim 1 , wherein only suggested search terms that match the network search query at the beginning of a word within the respective suggested search term are selected. | 0.762953 |
8,949,265 | 6 | 7 | 6. The method of claim 1 , further comprising: analyzing a number of the results to determine terms most frequently encountered in the number of the results; receiving a refinement input based on the terms most frequently encountered; and refining the results based on the refinement input. | 6. The method of claim 1 , further comprising: analyzing a number of the results to determine terms most frequently encountered in the number of the results; receiving a refinement input based on the terms most frequently encountered; and refining the results based on the refinement input. 7. The method of claim 6 , wherein the refinement input comprises a term of the terms most frequently encountered to exclude from the results when refining the results. | 0.5 |
10,157,610 | 19 | 21 | 19. The method of claim 15 , wherein performing the forced Viterbi alignment further comprises: obtaining a total likelihood score α r for each audio file of the plurality of speech audio files. | 19. The method of claim 15 , wherein performing the forced Viterbi alignment further comprises: obtaining a total likelihood score α r for each audio file of the plurality of speech audio files. 21. The method of claim 19 , wherein an average frame likelihood score of an audio file is obtained using a mathematical equation: β r = α r f r wherein β r is the average frame likelihood score, α r is the total likelihood score of the audio file, and f r is a number of feature frames of the audio file. | 0.604922 |
8,577,899 | 20 | 23 | 20. A system for supporting curation of items in a searchable knowledge base, said system comprising: at least one processor configured to: mine one or more search queries of the searchable knowledge base, wherein each of the one or more search queries includes search results including a plurality of the items of the knowledge base, each item including a title identifying an issue and/or topic addressed by the item and further including a plurality of posts from users of the knowledge base system, each post relevant to the issue and/or topic of the item; determine one or more pairs of items of the items of the knowledge base using a processor, wherein each of the one or more pairs of items include a correlation value exceeding a threshold, wherein the correlation value for the each of the one or more pairs of items is based upon a frequency the items of the each of the one or more pairs of items co-occur within search results of the one or more search queries; and provide at least one of the one or more pairs of items to a curator, wherein the curator reviews the one or more pairs of items; wherein the items of the knowledge base each correspond to a record of information on a specific issue or topic relevant to a topic covered by the knowledge base; wherein the one or more mined search queries are re-run before determining the one or more pairs or items, and wherein the one or more mined search queries are saved within a history database, each of the saved search queries corresponding to a previously performed search of the searchable knowledge base, identifying the search terms of the previously performed search, and identifying items of the searchable knowledge base returned in response to the previously performed search. | 20. A system for supporting curation of items in a searchable knowledge base, said system comprising: at least one processor configured to: mine one or more search queries of the searchable knowledge base, wherein each of the one or more search queries includes search results including a plurality of the items of the knowledge base, each item including a title identifying an issue and/or topic addressed by the item and further including a plurality of posts from users of the knowledge base system, each post relevant to the issue and/or topic of the item; determine one or more pairs of items of the items of the knowledge base using a processor, wherein each of the one or more pairs of items include a correlation value exceeding a threshold, wherein the correlation value for the each of the one or more pairs of items is based upon a frequency the items of the each of the one or more pairs of items co-occur within search results of the one or more search queries; and provide at least one of the one or more pairs of items to a curator, wherein the curator reviews the one or more pairs of items; wherein the items of the knowledge base each correspond to a record of information on a specific issue or topic relevant to a topic covered by the knowledge base; wherein the one or more mined search queries are re-run before determining the one or more pairs or items, and wherein the one or more mined search queries are saved within a history database, each of the saved search queries corresponding to a previously performed search of the searchable knowledge base, identifying the search terms of the previously performed search, and identifying items of the searchable knowledge base returned in response to the previously performed search. 23. The system of claim 20 , wherein the curator removes duplicate items or expired items from the one or more pairs of items. | 0.724891 |
7,966,555 | 11 | 13 | 11. A computer program product for inserting context sensitive delimiters into a formula, the computer program product being embodied in a non-transitory computer readable medium and comprising computer instructions for: successively receiving a plurality of selections of a cell or cell range while in a formula editing mode in a host cell into which a formula is being entered; automatically determining a current context of the formula with respect to which the selections are received; and automatically inserting a first delimiter type between references inserted into the formula in response to receiving the plurality of selections when the current context comprises a first context and inserting a second delimiter type between references inserted into the formula in response to receiving the plurality of selections when the current context comprises a second context; wherein the delimiter type automatically inserted between references inserted into the formula is based on the current context of the formula with respect to which the references are inserted; and wherein the first context is not being in an argument list of a function and the first delimiter type is a plus sign; and wherein the second context is being in an argument list of a function and the second delimiter type is a comma. | 11. A computer program product for inserting context sensitive delimiters into a formula, the computer program product being embodied in a non-transitory computer readable medium and comprising computer instructions for: successively receiving a plurality of selections of a cell or cell range while in a formula editing mode in a host cell into which a formula is being entered; automatically determining a current context of the formula with respect to which the selections are received; and automatically inserting a first delimiter type between references inserted into the formula in response to receiving the plurality of selections when the current context comprises a first context and inserting a second delimiter type between references inserted into the formula in response to receiving the plurality of selections when the current context comprises a second context; wherein the delimiter type automatically inserted between references inserted into the formula is based on the current context of the formula with respect to which the references are inserted; and wherein the first context is not being in an argument list of a function and the first delimiter type is a plus sign; and wherein the second context is being in an argument list of a function and the second delimiter type is a comma. 13. A computer program product as recited in claim 11 , wherein the first context and the second context are included in a set of contexts of formulas and wherein each context in the set is associated with a default delimiter type. | 0.555769 |
7,577,879 | 1 | 9 | 1. A computer-implemented method for patching a software error in a mobile computing device application, comprising: receiving crash data associated with the error at a crash server, wherein the crash data identifies the state of the mobile computing device and the application when the error occurred; wherein the error is an error that occurred during the execution of the mobile computing device application; determining the availability of an application fix that addresses the error, wherein the application fix is determined to be available when the crash data corresponds to registration information that identifies the mobile computing device, the application fix and the error; generating an Extensible Markup Language (XML) representation of data, wherein the XML data identifies the application fix and a patch identifier; receiving the XML data at a patch server via a web services interface, wherein the patch server: locates the application fix using the patch identifier identified by the XML data; and provides the application fix to the mobile computing device; modifying the application using the application fix, wherein the modified application overcomes the error. | 1. A computer-implemented method for patching a software error in a mobile computing device application, comprising: receiving crash data associated with the error at a crash server, wherein the crash data identifies the state of the mobile computing device and the application when the error occurred; wherein the error is an error that occurred during the execution of the mobile computing device application; determining the availability of an application fix that addresses the error, wherein the application fix is determined to be available when the crash data corresponds to registration information that identifies the mobile computing device, the application fix and the error; generating an Extensible Markup Language (XML) representation of data, wherein the XML data identifies the application fix and a patch identifier; receiving the XML data at a patch server via a web services interface, wherein the patch server: locates the application fix using the patch identifier identified by the XML data; and provides the application fix to the mobile computing device; modifying the application using the application fix, wherein the modified application overcomes the error. 9. The computer-implemented method of claim 1 , wherein modifying the application further comprises burning the application fix in memory of the mobile computing device. | 0.646444 |
7,925,986 | 15 | 16 | 15. The method of claim 13 , further receiving user actions from the input device to select one of the letters from the selected cluster and causing the selected letter to be displayed in the string field. | 15. The method of claim 13 , further receiving user actions from the input device to select one of the letters from the selected cluster and causing the selected letter to be displayed in the string field. 16. The method of claim 15 , wherein each letter of the selected cluster is selectable by acting only on the corresponding alphanumeric cluster. | 0.5 |
8,515,896 | 17 | 18 | 17. The product of claim 12 , wherein the sponsored content item is from a sponsor account, and the appeal request includes an appeal request for the sponsor account. | 17. The product of claim 12 , wherein the sponsored content item is from a sponsor account, and the appeal request includes an appeal request for the sponsor account. 18. The product of claim 17 , comprising, in response to the appeal request for the sponsor account: submitting an additional landing page to the intrusion detection engine, the additional landing page being associated with an additional sponsored content item of the sponsor account; receiving, from the intrusion detection engine, an additional intrusion score, the additional intrusion score being related to the additional landing page; and determining whether the additional intrusion score exceeds the intrusion threshold. | 0.5 |
8,943,417 | 1 | 2 | 1. A method for providing notifications to collaborators of a document, comprising: accessing a document editor program that includes collaborative authoring functionality for collaboration and communication on the document and an integrated collaborative user interface that is used to display information relating to the collaboration; displaying collaborative user interface elements within the integrated collaborative user interface, wherein displaying the collaborative user interface comprises displaying a ribbon menu pane, a document editing pane and a document assembly pane, wherein displaying the ribbon menu pane comprises displaying a document elements ribbon including a publish element, a view details element and section elements including an insert element, a delete element, and a view details element while in collaborative mode and hiding the collaborative user interface elements when not in collaborative mode; wherein displaying the document assembly pane further comprises displaying, within the document assembly pane, a document detail pane, a section detail pane, and an expanded section detail pane, wherein displaying the document detail pane comprises displaying document details metadata associated with collaboratively authoring the document, and wherein displaying the section details pane comprising displaying section details metadata associated with an author assigned to at least one section of the document; using the integrated collaborative user interface to associate collaborators with one or more sections of the document for at least one of: reviewing the one or more sections and updating the one or more sections, wherein more than one collaborator can be associated with a same section; receiving an update to the document as a result of an input made by at least one of the collaborators; sending a notification of the update to the document to at least one of: a new collaborator and an existing collaborator of the document; and refreshing the document to reflect the update. | 1. A method for providing notifications to collaborators of a document, comprising: accessing a document editor program that includes collaborative authoring functionality for collaboration and communication on the document and an integrated collaborative user interface that is used to display information relating to the collaboration; displaying collaborative user interface elements within the integrated collaborative user interface, wherein displaying the collaborative user interface comprises displaying a ribbon menu pane, a document editing pane and a document assembly pane, wherein displaying the ribbon menu pane comprises displaying a document elements ribbon including a publish element, a view details element and section elements including an insert element, a delete element, and a view details element while in collaborative mode and hiding the collaborative user interface elements when not in collaborative mode; wherein displaying the document assembly pane further comprises displaying, within the document assembly pane, a document detail pane, a section detail pane, and an expanded section detail pane, wherein displaying the document detail pane comprises displaying document details metadata associated with collaboratively authoring the document, and wherein displaying the section details pane comprising displaying section details metadata associated with an author assigned to at least one section of the document; using the integrated collaborative user interface to associate collaborators with one or more sections of the document for at least one of: reviewing the one or more sections and updating the one or more sections, wherein more than one collaborator can be associated with a same section; receiving an update to the document as a result of an input made by at least one of the collaborators; sending a notification of the update to the document to at least one of: a new collaborator and an existing collaborator of the document; and refreshing the document to reflect the update. 2. The method of claim 1 , further comprising displaying a notification interface that displays information relating to sending the notification. | 0.696653 |
9,442,720 | 9 | 11 | 9. A system comprising: at least one processor and executable instructions accessible on a non-transitory computer-readable medium that, when executed, cause the at least one processor to perform operations comprising: receive audio data comprising a comment for source code in a source code file; receive an indication of a location within the source code file with which to associate the comment; convert the audio data to a textual representation of the comment; store the audio data and the textual representation of the comment in association with the location within the source code file; determine a location of a user; determine a primary language of the user based, at least in part, on the determined location of the user; cause an indication of the comment to be displayed at the location within the source code file to a user on a computing device, the indication of the comment comprising a selectable link to the textual representation of the comment, the selectable link being configured to cause the textual representation of the comment to be displayed to the user on the computing device in response to a selection of the selectable link; and cause the comment to be presented, to the user on the computing device, in the determined primary language of the user based on the determination of the primary language. | 9. A system comprising: at least one processor and executable instructions accessible on a non-transitory computer-readable medium that, when executed, cause the at least one processor to perform operations comprising: receive audio data comprising a comment for source code in a source code file; receive an indication of a location within the source code file with which to associate the comment; convert the audio data to a textual representation of the comment; store the audio data and the textual representation of the comment in association with the location within the source code file; determine a location of a user; determine a primary language of the user based, at least in part, on the determined location of the user; cause an indication of the comment to be displayed at the location within the source code file to a user on a computing device, the indication of the comment comprising a selectable link to the textual representation of the comment, the selectable link being configured to cause the textual representation of the comment to be displayed to the user on the computing device in response to a selection of the selectable link; and cause the comment to be presented, to the user on the computing device, in the determined primary language of the user based on the determination of the primary language. 11. The system of claim 9 , wherein the operations further comprise: translate the comment from an original language to at least one additional language; and store the comment in the original language and in the at least one additional language. | 0.5 |
9,659,051 | 18 | 20 | 18. The method of claim 17 , wherein the class-specific stored procedure is generated by an initialization module, the initialization module being configured to: use the referential integrity metadata framework to automatically create the table in the relational database system, the table including a column for the identifying attribute, a column for the relationship attribute, and a column for the object data document; and use the referential integrity metadata framework to automatically create referential integrity structures for the table in the relational database system. | 18. The method of claim 17 , wherein the class-specific stored procedure is generated by an initialization module, the initialization module being configured to: use the referential integrity metadata framework to automatically create the table in the relational database system, the table including a column for the identifying attribute, a column for the relationship attribute, and a column for the object data document; and use the referential integrity metadata framework to automatically create referential integrity structures for the table in the relational database system. 20. The method of claim 18 , wherein the table lacks columns for attributes in the object data document that are not referential integrity attributes. | 0.5 |
7,613,452 | 7 | 8 | 7. The routing system of claim 6 , wherein the line condition module is further operable to selectively activate the switch when the audio signal comprises a tone. | 7. The routing system of claim 6 , wherein the line condition module is further operable to selectively activate the switch when the audio signal comprises a tone. 8. The routing system of claim 7 , wherein the tone is a DTMF tone. | 0.5 |
9,049,222 | 1 | 9 | 1. A method of preventing an e-mail from infecting a computing device, the method comprising: viewing the e-mail in a browser on the computing device; creating a document object model (DOM) tree from the e-mail, wherein the DOM tree contains known and unknown elements and wherein known elements are known to be safe and wherein unknown elements potentially include malicious Javascripts and HTML elements wherein the DOM tree includes a plurality of branches, the plurality of branches including at least one branch having only known elements; applying a first filter to the DOM tree, the first filter excluding the at least one branch in the DOM tree having only known elements, thereby creating a modified DOM tree wherein the excluding of the at least one branch from the DOM tree is performed such that remaining branches of the DOM tree are still connected with one another; filtering the modified DOM tree using a script analyzer filter wherein the script analyzer filter intercepts unknown elements in the modified DOM tree; and emulating execution of the unknown elements in the modified DOM tree to determine which unknown elements are malicious. | 1. A method of preventing an e-mail from infecting a computing device, the method comprising: viewing the e-mail in a browser on the computing device; creating a document object model (DOM) tree from the e-mail, wherein the DOM tree contains known and unknown elements and wherein known elements are known to be safe and wherein unknown elements potentially include malicious Javascripts and HTML elements wherein the DOM tree includes a plurality of branches, the plurality of branches including at least one branch having only known elements; applying a first filter to the DOM tree, the first filter excluding the at least one branch in the DOM tree having only known elements, thereby creating a modified DOM tree wherein the excluding of the at least one branch from the DOM tree is performed such that remaining branches of the DOM tree are still connected with one another; filtering the modified DOM tree using a script analyzer filter wherein the script analyzer filter intercepts unknown elements in the modified DOM tree; and emulating execution of the unknown elements in the modified DOM tree to determine which unknown elements are malicious. 9. A method as recited in claim 1 further comprising: decrypting the Javascript before emulating the unknown elements. | 0.926799 |
9,208,179 | 7 | 8 | 7. The method of claim 1 , wherein calculating the first score is based on at least one comparison between the target alphanumeric tokens and a portion of the alphanumeric tokens extracted from the candidate data record. | 7. The method of claim 1 , wherein calculating the first score is based on at least one comparison between the target alphanumeric tokens and a portion of the alphanumeric tokens extracted from the candidate data record. 8. The method of claim 7 , further comprising: storing the alphanumeric tokens in a data structure that is partitioned based on at least one selected from a group consisting of a class, a type, and a length of the alphanumeric tokens, wherein the class comprises a key attribute class, a derivable attribute class, and a statistical attribute class, wherein the type comprises an alphabetic type and a numeric type, and wherein the at least one comparison is performed using the data structure based on the at least one selected from a group consisting of the class, the type, and the length of the alphanumeric tokens. | 0.5 |
9,705,877 | 1 | 16 | 1. One or more non-transitory computer-readable media storing computer-executable instructions executable by one or more processors, the computer-executable instructions comprising: instructions that cause the one or more processors to provide a training word to a user of a user computing device; instructions that cause the one or more processors to receive input associated with the training word from the user, the input comprising a sequence of user input entries corresponding to the training word; instructions that cause the one or more processors to derive metadata associated with the sequence of user input entries; instructions that cause the one or more processors to generate a user input pattern profile based at least in part on the metadata; instructions that cause the one or more processors to generate a plurality of computer-generated entries associated with the training word; instructions that cause the one or more processors to receive login information from the user computing device; and instructions that cause the one or more processors to determine whether the login information identifies the user based at least in part on the user input pattern profile and the plurality of computer-generated entries associated with the training word. | 1. One or more non-transitory computer-readable media storing computer-executable instructions executable by one or more processors, the computer-executable instructions comprising: instructions that cause the one or more processors to provide a training word to a user of a user computing device; instructions that cause the one or more processors to receive input associated with the training word from the user, the input comprising a sequence of user input entries corresponding to the training word; instructions that cause the one or more processors to derive metadata associated with the sequence of user input entries; instructions that cause the one or more processors to generate a user input pattern profile based at least in part on the metadata; instructions that cause the one or more processors to generate a plurality of computer-generated entries associated with the training word; instructions that cause the one or more processors to receive login information from the user computing device; and instructions that cause the one or more processors to determine whether the login information identifies the user based at least in part on the user input pattern profile and the plurality of computer-generated entries associated with the training word. 16. The computer-readable media of claim 1 , wherein the computer-executable instructions further comprise instructions that cause the one or more processors to identify a number of users sharing access to a generic account of the system based at least in part on the user input pattern profile. | 0.798222 |
8,048,115 | 4 | 5 | 4. The surgical tool of claim 3 , wherein: the retainer is a ball, which is forced against the deflectable post when the elongate tube is positioned at the distal end of the elongate shaft, and which is released when the elongate tube is slid toward the proximal end of the elongate shaft. | 4. The surgical tool of claim 3 , wherein: the retainer is a ball, which is forced against the deflectable post when the elongate tube is positioned at the distal end of the elongate shaft, and which is released when the elongate tube is slid toward the proximal end of the elongate shaft. 5. The surgical tool of claim 4 , wherein the ball is received in an aperture in the elongate shaft intersecting the socket. | 0.5 |
8,249,875 | 1 | 14 | 1. A method for analyzing a voice of a speaker, comprising: receiving, by a computer, data indicative of speech from the speaker; storing, by a computer, the received data in at least one database; calculating, by a computer, based upon the received data, an average intensity value for each of a plurality of frequencies, wherein the calculation of the average intensity value for each frequency is based on: i) dividing, by a computer, the received data into a number of time periods; ii) obtaining, by a computer, an intensity of the speaker's speech for each frequency during each time period; iii) obtaining, by a computer, a sum of intensity values for each frequency during all time periods; and iv) dividing, by a computer, the sum of intensity values for each frequency by the number of time periods; calculating, by a computer, based upon the received data, a maximum intensity value for each of the plurality of frequencies, wherein the maximum intensity value for each frequency is the highest intensity of the speaker's speech for each frequency during all time periods; calculating, by a computer, a level of a survival element of a personality profile of the speaker based upon at least one of: (a) a rapid change in the average intensity value between at least a portion of the plurality of frequencies; and (b) a rapid change in the maximum intensity value between at least a portion of the plurality of frequencies; calculating, by a computer, a level of a homeostasis element of the personality profile of the speaker by measuring a distance between the average intensity value and the maximum intensity for each frequency of at least a portion of the plurality of frequencies; calculating, by a computer, a level of a growth element of the personality profile of the speaker based upon at least one of: (a) determining, by a computer, a frequency range within at least a portion of the plurality of frequencies in which the average intensity value of each frequency within the frequency range is higher than a value that is equal to a predetermined percent of the highest average intensity value within the frequency range of the at least a portion of the plurality of frequencies, (b) determining, by a computer, at least one frequency within at least a portion of the plurality of frequencies that has the highest maximum intensity value among the at least a portion of the plurality of frequencies, and (c) determining, by a computer, a level of correlation between changes in intensity values during the time periods of a first frequency and changes in intensity values during the time periods of a second frequency; and outputting, by a computer, an indicator of the personality profile of the speaker based upon a combination of the calculated level of the survival element of the speaker, the calculated level of the homeostasis element of the speaker, and the calculated level of the growth element of the speaker. | 1. A method for analyzing a voice of a speaker, comprising: receiving, by a computer, data indicative of speech from the speaker; storing, by a computer, the received data in at least one database; calculating, by a computer, based upon the received data, an average intensity value for each of a plurality of frequencies, wherein the calculation of the average intensity value for each frequency is based on: i) dividing, by a computer, the received data into a number of time periods; ii) obtaining, by a computer, an intensity of the speaker's speech for each frequency during each time period; iii) obtaining, by a computer, a sum of intensity values for each frequency during all time periods; and iv) dividing, by a computer, the sum of intensity values for each frequency by the number of time periods; calculating, by a computer, based upon the received data, a maximum intensity value for each of the plurality of frequencies, wherein the maximum intensity value for each frequency is the highest intensity of the speaker's speech for each frequency during all time periods; calculating, by a computer, a level of a survival element of a personality profile of the speaker based upon at least one of: (a) a rapid change in the average intensity value between at least a portion of the plurality of frequencies; and (b) a rapid change in the maximum intensity value between at least a portion of the plurality of frequencies; calculating, by a computer, a level of a homeostasis element of the personality profile of the speaker by measuring a distance between the average intensity value and the maximum intensity for each frequency of at least a portion of the plurality of frequencies; calculating, by a computer, a level of a growth element of the personality profile of the speaker based upon at least one of: (a) determining, by a computer, a frequency range within at least a portion of the plurality of frequencies in which the average intensity value of each frequency within the frequency range is higher than a value that is equal to a predetermined percent of the highest average intensity value within the frequency range of the at least a portion of the plurality of frequencies, (b) determining, by a computer, at least one frequency within at least a portion of the plurality of frequencies that has the highest maximum intensity value among the at least a portion of the plurality of frequencies, and (c) determining, by a computer, a level of correlation between changes in intensity values during the time periods of a first frequency and changes in intensity values during the time periods of a second frequency; and outputting, by a computer, an indicator of the personality profile of the speaker based upon a combination of the calculated level of the survival element of the speaker, the calculated level of the homeostasis element of the speaker, and the calculated level of the growth element of the speaker. 14. The method of claim 1 , wherein each of the time periods is essentially the same. | 0.915507 |
9,646,076 | 8 | 12 | 8. A computerized apparatus having a processor, the processor being adapted to perform the steps of: executing a query against a knowledge base to retrieve at least one document; retrieving at least one entity associated with the at least one document; assigning at least one relevancy score to the at least one entity, the at least one relevancy score representing a degree of relevance of the at least one entity to topic of the query; obtaining a filtered list by filtering the at least one entity to contain only entities appearing in a predetermined collection; and assessing findability of the query based on the at least one entity and the relevancy score, wherein the findability indicates a degree of difficulty to retrieve information related to the query from the representation of the filtered list. | 8. A computerized apparatus having a processor, the processor being adapted to perform the steps of: executing a query against a knowledge base to retrieve at least one document; retrieving at least one entity associated with the at least one document; assigning at least one relevancy score to the at least one entity, the at least one relevancy score representing a degree of relevance of the at least one entity to topic of the query; obtaining a filtered list by filtering the at least one entity to contain only entities appearing in a predetermined collection; and assessing findability of the query based on the at least one entity and the relevancy score, wherein the findability indicates a degree of difficulty to retrieve information related to the query from the representation of the filtered list. 12. The apparatus of claim 8 , wherein the processor if further adapted to compare findability levels of at least two predetermined collections. | 0.5 |
7,519,589 | 116 | 121 | 116. The method of claim 115 , further comprising: defining a findings folder containing only items whose content is determined by a user to relate to a specific topic, and to providing a definitive conclusion regarding the specific topic. | 116. The method of claim 115 , further comprising: defining a findings folder containing only items whose content is determined by a user to relate to a specific topic, and to providing a definitive conclusion regarding the specific topic. 121. The method of claim 116 , further comprising: enabling a user to assign priorities to findings folders; and enabling de-duplication of an item between findings folders, where the findings folder with the highest priority receives the item. | 0.5 |
8,719,029 | 4 | 6 | 4. The viewer device for a digital comic according to claim 1 , wherein the file format includes second text information indicating an onomatopoeia or a letter in a region other than the speech balloon region, the second text information being correlated with each panel. | 4. The viewer device for a digital comic according to claim 1 , wherein the file format includes second text information indicating an onomatopoeia or a letter in a region other than the speech balloon region, the second text information being correlated with each panel. 6. The viewer device for a digital comic according to claim 4 , wherein the second text information includes attribute information of the onomatopoeia or the letter in the region other than the speech balloon region. | 0.636364 |
8,577,726 | 15 | 18 | 15. A non-transitory computer-readable storage medium encoded with instructions for controlling a computing device to calculate a bid amount for a keyword, by a method comprising: collecting conversion information for the keyword indicating financial benefit resulting from users selecting advertisements displayed with content that relates to the keyword, the financial benefit being organized into categories relating to sessions initiated by the selecting of the advertisements; determining a category-specific advertising expense factor for each category; calculating a category-specific product for each category, the category-specific product calculated by multiplying the financial benefit for the category by the category-specific advertising expense factor determined for the category; and generating a bid amount for the keyword based at least in part on a quotient of an aggregation of the category-specific products divided by number of sessions with financial benefit multiplied by a forecast conversion comprising a predicted percentage of clickthroughs associated with the keyword that result in financial benefit. | 15. A non-transitory computer-readable storage medium encoded with instructions for controlling a computing device to calculate a bid amount for a keyword, by a method comprising: collecting conversion information for the keyword indicating financial benefit resulting from users selecting advertisements displayed with content that relates to the keyword, the financial benefit being organized into categories relating to sessions initiated by the selecting of the advertisements; determining a category-specific advertising expense factor for each category; calculating a category-specific product for each category, the category-specific product calculated by multiplying the financial benefit for the category by the category-specific advertising expense factor determined for the category; and generating a bid amount for the keyword based at least in part on a quotient of an aggregation of the category-specific products divided by number of sessions with financial benefit multiplied by a forecast conversion comprising a predicted percentage of clickthroughs associated with the keyword that result in financial benefit. 18. The non-transitory computer-readable storage medium of claim 15 wherein the generating of the bid amount includes multiplying the quotient by a forecast conversion rate. | 0.700692 |
8,938,452 | 1 | 5 | 1. A method of query generation for searchable content, comprising: receiving an identifier for a web site comprising searchable content, wherein the searchable content includes one or more web pages of the web site, and wherein the web site is to be optimized for higher rankings in organic search results of a search engine; generating a set of queries for the web site using an inverse search engine executed on a processor, wherein the generated set of queries includes one or more queries that are relevant to the searchable content of the web site, wherein the generating the set of queries comprises: determining candidate queries for the searchable content of the web site; determining a relevance for each of the candidate queries, wherein the determining the relevance is based on a number of terms of each candidate query present in a web page of the web site; and determining a topicality for each of the candidate queries; optimizing the web site for organic searches using the generated set of queries to generate an optimized version of the web site; and performing a feedback loop to determine whether the optimized version of the web site is resulting in higher rankings in organic search results of the search engine. | 1. A method of query generation for searchable content, comprising: receiving an identifier for a web site comprising searchable content, wherein the searchable content includes one or more web pages of the web site, and wherein the web site is to be optimized for higher rankings in organic search results of a search engine; generating a set of queries for the web site using an inverse search engine executed on a processor, wherein the generated set of queries includes one or more queries that are relevant to the searchable content of the web site, wherein the generating the set of queries comprises: determining candidate queries for the searchable content of the web site; determining a relevance for each of the candidate queries, wherein the determining the relevance is based on a number of terms of each candidate query present in a web page of the web site; and determining a topicality for each of the candidate queries; optimizing the web site for organic searches using the generated set of queries to generate an optimized version of the web site; and performing a feedback loop to determine whether the optimized version of the web site is resulting in higher rankings in organic search results of the search engine. 5. The method recited in claim 1 , further comprising: generating the set of queries using query modeling. | 0.928378 |
9,928,752 | 1 | 2 | 1. A system to facilitate conducting a social choice survey of members of an online community associated with a computer network, the system comprising: a computer accessible to the computer network, the computer defining a social choice administrator server, the social choice administrator server having a memory coupled to a processor; operational instructions stored in the memory of the social choice administrator server that, when executed by the processor of the social choice administrator server, cause the social choice administrator server to selectively perform the operations of: generate a first user interface on a computer display associated with a survey administrator, prompt the survey administrator with the first user interface to define the social choice survey, receive the social choice survey defined by the survey administrator with the first user interface, prompt the survey administrator with the first user interface to define a group of participants from the members of the online community on a social media website to participate in the social choice survey, receive the group of participants defined by the survey administrator with the first user interface, generate a second user interface on a computer display associated with each of the participants on the social media website the second user interface providing an interactive portion to receive a participant's response to the social choice survey, receive and register each of the participants' responses to the social choice survey collected with the second user interface, prompt the survey administrator to view and to select a progress of the social choice survey, in response to the selection of the progress of the social choice survey, generate a display of the progress of the social choice survey on the social media website that includes at least one of a list of participants who have participated in the social choice survey and a list of participants who have not participated in the social choice survey, amalgamate the participants' responses to the social choice survey to thereby determine a result of the social choice survey, and show the result of the social choice survey on a computer display of the survey administrator. | 1. A system to facilitate conducting a social choice survey of members of an online community associated with a computer network, the system comprising: a computer accessible to the computer network, the computer defining a social choice administrator server, the social choice administrator server having a memory coupled to a processor; operational instructions stored in the memory of the social choice administrator server that, when executed by the processor of the social choice administrator server, cause the social choice administrator server to selectively perform the operations of: generate a first user interface on a computer display associated with a survey administrator, prompt the survey administrator with the first user interface to define the social choice survey, receive the social choice survey defined by the survey administrator with the first user interface, prompt the survey administrator with the first user interface to define a group of participants from the members of the online community on a social media website to participate in the social choice survey, receive the group of participants defined by the survey administrator with the first user interface, generate a second user interface on a computer display associated with each of the participants on the social media website the second user interface providing an interactive portion to receive a participant's response to the social choice survey, receive and register each of the participants' responses to the social choice survey collected with the second user interface, prompt the survey administrator to view and to select a progress of the social choice survey, in response to the selection of the progress of the social choice survey, generate a display of the progress of the social choice survey on the social media website that includes at least one of a list of participants who have participated in the social choice survey and a list of participants who have not participated in the social choice survey, amalgamate the participants' responses to the social choice survey to thereby determine a result of the social choice survey, and show the result of the social choice survey on a computer display of the survey administrator. 2. The system of claim 1 , wherein the operational instructions, that, when executed by the processor, cause the social choice administrator server to further perform the operations of: sending an electronic message over the computer network to each of the participants in the group of participants, the electronic message indicating that the participant has been selected to participate in the social choice survey. | 0.5 |
8,312,370 | 8 | 13 | 8. A method of generating structured documents, the method comprising: identifying a template for generating a document, wherein the template defines at least one field having a specified position and length within the document; storing a copy of the template to a memory so as to initialize the document; storing, by at least one processor, characters based on data associated with the at least one field to a location of the memory associated with the at least one field of the document, based at least in part on the text and the length of the field, storing, by the at least one processor, to portions of the memory associated with the document, at least one indicator of at least one portion of the at least one field to be removed from the document; wherein the at least one indicator of the at least one portion of the at least one field to be removed comprises at least one specified character value; wherein the at least one specified character value comprises at least two byte values, the byte values comprising a first of the byte values indicative of a start-of-heading of a character encoding of the document and at least a second of the byte values indicative of a number of characters to be removed from the document; and accessing the document from the memory by at least one circuit; removing, by the at least one circuit, the at least one portion of the at least one field based on the at least one indicator so as to generate a portion of an assembled document; and outputting the portion of the assembled document by the at least one circuit. | 8. A method of generating structured documents, the method comprising: identifying a template for generating a document, wherein the template defines at least one field having a specified position and length within the document; storing a copy of the template to a memory so as to initialize the document; storing, by at least one processor, characters based on data associated with the at least one field to a location of the memory associated with the at least one field of the document, based at least in part on the text and the length of the field, storing, by the at least one processor, to portions of the memory associated with the document, at least one indicator of at least one portion of the at least one field to be removed from the document; wherein the at least one indicator of the at least one portion of the at least one field to be removed comprises at least one specified character value; wherein the at least one specified character value comprises at least two byte values, the byte values comprising a first of the byte values indicative of a start-of-heading of a character encoding of the document and at least a second of the byte values indicative of a number of characters to be removed from the document; and accessing the document from the memory by at least one circuit; removing, by the at least one circuit, the at least one portion of the at least one field based on the at least one indicator so as to generate a portion of an assembled document; and outputting the portion of the assembled document by the at least one circuit. 13. The method of claim 8 , wherein the at least one field comprises a plurality of fields and wherein storing the characters comprises each of a plurality of processors concurrently storing the characters based on data associated with a respective at least one of the fields to a location of the memory associated with the respective at least one of fields. | 0.5 |
8,515,923 | 1 | 17 | 1. A document repository management (DRM) system for an institution having a defined organization, said DRM system comprising: an input device for receiving a document access request; an electronically readable organization chart and organizational chart information including information identifying individuals on said organization chart; an electronic document repository containing accessible documents; a controller that: controls requested access to each document of said accessible documents in said electronic document repository; and maps to said electronically readable organization chart and said organizational chart information, each said requested access to said each document of said accessible documents; and a display device that displays a document usage summary chart history based on historical tracking of actual usage and treatment of each document by individuals and groups on said organization chart. | 1. A document repository management (DRM) system for an institution having a defined organization, said DRM system comprising: an input device for receiving a document access request; an electronically readable organization chart and organizational chart information including information identifying individuals on said organization chart; an electronic document repository containing accessible documents; a controller that: controls requested access to each document of said accessible documents in said electronic document repository; and maps to said electronically readable organization chart and said organizational chart information, each said requested access to said each document of said accessible documents; and a display device that displays a document usage summary chart history based on historical tracking of actual usage and treatment of each document by individuals and groups on said organization chart. 17. The DRM System of claim 1 , wherein said controller identifies, summarizes and tracks each said requested access in terms of positions and titles within said electronically readable organization chart. | 0.679688 |
4,661,074 | 2 | 3 | 2. The instructional system of claim 1 wherein said game board has a bicycle thereon with a front wheel encircling said first spinner and a rear wheel encircling said second spinner. | 2. The instructional system of claim 1 wherein said game board has a bicycle thereon with a front wheel encircling said first spinner and a rear wheel encircling said second spinner. 3. The instructional system of claim 2 wherein said front wheel comprises a multiplicity of sections and said rear wheel comprises a multiplicity of sections; further provided that each spinner points to a cooperating section when spun, thereby advancing play of the game. | 0.5 |
8,977,535 | 1 | 3 | 1. A method for transliterating an at least partially phonetic symbol-based writing system including symbols into a complex character-based writing system including characters, said method comprising: entering, with a human-to-machine interface, a string of symbols of said partially phonetic symbol-based writing system into a transliterating engine; parsing said string of symbols into a plurality of substrings, each substring forming an utterance unit corresponding to a character of said string of characters which corresponds to said string of symbols, and at least one substring of symbols including at least three symbols; transliterating said substrings into corresponding characters; displaying the corresponding characters; wherein said transliterating comprises matching, by database retrieval, each substring with one and only one character of the complex character-based writing system; and wherein, in said at least one substring of symbols including at least three symbols, which corresponds to one and only one character, at least one first symbol provides phonetic information, at least one second symbol provides information about a radical of said character and at least one third symbol provides information about the shape of the part of said character other than said radical. | 1. A method for transliterating an at least partially phonetic symbol-based writing system including symbols into a complex character-based writing system including characters, said method comprising: entering, with a human-to-machine interface, a string of symbols of said partially phonetic symbol-based writing system into a transliterating engine; parsing said string of symbols into a plurality of substrings, each substring forming an utterance unit corresponding to a character of said string of characters which corresponds to said string of symbols, and at least one substring of symbols including at least three symbols; transliterating said substrings into corresponding characters; displaying the corresponding characters; wherein said transliterating comprises matching, by database retrieval, each substring with one and only one character of the complex character-based writing system; and wherein, in said at least one substring of symbols including at least three symbols, which corresponds to one and only one character, at least one first symbol provides phonetic information, at least one second symbol provides information about a radical of said character and at least one third symbol provides information about the shape of the part of said character other than said radical. 3. The method of claim 1 , further comprising performing, substantially synchronously with said entering of said string of symbols, said parsing, transliterating and displaying of said string of symbols. | 0.789855 |
4,879,648 | 14 | 15 | 14. A method of selecting desired data sets as claimed in claim 1 wherein one categorical list, that comprises a group of data sets, represents a control list and each data set therein represents a control command data set, and one control command is an output data command. | 14. A method of selecting desired data sets as claimed in claim 1 wherein one categorical list, that comprises a group of data sets, represents a control list and each data set therein represents a control command data set, and one control command is an output data command. 15. A method of selecting desired data sets as claimed in claim 14, further including the step of compiling and outputting records containing other displayed and selected data sets upon application of said output data command that occurs when the data set representing said output data command is displayed and selected via said scrolling and select controls. | 0.5 |
9,213,961 | 18 | 25 | 18. In a computer network, a system for quantifying a significance of terms used within web-based social network sites, comprising: a means for implementing a configuration of a plurality of databases comprising a key terms database, a search database, a results database and a cumulative results database, the key terms database configured for storing key terms associated with a marketing of goods or services, wherein the stored key terms are used to generate search queries that are to be provided to a plurality of web-based social network sites, the search database configured for storing search results that are received in response to the generated search queries, wherein the stored search results are transformed into social index scores that indicate a respective significance of the key terms within the plurality of web-based social networks, the results database configured for storing social index scores generated at regular intervals of time, wherein the data stored in the results database is retrieved in order to represent the social index score for the key terms during that interval of time, and the cumulative results database configured for storing cumulative data comprising a plurality of storing social index scores generated over time, wherein the data stored in the cumulative results database is retrieved in order to represent social index scores for the key terms generated over regular intervals of time, a means for receiving an input of one or more key terms corresponding to marketing of goods or services, wherein the received input is stored in the key terms database that stores key terms that are used to generate search queries; a means for generating the search queries from the one or more key terms for retrieving information from the plurality of web-based social network sites indicating use of the one or more key terms within the plurality of web-based social network sites; a means for providing the generated search queries to the plurality of web-based social network sites; a means for receiving search results from the plurality of web-based social network sites in response to the provided search queries, wherein the received search results correspond to social network data from a plurality of social network site users, the received search results stored in the search database that is accessed to transform the search results into social index scores; for a web-based social network site of the plurality of web-based social network sites from which search results are received, a means for assigning an impact weight to the web-based social network site based at least in part on a total amount of stored data of the web-based social network site and a type of media accessed from the web-based social network site; a means for associating the received search results for the web-based social network site with the impact weight corresponding to the web-based social network site; a means for generating one or more social index scores by taking into account at least the received search results and the respective impact weights for the plurality of web-based social network sites, the one or more social index scores stored in at least one of the results database and the cumulative results database, wherein the stored data is retrieved to provide one or more representations of the social index score to a user; and a means for providing, through a user interface, at least one representation of the generated one or more social index scores to the user. | 18. In a computer network, a system for quantifying a significance of terms used within web-based social network sites, comprising: a means for implementing a configuration of a plurality of databases comprising a key terms database, a search database, a results database and a cumulative results database, the key terms database configured for storing key terms associated with a marketing of goods or services, wherein the stored key terms are used to generate search queries that are to be provided to a plurality of web-based social network sites, the search database configured for storing search results that are received in response to the generated search queries, wherein the stored search results are transformed into social index scores that indicate a respective significance of the key terms within the plurality of web-based social networks, the results database configured for storing social index scores generated at regular intervals of time, wherein the data stored in the results database is retrieved in order to represent the social index score for the key terms during that interval of time, and the cumulative results database configured for storing cumulative data comprising a plurality of storing social index scores generated over time, wherein the data stored in the cumulative results database is retrieved in order to represent social index scores for the key terms generated over regular intervals of time, a means for receiving an input of one or more key terms corresponding to marketing of goods or services, wherein the received input is stored in the key terms database that stores key terms that are used to generate search queries; a means for generating the search queries from the one or more key terms for retrieving information from the plurality of web-based social network sites indicating use of the one or more key terms within the plurality of web-based social network sites; a means for providing the generated search queries to the plurality of web-based social network sites; a means for receiving search results from the plurality of web-based social network sites in response to the provided search queries, wherein the received search results correspond to social network data from a plurality of social network site users, the received search results stored in the search database that is accessed to transform the search results into social index scores; for a web-based social network site of the plurality of web-based social network sites from which search results are received, a means for assigning an impact weight to the web-based social network site based at least in part on a total amount of stored data of the web-based social network site and a type of media accessed from the web-based social network site; a means for associating the received search results for the web-based social network site with the impact weight corresponding to the web-based social network site; a means for generating one or more social index scores by taking into account at least the received search results and the respective impact weights for the plurality of web-based social network sites, the one or more social index scores stored in at least one of the results database and the cumulative results database, wherein the stored data is retrieved to provide one or more representations of the social index score to a user; and a means for providing, through a user interface, at least one representation of the generated one or more social index scores to the user. 25. The system of claim 18 , wherein the means for providing at least one representation of the generated one or more social index scores comprises a computer screen for displaying at least one of numerical and visual representations of the index scores to the user. | 0.5 |
9,930,056 | 10 | 15 | 10. A method of enabling desirable bonus features of application code of an application by proximate social interaction among first devices initially in a susceptible state, second devices in a susceptible state, and third devices in an infectious state, the method including: at least initiating delivery of application code including a locked desirable bonus feature to the first devices and second devices in a susceptible state; and at least initiating delivery of application code for the third devices either in the infectious state or triggered into the infectious state after delivery; wherein transition of application code from the susceptible state to the infectious state is accompanied by unlocking of the locked desirable bonus feature; detecting proximate interaction of application code running on any of the third devices with application code running on any of the first devices; and at least initiating application code running on respective first devices to unlock the locked desirable bonus feature and to transition the first devices from the susceptible state to the infectious state, whereby the first devices are enabled to infect the second devices and unlock the locked desirable bonus feature on the second devices. | 10. A method of enabling desirable bonus features of application code of an application by proximate social interaction among first devices initially in a susceptible state, second devices in a susceptible state, and third devices in an infectious state, the method including: at least initiating delivery of application code including a locked desirable bonus feature to the first devices and second devices in a susceptible state; and at least initiating delivery of application code for the third devices either in the infectious state or triggered into the infectious state after delivery; wherein transition of application code from the susceptible state to the infectious state is accompanied by unlocking of the locked desirable bonus feature; detecting proximate interaction of application code running on any of the third devices with application code running on any of the first devices; and at least initiating application code running on respective first devices to unlock the locked desirable bonus feature and to transition the first devices from the susceptible state to the infectious state, whereby the first devices are enabled to infect the second devices and unlock the locked desirable bonus feature on the second devices. 15. The method of claim 10 , wherein application code invokes direct device-to-device communications between susceptible and infectious devices. | 0.76 |
7,603,275 | 17 | 18 | 17. The system of claim 16 , wherein the standard deviation associated with the voice sample of the claimed identity is based on the ratio of unvoiced frames to the total number of frames in the voice sample associated with the claimed identity and a function that describes a relationship between standard deviations and ratios of unvoiced frames to the total number of frames in a population. | 17. The system of claim 16 , wherein the standard deviation associated with the voice sample of the claimed identity is based on the ratio of unvoiced frames to the total number of frames in the voice sample associated with the claimed identity and a function that describes a relationship between standard deviations and ratios of unvoiced frames to the total number of frames in a population. 18. The system of claim 17 , wherein the standard deviation and the ratio of unvoiced frames to the total number of frames in the voice sample associated with the claimed identity are stored with the voice sample of the identity in a database residing in a memory device. | 0.5 |
8,435,038 | 30 | 45 | 30. A non-transitory computer-readable medium comprising program code for causing a computer to perform a method, comprising: receiving, for each learner, a video feed generated by a camera at the learner's location, the video feed at least partially depicting both the learner and a subject on which the learner is demonstrating the practical skill; simultaneously displaying two or more of the video feeds for the plurality of learners at a location of the teacher; receiving and displaying one or more private questions to the teacher from one or more learners, the private questions not being conveyed to the other learners unless authorized by the teacher; and allowing the teacher to select one of the learners for individualized instruction by selecting an indication of the corresponding displayed private question; wherein the private questions can be submitted by one or more selected learners via a text message, an audio or a video; wherein the teacher responds to the one or more selected learners by a text message, audio or video by establishing a private video and/or audio communication channel between the teacher's computer system and the selected learner; wherein the teacher broadcasts the text, audio or video messages to a group of the selected learners by allowing the communication channel to be non-private for the group of selected learners to receive the instruction provided by the teacher; wherein allowing the teacher to store the video feed, annotating the stored video feed and selectively transmit the annotated stored video feed to one or more selected learners. | 30. A non-transitory computer-readable medium comprising program code for causing a computer to perform a method, comprising: receiving, for each learner, a video feed generated by a camera at the learner's location, the video feed at least partially depicting both the learner and a subject on which the learner is demonstrating the practical skill; simultaneously displaying two or more of the video feeds for the plurality of learners at a location of the teacher; receiving and displaying one or more private questions to the teacher from one or more learners, the private questions not being conveyed to the other learners unless authorized by the teacher; and allowing the teacher to select one of the learners for individualized instruction by selecting an indication of the corresponding displayed private question; wherein the private questions can be submitted by one or more selected learners via a text message, an audio or a video; wherein the teacher responds to the one or more selected learners by a text message, audio or video by establishing a private video and/or audio communication channel between the teacher's computer system and the selected learner; wherein the teacher broadcasts the text, audio or video messages to a group of the selected learners by allowing the communication channel to be non-private for the group of selected learners to receive the instruction provided by the teacher; wherein allowing the teacher to store the video feed, annotating the stored video feed and selectively transmit the annotated stored video feed to one or more selected learners. 45. The non-transitory computer-readable medium of claim 30 , wherein the video feed is annotated by adding graphics. | 0.883 |
8,484,017 | 13 | 17 | 13. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: receiving data including (i) audio data that encodes a spoken natural language query, and (ii) environmental audio data; obtaining a transcription of the spoken natural language query; determining a particular content type associated with one or more keywords in the transcription; providing at least a portion of the environmental audio data to a content recognition engine; and identifying a content item that (i) has been output by the content recognition engine, and (ii) matches the particular content type associated with the one or more keywords in the transcription. | 13. A system comprising: one or more computers and one or more storage devices storing instructions that are operable, when executed by the one or more computers, to cause the one or more computers to perform operations comprising: receiving data including (i) audio data that encodes a spoken natural language query, and (ii) environmental audio data; obtaining a transcription of the spoken natural language query; determining a particular content type associated with one or more keywords in the transcription; providing at least a portion of the environmental audio data to a content recognition engine; and identifying a content item that (i) has been output by the content recognition engine, and (ii) matches the particular content type associated with the one or more keywords in the transcription. 17. The system of claim 13 , wherein determining the particular content type further includes identifying the one or more keywords using one or more databases that, for each of multiple content types, maps at least one of the keywords to at least one of the multiple content types. | 0.531667 |
7,904,296 | 1 | 10 | 1. A method comprising: receiving input from a user identifying at least a first portion and a second portion of a first set of audio signals as being of interest to the user, wherein the first portion corresponds to a first instance of an entire spoken event of interest in the first set of audio signals and the second portion corresponds to a second instance of the entire spoken event of interest in the first set of audio signals; processing, by a query recognizer of a word spotting system, each identified portion of the first set of audio signals to generate a corresponding subword unit representation of the identified portion; forming, by the query recognizer of the word spotting system, a representation of the entire spoken event of interest, wherein the forming includes combining the subword unit representations of the respective identified portions of the first set of audio signals; accepting, by a word spotting engine of the word spotting system, data representing unknown speech in a second audio signal; and locating, by the word spotting engine of the word spotting system, putative instances of the entire spoken event of interest in the second audio signal using the representation of the spoken event of interest, wherein the locating includes identifying time locations of the second audio signal at which the entire spoken event of interest is likely to have occurred based on a comparison of the data representing the unknown speech with the representation of the entire spoken event of interest, wherein the first instance of the entire spoken event of interest and the second instance of the entire spoken event of interest include a common set of words, and wherein the subword unit representation corresponding to the first portion and the subword unit representation corresponding to the second portion are different. | 1. A method comprising: receiving input from a user identifying at least a first portion and a second portion of a first set of audio signals as being of interest to the user, wherein the first portion corresponds to a first instance of an entire spoken event of interest in the first set of audio signals and the second portion corresponds to a second instance of the entire spoken event of interest in the first set of audio signals; processing, by a query recognizer of a word spotting system, each identified portion of the first set of audio signals to generate a corresponding subword unit representation of the identified portion; forming, by the query recognizer of the word spotting system, a representation of the entire spoken event of interest, wherein the forming includes combining the subword unit representations of the respective identified portions of the first set of audio signals; accepting, by a word spotting engine of the word spotting system, data representing unknown speech in a second audio signal; and locating, by the word spotting engine of the word spotting system, putative instances of the entire spoken event of interest in the second audio signal using the representation of the spoken event of interest, wherein the locating includes identifying time locations of the second audio signal at which the entire spoken event of interest is likely to have occurred based on a comparison of the data representing the unknown speech with the representation of the entire spoken event of interest, wherein the first instance of the entire spoken event of interest and the second instance of the entire spoken event of interest include a common set of words, and wherein the subword unit representation corresponding to the first portion and the subword unit representation corresponding to the second portion are different. 10. The method of claim 1 wherein forming the representation of the entire spoken event of interest includes determining an n-best list of recognition results. | 0.646667 |
8,589,457 | 1 | 6 | 1. A system, comprising: one or more computers; and a computer-readable storage device storing instructions that, when executed by the one or more computers, cause the one or more computers to perform operations comprising: storing data identifying a plurality of training images for a query, wherein each of the training images is classified as being in a positive group of images for the query or a negative group of images for the query according to a respective query specific preference measure for the image; selecting a first image from either the positive group of images or the negative group of images, and applying a scoring model to the first image to determine a score for the first image; selecting a plurality of candidate images from the other group of images; applying the scoring model to each of the candidate images to determine a respective score for each candidate image, and then selecting a second image from the candidate images, the selection based on a probability that is proportional to a cardinality of the plurality of candidate images and a ranking of the second image relative to each other image in the candidate images based on the respective scores of the images; and determining that the scores for the first image and the second image fail to satisfy a criterion, wherein the criterion requires that a result of the score of the image selected from the positive group of images minus the score of the image selected from the negative group of images exceeds a threshold, updating the scoring model, and storing the updated scoring model. | 1. A system, comprising: one or more computers; and a computer-readable storage device storing instructions that, when executed by the one or more computers, cause the one or more computers to perform operations comprising: storing data identifying a plurality of training images for a query, wherein each of the training images is classified as being in a positive group of images for the query or a negative group of images for the query according to a respective query specific preference measure for the image; selecting a first image from either the positive group of images or the negative group of images, and applying a scoring model to the first image to determine a score for the first image; selecting a plurality of candidate images from the other group of images; applying the scoring model to each of the candidate images to determine a respective score for each candidate image, and then selecting a second image from the candidate images, the selection based on a probability that is proportional to a cardinality of the plurality of candidate images and a ranking of the second image relative to each other image in the candidate images based on the respective scores of the images; and determining that the scores for the first image and the second image fail to satisfy a criterion, wherein the criterion requires that a result of the score of the image selected from the positive group of images minus the score of the image selected from the negative group of images exceeds a threshold, updating the scoring model, and storing the updated scoring model. 6. The system of claim 1 , wherein the operations further comprise: in response to receiving the query through a search interface, identifying a plurality of images responsive to the query; applying the scoring model to each of the plurality of images to determine a respective score for each image; and presenting images from the plurality of images in the search interface, wherein the images are presented in an order according to the respective score for each image. | 0.614754 |
8,666,974 | 1 | 4 | 1. A method comprising: receiving a query directed to a search; analyzing the query to select a characteristic of the query that limits the number of records that the query can retrieve from a database; determining whether the selected query characteristic complies with a search criterion of a plurality of search criteria, each of the plurality of search criteria corresponding to a predefined search index, each predefined search index being drawn from a database and containing identifiers for records of items in the database; selecting a predefined search index corresponding to the selected query characteristic; applying the search criterion for the selected query characteristic to the selected predefined search index; selecting items subject to a collection limit based on applying the search criterion to the selected predefined search index, the collection limit limiting the total number of items that are selected; post-filtering the selected items against the database using search criteria of the received query other than the search criterion of the selected query characteristic; and returning a result set for the query, the result set including only items returned from the post-filtering. | 1. A method comprising: receiving a query directed to a search; analyzing the query to select a characteristic of the query that limits the number of records that the query can retrieve from a database; determining whether the selected query characteristic complies with a search criterion of a plurality of search criteria, each of the plurality of search criteria corresponding to a predefined search index, each predefined search index being drawn from a database and containing identifiers for records of items in the database; selecting a predefined search index corresponding to the selected query characteristic; applying the search criterion for the selected query characteristic to the selected predefined search index; selecting items subject to a collection limit based on applying the search criterion to the selected predefined search index, the collection limit limiting the total number of items that are selected; post-filtering the selected items against the database using search criteria of the received query other than the search criterion of the selected query characteristic; and returning a result set for the query, the result set including only items returned from the post-filtering. 4. The method of claim 1 , wherein one of the plurality of criteria comprises access privileges and wherein the selected predefined search index comprises references to items with a common access privileges. | 0.864173 |
9,905,223 | 8 | 12 | 8. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: receiving, during a natural language dialog between a user and a computing device, an utterance; generating a semantic and syntactic graph using the utterance, the semantic and syntactic graph comprising an initial state and a final state associated with the utterance and being generated by adding transitions that encode semantic and syntactic categories of words or word sequences within the utterance; extracting possible combinations of features from the semantic and syntactic graph, to yield extracted n-grams; comparing the extracted n-grams to previously classified n-grams, to yield a comparison; classifying the utterance as being associated with a call type based on the extracted n-grams and the comparison, wherein the call type is chosen from a predefined set of call types and wherein the call type characterizes a communication, to yield a classified utterance; and responding, with a computer-generated response, to the user in the natural language dialog based on the classified utterance. | 8. A system comprising: a processor; and a computer-readable storage medium having instructions stored which, when executed by the processor, cause the processor to perform operations comprising: receiving, during a natural language dialog between a user and a computing device, an utterance; generating a semantic and syntactic graph using the utterance, the semantic and syntactic graph comprising an initial state and a final state associated with the utterance and being generated by adding transitions that encode semantic and syntactic categories of words or word sequences within the utterance; extracting possible combinations of features from the semantic and syntactic graph, to yield extracted n-grams; comparing the extracted n-grams to previously classified n-grams, to yield a comparison; classifying the utterance as being associated with a call type based on the extracted n-grams and the comparison, wherein the call type is chosen from a predefined set of call types and wherein the call type characterizes a communication, to yield a classified utterance; and responding, with a computer-generated response, to the user in the natural language dialog based on the classified utterance. 12. The system of claim 8 , wherein generating the semantic and syntactic graph extends a feature set of a classifier that performs classifying the utterance. | 0.66383 |
7,685,529 | 1 | 5 | 1. In a computer system having a display and a user interface selection device, a method of providing a graphical user interface on the display, comprising the steps of: (a) displaying a formatting style name on the graphic user interface; (b) displaying text on the graphical user interface, the text formatted in the named style displayed in said step (a); and (c) displaying at least one visual aid on the display indicating a relationship between the style name displayed in said step (a) and the text displayed in said step (b), said step (c) comprising the steps of: (c1) generating a color adjacent to the formatting style name displayed in said step (a), and (c2) automatically assigning the same color for display adjacent the text displayed in said step (b). | 1. In a computer system having a display and a user interface selection device, a method of providing a graphical user interface on the display, comprising the steps of: (a) displaying a formatting style name on the graphic user interface; (b) displaying text on the graphical user interface, the text formatted in the named style displayed in said step (a); and (c) displaying at least one visual aid on the display indicating a relationship between the style name displayed in said step (a) and the text displayed in said step (b), said step (c) comprising the steps of: (c1) generating a color adjacent to the formatting style name displayed in said step (a), and (c2) automatically assigning the same color for display adjacent the text displayed in said step (b). 5. A method as recited in claim 1 , wherein said step (c) of displaying at least one visual aid on the display indicating a relationship between the style name and the text comprising the step of displaying a numeric indicator associated with both the style name and the text. | 0.5 |
6,016,494 | 1 | 6 | 1. A method of accessing electronic information, comprising the steps of: loading an original document onto a data processing system; selecting, at the data processing system, a link embedded in the original document, the link being associated with a linked document; and creating a new document by merging the linked document with the original document, in response to said selecting step. | 1. A method of accessing electronic information, comprising the steps of: loading an original document onto a data processing system; selecting, at the data processing system, a link embedded in the original document, the link being associated with a linked document; and creating a new document by merging the linked document with the original document, in response to said selecting step. 6. The method of claim 1 wherein the linked document is merged with the original document by inserting the contents of the linked document at an end of the original document. | 0.809211 |
9,710,453 | 17 | 18 | 17. A non-transitory computer-readable storage medium encoded with instructions that, when executed, cause at least one processor to: display, at the display, a plurality of alphabet characters; receive an indication of a first gesture that selects a first set of alphabet characters from the plurality of alphabet characters, wherein the first gesture does not select the spacebar; determine, based at least in part on the first set of alphabet characters, a first candidate string; display the first candidate string; and after receiving the indication of the first gesture, after displaying the first candidate string, and prior to receiving any indications of gestures that select the spacebar, receive an indication of a second gesture that selects a second set of alphabet characters from the plurality of alphabet characters, wherein the second gesture is disjoint from the first gesture and does not select the spacebar; determine whether the second set of alphabet characters is included in the first candidate string; and responsive to determining that the second set of alphabet characters is included in the first candidate string, continue the display of the first candidate string; and responsive to determining that the second set of alphabet characters is not included in the first candidate string: determine a second candidate string that includes the second set of alphabet characters; and display, at the display, the second candidate string and one or more space characters that separate the first candidate string from the second candidate string. | 17. A non-transitory computer-readable storage medium encoded with instructions that, when executed, cause at least one processor to: display, at the display, a plurality of alphabet characters; receive an indication of a first gesture that selects a first set of alphabet characters from the plurality of alphabet characters, wherein the first gesture does not select the spacebar; determine, based at least in part on the first set of alphabet characters, a first candidate string; display the first candidate string; and after receiving the indication of the first gesture, after displaying the first candidate string, and prior to receiving any indications of gestures that select the spacebar, receive an indication of a second gesture that selects a second set of alphabet characters from the plurality of alphabet characters, wherein the second gesture is disjoint from the first gesture and does not select the spacebar; determine whether the second set of alphabet characters is included in the first candidate string; and responsive to determining that the second set of alphabet characters is included in the first candidate string, continue the display of the first candidate string; and responsive to determining that the second set of alphabet characters is not included in the first candidate string: determine a second candidate string that includes the second set of alphabet characters; and display, at the display, the second candidate string and one or more space characters that separate the first candidate string from the second candidate string. 18. The non-transitory computer-readable storage medium of claim 17 , wherein the instructions that cause the at least one processor to determine the second candidate string in response to determining that the second set of alphabet characters is not included in the first candidate string word. | 0.703815 |
9,646,260 | 8 | 11 | 8. A computing system, comprising: one or more data stores in a computing network, the one or more data stores having a knowledge base stored therein including a plurality of entity objects and a plurality of facts, each fact corresponding to at least one of a plurality of fact types; and one or more computing device in the computing network configured to: identify first relation data in the knowledge base corresponding to a plurality of facts of a first fact type, wherein for each fact of the first fact type in the knowledge base the first relation data express a relationship for a pair of the entity objects, and wherein for each fact of the first fact type in the knowledge base the first relation data require that one of the pair of entity objects has a unique value for a given value of the other of the pair of entity objects; identify an entity object class based on which of the pair of entity objects corresponding to a first fact of the first fact type is unique; identify a first subset of the entity objects that correspond to the entity object class and for which corresponding facts of the first fact type are not represented in the knowledge base; responsive to identification of the first subset of entity objects, select a first entity object from the first subset of entity objects for generation of a new fact of the first fact type; generate a search engine query using the first relation data and the first entity object; search a set of documents using the search engine query to generate search results; parse the search results to identify first information representing the first relation data for the entity corresponding to the first entity object; generate the new fact for addition to the knowledge base using the first information, the first entity object, and the first relation data; add the new fact to the knowledge base; and repeat the selecting, generating, searching, parsing, generating, and adding for each of the entity objects included in the first subset of the entity objects. | 8. A computing system, comprising: one or more data stores in a computing network, the one or more data stores having a knowledge base stored therein including a plurality of entity objects and a plurality of facts, each fact corresponding to at least one of a plurality of fact types; and one or more computing device in the computing network configured to: identify first relation data in the knowledge base corresponding to a plurality of facts of a first fact type, wherein for each fact of the first fact type in the knowledge base the first relation data express a relationship for a pair of the entity objects, and wherein for each fact of the first fact type in the knowledge base the first relation data require that one of the pair of entity objects has a unique value for a given value of the other of the pair of entity objects; identify an entity object class based on which of the pair of entity objects corresponding to a first fact of the first fact type is unique; identify a first subset of the entity objects that correspond to the entity object class and for which corresponding facts of the first fact type are not represented in the knowledge base; responsive to identification of the first subset of entity objects, select a first entity object from the first subset of entity objects for generation of a new fact of the first fact type; generate a search engine query using the first relation data and the first entity object; search a set of documents using the search engine query to generate search results; parse the search results to identify first information representing the first relation data for the entity corresponding to the first entity object; generate the new fact for addition to the knowledge base using the first information, the first entity object, and the first relation data; add the new fact to the knowledge base; and repeat the selecting, generating, searching, parsing, generating, and adding for each of the entity objects included in the first subset of the entity objects. 11. The computing system of claim 8 , wherein the one or more computing devices are configured to identify the first relation data by tracking unanswered user queries, and identifying the first relation data from the unanswered user queries. | 0.795068 |
8,494,284 | 10 | 19 | 10. An apparatus comprising at least one processor and at least one memory storing computer program code, wherein the at least one memory and stored computer program code are configured, with the at least one processor, to cause the apparatus to at least: calculate an alpha value associated with an image region containing a hypothesized text fragment, the alpha value being defined as a function of a curved character length distribution, a character width distribution, and an inter-character spacing distribution for the hypothesized text fragment; calculate a gamma value based at least in part on an interval length distribution determined for the hypothesized text fragment; and classify whether the image region is a text-containing region based at least in part on the calculated alpha and gamma values. | 10. An apparatus comprising at least one processor and at least one memory storing computer program code, wherein the at least one memory and stored computer program code are configured, with the at least one processor, to cause the apparatus to at least: calculate an alpha value associated with an image region containing a hypothesized text fragment, the alpha value being defined as a function of a curved character length distribution, a character width distribution, and an inter-character spacing distribution for the hypothesized text fragment; calculate a gamma value based at least in part on an interval length distribution determined for the hypothesized text fragment; and classify whether the image region is a text-containing region based at least in part on the calculated alpha and gamma values. 19. The apparatus of claim 10 , wherein the apparatus comprises or is embodied on a mobile computing device, the mobile computing device comprising user interface circuitry and user interface software stored on one or more of the at least one memory; wherein the user interface circuitry and user interface software are configured to: facilitate user control of at least some functions of the mobile computing device through use of a display; and cause at least a portion of a user interface of the mobile computing device to be displayed on the display to facilitate user control of at least some functions of the mobile computing device. | 0.645 |
9,471,885 | 12 | 13 | 12. A system comprising: a computer having a computer input device and a display device connected thereto; and a plurality of distributed processors communicatively coupled to the computer, wherein the computer is configured to coordinate the activities of the distributed processors, wherein each of the distributed processors is configured as a separate domain-specific knowledgebase segment and is further configured to perform a method comprising the steps of: determining that a predictor case base containing predictor rules having predictor antecedents and associated predictor consequents does not contain a predictor rule having a predictor antecedent covered by an acquired predictor context; creating one or more least-generalized predictor antecedents that are covered by the acquired predictor context; creating a corrector context using the predictor consequents associated with the one or more least-generalized predictor antecedents; determining that a corrector case base containing corrector rules having corrector antecedents and associated corrector consequents contains a corrector rule having a corrector antecedent covered by the corrector context; and firing the corrector consequent associated with the corrector antecedent covered by the corrector context. | 12. A system comprising: a computer having a computer input device and a display device connected thereto; and a plurality of distributed processors communicatively coupled to the computer, wherein the computer is configured to coordinate the activities of the distributed processors, wherein each of the distributed processors is configured as a separate domain-specific knowledgebase segment and is further configured to perform a method comprising the steps of: determining that a predictor case base containing predictor rules having predictor antecedents and associated predictor consequents does not contain a predictor rule having a predictor antecedent covered by an acquired predictor context; creating one or more least-generalized predictor antecedents that are covered by the acquired predictor context; creating a corrector context using the predictor consequents associated with the one or more least-generalized predictor antecedents; determining that a corrector case base containing corrector rules having corrector antecedents and associated corrector consequents contains a corrector rule having a corrector antecedent covered by the corrector context; and firing the corrector consequent associated with the corrector antecedent covered by the corrector context. 13. The system of claim 12 , wherein the step of creating one or more least-generalized predictor antecedents that are covered by the predictor context comprises the steps of: for all predictor antecedents in the predictor rule base, creating predictor resultants by subtracting the respective predictor contexts from the respective predictor antecedents; selecting the one or more predictor resultants having the minimal number of predictor resultant terms; and creating the one or more least-generalized predictor antecedents by subtracting the predictor resultant term from the associated predictor antecedent for each of the selected predictor resultants. | 0.55231 |
7,761,843 | 34 | 37 | 34. The tangible computer-readable medium having computer-executable instructions of claim 32 wherein defining a word comprises: selecting a word type; and defining the word as the selected word type. | 34. The tangible computer-readable medium having computer-executable instructions of claim 32 wherein defining a word comprises: selecting a word type; and defining the word as the selected word type. 37. The tangible computer-readable medium having computer-executable instructions of claim 34 wherein the word type comprises a list word comprising two or more options and wherein defining the word as a list word comprises defining each option within the list word. | 0.623229 |
8,055,669 | 1 | 7 | 1. A method of modifying a search query, performed by a server device, the method comprising: determining, by the server device, one or more alternative terms for one or more terms in the search query; obtaining, by the server device, search results based on the search query and based on an indexed corpus of documents, each search result identifying one or more documents in the indexed corpus of documents; defining, by the server device, a query context as a plurality of the documents identified by the search results; comparing, by the server device, the query context to the alternative terms to generate one or more valid ones of the alternative terms; and incorporating, by the server device, one or more of the valid ones of the alternative terms into the search query to obtain a modified search query. | 1. A method of modifying a search query, performed by a server device, the method comprising: determining, by the server device, one or more alternative terms for one or more terms in the search query; obtaining, by the server device, search results based on the search query and based on an indexed corpus of documents, each search result identifying one or more documents in the indexed corpus of documents; defining, by the server device, a query context as a plurality of the documents identified by the search results; comparing, by the server device, the query context to the alternative terms to generate one or more valid ones of the alternative terms; and incorporating, by the server device, one or more of the valid ones of the alternative terms into the search query to obtain a modified search query. 7. The method of claim 1 , where determining one or more alternative terms for one or more terms in the search query includes: performing a thesaurus lookup based on the terms in the search query. | 0.767221 |
9,679,259 | 14 | 21 | 14. A candidate selection system for finding matches between entities, comprising: at least one machine learning system which includes: at least one non-transitory processor-readable medium that stores processor-executable instructions; and at least one processor communicably coupled to the at least one non-transitory processor-readable medium and which executes the processor-executable instructions to: implement the at least one machine learning system including an input layer, an output layer and a hidden layer, the at least one machine learning system trained with at least a first entity and a second entity that are a historically successful pairing, and trained with a plurality of hypothetical alternative pairings between the first entity of the historically successful pairing and other entities of a first set of entities, the hypothetical alternative pairings based on at least one value of at least one attribute of a plurality of attributes associated with the second entity and at least one loosened constraint of a number of constraints on matching the at least one value of the at least one attribute associated with the second entity; and at least one processor-based system, the at least one processor-based system communicatively coupled to the machine learning system, the at least one processor-based system includes: at least one non-transitory processor-readable medium that stores processor-executable instructions; and at least one processor communicably coupled to the at least one non-transitory processor-readable medium and which executes the processor-executable instructions to: receive a number of heuristic values indicative of a strength of a pairing between the first entity and at least one of the entities of the first set of entities; and execute a candidate selection algorithm which employs the received heuristic values and respective values for each of the plurality of attributes to identify prospective candidates within a second set of entities. | 14. A candidate selection system for finding matches between entities, comprising: at least one machine learning system which includes: at least one non-transitory processor-readable medium that stores processor-executable instructions; and at least one processor communicably coupled to the at least one non-transitory processor-readable medium and which executes the processor-executable instructions to: implement the at least one machine learning system including an input layer, an output layer and a hidden layer, the at least one machine learning system trained with at least a first entity and a second entity that are a historically successful pairing, and trained with a plurality of hypothetical alternative pairings between the first entity of the historically successful pairing and other entities of a first set of entities, the hypothetical alternative pairings based on at least one value of at least one attribute of a plurality of attributes associated with the second entity and at least one loosened constraint of a number of constraints on matching the at least one value of the at least one attribute associated with the second entity; and at least one processor-based system, the at least one processor-based system communicatively coupled to the machine learning system, the at least one processor-based system includes: at least one non-transitory processor-readable medium that stores processor-executable instructions; and at least one processor communicably coupled to the at least one non-transitory processor-readable medium and which executes the processor-executable instructions to: receive a number of heuristic values indicative of a strength of a pairing between the first entity and at least one of the entities of the first set of entities; and execute a candidate selection algorithm which employs the received heuristic values and respective values for each of the plurality of attributes to identify prospective candidates within a second set of entities. 21. The candidate selection system of claim 14 wherein at least some of the prospective candidates are presented to a user in a ranked order. | 0.876532 |
9,189,965 | 2 | 3 | 2. A computer program product comprising: a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to provide access to an online discussion; computer readable program code configured to provide access to an online discussion, wherein the online discussion includes one or more threads; computer readable program code configured to accept, for the one or more threads of the online discussion: a posting by an author participating in the discussion; and one or more responses to the posting by other individuals participating in the discussion; and computer readable program code configured to automatically produce for the author a recommendation for amending the posting to increase the likelihood of response to the posting by other individuals participating in the discussion via: triggering an agent based on fulfillment of at least one predetermined criterion; the at least one predetermined criterion being based on: time elapsed since a last login or view time by the author; a number of replies to the posting; and at least one of: a number of views of the posting, a number of times that explicit feedback has been provided by at least one other individual, and a degree of similarity with respect to an existing posting; and thereafter employing the agent to make a determination for performing at least one of: providing explicit feedback from at least one other individual, and classifying the posting to suggest further action to the author. | 2. A computer program product comprising: a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to provide access to an online discussion; computer readable program code configured to provide access to an online discussion, wherein the online discussion includes one or more threads; computer readable program code configured to accept, for the one or more threads of the online discussion: a posting by an author participating in the discussion; and one or more responses to the posting by other individuals participating in the discussion; and computer readable program code configured to automatically produce for the author a recommendation for amending the posting to increase the likelihood of response to the posting by other individuals participating in the discussion via: triggering an agent based on fulfillment of at least one predetermined criterion; the at least one predetermined criterion being based on: time elapsed since a last login or view time by the author; a number of replies to the posting; and at least one of: a number of views of the posting, a number of times that explicit feedback has been provided by at least one other individual, and a degree of similarity with respect to an existing posting; and thereafter employing the agent to make a determination for performing at least one of: providing explicit feedback from at least one other individual, and classifying the posting to suggest further action to the author. 3. The computer program product according to claim 2 , wherein the posting comprises a question. | 0.928783 |
10,140,017 | 7 | 8 | 7. The method of claim 1 , wherein invoking the search comprises: executing, by the keyboard application, a search of content stored at the computing device; and sending an indication of the selected search query to a remote search system, and wherein at least a portion of the search results are received from the remote search system. | 7. The method of claim 1 , wherein invoking the search comprises: executing, by the keyboard application, a search of content stored at the computing device; and sending an indication of the selected search query to a remote search system, and wherein at least a portion of the search results are received from the remote search system. 8. The method of claim 7 , further comprising: ranking, by the keyboard application, the search results; and selecting, by the keyboard application and based on the ranking, the portion of the search results to be output. | 0.5 |
8,060,507 | 1 | 10 | 1. A method for use in personalizing advertising for a user, the method comprising: accessing information indicating which documents in a set of documents were selected by a user for viewing and which documents in the set of documents were not selected by the user for viewing; generating at least one positive word vector using words contained in at least a segment of at least one of the documents that was selected by the user for viewing; generating at least one negative word vector using words contained in at least a segment of at least one the documents that was not selected by the user for viewing; generating document word vectors for at least some of the documents that were selected by the user for viewing; performing, using at least one processor, a vector space relationship analysis of the positive word vector, the negative word vector, and the document word vectors; establishing, using at least one processor, a document rank order of the documents selected by the user for viewing based on the performed vector space relationship analysis; classifying the documents selected by the user for viewing in predetermined categories; ranking the predetermined categories based on the document rank order; sending the ranked categories to an ad server; and receiving advertisements associated with the ranked categories from the ad server in a selected context. | 1. A method for use in personalizing advertising for a user, the method comprising: accessing information indicating which documents in a set of documents were selected by a user for viewing and which documents in the set of documents were not selected by the user for viewing; generating at least one positive word vector using words contained in at least a segment of at least one of the documents that was selected by the user for viewing; generating at least one negative word vector using words contained in at least a segment of at least one the documents that was not selected by the user for viewing; generating document word vectors for at least some of the documents that were selected by the user for viewing; performing, using at least one processor, a vector space relationship analysis of the positive word vector, the negative word vector, and the document word vectors; establishing, using at least one processor, a document rank order of the documents selected by the user for viewing based on the performed vector space relationship analysis; classifying the documents selected by the user for viewing in predetermined categories; ranking the predetermined categories based on the document rank order; sending the ranked categories to an ad server; and receiving advertisements associated with the ranked categories from the ad server in a selected context. 10. The method of claim 1 , wherein the context is a time. | 0.948763 |
7,493,338 | 1 | 3 | 1. A system for providing full-text search integration in XQuery for a binary object XML repository, comprising: a storage device configured to store computer-executable program code; and a processor configured to execute the computer-executable program code on computer executable program modules, comprising: an XQuery interpreter module configured to interpret XQuery code and to accept a search query comprising one or more search expressions having one or more search terms; a function dispatcher module configured to dispatch an XQuery function calling mechanism comprising at least one argument for the search query based on the search expressions; a search function module configured to search and interpret a full-text search query syntax for the XQuery function calling mechanism as a built-in search function specified as part of an XQuery language; a search function manager module configured to determine candidate elements that satisfy at least one of the search terms; a postings module configured to return all of the candidate elements that match at least one of the search expressions, wherein each search expression corresponds to a piece of XML syntax; and a score module configured to return a score that reflects strength of each match. | 1. A system for providing full-text search integration in XQuery for a binary object XML repository, comprising: a storage device configured to store computer-executable program code; and a processor configured to execute the computer-executable program code on computer executable program modules, comprising: an XQuery interpreter module configured to interpret XQuery code and to accept a search query comprising one or more search expressions having one or more search terms; a function dispatcher module configured to dispatch an XQuery function calling mechanism comprising at least one argument for the search query based on the search expressions; a search function module configured to search and interpret a full-text search query syntax for the XQuery function calling mechanism as a built-in search function specified as part of an XQuery language; a search function manager module configured to determine candidate elements that satisfy at least one of the search terms; a postings module configured to return all of the candidate elements that match at least one of the search expressions, wherein each search expression corresponds to a piece of XML syntax; and a score module configured to return a score that reflects strength of each match. 3. The system according to claim 1 , wherein the XQuery function calling mechanism evaluates the argument, locates code associated with the body of the built-in search function, invokes implementation of the built-in search function, and passes argument values to the built-in search function. | 0.5 |
9,734,201 | 1 | 4 | 1. A computer system, the computer system comprising: one or more hardware processors; system memory coupled to the one or more hardware processors, the system memory storing instructions that are executable by the one or more hardware processors; and the one or more hardware processors executing the instructions stored in the system memory to optimize a query, including the following: access a query plan search space for a query of a distributed database, the query plan search space including a hierarchical structure of a root group of logical operators, one or more intermediate groups of logical operators, and one or more leaf groups of logical operators; and formulate an annotated query plan search space for the query, including: identify a distribution property for a child group of at least one other group, the at least one other group selected from among: the root group and the one or more intermediate groups, the distribution property indicating type of distribution relevant to the child group, the distribution property identifying a column that data for a parent group is distributed on, the parent group being above the child group in the hierarchical structure; and annotate the child group with the type of distribution by attaching an indication of the identified column to the child group to propagate the identified type of distribution to the child group for use in query plan pruning. | 1. A computer system, the computer system comprising: one or more hardware processors; system memory coupled to the one or more hardware processors, the system memory storing instructions that are executable by the one or more hardware processors; and the one or more hardware processors executing the instructions stored in the system memory to optimize a query, including the following: access a query plan search space for a query of a distributed database, the query plan search space including a hierarchical structure of a root group of logical operators, one or more intermediate groups of logical operators, and one or more leaf groups of logical operators; and formulate an annotated query plan search space for the query, including: identify a distribution property for a child group of at least one other group, the at least one other group selected from among: the root group and the one or more intermediate groups, the distribution property indicating type of distribution relevant to the child group, the distribution property identifying a column that data for a parent group is distributed on, the parent group being above the child group in the hierarchical structure; and annotate the child group with the type of distribution by attaching an indication of the identified column to the child group to propagate the identified type of distribution to the child group for use in query plan pruning. 4. The computer system of claim 1 , wherein the one or more hardware processors executing the instructions to identify a distribution property comprises the one or more hardware processors executing the instructions to identify distribution property for a type of distribution that includes a combination of a replicated distribution and an indication that a table is located on a control node of the distributed database. | 0.664547 |
9,336,295 | 6 | 7 | 6. The method of claim 4 further comprising identifying an operational property of the initial classification, the operational property including at least one of a motion, a location, an event, or an environment associated with the initial classification. | 6. The method of claim 4 further comprising identifying an operational property of the initial classification, the operational property including at least one of a motion, a location, an event, or an environment associated with the initial classification. 7. The method of claim 6 wherein the creating the fusion class is based on the operational property of the initial classification. | 0.5 |
8,195,756 | 10 | 11 | 10. A non-transitory computer-readable storage medium with an executable program stored thereon, wherein the program instructs a processor to perform the following steps: display a plurality of recipient databases for enabling a user to select a recipient database, the recipient databases at least comprising contact names associated with elected offices and profiles of the contact names; display contact names contained within a selected recipient database for enabling the user to select at least one contact name from the recipient database to receive a message; display a profile associated with the a selected contact name; display a plurality of communication templates for enabling the user to select a communication template for generating the message; display a selected communication template for editing by the user; and display a plurality of delivery options for enabling the user to select a delivery option for the message; displaying a plurality of formatting options for a selected delivery option of printing the message, the formatting options being based, at least in part, on envelope types for the printed message; and displaying an option of saving the message in which the message is saved on the user's local non-transitory storage device. | 10. A non-transitory computer-readable storage medium with an executable program stored thereon, wherein the program instructs a processor to perform the following steps: display a plurality of recipient databases for enabling a user to select a recipient database, the recipient databases at least comprising contact names associated with elected offices and profiles of the contact names; display contact names contained within a selected recipient database for enabling the user to select at least one contact name from the recipient database to receive a message; display a profile associated with the a selected contact name; display a plurality of communication templates for enabling the user to select a communication template for generating the message; display a selected communication template for editing by the user; and display a plurality of delivery options for enabling the user to select a delivery option for the message; displaying a plurality of formatting options for a selected delivery option of printing the message, the formatting options being based, at least in part, on envelope types for the printed message; and displaying an option of saving the message in which the message is saved on the user's local non-transitory storage device. 11. The program instructing the processor as recited in claim 10 , further comprising instructions for enabling the user to refer one or more additional users. | 0.581579 |
9,535,955 | 1 | 6 | 1. A method comprising: comparing at least one aspect of a query to access a data store to one or more rule sets associated with the data store to determine at least one potential access path within the data store for responding to the query, wherein said comparing the at least one aspect is carried out prior to executing said query on the data store; comparing information pertaining to an entity responsible for submission of the query to risk information pertaining to one or more entities to determine a level of risk associated with the entity, wherein said risk information comprises an established risk level attributed to (i) one or more internet protocol addresses pertaining to the one or more entities and (ii) one or more account identifiers pertaining to the one or more entities, wherein said comparing comprises comparing the one or more internet protocol addresses pertaining to the one or more entities to (a) a white list of internet protocol addresses and (b) a list of internet protocol addresses linked to fraudulent activity, and wherein said comparing the information is carried out prior to executing said query on the data store; generating a modified version of the query based on information derived from the at least one potential access path within the data store for responding to the query, wherein said generating comprises re-formatting one or more Rete-based rules to reduce response data resulting from the query, and wherein said generating the modified version of the query is carried out prior to executing said query on the data store; calculating a risk score associated with the modified version of the query based on (i) the level of risk associated with the entity responsible for submission of the query, (ii) one or more aspects of the modified version of the query, and (iii) a correlation between the level of risk associated with the entity and at least one of one or more historical use cases and one or more policy parameters, wherein said calculating is carried out prior to executing said modified version of the query on the data store; determining, based on the risk score, one or more of multiple authentication operations to be implemented prior to executing the modified version of the query on the data store; and implementing the one or more authentication operations prior to executing the modified version of the query on the data store. | 1. A method comprising: comparing at least one aspect of a query to access a data store to one or more rule sets associated with the data store to determine at least one potential access path within the data store for responding to the query, wherein said comparing the at least one aspect is carried out prior to executing said query on the data store; comparing information pertaining to an entity responsible for submission of the query to risk information pertaining to one or more entities to determine a level of risk associated with the entity, wherein said risk information comprises an established risk level attributed to (i) one or more internet protocol addresses pertaining to the one or more entities and (ii) one or more account identifiers pertaining to the one or more entities, wherein said comparing comprises comparing the one or more internet protocol addresses pertaining to the one or more entities to (a) a white list of internet protocol addresses and (b) a list of internet protocol addresses linked to fraudulent activity, and wherein said comparing the information is carried out prior to executing said query on the data store; generating a modified version of the query based on information derived from the at least one potential access path within the data store for responding to the query, wherein said generating comprises re-formatting one or more Rete-based rules to reduce response data resulting from the query, and wherein said generating the modified version of the query is carried out prior to executing said query on the data store; calculating a risk score associated with the modified version of the query based on (i) the level of risk associated with the entity responsible for submission of the query, (ii) one or more aspects of the modified version of the query, and (iii) a correlation between the level of risk associated with the entity and at least one of one or more historical use cases and one or more policy parameters, wherein said calculating is carried out prior to executing said modified version of the query on the data store; determining, based on the risk score, one or more of multiple authentication operations to be implemented prior to executing the modified version of the query on the data store; and implementing the one or more authentication operations prior to executing the modified version of the query on the data store. 6. The method of claim 1 , wherein said information pertaining to an entity responsible for submission of the query comprises at least one of an internet protocol address of the entity and an account identifier of the entity. | 0.795826 |
8,144,755 | 19 | 21 | 19. A receiver comprising: (a) an error check and correction unit for calculating error corrected encoded data words on the basis of sampled encoded data words received by the receiver; and (b) a correlation unit for correlating a time sequence of received sampled encoded data words supplied by a sampling unit with error corrected encoded data words of current, previous and subsequent data transmissions to determine a skew for each data bit of the received encoded data words. | 19. A receiver comprising: (a) an error check and correction unit for calculating error corrected encoded data words on the basis of sampled encoded data words received by the receiver; and (b) a correlation unit for correlating a time sequence of received sampled encoded data words supplied by a sampling unit with error corrected encoded data words of current, previous and subsequent data transmissions to determine a skew for each data bit of the received encoded data words. 21. A memory controller comprising a receiver according to claim 19 . | 0.7 |
8,645,928 | 8 | 15 | 8. A computer system to localize a source language user interface of a software application to a target language user interface, comprising: a processor; and memory coupled to said processor, said memory storing: one or more instructions that extract source language GUI component text of one or more GUI components from bytecode of said software application while said software application is executing to generate said source language user interface, said instructions including: one or more instructions that identify that a localizable method in said bytecode of said software application matches a method found in a class-method map; one or more instructions that add instructions associated with the localizable method to said bytecode in response to the identifying; and one or more instructions that extract source language GUI component text from an input parameter of the localizable method; one or more instructions that form a localization pack file that includes said extracted source language GUI component text and a translation of said source language GUI component text to said target language, wherein said localization pack file contains a plurality of key-value pairs, and wherein each key-value pair includes a value containing at least a portion of said extracted source language GUI component text and a key indicating a location of the localizable method in said bytecode of said software application from which the portion of extracted source language GUI component text was extracted; one or more instructions that translate said source language GUI component text of said localization pack file to a target language; one or more instructions that, in response to said software application executing again, read said translated GUI component text; one or more instructions that form one or more GUI components that include said translated GUI component text; and one or more instructions that display said GUI components that include said translated GUI component text. | 8. A computer system to localize a source language user interface of a software application to a target language user interface, comprising: a processor; and memory coupled to said processor, said memory storing: one or more instructions that extract source language GUI component text of one or more GUI components from bytecode of said software application while said software application is executing to generate said source language user interface, said instructions including: one or more instructions that identify that a localizable method in said bytecode of said software application matches a method found in a class-method map; one or more instructions that add instructions associated with the localizable method to said bytecode in response to the identifying; and one or more instructions that extract source language GUI component text from an input parameter of the localizable method; one or more instructions that form a localization pack file that includes said extracted source language GUI component text and a translation of said source language GUI component text to said target language, wherein said localization pack file contains a plurality of key-value pairs, and wherein each key-value pair includes a value containing at least a portion of said extracted source language GUI component text and a key indicating a location of the localizable method in said bytecode of said software application from which the portion of extracted source language GUI component text was extracted; one or more instructions that translate said source language GUI component text of said localization pack file to a target language; one or more instructions that, in response to said software application executing again, read said translated GUI component text; one or more instructions that form one or more GUI components that include said translated GUI component text; and one or more instructions that display said GUI components that include said translated GUI component text. 15. The computer system of claim 8 wherein said software application is a Java Rich Application comprising at least one of: Abstract Window Toolkit, Swing and Eclipse Standard Widget Toolkit. | 0.865493 |
7,480,860 | 42 | 43 | 42. A system comprising: a processor; and a memory, coupled to the processor, having code stored therein to cause the system to generate a data document, wherein the code is executable by the processor for: storing a raw form of the document; parsing the document to create an internal representation of the document; and receiving a request from a client computer system coupled to the data processing system to generate a second-level document into a particular form; decomposing the document into the form requested by the client system, wherein decomposing the document comprises: applying a first first-level transform to the internal representation of the document to create a first first-level document; and in response to the request to generate the second-level document, applying a second-level transform to the first first-level document to create the second-level document; decomposing the document to create a second first-level document, wherein decomposing the document to create the second first-level document comprises: applying a second first-level transform to the internal representation of the document to create a second first-level document; tracking changes to at least one of: (i) the raw form of the document, (ii) the first first-level transform, (iii) the second level transform, and (iv) the second first-level transform; regenerating the document created using any of (i)-(iv) whose changes are tracked if a change occurs in any of (i)-(iv) whose changes are tracked; and designating a previously stored version of the regenerated document invalid; wherein the first first-level document and the second first-level document are different. | 42. A system comprising: a processor; and a memory, coupled to the processor, having code stored therein to cause the system to generate a data document, wherein the code is executable by the processor for: storing a raw form of the document; parsing the document to create an internal representation of the document; and receiving a request from a client computer system coupled to the data processing system to generate a second-level document into a particular form; decomposing the document into the form requested by the client system, wherein decomposing the document comprises: applying a first first-level transform to the internal representation of the document to create a first first-level document; and in response to the request to generate the second-level document, applying a second-level transform to the first first-level document to create the second-level document; decomposing the document to create a second first-level document, wherein decomposing the document to create the second first-level document comprises: applying a second first-level transform to the internal representation of the document to create a second first-level document; tracking changes to at least one of: (i) the raw form of the document, (ii) the first first-level transform, (iii) the second level transform, and (iv) the second first-level transform; regenerating the document created using any of (i)-(iv) whose changes are tracked if a change occurs in any of (i)-(iv) whose changes are tracked; and designating a previously stored version of the regenerated document invalid; wherein the first first-level document and the second first-level document are different. 43. The system as defined in claim 42 , wherein applying a first first-level transform and applying a second-level transform comprises applying sequential transforms to the document. | 0.706452 |
8,347,266 | 7 | 10 | 7. A method for processing code associated with a computer program, comprising: identifying a class declaration in the code that includes a variable and a modifier associated with the variable, the modifier designating that the variable is to be used for determining the identity of an object within the class, and for determining whether the object within the class is equal to another object based on value semantics; and responsive to identifying the class declaration that includes the variable and the modifier associated with the variable: using the variable to determine the identity of the object within the class, and using the variable to determine whether the object within the class is equal to the other object based on value semantics, said using the variable to determine the identity of the object within the class and said using the variable to determine whether the object within the class is equal to the other object based on value semantics comprising automatically overriding an Equals virtual method and a GetHashCode virtual method such that the overridden Equals virtual method and the overridden GetHashCode virtual method are implemented using the variable and satisfy a required contract associated with the virtual methods. | 7. A method for processing code associated with a computer program, comprising: identifying a class declaration in the code that includes a variable and a modifier associated with the variable, the modifier designating that the variable is to be used for determining the identity of an object within the class, and for determining whether the object within the class is equal to another object based on value semantics; and responsive to identifying the class declaration that includes the variable and the modifier associated with the variable: using the variable to determine the identity of the object within the class, and using the variable to determine whether the object within the class is equal to the other object based on value semantics, said using the variable to determine the identity of the object within the class and said using the variable to determine whether the object within the class is equal to the other object based on value semantics comprising automatically overriding an Equals virtual method and a GetHashCode virtual method such that the overridden Equals virtual method and the overridden GetHashCode virtual method are implemented using the variable and satisfy a required contract associated with the virtual methods. 10. The method of claim 7 , wherein implementing at least one constraint with respect to the variable comprises: requiring that the variable be immutable or, if the variable is a reference type, performing a recursive function to ensure that the reference type includes a like variable that is required to be immutable. | 0.556944 |
7,957,968 | 1 | 4 | 1. A computer based method for automatically generating a hierarchical grammar associated with a plurality of tasks comprising the steps of: creating a sub-grammar for each of the plurality of tasks, wherein creating a sub-grammar for a task comprises: receiving data representing the task based from responses received from a distributed database; automatically tagging the data into parts of speech to form tagged data using a processor executing instructions included in a memory coupled to the processor; identifying filler words and core words from said tagged data by applying rules to differentiate between filler words and core words using the processor executing instructions included in the memory coupled to the processor; automatically modeling sentence structure based upon said tagged data using a set of modeling rules retrieved from the memory coupled to the processor; automatically identifying synonyms of said core words; and automatically creating a sub-grammar using the modeled sentence structure, the tagged data, the identified synonyms, and the identified core words; and creating a high-level grammar by combining filler words identified in the creation of the sub-grammars. | 1. A computer based method for automatically generating a hierarchical grammar associated with a plurality of tasks comprising the steps of: creating a sub-grammar for each of the plurality of tasks, wherein creating a sub-grammar for a task comprises: receiving data representing the task based from responses received from a distributed database; automatically tagging the data into parts of speech to form tagged data using a processor executing instructions included in a memory coupled to the processor; identifying filler words and core words from said tagged data by applying rules to differentiate between filler words and core words using the processor executing instructions included in the memory coupled to the processor; automatically modeling sentence structure based upon said tagged data using a set of modeling rules retrieved from the memory coupled to the processor; automatically identifying synonyms of said core words; and automatically creating a sub-grammar using the modeled sentence structure, the tagged data, the identified synonyms, and the identified core words; and creating a high-level grammar by combining filler words identified in the creation of the sub-grammars. 4. The method of claim 1 , wherein said hierarchical grammar is used to recognize speech. | 0.649606 |
7,483,891 | 7 | 9 | 7. The system of claim 1 , wherein the relevant content is pointed at by a set of links that are served with the base content. | 7. The system of claim 1 , wherein the relevant content is pointed at by a set of links that are served with the base content. 9. The system of claim 7 , wherein the set of links include uniform resource locators (URLs). | 0.696078 |
8,793,239 | 1 | 3 | 1. A method comprising: automatically observing user interaction with a particular web form; producing one or more URL fetch patterns corresponding to the particular web form based, at least in part, on the observed user interaction; generating a first URL, based, at least in part, on the one or more URL fetch patterns, wherein the first URL includes a first value for a particular parameter associated with the particular web form; automatically crawling the first URL to obtain a first record; automatically extracting business information from the first record; applying one or more tags, based on the business information, to an entry in a business listing database; generating a second URL, based, at least in part, on the one or more URL fetch patterns, wherein the second URL includes a second value for the particular parameter; wherein the second value is distinct from the first value; automatically crawling the second URL to obtain a second record; and automatically extracting second business information from the second record; wherein the method is performed by one or more computing devices. | 1. A method comprising: automatically observing user interaction with a particular web form; producing one or more URL fetch patterns corresponding to the particular web form based, at least in part, on the observed user interaction; generating a first URL, based, at least in part, on the one or more URL fetch patterns, wherein the first URL includes a first value for a particular parameter associated with the particular web form; automatically crawling the first URL to obtain a first record; automatically extracting business information from the first record; applying one or more tags, based on the business information, to an entry in a business listing database; generating a second URL, based, at least in part, on the one or more URL fetch patterns, wherein the second URL includes a second value for the particular parameter; wherein the second value is distinct from the first value; automatically crawling the second URL to obtain a second record; and automatically extracting second business information from the second record; wherein the method is performed by one or more computing devices. 3. The method of claim 1 , wherein said producing one or more URL fetch patterns corresponding to the particular web form based, at least in part, on the observed user interaction further comprises: automatically processing the observed user interaction and one or more candidate fetch URLs that are submitted as a result of the observed user interaction to determine a particular template URL for the particular web form and a set of parameters included in the particular template URL; wherein the set of parameters includes the particular parameter; identifying a particular dictionary for the particular parameter; wherein the first value for the particular parameter is indicated by the particular dictionary. | 0.5 |
8,024,326 | 21 | 36 | 21. A computer program product tangibly embodied in one or more non-transitory computer-readable media storing instructions that, when executed, cause a processor to perform operations comprising: (a) receiving a search query from a first user; (b) identifying a first related query as being related to the search query based on information that indicates relative timing or sequencing between the search query and the first related query in prior submissions by a plurality of users that include users other than the first user; (c) identifying a first article that is responsive to the search query; (d) in response to identifying the first article as responsive to the search query, retrieving data associated with the first related query that indicates, at least, a frequency with which users have selected the first article when the first article has been presented as a search result for the first related query; and (e) determining a first ranking score for the first article as a search result for the received search query based at least in part on the retrieved data associated with the first related query. | 21. A computer program product tangibly embodied in one or more non-transitory computer-readable media storing instructions that, when executed, cause a processor to perform operations comprising: (a) receiving a search query from a first user; (b) identifying a first related query as being related to the search query based on information that indicates relative timing or sequencing between the search query and the first related query in prior submissions by a plurality of users that include users other than the first user; (c) identifying a first article that is responsive to the search query; (d) in response to identifying the first article as responsive to the search query, retrieving data associated with the first related query that indicates, at least, a frequency with which users have selected the first article when the first article has been presented as a search result for the first related query; and (e) determining a first ranking score for the first article as a search result for the received search query based at least in part on the retrieved data associated with the first related query. 36. The computer program product of claim 21 , wherein the related query data associated with the first related query comprises a second selection score for a second article associated with the first related query. | 0.633562 |
8,781,080 | 1 | 6 | 1. A method comprising: receiving an audio message from a first user; generating a text-based representation of the audio message; generating one or more identification tags using the text-based representation of the audio message, wherein at least one of the one or more identification tags includes a subject of the audio message; and presenting at least one of the text-based representation of the audio message or the one or more identification tags to a second user using a graphical user interface. | 1. A method comprising: receiving an audio message from a first user; generating a text-based representation of the audio message; generating one or more identification tags using the text-based representation of the audio message, wherein at least one of the one or more identification tags includes a subject of the audio message; and presenting at least one of the text-based representation of the audio message or the one or more identification tags to a second user using a graphical user interface. 6. The method of claim 1 , wherein generating the one or more identification tags comprises selecting one or more terms from a beginning portion of the text-based representation of the audio message, and wherein the one or more identification tags includes the selected one or more terms. | 0.767367 |
8,281,250 | 1 | 3 | 1. A method comprising: preparing a plurality of documents; determining at least one value of at least one type of metadata corresponding to each of the plurality of documents and associating the at least one value of the metadata with the corresponding document; displaying a plurality of icons corresponding to the plurality of documents in 2 or 3 dimensions in a display region; and selecting the at least one value of the metadata for varying the display states of the plurality of the icons in the display region based on the selected value of the metadata; wherein the display region is divided into sub-regions with some of the sub-regions associated with at least one value of the metadata; wherein if one of the plurality of icons contains metadata pertaining to at least two of the sub-regions, displaying the one of the plurality of icons to be in a sub-region between the at least two of the sub-regions; wherein each of the plurality of icons are positioned in the display region based, at least in part, on a value of a date type of metadata of the corresponding plurality of documents; wherein upon selecting the at least one of the value of the metadata, only the icons corresponding to the documents filtered using the selected least one of the value of the metadata are displayed in the display region. | 1. A method comprising: preparing a plurality of documents; determining at least one value of at least one type of metadata corresponding to each of the plurality of documents and associating the at least one value of the metadata with the corresponding document; displaying a plurality of icons corresponding to the plurality of documents in 2 or 3 dimensions in a display region; and selecting the at least one value of the metadata for varying the display states of the plurality of the icons in the display region based on the selected value of the metadata; wherein the display region is divided into sub-regions with some of the sub-regions associated with at least one value of the metadata; wherein if one of the plurality of icons contains metadata pertaining to at least two of the sub-regions, displaying the one of the plurality of icons to be in a sub-region between the at least two of the sub-regions; wherein each of the plurality of icons are positioned in the display region based, at least in part, on a value of a date type of metadata of the corresponding plurality of documents; wherein upon selecting the at least one of the value of the metadata, only the icons corresponding to the documents filtered using the selected least one of the value of the metadata are displayed in the display region. 3. The method of claim 1 , wherein the metadata comprises at least one type of a keyphrase, an author, a topic, a location, a time, or a publication associated with the corresponding document. | 0.589744 |
7,801,838 | 21 | 23 | 21. A method for improving recognition results, comprising: receiving multimedia data; recognizing the multimedia data based on training data to generate a plurality of documents; receiving user augmentation relating to one of the documents wherein the receiving user augmentation relating to one of the documents includes receiving annotation of the one of the documents, as an annotated document, from a user, and storing the annotated document; supplementing the training data with the user augmentation to obtain supplemented training data; and retraining based on the supplemented training data. | 21. A method for improving recognition results, comprising: receiving multimedia data; recognizing the multimedia data based on training data to generate a plurality of documents; receiving user augmentation relating to one of the documents wherein the receiving user augmentation relating to one of the documents includes receiving annotation of the one of the documents, as an annotated document, from a user, and storing the annotated document; supplementing the training data with the user augmentation to obtain supplemented training data; and retraining based on the supplemented training data. 23. The method of claim 21 , wherein the receiving annotation of the one of the documents includes at least one of: receiving a bookmark relating to the one of the documents, receiving highlighting regarding one or more portions of the one of the documents, and receiving a note relating to at least a portion of the one of the documents. | 0.5 |
8,204,805 | 13 | 15 | 13. A system for preparing a tax return for a user, comprising: a memory and a processor, operatively connected to the memory; a tax inference engine executing on the processor without user intervention and configured to: identify, by applying a plurality of inference rules based on information of the user, a first document and an entity configured to maintain the first document, receive a downloaded copy of the first document, retrieve a first tax data item from the first document by applying the plurality of inference rules based on the downloaded copy, receive a scanned image of a second document, and retrieve a second tax data item from the second document by applying the plurality of inference rules based on the scanned image; a data import service executing on the processor without user intervention and configured to: identify access mechanism for accessing the first document from the entity, obtain the downloaded copy of the first document based on the access mechanism for sending to the tax inference engine, and obtain the scanned image of the second document for sending to the tax inference engine, and a tax preparation application executing on the processor and configured to: generate a partially completed tax return by populating a tax form of the tax return using the first and second tax data items and calculating a preliminary tax liability therefrom, and display the partially completed tax return comprising the preliminary tax liability to the user. | 13. A system for preparing a tax return for a user, comprising: a memory and a processor, operatively connected to the memory; a tax inference engine executing on the processor without user intervention and configured to: identify, by applying a plurality of inference rules based on information of the user, a first document and an entity configured to maintain the first document, receive a downloaded copy of the first document, retrieve a first tax data item from the first document by applying the plurality of inference rules based on the downloaded copy, receive a scanned image of a second document, and retrieve a second tax data item from the second document by applying the plurality of inference rules based on the scanned image; a data import service executing on the processor without user intervention and configured to: identify access mechanism for accessing the first document from the entity, obtain the downloaded copy of the first document based on the access mechanism for sending to the tax inference engine, and obtain the scanned image of the second document for sending to the tax inference engine, and a tax preparation application executing on the processor and configured to: generate a partially completed tax return by populating a tax form of the tax return using the first and second tax data items and calculating a preliminary tax liability therefrom, and display the partially completed tax return comprising the preliminary tax liability to the user. 15. The system of claim 13 , wherein the tax inference engine is further configured to: display a user selection menu comprising at least one selected from a group consisting of a list of document types and a plurality of images of example documents; receive a user selection from the user selection menu; determine an identity of the second document based on the user selection; and identify a document template based on the identity of the second document, wherein retrieving the second tax data item from the scanned image comprises using optical character recognition based on the document template. | 0.625466 |
9,843,610 | 1 | 7 | 1. A method performed by a server device, comprising: receiving, by the server device and from a first mobile computing device associated with a first child wearable device, a request to create a logical connection for social networking between the first child wearable device and a second child wearable device; sending, by the server device, the request to a second mobile computing device associated with the second child wearable device; receiving, by the server device, an acceptance of the request from the second mobile computing device; creating, by the server device and in response to the acceptance, the logical connection between the first child wearable device and the second child wearable device; and enabling, by the server device, social networking services between the first child wearable device and the second child wearable device. | 1. A method performed by a server device, comprising: receiving, by the server device and from a first mobile computing device associated with a first child wearable device, a request to create a logical connection for social networking between the first child wearable device and a second child wearable device; sending, by the server device, the request to a second mobile computing device associated with the second child wearable device; receiving, by the server device, an acceptance of the request from the second mobile computing device; creating, by the server device and in response to the acceptance, the logical connection between the first child wearable device and the second child wearable device; and enabling, by the server device, social networking services between the first child wearable device and the second child wearable device. 7. The method of claim 1 , further comprising: notifying the first child wearable device and the second child wearable device that a friend request is pending; receiving an accept message, corresponding to the friend request, from each of the first child wearable device and the second child wearable device; and creating the logical connection between the first child wearable device and the second child wearable device in response to the accept message from each of the first child wearable device and the second child wearable device. | 0.5 |
8,407,041 | 1 | 3 | 1. A computer-implemented training system for speech translation, comprising: a discriminative training component derived from a decision rule of a speech translation component, the speech translation component recognizes speech input using a recognition process and translates a recognition output to multiple hypotheses as translation output using a machine translation process, the discriminative training component includes an objective function that integrates the recognition process and the machine translation process; and a processor that executes computer-executable instructions associated with at least the training component. | 1. A computer-implemented training system for speech translation, comprising: a discriminative training component derived from a decision rule of a speech translation component, the speech translation component recognizes speech input using a recognition process and translates a recognition output to multiple hypotheses as translation output using a machine translation process, the discriminative training component includes an objective function that integrates the recognition process and the machine translation process; and a processor that executes computer-executable instructions associated with at least the training component. 3. The system of claim 1 , wherein the decision rule is a Bayesian decision rule. | 0.875767 |
7,831,423 | 5 | 8 | 5. A computer-implemented method for use with a document tangibly stored in a first computer-readable medium, the method comprising: (A) accessing the first computer-readable medium to identify a first phrase within the document, the first phrase representing a first written form of a concept; (B) determining whether a plurality of text keys tangibly stored in a second computer-readable medium includes a matching text key having at least a predetermined degree of similarity to the first phrase; and (C) if the plurality of text keys is determined to include the matching text key, then: (i) accessing the second computer-readable medium to identify a text value associated with the text key; and (ii) replacing the first phrase with the text value in the document on the first computer-readable medium; (D) after (C), replacing the text value with the matching first phrase in the document on the first computer-readable medium; and (E) before (B), receiving an instruction from a user to modify the first phrase; wherein (B) and (C) are performed in response to receipt of the instruction; and wherein the instruction does not include the text value. | 5. A computer-implemented method for use with a document tangibly stored in a first computer-readable medium, the method comprising: (A) accessing the first computer-readable medium to identify a first phrase within the document, the first phrase representing a first written form of a concept; (B) determining whether a plurality of text keys tangibly stored in a second computer-readable medium includes a matching text key having at least a predetermined degree of similarity to the first phrase; and (C) if the plurality of text keys is determined to include the matching text key, then: (i) accessing the second computer-readable medium to identify a text value associated with the text key; and (ii) replacing the first phrase with the text value in the document on the first computer-readable medium; (D) after (C), replacing the text value with the matching first phrase in the document on the first computer-readable medium; and (E) before (B), receiving an instruction from a user to modify the first phrase; wherein (B) and (C) are performed in response to receipt of the instruction; and wherein the instruction does not include the text value. 8. The method of claim 5 , wherein (C) (i) comprises accessing the second computer-readable medium to identify the text value based on a context of the first phrase in the document. | 0.531088 |
9,032,298 | 1 | 11 | 1. A Web-based system for accessing development components, which include an online video clip library and an online music clip library, and enabling online production of custom-integrated media products, said system comprising at least one computer server connected to a computer network, said server including: an upload engine capable of receiving over the computer network a plurality of video and music clips from a plurality of content provider users; a storage engine capable of storing the uploaded plurality of video and music clips provided by said plurality of content provider users in a database and media content storage devices as libraries; a search engine capable of indexing the database and media content storage devices that store the libraries of uploaded video and music clips; a user interface engine capable of providing over the computer network to a plurality of producer users interactive Web formatting screens allowing said producer users to select from said libraries a plurality of video and music clips from among any of the video and music clips uploaded by said plurality of content provider users; and a mixer module capable of allowing said producer users to edit and play said selected video and music clips, wherein said mixer module supports mixing together a plurality of said uploaded video and music clips, such that producer users are able to self-produce video advertisement templates each comprising static content and at least one placeholder, said mixer module further capable of allowing advertiser users to customize said video advertisement templates by uploading a list, such that advertiser users are able to automatically self-produce a set of different customized video advertisements based on an advertisement template, in which the at least one placeholder for each customized video advertisement contains a different item from the list, wherein said mixer module is capable of arranging said video advertisement templates and customized video advertisements as respective XML files on a server, said XML files being accessible by a plurality of users using respective browser applications, such that upon updating an XML file representing a video advertisement template or a customized video advertisement, the updated video advertisement template or customized video advertisement is made accessible to users accessing the updated XML file; said system further comprising a Web application for encoding and formatting video advertisements in particular formats. | 1. A Web-based system for accessing development components, which include an online video clip library and an online music clip library, and enabling online production of custom-integrated media products, said system comprising at least one computer server connected to a computer network, said server including: an upload engine capable of receiving over the computer network a plurality of video and music clips from a plurality of content provider users; a storage engine capable of storing the uploaded plurality of video and music clips provided by said plurality of content provider users in a database and media content storage devices as libraries; a search engine capable of indexing the database and media content storage devices that store the libraries of uploaded video and music clips; a user interface engine capable of providing over the computer network to a plurality of producer users interactive Web formatting screens allowing said producer users to select from said libraries a plurality of video and music clips from among any of the video and music clips uploaded by said plurality of content provider users; and a mixer module capable of allowing said producer users to edit and play said selected video and music clips, wherein said mixer module supports mixing together a plurality of said uploaded video and music clips, such that producer users are able to self-produce video advertisement templates each comprising static content and at least one placeholder, said mixer module further capable of allowing advertiser users to customize said video advertisement templates by uploading a list, such that advertiser users are able to automatically self-produce a set of different customized video advertisements based on an advertisement template, in which the at least one placeholder for each customized video advertisement contains a different item from the list, wherein said mixer module is capable of arranging said video advertisement templates and customized video advertisements as respective XML files on a server, said XML files being accessible by a plurality of users using respective browser applications, such that upon updating an XML file representing a video advertisement template or a customized video advertisement, the updated video advertisement template or customized video advertisement is made accessible to users accessing the updated XML file; said system further comprising a Web application for encoding and formatting video advertisements in particular formats. 11. The system of claim 1 , wherein said media products are movies shorter than 10 minutes. | 0.873961 |
9,501,563 | 1 | 2 | 1. A server comprising: at least one memory configured to store computer program code, said computer program code comprising input information storage code, dictionary storage code, association code, and registration code; and at least one processor operable to access said memory, read said computer program code, and to execute said: input information storage code to store a first plurality of input information, each of the first plurality of input information comprising position information indicating a geographic position, a word given to the geographic position, and a user ID identifying a user having given the word to the geographic position, the geographic position, the word, and the user ID being separate from and associated with one another; dictionary storage code to store dictionary data indicating associations between different words given to geographic positions, the dictionary data being generated by automatically associating the different words with each other in response to a combination of the different words being given at a plurality of common positions, and the number of the plurality of common positions being greater than one; association code to extract a second plurality of input information, from among the first plurality of input information, and to automatically associate the extracted second plurality of input information with each other by assigning a common identifier to the extracted second plurality of input information; and registration code to enter the extracted second plurality of input information caused to be associated with each other according to the association code into a result storage, wherein said at least one processor is further operable to execute the association code to extract the second plurality of input information such that the following conditions are satisfied: (i) geographic positions corresponding to the second plurality of input information are included within one predetermined geographic range, and (ii) words corresponding to the second plurality of input information are determined to be associated with each other by using the stored dictionary data. | 1. A server comprising: at least one memory configured to store computer program code, said computer program code comprising input information storage code, dictionary storage code, association code, and registration code; and at least one processor operable to access said memory, read said computer program code, and to execute said: input information storage code to store a first plurality of input information, each of the first plurality of input information comprising position information indicating a geographic position, a word given to the geographic position, and a user ID identifying a user having given the word to the geographic position, the geographic position, the word, and the user ID being separate from and associated with one another; dictionary storage code to store dictionary data indicating associations between different words given to geographic positions, the dictionary data being generated by automatically associating the different words with each other in response to a combination of the different words being given at a plurality of common positions, and the number of the plurality of common positions being greater than one; association code to extract a second plurality of input information, from among the first plurality of input information, and to automatically associate the extracted second plurality of input information with each other by assigning a common identifier to the extracted second plurality of input information; and registration code to enter the extracted second plurality of input information caused to be associated with each other according to the association code into a result storage, wherein said at least one processor is further operable to execute the association code to extract the second plurality of input information such that the following conditions are satisfied: (i) geographic positions corresponding to the second plurality of input information are included within one predetermined geographic range, and (ii) words corresponding to the second plurality of input information are determined to be associated with each other by using the stored dictionary data. 2. The server according to claim 1 , wherein said computer program code further comprises facility storage code; wherein said at least one processor is further operable to execute the facility storage code to store facility information related to facilities in a facility storage, the facility information comprising a facility ID identifying a facility and information indicating a geographic range of the facility, and the predetermined geographic range corresponds to a geographic range indicated by one facility information, and the common identifier comprises a facility ID of the one facility information. | 0.5 |
10,102,298 | 8 | 11 | 8. A system comprising: one or more processor-implemented modules comprising: a plurality of format converters specific to a plurality of respective external document formats and configured to convert a human-readable publication document received in one of the external document formats into a common intermediate mark-up-language format, the document comprising a plurality of visually perceptible document parts and the converting being based on the visually perceptible document parts as reflected in visual clues of the document in the external format; a content parser configured to convert the document from the intermediate mark-up-language format to an internal format by parsing the document in the intermediate mark-up-language format to dissect the document, based on a plurality of document-element types associated with the internal format, into a plurality of document elements collectively constituting the contents of the document, and representing the document in the internal format, in multiple views of the document that differ in at least one of a selection of document elements or an ordering of document elements, by causing a document-element entry for each of the document elements and multiple document-view data structures for respective ones of the multiple views of the document to be stored in one or more databases, each document-element entry comprising a unique document-element identifier and one or more document-element attributes characterizing a content of the respective document element and each document-view data structure comprising an ordered list of document-element identifiers of at least a non-null subset of the document elements. | 8. A system comprising: one or more processor-implemented modules comprising: a plurality of format converters specific to a plurality of respective external document formats and configured to convert a human-readable publication document received in one of the external document formats into a common intermediate mark-up-language format, the document comprising a plurality of visually perceptible document parts and the converting being based on the visually perceptible document parts as reflected in visual clues of the document in the external format; a content parser configured to convert the document from the intermediate mark-up-language format to an internal format by parsing the document in the intermediate mark-up-language format to dissect the document, based on a plurality of document-element types associated with the internal format, into a plurality of document elements collectively constituting the contents of the document, and representing the document in the internal format, in multiple views of the document that differ in at least one of a selection of document elements or an ordering of document elements, by causing a document-element entry for each of the document elements and multiple document-view data structures for respective ones of the multiple views of the document to be stored in one or more databases, each document-element entry comprising a unique document-element identifier and one or more document-element attributes characterizing a content of the respective document element and each document-view data structure comprising an ordered list of document-element identifiers of at least a non-null subset of the document elements. 11. The system of claim 8 , wherein the content parser is further configured to extract metadata from the document when parsing the document, and, upon detection of matching metadata in a database of metadata, associate the one or more views with the detected matching metadata. | 0.655087 |
8,782,050 | 23 | 27 | 23. A method of searching a specialty oriented document database or index created from a master index of a subject matter area by assigning one or more specialties to each document, assigning one or more terms or codes from said master index to each document, assigning a context or potential use for which the a document of said plurality of documents is particularly suited to selected ones of said documents, assembling a database comprising said documents having a selected specialty in accordance with said terms or codes, said method comprising steps of arranging said terms or codes hierarchically or alphanumerically, browsing said terms or codes, and accessing said database in accordance with at least one of said terms or codes and at least one of a said context or use for which the a document of said plurality of documents is particularly suited, an index term selected by browsing said index terms at a hierarchically less refined level to specify a context of another specified index term, and one or more components of respective ones of said documents. | 23. A method of searching a specialty oriented document database or index created from a master index of a subject matter area by assigning one or more specialties to each document, assigning one or more terms or codes from said master index to each document, assigning a context or potential use for which the a document of said plurality of documents is particularly suited to selected ones of said documents, assembling a database comprising said documents having a selected specialty in accordance with said terms or codes, said method comprising steps of arranging said terms or codes hierarchically or alphanumerically, browsing said terms or codes, and accessing said database in accordance with at least one of said terms or codes and at least one of a said context or use for which the a document of said plurality of documents is particularly suited, an index term selected by browsing said index terms at a hierarchically less refined level to specify a context of another specified index term, and one or more components of respective ones of said documents. 27. A method of searching as recited in claim 23 including the further step of browsing a list of index terms appearing at a predetermined level of a hierarchical arrangement of said index terms. | 0.502551 |
8,504,923 | 12 | 13 | 12. The method of claim 1 wherein updating the template further comprises dynamically modifying one or more data elements prior to being rendered. | 12. The method of claim 1 wherein updating the template further comprises dynamically modifying one or more data elements prior to being rendered. 13. The method of claim 12 wherein updating the template further comprises one or more of: truncating a data element string, appending other characters to the data elements, the length of at least one data element of the set of data elements, changing the display characteristics of the elements, and controlling the display of template information to the graphical interface that the renderer cannot render. | 0.5 |
4,818,131 | 1 | 3 | 1. A typewriter having a function of automatically indicating a candidate correct word for a mispelled word, comprising: a keyboard having a multiplicity of keys; an input data memory for storing input data constituting words entered through said keyboard; a printing mechanism operable for printing characters corresponding to said input data entered through said keyboard; a display device operable for displaying said characters in only one line; and a control device connected to said keyboard, said input data memory, said printing mechanism and said display device, for controlling said input data memory, said printing mechanism and said display device, to store, print and display said input data entered through said keyboard; said control device including a dictionary memory for storing data of a multiplicity of words, and spell-checking and correct-word indicating means for sequentially comparing each of the words of said input data with said multiplicity of words stored in said dictionary memory, to check said input data for any misspelled wrong words, and if a wrong word is found in said input data, searching for at least one candidate correct word to be substituted for said found wrong word, from among said words stored in said dictionary memory, displaying said wrong word, and upon locating said candidate correct word displaying said candidate correct word in relation to said found wrong word on said display device, without operator intervention upon location of a candidate correct word. | 1. A typewriter having a function of automatically indicating a candidate correct word for a mispelled word, comprising: a keyboard having a multiplicity of keys; an input data memory for storing input data constituting words entered through said keyboard; a printing mechanism operable for printing characters corresponding to said input data entered through said keyboard; a display device operable for displaying said characters in only one line; and a control device connected to said keyboard, said input data memory, said printing mechanism and said display device, for controlling said input data memory, said printing mechanism and said display device, to store, print and display said input data entered through said keyboard; said control device including a dictionary memory for storing data of a multiplicity of words, and spell-checking and correct-word indicating means for sequentially comparing each of the words of said input data with said multiplicity of words stored in said dictionary memory, to check said input data for any misspelled wrong words, and if a wrong word is found in said input data, searching for at least one candidate correct word to be substituted for said found wrong word, from among said words stored in said dictionary memory, displaying said wrong word, and upon locating said candidate correct word displaying said candidate correct word in relation to said found wrong word on said display device, without operator intervention upon location of a candidate correct word. 3. A typewriter according to claim 1, wherein said spell-checking and correct-word indicating means activates said display device to provide an indication that said at least one candidate correct word is being searched for, while said spell-checking and correct-word indicating means is searching for said at least one candidate correct word. | 0.819239 |
9,424,835 | 1 | 6 | 1. A computer-implemented method comprising: accessing a unit database of acoustic units and, for each acoustic unit, linguistic data corresponding to the acoustic unit; for each acoustic unit: generating an acoustic fingerprint; determining a probability of the linguistic data corresponding to the acoustic unit occurring in a text corpus; and storing data that associates the acoustic unit with (i) the acoustic fingerprint of the acoustic unit and (ii) the probability of the linguistic data corresponding to the acoustic unit occurring in the text corpus; providing at least a portion of the stored data to a finite state transducer training engine that is configured to train one or more finite state transducers that are used in generating speech from text; determining that the unit database of acoustic units has been updated to include one or more new acoustic units that do not have an associated probability of the linguistic data corresponding to the acoustic unit occurring in the text corpus; for each new acoustic unit in the updated unit database: generating an acoustic fingerprint for the new acoustic unit; identifying an acoustic unit that (i) has an acoustic fingerprint that is indicated as similar to the fingerprint of the new acoustic unit, and (ii) has a stored associated probability; and storing data that associates the new acoustic unit with (i) the acoustic fingerprint of the new acoustic unit and (ii) the probability associated with the acoustic unit that has the acoustic fingerprint that is indicated as similar to the fingerprint of the new acoustic unit; and providing at least a portion of the new stored data to the finite state transducer training engine. | 1. A computer-implemented method comprising: accessing a unit database of acoustic units and, for each acoustic unit, linguistic data corresponding to the acoustic unit; for each acoustic unit: generating an acoustic fingerprint; determining a probability of the linguistic data corresponding to the acoustic unit occurring in a text corpus; and storing data that associates the acoustic unit with (i) the acoustic fingerprint of the acoustic unit and (ii) the probability of the linguistic data corresponding to the acoustic unit occurring in the text corpus; providing at least a portion of the stored data to a finite state transducer training engine that is configured to train one or more finite state transducers that are used in generating speech from text; determining that the unit database of acoustic units has been updated to include one or more new acoustic units that do not have an associated probability of the linguistic data corresponding to the acoustic unit occurring in the text corpus; for each new acoustic unit in the updated unit database: generating an acoustic fingerprint for the new acoustic unit; identifying an acoustic unit that (i) has an acoustic fingerprint that is indicated as similar to the fingerprint of the new acoustic unit, and (ii) has a stored associated probability; and storing data that associates the new acoustic unit with (i) the acoustic fingerprint of the new acoustic unit and (ii) the probability associated with the acoustic unit that has the acoustic fingerprint that is indicated as similar to the fingerprint of the new acoustic unit; and providing at least a portion of the new stored data to the finite state transducer training engine. 6. The method of claim 1 , wherein identifying an acoustic unit that has an acoustic fingerprint that is indicated as similar to the fingerprint of the new acoustic unit comprises: calculating a respective similarity measure between the acoustic fingerprints of the new acoustic units and the acoustic fingerprints of each other acoustic unit in the unit database; determining a nearest acoustic fingerprint to the acoustic fingerprint of the new acoustic units according to the similarity measure; and identifying the acoustic unit associated with the nearest acoustic fingerprint. | 0.5 |
7,890,568 | 14 | 15 | 14. The computer-implemented system of claim 10 wherein the base generation structure comprises a chromosome indicating one or more installation states of one or more services on one or more of the devices. | 14. The computer-implemented system of claim 10 wherein the base generation structure comprises a chromosome indicating one or more installation states of one or more services on one or more of the devices. 15. The computer-implemented system of claim 14 wherein the chromosome includes a plurality of ordered indicators indicating the one or more installation states, sorted based on the ordering of services in accordance with the hierarchy of atomic services and composite services. | 0.5 |
7,801,836 | 17 | 18 | 17. The one or more computer-readable media of claim 16 wherein the transforming comprises: applying a genetic algorithm to the set of candidate predictive data mining model templates in light of how well respective models built therefor meet the objective function. | 17. The one or more computer-readable media of claim 16 wherein the transforming comprises: applying a genetic algorithm to the set of candidate predictive data mining model templates in light of how well respective models built therefor meet the objective function. 18. The one or more computer-readable media of claim 17 wherein transforming the set of candidate predictive data mining model templates comprises performing a chromosome crossover function and a chromosome mutation function. | 0.544534 |
7,873,223 | 1 | 4 | 1. A method comprising: in a specification mode: specifying a class network having a class, wherein a membership function defines a likelihood that an object of a data network belongs to the class; specifying a process step having a domain and an algorithm, wherein the domain designates the class, and wherein the process step is part of a process hierarchy; specifying a link type that defines a relation between the class and the object; in an execution mode: acquiring table data values; and executing the class network and the process hierarchy on a computer that implements the data network by generating the object of the data network and by selectively linking selected table data values to the object according to the class network and the process hierarchy. | 1. A method comprising: in a specification mode: specifying a class network having a class, wherein a membership function defines a likelihood that an object of a data network belongs to the class; specifying a process step having a domain and an algorithm, wherein the domain designates the class, and wherein the process step is part of a process hierarchy; specifying a link type that defines a relation between the class and the object; in an execution mode: acquiring table data values; and executing the class network and the process hierarchy on a computer that implements the data network by generating the object of the data network and by selectively linking selected table data values to the object according to the class network and the process hierarchy. 4. The method of claim 1 , wherein the specifying the process step is performed by a user by selecting the process step from a library of predefined process steps. | 0.882395 |
9,213,996 | 14 | 15 | 14. The system of claim 13 , wherein the report includes at least one conversation summary for a portion of the activity relating to the one or more of the new concepts. | 14. The system of claim 13 , wherein the report includes at least one conversation summary for a portion of the activity relating to the one or more of the new concepts. 15. The system of claim 14 , wherein report includes a volume graph for the portion of the activity relating to the one or more of the new concepts. | 0.635468 |
10,049,171 | 11 | 13 | 11. A computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code to, for each of a plurality of log records received from a host machine node as part of a log stream from a software source via the host machine node, perform: identifying a template identifier within a template repository for a template string matching an invariant string of the log record; and identifying an attribute identifier in an attribute repository for an attribute string matching a variant string of the log record; computer readable program code to partition the log records into a plurality of batches, each of the plurality of batches comprising a plurality of log records, each of the plurality of batches defined by a data structure comprising: a batched log record identifier that uniquely identifies the batch relative to the other batches; the template identifier for each of the plurality of log records within the batch; the attribute identifier for each of the plurality of log records within the batch; and a list of timestamps of the plurality of log records within the batch; and computer readable program code to, for each batch of the plurality of batches, store the data structure for the batch into a log repository, the storing comprising: for each batch of the plurality of batches, performing data compression on the data structure for the batch to generate a compressed data structure; and for each batch of the plurality of batches, separately communicating, through a data network to a data server, an instruction to write the compressed data structure for the batch into memory of a log repository. | 11. A computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code to, for each of a plurality of log records received from a host machine node as part of a log stream from a software source via the host machine node, perform: identifying a template identifier within a template repository for a template string matching an invariant string of the log record; and identifying an attribute identifier in an attribute repository for an attribute string matching a variant string of the log record; computer readable program code to partition the log records into a plurality of batches, each of the plurality of batches comprising a plurality of log records, each of the plurality of batches defined by a data structure comprising: a batched log record identifier that uniquely identifies the batch relative to the other batches; the template identifier for each of the plurality of log records within the batch; the attribute identifier for each of the plurality of log records within the batch; and a list of timestamps of the plurality of log records within the batch; and computer readable program code to, for each batch of the plurality of batches, store the data structure for the batch into a log repository, the storing comprising: for each batch of the plurality of batches, performing data compression on the data structure for the batch to generate a compressed data structure; and for each batch of the plurality of batches, separately communicating, through a data network to a data server, an instruction to write the compressed data structure for the batch into memory of a log repository. 13. The computer program product of claim 11 , wherein the computer readable program code to identify a template identifier within the template repository for a template string matching an invariant string of the log record, comprises: computer readable program code to parse content of the log records to generate strings; computer readable program code to compare the strings of the log records to template strings within the template repository; computer readable program code to identify one of the strings of selected ones of the log records as the invariant string of the selected ones of the log records based on at least a threshold number of matches occurring between the one of the strings of the selected ones of the log records to a same one of the template strings within the template repository; and computer readable program code to identify the attribute identifier associated with the one of the template strings. | 0.707731 |
9,203,805 | 27 | 28 | 27. The security appliance of claim 25 wherein the processor is further configured to match the possible matching back-reference with at least one other possible matching back-reference, the possible matching back-reference and the at least one other possible matching back-reference associated with a same capture group. | 27. The security appliance of claim 25 wherein the processor is further configured to match the possible matching back-reference with at least one other possible matching back-reference, the possible matching back-reference and the at least one other possible matching back-reference associated with a same capture group. 28. The security appliance of claim 27 wherein the processor is further configured to determine a non-matching back-reference of the given regular expression pattern in an event the possible matching back-reference does not match with the at least one other possible matching back-reference. | 0.5 |
7,848,573 | 1 | 14 | 1. A method, comprising: receiving electronic ink input; converting the electronic ink input to one or more machine-generated objects; determining a size of the one or more machine-generated objects by calculating an average height of the corresponding electronic ink input and setting the size of the one or more machine-generated objects to be equivalent in scale for the calculated average height; rendering the one or more machine-generated objects using the determined size for the machine-generated object or objects and an original inter-word spacing of the electronic ink input; receiving input selecting an object from the rendered machine-generated object or objects; and displaying the electronic ink input corresponding to the selected object in place of the selected object. | 1. A method, comprising: receiving electronic ink input; converting the electronic ink input to one or more machine-generated objects; determining a size of the one or more machine-generated objects by calculating an average height of the corresponding electronic ink input and setting the size of the one or more machine-generated objects to be equivalent in scale for the calculated average height; rendering the one or more machine-generated objects using the determined size for the machine-generated object or objects and an original inter-word spacing of the electronic ink input; receiving input selecting an object from the rendered machine-generated object or objects; and displaying the electronic ink input corresponding to the selected object in place of the selected object. 14. The method of claim 1 , wherein said electronic ink input is a table, and said inter-word spacing is a corresponding table column-spacing. | 0.78806 |
9,223,473 | 19 | 20 | 19. The method of claim 14 , further comprising highlighting the first item of content in response to the first user input. | 19. The method of claim 14 , further comprising highlighting the first item of content in response to the first user input. 20. The method of claim 19 , wherein the highlighting comprises moving a cursor of the interface to the first item of content. | 0.5 |
8,533,130 | 12 | 13 | 12. A method comprising: generating a plurality of word neurons; generating a plurality of sentence neurons; generating at least one document neuron, wherein the plurality of word neurons, the plurality of sentence neurons, and the at least one document neuron form at least a portion of a neural network; forming, with a processor of a computing device, a plurality of first connections between at least a portion of the plurality of word neurons and the plurality of sentence neurons; forming, with the processor of the computing device, a plurality of second connections between at least a portion of the plurality of word neurons and the at least one document neuron; exciting a first sentence neuron of the plurality of sentence neurons in response to excitation of the at least one document neuron; and changing a position of the plurality of word neurons on a display based on an input, and wherein the change in the position of one word neuron changes annotation corresponding to at least one of the plurality of sentence neurons. | 12. A method comprising: generating a plurality of word neurons; generating a plurality of sentence neurons; generating at least one document neuron, wherein the plurality of word neurons, the plurality of sentence neurons, and the at least one document neuron form at least a portion of a neural network; forming, with a processor of a computing device, a plurality of first connections between at least a portion of the plurality of word neurons and the plurality of sentence neurons; forming, with the processor of the computing device, a plurality of second connections between at least a portion of the plurality of word neurons and the at least one document neuron; exciting a first sentence neuron of the plurality of sentence neurons in response to excitation of the at least one document neuron; and changing a position of the plurality of word neurons on a display based on an input, and wherein the change in the position of one word neuron changes annotation corresponding to at least one of the plurality of sentence neurons. 13. The method of claim 12 , wherein the first sentence neuron represents an annotation of a document. | 0.68125 |
9,411,802 | 1 | 7 | 1. A method of bilingual Semantic Role Labeling (SRL) for use in a machine translation of a first language to a second language, the method comprising: inputting a data file containing a bilingual sentence pair into a computer comprising a processor and a memory, the method further comprising: Step 1: Tokenizing, by the processor, the bilingual sentence pair and finding word-aligned predicate pairs in the bilingual sentence pair; Step 2: For each predicate, using a monolingual SRL method to generate argument candidates by the processor; Step 3: For each predicate, merging its duplicate argument candidates into one by the processor, wherein, argument candidates that have a same location and semantic role label are the duplicate argument candidates, and the duplicate argument candidates are merged into one by retaining the location and semantic role label and averaging probabilities of all the duplicate argument candidates; and Step 4: For each word-aligned predicate pair, performing joint inference by the processor with respect to a merging result obtained by Step 3 to obtain a result data file containing arguments for each word-aligned predicate pair and an alignment between said arguments, the result data file training the machine to translate the first language to the second language. | 1. A method of bilingual Semantic Role Labeling (SRL) for use in a machine translation of a first language to a second language, the method comprising: inputting a data file containing a bilingual sentence pair into a computer comprising a processor and a memory, the method further comprising: Step 1: Tokenizing, by the processor, the bilingual sentence pair and finding word-aligned predicate pairs in the bilingual sentence pair; Step 2: For each predicate, using a monolingual SRL method to generate argument candidates by the processor; Step 3: For each predicate, merging its duplicate argument candidates into one by the processor, wherein, argument candidates that have a same location and semantic role label are the duplicate argument candidates, and the duplicate argument candidates are merged into one by retaining the location and semantic role label and averaging probabilities of all the duplicate argument candidates; and Step 4: For each word-aligned predicate pair, performing joint inference by the processor with respect to a merging result obtained by Step 3 to obtain a result data file containing arguments for each word-aligned predicate pair and an alignment between said arguments, the result data file training the machine to translate the first language to the second language. 7. The method of claim 1 , wherein the performance of the joint inference in step 4 produces an SRL result on a source side and an SRL result on a target side and the joint interference is based on: a correctness of the SRL result on the source side, a correctness of the SRL result on the target side, and an argument structure consistency between the SRL results on the source side and the target side. | 0.5 |
5,488,725 | 26 | 27 | 26. The system according to claim 25 further including threshold setting means responsive to the processing means for setting a probability threshold equal to the probability of a first identified document. | 26. The system according to claim 25 further including threshold setting means responsive to the processing means for setting a probability threshold equal to the probability of a first identified document. 27. The system according to claim 26 including determining means operable during each respective iteration and responsive to the identification of the preselected number of documents by the processing means to determine if an additional document of the respective sample has a probability grater than the probability threshold, the processing means being responsive to the determining means identifying an additional document having a probability greater than the probability threshold to replace the previously-identified document having the lowest probability with the additional document, and the threshold setting means is responsive to the processing means to reset the probability threshold to the probability of the identified document having the new lowest probability. | 0.5 |
9,679,077 | 7 | 9 | 7. A non-transitory computer-readable medium having computer program instructions stored thereon, wherein the computer program instructions are executable by at least one computer processor to perform a method, the method comprising: (A) determining that a trigger condition defined by a trigger condition definition of a workflow definition has been satisfied; (B) in response to the determination in (A): (B)(1) using a process defined by a data extraction process definition associated with the workflow definition to extract, from at least one data source, data defined by a data definition associated with the workflow definition; (B)(2) storing the extracted data in an evidence sheet; and (B)(3) applying, to the extracted data, steps defined by a workflow process definition associated with the workflow definition to generate first workflow output. | 7. A non-transitory computer-readable medium having computer program instructions stored thereon, wherein the computer program instructions are executable by at least one computer processor to perform a method, the method comprising: (A) determining that a trigger condition defined by a trigger condition definition of a workflow definition has been satisfied; (B) in response to the determination in (A): (B)(1) using a process defined by a data extraction process definition associated with the workflow definition to extract, from at least one data source, data defined by a data definition associated with the workflow definition; (B)(2) storing the extracted data in an evidence sheet; and (B)(3) applying, to the extracted data, steps defined by a workflow process definition associated with the workflow definition to generate first workflow output. 9. The non-transitory computer-readable medium of claim 7 , wherein the at least one data source comprises at least one unstructured data source. | 0.828199 |
8,572,572 | 17 | 22 | 17. A computer-implemented process for dynamically identifying bugs as a programmer creates a source code in a text editor, the process comprising: storing a plurality of patterns in a first database, each pattern representing a programming error; storing a plurality of corrections in a second database, each correction representing a code that corrects a corresponding programming error; dynamically evaluating the source code as the programmer creates the source code by periodically comparing the source code with the plurality of patterns, and responsive to matching a segment of the source code with one of said patterns; providing at least one correction to the programmer and prompting the programmer to select the at least one correction; and responsive to the programmer selecting the at least one correction, causing the text editor to change the source code to conform to the correction. | 17. A computer-implemented process for dynamically identifying bugs as a programmer creates a source code in a text editor, the process comprising: storing a plurality of patterns in a first database, each pattern representing a programming error; storing a plurality of corrections in a second database, each correction representing a code that corrects a corresponding programming error; dynamically evaluating the source code as the programmer creates the source code by periodically comparing the source code with the plurality of patterns, and responsive to matching a segment of the source code with one of said patterns; providing at least one correction to the programmer and prompting the programmer to select the at least one correction; and responsive to the programmer selecting the at least one correction, causing the text editor to change the source code to conform to the correction. 22. The computer-implemented process of claim 17 , in which said correction comprises at least one of: replacement text for at least a portion of said source code and additional text for said source code. | 0.544643 |
7,529,753 | 37 | 38 | 37. The computer accessible storage hardware of claim 28 , wherein the instructions are further operable, at a query-language layer above the decoding layer at the first network location, to receive query-language statements extracted at the decoding layer and, before the application receives the query-language statements, normalize the query-language statements for processing at the application. | 37. The computer accessible storage hardware of claim 28 , wherein the instructions are further operable, at a query-language layer above the decoding layer at the first network location, to receive query-language statements extracted at the decoding layer and, before the application receives the query-language statements, normalize the query-language statements for processing at the application. 38. The computer accessible storage hardware of claim 37 , wherein normalizing a query-language statement comprises one or more of: capitalizing all letters in the query-language statement; reordering terms in the query-language statement according to a predetermined order; and modifying one or more clauses in the query-language statement according to a predetermined clause equivalency. | 0.5 |
7,787,205 | 19 | 20 | 19. The method of claim 17 , and further comprising: adjusting a write clock frequency for a first portion of a bit patterned media based in part upon the error in the first code word. | 19. The method of claim 17 , and further comprising: adjusting a write clock frequency for a first portion of a bit patterned media based in part upon the error in the first code word. 20. The method of claim 19 and further comprising: receiving a second code word from the data storage device; detecting an error in the second code word; and adjusting a write clock frequency for a second portion of a bit patterned media based in part upon the error in the second code word. | 0.5 |
4,389,706 | 31 | 33 | 31. An industrial system or the like comprising: apparatus for implementing system operations; sensor means associated with the apparatus for generating signals indicative of the state of the system; a digital computer system having a memory; signal scanning means associated with said computer system and connecting to said sensor means for scanning said sensor signals periodically and including means for transferring a digital record of the status of the signals into the memory of said digital computer system; at least one machine readable signal-related event definition defining as an event a change in the state of at least one sensor signal which definition includes a designation which serves both as a name for the defined event and as a name for the signal; at least one machine readable job definition including at least one triggering reference to a designation which serves as a name for an event and for a signal and which is at least one event definition; loader means for operating said computer system to accept said event and job definitions and to store said definitions in said memory; trigger-connect means for operating said computer system to link job definitions but only those containing trigger references to designations, to locations in said memory that are in turn linked to the event definition and status data for the designated signals; and means for operating said computer system to respond to the occurrence of a signal-related event by initiating execution of any and all job definitions which are linked to the status data and definition corresponding to that event. | 31. An industrial system or the like comprising: apparatus for implementing system operations; sensor means associated with the apparatus for generating signals indicative of the state of the system; a digital computer system having a memory; signal scanning means associated with said computer system and connecting to said sensor means for scanning said sensor signals periodically and including means for transferring a digital record of the status of the signals into the memory of said digital computer system; at least one machine readable signal-related event definition defining as an event a change in the state of at least one sensor signal which definition includes a designation which serves both as a name for the defined event and as a name for the signal; at least one machine readable job definition including at least one triggering reference to a designation which serves as a name for an event and for a signal and which is at least one event definition; loader means for operating said computer system to accept said event and job definitions and to store said definitions in said memory; trigger-connect means for operating said computer system to link job definitions but only those containing trigger references to designations, to locations in said memory that are in turn linked to the event definition and status data for the designated signals; and means for operating said computer system to respond to the occurrence of a signal-related event by initiating execution of any and all job definitions which are linked to the status data and definition corresponding to that event. 33. A system in accordance with claim 31 wherein, and wherein for variables a change in the state of which are defined as events a separate table is maintained within said memory of linkages from the status data of such variables to any definitions the execution of which that event is to trigger. | 0.635135 |
8,103,677 | 15 | 24 | 15. A system for searching, comprising: a processor; and a memory coupled with the processor, wherein the memory is configured to provide the processor with instructions which when executed cause the processor to: identify one or more matching objects matching one or more terms of a search request in a search index; execute one or more return path methods associated with each of the one or more matching objects; wherein each of the one or more return path methods traverses an object tree and returns a parent object, wherein the parent object is added to a list of search result parent objects, wherein the data associated with the parent object is stored along with modification dates, wherein the search request further comprises an evaluation date; and wherein the parent object is stored with one or more effective dates, wherein each effective date comprises a past, present or future date; and wherein an effective state of the parent object is determined at the evaluation date by comparing the evaluation date to one or more of the effective dates; rank the list of search result parent objects according to a ranking function; and provide the ranked list of search result parent objects. | 15. A system for searching, comprising: a processor; and a memory coupled with the processor, wherein the memory is configured to provide the processor with instructions which when executed cause the processor to: identify one or more matching objects matching one or more terms of a search request in a search index; execute one or more return path methods associated with each of the one or more matching objects; wherein each of the one or more return path methods traverses an object tree and returns a parent object, wherein the parent object is added to a list of search result parent objects, wherein the data associated with the parent object is stored along with modification dates, wherein the search request further comprises an evaluation date; and wherein the parent object is stored with one or more effective dates, wherein each effective date comprises a past, present or future date; and wherein an effective state of the parent object is determined at the evaluation date by comparing the evaluation date to one or more of the effective dates; rank the list of search result parent objects according to a ranking function; and provide the ranked list of search result parent objects. 24. A system as in claim 15 , wherein a security policy is enforced while the one or more return path methods traverses the object tree. | 0.833333 |
7,848,917 | 8 | 9 | 8. A computer storage medium having computer-executable instructions that when executed by a computer perform steps to process input received by the computer comprising the steps of: receiving input using a first modality; modifying a word graph based on the input; and rendering a hypothesis to a user for the input based on the word graph, and repeating the following steps until a desired hypothesis is obtained: modifying the word graph based on complementary information received using a second modality, the complementary information corresponding to at least a portion of the input, wherein the second modality is different from the first modality, in which modifying the word graph includes rescoring the word graph based on averaging posterior probabilities from the modalities of the input and the complementary information; and rendering a new hypothesis to the user for the input based on the word graph. | 8. A computer storage medium having computer-executable instructions that when executed by a computer perform steps to process input received by the computer comprising the steps of: receiving input using a first modality; modifying a word graph based on the input; and rendering a hypothesis to a user for the input based on the word graph, and repeating the following steps until a desired hypothesis is obtained: modifying the word graph based on complementary information received using a second modality, the complementary information corresponding to at least a portion of the input, wherein the second modality is different from the first modality, in which modifying the word graph includes rescoring the word graph based on averaging posterior probabilities from the modalities of the input and the complementary information; and rendering a new hypothesis to the user for the input based on the word graph. 9. The computer-readable medium of claim 8 wherein the step of modifying the word graph includes pruning a word graph. | 0.777358 |
9,411,972 | 1 | 7 | 1. A method for creating a shared secret for use in communicating confidential information, the method comprising: receiving, via a member user interface, a group identification, user id, and user passcode; generating, by a n-bit generator using the group identification, the user id, and the user passcode as inputs, a first m-bit result, the first m-bit result including a file name and encryption key; generating, by the n-bit generator using a group-agreed seed as input, a second m bit result, the second m-bit result including a shared secret; encrypting said shared secret using said encryption key to produce an encrypted shared secret, wherein encrypting the shared secret comprises selecting the encryption algorithm from among a plurality of encryption algorithms according to an encryption algorithm identifier according to information extracted from the first m-bit result; assigning the file name to the encrypted shared secret; and storing the encrypted shared secret in a secrets directory under the assigned file name. | 1. A method for creating a shared secret for use in communicating confidential information, the method comprising: receiving, via a member user interface, a group identification, user id, and user passcode; generating, by a n-bit generator using the group identification, the user id, and the user passcode as inputs, a first m-bit result, the first m-bit result including a file name and encryption key; generating, by the n-bit generator using a group-agreed seed as input, a second m bit result, the second m-bit result including a shared secret; encrypting said shared secret using said encryption key to produce an encrypted shared secret, wherein encrypting the shared secret comprises selecting the encryption algorithm from among a plurality of encryption algorithms according to an encryption algorithm identifier according to information extracted from the first m-bit result; assigning the file name to the encrypted shared secret; and storing the encrypted shared secret in a secrets directory under the assigned file name. 7. The method of claim 1 , further comprising notifying, via the user interface, a user of a communication from a member of a group. | 0.777027 |
8,024,185 | 11 | 12 | 11. A computer program product for displaying text derived from speech for a user of a surface computer, the surface computer comprising a surface, surface computer capable of receiving multi-touch input through the surface and rendering display output on the surface, the computer program product disposed in a recordable computer readable medium, the computer program product comprising computer program instructions capable of: registering, by the surface computer, a plurality of users with the surface computer, including selecting a speech engine configuration for each registered user in dependence upon a user profile for that registered user; allocating, by the surface computer to each registered user, a portion of the surface for interaction between that registered user and the surface computer; detecting, by the surface computer, a speech utterance from one of the plurality of users; determining, by the surface computer using a speech engine, speech text in dependence upon the speech utterance, including determining the speech text using the speech engine configuration for at least one of the registered users; creating, by the surface computer, display text in dependence upon the speech text; and rendering, by the surface computer, the display text on at least one of the allocated portions of the surface. | 11. A computer program product for displaying text derived from speech for a user of a surface computer, the surface computer comprising a surface, surface computer capable of receiving multi-touch input through the surface and rendering display output on the surface, the computer program product disposed in a recordable computer readable medium, the computer program product comprising computer program instructions capable of: registering, by the surface computer, a plurality of users with the surface computer, including selecting a speech engine configuration for each registered user in dependence upon a user profile for that registered user; allocating, by the surface computer to each registered user, a portion of the surface for interaction between that registered user and the surface computer; detecting, by the surface computer, a speech utterance from one of the plurality of users; determining, by the surface computer using a speech engine, speech text in dependence upon the speech utterance, including determining the speech text using the speech engine configuration for at least one of the registered users; creating, by the surface computer, display text in dependence upon the speech text; and rendering, by the surface computer, the display text on at least one of the allocated portions of the surface. 12. The computer program product of claim 11 wherein: the computer program product further comprises computer program instructions capable of determining, by the surface computer, to which particular user of the plurality of users the speech utterance is directed; and rendering, by the surface computer, the display text on at least one of the allocated portions of the surface further comprises rendering the display text in the portion of the surface allocated to the particular user to which the speech utterance is directed. | 0.522563 |
6,026,388 | 10 | 13 | 10. A method of operating a computerized information retrieval system where information is retrieved from a database containing documents in response to user queries, the method comprising: receiving a natural language query specifying information to be retrieved; processing the query to abstract the query to an alternative representation suitable for input to a database of documents, each document of which is abstracted to a corresponding alterative representation; displaying query information to the user indicating the result of said step of processing the query, the query information including a number of items characterizing the query including a subset of a finite set of subjects, the subset corresponding to subjects interpreted by the system to characterize the subject contents of the query; entering a mode that permits user modification of the items of query information; remaining in the mode pending user input that specifies exiting the mode, user input that specifies exiting the mode including a request to execute the query; while in the mode, receiving user modifications, if any, of the items of query information; and in response to a request to execute the query, executing the query, modified in accordance with any user modifications of the items of query information, against the database. | 10. A method of operating a computerized information retrieval system where information is retrieved from a database containing documents in response to user queries, the method comprising: receiving a natural language query specifying information to be retrieved; processing the query to abstract the query to an alternative representation suitable for input to a database of documents, each document of which is abstracted to a corresponding alterative representation; displaying query information to the user indicating the result of said step of processing the query, the query information including a number of items characterizing the query including a subset of a finite set of subjects, the subset corresponding to subjects interpreted by the system to characterize the subject contents of the query; entering a mode that permits user modification of the items of query information; remaining in the mode pending user input that specifies exiting the mode, user input that specifies exiting the mode including a request to execute the query; while in the mode, receiving user modifications, if any, of the items of query information; and in response to a request to execute the query, executing the query, modified in accordance with any user modifications of the items of query information, against the database. 13. The method of claim 10 wherein: the query includes a particular term; and the query information includes a plurality of variations representing an expansion of the particular term. | 0.665455 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.