patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
1
|
|---|---|---|---|---|---|
7,844,603 | 14 | 15 | 14. A method performed by one or more server devices, the method comprising: providing, by a processor associated with the one or more server devices, an interface configured to facilitate composition of text by a first user; receiving, by one of the one or more server devices, a search query from the first user; initiating, by a processor associated with the one or more server devices, a search based on the search query; receiving, by a processor associated with the one or more server devices, results of the search; modifying, by a processor associated with the one or more server devices and in response to receiving the results of the search, a relevance order of the results of the search based on a type of a content creation application implemented by the interface; providing, by one of the one or more server devices, the results of the search in the interface using the modified relevance order, the provided results of the search each including a selection object; receiving, by one of the one or more server devices, a selection of one or more of the selection objects from the first user; incorporating, by a processor associated with the one or more server devices and in response to receiving the selection, the results of the search, that correspond to the one or more of the selection objects, into the text in the interface; providing, by one of the one or more server devices, the text and the incorporated results of the search to a second user; receiving, by one of the one or more server devices, a request to access one of the incorporated results from the second user; analyzing, by a processor associated with the one or server devices and in response to receiving the request, the request to access the one of the incorporated results from the second user; and adjusting, by a processor associated with the one or more server devices, a reputation score of the first user based on the analyzed request from the second user. | 14. A method performed by one or more server devices, the method comprising: providing, by a processor associated with the one or more server devices, an interface configured to facilitate composition of text by a first user; receiving, by one of the one or more server devices, a search query from the first user; initiating, by a processor associated with the one or more server devices, a search based on the search query; receiving, by a processor associated with the one or more server devices, results of the search; modifying, by a processor associated with the one or more server devices and in response to receiving the results of the search, a relevance order of the results of the search based on a type of a content creation application implemented by the interface; providing, by one of the one or more server devices, the results of the search in the interface using the modified relevance order, the provided results of the search each including a selection object; receiving, by one of the one or more server devices, a selection of one or more of the selection objects from the first user; incorporating, by a processor associated with the one or more server devices and in response to receiving the selection, the results of the search, that correspond to the one or more of the selection objects, into the text in the interface; providing, by one of the one or more server devices, the text and the incorporated results of the search to a second user; receiving, by one of the one or more server devices, a request to access one of the incorporated results from the second user; analyzing, by a processor associated with the one or server devices and in response to receiving the request, the request to access the one of the incorporated results from the second user; and adjusting, by a processor associated with the one or more server devices, a reputation score of the first user based on the analyzed request from the second user. 15. The method of claim 14 , where automatically modifying a relevance order of the results of the search includes modifying the relevance order of the results of the search based on information relating to the first user. | 0.504464 |
8,914,044 | 10 | 17 | 10. An apparatus comprising: at least one processor; and at least one memory including computer program code for one or more programs, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following, determining scores associated with one or more contextual categories for a defined geographic region, the scores indicating a level of affinity between points-of-interest located within the defined geographic region and the one or more contextual categories; identifying an anomaly in a score associated with at least one of the one or more contextual categories based on information related to the points-of-interest; generating an updated score to associate with the at least one contextual category based on an analysis of verification information related to the defined geographical region and on a normalization of the scores and the score with the anomaly by reduction with a normalization factor corresponding to a total number of the points-of-interest; and associating the updated score with the at least one contextual category, wherein the level of affinity is based on a density, a concentration, a rate of occurrence, or a combination thereof, of the points-of-interest associated with the one or more contextual categories, for the defined geographic region. | 10. An apparatus comprising: at least one processor; and at least one memory including computer program code for one or more programs, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to perform at least the following, determining scores associated with one or more contextual categories for a defined geographic region, the scores indicating a level of affinity between points-of-interest located within the defined geographic region and the one or more contextual categories; identifying an anomaly in a score associated with at least one of the one or more contextual categories based on information related to the points-of-interest; generating an updated score to associate with the at least one contextual category based on an analysis of verification information related to the defined geographical region and on a normalization of the scores and the score with the anomaly by reduction with a normalization factor corresponding to a total number of the points-of-interest; and associating the updated score with the at least one contextual category, wherein the level of affinity is based on a density, a concentration, a rate of occurrence, or a combination thereof, of the points-of-interest associated with the one or more contextual categories, for the defined geographic region. 17. An apparatus of claim 10 , wherein the defined geographic region is based on a national grid system. | 0.873786 |
7,698,342 | 1 | 8 | 1. A method for completing a form, comprising: storing data associated with a plurality of forms into a data structure comprising a plurality of nodes corresponding to a plurality of fields in the plurality of forms; receiving a search term from a user and obtaining a related word based on the search term to generate a search criteria; searching, using a processor of a computer, the plurality of forms by comparing the search criteria to each of the plurality of nodes in the data structure to generate a match; identifying, using the processor of the computer, a field within the form of the plurality of forms based on the match and the data structure; and presenting the field within the form to the user for completing the form. | 1. A method for completing a form, comprising: storing data associated with a plurality of forms into a data structure comprising a plurality of nodes corresponding to a plurality of fields in the plurality of forms; receiving a search term from a user and obtaining a related word based on the search term to generate a search criteria; searching, using a processor of a computer, the plurality of forms by comparing the search criteria to each of the plurality of nodes in the data structure to generate a match; identifying, using the processor of the computer, a field within the form of the plurality of forms based on the match and the data structure; and presenting the field within the form to the user for completing the form. 8. The method of claim 1 , wherein presenting the field within the form comprises displaying the field in an editable format. | 0.891115 |
8,601,023 | 1 | 8 | 1. A computer implemented method performed by a processor, comprising: observing usage patterns by one or more users in an on-line community in connection with an on-line asset; identifying usefulness of the on-line asset by observing user implicit behaviors in connection with the usage patterns of the on-line asset and by extracting behavioral patterns from the user implicit behaviors; refining the identified on-line asset usefulness by context, wherein a context of the on-line asset is automatically detected based on one or more observed terms obtained by observing user implicit behaviors with respect to the identified on-line asset, wherein the identified on-line asset has a plurality of term vectors; assigning a term vector entry of a term vector of the plurality of term vectors that describes a degree to which the identified on-line asset has an affinity with the observed terms, wherein each term vector of the plurality of term vectors is associated with a different user of the one or more users; identifying for each user of the one or more users an expertise vector by identifying on-line assets with respect to which the each user has engaged in one or more of the user implicit behaviors; and generating the expertise vector by summing the plurality of term vectors for the identified on-line assets; receive query including query terms; obtaining search result documents; determining that at least one search result document is an identified on-line asset for an expert user of the one or more users; and ranking the at least one search result based on a relationship of the query terms to the expertise vector of the expert user. | 1. A computer implemented method performed by a processor, comprising: observing usage patterns by one or more users in an on-line community in connection with an on-line asset; identifying usefulness of the on-line asset by observing user implicit behaviors in connection with the usage patterns of the on-line asset and by extracting behavioral patterns from the user implicit behaviors; refining the identified on-line asset usefulness by context, wherein a context of the on-line asset is automatically detected based on one or more observed terms obtained by observing user implicit behaviors with respect to the identified on-line asset, wherein the identified on-line asset has a plurality of term vectors; assigning a term vector entry of a term vector of the plurality of term vectors that describes a degree to which the identified on-line asset has an affinity with the observed terms, wherein each term vector of the plurality of term vectors is associated with a different user of the one or more users; identifying for each user of the one or more users an expertise vector by identifying on-line assets with respect to which the each user has engaged in one or more of the user implicit behaviors; and generating the expertise vector by summing the plurality of term vectors for the identified on-line assets; receive query including query terms; obtaining search result documents; determining that at least one search result document is an identified on-line asset for an expert user of the one or more users; and ranking the at least one search result based on a relationship of the query terms to the expertise vector of the expert user. 8. The computer implemented method of claim 1 , wherein observing usage patterns further comprises observing user dwell time, the user dwell time having a range that is selected as a matter of choice, depending on the complexity of an asset that is being inspected. | 0.774276 |
8,572,174 | 20 | 21 | 20. The computer program product of claim 16 , wherein the received requested information includes a prompt for the user to establish a session with the social networking system. | 20. The computer program product of claim 16 , wherein the received requested information includes a prompt for the user to establish a session with the social networking system. 21. The computer program product of claim 20 , further comprising instructions that, when executed by the processor, cause the user device to: provide an indication the user has established the session with the social networking system responsive to receiving an interaction with the prompt for the user to establish the session with the social networking system; receive modified information from the social networking system, wherein the received modified information was determined by the social networking system based on social information associated with the user; render the web page including content based on the received modified information within the web page; and display the rendered web page including the content based on the received modified information. | 0.787912 |
9,208,248 | 1 | 6 | 1. A method, comprising: identifying, via a processor, relative to a specified social network user for each of a plurality of social media postings, a degree of social network separation of a social network user that generated expressive content of the respective social media posting; grouping social media postings that comprise an equivalent identified degree of social network separation relative to the specified social network user; determining differences between the expressive content of the grouped social media postings at different degrees of social network separation; and rendering the determined differences between the expressive content of the grouped social media postings at the different degrees of social network separation. | 1. A method, comprising: identifying, via a processor, relative to a specified social network user for each of a plurality of social media postings, a degree of social network separation of a social network user that generated expressive content of the respective social media posting; grouping social media postings that comprise an equivalent identified degree of social network separation relative to the specified social network user; determining differences between the expressive content of the grouped social media postings at different degrees of social network separation; and rendering the determined differences between the expressive content of the grouped social media postings at the different degrees of social network separation. 6. The method of claim 1 , where determining the differences between the expressive content of the grouped social media postings at the different degrees of social network separation comprises: analyzing text of the expressive content of the social media postings within each group of social media postings; categorizing the expressive content based upon a frequency of similar expressive content within each group of social media postings; and identifying a highest-frequency expressive content within each group of social media postings as a predominant expressive content of social network users in each group of social media postings. | 0.500782 |
8,515,890 | 1 | 7 | 1. A method for determining a Z-valuation, said method comprising: inputting one or more rules into a rules engine, wherein said rules engine is run by a processor device; receiving one or more fact information by said rules engine; setting up one or more protoforms in a first memory location or unit; establishing one or more first relationships related to said one or more protoforms; extracting a first attribute from said one or more first relationships; filtering possible reciprocal relationships from a first database, wherein said possible reciprocal relationships are selected based on said first attribute; determining a first reciprocal relationship based on said filtering step; determining a first consequential attribute based on said first attribute; determining one or more synonym attributes based on said first attribute, wherein said one or more synonym attributes reside on a second memory location or unit; instantiating a first supplemental relationship based on said one or more synonym attributes, said first reciprocal relationship, or said first consequential attribute; expanding one or more additional relationships by matching a first set of attributes to a first set of general rules from a knowledge base, stored on a second database; determining a first Z-valuation as a value of an attribute for a first node; wherein said first node is associated to a second node via one or more second relationships; wherein a member of said one or more second relationships belongs to one of following: said one or more first relationships, said first supplemental relationship, said one or more additional relationships, or said first reciprocal relationship. | 1. A method for determining a Z-valuation, said method comprising: inputting one or more rules into a rules engine, wherein said rules engine is run by a processor device; receiving one or more fact information by said rules engine; setting up one or more protoforms in a first memory location or unit; establishing one or more first relationships related to said one or more protoforms; extracting a first attribute from said one or more first relationships; filtering possible reciprocal relationships from a first database, wherein said possible reciprocal relationships are selected based on said first attribute; determining a first reciprocal relationship based on said filtering step; determining a first consequential attribute based on said first attribute; determining one or more synonym attributes based on said first attribute, wherein said one or more synonym attributes reside on a second memory location or unit; instantiating a first supplemental relationship based on said one or more synonym attributes, said first reciprocal relationship, or said first consequential attribute; expanding one or more additional relationships by matching a first set of attributes to a first set of general rules from a knowledge base, stored on a second database; determining a first Z-valuation as a value of an attribute for a first node; wherein said first node is associated to a second node via one or more second relationships; wherein a member of said one or more second relationships belongs to one of following: said one or more first relationships, said first supplemental relationship, said one or more additional relationships, or said first reciprocal relationship. 7. The method for determining a Z-valuation as recited in claim 1 , said method comprising: searching for an identity of an object. | 0.528777 |
7,818,293 | 10 | 16 | 10. A computer-readable storage medium containing a program that, when executed, performs an operation comprising: synchronizing a first version of a document stored in a content management system with a second version of the document contained on a collaborative site, upon detecting at least one modification to the second version of the document, comprising: monitoring the second version of the document contained on the collaborative site using a dedicated listener process that has a predefined association to the second version of the document, and that monitors for changes to the second version of the document and does not monitor other documents on the collaborative site; detecting the at least one modification to the second version of the document using the dedicated listener process, wherein the second version of the document on the collaborative site is editable by a plurality of users of the collaborative site, and wherein the at least one modification is received from a first user of the plurality of users of the collaborative site; and upon detecting the at least one modification to the second version of the document on the collaborative site, updating the first version of the document stored in the content management repository, based on the at least one modification to the second version of the document, and using credentials of an authorized user of the content management repository, wherein the authorized user of the content management repository is different from the first user of the collaborative site. | 10. A computer-readable storage medium containing a program that, when executed, performs an operation comprising: synchronizing a first version of a document stored in a content management system with a second version of the document contained on a collaborative site, upon detecting at least one modification to the second version of the document, comprising: monitoring the second version of the document contained on the collaborative site using a dedicated listener process that has a predefined association to the second version of the document, and that monitors for changes to the second version of the document and does not monitor other documents on the collaborative site; detecting the at least one modification to the second version of the document using the dedicated listener process, wherein the second version of the document on the collaborative site is editable by a plurality of users of the collaborative site, and wherein the at least one modification is received from a first user of the plurality of users of the collaborative site; and upon detecting the at least one modification to the second version of the document on the collaborative site, updating the first version of the document stored in the content management repository, based on the at least one modification to the second version of the document, and using credentials of an authorized user of the content management repository, wherein the authorized user of the content management repository is different from the first user of the collaborative site. 16. The computer-readable storage medium of claim 10 , wherein the at least one modification to the second version of the document on the collaborative site comprises a change to an attachment associated with the second version of the document. | 0.69727 |
9,436,438 | 1 | 13 | 1. A non-transitory computer-accessible memory medium that stores program instructions executable by a computer system to perform: providing a graphical program development environment comprising a graphical specification and constraint language that allows specification of a model of computation and explicit declaration of constraints; and creating a graphical program in the graphical specification and constraint language in response to user input, wherein the graphical program comprises: a specified model of computation; a plurality of interconnected functional blocks that visually indicate functionality of the graphical program in accordance with the specified model of computation; and graphically indicated specifications or constraints for at least one of the functional blocks in the graphical program; wherein the specifications or constraints comprise: initiation interval (II), comprising a minimum number of cycles between firings of the at least one functional block; input pattern (IP), comprising a sequence of Boolean values of length at most II, wherein the sequence of Boolean values aligns with the beginning of firing of the at least one functional block, wherein each true value in the sequence denotes consumption of a token at an input terminal of the at least one functional block; and output pattern (OP), comprising a sequence of Boolean values of length at most II, wherein the sequence of Boolean values aligns with the end of firing of the at least one functional block, wherein each true value in the sequence denotes production of a token at an output terminal of the at least one functional block; and automatically generating an output program based on the graphical program, wherein the output program implements the functionality of the graphical program in accordance with the specified model of computation, and further implements the specifications or constraints; wherein the output program is useable to configure a programmable hardware element to perform the functionality subject to the specifications or constraints. | 1. A non-transitory computer-accessible memory medium that stores program instructions executable by a computer system to perform: providing a graphical program development environment comprising a graphical specification and constraint language that allows specification of a model of computation and explicit declaration of constraints; and creating a graphical program in the graphical specification and constraint language in response to user input, wherein the graphical program comprises: a specified model of computation; a plurality of interconnected functional blocks that visually indicate functionality of the graphical program in accordance with the specified model of computation; and graphically indicated specifications or constraints for at least one of the functional blocks in the graphical program; wherein the specifications or constraints comprise: initiation interval (II), comprising a minimum number of cycles between firings of the at least one functional block; input pattern (IP), comprising a sequence of Boolean values of length at most II, wherein the sequence of Boolean values aligns with the beginning of firing of the at least one functional block, wherein each true value in the sequence denotes consumption of a token at an input terminal of the at least one functional block; and output pattern (OP), comprising a sequence of Boolean values of length at most II, wherein the sequence of Boolean values aligns with the end of firing of the at least one functional block, wherein each true value in the sequence denotes production of a token at an output terminal of the at least one functional block; and automatically generating an output program based on the graphical program, wherein the output program implements the functionality of the graphical program in accordance with the specified model of computation, and further implements the specifications or constraints; wherein the output program is useable to configure a programmable hardware element to perform the functionality subject to the specifications or constraints. 13. The non-transitory computer-accessible memory medium of claim 1 , wherein the specifications or constraints further comprise an execution time (ET) that specifies a number of cycles needed by the at least one functional block to complete firing and a flag denoting whether the execution time is exact or worst case. | 0.72735 |
5,486,112 | 1 | 3 | 1. An autonomous wearable computing device comprising: a first glove having fingers and a second glove having fingers, said first glove being adapted to fit the left hand of a user, said first glove having a first portion on a palm side and a second portion on a back side, said second glove being adapted to fit the right hand of said user, said second glove having a third portion on a palm side and a fourth portion on a back side, said first glove having a first set of indicia mounted on said first portion thereof and a second set of indicia mounted on said second portion thereof, said second glove having a third set of indicia mounted on said third portion thereof, and a fourth set of indicia mounted on said fourth portion thereof; first keys mounted within the first portion of said first glove in association with each indicium of said first set of indicia, said first keys corresponding to the keys of a keyboard of arbitrary format and content to be struck by the fingers of the left hand, said first keys having indicia mounted thereon, said indicia mounted on said first keys identifying the letters, numbers, or symbols associated to said first keys; second keys mounted within the third portion of said second glove in association with each indicium of said third set of indicia, said second keys corresponding to the keys of said keyboard to be struck by the fingers of the right hand, said second keys having indicia mounted thereon, said indicia mounted on said second keys identifying the letters, numbers, or symbols associated to said second keys; the positions of said first set of indicia and said second set of indicia being mirror images of each other, said second set of indicia thereby corresponding to said first keys of said first glove, and providing said user with a representation of said first keys; the positions of said third set of indicia and said fourth set of indicia being mirror images of each other, said fourth set of indicia thereby corresponding to said second keys of said second glove, and providing said user with a representation of said second keys; a first microprocessor connected to said first keys of said first glove with a first set of interconnections, said first set of interconnections being embedded within said first glove; a second microprocessor connected to said second keys of said second glove with a second set of interconnections, said second set of interconnections being embedded within said second glove; said first microprocessor having the functionality of a conventional keyboard microprocessor for the keys of said first glove to be struck by the fingers of the left hand, said second glove microprocessor having the functionality of a conventional keyboard microprocessor for the keys of said second glove to be struck by the fingers of the right hand; said first microprocessor monitoring the flow of data input through the keys of said first glove, said second microprocessor monitoring the flow of data input through the keys of said second glove; a first set of external input/output ports mounted within said first glove, a second set of external input/output ports mounted within said second glove; said first and second sets of ports allowing said gloves to be interfaced with any processing unit that can be interfaced with a conventional keyboard; first means for enabling said gloves to transmit and receive information to and from any data processing unit that can be interfaced with said gloves, and allowing said user to easily interpret the information that is transmitted or received; second means for providing said gloves with autonomous computing capabilities. | 1. An autonomous wearable computing device comprising: a first glove having fingers and a second glove having fingers, said first glove being adapted to fit the left hand of a user, said first glove having a first portion on a palm side and a second portion on a back side, said second glove being adapted to fit the right hand of said user, said second glove having a third portion on a palm side and a fourth portion on a back side, said first glove having a first set of indicia mounted on said first portion thereof and a second set of indicia mounted on said second portion thereof, said second glove having a third set of indicia mounted on said third portion thereof, and a fourth set of indicia mounted on said fourth portion thereof; first keys mounted within the first portion of said first glove in association with each indicium of said first set of indicia, said first keys corresponding to the keys of a keyboard of arbitrary format and content to be struck by the fingers of the left hand, said first keys having indicia mounted thereon, said indicia mounted on said first keys identifying the letters, numbers, or symbols associated to said first keys; second keys mounted within the third portion of said second glove in association with each indicium of said third set of indicia, said second keys corresponding to the keys of said keyboard to be struck by the fingers of the right hand, said second keys having indicia mounted thereon, said indicia mounted on said second keys identifying the letters, numbers, or symbols associated to said second keys; the positions of said first set of indicia and said second set of indicia being mirror images of each other, said second set of indicia thereby corresponding to said first keys of said first glove, and providing said user with a representation of said first keys; the positions of said third set of indicia and said fourth set of indicia being mirror images of each other, said fourth set of indicia thereby corresponding to said second keys of said second glove, and providing said user with a representation of said second keys; a first microprocessor connected to said first keys of said first glove with a first set of interconnections, said first set of interconnections being embedded within said first glove; a second microprocessor connected to said second keys of said second glove with a second set of interconnections, said second set of interconnections being embedded within said second glove; said first microprocessor having the functionality of a conventional keyboard microprocessor for the keys of said first glove to be struck by the fingers of the left hand, said second glove microprocessor having the functionality of a conventional keyboard microprocessor for the keys of said second glove to be struck by the fingers of the right hand; said first microprocessor monitoring the flow of data input through the keys of said first glove, said second microprocessor monitoring the flow of data input through the keys of said second glove; a first set of external input/output ports mounted within said first glove, a second set of external input/output ports mounted within said second glove; said first and second sets of ports allowing said gloves to be interfaced with any processing unit that can be interfaced with a conventional keyboard; first means for enabling said gloves to transmit and receive information to and from any data processing unit that can be interfaced with said gloves, and allowing said user to easily interpret the information that is transmitted or received; second means for providing said gloves with autonomous computing capabilities. 3. The autonomous wearable computing device as claimed in claim 1 wherein said first means comprise: a first interface connecting a first internal data processing unit to a first screen-based mini output display, and a second interface connecting a second internal data processing unit to a second screen-based mini output display; screens of said displays being mounted on said gloves, and foldable for the convenience of said user, and for protection purposes; said connections between said mini output displays and said data processing units mounted within said gloves providing said user with fully autonomous input/processing/output sequences. | 0.767575 |
8,707,153 | 1 | 4 | 1. A method implemented by a digital home communication terminal (DHCT) comprising: presenting by the DHCT for display a video presentation; enabling a viewer to select an option to receive a plurality of sequential data supplements comprising on-screen comments of the video presentation, the sequential data supplements having a plurality of respective active time intervals of presentation and a screen position relative to the video presentation, wherein the active time intervals are determined based on an internal clock and a timer located on the DHCT; receiving a first input from the viewer regarding selection of the option to receive the plurality of sequential data supplements; responsive to receiving the first input corresponding to selecting the option to receive the plurality of sequential data supplements, providing the plurality of sequential data supplements for presentation at the plurality of respective active times corresponding to respective portions of the video presentation, the plurality of sequential data supplements are active only during the active time intervals at the screen position; receiving a second input from the viewer; and providing a video screen in response to the second input, wherein the video screen comprises a first reduced video area for the video presentation, a second reduced area for displaying information related to the video presentation, and a third reduced area for displaying control options for the video presentation, the control options comprising an option to stop the receipt of sequential data supplements. | 1. A method implemented by a digital home communication terminal (DHCT) comprising: presenting by the DHCT for display a video presentation; enabling a viewer to select an option to receive a plurality of sequential data supplements comprising on-screen comments of the video presentation, the sequential data supplements having a plurality of respective active time intervals of presentation and a screen position relative to the video presentation, wherein the active time intervals are determined based on an internal clock and a timer located on the DHCT; receiving a first input from the viewer regarding selection of the option to receive the plurality of sequential data supplements; responsive to receiving the first input corresponding to selecting the option to receive the plurality of sequential data supplements, providing the plurality of sequential data supplements for presentation at the plurality of respective active times corresponding to respective portions of the video presentation, the plurality of sequential data supplements are active only during the active time intervals at the screen position; receiving a second input from the viewer; and providing a video screen in response to the second input, wherein the video screen comprises a first reduced video area for the video presentation, a second reduced area for displaying information related to the video presentation, and a third reduced area for displaying control options for the video presentation, the control options comprising an option to stop the receipt of sequential data supplements. 4. The method of claim 1 , wherein the video presentation comprises a video-on-demand (VOD) presentation. | 0.925 |
7,743,082 | 1 | 17 | 1. A computer system comprising: at least one processor for executing computer-executable instructions; and at least one computer-readable storage medium storing computer-executable instructions, which when executed by the at least one processor, cause the computing system to perform steps, comprising: receiving a document for storing in association with a selected document library file system folder, the selected document library file system folder is associated with a selected document library from among a plurality of document libraries, each document library among the plurality of document libraries comprising a document library database, a document library file system folder, and documents included within the document library file system folder, wherein each document library of the plurality of document libraries has a corresponding set of properties that apply to the type of documents that are associated with that document library; associating the set of properties corresponding to the selected document library with the document such that the document is associated with a consistent set of properties applied to all documents stored in association with the selected document library, and such that each document in the selected document library has the consistent set of properties that make such documents specific to only the selected document library; writing property value information for at least some of the properties in the set to the document library database of the selected document library that includes an entry for the document to relate the property value information to the document; and storing the document in the selected document library file system folder of the selected document library, such that the document and all other document stored in the selected document library file system folder have consistent properties making such documents specific to the selected document library in which the documents are all stored. | 1. A computer system comprising: at least one processor for executing computer-executable instructions; and at least one computer-readable storage medium storing computer-executable instructions, which when executed by the at least one processor, cause the computing system to perform steps, comprising: receiving a document for storing in association with a selected document library file system folder, the selected document library file system folder is associated with a selected document library from among a plurality of document libraries, each document library among the plurality of document libraries comprising a document library database, a document library file system folder, and documents included within the document library file system folder, wherein each document library of the plurality of document libraries has a corresponding set of properties that apply to the type of documents that are associated with that document library; associating the set of properties corresponding to the selected document library with the document such that the document is associated with a consistent set of properties applied to all documents stored in association with the selected document library, and such that each document in the selected document library has the consistent set of properties that make such documents specific to only the selected document library; writing property value information for at least some of the properties in the set to the document library database of the selected document library that includes an entry for the document to relate the property value information to the document; and storing the document in the selected document library file system folder of the selected document library, such that the document and all other document stored in the selected document library file system folder have consistent properties making such documents specific to the selected document library in which the documents are all stored. 17. The computer system of claim 1 having further comprising computer-executable instructions that cause the computing system to write at least some of the properties in the set to the document in addition to the document library database. | 0.699749 |
9,318,103 | 1 | 3 | 1. An automatic speech recognition system for recognizing a user voice command in a noisy environment, comprising: matching means for matching elements retrieved from speech units forming the command with templates stored in a template library; processing means for determining a sequence of templates that minimizes a distance between the elements and the templates, wherein the templates are posterior templates, the elements retrieved from the speech units are posterior vectors, and the posterior templates and the posterior vectors are generated with a MultiLayer Perceptron; calculating means for automatically selecting a subset of the posterior templates, the selection of the subset of the posterior templates including: (i) determining Gabriel or relative neighbors of the selected subset of the posterior templates by calculating a matrix of distances between all of the posterior templates, (ii) visiting each template of the subset of posterior templates, (iii) marking a template of the subset of the posterior templates if all of its neighbours are of a same phone class as the template; and (iv) deleting all marked posterior templates, wherein the remaining posterior templates constitute the selected subset of the posterior templates; and a dynamic time warping (DTW) decoder for matching the posterior vectors with the selected subset of posterior templates, wherein the DTW decoder receives input, the input comprising a sequence of posterior vectors to be recognized, a posterior template library, a dictionary and optionally a grammar, and the DTW decoder outputs one or more sequences of recognized words, time information and confidence measures. | 1. An automatic speech recognition system for recognizing a user voice command in a noisy environment, comprising: matching means for matching elements retrieved from speech units forming the command with templates stored in a template library; processing means for determining a sequence of templates that minimizes a distance between the elements and the templates, wherein the templates are posterior templates, the elements retrieved from the speech units are posterior vectors, and the posterior templates and the posterior vectors are generated with a MultiLayer Perceptron; calculating means for automatically selecting a subset of the posterior templates, the selection of the subset of the posterior templates including: (i) determining Gabriel or relative neighbors of the selected subset of the posterior templates by calculating a matrix of distances between all of the posterior templates, (ii) visiting each template of the subset of posterior templates, (iii) marking a template of the subset of the posterior templates if all of its neighbours are of a same phone class as the template; and (iv) deleting all marked posterior templates, wherein the remaining posterior templates constitute the selected subset of the posterior templates; and a dynamic time warping (DTW) decoder for matching the posterior vectors with the selected subset of posterior templates, wherein the DTW decoder receives input, the input comprising a sequence of posterior vectors to be recognized, a posterior template library, a dictionary and optionally a grammar, and the DTW decoder outputs one or more sequences of recognized words, time information and confidence measures. 3. The system of claim 1 , wherein the MultiLayer Perceptron is multilingual. | 0.920455 |
8,862,255 | 9 | 17 | 9. A computer implemented method comprising: under control of one or more computing devices, generating audio content based at least in part on textual content; causing output of the generated audio content; causing presentation of the textual content; maintaining synchronization between an output pointer of textual content being presented and an associated position of the generated audio content being output, wherein the associated position of the generated audio content advances during output of the generated audio content, and wherein the output pointer indicates a position within the textual content corresponding to a current output position of the generated audio content; obtaining an input pointer referencing a location within the textual content being presented from an input device; during advancement of the output pointer, determining, independent of the obtained input pointer, a position of the output pointer corresponding to the current output position of the generated audio content; determining a segment of textual content based at least in part on a difference between the determined position of the output pointer and the location within the textual content referenced by the input pointer; determining a length of time required to output audio content corresponding to the determined segment of textual content; and modifying an attribute associated with the output of the generated audio content based at least in part on the determined length of time. | 9. A computer implemented method comprising: under control of one or more computing devices, generating audio content based at least in part on textual content; causing output of the generated audio content; causing presentation of the textual content; maintaining synchronization between an output pointer of textual content being presented and an associated position of the generated audio content being output, wherein the associated position of the generated audio content advances during output of the generated audio content, and wherein the output pointer indicates a position within the textual content corresponding to a current output position of the generated audio content; obtaining an input pointer referencing a location within the textual content being presented from an input device; during advancement of the output pointer, determining, independent of the obtained input pointer, a position of the output pointer corresponding to the current output position of the generated audio content; determining a segment of textual content based at least in part on a difference between the determined position of the output pointer and the location within the textual content referenced by the input pointer; determining a length of time required to output audio content corresponding to the determined segment of textual content; and modifying an attribute associated with the output of the generated audio content based at least in part on the determined length of time. 17. The computer-implemented method of claim 9 further comprising: generating synchronization information based at least in part on the synchronization between the output pointer of the textual content and the associated position of the generated audio content; and storing the synchronization information. | 0.813187 |
7,716,263 | 6 | 7 | 6. The method of claim 5 , further comprising: wherein said sending said on-line status of said first user from said server system to client systems associated with other users in said group includes filtering said list of documents currently opened by said first user to remove identifiers of documents to which specific ones of said other users in said group do not have access. | 6. The method of claim 5 , further comprising: wherein said sending said on-line status of said first user from said server system to client systems associated with other users in said group includes filtering said list of documents currently opened by said first user to remove identifiers of documents to which specific ones of said other users in said group do not have access. 7. The method of claim 6 , further comprising: wherein said indications of whether said corresponding ones of said shared documents are currently opened by one or more users in said group further enable a local user to request display of lists of said one or more users in said group that are currently accessing corresponding ones of said shared documents. | 0.946396 |
8,880,529 | 1 | 7 | 1. A method, comprising: maintaining, at a server, a set of tags that have been approved for use in associating tags with content; receiving, at the server, a particular tag associated with a particular item of multimedia content, the particular tag among a plurality of tags from a plurality of users, the plurality of tags associated with particular items of multimedia content; determining, by the server, that the particular tag is not in the set of tags; submitting, by the server, the particular tag to an automated approval process; upon a determination by the automated approval process that the particular tag has not been approved for adding to the set of tags, the server discarding the particular tag; and upon a determination by the automated approval process that the particular tag has been approved for adding to the set of tags, the server updating the set of tags to include the particular tag; providing the set of tags to devices for use in user interfaces for selecting tags; wherein the method is performed by one or more computing devices. | 1. A method, comprising: maintaining, at a server, a set of tags that have been approved for use in associating tags with content; receiving, at the server, a particular tag associated with a particular item of multimedia content, the particular tag among a plurality of tags from a plurality of users, the plurality of tags associated with particular items of multimedia content; determining, by the server, that the particular tag is not in the set of tags; submitting, by the server, the particular tag to an automated approval process; upon a determination by the automated approval process that the particular tag has not been approved for adding to the set of tags, the server discarding the particular tag; and upon a determination by the automated approval process that the particular tag has been approved for adding to the set of tags, the server updating the set of tags to include the particular tag; providing the set of tags to devices for use in user interfaces for selecting tags; wherein the method is performed by one or more computing devices. 7. The method of claim 1 , further comprising: receiving ratings from users indicating a quality of associations between tags in the plurality of tags and associated items of multimedia content; calculating quality scores for the associations based at least upon the ratings from the users; removing the association of the particular tag and the particular item of multimedia content if a quality score calculated for the association is below a specified threshold. | 0.816496 |
9,245,278 | 1 | 2 | 1. A method comprising: performing by one or more computer processors: obtaining an original text message in a first language authored by a first user: obtaining an initial translation of the original text message in a second language; obtaining a translation correction of the initial translation, wherein the translation correction is authored by a second user; calculating at least one metric associated with the translation correction, the at least one metric being based on a comparison of a word-based feature of the original text and the translation correction, wherein calculating the at least one metric comprises determining a difference in a number of words, characters, emojis, numbers, or punctuation marks between the original text and the translation correction; and determining an accuracy of the translation correction based on the at least one metric. | 1. A method comprising: performing by one or more computer processors: obtaining an original text message in a first language authored by a first user: obtaining an initial translation of the original text message in a second language; obtaining a translation correction of the initial translation, wherein the translation correction is authored by a second user; calculating at least one metric associated with the translation correction, the at least one metric being based on a comparison of a word-based feature of the original text and the translation correction, wherein calculating the at least one metric comprises determining a difference in a number of words, characters, emojis, numbers, or punctuation marks between the original text and the translation correction; and determining an accuracy of the translation correction based on the at least one metric. 2. The method of claim 1 , further comprising updating a confidence score for the second user based on the accuracy of the translation correction, the confidence score representing a likelihood that the second user will provide an accurate translation of a text message at a later time. | 0.832749 |
8,920,470 | 11 | 12 | 11. The system of claim 1 , further comprising a second bone anchor having a bone-engaging portion and a spinal fixation element receiving portion configured to receive a spinal fixation element therein, the second bone anchor being configured to be mated to the second end of the connecting member. | 11. The system of claim 1 , further comprising a second bone anchor having a bone-engaging portion and a spinal fixation element receiving portion configured to receive a spinal fixation element therein, the second bone anchor being configured to be mated to the second end of the connecting member. 12. The system of claim 11 , wherein a distal surface of the first end of the connecting member bears against a proximal terminal end surface of each of the opposed arms of the spinal fixation element receiving portion of the first bone anchor, and a distal surface of the second end of the connecting member bears against a proximal terminal end surface of each of the opposed arms of the spinal fixation element receiving portion of the second bone anchor. | 0.828078 |
9,704,069 | 1 | 7 | 1. An image processing method for classifying each of a plurality of regions in an image to one of a plurality of predefined classes using classification confidences, the method comprising: a confidence generation step for generating, for each of a plurality of regions of the image, a set of classification confidences, each classification confidence corresponding to one of a plurality of predefined classes and representing the probability of the respective region belonging to the predefined class; and a classification step for classifying the regions in the image wherein for each of the regions for which an obvious match with one of the predefined classes exists based on the classification confidences associated with the region, classifying the region to the respective predefined class based on the classification confidences associated with the region, the method further comprising: a fuzzy region extraction step for extracting and designating as fuzzy regions one or more regions of the plurality of regions, which do not have an obvious match with one of the plurality of predefined classes based on their set of associated classification confidences; and a confidence update step for updating the classification confidence for each such fuzzy region based on the sets of classification confidences associated with adjacent regions thereof, wherein the classification step further classifies the fuzzy regions to respective predefined classes based on the updated classification confidences. | 1. An image processing method for classifying each of a plurality of regions in an image to one of a plurality of predefined classes using classification confidences, the method comprising: a confidence generation step for generating, for each of a plurality of regions of the image, a set of classification confidences, each classification confidence corresponding to one of a plurality of predefined classes and representing the probability of the respective region belonging to the predefined class; and a classification step for classifying the regions in the image wherein for each of the regions for which an obvious match with one of the predefined classes exists based on the classification confidences associated with the region, classifying the region to the respective predefined class based on the classification confidences associated with the region, the method further comprising: a fuzzy region extraction step for extracting and designating as fuzzy regions one or more regions of the plurality of regions, which do not have an obvious match with one of the plurality of predefined classes based on their set of associated classification confidences; and a confidence update step for updating the classification confidence for each such fuzzy region based on the sets of classification confidences associated with adjacent regions thereof, wherein the classification step further classifies the fuzzy regions to respective predefined classes based on the updated classification confidences. 7. The image processing method according to claim 1 , wherein the confidence update step comprises: an adjacent map establishment step for obtaining information about the neighborhood of each fuzzy region; a weighted confidence calculating step for accumulating the classification confidences associated with each fuzzy region and the adjacent regions thereof in weighting; and a confidence normalization step for normalizing the accumulated classification confidence of each fuzzy region as the updated classification confidence. | 0.590417 |
7,877,251 | 10 | 11 | 10. A computer-readable medium storing computer-executable instructions that, when executed, cause a computer system to perform a method for improving document translations, the method comprising: providing to a server an identification of a document and a preferred natural language; and receiving from the server the document in the identified preferred natural language wherein the document in the identified preferred natural language contains a user-supplied modification to a translated word wherein the user-supplied modification was supplied to correct a prior translation, the user-supplied modification having been selected from multiple user-supplied modifications based at least on comparing a number of times the user-supplied modifications have been modified by users other than a user who initially provided the modification. | 10. A computer-readable medium storing computer-executable instructions that, when executed, cause a computer system to perform a method for improving document translations, the method comprising: providing to a server an identification of a document and a preferred natural language; and receiving from the server the document in the identified preferred natural language wherein the document in the identified preferred natural language contains a user-supplied modification to a translated word wherein the user-supplied modification was supplied to correct a prior translation, the user-supplied modification having been selected from multiple user-supplied modifications based at least on comparing a number of times the user-supplied modifications have been modified by users other than a user who initially provided the modification. 11. The computer-readable medium of claim 10 wherein the method further comprises: receiving from the server the document in an original natural language; displaying in a first region the document in the original natural language; displaying in a second region the document in the identified preferred natural language; receiving a selection of a sequence of words in one of the regions; and identifying a corresponding set of words in the other of the regions. | 0.829259 |
9,959,657 | 20 | 21 | 20. A method of adapting a system for rendering a computer generated face to a new expression, the method comprising: receiving text data related to speech, which is to be output by movement of the mouth; dividing the text data into a sequence of acoustic units including one of at least phonemes, graphemes, and words or parts of words; analyzing the text data related to the speech to identify expression-dependent weightings related to a speech expression and a corresponding facial expression, to be input into a statistical model; converting the sequence of acoustic units into a sequence of image vectors and a sequence of speech vectors using the statistical model, wherein the model has a plurality of model parameters comprising mathematical means of probability distributions, which relate an acoustic unit in the sequence of acoustic units to an image vector in the sequence of image vectors and to a speech vector in the sequence of speech vectors, the image vector including a plurality of parameters that define the face; outputting the sequence of image vectors and the sequence of speech vectors, wherein the sequence of image vectors are output as video such that the mouth moves to mime the speech expression associated with the corresponding facial expression, and wherein the sequence of speech vectors are output as audio, which is synchronized with lip movement of the mouth and is associated with the speech expression, wherein the mathematical means of each probability distribution of the probability distributions for the speech expression and the corresponding facial expression are expressed as a weighted sum of independent mathematical means, wherein weightings used in the weighted sum are the identified expression-dependent weightings, wherein the independent mathematical means are provided in clusters, and wherein here is one expression-dependent weighting per cluster, receiving a video file associated with the new expression; and calculating the identified expression-dependent weightings to weigh parameters of a same type in order to maximize a similarity between the computer generated face and the new expression. | 20. A method of adapting a system for rendering a computer generated face to a new expression, the method comprising: receiving text data related to speech, which is to be output by movement of the mouth; dividing the text data into a sequence of acoustic units including one of at least phonemes, graphemes, and words or parts of words; analyzing the text data related to the speech to identify expression-dependent weightings related to a speech expression and a corresponding facial expression, to be input into a statistical model; converting the sequence of acoustic units into a sequence of image vectors and a sequence of speech vectors using the statistical model, wherein the model has a plurality of model parameters comprising mathematical means of probability distributions, which relate an acoustic unit in the sequence of acoustic units to an image vector in the sequence of image vectors and to a speech vector in the sequence of speech vectors, the image vector including a plurality of parameters that define the face; outputting the sequence of image vectors and the sequence of speech vectors, wherein the sequence of image vectors are output as video such that the mouth moves to mime the speech expression associated with the corresponding facial expression, and wherein the sequence of speech vectors are output as audio, which is synchronized with lip movement of the mouth and is associated with the speech expression, wherein the mathematical means of each probability distribution of the probability distributions for the speech expression and the corresponding facial expression are expressed as a weighted sum of independent mathematical means, wherein weightings used in the weighted sum are the identified expression-dependent weightings, wherein the independent mathematical means are provided in clusters, and wherein here is one expression-dependent weighting per cluster, receiving a video file associated with the new expression; and calculating the identified expression-dependent weightings to weigh parameters of a same type in order to maximize a similarity between the computer generated face and the new expression. 21. The method according to claim 20 , further comprising: creating at least one new cluster using data from the received video file; and calculating the identified expression-dependent weightings applied to the clusters including the at least one new cluster to maximize the similarity between the computer generated face and the new expression. | 0.501441 |
4,539,653 | 43 | 44 | 43. A computerized composer comprising input means for supplying a sequence of unformatted text/graphics signals with embedded control words which indicate desired composition parameters and composing functions to be performed by a computerized composer, computer means coupled to the input means for receiving said sequence of text/graphics signals and embedded control words for responding to said embedded control words to compose a document based upon the sequence of said text/graphics signals for generating a second sequence of text/graphics signals which are arranged with pagination indications of logical page extents and other composed-page indicating signals for enabling a visual presentation device to present information represented by such text/graphics signals, output means coupled to the computer means for receiving said composed text/graphics signals for visually presenting the composed document; said computer means having storage means and program indicia for constituting a composing page formatter for enabling the computer means to respond to said received unformatted text/graphics signals in accordance with said embedded control words as follows; first indicia in said computer means for enabling the computer means to receive said unformatted text/graphics signals and analyze said embedded control words; second indicia in said computer means for enabling the computer means to couple to said first indicia and to format said unformatted received text/graphics signals in sequence as received including paginating pages in accordance with assignment of text/graphics signals that fill page extents; third indicia in said computer means for enabling the computer means to respond to named area embedded control words received via said first indicia enablement of the computer means to divert named area indicated ones of the received unformatted text/graphics signals for storage separate from said page formatted text/graphics signals but formatted by said first indicia enablement of the computer means; and fourth indicia in said computer means for enabling the computer means to respond to said received text/graphics signals and to the embedded control words for selectively placing said diverted text/graphics signals to a said logical page independently of where in the unformatted received text/graphics signals such diverted text/graphics signals were received. | 43. A computerized composer comprising input means for supplying a sequence of unformatted text/graphics signals with embedded control words which indicate desired composition parameters and composing functions to be performed by a computerized composer, computer means coupled to the input means for receiving said sequence of text/graphics signals and embedded control words for responding to said embedded control words to compose a document based upon the sequence of said text/graphics signals for generating a second sequence of text/graphics signals which are arranged with pagination indications of logical page extents and other composed-page indicating signals for enabling a visual presentation device to present information represented by such text/graphics signals, output means coupled to the computer means for receiving said composed text/graphics signals for visually presenting the composed document; said computer means having storage means and program indicia for constituting a composing page formatter for enabling the computer means to respond to said received unformatted text/graphics signals in accordance with said embedded control words as follows; first indicia in said computer means for enabling the computer means to receive said unformatted text/graphics signals and analyze said embedded control words; second indicia in said computer means for enabling the computer means to couple to said first indicia and to format said unformatted received text/graphics signals in sequence as received including paginating pages in accordance with assignment of text/graphics signals that fill page extents; third indicia in said computer means for enabling the computer means to respond to named area embedded control words received via said first indicia enablement of the computer means to divert named area indicated ones of the received unformatted text/graphics signals for storage separate from said page formatted text/graphics signals but formatted by said first indicia enablement of the computer means; and fourth indicia in said computer means for enabling the computer means to respond to said received text/graphics signals and to the embedded control words for selectively placing said diverted text/graphics signals to a said logical page independently of where in the unformatted received text/graphics signals such diverted text/graphics signals were received. 44. The computerized composer set forth in claim 43 wherein said fourth indicia further includes additional fourth indicia for enabling the computer means to select predetermined ones of said text/graphics signals from said separate storage for insertion onto respective predetermined ones of said pages independently of said sequential formatting via said second indicia enablement such predetermined portions of that said diverted text/graphics signals from a single one of said named areas are disposed on a plurality of said logical pages. | 0.691827 |
8,407,042 | 12 | 14 | 12. The cross-language system of claim 1 , wherein the user interface allows a user to submit a question in the first language and have it uploaded to the system and translated by the machine translation into at least the second language for posting on at least one community question answering website using the second language, the cross-language system returning to the user at least some of the answers to the translated question that are posted by users of the community question answering website on which the translated user question is posted. | 12. The cross-language system of claim 1 , wherein the user interface allows a user to submit a question in the first language and have it uploaded to the system and translated by the machine translation into at least the second language for posting on at least one community question answering website using the second language, the cross-language system returning to the user at least some of the answers to the translated question that are posted by users of the community question answering website on which the translated user question is posted. 14. The cross-language system of claim 12 , wherein the machine translation system translates at least some of the posted answers prior to the cross-language system returning them to the user. | 0.906977 |
8,959,104 | 1 | 3 | 1. One or more computer-storage media having computer-executable instructions embodied thereon that, when executed, perform a method for presenting query suggestions based upon content items, the method comprising: receiving a web page having a plurality of content items associated therewith, the plurality of content items being received in response to a request for information; displaying the plurality of content items; determining that one or more user-driven conditions are met, the one or more user-driven conditions being met based on detecting one or more user actions associated with the received web page or the displayed plurality of content items; determining, by a computing device having a processor and a memory, at least one query suggestion based upon fewer than all of the plurality of content items associated with the web page, wherein the query suggestion is selectable to cause a search query that is based on the query suggestion to be executed, the fewer than all of the plurality of content items being selected based on the one or more user-driven conditions; and presenting, responsive to determining the one or more user-driven conditions are met, the determined at least one query suggestion in a content item-based query suggestion display area while displaying the plurality of content, wherein the presentation indicates that the at least one query suggestion is relevant to at least one of, but not all of, the displayed plurality of content items, the content item-based query suggestion display area is statically-located relative to the web page, and the at least one query suggestion presented in the content item-based query suggestion display area is dynamically selected in response to user action. | 1. One or more computer-storage media having computer-executable instructions embodied thereon that, when executed, perform a method for presenting query suggestions based upon content items, the method comprising: receiving a web page having a plurality of content items associated therewith, the plurality of content items being received in response to a request for information; displaying the plurality of content items; determining that one or more user-driven conditions are met, the one or more user-driven conditions being met based on detecting one or more user actions associated with the received web page or the displayed plurality of content items; determining, by a computing device having a processor and a memory, at least one query suggestion based upon fewer than all of the plurality of content items associated with the web page, wherein the query suggestion is selectable to cause a search query that is based on the query suggestion to be executed, the fewer than all of the plurality of content items being selected based on the one or more user-driven conditions; and presenting, responsive to determining the one or more user-driven conditions are met, the determined at least one query suggestion in a content item-based query suggestion display area while displaying the plurality of content, wherein the presentation indicates that the at least one query suggestion is relevant to at least one of, but not all of, the displayed plurality of content items, the content item-based query suggestion display area is statically-located relative to the web page, and the at least one query suggestion presented in the content item-based query suggestion display area is dynamically selected in response to user action. 3. The one or more computer-storage media of claim 1 , wherein the request for information is a received search query, and wherein, in response to the received search query, the method further comprises presenting the web page having the plurality of content items associated therewith. | 0.823239 |
9,679,556 | 16 | 17 | 16. The method of claim 15 , wherein step (a) further comprises the step of using the current maximum likelihood acoustic model on the entire training data with a Hidden Markov Model-Gaussian Mixture Model. | 16. The method of claim 15 , wherein step (a) further comprises the step of using the current maximum likelihood acoustic model on the entire training data with a Hidden Markov Model-Gaussian Mixture Model. 17. The method of claim 16 , wherein said training data may consist of phonemes and triphones wherein: a) a triphone's Hidden Markov Model states may be mapped to tied-states; b) each feature frame may have a tied state class label; and c) said tied states may comprise unique classes between which the discrimination in an acoustic feature space is increased through selectively biased linear discriminant analysis. | 0.878505 |
10,032,071 | 1 | 7 | 1. A method, comprising: receiving, in an overlay handwriting application, one or more handwriting strokes; processing the one or more handwriting strokes to obtain a plurality of handwriting recognition results; automatically generating at least one candidate word for each of the plurality of handwriting recognition results, one of the at least one candidate words comprising at least one letter that is different from a recognized letter of the corresponding handwriting recognition result; determining, using a processor and based on the generating, that there is a common candidate word from the candidate words for the plurality of handwriting recognition results; and providing, on a display device, the common candidate word. | 1. A method, comprising: receiving, in an overlay handwriting application, one or more handwriting strokes; processing the one or more handwriting strokes to obtain a plurality of handwriting recognition results; automatically generating at least one candidate word for each of the plurality of handwriting recognition results, one of the at least one candidate words comprising at least one letter that is different from a recognized letter of the corresponding handwriting recognition result; determining, using a processor and based on the generating, that there is a common candidate word from the candidate words for the plurality of handwriting recognition results; and providing, on a display device, the common candidate word. 7. The method of claim 1 , further comprising ranking the list comprising at least one candidate word prior to the providing. | 0.859234 |
8,392,421 | 9 | 13 | 9. A non-transitory computer readable medium, embodying instructions executable by a computer to perform method steps for profiling an Internet endpoint associated with an Internet Protocol (IP) prefix, the instructions, when executed, comprising functionality for: generating a profiling rule using an Internet search engine; obtaining a search result by inputting the IP prefix to the Internet search engine; and classifying the Internet endpoint based on the search result using the profiling rule, wherein the profiling rule comprises a IP tag and a key phrase list having a phrase associated with a URL class, the URL class being associated with the IP tag, wherein the profiling rule further comprises a data structure having an entry, the entry having a first domain name associated with the phrase, wherein the data structure is a cache having a plurality of indexes corresponding to a plurality of values, the plurality of indexes comprising the first domain name, the plurality of values comprising the phrase, wherein the search result comprises: a Uniform Resource Locator (URL) having a second domain name; and a hit text associated with the URL, the hit text comprising a phrase in the key phrase list, wherein classifying the Internet endpoint comprises: assigning the URL class to the URL and assigning the IP tag to the Internet end point if the first domain name is the same as the second domain name, wherein generating the profiling rule comprises: adding an index comprising the second domain name to the cache if the plurality of indexes do not comprise the second domain name; setting a counter to an initial count; obtaining another search result by inputting another Internet endpoint domain name to the Internet search engine, the another search result comprising another hit text associated with another URL; the another hit text comprising another phrase in the key phrase list; incrementing the counter if the another URL comprises the second domain name; and setting a value in the cache corresponding to the index based on at least one selected from the group consisting of the phrase and the another phrase if the counter exceeds a pre-determined threshold. | 9. A non-transitory computer readable medium, embodying instructions executable by a computer to perform method steps for profiling an Internet endpoint associated with an Internet Protocol (IP) prefix, the instructions, when executed, comprising functionality for: generating a profiling rule using an Internet search engine; obtaining a search result by inputting the IP prefix to the Internet search engine; and classifying the Internet endpoint based on the search result using the profiling rule, wherein the profiling rule comprises a IP tag and a key phrase list having a phrase associated with a URL class, the URL class being associated with the IP tag, wherein the profiling rule further comprises a data structure having an entry, the entry having a first domain name associated with the phrase, wherein the data structure is a cache having a plurality of indexes corresponding to a plurality of values, the plurality of indexes comprising the first domain name, the plurality of values comprising the phrase, wherein the search result comprises: a Uniform Resource Locator (URL) having a second domain name; and a hit text associated with the URL, the hit text comprising a phrase in the key phrase list, wherein classifying the Internet endpoint comprises: assigning the URL class to the URL and assigning the IP tag to the Internet end point if the first domain name is the same as the second domain name, wherein generating the profiling rule comprises: adding an index comprising the second domain name to the cache if the plurality of indexes do not comprise the second domain name; setting a counter to an initial count; obtaining another search result by inputting another Internet endpoint domain name to the Internet search engine, the another search result comprising another hit text associated with another URL; the another hit text comprising another phrase in the key phrase list; incrementing the counter if the another URL comprises the second domain name; and setting a value in the cache corresponding to the index based on at least one selected from the group consisting of the phrase and the another phrase if the counter exceeds a pre-determined threshold. 13. The non-transitory computer readable medium of claim 9 , wherein the instructions, when executed, further comprise functionality for: assigning the URL class to the URL and assigning the IP tag to the Internet end point if the URL domain name comprises the phrase. | 0.912073 |
8,516,001 | 4 | 5 | 4. The computing system of claim 3 , where a context item further includes, for each context consumer subscribing to the context item, subscription parameters indicating which alterations to context-describing values are to trigger a callback method. | 4. The computing system of claim 3 , where a context item further includes, for each context consumer subscribing to the context item, subscription parameters indicating which alterations to context-describing values are to trigger a callback method. 5. The computing system of claim 4 , where a context item further includes, for each subscription parameter, identification of the callback method to be triggered. | 0.94779 |
8,155,877 | 1 | 9 | 1. A system that facilitates describing a location with reference to one or more landmarks, comprising: a conversion component that receives a request for a target location and converts the request to a corresponding spatial coordinate; a selection module that chooses a landmark from a plurality of landmarks based at least in part on a user familiarity, the user familiarity being determined by comparing information from a user profile database and information from a landmark database; an analyzer component that evaluates the spatial coordinate and provides a description that contains the landmark; and a rendering component that communicates the description in response to the received request. | 1. A system that facilitates describing a location with reference to one or more landmarks, comprising: a conversion component that receives a request for a target location and converts the request to a corresponding spatial coordinate; a selection module that chooses a landmark from a plurality of landmarks based at least in part on a user familiarity, the user familiarity being determined by comparing information from a user profile database and information from a landmark database; an analyzer component that evaluates the spatial coordinate and provides a description that contains the landmark; and a rendering component that communicates the description in response to the received request. 9. The system of claim 1 , wherein the information contained in the user profile database is obtained from a manual input by the user in response to a query. | 0.756211 |
8,224,642 | 14 | 15 | 14. A computer program product comprising a computer readable storage medium encoded with program code usable to control operation of a computer system, the program code including: program code for computing, for each language in a plurality of candidate languages, a document score for a test document using a language model associated with that language; program code for selecting a most likely language from the plurality of candidate languages based on the document scores for each language; program code for determining whether the test document is in the most likely language or in no language, wherein the determination is based at least in part on comparing the document scores for one or more impostor languages in an impostor set associated with the most likely language to an impostor profile for the most likely language, wherein the impostor profile for the most likely language includes a parameter set consisting of values characterizing a score distribution expected for documents in the most likely language when scored using the respective language models of the one or more impostor languages in the impostor set associated with the most likely language; and program code for storing, in a computer readable storage medium, language information for the test document, the language information including a result of the determination. | 14. A computer program product comprising a computer readable storage medium encoded with program code usable to control operation of a computer system, the program code including: program code for computing, for each language in a plurality of candidate languages, a document score for a test document using a language model associated with that language; program code for selecting a most likely language from the plurality of candidate languages based on the document scores for each language; program code for determining whether the test document is in the most likely language or in no language, wherein the determination is based at least in part on comparing the document scores for one or more impostor languages in an impostor set associated with the most likely language to an impostor profile for the most likely language, wherein the impostor profile for the most likely language includes a parameter set consisting of values characterizing a score distribution expected for documents in the most likely language when scored using the respective language models of the one or more impostor languages in the impostor set associated with the most likely language; and program code for storing, in a computer readable storage medium, language information for the test document, the language information including a result of the determination. 15. The computer program product of claim 14 wherein the language model for each language is a bigram based language model. | 0.918865 |
8,990,088 | 18 | 20 | 18. A computer-readable memory device with instructions stored thereon for specification of consistent normalization mapping and grammars, the instructions comprising: enabling a user to specify terminals and rules through a user interface of an authoring tool based on a user specified normalization mapping between the terminals, the rules comprising list rules, sequence rules, and grammar rules; displaying a list of the user specified terminals and the rules on the user interface to provide visual feedback to the user including listing element names, element types, and referencing relationships, the displayed list comprising a display form and a spoken form of the listed user specified terminals and the rules, wherein the specified terminals are reordered independently on the display form and the spoken form side of the displayed list using subscript indicators to allow the user to see a relationship between parts of the rules on either side of the displayed list; performing a plurality of test scenarios specified by at least one of: a user selection and modification from a default list of test scenarios, wherein the plurality of specified test scenarios are executed within the user interface of the authoring tool to provide immediate feedback to the user; providing results of the test scenarios and enabling the user to modify parameters of the terminals and the rules; exposing completed rules semantically to a grammar using common functions such that the functions are to be shared among different languages and dialects; and abstracting a structure of the rules into a map to enable reuse of the rules for similar languages by importing the rules structure for a new language model and localizing the terminals. | 18. A computer-readable memory device with instructions stored thereon for specification of consistent normalization mapping and grammars, the instructions comprising: enabling a user to specify terminals and rules through a user interface of an authoring tool based on a user specified normalization mapping between the terminals, the rules comprising list rules, sequence rules, and grammar rules; displaying a list of the user specified terminals and the rules on the user interface to provide visual feedback to the user including listing element names, element types, and referencing relationships, the displayed list comprising a display form and a spoken form of the listed user specified terminals and the rules, wherein the specified terminals are reordered independently on the display form and the spoken form side of the displayed list using subscript indicators to allow the user to see a relationship between parts of the rules on either side of the displayed list; performing a plurality of test scenarios specified by at least one of: a user selection and modification from a default list of test scenarios, wherein the plurality of specified test scenarios are executed within the user interface of the authoring tool to provide immediate feedback to the user; providing results of the test scenarios and enabling the user to modify parameters of the terminals and the rules; exposing completed rules semantically to a grammar using common functions such that the functions are to be shared among different languages and dialects; and abstracting a structure of the rules into a map to enable reuse of the rules for similar languages by importing the rules structure for a new language model and localizing the terminals. 20. The computer-readable memory device of claim 18 , wherein the rules are exposed to a grammar for use in one of a build verification test process and a speech processing engine that shares a runtime with an authoring tool creating the rules for end-user experience consistency, wherein the speech processing engine is employed by applications including at least one from a set of word processing applications, presentation applications, browsing applications, navigational assistance applications, and communication applications, and wherein at least one of the applications are executed in a distributed manner over a plurality of computing devices communicating through a network. | 0.500729 |
8,972,440 | 13 | 16 | 13. A non-transitory computer-readable storage medium containing a computer-readable code that when read by a computer causes the computer to perform a method for configuring a memory subsystem of a computing system, the method comprising: using a graphical user interface to create an aggregation of graphical representations of annotations associated with a plurality of data elements contained within the corpus of data and graphical representations of search terms contained within the plurality of data elements, wherein the aggregation comprises at least one annotation and at least one search term; manipulating relative positions of the graphical representations of the annotations and the search terms within the aggregation within the graphical user interface to express relationships among the annotations and search terms, the annotations, search terms and expressed relationships defining the semantic query; and searching the corpus of data using the defined semantic query. | 13. A non-transitory computer-readable storage medium containing a computer-readable code that when read by a computer causes the computer to perform a method for configuring a memory subsystem of a computing system, the method comprising: using a graphical user interface to create an aggregation of graphical representations of annotations associated with a plurality of data elements contained within the corpus of data and graphical representations of search terms contained within the plurality of data elements, wherein the aggregation comprises at least one annotation and at least one search term; manipulating relative positions of the graphical representations of the annotations and the search terms within the aggregation within the graphical user interface to express relationships among the annotations and search terms, the annotations, search terms and expressed relationships defining the semantic query; and searching the corpus of data using the defined semantic query. 16. The non-transitory computer readable storage medium of claim 13 , wherein the method further comprises using a visual cue in association with graphical representations associated with annotations to differentiate the graphical representations associated with annotations from graphical representations associated with search terms. | 0.612269 |
7,698,342 | 17 | 18 | 17. A computer readable medium comprising instructions for completing a form, wherein the instructions comprising functionality for: storing data associated with a plurality of forms into a data structure comprising a plurality of nodes corresponding to a plurality of fields in the plurality of forms; receiving a search term from a user and obtaining a related word based on the search term to generate a search criteria; searching, using a processor of a computer, the plurality of forms by comparing the search criteria to each of the plurality of nodes in the data structure to generate a match; identifying, using the processor of the computer, a field within the form of the plurality of forms based on the match and the data structure; and presenting the field within the form to the user for completing the form. | 17. A computer readable medium comprising instructions for completing a form, wherein the instructions comprising functionality for: storing data associated with a plurality of forms into a data structure comprising a plurality of nodes corresponding to a plurality of fields in the plurality of forms; receiving a search term from a user and obtaining a related word based on the search term to generate a search criteria; searching, using a processor of a computer, the plurality of forms by comparing the search criteria to each of the plurality of nodes in the data structure to generate a match; identifying, using the processor of the computer, a field within the form of the plurality of forms based on the match and the data structure; and presenting the field within the form to the user for completing the form. 18. The computer readable medium of claim 17 , wherein identifying the field within the form comprises: identifying the match as a topic associated with the field within the form; presenting the topic associated with a link to the field within the form to the user for a selection; and receiving the selection from the user comprising the topic, wherein the field within the form is presented to the user using the link identified based on the selection. | 0.534836 |
7,680,812 | 42 | 46 | 42. The method of claim 39 , wherein said step of navigating further comprises: comparing documents pairwise; and developing a similarity score. | 42. The method of claim 39 , wherein said step of navigating further comprises: comparing documents pairwise; and developing a similarity score. 46. The method of claim 42 , further comprising: storing said similarity score in a similarity score database. | 0.960686 |
9,679,024 | 6 | 7 | 6. The method of claim 4 , wherein generating one or more unique combinations of the n-grams and variant-tokens comprises: calculating a combination score for each unique combination based on whether one or more second bloom filters of the plurality of second bloom filters indicate the unique combination does not exist in one or more sub-sets of object names of the first set of object names; and selecting one or more of the unique combinations having combination scores greater than a threshold combination score. | 6. The method of claim 4 , wherein generating one or more unique combinations of the n-grams and variant-tokens comprises: calculating a combination score for each unique combination based on whether one or more second bloom filters of the plurality of second bloom filters indicate the unique combination does not exist in one or more sub-sets of object names of the first set of object names; and selecting one or more of the unique combinations having combination scores greater than a threshold combination score. 7. The method of claim 6 , wherein calculating the combination score for each unique combination is further based on one or more of: an indication of a valid grammar construct for the unique combination; an indication of whether the unique combination is associated with a database of previously identified lexicons associated with the first vertical; or a measure of interactions with the unique combination by one or more users of the online social network. | 0.900649 |
8,090,722 | 16 | 17 | 16. The system of claim 12 , including a presentation logic to present data concerning a base document relevant to the query. | 16. The system of claim 12 , including a presentation logic to present data concerning a base document relevant to the query. 17. The system of claim 16 , the presentation logic to present data concerning a first level document related to the base document. | 0.970654 |
8,751,477 | 9 | 10 | 9. The host computer system of claim 8 , the quality control system further comprising: a page relevance score calculation module calculating a page relevance score for a page based on a combination of the challenge relevance scores for the first and second engines; and a page relevance score publication module publishing the challenge reference score for the page; and the live system includes a page preparation module combining the live results received from the first and second engines into one live results page that is transmitted to the live remote computer system. | 9. The host computer system of claim 8 , the quality control system further comprising: a page relevance score calculation module calculating a page relevance score for a page based on a combination of the challenge relevance scores for the first and second engines; and a page relevance score publication module publishing the challenge reference score for the page; and the live system includes a page preparation module combining the live results received from the first and second engines into one live results page that is transmitted to the live remote computer system. 10. The host computer system of claim 9 , wherein the page relevance score is calculated based on a vector that includes a position of the challenge results received from the first and second engines. | 0.957806 |
8,996,559 | 31 | 45 | 31. A system comprising: a memory; and a processor communicatively coupled to the memory, the processor being configured to execute instructions to: generate a data profile comprising a set of characteristics captured at various granularities of an initial result set generated from an initial query of a database, determine what a user expects in at least one of the initial result set of the initial query and a subsequent result set of a subsequent query based on one of the data profile and a heuristically estimated data profile, enable the user to evaluate a semantic accuracy of the subsequent query based on a likely expectation of the user as determined through the set of characteristics of the data profile, generate a social data catalog table of information about how users are interacting with at least one of the database and a sample database, populate the social data catalog table with metadata, a logical definition and description of attributes, information about usage, page views between the users, a social data network, and a statistical data profile, extract information from external data sources and social media profiles to generate the social data catalog table of information, and crowd source information from a ranked list of knowledgeable users to generate a ranked order of priority of information presented in profile pages of a curated answers system, wherein the information about usage includes related tables and join predicates as well as relevant filters associated with each table of the at least one of the database and the sample database, wherein the social data network includes a list of users who are knowledgeable about a particular object related to the another query, and wherein the metadata is at least one of a schema name, a table in a schema, a name of an attribute, a data type of the attribute, a primary key associated with the attribute, a constraint of the attribute, a functional dependency between the attributes, an index, a foreign key, a field name, a column name, a table name, and a query description. | 31. A system comprising: a memory; and a processor communicatively coupled to the memory, the processor being configured to execute instructions to: generate a data profile comprising a set of characteristics captured at various granularities of an initial result set generated from an initial query of a database, determine what a user expects in at least one of the initial result set of the initial query and a subsequent result set of a subsequent query based on one of the data profile and a heuristically estimated data profile, enable the user to evaluate a semantic accuracy of the subsequent query based on a likely expectation of the user as determined through the set of characteristics of the data profile, generate a social data catalog table of information about how users are interacting with at least one of the database and a sample database, populate the social data catalog table with metadata, a logical definition and description of attributes, information about usage, page views between the users, a social data network, and a statistical data profile, extract information from external data sources and social media profiles to generate the social data catalog table of information, and crowd source information from a ranked list of knowledgeable users to generate a ranked order of priority of information presented in profile pages of a curated answers system, wherein the information about usage includes related tables and join predicates as well as relevant filters associated with each table of the at least one of the database and the sample database, wherein the social data network includes a list of users who are knowledgeable about a particular object related to the another query, and wherein the metadata is at least one of a schema name, a table in a schema, a name of an attribute, a data type of the attribute, a primary key associated with the attribute, a constraint of the attribute, a functional dependency between the attributes, an index, a foreign key, a field name, a column name, a table name, and a query description. 45. The system of claim 31 , wherein the processor is further configured to execute instructions to: monitor a behavior of the user in interacting with the set of characteristics of the data profile when the subsequent query is generated, and refine an presentation algorithm that optimally determines which characteristics to present to the user in a further query based on the monitored behavior of the user in interacting with at least one of the initial query and the subsequent query in the query editor. | 0.697024 |
4,602,152 | 7 | 8 | 7. A method of decoding a bar code as set forth in claim 6, further including employing only words of bar code with said predetermined number of bits of data in which a preponderance of one binary value occurs in the bits of data defining the word as compared to the other binary value. | 7. A method of decoding a bar code as set forth in claim 6, further including employing only words of bar code with said predetermined number of bits of data in which a preponderance of one binary value occurs in the bits of data defining the word as compared to the other binary value. 8. A method of decoding a bar code as set forth in claim 7, wherein each of said first bar spaces is respectively representative of "one", and each of said second bar spaces is respectively representative of "zero". | 0.94934 |
9,612,708 | 6 | 7 | 6. The method of claim 1 , further comprising allowing, by said at least one computer, said user to restrict access to said instance of the page editor as said control. | 6. The method of claim 1 , further comprising allowing, by said at least one computer, said user to restrict access to said instance of the page editor as said control. 7. The method of claim 6 , further comprising determining, by said at least one computer, whether said another user is authorized to access said instance of the page editor as said control. | 0.957794 |
9,971,574 | 1 | 8 | 1. A method for transforming JavaScript Object Notation (JSON) data, the method comprising: receiving, at a computer, a first object specified using JavaScript Object Notation (JSON), the first object having a set of one or more attributes, each attribute being of a predetermined JSON data type and having at least one value; receiving, at the computer, a second object specified using JavaScript Object Notation, the second object having a set of one or more attributes each corresponding to at least one attribute in the set of one or more attributes of the first object and having at least one value defining one or more transformations, wherein receiving, at the computer, the second object comprises receiving an attribute of an object specified using JavaScript Object Notation having a value that defines one or more tests that define whether the one or more transformations are applicable to the first object; determining, by the computer, a positive evaluation of the one or more tests; transforming, by the computer, the first object specified using JavaScript Object Notation into a third object specified using JavaScript Object Notation based on the second object specified using JavaScript Object Notation based on the positive evaluation of the one or more tests, wherein the transforming comprises renaming an attribute of the first object, performing one or more numerical operations with respect to a value of an attribute of the first object, performing one or more string operations with respect to a value of an attribute of the first object, adding one or more attributes to an attribute of the first object which is also an object, or removing one or more attributes from an attribute of the first object which is also an object; and storing the third object in a storage device associated with the computer. | 1. A method for transforming JavaScript Object Notation (JSON) data, the method comprising: receiving, at a computer, a first object specified using JavaScript Object Notation (JSON), the first object having a set of one or more attributes, each attribute being of a predetermined JSON data type and having at least one value; receiving, at the computer, a second object specified using JavaScript Object Notation, the second object having a set of one or more attributes each corresponding to at least one attribute in the set of one or more attributes of the first object and having at least one value defining one or more transformations, wherein receiving, at the computer, the second object comprises receiving an attribute of an object specified using JavaScript Object Notation having a value that defines one or more tests that define whether the one or more transformations are applicable to the first object; determining, by the computer, a positive evaluation of the one or more tests; transforming, by the computer, the first object specified using JavaScript Object Notation into a third object specified using JavaScript Object Notation based on the second object specified using JavaScript Object Notation based on the positive evaluation of the one or more tests, wherein the transforming comprises renaming an attribute of the first object, performing one or more numerical operations with respect to a value of an attribute of the first object, performing one or more string operations with respect to a value of an attribute of the first object, adding one or more attributes to an attribute of the first object which is also an object, or removing one or more attributes from an attribute of the first object which is also an object; and storing the third object in a storage device associated with the computer. 8. The method of claim 1 wherein the one or more tests are defined with respect to one or more attributes of the first object. | 0.837209 |
7,562,342 | 17 | 18 | 17. The method of claim 14 , where in the creating step comprises: locating a property from the region object with a same name as a tag name of the at least one annotation object; and creating a new doclet object instance using a type of a doclet meta-model property. | 17. The method of claim 14 , where in the creating step comprises: locating a property from the region object with a same name as a tag name of the at least one annotation object; and creating a new doclet object instance using a type of a doclet meta-model property. 18. The method of claim 17 , further comprising: caching a range of the at least one annotation in the at least one changed source file with the new doclet object instance. | 0.95144 |
9,684,726 | 1 | 5 | 1. A method of answering questions in an information handling system comprising a processor and a memory, the method comprising: ingesting, by the system, a first set of sources into a first corpus; ingesting, by the system, a second set of sources into a second corpus, wherein the second set of sources are a subset of the first set of sources, and wherein the second set of sources include updates to the first set of sources; receiving, by the system, a question from a requestor; identifying, by the system, a plurality of candidate answers to the question using one or more sources included in the first and second corpuses, wherein a weighting is associated with each of the candidate answers; determining, by the system, whether the first and second corpuses have an overlapping source from which two or more of the candidate answers were identified; in response to determining the overlapping source, assigning, by the system, a first candidate answer from the overlapping source in the first corpus with a lower weighting than a second candidate answer from the overlapping source in the second corpus; selecting one or more likely answers from the plurality of candidate answers, wherein the selecting is based on the weighting associated with the respective candidate answers; and returning the selected likely answers to the requestor. | 1. A method of answering questions in an information handling system comprising a processor and a memory, the method comprising: ingesting, by the system, a first set of sources into a first corpus; ingesting, by the system, a second set of sources into a second corpus, wherein the second set of sources are a subset of the first set of sources, and wherein the second set of sources include updates to the first set of sources; receiving, by the system, a question from a requestor; identifying, by the system, a plurality of candidate answers to the question using one or more sources included in the first and second corpuses, wherein a weighting is associated with each of the candidate answers; determining, by the system, whether the first and second corpuses have an overlapping source from which two or more of the candidate answers were identified; in response to determining the overlapping source, assigning, by the system, a first candidate answer from the overlapping source in the first corpus with a lower weighting than a second candidate answer from the overlapping source in the second corpus; selecting one or more likely answers from the plurality of candidate answers, wherein the selecting is based on the weighting associated with the respective candidate answers; and returning the selected likely answers to the requestor. 5. The method of claim 1 further comprising: associating an input date corresponding to each of the first and second set of sources, wherein the assigning of the lower weighting to the overlapping source in the first source is also based on the input date of the overlapping source in the first corpus being earlier than the input date of the overlapping source in the second corpus. | 0.582789 |
9,607,044 | 1 | 21 | 1. A method for performing an efficient query on a parent table and one or more joined child tables, the method comprising: determining one or more search grams based on the query, each of the one or more search grams being at least a portion of the query, wherein determining the one or more search grams comprises determining gram vectors for each search gram of the one or more search grams; identifying a parent table having one or more parent table partitions including one or more respective parent records grouped therein; identifying one or more child table partitions from one or more joined child tables, the one or more child table partitions including one or more respective child records grouped therein, wherein the identified one or more child table partitions are associated with a first of the one or more parent table partitions, and wherein the child records grouped within the identified one or more child table partitions are associated with the one or more parent records of the associated first of the one or more parent table partitions; scanning parent records in the first of the parent table partitions for the one or more search grams; scanning child records in the identified one or more child table partitions associated with the first of the parent table partitions for the one or more search grams; computing parent gram scores for scanned parent records based on a degree of matching with the one or more search grams; computing child gram scores for scanned child records based on a degree of matching with the one or more search grams, wherein gram vectors associated with a child table from the one or more joined child tables are sorted by a foreign key; computing aggregate scores for each parent record and its associated child records based on parent and child gram scores; repeating the identifying one or more child table partitions, scanning parent and child records, and computing parent and child gram scores and aggregate scores for each of the parent table partitions; generating a mapping structure having parent and child table partitions association information and parent and child records association information; referencing the mapping structure to determine associations between parent and child table partitions and between parent and child records; determining a new child record for inserting into a child table partition associated with a parent table partition having a parent record associated with the new child record; in response to determining an available row exists in the child table partition, inserting the new child record into the available row; in response to determining an available row does not exist in the child table partition, generating a new child table partition, associating the new child table partition with the parent table partition, and inserting the new child record into the new child table partition. | 1. A method for performing an efficient query on a parent table and one or more joined child tables, the method comprising: determining one or more search grams based on the query, each of the one or more search grams being at least a portion of the query, wherein determining the one or more search grams comprises determining gram vectors for each search gram of the one or more search grams; identifying a parent table having one or more parent table partitions including one or more respective parent records grouped therein; identifying one or more child table partitions from one or more joined child tables, the one or more child table partitions including one or more respective child records grouped therein, wherein the identified one or more child table partitions are associated with a first of the one or more parent table partitions, and wherein the child records grouped within the identified one or more child table partitions are associated with the one or more parent records of the associated first of the one or more parent table partitions; scanning parent records in the first of the parent table partitions for the one or more search grams; scanning child records in the identified one or more child table partitions associated with the first of the parent table partitions for the one or more search grams; computing parent gram scores for scanned parent records based on a degree of matching with the one or more search grams; computing child gram scores for scanned child records based on a degree of matching with the one or more search grams, wherein gram vectors associated with a child table from the one or more joined child tables are sorted by a foreign key; computing aggregate scores for each parent record and its associated child records based on parent and child gram scores; repeating the identifying one or more child table partitions, scanning parent and child records, and computing parent and child gram scores and aggregate scores for each of the parent table partitions; generating a mapping structure having parent and child table partitions association information and parent and child records association information; referencing the mapping structure to determine associations between parent and child table partitions and between parent and child records; determining a new child record for inserting into a child table partition associated with a parent table partition having a parent record associated with the new child record; in response to determining an available row exists in the child table partition, inserting the new child record into the available row; in response to determining an available row does not exist in the child table partition, generating a new child table partition, associating the new child table partition with the parent table partition, and inserting the new child record into the new child table partition. 21. The method of claim 1 , wherein the one or more child table partitions comprise at least two child table partitions. | 0.856459 |
10,089,374 | 13 | 15 | 13. An apparatus connected to a source data base and a target data base, said apparatus comprising one or more processors and a memory device having stored computer readable instructions executable by the one or more processors for executing an export process according to an automated meta model driven export of entity parts from the source data base, wherein said one or more processors are configured to: manage a meta model specifying an abstract model of the source data base and comprising a description of an entity part and/or a reference relationship between entity parts being resolvable from a referencing entity part to a referenced entity part; identify a set of entity parts being identifiable outside the source data base by a public key, an internal key, or a mixed public and internal key as first level entity parts; supplement the identified set of first level entity parts by a set of second level entity parts being referenced by the first level entity parts according to at least one reference relationship described in the meta model; initialize an empty repository as a staging memory for the export process; retrieve the identified set of first level entity parts in sequence from the source data base; add each of the retrieved first level entity parts to the repository; link the each added first level entity parts to its corresponding meta model description; supplement the repository memory with export data; scan the first level entity parts added to the repository memory; resolve, for every scanned first level entity part, its reference relationships in a recursive manner to identify related child entity parts; evaluate, for every child entity part, whether it is already added to the repository memory and to add every child entity part to the repository memory when it is not added; and dump content of the repository memory into an export file. | 13. An apparatus connected to a source data base and a target data base, said apparatus comprising one or more processors and a memory device having stored computer readable instructions executable by the one or more processors for executing an export process according to an automated meta model driven export of entity parts from the source data base, wherein said one or more processors are configured to: manage a meta model specifying an abstract model of the source data base and comprising a description of an entity part and/or a reference relationship between entity parts being resolvable from a referencing entity part to a referenced entity part; identify a set of entity parts being identifiable outside the source data base by a public key, an internal key, or a mixed public and internal key as first level entity parts; supplement the identified set of first level entity parts by a set of second level entity parts being referenced by the first level entity parts according to at least one reference relationship described in the meta model; initialize an empty repository as a staging memory for the export process; retrieve the identified set of first level entity parts in sequence from the source data base; add each of the retrieved first level entity parts to the repository; link the each added first level entity parts to its corresponding meta model description; supplement the repository memory with export data; scan the first level entity parts added to the repository memory; resolve, for every scanned first level entity part, its reference relationships in a recursive manner to identify related child entity parts; evaluate, for every child entity part, whether it is already added to the repository memory and to add every child entity part to the repository memory when it is not added; and dump content of the repository memory into an export file. 15. The apparatus of claim 13 , wherein the reference relationship in the meta model is a 1:1 reference being resolvable from a referencing entity part of the source data base to one referenced entity part of the source data base or a 1:n child reference being resolvable from a referencing entity part of the source data base to at least one referenced entity part of the source data base, and wherein the one or more processors are further configured to resolve, for every scanned first level entity part, its reference relationships in a recursive manner to identify related child entity parts such that a 1:1 reference is resolved over one level of hierarchy and such that a 1:n child reference is resolved over at least one level of hierarchy. | 0.816216 |
8,832,057 | 1 | 7 | 1. A computer-implemented method comprising: in response to receiving the query, selecting, from a search corpus, a set of documents that are relevant to the query; wherein the set of documents includes at least a first document and a second document; for each particular document within at least a subset of the set of documents, extracting one or more lists contained within that particular document and adding the one or more lists into a set of lists; wherein extracting one or more lists includes, extracting a first list from the first document and extracting a second list from the second document; for each particular list in the set of lists, generating a list score for the particular list based at least in part on a number of occurrences of items in the particular list within other lists in the set of lists; wherein generating a list score includes generating a first list score for the first list extracted from the first document, and generating a second list score for the second list extracted from the second document; for each particular document within at least the subset of documents, generating a document score for the particular document based at least in part on the list score generated for at least one list contained within the particular document; wherein generating a document score includes generating a first document score for the first document based, at least in part, on the first list score generated for the first list that was extracted from the first document; generating a second document score for the second document based, at least in part, on the second list score generated for the second list that was extracted from the second document; and generating a search results page that presents references to selected documents from at least the subset of documents in an order that is based at least in part on the document scores generated for the selected documents; wherein the method is performed by one or more computing devices. | 1. A computer-implemented method comprising: in response to receiving the query, selecting, from a search corpus, a set of documents that are relevant to the query; wherein the set of documents includes at least a first document and a second document; for each particular document within at least a subset of the set of documents, extracting one or more lists contained within that particular document and adding the one or more lists into a set of lists; wherein extracting one or more lists includes, extracting a first list from the first document and extracting a second list from the second document; for each particular list in the set of lists, generating a list score for the particular list based at least in part on a number of occurrences of items in the particular list within other lists in the set of lists; wherein generating a list score includes generating a first list score for the first list extracted from the first document, and generating a second list score for the second list extracted from the second document; for each particular document within at least the subset of documents, generating a document score for the particular document based at least in part on the list score generated for at least one list contained within the particular document; wherein generating a document score includes generating a first document score for the first document based, at least in part, on the first list score generated for the first list that was extracted from the first document; generating a second document score for the second document based, at least in part, on the second list score generated for the second list that was extracted from the second document; and generating a search results page that presents references to selected documents from at least the subset of documents in an order that is based at least in part on the document scores generated for the selected documents; wherein the method is performed by one or more computing devices. 7. The method of claim 1 , further comprising: prior to extracting the one or more lists, removing, from the set of documents, all documents that do not contain at least one list in which list items are numbered or ranked relative to other list items. | 0.711494 |
9,367,522 | 21 | 28 | 21. A non-transitory computer readable medium storing computer executable instructions, which, when executed by a processor, cause the processor to carry out a method for editing an electronic presentation, comprising: providing an electronic presentation editing interface for editing an electronic presentation, wherein the interface comprises: a digital canvas comprising a plurality of canvas objects in a plurality of canvas layers; a digital timeline comprising a plurality of timeline objects, a time axis, and a graphical indicia on the time axis that represents a pause in the electronic presentation, wherein: each canvas object in the plurality of canvas objects is linked to a respective timeline object; a position of a timeline object on the digital timeline is indicative of a time and a canvas layer that a linked canvas object is displayed on the digital canvas; the position of the timeline object includes a first time coordinate on the time axis indicative of when the linked canvas object appears in the digital canvas, a second time coordinate on the time axis indicative of when the linked canvas object disappears from the digital canvas, and a layer coordinate indicative of a canvas layer in which the linked canvas object appears in the digital canvas; the graphical indicia extends over all layer coordinates that are displayed in the digital timeline; and the digital timeline further comprises a marker on the digital timeline, wherein a position of the marker is indicative of a time corresponding to a current view of the digital canvas, and wherein when the position of the marker coincides with the graphical indicia on the time axis, each canvas object linked to a timeline object that coincides with the position of the marker is paused. | 21. A non-transitory computer readable medium storing computer executable instructions, which, when executed by a processor, cause the processor to carry out a method for editing an electronic presentation, comprising: providing an electronic presentation editing interface for editing an electronic presentation, wherein the interface comprises: a digital canvas comprising a plurality of canvas objects in a plurality of canvas layers; a digital timeline comprising a plurality of timeline objects, a time axis, and a graphical indicia on the time axis that represents a pause in the electronic presentation, wherein: each canvas object in the plurality of canvas objects is linked to a respective timeline object; a position of a timeline object on the digital timeline is indicative of a time and a canvas layer that a linked canvas object is displayed on the digital canvas; the position of the timeline object includes a first time coordinate on the time axis indicative of when the linked canvas object appears in the digital canvas, a second time coordinate on the time axis indicative of when the linked canvas object disappears from the digital canvas, and a layer coordinate indicative of a canvas layer in which the linked canvas object appears in the digital canvas; the graphical indicia extends over all layer coordinates that are displayed in the digital timeline; and the digital timeline further comprises a marker on the digital timeline, wherein a position of the marker is indicative of a time corresponding to a current view of the digital canvas, and wherein when the position of the marker coincides with the graphical indicia on the time axis, each canvas object linked to a timeline object that coincides with the position of the marker is paused. 28. The non-transitory computer readable medium of claim 21 , wherein the interface is further configured to enable a user to modify the position of the marker to modify the time corresponding to the current view of the digital canvas. | 0.804493 |
10,002,345 | 7 | 9 | 7. The system of claim 6 , wherein the operations further comprise: receiving query response data in response to generating the query data, and wherein the query response data represents an approval of an inclusion of the agenda item in the agenda of the requested meeting. | 7. The system of claim 6 , wherein the operations further comprise: receiving query response data in response to generating the query data, and wherein the query response data represents an approval of an inclusion of the agenda item in the agenda of the requested meeting. 9. The system of claim 7 , wherein the operations further comprise: selecting the agenda item from the group of possible agenda items based on query response data received in association with a previous meeting. | 0.935037 |
7,900,136 | 13 | 14 | 13. A storage medium for storing a structured document processing program which causes a computer to execute a structured document processing method, said method comprising the steps of: inputting a first structured document including a first element, and first designation information for designating a location in the first structured document at which the first element is included, a second structured document including a second element, and second designation information for designating a location in the second structured document at which no element is included into which the first element is to be inserted; selecting the first element in the first structured document in accordance with the first designation information designating the location in the first structured document at which the first element is included; and inserting the first element selected in the selecting step into the second structured document at the location designated by the second designation information for designating the location into which the first element is to be inserted. | 13. A storage medium for storing a structured document processing program which causes a computer to execute a structured document processing method, said method comprising the steps of: inputting a first structured document including a first element, and first designation information for designating a location in the first structured document at which the first element is included, a second structured document including a second element, and second designation information for designating a location in the second structured document at which no element is included into which the first element is to be inserted; selecting the first element in the first structured document in accordance with the first designation information designating the location in the first structured document at which the first element is included; and inserting the first element selected in the selecting step into the second structured document at the location designated by the second designation information for designating the location into which the first element is to be inserted. 14. The medium according to claim 13 , wherein the inserting step comprises an association step of associating the first designation information and the second designation information, and the inserting step includes a step of inserting the first element selected in accordance with the first designation information into the second structured document at the location designated by the second designation information associated to the first designation information. | 0.501071 |
9,037,598 | 12 | 13 | 12. The method of claim 11 , wherein generating the adjusted amount of time is based at least in part on the formula [(100+X) %*T], wherein X represents a predetermined tuning number and T represents the average pause time. | 12. The method of claim 11 , wherein generating the adjusted amount of time is based at least in part on the formula [(100+X) %*T], wherein X represents a predetermined tuning number and T represents the average pause time. 13. The method of claim 12 , further comprising: decrementing a value of X based on a number of characters included in the first set of characters. | 0.965297 |
9,288,285 | 8 | 9 | 8. The computer program product of claim 7 , wherein the operations further comprise: receiving, at the client appliance, an index that comprises a list of the portion of the classified public content; filtering the portion of the classified public content based on one or more user settings; and preparing the list of the filtered portion of the classified public content for presentation to the user. | 8. The computer program product of claim 7 , wherein the operations further comprise: receiving, at the client appliance, an index that comprises a list of the portion of the classified public content; filtering the portion of the classified public content based on one or more user settings; and preparing the list of the filtered portion of the classified public content for presentation to the user. 9. The computer program product of claim 8 , wherein the operations further comprise: presenting, to the user, the list of the filtered portion of the classified public content, the list comprising one or more hyperlinks associated with the classified public content; and presenting, to the user, the portion of the private content based on the request for the recommendation of content. | 0.886776 |
8,170,863 | 12 | 13 | 12. A method for portlet-based translation of web content, comprising: providing an interface implemented by a configuration system stored on a memory device; and designating a set of specifications for translating web content within an individual portlet of a portal page directly from a first natural language to a second natural language using the interface, wherein the set of specifications designated includes a translation paradigm, and wherein the translation paradigm dictates whether translation of the web content will be viewer initiated, automatic, or both viewer initiated and automatic, wherein the set of specifications designated further includes: an address of a translation system for translating the web content; a set of target languages into which the web content can be translated; a subject area indicating a type of informational content included in the web content; an address of a user dictionary that supplements the translation system; and a language style for translating the web content; and translating the web content of a portlet of the portal page into a natural language and translating the web content of a different portlet of the portal page into a different natural language, wherein the source language of the web content of the portlet is different from the source language of the web content of the different portlet. | 12. A method for portlet-based translation of web content, comprising: providing an interface implemented by a configuration system stored on a memory device; and designating a set of specifications for translating web content within an individual portlet of a portal page directly from a first natural language to a second natural language using the interface, wherein the set of specifications designated includes a translation paradigm, and wherein the translation paradigm dictates whether translation of the web content will be viewer initiated, automatic, or both viewer initiated and automatic, wherein the set of specifications designated further includes: an address of a translation system for translating the web content; a set of target languages into which the web content can be translated; a subject area indicating a type of informational content included in the web content; an address of a user dictionary that supplements the translation system; and a language style for translating the web content; and translating the web content of a portlet of the portal page into a natural language and translating the web content of a different portlet of the portal page into a different natural language, wherein the source language of the web content of the portlet is different from the source language of the web content of the different portlet. 13. The method of claim 12 , further comprising rendering the portlet with a button if the translation paradigm dictates that translation of the web content is viewer initiated. | 0.603139 |
9,672,247 | 1 | 3 | 1. A computer-system-implemented method for translating a first query into an edge query, the method comprising: receiving the first query, at a computer, wherein the first query is associated with a first type of database; translating the first query, at the computer using primitives, into the edge query, wherein: the edge query is associated with a graph database storing a graph; and the graph comprises nodes, edges between the nodes, and predicates to represent data with index-free adjacency; executing the edge query against the graph database, wherein the edge query identifies an edge associated with a predicate that specifies one or more of the nodes of the graph; and receiving a result in response to the edge query. | 1. A computer-system-implemented method for translating a first query into an edge query, the method comprising: receiving the first query, at a computer, wherein the first query is associated with a first type of database; translating the first query, at the computer using primitives, into the edge query, wherein: the edge query is associated with a graph database storing a graph; and the graph comprises nodes, edges between the nodes, and predicates to represent data with index-free adjacency; executing the edge query against the graph database, wherein the edge query identifies an edge associated with a predicate that specifies one or more of the nodes of the graph; and receiving a result in response to the edge query. 3. The method of claim 1 , wherein the first type of database includes one of: a relational database, and a hierarchical database. | 0.883513 |
9,349,371 | 1 | 5 | 1. A speech recognition terminal device capable of communicating with a speech recognition server that carries out speech recognition, the speech recognition terminal device comprising: a speech acquisition device that acquires a speech command spoken by a user; a request device that requests the speech recognition server to carry out the speech recognition of the speech command acquired by the speech acquisition device; a prediction device that predicts a present delay time until a result of the speech recognition of the speech command requested from the request device is obtained from the speech recognition server; a determination device that determines a filler word with a time length in accordance with the present delay time predicted by the prediction device; a filler speaking device that outputs the filler word determined by the determination device as speech information during a waiting time until the result of the speech recognition requested from the request device is obtained from the speech recognition server; a response device that, when the result of the speech recognition is acquired from the speech recognition server, executes a process of responding to the user based on the acquired result of the speech recognition; and an acquiring device that acquires time information expressing past delay times when the communication has been carried out with the speech recognition server in past, wherein based on the past delay times expressed by the time information acquired by the acquisition device, the prediction device predicts the present delay time until the result of the speech recognition requested from the request device is obtained from the speech recognition server. | 1. A speech recognition terminal device capable of communicating with a speech recognition server that carries out speech recognition, the speech recognition terminal device comprising: a speech acquisition device that acquires a speech command spoken by a user; a request device that requests the speech recognition server to carry out the speech recognition of the speech command acquired by the speech acquisition device; a prediction device that predicts a present delay time until a result of the speech recognition of the speech command requested from the request device is obtained from the speech recognition server; a determination device that determines a filler word with a time length in accordance with the present delay time predicted by the prediction device; a filler speaking device that outputs the filler word determined by the determination device as speech information during a waiting time until the result of the speech recognition requested from the request device is obtained from the speech recognition server; a response device that, when the result of the speech recognition is acquired from the speech recognition server, executes a process of responding to the user based on the acquired result of the speech recognition; and an acquiring device that acquires time information expressing past delay times when the communication has been carried out with the speech recognition server in past, wherein based on the past delay times expressed by the time information acquired by the acquisition device, the prediction device predicts the present delay time until the result of the speech recognition requested from the request device is obtained from the speech recognition server. 5. The speech recognition terminal device according to claim 1 , wherein: the time information acquired by the acquiring device is associated with a location where the communication is carried out; and based on the past delay times expressed by the time information associated with the communication carried out within a predetermined geographical range with respect to a present position, the prediction device predicts the present delay time until the result of the speech recognition is obtained from the speech recognition server. | 0.500935 |
8,862,457 | 1 | 5 | 1. A computer-implemented method for transforming a natural language expression into a formal logical expression, comprising: identifying using a database of ontology, by a processor, words in a natural language expression as resources, constants and comparisons, the resources being associated with meta data that specify when to use the words of the resources; using the identified words representing resources, constants and comparisons to build a formal logical expression by the processor; and presenting the formal logical expression on a user interface device, by the processor, the user interface device presenting at least a rule pad portion into which the natural language expression is input and a rule editor portion comprising graphically visualized IF part and THEN part, wherein the presenting further comprises automatically dragging the formal logical expression into one of the IF part and the THEN part. | 1. A computer-implemented method for transforming a natural language expression into a formal logical expression, comprising: identifying using a database of ontology, by a processor, words in a natural language expression as resources, constants and comparisons, the resources being associated with meta data that specify when to use the words of the resources; using the identified words representing resources, constants and comparisons to build a formal logical expression by the processor; and presenting the formal logical expression on a user interface device, by the processor, the user interface device presenting at least a rule pad portion into which the natural language expression is input and a rule editor portion comprising graphically visualized IF part and THEN part, wherein the presenting further comprises automatically dragging the formal logical expression into one of the IF part and the THEN part. 5. The method of claim 1 , wherein the natural language expression is a part of a rule expressed in natural language and a plurality of natural language expressions are built into a plurality of formal logical expressions to form an aggregated formal logical expression. | 0.739382 |
9,262,384 | 1 | 57 | 1. An apparatus, comprising: a device including at least one input device, at least one display, and memory in communication with at least one hardware processor; and a browser installed on the memory of the device for allowing access, utilizing the at least one input device and the at least one hardware processor, to a system including a hardware server, the system configured for: identifying at least parts of a plurality of original documents including a plurality of original values, the plurality of original documents including a first document including first values and a second document including second values; processing at least a part of the first document and at least a part of the second document, resulting in at least one data structure including at least one of the plurality of original values of at least one of the plurality of original documents; receiving one or more indications for one or more of the original values for adding, in connection with at least one computer-readable Extensible Markup Language (XML)-compliant data document, a corresponding one or more computer-readable semantic tags in association with the one or more original values; associating the one or more computer-readable semantic tags with the one or more original values such that the one or more computer-readable semantic tags are each computer-readably associated with the one or more original values; causing output of a presentation that is based on at least a portion of the at least one data structure, the presentation capable of including at least a portion of the original values including the at least one original value, where the system is configured such that, based on the at least one data structure, a change to the at least one original value results in a corresponding change in a subsequent output of the presentation; causing output of a report that is based on at least a portion of the at least one data structure, the report capable of including at least a portion of the original values including the at least one original value, where the system is configured such that, based on the at least one data structure, a change to the at least one original value results in a corresponding change in a subsequent output of the report; and causing output of the computer-readable XML-compliant data document that is based on at least a portion of at least one data structure, the at least one computer-readable XML-compliant data document capable of including a plurality of line items at least one of which utilizes at least a portion of the original values including the at least one original value and at least some of the one or more computer-readable semantic tags, where the system is configured such that, based on the at least one data structure, a change to the at least one original value results in a corresponding change in a subsequent output of the at least one computer-readable XML-compliant data document; said apparatus configured for: receiving user input utilizing the browser, and displaying the at least one computer-readable XML-compliant data document utilizing the browser, after the user input. | 1. An apparatus, comprising: a device including at least one input device, at least one display, and memory in communication with at least one hardware processor; and a browser installed on the memory of the device for allowing access, utilizing the at least one input device and the at least one hardware processor, to a system including a hardware server, the system configured for: identifying at least parts of a plurality of original documents including a plurality of original values, the plurality of original documents including a first document including first values and a second document including second values; processing at least a part of the first document and at least a part of the second document, resulting in at least one data structure including at least one of the plurality of original values of at least one of the plurality of original documents; receiving one or more indications for one or more of the original values for adding, in connection with at least one computer-readable Extensible Markup Language (XML)-compliant data document, a corresponding one or more computer-readable semantic tags in association with the one or more original values; associating the one or more computer-readable semantic tags with the one or more original values such that the one or more computer-readable semantic tags are each computer-readably associated with the one or more original values; causing output of a presentation that is based on at least a portion of the at least one data structure, the presentation capable of including at least a portion of the original values including the at least one original value, where the system is configured such that, based on the at least one data structure, a change to the at least one original value results in a corresponding change in a subsequent output of the presentation; causing output of a report that is based on at least a portion of the at least one data structure, the report capable of including at least a portion of the original values including the at least one original value, where the system is configured such that, based on the at least one data structure, a change to the at least one original value results in a corresponding change in a subsequent output of the report; and causing output of the computer-readable XML-compliant data document that is based on at least a portion of at least one data structure, the at least one computer-readable XML-compliant data document capable of including a plurality of line items at least one of which utilizes at least a portion of the original values including the at least one original value and at least some of the one or more computer-readable semantic tags, where the system is configured such that, based on the at least one data structure, a change to the at least one original value results in a corresponding change in a subsequent output of the at least one computer-readable XML-compliant data document; said apparatus configured for: receiving user input utilizing the browser, and displaying the at least one computer-readable XML-compliant data document utilizing the browser, after the user input. 57. The apparatus of claim 1 , wherein the system is configured such that at least a portion of the at least one computer-readable XML-compliant data document is capable of being caused to be displayed via a plurality of user-selected views including a chart review, a tree view, and a spreadsheet view. | 0.960751 |
8,667,003 | 1 | 2 | 1. A computer-implemented method, comprising: associating each of a plurality of parent queries with a respective group of one or more child queries for the parent query, wherein each child query was submitted during a respective session following submission of its associated parent query during the session; identifying one or more candidate sibling queries for a particular child query, wherein the particular child query is a child query for one or more first parent queries in the plurality of parent queries and each candidate sibling query for the particular child query is a child query for one or more second parent queries in the plurality of queries, wherein for each candidate sibling query, the one or more second parent queries for the candidate sibling query and the one or more first parent queries have a group of shared parent queries in common and the group of shared parent queries has a size that satisfies a common-query threshold; and selecting one or more final sibling queries for the particular child query from the one or more candidate sibling queries, and associating the final sibling queries with the particular child query as query refinements for the particular child query. | 1. A computer-implemented method, comprising: associating each of a plurality of parent queries with a respective group of one or more child queries for the parent query, wherein each child query was submitted during a respective session following submission of its associated parent query during the session; identifying one or more candidate sibling queries for a particular child query, wherein the particular child query is a child query for one or more first parent queries in the plurality of parent queries and each candidate sibling query for the particular child query is a child query for one or more second parent queries in the plurality of queries, wherein for each candidate sibling query, the one or more second parent queries for the candidate sibling query and the one or more first parent queries have a group of shared parent queries in common and the group of shared parent queries has a size that satisfies a common-query threshold; and selecting one or more final sibling queries for the particular child query from the one or more candidate sibling queries, and associating the final sibling queries with the particular child query as query refinements for the particular child query. 2. The method of claim 1 , wherein each candidate sibling query has a fan-in measure that satisfies a fan-in threshold, wherein the fan-in measure is a number of parent queries associated with a particular sibling query. | 0.874715 |
7,827,210 | 10 | 11 | 10. The computer system of claim 6 , wherein the shredding tree is defined by one of an annotated XML schema an annotated document type definition document, the one of the annotated XML schema and annotated document type definition document defining a hierarchical data structure definition with annotations, wherein the annotations comprise a first set of annotations for at least one leaf node of the hierarchical data structure definition that define a respective binding between a data element of the respective at least one leaf node and a column of the hierarchical data structure. | 10. The computer system of claim 6 , wherein the shredding tree is defined by one of an annotated XML schema an annotated document type definition document, the one of the annotated XML schema and annotated document type definition document defining a hierarchical data structure definition with annotations, wherein the annotations comprise a first set of annotations for at least one leaf node of the hierarchical data structure definition that define a respective binding between a data element of the respective at least one leaf node and a column of the hierarchical data structure. 11. The computer system of claim 10 , wherein the first set of annotations are associated with a first shredding tree within the at least one shredding tree, wherein the first binding defines a variable, and wherein the first annotated document type definition document further comprises at least a second set of annotations that define a respective relationship between the respective binding and a respective separate relational data structure defined by a separate shredding tree within the at least one shredding tree. | 0.881633 |
7,945,929 | 1 | 7 | 1. A method for using program listings information to locate programs of interest to a user, the method comprising: receiving a plurality of program listings with user equipment, wherein at least one of the program listings is associated with two or more simple categories; and generating at least one combination category with the user equipment, the generating comprising: identifying the two or more simple categories associated with the at least one program listing; and combining at least a subset of the identified simple categories associated with the at least one program listing into the at least one combination category, wherein the combination category comprises more than one of the identified simple categories. | 1. A method for using program listings information to locate programs of interest to a user, the method comprising: receiving a plurality of program listings with user equipment, wherein at least one of the program listings is associated with two or more simple categories; and generating at least one combination category with the user equipment, the generating comprising: identifying the two or more simple categories associated with the at least one program listing; and combining at least a subset of the identified simple categories associated with the at least one program listing into the at least one combination category, wherein the combination category comprises more than one of the identified simple categories. 7. The method of claim 1 further comprising assigning the at least one combination category to the at least one program listing. | 0.892977 |
8,856,132 | 10 | 13 | 10. The method of claim 1 wherein receiving the knowledge tip in the tips repository further comprises: a. creating a new category in the tips repository if a required category does not exist among a plurality of predefined categories in the tips repository; and b. storing the knowledge tip to the new category. | 10. The method of claim 1 wherein receiving the knowledge tip in the tips repository further comprises: a. creating a new category in the tips repository if a required category does not exist among a plurality of predefined categories in the tips repository; and b. storing the knowledge tip to the new category. 13. The method of claim 10 further comprising modifying content of an existing knowledge tip in the tips repository, wherein an author of the knowledge tip is allowed to modify content of the knowledge tip, and wherein the author is a member of the organization responsible for providing the existing knowledge tip to the tips repository. | 0.936538 |
8,077,984 | 1 | 8 | 1. A method of comparing spans of text comprising: with a computer, computing a similarity measure between a first sequence of symbols representing a first text span and a second sequence of symbols representing a second text span as a function of the occurrences of optionally noncontiguous subsequences of symbols shared by the two sequences of symbols, wherein each of the symbols comprises at least one consecutive word, the words being enriched with linguistic information allowing them to be defined according to a set of linguistic factors, whereby pairs of symbols in the first and second sequences forming a shared subsequence of symbols are each matched according to at least one of the factors and wherein all pairs of matching symbols in a shared subsequence need not match according to the same factor. | 1. A method of comparing spans of text comprising: with a computer, computing a similarity measure between a first sequence of symbols representing a first text span and a second sequence of symbols representing a second text span as a function of the occurrences of optionally noncontiguous subsequences of symbols shared by the two sequences of symbols, wherein each of the symbols comprises at least one consecutive word, the words being enriched with linguistic information allowing them to be defined according to a set of linguistic factors, whereby pairs of symbols in the first and second sequences forming a shared subsequence of symbols are each matched according to at least one of the factors and wherein all pairs of matching symbols in a shared subsequence need not match according to the same factor. 8. The method of claim 1 , wherein the factored word sequence kernel weights at least one of the factors differently from another of the factors. | 0.891952 |
8,782,568 | 11 | 16 | 11. A method for generating a desired object, said method comprising: receiving a first sequence of key inputs, some of which are explicit key inputs and some of which are ambiguous key inputs and; generating, based on the first sequence of key inputs, a first set of character sequences; wherein each character of each character sequence of the first set of character sequences corresponds to either an explicit key input or an ambiguous key input in the first sequence of key inputs and is selected from the plurality of intended or potentially intended characters associated with the corresponding respective explicit key input or ambiguous key input; and searching a database, based on the first set of search character sequences, for objects to identify a first set of potential desired objects found in said database and receiving a selection of a first desired object from the first set of potential desired objects found in said database. | 11. A method for generating a desired object, said method comprising: receiving a first sequence of key inputs, some of which are explicit key inputs and some of which are ambiguous key inputs and; generating, based on the first sequence of key inputs, a first set of character sequences; wherein each character of each character sequence of the first set of character sequences corresponds to either an explicit key input or an ambiguous key input in the first sequence of key inputs and is selected from the plurality of intended or potentially intended characters associated with the corresponding respective explicit key input or ambiguous key input; and searching a database, based on the first set of search character sequences, for objects to identify a first set of potential desired objects found in said database and receiving a selection of a first desired object from the first set of potential desired objects found in said database. 16. The method of claim 11 , wherein explicit key input is received by any combination of: 2-key explicit entry comprising two keys entered in sequence, wherein the combination of the two keys entered in sequence identifies a single unambiguous intended character; long pressing a key to display and cycle through a character sequence; long pressing on a key to enter a number/digit explicitly; changing to a numbers mode and pressing a key to enter a number/digit explicitly; changing to a multi-tap mode and pressing a key repeatedly to enter a character explicitly; interpreting ambiguous mode key presses as an explicit character, either by grouping each pair of key presses as a 2-key explicit entry, or by grouping repeated presses of the same key as a multi-tap entry; using multi-switch keys, thereby permitting ambiguous entry on a simple press and an explicit character entry on a different kind of press; chording by pressing more than one key simultaneously, with a primary key indicating an ambiguous set of characters and a secondary key indicating which character in the set to select; and using a softkey as a secondary means for offering any character assigned to a key based on analysis of most likely character associated with a preceding keystroke or based on words in a current word candidate list. | 0.675603 |
8,595,270 | 1 | 3 | 1. A computer-implemented method, comprising: receiving, for each target document of a plurality of target documents that a search engine has identified in response to a query, an address of the target document, the target document including query-relevant text at an intra-document portion of the target document; for each address of the target document of the target documents: generating an artificial anchor, the artificial anchor corresponding to the intra-document portion of the target document and undefined in the target document; appending the artificial anchor to the address of the target document; and providing, to a client device, a plurality of search results, wherein each search result of the search results identifies a corresponding target document and includes the address of the target document appended with the artificial anchor as a search result link to the target document; wherein the artificial anchor includes a preassigned artificial anchor designator designating the artificial anchor to an artificial anchor module in the client device, and wherein the artificial anchor includes the preassigned artificial anchor designator as either a prefix or a suffix and wherein the preassigned artificial anchor designator includes a preassigned set of text characters, and the artificial anchor designator and artificial anchor are ignored by a client web browser in a client device not having the artificial anchor module. | 1. A computer-implemented method, comprising: receiving, for each target document of a plurality of target documents that a search engine has identified in response to a query, an address of the target document, the target document including query-relevant text at an intra-document portion of the target document; for each address of the target document of the target documents: generating an artificial anchor, the artificial anchor corresponding to the intra-document portion of the target document and undefined in the target document; appending the artificial anchor to the address of the target document; and providing, to a client device, a plurality of search results, wherein each search result of the search results identifies a corresponding target document and includes the address of the target document appended with the artificial anchor as a search result link to the target document; wherein the artificial anchor includes a preassigned artificial anchor designator designating the artificial anchor to an artificial anchor module in the client device, and wherein the artificial anchor includes the preassigned artificial anchor designator as either a prefix or a suffix and wherein the preassigned artificial anchor designator includes a preassigned set of text characters, and the artificial anchor designator and artificial anchor are ignored by a client web browser in a client device not having the artificial anchor module. 3. The method of claim 1 , wherein: the address of the target document comprises a uniform resource locator that specifies the location of the target document; and appending the artificial anchor to the address comprises appending the artificial anchor to the uniform resource locator. | 0.837884 |
9,545,579 | 13 | 14 | 13. The computer-readable non-transitory medium storing the program according to claim 1 , wherein the computer is caused to further execute exclusion of a character under a predetermined state in the game processing, from adjustment targets by the adjustment. | 13. The computer-readable non-transitory medium storing the program according to claim 1 , wherein the computer is caused to further execute exclusion of a character under a predetermined state in the game processing, from adjustment targets by the adjustment. 14. The computer-readable non-transitory medium storing the program according to claim 13 , wherein the game processing includes performing movement of a plurality of characters in the virtual world in response to operation by a player, and the exclusion involves excluding a character that cannot be operated by the player, from the adjustment targets by the adjustment. | 0.899458 |
7,685,191 | 1 | 7 | 1. A computer-implemented method, the method comprising: tracking, by using a computer, search activities of actual search engine users over a plurality of different search engines; programmatically analyzing the tracked search activities to generate statistical data regarding a plurality of unique search queries used by a plurality of users of the plurality of different search engines to locate and access a particular document, said statistical data encompassing user search activities over the plurality of different search engines, wherein the programmatically analyzing is performed by a computer system; using at least the statistical data regarding the plurality of unique search queries to control automatic selection of advertisements to include in the particular document, wherein the statistical data identifies the search queries used the most frequently over the plurality of different search engines to locate the document, wherein the using at least the statistical data further comprises: determining a data variance between content of the particular document and at least one search query used to locate the particular document, wherein the at least one search query was previously not identified with the content of the particular document, wherein the automatic selection is thereafter based at least partly on the at least one search query; determining whether most referrals or a mathematically significant number of referrals from a particular search engine for the particular document correspond to a search query that is algorithmically relevant to the particular document; when the most referrals or the mathematically significant number of referrals from the particular search engine for the particular document are based on search queries that are not algorithmically relevant, providing advertising based on the search query used in response to a request for the particular document arising from use of that particular search engine and to a predicted user expectation of content, as determined by analyzing the tracked search activities, wherein the advertising is otherwise irrelevant to the particular document; and otherwise, providing advertising that is algorithmically determined to be relevant to the particular document. | 1. A computer-implemented method, the method comprising: tracking, by using a computer, search activities of actual search engine users over a plurality of different search engines; programmatically analyzing the tracked search activities to generate statistical data regarding a plurality of unique search queries used by a plurality of users of the plurality of different search engines to locate and access a particular document, said statistical data encompassing user search activities over the plurality of different search engines, wherein the programmatically analyzing is performed by a computer system; using at least the statistical data regarding the plurality of unique search queries to control automatic selection of advertisements to include in the particular document, wherein the statistical data identifies the search queries used the most frequently over the plurality of different search engines to locate the document, wherein the using at least the statistical data further comprises: determining a data variance between content of the particular document and at least one search query used to locate the particular document, wherein the at least one search query was previously not identified with the content of the particular document, wherein the automatic selection is thereafter based at least partly on the at least one search query; determining whether most referrals or a mathematically significant number of referrals from a particular search engine for the particular document correspond to a search query that is algorithmically relevant to the particular document; when the most referrals or the mathematically significant number of referrals from the particular search engine for the particular document are based on search queries that are not algorithmically relevant, providing advertising based on the search query used in response to a request for the particular document arising from use of that particular search engine and to a predicted user expectation of content, as determined by analyzing the tracked search activities, wherein the advertising is otherwise irrelevant to the particular document; and otherwise, providing advertising that is algorithmically determined to be relevant to the particular document. 7. The method of claim 1 , wherein the advertisements are selected dynamically when a user accesses the document via a search engine, and are selected based further upon an identity of said search engine. | 0.721311 |
7,769,769 | 9 | 14 | 9. A method for transforming in a computer system a metadata model for containing model objects, the method comprising: obtaining information from a model object in a lower layer of a metadata model stored in a storage device, wherein the metadata model includes the lower layer and a higher layer, wherein each of the lower layer and the higher layer includes one or more model objects, wherein the lower layer includes one or more model objects having a lower degree of abstraction than the model objects of the higher layer, wherein the lower layer provides access to a plurality of different data sources, and wherein the higher layer provides each of a plurality of different business intelligence tools with an interface by which to access each of the plurality of different data sources, and wherein each of the plurality of different business intelligence tools is designed to interface only with a corresponding subset of the plurality of different data sources; abstracting, with one or more computers of the computer system, the information by adding business rules for representing a business concept; creating, with the one or more computers, a new model object in the higher layer corresponding to the model object in the lower layer based on the information abstracted, wherein the new model object in the higher layer provides a representation of the business concept; and storing the metadata model having the lower layer and the higher layer in a storage device. | 9. A method for transforming in a computer system a metadata model for containing model objects, the method comprising: obtaining information from a model object in a lower layer of a metadata model stored in a storage device, wherein the metadata model includes the lower layer and a higher layer, wherein each of the lower layer and the higher layer includes one or more model objects, wherein the lower layer includes one or more model objects having a lower degree of abstraction than the model objects of the higher layer, wherein the lower layer provides access to a plurality of different data sources, and wherein the higher layer provides each of a plurality of different business intelligence tools with an interface by which to access each of the plurality of different data sources, and wherein each of the plurality of different business intelligence tools is designed to interface only with a corresponding subset of the plurality of different data sources; abstracting, with one or more computers of the computer system, the information by adding business rules for representing a business concept; creating, with the one or more computers, a new model object in the higher layer corresponding to the model object in the lower layer based on the information abstracted, wherein the new model object in the higher layer provides a representation of the business concept; and storing the metadata model having the lower layer and the higher layer in a storage device. 14. The method as claimed in claim 9 further comprising: obtaining additional information of one of the model objects in the higher layer; determining a specific feature included in the obtained additional information; and creating another new model object in the higher layer based on the specific feature. | 0.660398 |
8,850,414 | 14 | 16 | 14. A method comprising: receiving one or more commands to modify language metadata of a programming language, the one or more commands indicating an addition of at least one of a new keyword, an operator, or a statement to the programming language, the language metadata specifying runtime characteristics of the programming language; modifying the language metadata at runtime based on the one or more commands to produce modified language metadata and change language behavior; modifying a grammar of the programming language based on the modified language metadata to add the at least one new keyword, operator, or statement to the programming language, the grammar of the programming language defining a syntax of the programming language; and utilizing the modified language metadata as a feature at runtime for parsing one or more functions and for execution of an output program. | 14. A method comprising: receiving one or more commands to modify language metadata of a programming language, the one or more commands indicating an addition of at least one of a new keyword, an operator, or a statement to the programming language, the language metadata specifying runtime characteristics of the programming language; modifying the language metadata at runtime based on the one or more commands to produce modified language metadata and change language behavior; modifying a grammar of the programming language based on the modified language metadata to add the at least one new keyword, operator, or statement to the programming language, the grammar of the programming language defining a syntax of the programming language; and utilizing the modified language metadata as a feature at runtime for parsing one or more functions and for execution of an output program. 16. The method of claim 14 , wherein the modifying includes modifying one or more namespace elements. | 0.914407 |
9,628,827 | 1 | 6 | 1. A decoder for decoding a video from a data stream comprising syntax elements encoded therein, the decoder comprising: an entropy decoder configured to decode the syntax elements based on one or more of a plurality of contexts used in binary entropy decoding, wherein the entropy decoder is configured to initialize each of the plurality of contexts based on, for each context, a slope value and an offset value, wherein the slope value and the offset value are determined based on first and second four-bit parts of an 8-bit initialization value associated with the context; and a reconstructor configured to reconstruct the video based on the decoded syntax elements. | 1. A decoder for decoding a video from a data stream comprising syntax elements encoded therein, the decoder comprising: an entropy decoder configured to decode the syntax elements based on one or more of a plurality of contexts used in binary entropy decoding, wherein the entropy decoder is configured to initialize each of the plurality of contexts based on, for each context, a slope value and an offset value, wherein the slope value and the offset value are determined based on first and second four-bit parts of an 8-bit initialization value associated with the context; and a reconstructor configured to reconstruct the video based on the decoded syntax elements. 6. The decoder according to claim 1 , wherein the entropy decoder is configured to binary arithmetic decode a bin of a syntax element being currently decoded by quantizing a current probability interval width value representing a current probability interval to acquire a probability interval index, and performing an interval subdivision by indexing a table entry among tables entries using the probability interval index and a probability state index depending on a current probability state associated with the context selected for the bin, to acquire a sub-division of the current probability interval into two partial intervals. | 0.500789 |
8,209,347 | 8 | 14 | 8. A system comprising: a non-transitory storage device coupled to the one or more computers having instructions stored thereon which, when executed by the one or more computers, cause the one or more computers to perform operations comprising: receiving an original query; selecting a plurality of documents responsive to the original query according to a ranking of the respective documents; generating a plurality of term vectors, the plurality of term vectors including a term vector for each document; truncating each term vector to include only highest-weighted terms from the respective document to provide a plurality of truncated term vectors; combining the plurality of truncated term vectors containing the highest-weighted terms to produce a search query centroid; searching a centroid repository for previously stored centroids matching the search query centroid; converting each of a first number of the most highly-ranked centroids into a respective candidate query; examining the candidate queries; adding each candidate query to a set of query suggestions if the respective candidate query contains a threshold number of terms that are not included in the original query; and providing the set of query suggestions in response to the original query. | 8. A system comprising: a non-transitory storage device coupled to the one or more computers having instructions stored thereon which, when executed by the one or more computers, cause the one or more computers to perform operations comprising: receiving an original query; selecting a plurality of documents responsive to the original query according to a ranking of the respective documents; generating a plurality of term vectors, the plurality of term vectors including a term vector for each document; truncating each term vector to include only highest-weighted terms from the respective document to provide a plurality of truncated term vectors; combining the plurality of truncated term vectors containing the highest-weighted terms to produce a search query centroid; searching a centroid repository for previously stored centroids matching the search query centroid; converting each of a first number of the most highly-ranked centroids into a respective candidate query; examining the candidate queries; adding each candidate query to a set of query suggestions if the respective candidate query contains a threshold number of terms that are not included in the original query; and providing the set of query suggestions in response to the original query. 14. The system of claim 8 , wherein the operations further comprise: generating a disjunction including an additional number of highest-weighted terms in the search query centroid; wherein searching the centroid repository for previously stored centroids comprises searching the centroid repository for previously stored centroids that match the disjunction. | 0.653772 |
8,601,387 | 3 | 4 | 3. The user interface of claim 1 , wherein the view links are substantially in the same location in each one of the views. | 3. The user interface of claim 1 , wherein the view links are substantially in the same location in each one of the views. 4. The user interface of claim 3 , wherein the search view links are located vertically below one another. | 0.949087 |
10,083,684 | 7 | 10 | 7. An information handling system comprising: one or more processors; a memory coupled to at least one of the processors; and a set of computer program instructions stored in the memory and executed by at least one of the processors in order to perform actions comprising: analyzing a document that is being composed by a visually impaired user, wherein the analysis derives a sensitivity of the document; retrieving a vocal characteristic corresponding to the derived sensitivity based on one or more predefined settings; retrieving, from the memory, an additional vocal characteristic corresponding to an audience size of the document, wherein the audience size is based on a size of an intended audience selected from a group consisting of an email distribution list and an amount of recipients of a group posting; and audibly reading text from the document to the visually impaired user with a text to speech process utilizing both the retrieved vocal characteristic and the additional vocal characteristic. | 7. An information handling system comprising: one or more processors; a memory coupled to at least one of the processors; and a set of computer program instructions stored in the memory and executed by at least one of the processors in order to perform actions comprising: analyzing a document that is being composed by a visually impaired user, wherein the analysis derives a sensitivity of the document; retrieving a vocal characteristic corresponding to the derived sensitivity based on one or more predefined settings; retrieving, from the memory, an additional vocal characteristic corresponding to an audience size of the document, wherein the audience size is based on a size of an intended audience selected from a group consisting of an email distribution list and an amount of recipients of a group posting; and audibly reading text from the document to the visually impaired user with a text to speech process utilizing both the retrieved vocal characteristic and the additional vocal characteristic. 10. The information handling system of claim 7 wherein the derived sensitivity is based on one or more aspects from a group that includes confidentiality, offensiveness, social convention, ethnicity, and age. | 0.888172 |
7,953,580 | 16 | 17 | 16. The method of claim 15 further comprising performing a configuration task by: loading the formal network element managed object model, the formal configuration task model, and a relevant configuration workflow ontology stored in an ontology repository for a given configuration task comprising one or more configuration tasks and/or one or more sub-tasks into a database; requesting a representation of network data from the network to be configured; converting the representation of network data to ontology instances; providing a connection to the database via an inference engine Application Programming Interface (API) to provide a user interface; automatically performing the configuration task via the user interface; converting the resulting configuration ontology instances to configured network data; and introducing the configured network data into the network to obtain a configured or reconfigured network or network element. | 16. The method of claim 15 further comprising performing a configuration task by: loading the formal network element managed object model, the formal configuration task model, and a relevant configuration workflow ontology stored in an ontology repository for a given configuration task comprising one or more configuration tasks and/or one or more sub-tasks into a database; requesting a representation of network data from the network to be configured; converting the representation of network data to ontology instances; providing a connection to the database via an inference engine Application Programming Interface (API) to provide a user interface; automatically performing the configuration task via the user interface; converting the resulting configuration ontology instances to configured network data; and introducing the configured network data into the network to obtain a configured or reconfigured network or network element. 17. The method of claim 16 wherein the representation of network data comprises an eXtensible Markup Language (XML) representation of network data. | 0.948166 |
8,401,851 | 17 | 19 | 17. The non-transitory computer readable storage medium of claim 15 , further comprising instructions that, when executed by the processor, cause the processor to input a plurality of utterance recordings to the speech recognition device. | 17. The non-transitory computer readable storage medium of claim 15 , further comprising instructions that, when executed by the processor, cause the processor to input a plurality of utterance recordings to the speech recognition device. 19. The non-transitory computer readable storage medium of claim 17 , further comprising instructions that, when executed by the processor, cause the processor to tune the speech recognition device until a desired accuracy of recognition is achieved for the utterance type. | 0.709574 |
9,804,889 | 1 | 5 | 1. A method for executing jobs in a cluster computing system, the cluster computing system including a plurality of compute nodes connected by a network, the method comprising: at a first compute node of the cluster computing system, receiving via the network a job to be executed by at least one process of a distributed application executed by a processor operating under control of the first compute node; at the first compute node, receiving via the network a job state object for the job, wherein the job state object comprises a file that includes a database for storing job metadata, wherein the job metadata includes at least job status information; at the first compute node, accessing the database of the job state object to update the job metadata in connection with execution of the job by the processor of the compute node while the job state object and the job are at the first compute node; and upon completion of the execution of a portion of the job at the first compute node: transferring, from the first compute node, the job state object and the job via the network to a second compute node of the cluster computing system, at the first compute node, transmitting, via the network, an address of the job state object at the second compute node to a state tracker node of the cluster computing system, the state tracker node executing a state tracking process for storing the address of the job state object in a state object location database, wherein the second compute node further executes the job, accesses the database of the job state object to update the job metadata in connection with the further execution of the job while the job state object and the job are at the second compute node. | 1. A method for executing jobs in a cluster computing system, the cluster computing system including a plurality of compute nodes connected by a network, the method comprising: at a first compute node of the cluster computing system, receiving via the network a job to be executed by at least one process of a distributed application executed by a processor operating under control of the first compute node; at the first compute node, receiving via the network a job state object for the job, wherein the job state object comprises a file that includes a database for storing job metadata, wherein the job metadata includes at least job status information; at the first compute node, accessing the database of the job state object to update the job metadata in connection with execution of the job by the processor of the compute node while the job state object and the job are at the first compute node; and upon completion of the execution of a portion of the job at the first compute node: transferring, from the first compute node, the job state object and the job via the network to a second compute node of the cluster computing system, at the first compute node, transmitting, via the network, an address of the job state object at the second compute node to a state tracker node of the cluster computing system, the state tracker node executing a state tracking process for storing the address of the job state object in a state object location database, wherein the second compute node further executes the job, accesses the database of the job state object to update the job metadata in connection with the further execution of the job while the job state object and the job are at the second compute node. 5. The method as recited in claim 1 , further comprising, at the first compute node, accessing the database of the job state object to obtain job metadata to be used in connection with the execution of the job. | 0.922165 |
9,275,639 | 1 | 8 | 1. A system having a client-server architecture for Automatic Speech Recognition (ASR) applications, comprising: a) client-side including: a.1) a client being part of distributed front end for converting acoustic waves to feature vectors representing the properties of said acoustic waves using Digital Signal Processing (DSP); a.2) Voice Activity Detection for separating between speech and non-speech acoustic signals and for environmental compensation; a.3) adaptor for WebSockets to pipeline chunked feature vectors to the server side; b) a server side including: b.1) A web layer utilizing HTTP protocols and including a Web Server having a Servlet Container which contains dedicated servlet for managing voice recognition sessions that include transferring WebSockets' packets to messages and returning responses and diagnostic message to client, said layer being an access point for corporate information systems, and a point of integration with another web application, which are used for load balancing and. authentication and authorization of clients; b.2) an intermediate layer for transport based on Message-Oriented Middleware (MOM) being a message broker, to which all other server parts are connected, for feature vector streaming, for communication and integration, and for load balancing between said client side and said server side; b.3) a recognition server and an adaptation server both connected to said intermediate layer, said adaptation server being connected via an adaptation channel, said recognition server interacts with said client side via a recognition channel and a Distributed Frontend (DFE); b.4) a Speech processing server consisting of a server part of distributed front end, a Recognition Server and an Adaptation Server; b.5) a Recognition Server for instantiation of a recognition channel per client; b.6)an Adaptation Server for adaptation acoustic and linguistic models for each speaker; b.7) a Bidirectional communication channel between Speech processing server and client side via distributed frontend said recognition channel; and b.8) a Persistent layer for storing, a Language Knowledge Base connected to said Speech processing server, and includes a dictionary, acoustic models, statistical language models and language patterns. | 1. A system having a client-server architecture for Automatic Speech Recognition (ASR) applications, comprising: a) client-side including: a.1) a client being part of distributed front end for converting acoustic waves to feature vectors representing the properties of said acoustic waves using Digital Signal Processing (DSP); a.2) Voice Activity Detection for separating between speech and non-speech acoustic signals and for environmental compensation; a.3) adaptor for WebSockets to pipeline chunked feature vectors to the server side; b) a server side including: b.1) A web layer utilizing HTTP protocols and including a Web Server having a Servlet Container which contains dedicated servlet for managing voice recognition sessions that include transferring WebSockets' packets to messages and returning responses and diagnostic message to client, said layer being an access point for corporate information systems, and a point of integration with another web application, which are used for load balancing and. authentication and authorization of clients; b.2) an intermediate layer for transport based on Message-Oriented Middleware (MOM) being a message broker, to which all other server parts are connected, for feature vector streaming, for communication and integration, and for load balancing between said client side and said server side; b.3) a recognition server and an adaptation server both connected to said intermediate layer, said adaptation server being connected via an adaptation channel, said recognition server interacts with said client side via a recognition channel and a Distributed Frontend (DFE); b.4) a Speech processing server consisting of a server part of distributed front end, a Recognition Server and an Adaptation Server; b.5) a Recognition Server for instantiation of a recognition channel per client; b.6)an Adaptation Server for adaptation acoustic and linguistic models for each speaker; b.7) a Bidirectional communication channel between Speech processing server and client side via distributed frontend said recognition channel; and b.8) a Persistent layer for storing, a Language Knowledge Base connected to said Speech processing server, and includes a dictionary, acoustic models, statistical language models and language patterns. 8. A system according to claim 1 , in which, an HA Proxy is used for load balancing. | 0.919847 |
9,378,435 | 6 | 12 | 6. An image segmentation system, comprising: a processor; a memory; a first segmentation analyzer configured to, by the processor, segment an input image stored in the memory and generate a plurality of image portions; a maximum width comparator configured to determine, by the processor and for the respective image portions, if a width of the image portion exceeds a threshold, wherein the threshold corresponds to an expected width of a single character; and a neural-network-based segmentation analyzer configured to, by the processor, and for respective image portions for which it is determined that the width of the image portion exceeds the threshold and is wider than the expected width of a single character: identify a boundary between characters in the image portion using a trained neural network; segment the image portion at the boundary identified between the characters; and generate additional image portions corresponding to the segmented image portion. | 6. An image segmentation system, comprising: a processor; a memory; a first segmentation analyzer configured to, by the processor, segment an input image stored in the memory and generate a plurality of image portions; a maximum width comparator configured to determine, by the processor and for the respective image portions, if a width of the image portion exceeds a threshold, wherein the threshold corresponds to an expected width of a single character; and a neural-network-based segmentation analyzer configured to, by the processor, and for respective image portions for which it is determined that the width of the image portion exceeds the threshold and is wider than the expected width of a single character: identify a boundary between characters in the image portion using a trained neural network; segment the image portion at the boundary identified between the characters; and generate additional image portions corresponding to the segmented image portion. 12. The image segmentation system of claim 6 , wherein the maximum width comparator is further configured to, upon determining that a width of an image portion is less than the threshold, provide the image portion to an output index. | 0.867914 |
9,082,084 | 1 | 6 | 1. A computer-implemented method for facilitating an automatic machine-learning process for an online social network, the method comprising: during operation of the online social network, automatically collecting labeled training events; snapshotting raw entity data associated with subjects from the collected training events; generating features for each training event using the snapshotted entity data and the current entity data to produce training examples; consolidating the training examples from one or more time periods to produce a consolidated set of training examples; determining one or more contradictory user actions upon a set of entity data in the consolidated set of training examples, wherein a contradictory user action involves a same user responding differently to the same entity data over different time intervals; resolving the contradictory user actions for the consolidated set of training examples; splitting the training examples into a training set and a test set; using a machine-learning technique to train a set of models and select the best model based on one or more evaluation metrics using the training set; evaluating the performance of the best model on the test set; and if the performance of the best model satisfies a performance criterion, using the best model to predict responses for the online social network. | 1. A computer-implemented method for facilitating an automatic machine-learning process for an online social network, the method comprising: during operation of the online social network, automatically collecting labeled training events; snapshotting raw entity data associated with subjects from the collected training events; generating features for each training event using the snapshotted entity data and the current entity data to produce training examples; consolidating the training examples from one or more time periods to produce a consolidated set of training examples; determining one or more contradictory user actions upon a set of entity data in the consolidated set of training examples, wherein a contradictory user action involves a same user responding differently to the same entity data over different time intervals; resolving the contradictory user actions for the consolidated set of training examples; splitting the training examples into a training set and a test set; using a machine-learning technique to train a set of models and select the best model based on one or more evaluation metrics using the training set; evaluating the performance of the best model on the test set; and if the performance of the best model satisfies a performance criterion, using the best model to predict responses for the online social network. 6. The computer-implemented method of claim 1 , wherein the response to be predicted is associated with one or more of: a classification of an item; a prediction of a user preference; and a prediction of a user action. | 0.852103 |
9,256,592 | 15 | 18 | 15. An editing apparatus comprising: a memory; a processing device coupled to the memory and configured to: determine a first distance between a first element and a second element of a first pair of adjacent elements of a plurality of words using original positions of corresponding words in a physical work; determine a second distance between a third element and a fourth element of a second pair of adjacent elements of the plurality of words using the original positions of corresponding words in the physical work; create a graphical user interface (GUI) comprising elements of the plurality of words in positions that match original positions of corresponding words in the physical work, wherein the first pair of adjacent elements and the second pair of adjacent elements are ordered from smallest distance between adjacent elements to largest distance between adjacent elements; receive a user selection of one or more words in the GUI; mark the elements of the selected words using optical character recognition (OCR) boundary information created from the physical work to identify a broken word in the selected words; and correct the boundary information for the elements of the identified broken word to form a correct word. | 15. An editing apparatus comprising: a memory; a processing device coupled to the memory and configured to: determine a first distance between a first element and a second element of a first pair of adjacent elements of a plurality of words using original positions of corresponding words in a physical work; determine a second distance between a third element and a fourth element of a second pair of adjacent elements of the plurality of words using the original positions of corresponding words in the physical work; create a graphical user interface (GUI) comprising elements of the plurality of words in positions that match original positions of corresponding words in the physical work, wherein the first pair of adjacent elements and the second pair of adjacent elements are ordered from smallest distance between adjacent elements to largest distance between adjacent elements; receive a user selection of one or more words in the GUI; mark the elements of the selected words using optical character recognition (OCR) boundary information created from the physical work to identify a broken word in the selected words; and correct the boundary information for the elements of the identified broken word to form a correct word. 18. The apparatus of claim 15 , wherein to correct the boundary information for the elements of the broken word the processing device is to: identify parts of the broken word; and add the boundary information of the parts to each other. | 0.797251 |
7,962,328 | 27 | 28 | 27. The apparatus of claim 26 , further comprising: type tree provision means for providing, to the user, a representation of a type tree including a plurality of types; wherein the discriminant representation means for providing further comprises means for receiving, from the user, input representing a branch of the type tree selected by the user; and wherein the means for generating comprises means for generating a data structure comprising data representing the plurality of answers from the user and the branch of the type tree selected by the user. | 27. The apparatus of claim 26 , further comprising: type tree provision means for providing, to the user, a representation of a type tree including a plurality of types; wherein the discriminant representation means for providing further comprises means for receiving, from the user, input representing a branch of the type tree selected by the user; and wherein the means for generating comprises means for generating a data structure comprising data representing the plurality of answers from the user and the branch of the type tree selected by the user. 28. The apparatus of claim 27 , wherein the data representing the plurality of answers from the user consists of at most one byte of data. | 0.965257 |
7,956,843 | 1 | 3 | 1. A method of enabling disambiguation of an input into a handheld electronic device, the handheld electronic device including an input apparatus, an output apparatus, and a processor apparatus including a memory having a plurality of objects stored therein, the plurality of objects including a plurality of language objects and a plurality of frequency objects, each of at least a portion of the language objects of the plurality of language objects being associated with an associated frequency object of the plurality of frequency objects, the input apparatus including a plurality of input members, each of at least a portion of the input members of the plurality of input members having a plurality of linguistic elements assigned thereto, the method comprising: detecting a text input including a plurality of input member actuations of a number of the input members, at least one of the input member actuations being an ambiguous input; generating a number of prefix objects corresponding with the text input, each prefix object of the number of prefix objects including a linguistic element for each ambiguous input; for each prefix object of at least a portion of the number of prefix objects, seeking a corresponding language object of the plurality of language objects that corresponds with the prefix object; generating a result by, for each prefix object of at least a portion of the number of prefix objects, identifying a language object of the plurality of language objects, the identified language object corresponding with the prefix object, obtaining an associated frequency object of the plurality of frequency objects, the associated frequency object being associated with the identified language object and having a frequency value, and associating the frequency value of the associated frequency object with the prefix object; for at least a portion of the prefix objects and the corresponding frequency values of the result, generating an output set of the at least a portion of the prefix objects sorted according to the frequency values associated therewith; outputting an output including the prefix objects of at least a portion of the output set organized in descending order of frequency value, a prefix object of the at least a portion of the output set being a default prefix object having an initial portion and a terminal portion adjacent one another, the initial portion including a number of initial linguistic elements at an initial end of the default prefix, the terminal portion including a number of terminal linguistic elements at a terminal end of the default prefix; detecting a deletion input with respect to a terminal linguistic element of the number of terminal linguistic elements; detecting an actuation of another input member having a plurality of linguistic elements assigned thereto; determining that the another input member is the same input member as that which provided the terminal linguistic element of the number of terminal linguistic elements that was adjacent the initial portion before deletion and that the actuation of the another input member successively followed the deletion input; and responsive to the detecting of the deletion input and the determining, outputting as a replacement default prefix the initial portion and a replacement terminal portion, the replacement terminal portion including a replacement terminal linguistic element adjacent the initial portion, the replacement terminal linguistic element being a linguistic element of the plurality of linguistic elements assigned to the another input member other than the linguistic element of said plurality of linguistic elements that was the terminal linguistic element adjacent the initial portion before deletion. | 1. A method of enabling disambiguation of an input into a handheld electronic device, the handheld electronic device including an input apparatus, an output apparatus, and a processor apparatus including a memory having a plurality of objects stored therein, the plurality of objects including a plurality of language objects and a plurality of frequency objects, each of at least a portion of the language objects of the plurality of language objects being associated with an associated frequency object of the plurality of frequency objects, the input apparatus including a plurality of input members, each of at least a portion of the input members of the plurality of input members having a plurality of linguistic elements assigned thereto, the method comprising: detecting a text input including a plurality of input member actuations of a number of the input members, at least one of the input member actuations being an ambiguous input; generating a number of prefix objects corresponding with the text input, each prefix object of the number of prefix objects including a linguistic element for each ambiguous input; for each prefix object of at least a portion of the number of prefix objects, seeking a corresponding language object of the plurality of language objects that corresponds with the prefix object; generating a result by, for each prefix object of at least a portion of the number of prefix objects, identifying a language object of the plurality of language objects, the identified language object corresponding with the prefix object, obtaining an associated frequency object of the plurality of frequency objects, the associated frequency object being associated with the identified language object and having a frequency value, and associating the frequency value of the associated frequency object with the prefix object; for at least a portion of the prefix objects and the corresponding frequency values of the result, generating an output set of the at least a portion of the prefix objects sorted according to the frequency values associated therewith; outputting an output including the prefix objects of at least a portion of the output set organized in descending order of frequency value, a prefix object of the at least a portion of the output set being a default prefix object having an initial portion and a terminal portion adjacent one another, the initial portion including a number of initial linguistic elements at an initial end of the default prefix, the terminal portion including a number of terminal linguistic elements at a terminal end of the default prefix; detecting a deletion input with respect to a terminal linguistic element of the number of terminal linguistic elements; detecting an actuation of another input member having a plurality of linguistic elements assigned thereto; determining that the another input member is the same input member as that which provided the terminal linguistic element of the number of terminal linguistic elements that was adjacent the initial portion before deletion and that the actuation of the another input member successively followed the deletion input; and responsive to the detecting of the deletion input and the determining, outputting as a replacement default prefix the initial portion and a replacement terminal portion, the replacement terminal portion including a replacement terminal linguistic element adjacent the initial portion, the replacement terminal linguistic element being a linguistic element of the plurality of linguistic elements assigned to the another input member other than the linguistic element of said plurality of linguistic elements that was the terminal linguistic element adjacent the initial portion before deletion. 3. The method of claim 1 , further comprising: detecting an actuation of an additional input member having a number of linguistic elements assigned thereto; determining that the additional input member is different than the input member that was actuated to provide another terminal linguistic element that had been adjacent the terminal linguistic element that was adjacent the initial portion; generating a number of additional prefix objects corresponding with the linguistic elements of the input members of the text input that were actuated to provide the initial portion plus the linguistic elements assigned to the another input member plus the linguistic elements assigned to the additional input member; for each additional prefix object of at least a portion of the number of additional prefix objects, seeking a corresponding language object of the plurality of language objects that corresponds with the additional prefix object; generating an additional result by, for each additional prefix object of at least a portion of the number of additional prefix objects, identifying a language object of the plurality of language objects, the identified language object corresponding with the additional prefix object, obtaining an associated frequency object of the plurality of frequency objects, the associated frequency object being associated with the identified language object and having a frequency value, and associating the frequency value of the associated frequency object with the additional prefix object; for at least a portion of the additional prefix objects and corresponding frequency values of the additional result, generating an additional output set of the at least a portion of the additional prefix objects sorted according to the frequency values associated therewith; outputting an additional output including the additional prefix objects of at least a portion of the additional output set organized in descending order of frequency value. | 0.58512 |
4,014,548 | 1 | 4 | 1. A word game comprising a first number of single-letter alphabetic tiles; a second number of multiple-letter alphabetic tiles; at least two discrete playing boards located in a playing area, each of said boards having a single row of letter spaces, one of said letter spaces being a multiple-letter space arranged to receive one of said multiple letter tiles and the remaining spaces being single-letter spaces, successive single-letter tiles placed in successive single-letter spaces and said multiple-letter tile placed in said multiple-letter space forming a word, the score value of said word corresponding to the length thereof with respect to said multiple-letter tile, wherein the score values corresponding to said single-letter spaces are printed on the playing boards at respective single-letter spaces, said score values increasing in both of opposite directions with respect to said multiple-letter space. | 1. A word game comprising a first number of single-letter alphabetic tiles; a second number of multiple-letter alphabetic tiles; at least two discrete playing boards located in a playing area, each of said boards having a single row of letter spaces, one of said letter spaces being a multiple-letter space arranged to receive one of said multiple letter tiles and the remaining spaces being single-letter spaces, successive single-letter tiles placed in successive single-letter spaces and said multiple-letter tile placed in said multiple-letter space forming a word, the score value of said word corresponding to the length thereof with respect to said multiple-letter tile, wherein the score values corresponding to said single-letter spaces are printed on the playing boards at respective single-letter spaces, said score values increasing in both of opposite directions with respect to said multiple-letter space. 4. The word game of claim 1, including a timer for limiting the time permitted a player for forming said word. | 0.776423 |
7,529,657 | 16 | 17 | 16. The system of claim 14 , wherein the grammar components comprise at least a rules-based grammar and a statistical model. | 16. The system of claim 14 , wherein the grammar components comprise at least a rules-based grammar and a statistical model. 17. The system of claim 16 , wherein the grammar components further comprise a wildcard model that models any phonetic sequence. | 0.959596 |
9,729,479 | 9 | 10 | 9. A computer program product for providing contextual hints in an electronic message, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions when executed by a processor direct the processor to perform a method comprising: receiving a command to create a reply message to an original electronic message, the original electronic message comprising original text; determining one or more topics in the original text, the one or more topics summarizing one or more contexts in the original text; displaying the reply message with the one or more topics as contextual hints for the original text displayed as temporary text in a body of the reply message; receiving response text into the body of the reply message, corresponding to the one or more topics displayed as temporary text in the body of the reply message, from a user using the contextual hints while composing the reply message; receiving a command to send the reply message; removing the one or more topics displayed as temporary text from the body of the reply message; and sending the reply message with only the response text in the body of the reply message. | 9. A computer program product for providing contextual hints in an electronic message, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions when executed by a processor direct the processor to perform a method comprising: receiving a command to create a reply message to an original electronic message, the original electronic message comprising original text; determining one or more topics in the original text, the one or more topics summarizing one or more contexts in the original text; displaying the reply message with the one or more topics as contextual hints for the original text displayed as temporary text in a body of the reply message; receiving response text into the body of the reply message, corresponding to the one or more topics displayed as temporary text in the body of the reply message, from a user using the contextual hints while composing the reply message; receiving a command to send the reply message; removing the one or more topics displayed as temporary text from the body of the reply message; and sending the reply message with only the response text in the body of the reply message. 10. The computer program product of claim 9 , wherein the temporary text are displayed as ghost text in the body of the reply message. | 0.88225 |
7,917,841 | 9 | 10 | 9. The method of claim 1 , wherein the filtering comprises an “all matches found” type filter in which all matches having an association strength are output. | 9. The method of claim 1 , wherein the filtering comprises an “all matches found” type filter in which all matches having an association strength are output. 10. The method of claim 9 , wherein the matches are output in order from highest association strength to lowest association strength. | 0.955309 |
7,496,560 | 1 | 19 | 1. A method for electronically searching a user-personalized library of content, comprising: (a) receiving one or more search terms from a user having an electronically-searchable personalized library of content, the personalized library including a text searchable database and a page image database; (b) electronically searching the text searchable database for pages of content that match the search terms to produce search results; (c) providing the search results to the user; (d) receiving a search result selection from the user; (e) preparing a substitute image of a page image in the page image database corresponding to the search result selection from the user, wherein a portion of the content in the page image is suppressed in the substitute image in accordance with one or more access rules to limit the amount of content in the substitute image; (f) providing location information to the user that identifies the location of the search terms in the substitute image; and (g) providing to the user the substitute image responsive to the user's search result selection such that a portion of the content in the page image is suppressed in the substitute image provided to the user with an instruction to highlight the search terms in the substitute image, wherein the instruction to highlight the search terms in the substitute image comprises an instruction to apply a layer of color on or near the search terms. | 1. A method for electronically searching a user-personalized library of content, comprising: (a) receiving one or more search terms from a user having an electronically-searchable personalized library of content, the personalized library including a text searchable database and a page image database; (b) electronically searching the text searchable database for pages of content that match the search terms to produce search results; (c) providing the search results to the user; (d) receiving a search result selection from the user; (e) preparing a substitute image of a page image in the page image database corresponding to the search result selection from the user, wherein a portion of the content in the page image is suppressed in the substitute image in accordance with one or more access rules to limit the amount of content in the substitute image; (f) providing location information to the user that identifies the location of the search terms in the substitute image; and (g) providing to the user the substitute image responsive to the user's search result selection such that a portion of the content in the page image is suppressed in the substitute image provided to the user with an instruction to highlight the search terms in the substitute image, wherein the instruction to highlight the search terms in the substitute image comprises an instruction to apply a layer of color on or near the search terms. 19. The method of claim 1 , in which different access rules apply based on the time the content is to be provided to the user. | 0.915663 |
9,164,778 | 13 | 14 | 13. The system for modal progress dialog of claim 11 , where the progress dialog is displayed in a window associated with the application. | 13. The system for modal progress dialog of claim 11 , where the progress dialog is displayed in a window associated with the application. 14. The system for modal progress dialog of claim 13 , where the progress dialog includes a visual indication of an approximate degree of completion of the processing of the action. | 0.886875 |
8,452,653 | 25 | 38 | 25. A computer-readable medium having instructions stored therein, which when executed cause a computer to perform a set of operations comprising: recording activity data by a portable user device on a transportable recordable medium (TRM) coupled to the user device, the recording being in response to user participation in an activity; transferring the activity data at the user device to a profiler across a network, the profiler storing a user controlled profile including the activity data; displaying the activity data and user selectable options for the user controlled profile through the user device; and initiating a monetary transaction through the user device based on one of the plurality of recommendations; and receiving a plurality of recommendations by the user device inferred from the activity data by a user selected profiling program. | 25. A computer-readable medium having instructions stored therein, which when executed cause a computer to perform a set of operations comprising: recording activity data by a portable user device on a transportable recordable medium (TRM) coupled to the user device, the recording being in response to user participation in an activity; transferring the activity data at the user device to a profiler across a network, the profiler storing a user controlled profile including the activity data; displaying the activity data and user selectable options for the user controlled profile through the user device; and initiating a monetary transaction through the user device based on one of the plurality of recommendations; and receiving a plurality of recommendations by the user device inferred from the activity data by a user selected profiling program. 38. The computer-readable medium of claim 25 , wherein the plurality of recommendations include alternate locations for purchasing an item. | 0.829238 |
10,104,233 | 1 | 11 | 1. An interface portal system, which comprises: a non-transitory computer readable medium comprising a plurality of instructions stored therein adapted to generate a coaching portal based on behavioral assessment data, the plurality of instructions comprising: instructions that, when executed, analyze one or more communications between a customer and an agent, wherein the analysis comprises instructions that, when executed, apply a linguistic-based psychological behavioral model to separated voice data for the customer, the agent, or both, from each communication by analyzing behavioral characteristics of the customer, the agent, or both, based on the one or more communications; instructions that, when executed, identify one or more customer-agent interaction events based on the analyzed behavioral characteristics; and instructions that, when executed, display a time-based graphic representation including a plurality of the identified customer-agent interaction events across a selected time interval based on one or more communications. | 1. An interface portal system, which comprises: a non-transitory computer readable medium comprising a plurality of instructions stored therein adapted to generate a coaching portal based on behavioral assessment data, the plurality of instructions comprising: instructions that, when executed, analyze one or more communications between a customer and an agent, wherein the analysis comprises instructions that, when executed, apply a linguistic-based psychological behavioral model to separated voice data for the customer, the agent, or both, from each communication by analyzing behavioral characteristics of the customer, the agent, or both, based on the one or more communications; instructions that, when executed, identify one or more customer-agent interaction events based on the analyzed behavioral characteristics; and instructions that, when executed, display a time-based graphic representation including a plurality of the identified customer-agent interaction events across a selected time interval based on one or more communications. 11. The interface portal system of claim 1 , wherein the communication comprises at least one of a phone call, e-mail including voice data, web interaction including voice data, VoIP, or video including voice data. | 0.728426 |
9,899,039 | 11 | 13 | 11. The non-transitory computer-readable recording medium of claim 10 , wherein the extracting a voice frame corresponding to a voiced sound among the plurality of voice frames comprises: extracting predetermined features from a voice frame among the plurality of voice frames, and determining whether said voice frame is from a voiced sound, an unvoiced sound, or background noise. | 11. The non-transitory computer-readable recording medium of claim 10 , wherein the extracting a voice frame corresponding to a voiced sound among the plurality of voice frames comprises: extracting predetermined features from a voice frame among the plurality of voice frames, and determining whether said voice frame is from a voiced sound, an unvoiced sound, or background noise. 13. The non-transitory computer-readable recording medium of claim 11 , wherein the determining whether said voice frame is from a voiced sound, an unvoiced sound, or background noise comprises using neural network. | 0.910417 |
9,092,394 | 14 | 16 | 14. The command processing system of claim 9 , wherein the gesture information indicates whether a hand or forearm of the user is located within a distance from the depth camera or beyond the distance from the depth camera, and wherein the command extraction module selects a first set of verbal commands responsive to the gesture information indicating that the hand or the forearm is located within the distance and selects a second set of verbal commands responsive to the gesture information indicating that the hand or the forearm is located beyond the distance. | 14. The command processing system of claim 9 , wherein the gesture information indicates whether a hand or forearm of the user is located within a distance from the depth camera or beyond the distance from the depth camera, and wherein the command extraction module selects a first set of verbal commands responsive to the gesture information indicating that the hand or the forearm is located within the distance and selects a second set of verbal commands responsive to the gesture information indicating that the hand or the forearm is located beyond the distance. 16. The command processing system of claim 14 , wherein the first set of verbal commands comprise a command for identifying or setting the point-of-interest for the navigation operations. | 0.939987 |
6,122,661 | 1 | 10 | 1. A system for facilitating information transfer between a host computer and a client computer via a server computer, comprising: a host computer comprising a memory within which a presentation space buffer storing computer display information is configured and a communications interface enabling information exchanges using data streams, including transmission of the presentation space buffer as a presentation space data stream; a client computer comprising a web browser application displaying a markup language document and forwarding user inputs; and a server computer topologically intermediate to the host computer and the client computer and comprising: a server application framework comprising a display control interfacing to the host computer via a communications medium over which data streams are exchanged, including the transmitted presentation space data stream, and a host extension converting the transmitted presentation space data stream into a markup language document having instructions that identify position information for a cursor on a Web page and for modifying the presentation space buffer in the host; and a web server application interfacing to the client computer via a network medium over which the markup language document is served and the forwarded user inputs received. | 1. A system for facilitating information transfer between a host computer and a client computer via a server computer, comprising: a host computer comprising a memory within which a presentation space buffer storing computer display information is configured and a communications interface enabling information exchanges using data streams, including transmission of the presentation space buffer as a presentation space data stream; a client computer comprising a web browser application displaying a markup language document and forwarding user inputs; and a server computer topologically intermediate to the host computer and the client computer and comprising: a server application framework comprising a display control interfacing to the host computer via a communications medium over which data streams are exchanged, including the transmitted presentation space data stream, and a host extension converting the transmitted presentation space data stream into a markup language document having instructions that identify position information for a cursor on a Web page and for modifying the presentation space buffer in the host; and a web server application interfacing to the client computer via a network medium over which the markup language document is served and the forwarded user inputs received. 10. A system according to claim 1, wherein the communications medium comprises a member of the group consisting of a direct link or a System Network Architecture compliant network. | 0.891827 |
9,275,640 | 38 | 43 | 38. A non-transitory computer-readable medium storing instructions for causing a processor of a speech processing system to: accept an original data representation of a time ordered collection of items from a first vocabulary, the original representation having been obtained by a first processing of an audio signal using the first vocabulary and comprising identification of occurrences of vocabulary items of a first vocabulary in time intervals of the audio signal in the form of a lattice or a transcript; accept a new vocabulary item not included in the original data representation obtained by the first processing of the audio signal using the first vocabulary; automatically identify, in the audio signal, a plurality of putative occurrences of the accepted new vocabulary item, including using the automatic speech processor to perform a second processing including identification of the plurality of putative occurrences in the time intervals of the audio signal in which the vocabulary items of the first vocabulary were identified in the original data representation by the first processing; and automatically process the original data representation of the time ordered collection of items from the first vocabulary and the identified plurality of putative occurrences of the new vocabulary item to form an augmented data representation of the time ordered collection of items. | 38. A non-transitory computer-readable medium storing instructions for causing a processor of a speech processing system to: accept an original data representation of a time ordered collection of items from a first vocabulary, the original representation having been obtained by a first processing of an audio signal using the first vocabulary and comprising identification of occurrences of vocabulary items of a first vocabulary in time intervals of the audio signal in the form of a lattice or a transcript; accept a new vocabulary item not included in the original data representation obtained by the first processing of the audio signal using the first vocabulary; automatically identify, in the audio signal, a plurality of putative occurrences of the accepted new vocabulary item, including using the automatic speech processor to perform a second processing including identification of the plurality of putative occurrences in the time intervals of the audio signal in which the vocabulary items of the first vocabulary were identified in the original data representation by the first processing; and automatically process the original data representation of the time ordered collection of items from the first vocabulary and the identified plurality of putative occurrences of the new vocabulary item to form an augmented data representation of the time ordered collection of items. 43. The method of claim 38 , wherein forming the augmented data representation includes inserting the new vocabulary item into the original data representation. | 0.652174 |
7,769,277 | 1 | 2 | 1. A non-transitory computer readable medium having an executable data structure for managing reproduction of text subtitle data by a reproducing apparatus, comprising: an area storing at least one main AV data and a plurality of subtitle information segments, each one of the subtitle information segments being represented by a single PES packet of transport packets which includes a packet identifier for identifying a type of packet, wherein each one of the subtitle information segments includes a segment identifier identifying the subtitle information segment as one of text data and graphic data, wherein one of the subtitle information segments identified as the text data includes at most two text subtitle regions, and each text subtitle region is linked to at least one style information defined in another one of the subtitle information segments identified as the text data using an identifier, wherein the other one of the subtitle information segments identified as the graphic data is multiplexed with the main AV data into a file. | 1. A non-transitory computer readable medium having an executable data structure for managing reproduction of text subtitle data by a reproducing apparatus, comprising: an area storing at least one main AV data and a plurality of subtitle information segments, each one of the subtitle information segments being represented by a single PES packet of transport packets which includes a packet identifier for identifying a type of packet, wherein each one of the subtitle information segments includes a segment identifier identifying the subtitle information segment as one of text data and graphic data, wherein one of the subtitle information segments identified as the text data includes at most two text subtitle regions, and each text subtitle region is linked to at least one style information defined in another one of the subtitle information segments identified as the text data using an identifier, wherein the other one of the subtitle information segments identified as the graphic data is multiplexed with the main AV data into a file. 2. The non-transitory computer readable medium of claim 1 , wherein a first subtitle information segment among the plurality of subtitle information segments identified as the text data includes a palette identifier identifying palette information for controlling color attributes of the subtitle area. | 0.609819 |
9,082,007 | 10 | 17 | 10. A computer program product for image recreation, the computer program product comprising at least one non-transitory computer-readable medium having computer-readable program code portions embodied therein, the computer-readable program code portions comprising: an executable portion configured for creating one or more generic control documents, wherein the generic control documents are blank templates of transaction documents, wherein transaction documents are checks; an executable portion configured for receiving an indication of a user transaction, wherein receiving an indication of the user transaction comprises receiving an image of the transaction documents associated with the user transaction; an executable portion configured for pulling metadata from the image of the transaction document, wherein metadata from the image of the transaction document includes text and numbers typed on the transaction document; an executable portion configured for determining if capturing images of image elements from the transaction document is necessary, wherein image elements are handwritten elements of the transaction document; an executable portion configured for capturing images of image elements from transaction document only when it is determined that capturing is necessary; an executable portion configured for receiving a request for an image of one or more of the transaction documents associated with the user transaction from the user; an executable portion configured for retrieving the metadata and the captured images from the transaction documents based on the request; an executable portion configured for determining an appropriate generic control document from the created one or more generic control documents, wherein the appropriate generic control document is based at least in part on the transaction document used by the user for the transaction; an executable portion configured for merging the retrieved metadata and the captured image data from the one or more transaction documents with the determined appropriate generic control document to create a generated image of the one or more transaction documents requested; and an executable portion configured for presenting the generated image of the one or more transaction documents requested to the user. | 10. A computer program product for image recreation, the computer program product comprising at least one non-transitory computer-readable medium having computer-readable program code portions embodied therein, the computer-readable program code portions comprising: an executable portion configured for creating one or more generic control documents, wherein the generic control documents are blank templates of transaction documents, wherein transaction documents are checks; an executable portion configured for receiving an indication of a user transaction, wherein receiving an indication of the user transaction comprises receiving an image of the transaction documents associated with the user transaction; an executable portion configured for pulling metadata from the image of the transaction document, wherein metadata from the image of the transaction document includes text and numbers typed on the transaction document; an executable portion configured for determining if capturing images of image elements from the transaction document is necessary, wherein image elements are handwritten elements of the transaction document; an executable portion configured for capturing images of image elements from transaction document only when it is determined that capturing is necessary; an executable portion configured for receiving a request for an image of one or more of the transaction documents associated with the user transaction from the user; an executable portion configured for retrieving the metadata and the captured images from the transaction documents based on the request; an executable portion configured for determining an appropriate generic control document from the created one or more generic control documents, wherein the appropriate generic control document is based at least in part on the transaction document used by the user for the transaction; an executable portion configured for merging the retrieved metadata and the captured image data from the one or more transaction documents with the determined appropriate generic control document to create a generated image of the one or more transaction documents requested; and an executable portion configured for presenting the generated image of the one or more transaction documents requested to the user. 17. The computer program product of claim 10 , wherein merging the retrieved stored data from the one or more transaction documents with the determined appropriate generic control document further comprises adding the text data from the retrieved stored data to the appropriate generic control document. | 0.670652 |
8,249,856 | 10 | 11 | 10. A method for computer-assisted translation from a source language to a target language, the method comprising: accepting a plurality of rules, each rule forming an association between a representation of a sequence of source language tokens with a corresponding tree-based structure in the target language, wherein the tree-based structure for each rule satisfies a tree-based constraint and includes at least one target language token associated with one or more source language tokens in the sequence of source language tokens for the rule; and decoding, using a computer, an input sequence of source tokens according to the plurality of rules to generate a representation of one or more output sequences of target language tokens, including for each of at least some sub-sequences of the input sequence of source tokens, determining a tree-based structure associated with the sub-sequence according to a match to one of the plurality of rules, and for each of at least some sub-sequences of the input sequence of source tokens, selecting for combination a subset of determined tree-based structures, each associated with a sub-sequence, such that a tree-based structure formed as a combination of the subset of partial trees satisfies the tree-based constraint, and determining the tree-based structure as the combination of the selected subset of tree-based structures. | 10. A method for computer-assisted translation from a source language to a target language, the method comprising: accepting a plurality of rules, each rule forming an association between a representation of a sequence of source language tokens with a corresponding tree-based structure in the target language, wherein the tree-based structure for each rule satisfies a tree-based constraint and includes at least one target language token associated with one or more source language tokens in the sequence of source language tokens for the rule; and decoding, using a computer, an input sequence of source tokens according to the plurality of rules to generate a representation of one or more output sequences of target language tokens, including for each of at least some sub-sequences of the input sequence of source tokens, determining a tree-based structure associated with the sub-sequence according to a match to one of the plurality of rules, and for each of at least some sub-sequences of the input sequence of source tokens, selecting for combination a subset of determined tree-based structures, each associated with a sub-sequence, such that a tree-based structure formed as a combination of the subset of partial trees satisfies the tree-based constraint, and determining the tree-based structure as the combination of the selected subset of tree-based structures. 11. The method of claim 10 wherein the tree based constraint comprises membership in one of a plurality of specified classes of tree-based structures. | 0.767081 |
8,478,578 | 1 | 5 | 1. A method for interpreting from a first language to a second language, comprising the steps of: receiving an input speech utterance in a first language on a first mobile communication device; conditioning said input speech utterance; first transmitting said conditioned input speech utterance to a server; recognizing said first transmitted speech utterance to generate a set of first recognition results; optimizing said recognition results by rescoring word-recognition lattice results in conjunction with interpretation lattice results to generate a set of second recognition results; interpreting said set of second recognition results by generating one or more interpretation results comprising abstract paraphrased specific concepts; translating said abstract paraphrased specific concepts into a form of a language-independent abstract interlingua; mapping the abstract paraphrased specific concepts from the language-independent interlingua to a second language in a first selected format; second transmitting said interpretation results in the first selected format to a second mobile communication device; and presenting said interpretation results in a second selected format on said second communication device. | 1. A method for interpreting from a first language to a second language, comprising the steps of: receiving an input speech utterance in a first language on a first mobile communication device; conditioning said input speech utterance; first transmitting said conditioned input speech utterance to a server; recognizing said first transmitted speech utterance to generate a set of first recognition results; optimizing said recognition results by rescoring word-recognition lattice results in conjunction with interpretation lattice results to generate a set of second recognition results; interpreting said set of second recognition results by generating one or more interpretation results comprising abstract paraphrased specific concepts; translating said abstract paraphrased specific concepts into a form of a language-independent abstract interlingua; mapping the abstract paraphrased specific concepts from the language-independent interlingua to a second language in a first selected format; second transmitting said interpretation results in the first selected format to a second mobile communication device; and presenting said interpretation results in a second selected format on said second communication device. 5. The method of claim 1 wherein in said first transmitting step, users' profile data and updates thereof are transmitted with said compressed input speech. | 0.695313 |
7,774,694 | 1 | 3 | 1. A computer-implemented method comprising: receiving a digital file having textual data; applying, by a processor, processing rules to the data to cause portions of the textual data to be inserted into an electronic document template having a plurality of insertion points, wherein applying the processing rules comprises comparing phrases encountered in the textual data to trigger phrases that, when encountered in the textual data and determined to be valid, cause subsequently encountered portions of the textual data to be inserted at pre-defined insertion points in the electronic document template, and wherein determined to be valid comprises applying rules associated with the insertion points that define conditions which must be met for the trigger phrases to be valid, and wherein the defined conditions include at least a first trigger phrase that when encountered while inserting text into a first insertion point, will cause subsequently encountered portions of the textual data to be continued to be inserted in the first insertion point, and that, when encountered while inserting text into a second insertion point that is different than the first insertion point, will cause subsequently encountered portions of the textual data to be inserted in a third insertion point that is different than the second insertion point. | 1. A computer-implemented method comprising: receiving a digital file having textual data; applying, by a processor, processing rules to the data to cause portions of the textual data to be inserted into an electronic document template having a plurality of insertion points, wherein applying the processing rules comprises comparing phrases encountered in the textual data to trigger phrases that, when encountered in the textual data and determined to be valid, cause subsequently encountered portions of the textual data to be inserted at pre-defined insertion points in the electronic document template, and wherein determined to be valid comprises applying rules associated with the insertion points that define conditions which must be met for the trigger phrases to be valid, and wherein the defined conditions include at least a first trigger phrase that when encountered while inserting text into a first insertion point, will cause subsequently encountered portions of the textual data to be continued to be inserted in the first insertion point, and that, when encountered while inserting text into a second insertion point that is different than the first insertion point, will cause subsequently encountered portions of the textual data to be inserted in a third insertion point that is different than the second insertion point. 3. The method of claim 1 , wherein the textual data comprises speech recognition results obtained through speech recognition processing on speech information. | 0.870704 |
9,250,805 | 10 | 18 | 10. A system for entering a string of symbols, the system comprising control circuitry configured to: generate for display a sequence of symbols arranged in a row, wherein the symbols are grouped in groupings; monitor user navigation between the groupings of symbols; determine a navigation pace based on the monitored user navigation, the navigation pace representing an interval of time taken by the user to navigate from a first grouping of symbols to a second grouping of symbols; receive a user input to navigate to a third grouping of symbols; and select symbols for the third grouping of symbols based on the determined navigation pace in response to receiving the user input. | 10. A system for entering a string of symbols, the system comprising control circuitry configured to: generate for display a sequence of symbols arranged in a row, wherein the symbols are grouped in groupings; monitor user navigation between the groupings of symbols; determine a navigation pace based on the monitored user navigation, the navigation pace representing an interval of time taken by the user to navigate from a first grouping of symbols to a second grouping of symbols; receive a user input to navigate to a third grouping of symbols; and select symbols for the third grouping of symbols based on the determined navigation pace in response to receiving the user input. 18. The system of claim 10 , wherein the sequence of symbols comprises a plurality of letters and a plurality of numbers. | 0.921935 |
4,495,566 | 1 | 2 | 1. A method using digital data processing means and stored textual block identifiers in a table for locating in a stored data base having a plurality of textual blocks, those textual blocks having the best match with a query, the textual blocks in the data base having words grouped into such textual blocks, the textual block identifiers being grouped and each group of textual block identifiers corresponding to one of the blocks in the stored data base, each of the textual block identifiers providing an indication of one of the textual blocks in the stored data base which contains the word corresponding to the group of textual block identifiers in which the textual block identifier is located, the method comprising the steps of: (a) receiving a query having representations of a plurality of query words to be located in the textual blocks contained in the stored data base; (b) determining, for each one of a plurality of the query words, at least one corresponding set of equivalent words which are contained in the stored data base, each of the equivalent words in such set being equivalent to the corresponding query word and corresponding to one of the groups of textual block identifiers; (c) processing the textual block identifiers contained in the groups of textual block identifiers which correspond to the words in the determined sets of equivalent words to thereby form a representation of a score for at least a first of the textual blocks which is represented by said textual block identifiers, the representation of a score representing the total number of said sets of equivalent words which have at least one of said equivalent words in said at least a first of the textual blocks; and (d) utilizing said representation of a score to provide output data pertaining to at least one textual block, for which a representation of a score has been formed. | 1. A method using digital data processing means and stored textual block identifiers in a table for locating in a stored data base having a plurality of textual blocks, those textual blocks having the best match with a query, the textual blocks in the data base having words grouped into such textual blocks, the textual block identifiers being grouped and each group of textual block identifiers corresponding to one of the blocks in the stored data base, each of the textual block identifiers providing an indication of one of the textual blocks in the stored data base which contains the word corresponding to the group of textual block identifiers in which the textual block identifier is located, the method comprising the steps of: (a) receiving a query having representations of a plurality of query words to be located in the textual blocks contained in the stored data base; (b) determining, for each one of a plurality of the query words, at least one corresponding set of equivalent words which are contained in the stored data base, each of the equivalent words in such set being equivalent to the corresponding query word and corresponding to one of the groups of textual block identifiers; (c) processing the textual block identifiers contained in the groups of textual block identifiers which correspond to the words in the determined sets of equivalent words to thereby form a representation of a score for at least a first of the textual blocks which is represented by said textual block identifiers, the representation of a score representing the total number of said sets of equivalent words which have at least one of said equivalent words in said at least a first of the textual blocks; and (d) utilizing said representation of a score to provide output data pertaining to at least one textual block, for which a representation of a score has been formed. 2. A method according to claim 1 wherein the textual blocks comprise paragraphs and wherein the step of utilizing comprises the step of outputting the paragraphs as the textual blocks. | 0.848185 |
7,779,003 | 1 | 5 | 1. In a health care enterprise, a computerized provider order entry system for receiving one or more search terms from a health care provider and finding an order for providing a medication or medical service related to the one or more search terms, comprising: a repository including a plurality of records identifying a corresponding plurality of medications or medical services available for order, a record of an individual medication or medical service available for order including a plurality of related text terms describing order related parameters, including terms identifying a treatment and at least one of: (a) a diagnosis code associated with the medication or medical service available for order, (b) a medical condition associated with the medication or medical service available for order, and (c) a medical problem associated with the medication or medical service available for order; a search processor for searching said plurality of records to find candidate medications or medical services available for order corresponding to the one or more health care provider entered search terms by: determining a relative frequency of occurrence of respective ones of the one or more search terms in the related text terms of corresponding records of candidate medications or medical services available for order; summing data representing the relative frequency of occurrence of the respective ones of the one or more search terms to provide data representing a summed relative frequency of the one or more search terms in corresponding records of candidate medications or medical services available for order; identifying and prioritizing candidate medications or medical services available for order in response to the summed relative frequency of occurrence of said health care provider entered search terms in corresponding records of said candidate medications or medical services available for order; and ranking said identified and prioritized candidate medications or medical services available for order in response to a relative frequency of ordering of said identified and prioritized candidate medications or medical services available for use by health care providers; wherein said search processor alters search result ranking based on voting mechanisms for said medications or medical services available for order, said voting achieved by at least one of (a) selection of an item for order in normal use and (b) manual adjustment of priority weighting of that item for order; and an output processor for providing search result data representing said ranked, identified and prioritized candidate medications or medical services. | 1. In a health care enterprise, a computerized provider order entry system for receiving one or more search terms from a health care provider and finding an order for providing a medication or medical service related to the one or more search terms, comprising: a repository including a plurality of records identifying a corresponding plurality of medications or medical services available for order, a record of an individual medication or medical service available for order including a plurality of related text terms describing order related parameters, including terms identifying a treatment and at least one of: (a) a diagnosis code associated with the medication or medical service available for order, (b) a medical condition associated with the medication or medical service available for order, and (c) a medical problem associated with the medication or medical service available for order; a search processor for searching said plurality of records to find candidate medications or medical services available for order corresponding to the one or more health care provider entered search terms by: determining a relative frequency of occurrence of respective ones of the one or more search terms in the related text terms of corresponding records of candidate medications or medical services available for order; summing data representing the relative frequency of occurrence of the respective ones of the one or more search terms to provide data representing a summed relative frequency of the one or more search terms in corresponding records of candidate medications or medical services available for order; identifying and prioritizing candidate medications or medical services available for order in response to the summed relative frequency of occurrence of said health care provider entered search terms in corresponding records of said candidate medications or medical services available for order; and ranking said identified and prioritized candidate medications or medical services available for order in response to a relative frequency of ordering of said identified and prioritized candidate medications or medical services available for use by health care providers; wherein said search processor alters search result ranking based on voting mechanisms for said medications or medical services available for order, said voting achieved by at least one of (a) selection of an item for order in normal use and (b) manual adjustment of priority weighting of that item for order; and an output processor for providing search result data representing said ranked, identified and prioritized candidate medications or medical services. 5. A system according to claim 1 , wherein said orders are orders for providing particular medical treatments for a patient and said order related parameters identify at least one of, (a) order urgency and (b) associated order instructions. | 0.827089 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.