patent_num
int64 3.93M
10.2M
| claim_num1
int64 1
519
| claim_num2
int64 2
520
| sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
1
|
|---|---|---|---|---|---|
8,572,024 | 1 | 12 | 1. A computer-implemented method of extracting information from co-occurring Hyper Text Mark-up Language (HTML) structured documents, the method comprising: receiving one or more web sites selected by a user for data extraction; collecting a plurality of co-occurring different HTML structured documents for each of the selected web sites at a computer comprising a processor; forming a plurality of clusters comprising different subsets of the co-occurring HTML structured documents, wherein: each cluster comprises a different HTML structured document of the plurality of co-occurring HTML structured documents as a centroid document and other HTML structured documents of the plurality of co-occurring HTML structured documents that achieve a threshold of similarity with respect to the centroid document, the clusters are formed by comparing each co-occurring HTML structured document to each centroid document of each cluster, and an alignment algorithm is used to determine the co-occurring HTML structured documents that achieve the threshold of similarity with respect to each centroid document by comparing structured locations of data fields for storing data elements within each centroid document and structured locations of corresponding data fields for storing data elements within each of the co-occurring HTML structured documents, the co-occurring HTML structured documents are compared to each centroid document based on similarity of structured locations of corresponding data fields within the HTML data structures, displaying the centroid document of a particular cluster selected from a list of clusters; and providing a user interface displaying content of data elements identified from the other HTML structured documents of the particular cluster on a computer display. | 1. A computer-implemented method of extracting information from co-occurring Hyper Text Mark-up Language (HTML) structured documents, the method comprising: receiving one or more web sites selected by a user for data extraction; collecting a plurality of co-occurring different HTML structured documents for each of the selected web sites at a computer comprising a processor; forming a plurality of clusters comprising different subsets of the co-occurring HTML structured documents, wherein: each cluster comprises a different HTML structured document of the plurality of co-occurring HTML structured documents as a centroid document and other HTML structured documents of the plurality of co-occurring HTML structured documents that achieve a threshold of similarity with respect to the centroid document, the clusters are formed by comparing each co-occurring HTML structured document to each centroid document of each cluster, and an alignment algorithm is used to determine the co-occurring HTML structured documents that achieve the threshold of similarity with respect to each centroid document by comparing structured locations of data fields for storing data elements within each centroid document and structured locations of corresponding data fields for storing data elements within each of the co-occurring HTML structured documents, the co-occurring HTML structured documents are compared to each centroid document based on similarity of structured locations of corresponding data fields within the HTML data structures, displaying the centroid document of a particular cluster selected from a list of clusters; and providing a user interface displaying content of data elements identified from the other HTML structured documents of the particular cluster on a computer display. 12. The method of claim 1 , further comprising using the alignment algorithm to extract the data element identified on each of the other HTML structured documents that corresponds to the marked data element on the centroid document of the particular cluster. | 0.91773 |
8,441,454 | 1 | 3 | 1. A text entry system comprising: a user input device comprising: an auto-correcting keyboard region comprising a plurality of the characters of a character set, wherein locations having known coordinates in the auto-correcting keyboard region are associated with one or more of the character set members, wherein a location is determined when a user interacts with the user input device within the auto-correcting keyboard region and the determined interaction location is added to a current input sequence; and a memory containing a plurality of objects, wherein one or more objects comprise a string of one or a plurality of characters forming all or part of a word or phrase; an output device; and a processor coupled to the user input device, memory, and output device, said processor comprising: a distance value calculation component which, for a determined interaction location in said current input sequence, calculates a set of distance values between the interaction location and the known coordinate locations corresponding to one or a plurality of characters within the auto-correcting region; an object evaluation component which, for said current input sequence, identifies one or a plurality of candidate objects in memory, and for one or more identified candidate objects, evaluates identified candidate objects by calculating a matching metric for each candidate object by summing the distance values calculated from each interaction location in the input sequence to the location assigned to the character in the corresponding position of the candidate object and applying a weighting function, wherein the weighting function comprises multiplying the sum of the distance values by the base 2 logarithm of the ordinal ranking of the object, and, if more than one candidate object is identified, ranks the evaluated candidate objects based on the calculated matching metric values; and a selection component for identifying candidate objects according to their evaluated ranking, presenting any identified objects to the user, and enabling the user to select from among any presented objects for output to the output device. | 1. A text entry system comprising: a user input device comprising: an auto-correcting keyboard region comprising a plurality of the characters of a character set, wherein locations having known coordinates in the auto-correcting keyboard region are associated with one or more of the character set members, wherein a location is determined when a user interacts with the user input device within the auto-correcting keyboard region and the determined interaction location is added to a current input sequence; and a memory containing a plurality of objects, wherein one or more objects comprise a string of one or a plurality of characters forming all or part of a word or phrase; an output device; and a processor coupled to the user input device, memory, and output device, said processor comprising: a distance value calculation component which, for a determined interaction location in said current input sequence, calculates a set of distance values between the interaction location and the known coordinate locations corresponding to one or a plurality of characters within the auto-correcting region; an object evaluation component which, for said current input sequence, identifies one or a plurality of candidate objects in memory, and for one or more identified candidate objects, evaluates identified candidate objects by calculating a matching metric for each candidate object by summing the distance values calculated from each interaction location in the input sequence to the location assigned to the character in the corresponding position of the candidate object and applying a weighting function, wherein the weighting function comprises multiplying the sum of the distance values by the base 2 logarithm of the ordinal ranking of the object, and, if more than one candidate object is identified, ranks the evaluated candidate objects based on the calculated matching metric values; and a selection component for identifying candidate objects according to their evaluated ranking, presenting any identified objects to the user, and enabling the user to select from among any presented objects for output to the output device. 3. The system of claim 1 , wherein one or more of the plurality of objects in said memory are further associated with one or a plurality of modules, wherein each module comprises or generates a set of objects having one or a plurality of common characteristics. | 0.752372 |
9,444,935 | 29 | 31 | 29. A non-transitory computer-readable medium storing a set of instructions that when executed cause a computer to perform a method comprising: generating a plurality of test scripts, a test script from among the plurality of test scripts generated by performing: initiating a voice call interaction with a speech application, the speech application comprising a network of interaction nodes; and repeatedly performing, until a stopping condition is encountered, the steps of: executing the voice call interaction with the speech application by traversing through one or more interaction nodes from among the network of interaction nodes until an interaction node requiring a response is encountered; selecting an utterance generation mode corresponding to the interaction node; determining a response to be provided corresponding to the interaction node of the speech application based on the utterance generation mode; and providing the response to the speech application, wherein the test script comprises instructions for traversing interaction nodes involved during a course of the voice call interaction, and, instructions for provisioning one or more responses to the speech application during the course of the voice call interaction; identifying one or more test scripts from among the plurality of test scripts based on a pre-determined objective; and providing the one or more test scripts to a user for facilitating testing of the speech application. | 29. A non-transitory computer-readable medium storing a set of instructions that when executed cause a computer to perform a method comprising: generating a plurality of test scripts, a test script from among the plurality of test scripts generated by performing: initiating a voice call interaction with a speech application, the speech application comprising a network of interaction nodes; and repeatedly performing, until a stopping condition is encountered, the steps of: executing the voice call interaction with the speech application by traversing through one or more interaction nodes from among the network of interaction nodes until an interaction node requiring a response is encountered; selecting an utterance generation mode corresponding to the interaction node; determining a response to be provided corresponding to the interaction node of the speech application based on the utterance generation mode; and providing the response to the speech application, wherein the test script comprises instructions for traversing interaction nodes involved during a course of the voice call interaction, and, instructions for provisioning one or more responses to the speech application during the course of the voice call interaction; identifying one or more test scripts from among the plurality of test scripts based on a pre-determined objective; and providing the one or more test scripts to a user for facilitating testing of the speech application. 31. The computer-readable medium of claim 29 , wherein the utterance generation mode is selected from one of: a no-input mode, the no-input mode signifying a provisioning of a blank input as the response; a matching input mode, the matching input mode signifying a provisioning of an utterance matching a speech application grammar associated with the interaction node as the response; and a non-matching input mode, the non-matching input mode signifying a provisioning of an utterance not matching a speech application grammar associated with the interaction node as the response. | 0.525285 |
9,762,404 | 2 | 6 | 2. The computer implemented method of claim 1 , wherein the communication instance includes a plurality of communication participants, and wherein the computer implemented method further comprises providing a graphical user interface providing an image of the communication participant and a respective icon associated with the at least two differing contextual information types. | 2. The computer implemented method of claim 1 , wherein the communication instance includes a plurality of communication participants, and wherein the computer implemented method further comprises providing a graphical user interface providing an image of the communication participant and a respective icon associated with the at least two differing contextual information types. 6. The computer implemented method of claim 2 , further comprising receiving in the request the identity of the communication participant. | 0.970156 |
9,710,539 | 1 | 2 | 1. A computer implemented method for performing email analytics on a configured email repository, the computer implemented method comprising: grouping, by a processor, emails in the configured email repository, into a plurality of mail groups based on identifying similarity of content in the emails, wherein each of the plurality mail groups is associated with a timeline; determining, by the processor, a network graph for each of the plurality of mail groups based on a header information of emails within each of the plurality of mail groups, wherein the network graph indicates an association of the emails in the plurality of mail groups; and performing, by the processor, email analytics on the plurality of mail groups, wherein the performing includes: clustering, by the processor, the plurality of mail groups into a plurality of mail clusters based on a temporal analysis of the emails within each of the email groups, wherein the temporal analysis identifies a temporal progression of the emails over the timeline of each of the plurality of mail groups by computing activity density distribution of each of the plurality of mail groups, and wherein the plurality of mail clusters are plotted as activity density distribution graphs; determining, by the processor, key phrases from content of emails in the plurality of mail groups in each of the plurality of mail clusters; and associating, by the processor, the key phrases with the network graph of each of plurality of mail groups, wherein the key phrases are indicative of type of activity and state of activity in each of the plurality of mail groups. | 1. A computer implemented method for performing email analytics on a configured email repository, the computer implemented method comprising: grouping, by a processor, emails in the configured email repository, into a plurality of mail groups based on identifying similarity of content in the emails, wherein each of the plurality mail groups is associated with a timeline; determining, by the processor, a network graph for each of the plurality of mail groups based on a header information of emails within each of the plurality of mail groups, wherein the network graph indicates an association of the emails in the plurality of mail groups; and performing, by the processor, email analytics on the plurality of mail groups, wherein the performing includes: clustering, by the processor, the plurality of mail groups into a plurality of mail clusters based on a temporal analysis of the emails within each of the email groups, wherein the temporal analysis identifies a temporal progression of the emails over the timeline of each of the plurality of mail groups by computing activity density distribution of each of the plurality of mail groups, and wherein the plurality of mail clusters are plotted as activity density distribution graphs; determining, by the processor, key phrases from content of emails in the plurality of mail groups in each of the plurality of mail clusters; and associating, by the processor, the key phrases with the network graph of each of plurality of mail groups, wherein the key phrases are indicative of type of activity and state of activity in each of the plurality of mail groups. 2. The computer implemented method as claimed in claim 1 , wherein the key phrases are associated with the network graph by the processor using tag-clouds identifying the key phrases in accordance with a predetermined importance. | 0.79806 |
8,037,055 | 1 | 9 | 1. A method performed by a website server system having one or more processors and memory storing one or more programs for execution by the one or more processors, comprising: accessing one or more sources of document information, wherein the one or more sources of document information are associated with a website server; extracting the document information including metadata from the sources; generating a sitemap of a website at the website server, the sitemap including a list of documents and corresponding metadata for each of a plurality of documents in the list of documents based on the document information; storing the sitemap at a location; and transmitting a notification from the website server to a remote computer associated with a web crawler system, the notification including information that identifies the location of the sitemap, the notification functioning as an indication that the sitemap is available for access. | 1. A method performed by a website server system having one or more processors and memory storing one or more programs for execution by the one or more processors, comprising: accessing one or more sources of document information, wherein the one or more sources of document information are associated with a website server; extracting the document information including metadata from the sources; generating a sitemap of a website at the website server, the sitemap including a list of documents and corresponding metadata for each of a plurality of documents in the list of documents based on the document information; storing the sitemap at a location; and transmitting a notification from the website server to a remote computer associated with a web crawler system, the notification including information that identifies the location of the sitemap, the notification functioning as an indication that the sitemap is available for access. 9. The method of claim 1 , wherein generating the sitemap comprises generating a list of documents modified after a particular time. | 0.818182 |
8,176,032 | 5 | 6 | 5. The computer-implemented method of claim 1 , further comprising: associating a score value with the search query category based on the change in the search request frequency associated with the search query category; assigning a rank to the search query category based the associated score value; and identifying the search query category, based on the rank of the search query category, as reflecting heightened user interest. | 5. The computer-implemented method of claim 1 , further comprising: associating a score value with the search query category based on the change in the search request frequency associated with the search query category; assigning a rank to the search query category based the associated score value; and identifying the search query category, based on the rank of the search query category, as reflecting heightened user interest. 6. The computer-implemented method of claim 5 wherein associating the score value associated with the search query category is based on an absolute frequency associated with the search query category, wherein the absolute frequency is the number of search queries detected during the time interval associated with the search query category. | 0.848079 |
8,812,974 | 1 | 3 | 1. A computer-implemented method to manage properties in a dialog from various sources, the computer-implemented method comprising: creating, by one or more processors, a widget properties dialog; receiving properties and validation rules from each source of one or more sources that are associated with the widget properties dialog to form received information, wherein each source is one of a dashboard application or a content provider; creating, by the one or more processors, a group of tabs in the widget properties dialog using the received information, wherein the group of tabs contains a general tab and a group of content tabs, wherein the general tab is associated the dashboard application, wherein each content tab is specific to an instance of a content provider that comprises one of the one or more sources of the received information for the respective content tab, and wherein each content tab is specific to an instance of a content type that is associated with at least one content-specific feature of an object received from the instance of the content provider for the respective content tab; determining, by the one or more processors, whether a change to the widget properties dialog is confirmed, wherein the change includes one or more alterations to property information from the one or more sources; after the change to the widget properties dialog is confirmed, validating each tab in the group of tabs using the validation rules to generate a changed widget, wherein validating each tab comprises using the validation rules to validate the one or more alterations to the property information of the change; and presenting, by the one or more processors, the changed widget for display in a user interface. | 1. A computer-implemented method to manage properties in a dialog from various sources, the computer-implemented method comprising: creating, by one or more processors, a widget properties dialog; receiving properties and validation rules from each source of one or more sources that are associated with the widget properties dialog to form received information, wherein each source is one of a dashboard application or a content provider; creating, by the one or more processors, a group of tabs in the widget properties dialog using the received information, wherein the group of tabs contains a general tab and a group of content tabs, wherein the general tab is associated the dashboard application, wherein each content tab is specific to an instance of a content provider that comprises one of the one or more sources of the received information for the respective content tab, and wherein each content tab is specific to an instance of a content type that is associated with at least one content-specific feature of an object received from the instance of the content provider for the respective content tab; determining, by the one or more processors, whether a change to the widget properties dialog is confirmed, wherein the change includes one or more alterations to property information from the one or more sources; after the change to the widget properties dialog is confirmed, validating each tab in the group of tabs using the validation rules to generate a changed widget, wherein validating each tab comprises using the validation rules to validate the one or more alterations to the property information of the change; and presenting, by the one or more processors, the changed widget for display in a user interface. 3. The computer-implemented method of claim 1 , wherein receiving properties and validation rules from each source associated with the widget properties dialog to form received information further comprises: requesting properties from each source; determining whether general information and content information is received; and responsive to a determination that general information and content information is received, receiving the properties in one of a JavaScript Object Notation and a XML (extensible markup language) specification form. | 0.685035 |
10,089,289 | 1 | 6 | 1. A method comprising: receiving presentation data from a client device, the presentation data including a set of presentation elements; generating a composite presentation, based on the presentation data, the composite presentation comprising an arrangement of the set of presentation elements that includes a first presentation element at a location among the arrangement of set of presentation elements; causing display of a graphical user interface that comprises a first region and a second region at a group of devices, the first region of the graphical user interface comprising a display of the composite presentation that includes the first presentation element at the location among the arrangement of the set of presentation elements, and the second region of the graphical user interface comprising a newsfeed to display annotations on the composite presentation; receiving a selection of the first presentation element from a first device from among the group of devices, the selection including a user input onto the composite presentation; causing display of a request for annotation data at the first device in response to the receiving the selection of the first presentation element from the first device; receiving a response to the request from the first device, the response to the request comprising the annotation data, the annotation data including at least an indication of an annotation type, and an identifier associated with the first device; storing the annotation data at a memory location associated with the first client device; causing display of a notification element at the location corresponding to the first presentation element among the arrangement of the set of presentation elements within the composite presentation in response to the receiving the annotation data, the notification element comprising a graphical icon selected based on the annotation type, and including an annotation identifier and the identifier associated with the first client device; updating the newsfeed within the second region of the graphical user interface to include a depiction of the annotation data that comprises the annotation identifier and the identifier associated with the first client device; receiving a selection of the notification element; and responsive to receiving the selection, presenting the annotation data associated with the notification element within the second region of the graphical user interface. | 1. A method comprising: receiving presentation data from a client device, the presentation data including a set of presentation elements; generating a composite presentation, based on the presentation data, the composite presentation comprising an arrangement of the set of presentation elements that includes a first presentation element at a location among the arrangement of set of presentation elements; causing display of a graphical user interface that comprises a first region and a second region at a group of devices, the first region of the graphical user interface comprising a display of the composite presentation that includes the first presentation element at the location among the arrangement of the set of presentation elements, and the second region of the graphical user interface comprising a newsfeed to display annotations on the composite presentation; receiving a selection of the first presentation element from a first device from among the group of devices, the selection including a user input onto the composite presentation; causing display of a request for annotation data at the first device in response to the receiving the selection of the first presentation element from the first device; receiving a response to the request from the first device, the response to the request comprising the annotation data, the annotation data including at least an indication of an annotation type, and an identifier associated with the first device; storing the annotation data at a memory location associated with the first client device; causing display of a notification element at the location corresponding to the first presentation element among the arrangement of the set of presentation elements within the composite presentation in response to the receiving the annotation data, the notification element comprising a graphical icon selected based on the annotation type, and including an annotation identifier and the identifier associated with the first client device; updating the newsfeed within the second region of the graphical user interface to include a depiction of the annotation data that comprises the annotation identifier and the identifier associated with the first client device; receiving a selection of the notification element; and responsive to receiving the selection, presenting the annotation data associated with the notification element within the second region of the graphical user interface. 6. The method of claim 1 , wherein the method further comprises: receiving a follow request on the annotation from a second user; receiving a comment on the annotation; and notifying the second user of the comment. | 0.815517 |
7,761,408 | 12 | 13 | 12. The system of claim 9 , further comprising: a temporal profile maintaining time-related data; a general profile maintaining general data about the user of the user device; and an application profile maintaining data related to applications that the user of the user device has launched and activities that the user of the user device has engaged in while using the applications. | 12. The system of claim 9 , further comprising: a temporal profile maintaining time-related data; a general profile maintaining general data about the user of the user device; and an application profile maintaining data related to applications that the user of the user device has launched and activities that the user of the user device has engaged in while using the applications. 13. The system of claim 12 , wherein at least one keyword is obtained from at least one of analyzing information from the temporal profile, analyzing information from the general profile, and analyzing information from the application profile. | 0.883173 |
9,053,703 | 1 | 7 | 1. A system comprising: one or more computer processors; and one or more non-transitory computer readable devices that include instructions that, when executed by the one or more computer processors, cause the one or more processors to perform operations, the operations comprising: receiving, at a computer system, a request to generate or modify a target acoustic model for a target language; accessing, by the computer system, a source acoustic model for a source language, wherein the source acoustic model includes information that maps acoustic features of the source language to phonemes in a transformed feature space; aligning, using the source acoustic model in the transformed feature space, untransformed voice data in the target language with phonemes in a corresponding textual transcript to obtain aligned voice data, wherein the untransformed voice data is in an untransformed feature space; transforming the aligned voice data according to a particular transform operation using the source acoustic model to obtain transformed voice data; adapting the source acoustic model to the target language, using the untransformed voice data in the target language, to obtain an adapted acoustic model; and training, by the computer system, a target acoustic model for the target language using the transformed voice data and the adapted acoustic model; and providing the target acoustic model in association with the target language. | 1. A system comprising: one or more computer processors; and one or more non-transitory computer readable devices that include instructions that, when executed by the one or more computer processors, cause the one or more processors to perform operations, the operations comprising: receiving, at a computer system, a request to generate or modify a target acoustic model for a target language; accessing, by the computer system, a source acoustic model for a source language, wherein the source acoustic model includes information that maps acoustic features of the source language to phonemes in a transformed feature space; aligning, using the source acoustic model in the transformed feature space, untransformed voice data in the target language with phonemes in a corresponding textual transcript to obtain aligned voice data, wherein the untransformed voice data is in an untransformed feature space; transforming the aligned voice data according to a particular transform operation using the source acoustic model to obtain transformed voice data; adapting the source acoustic model to the target language, using the untransformed voice data in the target language, to obtain an adapted acoustic model; and training, by the computer system, a target acoustic model for the target language using the transformed voice data and the adapted acoustic model; and providing the target acoustic model in association with the target language. 7. The system of claim 1 , wherein the target language and the source language comprise different dialects of a common language. | 0.837975 |
9,700,276 | 1 | 10 | 1. A computer-implemented method for tracking one or more catheter objects in a sequence of images, the method comprising: determining, by a computer, a foreground portion of the first image comprising portions of the first image corresponding to one or more catheter electrode locations; determining, by the computer, a background portion of the first image which excludes the foreground portion; applying, by the computer, a steerable filter or a pre-processing method to the background portion of the first image to create a non-catheter structures mask which excludes ridge-like structures in the background portion of the first image; generating, by the computer, a dictionary based on catheter object locations in the first image, wherein sparse coding is used to represent the non-catheter structures mask as a plurality of basis vectors in the dictionary; identifying, by the computer, one or more catheter object landmark candidates in the sequence of images; generating, by the computer, a plurality of tracking hypothesis for the catheter object landmark candidates; generating, by the computer, a voting score for the catheter object landmark candidates based on a voting contribution of each of a plurality of image patches used to localize the catheter object locations in the first image; and selecting, by the computer, a first tracking hypothesis from the plurality of tracking hypothesis based on the dictionary and the voting score. | 1. A computer-implemented method for tracking one or more catheter objects in a sequence of images, the method comprising: determining, by a computer, a foreground portion of the first image comprising portions of the first image corresponding to one or more catheter electrode locations; determining, by the computer, a background portion of the first image which excludes the foreground portion; applying, by the computer, a steerable filter or a pre-processing method to the background portion of the first image to create a non-catheter structures mask which excludes ridge-like structures in the background portion of the first image; generating, by the computer, a dictionary based on catheter object locations in the first image, wherein sparse coding is used to represent the non-catheter structures mask as a plurality of basis vectors in the dictionary; identifying, by the computer, one or more catheter object landmark candidates in the sequence of images; generating, by the computer, a plurality of tracking hypothesis for the catheter object landmark candidates; generating, by the computer, a voting score for the catheter object landmark candidates based on a voting contribution of each of a plurality of image patches used to localize the catheter object locations in the first image; and selecting, by the computer, a first tracking hypothesis from the plurality of tracking hypothesis based on the dictionary and the voting score. 10. The method of claim 1 , wherein the sequence of images comprises a plurality of fluoroscopic images. | 0.933248 |
9,405,866 | 1 | 14 | 1. A method, comprising: running an environment for designing operation of circuitry, wherein running the environment comprises performing at least the following for providing simulations and evaluations of one or more user-defined modules of circuitry comprising one or more pipeline stages in a pipeline: automatically generating a model of the pipeline by using a pipeline block diagram, where the model is generated in a high-level modeling language able to perform simulations of circuitry with the pipeline; automatically generating an interface between the one or more user-defined modules and the generated model of the pipeline, the interface comprising access to the pipeline, wherein the pipeline access allows the one or more user-defined modules to interact indirectly; performing evaluation of the one or more user-defined modules using the automatically generated model of the pipeline and the automatically generated interface; and directly connecting the user-defined modules to ports allowing the one or more user-defined modules to interact directly to replace the pipeline access between the one or more user-defined modules and the generated model of the pipeline. | 1. A method, comprising: running an environment for designing operation of circuitry, wherein running the environment comprises performing at least the following for providing simulations and evaluations of one or more user-defined modules of circuitry comprising one or more pipeline stages in a pipeline: automatically generating a model of the pipeline by using a pipeline block diagram, where the model is generated in a high-level modeling language able to perform simulations of circuitry with the pipeline; automatically generating an interface between the one or more user-defined modules and the generated model of the pipeline, the interface comprising access to the pipeline, wherein the pipeline access allows the one or more user-defined modules to interact indirectly; performing evaluation of the one or more user-defined modules using the automatically generated model of the pipeline and the automatically generated interface; and directly connecting the user-defined modules to ports allowing the one or more user-defined modules to interact directly to replace the pipeline access between the one or more user-defined modules and the generated model of the pipeline. 14. The method of claim 1 , wherein: performing evaluation further comprises storing all instructions in a table in a sorted manner based on their corresponding sequence numbers and having stages where instructions residing in the stages point to the table entries, and pre-computing any conditions dependent on topology of pipeline block diagrams and attributes. | 0.789931 |
9,270,778 | 9 | 15 | 9. An apparatus comprising: a computer configured to (i) gather information by observing one or more behaviors of two or more observed users among a plurality of users of a social network, wherein said behaviors include at least one of (a) one or more reactions to content presented to said observed users, (b) one or more content created by said observed users and (c) one or more connections established by said observed users, (ii) generate a plurality of profiles of said observed users based on said information, wherein said behaviors are associated with a plurality of scale factors, respectively, (iii) update said profiles by refining said scale factors and (iv) match two or more of said observed users based on said profiles as updated; and an interface to a communication network configured to provide communications between said computer and said observed users that were matched, wherein said reactions are selected by said observed users from a set comprising (i) one or more levels of satisfaction, (ii) a neutral reaction and (iii) one or more levels of dissatisfaction. | 9. An apparatus comprising: a computer configured to (i) gather information by observing one or more behaviors of two or more observed users among a plurality of users of a social network, wherein said behaviors include at least one of (a) one or more reactions to content presented to said observed users, (b) one or more content created by said observed users and (c) one or more connections established by said observed users, (ii) generate a plurality of profiles of said observed users based on said information, wherein said behaviors are associated with a plurality of scale factors, respectively, (iii) update said profiles by refining said scale factors and (iv) match two or more of said observed users based on said profiles as updated; and an interface to a communication network configured to provide communications between said computer and said observed users that were matched, wherein said reactions are selected by said observed users from a set comprising (i) one or more levels of satisfaction, (ii) a neutral reaction and (iii) one or more levels of dissatisfaction. 15. The apparatus according to claim 9 , wherein said computer is further configured to establish a new behavior in response to said information not matching any of said behaviors already known. | 0.75 |
6,049,799 | 20 | 28 | 20. An apparatus for managing links to documents within a network of nodes, the nodes including a user station, file server, and directory services server, the apparatus comprising: the user station programmed to execute a link management module for searching through multiple environments across the network to find and link a lost document to the user station; a file server storing a plurality of documents, including the lost document; a directory services system comprising a directory services database, containing directory services objects, including a document location object, being an instance of a directory services object, linked together in a hierarchy, and programmed to execute a search engine effective to search the directory services database for the directory services objects associated with the lost document the link management module being independent from the directory services system and programmed to query the directory services system to find the document location object corresponding to the lost document. | 20. An apparatus for managing links to documents within a network of nodes, the nodes including a user station, file server, and directory services server, the apparatus comprising: the user station programmed to execute a link management module for searching through multiple environments across the network to find and link a lost document to the user station; a file server storing a plurality of documents, including the lost document; a directory services system comprising a directory services database, containing directory services objects, including a document location object, being an instance of a directory services object, linked together in a hierarchy, and programmed to execute a search engine effective to search the directory services database for the directory services objects associated with the lost document the link management module being independent from the directory services system and programmed to query the directory services system to find the document location object corresponding to the lost document. 28. The apparatus of claim 20, wherein the link management module further comprises a similarity selector for selecting a similar document having a similarity to the document. | 0.840619 |
9,286,295 | 9 | 12 | 9. A method of file and document retrieval comprising; scanning a first layer of a multi-layer scannable tag by a camera or scanning device; or receiving an indication that the multi-layer scannable tag has been scanned by a first user; assigning the first layer of the multi-layer scannable tag to the first user; receiving an image, audio, video, or other file from the first user; storing the image, audio, video, or other file in a location in cloud storage; generating one unique URL link wherein that URL link is associated with the multi-layer scannable tag, the URL link also pointing to the location in cloud storage; linking the multi-layer scannable tag with the location in cloud storage using the URL link; tagging the image, audio, video, or other file with said multi-layer scannable tag; wherein such tagging is accomplished by means of the use of a mobile application, computer program or similar electronic device; retrieving video, audio or other files tagged and associated with said first layer of the multi-layer scannable tag; playing the video, audio or other file tagged with said multi-layer scannable tag by embedded player; scanning another layer of a multi-layer scannable tag by a camera or scanning device; or receiving an indication that the multi-layer scannable tag has been scanned by a second user; assigning the another layer of the multi-layer scannable tag to the second user; receiving an image, audio, video, or other file from the second user; storing the image, audio, video, or other file in a location in cloud storage; generating one unique URL link wherein that URL link is associated with the multi-layer scannable tag, the URL link also pointing to the location in cloud storage; and linking the multi-layer scannable tag with the location in cloud storage using the URL link. | 9. A method of file and document retrieval comprising; scanning a first layer of a multi-layer scannable tag by a camera or scanning device; or receiving an indication that the multi-layer scannable tag has been scanned by a first user; assigning the first layer of the multi-layer scannable tag to the first user; receiving an image, audio, video, or other file from the first user; storing the image, audio, video, or other file in a location in cloud storage; generating one unique URL link wherein that URL link is associated with the multi-layer scannable tag, the URL link also pointing to the location in cloud storage; linking the multi-layer scannable tag with the location in cloud storage using the URL link; tagging the image, audio, video, or other file with said multi-layer scannable tag; wherein such tagging is accomplished by means of the use of a mobile application, computer program or similar electronic device; retrieving video, audio or other files tagged and associated with said first layer of the multi-layer scannable tag; playing the video, audio or other file tagged with said multi-layer scannable tag by embedded player; scanning another layer of a multi-layer scannable tag by a camera or scanning device; or receiving an indication that the multi-layer scannable tag has been scanned by a second user; assigning the another layer of the multi-layer scannable tag to the second user; receiving an image, audio, video, or other file from the second user; storing the image, audio, video, or other file in a location in cloud storage; generating one unique URL link wherein that URL link is associated with the multi-layer scannable tag, the URL link also pointing to the location in cloud storage; and linking the multi-layer scannable tag with the location in cloud storage using the URL link. 12. The document retrieval method of claim 9 , wherein the multi-layer scannable tag is shared through various social media websites and available to view through the use of an embedded player. | 0.645221 |
8,210,850 | 14 | 16 | 14. A literacy system for teaching reading skills to a user, the literacy system being implemented on a computer system including a computer-readable storage medium comprising executable instructions stored thereon that, when executed, cause the following operations to be performed: presenting on a computer display device a first section that includes sequencing exercises for the user of the computer system, the sequencing exercises being used to teach visual sequencing skills, the sequencing exercises including symbols of a first written language that are not associated with letters of a second written language taught by the literacy system, wherein the following operations are performed for the presentation of the sequencing exercises: displaying on the computer display device a first array of symbols associated with letters of the first written language; displaying a second array of symbols, wherein the second array includes: all of the symbols of the first array in a same order as the first array, and additional symbols intermingled with those from the first array, removing the first array of symbols from view on the display device when the second array is displayed on the display device, wherein the second array of symbols is non-viewable on the display device when the first array is displayed on the display device; receiving the user's input that identifies a selection of the symbols from the second array; determining if the user's selection of the symbols from the second array matches the symbols that appear in the first array in order of left-to-right sequence; and outputting an indicator to inform the user whether the user's selection of symbols from the second array match the symbols that appear in the first array in order of left-to-right sequence; and upon completion of at least a portion of the sequencing exercises by the user, presenting on the computer display device a second section that includes language exercises for teaching at least one language skill selected from a group consisting of phonology, semantics, syntax, and text, wherein the language exercises are selected based on the indicator regarding the sequencing exercises. | 14. A literacy system for teaching reading skills to a user, the literacy system being implemented on a computer system including a computer-readable storage medium comprising executable instructions stored thereon that, when executed, cause the following operations to be performed: presenting on a computer display device a first section that includes sequencing exercises for the user of the computer system, the sequencing exercises being used to teach visual sequencing skills, the sequencing exercises including symbols of a first written language that are not associated with letters of a second written language taught by the literacy system, wherein the following operations are performed for the presentation of the sequencing exercises: displaying on the computer display device a first array of symbols associated with letters of the first written language; displaying a second array of symbols, wherein the second array includes: all of the symbols of the first array in a same order as the first array, and additional symbols intermingled with those from the first array, removing the first array of symbols from view on the display device when the second array is displayed on the display device, wherein the second array of symbols is non-viewable on the display device when the first array is displayed on the display device; receiving the user's input that identifies a selection of the symbols from the second array; determining if the user's selection of the symbols from the second array matches the symbols that appear in the first array in order of left-to-right sequence; and outputting an indicator to inform the user whether the user's selection of symbols from the second array match the symbols that appear in the first array in order of left-to-right sequence; and upon completion of at least a portion of the sequencing exercises by the user, presenting on the computer display device a second section that includes language exercises for teaching at least one language skill selected from a group consisting of phonology, semantics, syntax, and text, wherein the language exercises are selected based on the indicator regarding the sequencing exercises. 16. The literacy system of claim 14 wherein the symbols displayed on the computer display device in the first array of symbols include objects having different colors. | 0.718855 |
4,181,821 | 5 | 6 | 5. A circuit for recognizing an utterance as one of a set of reference words according to claim 4 wherein said template signal identifying means is further characterized by means (216, 230, 640) for identifying the centermost feature signal set of said cluster as the template signal for said cluster of feature signal sets. | 5. A circuit for recognizing an utterance as one of a set of reference words according to claim 4 wherein said template signal identifying means is further characterized by means (216, 230, 640) for identifying the centermost feature signal set of said cluster as the template signal for said cluster of feature signal sets. 6. A circuit for recognizing an unknown utterance as one of a set of reference words according to claim 5 wherein said means for producing a signal representative of the distance between said unknown utterance prediction parameter signals and said template prediction parameter signals is further characterized in that means (205) are responsive to the unknown utterance to determine the number of frames to the endpoint frame of said unknown utterance; means (880, 1806) are adapted to generate a first signal corresponding to the average frame distance between the unknown utterance prediction parameter signals and said template signal prediction parameter signals until said endpoint frame, to determine the unknown utterance intermediate frame at which the unknown utterance speech signal energy from said intermediate frame to said endpoint frame is a predetermined portion of the total unknown utterance speech signal energy, and to generate a second signal corresponding to the average frame distance between said unknown utterance prediction parameter signals and said template prediction parameter signals until said intermediate frame; and means (1817, 1820) are responsive to said first and second signals to select the minimum of said first and second signals as said distance representative signal. | 0.763774 |
9,679,002 | 1 | 26 | 1. A method of managing digital data, the method comprising: searching, by a processor, a plurality of data sets comprising digital data; recording, by the processor, a hit into an index for each occurrence of a unique object in one of the plurality of data sets, wherein each of the plurality of data sets comprises a numbered sequence of objects, wherein said objects are represented by unique machine-readable object values, and wherein said hit comprises an ordinal number of an occurrence of said unique object and at least one of: a value of a previous object that is positioned one unit before said unique object and a value of a next object that is positioned one unit after said unique object; recording hit data into the index, wherein the hit data comprises at least one of: values of additional previous objects with respect to the unique object and values of additional next objects with respect to the unique object, for N objects where N is at least one; restoring at least one of past relationship and future relationship with respect to the unique object based on the recorded hit data; searching for at least two occurrences of the unique object in indexed data set, wherein the searching comprises gathering a value of the unique object, retrieving hits with the occurrence of the unique object in the indexed data set and other data sets from among the data sets; and displaying the retrieved hits as search results, obtained based on the searching or recording the retrieved relationships into the memory available for a processor or an algorithm capable of analyzing the co-occurrence of the unique object with each of the N next or previous objects in the indexed data set or transferring the retrieved relationship to a processor, wherein the search results or the memory records further comprise the restored relationships. | 1. A method of managing digital data, the method comprising: searching, by a processor, a plurality of data sets comprising digital data; recording, by the processor, a hit into an index for each occurrence of a unique object in one of the plurality of data sets, wherein each of the plurality of data sets comprises a numbered sequence of objects, wherein said objects are represented by unique machine-readable object values, and wherein said hit comprises an ordinal number of an occurrence of said unique object and at least one of: a value of a previous object that is positioned one unit before said unique object and a value of a next object that is positioned one unit after said unique object; recording hit data into the index, wherein the hit data comprises at least one of: values of additional previous objects with respect to the unique object and values of additional next objects with respect to the unique object, for N objects where N is at least one; restoring at least one of past relationship and future relationship with respect to the unique object based on the recorded hit data; searching for at least two occurrences of the unique object in indexed data set, wherein the searching comprises gathering a value of the unique object, retrieving hits with the occurrence of the unique object in the indexed data set and other data sets from among the data sets; and displaying the retrieved hits as search results, obtained based on the searching or recording the retrieved relationships into the memory available for a processor or an algorithm capable of analyzing the co-occurrence of the unique object with each of the N next or previous objects in the indexed data set or transferring the retrieved relationship to a processor, wherein the search results or the memory records further comprise the restored relationships. 26. The method of claim 1 , wherein the index is stored on at least one of a CD disk, a DVD disk, a Blu-Ray disk, another removable information medium, removable memory and in the memory of a device. | 0.9219 |
10,049,197 | 1 | 3 | 1. A computing system for implementing an authentication and verification system, the system comprising: physical storage media configured to store information that represents audio characteristics of sounds generated by a speaker; and one or more physical processors configured to execute computer program components, wherein the computer program components are configured to: obtain a target personal identification sequence, wherein the target personal identification sequence is associated with an unidentified user; obtain an input mapping between user-selectable input options and a set of prompts that represent words; obtain a target sequence of prompts that corresponds to the target personal identification sequence; obtain a redirection mapping and effectuate presentation of the redirection mapping to the unidentified user prior to effectuating presentation of the set of prompts; effectuate a presentation of the set of prompts to the unidentified user such that individual ones of the presented set of prompts are associated with individual ones of the user-selectable input options in accordance with the obtained input mapping; obtain one or more audio files comprising sound generated by the unidentified user in response to the presentation; make a first determination whether the obtained one or more audio files represent a vocalization of the target sequence of prompts based on a reversal of a redirection in accordance with the redirection mapping; automatically authenticate the unidentified user responsive to a positive first determination; make a second determination whether the obtained one or more audio files match the audio characteristics of the sounds generated by the speaker; automatically verify the unidentified user responsive to a positive second determination; and effectuate a grant of access to the unidentified user responsive to authenticating and verifying the unidentified user. | 1. A computing system for implementing an authentication and verification system, the system comprising: physical storage media configured to store information that represents audio characteristics of sounds generated by a speaker; and one or more physical processors configured to execute computer program components, wherein the computer program components are configured to: obtain a target personal identification sequence, wherein the target personal identification sequence is associated with an unidentified user; obtain an input mapping between user-selectable input options and a set of prompts that represent words; obtain a target sequence of prompts that corresponds to the target personal identification sequence; obtain a redirection mapping and effectuate presentation of the redirection mapping to the unidentified user prior to effectuating presentation of the set of prompts; effectuate a presentation of the set of prompts to the unidentified user such that individual ones of the presented set of prompts are associated with individual ones of the user-selectable input options in accordance with the obtained input mapping; obtain one or more audio files comprising sound generated by the unidentified user in response to the presentation; make a first determination whether the obtained one or more audio files represent a vocalization of the target sequence of prompts based on a reversal of a redirection in accordance with the redirection mapping; automatically authenticate the unidentified user responsive to a positive first determination; make a second determination whether the obtained one or more audio files match the audio characteristics of the sounds generated by the speaker; automatically verify the unidentified user responsive to a positive second determination; and effectuate a grant of access to the unidentified user responsive to authenticating and verifying the unidentified user. 3. The system of claim 1 , wherein the presentation includes information to guide pacing of the vocalization. | 0.872664 |
8,539,349 | 1 | 4 | 1. A method of splitting a Chinese character sequence into word segments, the method comprising: providing a synchronization list including a plurality of Chinese words at a system; receiving an input data string including a first Chinese character sequence at the system; identifying one of the plurality of Chinese words from the synchronization list in the first Chinese character sequence at the system, wherein the identifying includes, comparing the Chinese words in the synchronization list with characters in the first Chinese character sequence; detecting a first match between a first Chinese word in the synchronization list and a leftmost or rightmost unsegmented section of the first Chinese character sequence; continuing to compare the characters in the first Chinese character sequence against other Chinese words in the synchronization list that begin with the first Chinese word; and identifying a longest Chinese word in the synchronization list that matches the leftmost or rightmost unsegmented section of the first Chinese character sequence; defining the identified longest Chinese word as a word segment in the first Chinese character sequence at the system; identifying a first undefined character sequence in the first Chinese character sequence at the system; and segmenting the first undefined character sequence into at least one word segment at the system. | 1. A method of splitting a Chinese character sequence into word segments, the method comprising: providing a synchronization list including a plurality of Chinese words at a system; receiving an input data string including a first Chinese character sequence at the system; identifying one of the plurality of Chinese words from the synchronization list in the first Chinese character sequence at the system, wherein the identifying includes, comparing the Chinese words in the synchronization list with characters in the first Chinese character sequence; detecting a first match between a first Chinese word in the synchronization list and a leftmost or rightmost unsegmented section of the first Chinese character sequence; continuing to compare the characters in the first Chinese character sequence against other Chinese words in the synchronization list that begin with the first Chinese word; and identifying a longest Chinese word in the synchronization list that matches the leftmost or rightmost unsegmented section of the first Chinese character sequence; defining the identified longest Chinese word as a word segment in the first Chinese character sequence at the system; identifying a first undefined character sequence in the first Chinese character sequence at the system; and segmenting the first undefined character sequence into at least one word segment at the system. 4. The method of claim 1 , wherein providing a synchronization list including a plurality of Chinese words at a system comprises providing a synchronization list including a plurality of Chinese family name words at the system, the method further comprising: identifying one of the plurality of Chinese family name words in the first Chinese character sequence at the system; and defining the identified Chinese family name word together with the two characters immediately following the identified Chinese family name as a word segment at the system. | 0.813347 |
10,140,989 | 11 | 12 | 11. A computer program product being embodied in a tangible non-transitory computer readable storage medium and comprising computer instructions for: assigning, using an instant messaging server (IMS), a unique identifier to speech information received from a sending end to serve as a speech ID; sending, using the IMS, the speech information to a receiving end; and in response to a determination that a speech recognition request issued from a user of the receiving end corresponding to the speech information is received: extracting, using the IMS, the speech ID corresponding to the speech information from the speech recognition request; looking up, using the IMS, the speech information; and delivering, using the IMS, a speech recognition command in the speech recognition request and the looked-up speech information to one of a speech recognition module, a speech recognition server, or a speech recognition server cluster; performing, using the one of the speech recognition module, the speech recognition server, or the speech recognition server cluster, speech recognition based on the speech information and the speech recognition command; and converting, using the one of the speech recognition module, the speech recognition server, or the speech recognition server cluster, the speech information to obtain text information corresponding to the speech information, wherein the IMS obtains the text information from the one of the speech recognition module, the speech recognition server, or the speech recognition server cluster; sending, using a sending module, the obtained text information back as a speech recognition result to the receiving end, wherein the speech recognition module is set up in the one of the IMS, the speech recognition server, or the speech recognition server cluster; storing, using the IMS, the obtained text information in a cache in correspondence with the speech ID; and in response to a determination that another speech recognition request for the same speech information is received: extracting, using the IMS, a speech ID from the other speech recognition request; and locating, using the IMS, the text information corresponding to the speech ID from the other speech recognition request. | 11. A computer program product being embodied in a tangible non-transitory computer readable storage medium and comprising computer instructions for: assigning, using an instant messaging server (IMS), a unique identifier to speech information received from a sending end to serve as a speech ID; sending, using the IMS, the speech information to a receiving end; and in response to a determination that a speech recognition request issued from a user of the receiving end corresponding to the speech information is received: extracting, using the IMS, the speech ID corresponding to the speech information from the speech recognition request; looking up, using the IMS, the speech information; and delivering, using the IMS, a speech recognition command in the speech recognition request and the looked-up speech information to one of a speech recognition module, a speech recognition server, or a speech recognition server cluster; performing, using the one of the speech recognition module, the speech recognition server, or the speech recognition server cluster, speech recognition based on the speech information and the speech recognition command; and converting, using the one of the speech recognition module, the speech recognition server, or the speech recognition server cluster, the speech information to obtain text information corresponding to the speech information, wherein the IMS obtains the text information from the one of the speech recognition module, the speech recognition server, or the speech recognition server cluster; sending, using a sending module, the obtained text information back as a speech recognition result to the receiving end, wherein the speech recognition module is set up in the one of the IMS, the speech recognition server, or the speech recognition server cluster; storing, using the IMS, the obtained text information in a cache in correspondence with the speech ID; and in response to a determination that another speech recognition request for the same speech information is received: extracting, using the IMS, a speech ID from the other speech recognition request; and locating, using the IMS, the text information corresponding to the speech ID from the other speech recognition request. 12. The computer program product as described in claim 11 , further comprising computer instructions for: assigning, using the IMS, the speech ID to the speech information sent from the sending end; storing, using the IMS, the speech ID corresponding to the speech information; receiving, using the IMS, the speech recognition request from the receiving end; and locating, using the IMS, the speech information corresponding to the speech ID in the speech recognition request. | 0.71011 |
8,375,043 | 11 | 18 | 11. One or more non-transitory computer-readable storage media storing instructions, the instruction which, when executed by one or more processors, cause the one or more processors to perform: receiving, at a server via web service communications from a client, client web service messages comprising data marked according to a markup language; wherein receiving the client web service messages comprises: receiving a first client web service message to request a connection to the server; receiving a second client web service message associated with the connection, wherein the second client web service message encapsulates an XQuery expression as data marked according to the markup language, wherein the XQuery expression conforms to an XQuery language; at the server, extracting the XQuery expression from the second client web service message; at the server, executing the XQuery expression against XML data; sending, from the server to the client via web service communications, a server web service message; wherein the server web service message contains a sequence of items; wherein the sequence of items contains at least part of results from execution of the XQuery expression. | 11. One or more non-transitory computer-readable storage media storing instructions, the instruction which, when executed by one or more processors, cause the one or more processors to perform: receiving, at a server via web service communications from a client, client web service messages comprising data marked according to a markup language; wherein receiving the client web service messages comprises: receiving a first client web service message to request a connection to the server; receiving a second client web service message associated with the connection, wherein the second client web service message encapsulates an XQuery expression as data marked according to the markup language, wherein the XQuery expression conforms to an XQuery language; at the server, extracting the XQuery expression from the second client web service message; at the server, executing the XQuery expression against XML data; sending, from the server to the client via web service communications, a server web service message; wherein the server web service message contains a sequence of items; wherein the sequence of items contains at least part of results from execution of the XQuery expression. 18. The one or more non-transitory computer-readable storage media recited in claim 11 , wherein the server web service message is a first server web service message, and wherein the sequence of items is a first sequence of items, further comprising: sending, from the server to the client via web service communications, a second server web service message; wherein the second server web service message contains a second sequence of items; wherein the second sequence of items contains at least part of the results from execution of the XQuery expression; wherein which part of the results from execution of the XQuery expression is contained in the second sequence of items depends on a state of execution of the XQuery expression maintained by the server. | 0.500658 |
8,407,667 | 8 | 13 | 8. A method comprising: extracting metadata from server-side source code of a server project of an application under development on a software development computer, the application comprising server-side software generated from the server-side source code and client-side software generated from client-side source code, wherein the extracted metadata comprises metadata associated with a set of program entities comprising a transitive closure of program entities referenced in the extracted metadata, wherein the program entities are entities exposed by the server-side software to the client-side software and wherein the extracted metadata does not comprise a program entity that is not exposed to the client-side software by the server-side software; determining program entities within the set of program entities for which a definition is missing in the server-side source code; replacing each of the program entities within the set of program entities for which the definition is missing with a placeholder entity; marking each placeholder entity; generating a library from the extracted metadata without compilation of the server project, wherein the library comprises metadata associated with a program entity of the set of program entities and does not comprise an executable; receiving the generated library and generating client-side source code and documentation and disambiguation information associated with the program entity of the set of program entities from the generated library by reflection; and displaying the documentation and disambiguation information in a client source code editor dynamically during client-side software development on the software development computer. | 8. A method comprising: extracting metadata from server-side source code of a server project of an application under development on a software development computer, the application comprising server-side software generated from the server-side source code and client-side software generated from client-side source code, wherein the extracted metadata comprises metadata associated with a set of program entities comprising a transitive closure of program entities referenced in the extracted metadata, wherein the program entities are entities exposed by the server-side software to the client-side software and wherein the extracted metadata does not comprise a program entity that is not exposed to the client-side software by the server-side software; determining program entities within the set of program entities for which a definition is missing in the server-side source code; replacing each of the program entities within the set of program entities for which the definition is missing with a placeholder entity; marking each placeholder entity; generating a library from the extracted metadata without compilation of the server project, wherein the library comprises metadata associated with a program entity of the set of program entities and does not comprise an executable; receiving the generated library and generating client-side source code and documentation and disambiguation information associated with the program entity of the set of program entities from the generated library by reflection; and displaying the documentation and disambiguation information in a client source code editor dynamically during client-side software development on the software development computer. 13. The method of claim 8 , further comprising: extracting source code from the server project, the extracted source code comprising an undefined class that exposes an API to the client-side software, wherein a proxy class for the undefined class is not generated. | 0.733333 |
8,738,363 | 9 | 10 | 9. The method of claim 1 , wherein the thesaurus of terms relating to suggestions of improvement includes a set of terms relating to a belief concept and a set of terms relating to a lack concept. | 9. The method of claim 1 , wherein the thesaurus of terms relating to suggestions of improvement includes a set of terms relating to a belief concept and a set of terms relating to a lack concept. 10. The method of claim 9 , wherein the set of terms relating to the belief concept includes terms selected from the group consisting of figure, think, believe, suppose, assume, consider, guess, suspect, speculate, imagine, presume, deny, disclaim, and question. | 0.960696 |
8,832,052 | 1 | 2 | 1. A method for providing a seed Uniform Resource Locator (URL) of a document within a computer network to a search engine in the computer network, the computer network having a plurality of documents with URLs distributed therein, the search engine having a web-graph in which exists a set of crawled documents, the method comprising: detecting, by a router, from among data packets exchanged in the computer network external to the search engine, a packet containing a request to access a requested document, the router not being aware of which documents are not reachable by the search engine; extracting a requested document URL of the requested document from the packet containing the request; and determining that the requested document URL was not previously requested within a predetermined time interval, and in response, providing the requested document URL as the seed URL to the search engine, so as to cause the search engine to expand the set of crawled documents by adding the requested document to the set of crawled documents. | 1. A method for providing a seed Uniform Resource Locator (URL) of a document within a computer network to a search engine in the computer network, the computer network having a plurality of documents with URLs distributed therein, the search engine having a web-graph in which exists a set of crawled documents, the method comprising: detecting, by a router, from among data packets exchanged in the computer network external to the search engine, a packet containing a request to access a requested document, the router not being aware of which documents are not reachable by the search engine; extracting a requested document URL of the requested document from the packet containing the request; and determining that the requested document URL was not previously requested within a predetermined time interval, and in response, providing the requested document URL as the seed URL to the search engine, so as to cause the search engine to expand the set of crawled documents by adding the requested document to the set of crawled documents. 2. The method according to claim 1 , and comprising, after the requested document is added to the set of crawled documents, applying the search engine to search in the set of crawled documents including the requested document. | 0.756989 |
10,061,469 | 15 | 17 | 15. A computer program product comprising: a computer readable storage medium; and program instructions residing in said storage medium for displaying secondary data associated with primary data by generating a three-dimensional visualization of the primary data on the display device, the three-dimensional visualization including a plurality of primary graphical elements representing primary quantitative values and a plurality of primary labels respectively associated with and proximate to the primary graphical elements, the primary graphical elements and primary labels being presented on a front plane of the three-dimensional visualization, the front plane defining first and second axes, and at least one of the primary graphical elements having associated secondary graphical elements representing secondary quantitative values wherein the secondary graphical elements are presented along a third axis of the three-dimensional visualization, the third axis being different from the first and second axes, detecting that the at least one primary graphical elements has been selected, and responsive to the detecting, transitioning the three-dimensional visualization by moving the secondary graphical elements from the third axis of the three-dimensional visualization to the front plane of the three-dimensional visualization. | 15. A computer program product comprising: a computer readable storage medium; and program instructions residing in said storage medium for displaying secondary data associated with primary data by generating a three-dimensional visualization of the primary data on the display device, the three-dimensional visualization including a plurality of primary graphical elements representing primary quantitative values and a plurality of primary labels respectively associated with and proximate to the primary graphical elements, the primary graphical elements and primary labels being presented on a front plane of the three-dimensional visualization, the front plane defining first and second axes, and at least one of the primary graphical elements having associated secondary graphical elements representing secondary quantitative values wherein the secondary graphical elements are presented along a third axis of the three-dimensional visualization, the third axis being different from the first and second axes, detecting that the at least one primary graphical elements has been selected, and responsive to the detecting, transitioning the three-dimensional visualization by moving the secondary graphical elements from the third axis of the three-dimensional visualization to the front plane of the three-dimensional visualization. 17. The computer program product of claim 15 wherein said program instructions further detect that another one of the primary graphical elements has been selected and transition the three-dimensional visualization by moving the secondary graphical elements from the front plane of the three-dimensional visualization back to the third axis of the three-dimensional visualization. | 0.586245 |
7,958,103 | 9 | 10 | 9. A method as recited in claim 1 , wherein the computer script or code is configured to search or be used to search a repository. | 9. A method as recited in claim 1 , wherein the computer script or code is configured to search or be used to search a repository. 10. A method as recited in claim 9 , wherein each of one or more content items stored in the repository has associated with it one or more attributes and the attributes of the respective content items are used to search the repository for content items that satisfy the search criteria. | 0.903378 |
5,421,731 | 1 | 3 | 1. A method for teaching reading to a learner comprising: (a) showing to the learner a printed word to be read, the printed word having at least two syllables; (b) directing the learner to decode the printed word, by having the learner (i) identify all vowels in the printed word, (ii) identify all consonants in the primed word beginning with the first consonant after the first vowel and ending with the consonant before the last vowel, (iii) identify all syllables in the primed word using syllabication rules previously taught to the learner, (iv) identify all phonograms in the printed word, where each phonogram in a syllable is from the first vowel to the end of the syllable, and identify any consonant or consonant clusters preceding the phonogram in each syllable with the exception of suffixes, and (v) identify each suffix, if any; (c) directing the learner, after the learner has decoded the printed word, to pronounce the printed word using the decoded syllables, phonograms, consonants, consonant clusters, and suffixes; and, (d) having the learner listen to correct pronunciation of the printed word. | 1. A method for teaching reading to a learner comprising: (a) showing to the learner a printed word to be read, the printed word having at least two syllables; (b) directing the learner to decode the printed word, by having the learner (i) identify all vowels in the printed word, (ii) identify all consonants in the primed word beginning with the first consonant after the first vowel and ending with the consonant before the last vowel, (iii) identify all syllables in the primed word using syllabication rules previously taught to the learner, (iv) identify all phonograms in the printed word, where each phonogram in a syllable is from the first vowel to the end of the syllable, and identify any consonant or consonant clusters preceding the phonogram in each syllable with the exception of suffixes, and (v) identify each suffix, if any; (c) directing the learner, after the learner has decoded the printed word, to pronounce the printed word using the decoded syllables, phonograms, consonants, consonant clusters, and suffixes; and, (d) having the learner listen to correct pronunciation of the printed word. 3. The method of claim 1 wherein said syllabication rules include syllabifying the printed word if there is a vowel(V)-consonant(C)-vowel (V)-consonant(C)-vowel(V) pattern into the syllables VC, V, and CV, if the printed word ends with an irregular suffix, where: (a) the irregular suffixes for two syllable words include: TBL ______________________________________ al tic y ar ent ic age ate ______________________________________ and (b) the irregular suffixes for three syllable words include: TBL ______________________________________ ant ate ar/y age ice ent al ies/ied tive ty fy or an ize ive y ance ite lous en ture u/al id ile ous ence ure some in o/ry ar a/bly i/ty it on ______________________________________ and (c) the irregular suffixes for four and five syllable words include: TBL ______________________________________ ant ance ent ar ar/y y ate ______________________________________ and the second VC pattern is not "er" or "el," if the second VC pattern is "er" or "el," then the VCVCV pattern is syllabified into the syllables VC, VC and V. | 0.50047 |
8,078,554 | 8 | 13 | 8. In a computer readable storage medium having stored therein data representing instructions executable by a programmed processor for knowledge-based interpretable predictive modeling of patients, the instructions comprising: receiving diagram information representing relationships between variables of lung cancer, wherein the variables comprise at least two of tumor load, T-stage, N-stage, number of lymph node stations, WHO performance, and survival, the predictive model trained to predict the survival; seeding a predictive model with the diagram information; training the predictive model, as seeded with the diagram information, with training data, the data comprising values for the variables of lung cancer; and displaying a graphical representation of the predictive model after the training, the graphical representation showing at least one of the relationships. | 8. In a computer readable storage medium having stored therein data representing instructions executable by a programmed processor for knowledge-based interpretable predictive modeling of patients, the instructions comprising: receiving diagram information representing relationships between variables of lung cancer, wherein the variables comprise at least two of tumor load, T-stage, N-stage, number of lymph node stations, WHO performance, and survival, the predictive model trained to predict the survival; seeding a predictive model with the diagram information; training the predictive model, as seeded with the diagram information, with training data, the data comprising values for the variables of lung cancer; and displaying a graphical representation of the predictive model after the training, the graphical representation showing at least one of the relationships. 13. The computer readable storage medium of claim 8 wherein the graphical representation includes nodes associated with respective variables and includes links between some nodes and not between other nodes. | 0.789206 |
8,601,360 | 10 | 15 | 10. A computer apparatus, comprising: computer network shared data storage; multiple computers coupled to the computer network shared data storage; a spreadsheet application on at least one of the multiple computers, through which a user can implement a business data model and maintain the business data model in the computer network shared data storage; a computer-based tagging engine which provides a user accessible interface through which a user establishes rules for data of the business data model by tagging data and thereby associating data in at least one cell of a spreadsheet implementing the business data model with at least both an entity dimension tag and a metric dimension tag; a computer based sync engine which ensures that data contents of the business data model stored in the computer network shared data storage reflect a current value for the at least one cell; and a computer based calc engine which is configured to extract data values from the spreadsheet at each cell location corresponding to a location of intersection between a dimension tagged to a column of the spreadsheet and a dimension tagged to a row of the spreadsheet in order to perform at least a period aggregation or an entity aggregation for the data model before storing data of the business data model in the computer network shared data storage. | 10. A computer apparatus, comprising: computer network shared data storage; multiple computers coupled to the computer network shared data storage; a spreadsheet application on at least one of the multiple computers, through which a user can implement a business data model and maintain the business data model in the computer network shared data storage; a computer-based tagging engine which provides a user accessible interface through which a user establishes rules for data of the business data model by tagging data and thereby associating data in at least one cell of a spreadsheet implementing the business data model with at least both an entity dimension tag and a metric dimension tag; a computer based sync engine which ensures that data contents of the business data model stored in the computer network shared data storage reflect a current value for the at least one cell; and a computer based calc engine which is configured to extract data values from the spreadsheet at each cell location corresponding to a location of intersection between a dimension tagged to a column of the spreadsheet and a dimension tagged to a row of the spreadsheet in order to perform at least a period aggregation or an entity aggregation for the data model before storing data of the business data model in the computer network shared data storage. 15. The computer apparatus of claim 10 , wherein the location of intersection is to the left of row-assigned dimension tags and beneath column-assigned dimension tags. | 0.917896 |
7,930,301 | 6 | 7 | 6. A computer-implemented indexing and searching method that provides improved searching of computer files and objects, comprising the following computer-executed acts: conducting a search of an index database to identify preliminary results, listing one or more selected computer objects having identifying information stored in the index database; correlating the one or more selected computer objects of the preliminary search results with one or more other computer objects that have associations with the selected computer objects of the preliminary search results, the associations are determined based on monitoring user activity on a user-operated computer and recording the user activity as metadata in a computer system database, wherein a universal input activity monitor provides a single entry point for all user interactions with the computer, the user interactions comprise input method data, input language data, input mode data, input assistance data and input feedback data, wherein the user activity comprises, computer communications, computer system events and interactions between the user and computer objects, and wherein the associations are then ranked based on a degree of similarity between a given pair of computer objects; and returning integrated search results that include the preliminary search results with one or more other computer objects that have associations with the selected computer objects of the preliminary search results. | 6. A computer-implemented indexing and searching method that provides improved searching of computer files and objects, comprising the following computer-executed acts: conducting a search of an index database to identify preliminary results, listing one or more selected computer objects having identifying information stored in the index database; correlating the one or more selected computer objects of the preliminary search results with one or more other computer objects that have associations with the selected computer objects of the preliminary search results, the associations are determined based on monitoring user activity on a user-operated computer and recording the user activity as metadata in a computer system database, wherein a universal input activity monitor provides a single entry point for all user interactions with the computer, the user interactions comprise input method data, input language data, input mode data, input assistance data and input feedback data, wherein the user activity comprises, computer communications, computer system events and interactions between the user and computer objects, and wherein the associations are then ranked based on a degree of similarity between a given pair of computer objects; and returning integrated search results that include the preliminary search results with one or more other computer objects that have associations with the selected computer objects of the preliminary search results. 7. The method of claim 6 in which the integrated search results include first and second information levels, the first information level corresponding to the preliminary search results and the second information level corresponding to the one or more other computer objects that have associations with the selected computer objects of the preliminary search results. | 0.570423 |
10,108,603 | 4 | 6 | 4. The system of claim 1 , wherein: the context-free linguistic model comprises first linguistic information that is applicable to a plurality of contexts; and the second context-specific linguistic model comprises second linguistic information that is applicable to a context that is not one of the plurality of contexts. | 4. The system of claim 1 , wherein: the context-free linguistic model comprises first linguistic information that is applicable to a plurality of contexts; and the second context-specific linguistic model comprises second linguistic information that is applicable to a context that is not one of the plurality of contexts. 6. The system of claim 4 , wherein: the second linguistic information comprises one or more transform rules that control at least one of tokenization of a portion of the text, normalization of a portion of the text, and combinations thereof. | 0.943053 |
8,275,842 | 13 | 17 | 13. A system for detecting content similarity in email documents comprising: one or more processors; and memory storing program instructions that are executable by the one or more processors to: generate a token value for each of a plurality of character sequences of a first email document; generate a remainder value for each of the plurality of character sequences of the first email document by dividing each of the token values by a predetermined integer value; select a first subset of the plurality of character sequences of the first email document, wherein the first subset includes character sequences that have the same remainder values; select a second subset of the plurality of character sequences of the first email document, wherein the second subset includes character sequences that have the same remainder values, and wherein the remainder values of the second subset are different than the remainder values of the first subset; generate a first hash value corresponding to the selected first subset of character sequences; generate a second hash value corresponding to the selected second subset of character sequences; and compare the first and second hash values with one or more hash values generated from a second email document. | 13. A system for detecting content similarity in email documents comprising: one or more processors; and memory storing program instructions that are executable by the one or more processors to: generate a token value for each of a plurality of character sequences of a first email document; generate a remainder value for each of the plurality of character sequences of the first email document by dividing each of the token values by a predetermined integer value; select a first subset of the plurality of character sequences of the first email document, wherein the first subset includes character sequences that have the same remainder values; select a second subset of the plurality of character sequences of the first email document, wherein the second subset includes character sequences that have the same remainder values, and wherein the remainder values of the second subset are different than the remainder values of the first subset; generate a first hash value corresponding to the selected first subset of character sequences; generate a second hash value corresponding to the selected second subset of character sequences; and compare the first and second hash values with one or more hash values generated from a second email document. 17. The system of claim 13 , wherein the program instructions are further executable to generate a similarity indication in response to a predetermined ratio of hash value matches to hash value mismatches. | 0.586694 |
9,606,973 | 1 | 9 | 1. A method, comprising: receiving, at a touch input device, user input of a string of characters; prior to receiving user input to the string of characters, determining, using a processor, one or more potential errors in the string of characters; identifying, using a processor, a character location of the one or more potential errors within the string of characters; and automatically positioning, on a display, a visual indication associated with the character location of the one or more potential errors within the string of characters. | 1. A method, comprising: receiving, at a touch input device, user input of a string of characters; prior to receiving user input to the string of characters, determining, using a processor, one or more potential errors in the string of characters; identifying, using a processor, a character location of the one or more potential errors within the string of characters; and automatically positioning, on a display, a visual indication associated with the character location of the one or more potential errors within the string of characters. 9. The method of claim 1 , wherein the touch input device comprises a touch sensitive surface. | 0.950939 |
10,019,910 | 15 | 20 | 15. A computer-implemented method comprising: for each of a set of electronic user devices, and, via execution of an educational application on an electronic instructor device: receiving a wireless communication, from the electronic user device that includes an identifier of a response submitted to an educational question; automatically detecting, using one or more processors, a time at which the wireless communication was received; calculating, using the one or more processors, a response time based on the time at which the wireless communication was received and a time at which the educational question was availed, the educational question having been availed at a same time with respect to each electronic user device of the set of electronic user devices; and generating response data that include the identifier of the response, the response time and an identifier of a user in the set of electronic user devices; and automatically displaying a representation of a response-time statistic determined based on response times corresponding to a subset of the set of electronic user devices, a same response having been identified in the wireless communication received from each electronic user device in the subset. | 15. A computer-implemented method comprising: for each of a set of electronic user devices, and, via execution of an educational application on an electronic instructor device: receiving a wireless communication, from the electronic user device that includes an identifier of a response submitted to an educational question; automatically detecting, using one or more processors, a time at which the wireless communication was received; calculating, using the one or more processors, a response time based on the time at which the wireless communication was received and a time at which the educational question was availed, the educational question having been availed at a same time with respect to each electronic user device of the set of electronic user devices; and generating response data that include the identifier of the response, the response time and an identifier of a user in the set of electronic user devices; and automatically displaying a representation of a response-time statistic determined based on response times corresponding to a subset of the set of electronic user devices, a same response having been identified in the wireless communication received from each electronic user device in the subset. 20. The computer-implemented method as recited in claim 15 , wherein each of the set of electronic user devices is located in a physical classroom, and wherein each of the set of electronic user devices includes a processor. | 0.887663 |
8,331,958 | 9 | 11 | 9. A method for identifying information in content received by a location-aware device through a communications network, the method comprising: determining a locale context based on the current geographic location of the location-aware device, the locale context indicating an address format; automatically identifying address information in the received content at least in part by parsing text data associated with the received content in a manner suitable to the locale context; processing the address information to provide one or more coordinates for a location; and providing, on the location-aware device, a navigational-related function for the location based at least in part on the address information. | 9. A method for identifying information in content received by a location-aware device through a communications network, the method comprising: determining a locale context based on the current geographic location of the location-aware device, the locale context indicating an address format; automatically identifying address information in the received content at least in part by parsing text data associated with the received content in a manner suitable to the locale context; processing the address information to provide one or more coordinates for a location; and providing, on the location-aware device, a navigational-related function for the location based at least in part on the address information. 11. A method as recited in claim 9 wherein processing is performed at least in part by parsing the text data with one or more expressions in a manner suitable to the locale context. | 0.79385 |
9,918,057 | 1 | 10 | 1. A method of projecting text characters onto a textured surface, the method comprising: determining, from a captured image of the textured surface, a measure of the texture on the surface for a region of the textured surface over which the text characters are to be projected; selecting, based on a function of the determined measure, a glyph set, each glyph in the glyph set having visually contrasting inner and outer portions, at least one of the inner and outer portions having a width varied according to the determined measure in each of two mutually perpendicular directions, the outer portion being sized proportionally to the inner portion according to the determined measure; and projecting the text characters onto the textured surface of the region using the selected glyph set. | 1. A method of projecting text characters onto a textured surface, the method comprising: determining, from a captured image of the textured surface, a measure of the texture on the surface for a region of the textured surface over which the text characters are to be projected; selecting, based on a function of the determined measure, a glyph set, each glyph in the glyph set having visually contrasting inner and outer portions, at least one of the inner and outer portions having a width varied according to the determined measure in each of two mutually perpendicular directions, the outer portion being sized proportionally to the inner portion according to the determined measure; and projecting the text characters onto the textured surface of the region using the selected glyph set. 10. The method according to claim 1 , wherein the texture has a different orientation to an orientation of the projected text, the measure being determined in relation to the orientation of the texture. | 0.532407 |
9,342,590 | 7 | 10 | 7. A system for determining a set of keywords associated with a document for use as suggested search terms, comprising: a processor; and a memory containing a program, which, when executed by the processor, is configured to perform a process configured to: receive a categorization ranking for a document received from a device via a network for each category of a plurality of categories of a taxonomy, and determine a set of categories of the taxonomy having highest categorization rankings of the plurality of categories for the received document; combine together the documents representing the categories of the determined set of categories into a cumulative representative text that includes a plurality of terms, the plurality of terms including at least one term that is not included in the received document; determine a term corpus importance score for each term in the cumulative representative text for each category of the set of categories based on a term frequency and an inverse category frequency; determine a cumulative term corpus importance score for each term in the cumulative representative text by combining the term corpus importance scores generated for each term for categories of the set of categories, the cumulative term corpus importance score for a particular term indicating an importance of the particular term in a context of the cumulative representative text; select a set of terms of the cumulative representative text having highest cumulative term corpus importance scores of the plurality of terms as the keywords; and provide one or more of the keywords as one or more suggested search terms to the device via the network. | 7. A system for determining a set of keywords associated with a document for use as suggested search terms, comprising: a processor; and a memory containing a program, which, when executed by the processor, is configured to perform a process configured to: receive a categorization ranking for a document received from a device via a network for each category of a plurality of categories of a taxonomy, and determine a set of categories of the taxonomy having highest categorization rankings of the plurality of categories for the received document; combine together the documents representing the categories of the determined set of categories into a cumulative representative text that includes a plurality of terms, the plurality of terms including at least one term that is not included in the received document; determine a term corpus importance score for each term in the cumulative representative text for each category of the set of categories based on a term frequency and an inverse category frequency; determine a cumulative term corpus importance score for each term in the cumulative representative text by combining the term corpus importance scores generated for each term for categories of the set of categories, the cumulative term corpus importance score for a particular term indicating an importance of the particular term in a context of the cumulative representative text; select a set of terms of the cumulative representative text having highest cumulative term corpus importance scores of the plurality of terms as the keywords; and provide one or more of the keywords as one or more suggested search terms to the device via the network. 10. The system of claim 7 , wherein at least some of the categories have one or more corresponding sub-categories, wherein the process is further configured to use a hierarchy of categories in a tree of classifications to determine cumulative term corpus importance scores. | 0.905927 |
9,288,321 | 1 | 5 | 1. A system comprising: a non-transitory memory storing a software component library for use with interactive voice response (IVR) information for a plurality of webpages; and one or more hardware processors coupled to the non-transitory memory and configured to read instructions from the non-transitory memory to cause the system to perform operations comprising: determine IVR flow information from each webpage element of a plurality of webpage elements in a webpage, wherein the IVR flow information comprises a sequence of audio outputs for presentation of the plurality of webpage elements to a user using a device; transmit the software component library to the device for processing on a user initiation to present an IVR interface to the user using the IVR flow information, wherein the user utilizes the IVR interface to enter at least one input to at least one of the plurality of webpage elements in response to the sequence of the audio outputs; and receive the at least one input from the user. | 1. A system comprising: a non-transitory memory storing a software component library for use with interactive voice response (IVR) information for a plurality of webpages; and one or more hardware processors coupled to the non-transitory memory and configured to read instructions from the non-transitory memory to cause the system to perform operations comprising: determine IVR flow information from each webpage element of a plurality of webpage elements in a webpage, wherein the IVR flow information comprises a sequence of audio outputs for presentation of the plurality of webpage elements to a user using a device; transmit the software component library to the device for processing on a user initiation to present an IVR interface to the user using the IVR flow information, wherein the user utilizes the IVR interface to enter at least one input to at least one of the plurality of webpage elements in response to the sequence of the audio outputs; and receive the at least one input from the user. 5. The system of claim 1 , wherein the software component library comprises a JavaScript library. | 0.709581 |
7,689,580 | 21 | 22 | 21. An apparatus for enabling at least one transactional application to be searched, the apparatus comprising: means for creating a canonical object associated with the at least a first and second transactional applications; means for indexing first and second data associated with the first transactional application and third data associated with the second transactional application, wherein the first transactional application has direct access to the first and second data but not the third data, and the second transactional application has direct access to the third data but not the first or second data, and the first data is different from the second data; means for creating an index store using information associated with the canonical object, wherein the index store is associated with the indexed first, second, and third data; means for interfacing a semantic engine with the index store; means for determining if a result associated with the query having a first format is indicated in the index store; means for translating the query from the first format into a second format, the second format being associated with the first transactional application if it is determined that the result associated with the query having the first format is indicated in the index store; means for accessing the first transactional application using the query having the second format if it is determined that the result associated with the query having the first format is indicated in the index store; means for accessing the index store using a search engine; and means for displaying a result associated with the query. | 21. An apparatus for enabling at least one transactional application to be searched, the apparatus comprising: means for creating a canonical object associated with the at least a first and second transactional applications; means for indexing first and second data associated with the first transactional application and third data associated with the second transactional application, wherein the first transactional application has direct access to the first and second data but not the third data, and the second transactional application has direct access to the third data but not the first or second data, and the first data is different from the second data; means for creating an index store using information associated with the canonical object, wherein the index store is associated with the indexed first, second, and third data; means for interfacing a semantic engine with the index store; means for determining if a result associated with the query having a first format is indicated in the index store; means for translating the query from the first format into a second format, the second format being associated with the first transactional application if it is determined that the result associated with the query having the first format is indicated in the index store; means for accessing the first transactional application using the query having the second format if it is determined that the result associated with the query having the first format is indicated in the index store; means for accessing the index store using a search engine; and means for displaying a result associated with the query. 22. The apparatus of claim 21 comprising: means for providing the query to the semantic engine, the query having a third format, wherein the semantic engine is arranged to translate the query from the third format into the first format, the first format being associated with the search engine. | 0.879607 |
8,650,172 | 7 | 9 | 7. The method of claim 1 , wherein the probabilities are computed using a probabilistic model having multiple components. | 7. The method of claim 1 , wherein the probabilities are computed using a probabilistic model having multiple components. 9. The method of claim 7 , wherein the multiple components include a web site language model that is based on multiple queries, including the first queries and the second queries, that have been submitted to the searchable web sites. | 0.93358 |
5,563,626 | 17 | 18 | 17. A method of text display as claimed in claim 16 wherein the maximum widths of the updated or original texts correspond to the maximum number of pixels constituting a single line of a display area. | 17. A method of text display as claimed in claim 16 wherein the maximum widths of the updated or original texts correspond to the maximum number of pixels constituting a single line of a display area. 18. A method of text display as claimed in claim 17 wherein the maximum width of the updated or original texts is less than or equal to the maximum number of pixels constituting a display area or screen. | 0.943169 |
9,135,909 | 7 | 8 | 7. The speech synthesis information editing apparatus according to claim 1 , wherein the feature information specifies the feature for each of a plurality of editing points of the phonemes arranged on a time base, and the edition processing unit is configured to update the feature information such that a position of the editing point relative to a sounding interval of the phoneme is maintained before and after change of the duration of each phoneme. | 7. The speech synthesis information editing apparatus according to claim 1 , wherein the feature information specifies the feature for each of a plurality of editing points of the phonemes arranged on a time base, and the edition processing unit is configured to update the feature information such that a position of the editing point relative to a sounding interval of the phoneme is maintained before and after change of the duration of each phoneme. 8. The speech synthesis information editing apparatus according to claim 7 , wherein the edition processing unit is configured to move a position of the editing point on the time base within the sounding interval of the phoneme represented by the phoneme information by an amount depending on a type of the phoneme when the time variation in the feature is updated. | 0.865015 |
8,914,291 | 2 | 7 | 2. The method of claim 1 , wherein the identifying comprises: identifying a plurality of tokens of the text input of a same text normalization type for which a contrastive stress pattern is to be applied; and identifying the at least one token to be rendered with contrastive stress from among the plurality of tokens of the same text normalization type. | 2. The method of claim 1 , wherein the identifying comprises: identifying a plurality of tokens of the text input of a same text normalization type for which a contrastive stress pattern is to be applied; and identifying the at least one token to be rendered with contrastive stress from among the plurality of tokens of the same text normalization type. 7. The method of claim 2 , wherein the at least one token to be rendered with contrastive stress is identified based at least in part on an order of the plurality of tokens in the text input. | 0.936671 |
9,245,032 | 14 | 17 | 14. A non-transitory computer-readable medium having a plurality of computer-executable instructions stored thereon, the non-transitory computer-readable medium comprising: instructions for receiving a request from an interface associated with a client device for a web page created in a specific language, the web page comprising content in the specific language, one or more elements in a first markup language used by an interface of the client device to display the content, and one or more one or elements in a second markup language, the second markup language being an intermediate non-scripting language different from the first language; instructions for extracting a locale-specific preference from a header in the request, the locale-specific preference in the header further including one or more entries that each indicate a preference level for document languages; instructions for selecting a locale-specific module corresponding to the locale-specific module corresponding to the locale-specific preference, the selected locale-specific module built in a language supported by a script associated with the requested web page using one or more user-supplied definitions associating an element of the webpage in the second markup language with one or more locale-specific formattings; instructions for sending the locale-specific module to the client device for storage at the client device; and instructions for sending the requested web page to the client device for storage at the client device, wherein, when the client device encounters the element of the web page in the second markup language when executing the script, the client device uses the locale specific module to determine the one or more locale-specific formattings. | 14. A non-transitory computer-readable medium having a plurality of computer-executable instructions stored thereon, the non-transitory computer-readable medium comprising: instructions for receiving a request from an interface associated with a client device for a web page created in a specific language, the web page comprising content in the specific language, one or more elements in a first markup language used by an interface of the client device to display the content, and one or more one or elements in a second markup language, the second markup language being an intermediate non-scripting language different from the first language; instructions for extracting a locale-specific preference from a header in the request, the locale-specific preference in the header further including one or more entries that each indicate a preference level for document languages; instructions for selecting a locale-specific module corresponding to the locale-specific module corresponding to the locale-specific preference, the selected locale-specific module built in a language supported by a script associated with the requested web page using one or more user-supplied definitions associating an element of the webpage in the second markup language with one or more locale-specific formattings; instructions for sending the locale-specific module to the client device for storage at the client device; and instructions for sending the requested web page to the client device for storage at the client device, wherein, when the client device encounters the element of the web page in the second markup language when executing the script, the client device uses the locale specific module to determine the one or more locale-specific formattings. 17. The non-transitory computer-readable medium of claim 14 , wherein the instructions for determining the locale-specific preference comprises instructions for determining a locale-specific preference setting of the interface. | 0.837625 |
7,784,045 | 19 | 21 | 19. A computer-implemented method for delivering, by a computer, at least one computer based test comprising: validating data for at least one computer based test with a plugin; amalgamating the data for at least one computer based test such that the data associated with the at least one computer based test exists virtually as one virtual storage location even though the data resides at different memory locations, wherein common data for at least one computer based test appears once even if used more than one time in delivering the at least one computer based test; instantiating the plugin utilized by a test driver executed by the computer that delivers the at least one computer based test, wherein amalgamated data provides information to the plugin to provide executed by the test driver to deliver the at least one computer based test, and wherein the amalgamating further comprises amalgamating the data content to exist virtually by at least one of embedding the data content as an object and linking the data content with a pointer. | 19. A computer-implemented method for delivering, by a computer, at least one computer based test comprising: validating data for at least one computer based test with a plugin; amalgamating the data for at least one computer based test such that the data associated with the at least one computer based test exists virtually as one virtual storage location even though the data resides at different memory locations, wherein common data for at least one computer based test appears once even if used more than one time in delivering the at least one computer based test; instantiating the plugin utilized by a test driver executed by the computer that delivers the at least one computer based test, wherein amalgamated data provides information to the plugin to provide executed by the test driver to deliver the at least one computer based test, and wherein the amalgamating further comprises amalgamating the data content to exist virtually by at least one of embedding the data content as an object and linking the data content with a pointer. 21. The method of claim 19 , wherein the test driver is an executable program that delivers the at least one computer based test and the plugin expands the functionality of the test driver. | 0.697115 |
8,874,541 | 1 | 3 | 1. A computer-implemented method for identifying search keywords for searching for an online information resource, the method comprising: receiving, by a social website publishing application, from a business, a request for the search keywords relating to content of the online information resource of the business; generating, in response to receiving the request, a post comprising information about the business, a request to a plurality of users in a social network to provide the search keywords relating to the content of the online information resource of the business, and a link to a search keyword recommendation page; publishing, using a social network application, the post to a newsfeed in the social network, wherein the plurality of users in the social network subscribe to the newsfeed; receiving, in response to publishing the post and from the plurality of users, a plurality of search keywords relating to the content of the online information resource from the search keyword recommendation page; ranking, in response to receiving a plurality of search keywords, the search keywords in order from most popular to least popular; presenting, to the business, search keywords based at least in part upon the ranking; receiving, from the business, a selection of at least one search keyword from the search keywords that were presented to the business; and publishing the online information resource comprising the selected at least one search keyword. | 1. A computer-implemented method for identifying search keywords for searching for an online information resource, the method comprising: receiving, by a social website publishing application, from a business, a request for the search keywords relating to content of the online information resource of the business; generating, in response to receiving the request, a post comprising information about the business, a request to a plurality of users in a social network to provide the search keywords relating to the content of the online information resource of the business, and a link to a search keyword recommendation page; publishing, using a social network application, the post to a newsfeed in the social network, wherein the plurality of users in the social network subscribe to the newsfeed; receiving, in response to publishing the post and from the plurality of users, a plurality of search keywords relating to the content of the online information resource from the search keyword recommendation page; ranking, in response to receiving a plurality of search keywords, the search keywords in order from most popular to least popular; presenting, to the business, search keywords based at least in part upon the ranking; receiving, from the business, a selection of at least one search keyword from the search keywords that were presented to the business; and publishing the online information resource comprising the selected at least one search keyword. 3. The computer-implemented method of claim 1 , wherein the search keyword recommendation page comprises a request for a specified number of search keywords relating to the content of the online information resource of the business. | 0.800344 |
8,275,808 | 17 | 19 | 17. The computer program product recited in claim 16 , further comprising associating an attribute type version with the attribute type. | 17. The computer program product recited in claim 16 , further comprising associating an attribute type version with the attribute type. 19. The computer program product recited in claim 17 , wherein the attribute type version is incremented in the event that an attribute format of an attribute in the set of attributes is modified. | 0.928258 |
9,146,967 | 1 | 2 | 1. A method of processing a query in a multi-stage query processing system having one or more processors and memory storing one or more programs for execution by the one or more processors to perform the method comprising: performing a first stage processing of a query, including: retrieving a first set of document identifiers from an index in response to one or more query terms; generating a first set of relevancy scores for a first set of compressed documents corresponding to at least a subset of the first set of document identifiers based on one or more of: presence of query terms, term frequency, and document popularity; and storing the first set of relevancy scores in the memory; performing a second stage processing of the query, including: generating a second set of relevancy scores for the documents in the first set of compressed documents based on one or more of: a list of token positions for one or more query terms in the query, distances between query terms in the documents, attributes of tokens in the documents, and text that appears around a query term used in a document of the first set of documents; and storing the second set of relevancy scores in the memory; reading the first and second set of relevancy scores from the memory, and generating an ordered list of documents for further processing based on the first and second set of relevancy scores; automatically generating additional query terms from the documents in the ordered list of documents; formulating a new query using the additional query terms; processing the new query to retrieve a second set of document identifiers from the index and to generate a third set of relevancy scores based at least in part on the additional query terms; and using the third set of relevancy scores to select a set of top documents for presentation to the user. | 1. A method of processing a query in a multi-stage query processing system having one or more processors and memory storing one or more programs for execution by the one or more processors to perform the method comprising: performing a first stage processing of a query, including: retrieving a first set of document identifiers from an index in response to one or more query terms; generating a first set of relevancy scores for a first set of compressed documents corresponding to at least a subset of the first set of document identifiers based on one or more of: presence of query terms, term frequency, and document popularity; and storing the first set of relevancy scores in the memory; performing a second stage processing of the query, including: generating a second set of relevancy scores for the documents in the first set of compressed documents based on one or more of: a list of token positions for one or more query terms in the query, distances between query terms in the documents, attributes of tokens in the documents, and text that appears around a query term used in a document of the first set of documents; and storing the second set of relevancy scores in the memory; reading the first and second set of relevancy scores from the memory, and generating an ordered list of documents for further processing based on the first and second set of relevancy scores; automatically generating additional query terms from the documents in the ordered list of documents; formulating a new query using the additional query terms; processing the new query to retrieve a second set of document identifiers from the index and to generate a third set of relevancy scores based at least in part on the additional query terms; and using the third set of relevancy scores to select a set of top documents for presentation to the user. 2. The method of claim 1 , wherein a respective token, of the tokens in the documents, is a phrase. | 0.85355 |
8,666,731 | 1 | 11 | 1. A method of processing a computer message, the method comprising: upon receipt of the computer message at a computer, classifying the computer message, wherein the classifying of the computer message includes using efficient grammatical clustering (EGC) to classify the computer message, and wherein using EGC to classify includes: determining a syntactic execution path of the computer message through an EGC program; analyzing previously determined correct structure and syntactic validity to provide a context which limits complexity of the classification; using pattern matching of the computer message against a template; and based on the syntax execution path, the determined context, and results of the pattern matching, providing a classification of the computer message; assigning the computer message to a message cluster identification in dependence thereon; and utilizing a message template to trans-denotate the computer message, wherein the message template is selected in dependence on the message cluster identification, and wherein trans-denotating of the computer message comprises: receiving the message template and the computer message; sending the message template and the computer message to a language aware tokenizer; producing, by the language aware tokenizer, input tokens from the computer message; producing, by the language aware tokenizer, template tokens from the message template; and sending the input tokens and the template tokens to a template matching process, wherein the template matching process generates a sequence of output tokens that are used to generate a corresponding output message by analyzing the sequence of output tokens with computer-readable rules to obtain patterns of the sequence of tokens by: determining a path that is taken by each of the tokens through the computer-readable rules which successfully terminates; and grouping the tokens according to the path. | 1. A method of processing a computer message, the method comprising: upon receipt of the computer message at a computer, classifying the computer message, wherein the classifying of the computer message includes using efficient grammatical clustering (EGC) to classify the computer message, and wherein using EGC to classify includes: determining a syntactic execution path of the computer message through an EGC program; analyzing previously determined correct structure and syntactic validity to provide a context which limits complexity of the classification; using pattern matching of the computer message against a template; and based on the syntax execution path, the determined context, and results of the pattern matching, providing a classification of the computer message; assigning the computer message to a message cluster identification in dependence thereon; and utilizing a message template to trans-denotate the computer message, wherein the message template is selected in dependence on the message cluster identification, and wherein trans-denotating of the computer message comprises: receiving the message template and the computer message; sending the message template and the computer message to a language aware tokenizer; producing, by the language aware tokenizer, input tokens from the computer message; producing, by the language aware tokenizer, template tokens from the message template; and sending the input tokens and the template tokens to a template matching process, wherein the template matching process generates a sequence of output tokens that are used to generate a corresponding output message by analyzing the sequence of output tokens with computer-readable rules to obtain patterns of the sequence of tokens by: determining a path that is taken by each of the tokens through the computer-readable rules which successfully terminates; and grouping the tokens according to the path. 11. The method according to claim 1 , wherein the trans-denotation serves to change the computer message to one that has improved properties and/or to change the computer message so that elements of the computer message are no longer publicly readable. | 0.501976 |
7,849,030 | 2 | 9 | 2. A computer-implemented method for determining whether a claim has merit to warrant claim recovery, the method comprising: describing, using a computer, a set of documents having unstructured and structured file data containing terms and phrases having one or more contextual bases; transforming the terms and phrases for iterating upon a classification process to create rules that classify the set of documents based upon the context; incorporating the rules into classification schema to classify the claims; generating said classification schema using said computer; wherein the schema calculates at least one score and one or more concept vectors to identify the claims that demonstrate a threshold probability for recovery. | 2. A computer-implemented method for determining whether a claim has merit to warrant claim recovery, the method comprising: describing, using a computer, a set of documents having unstructured and structured file data containing terms and phrases having one or more contextual bases; transforming the terms and phrases for iterating upon a classification process to create rules that classify the set of documents based upon the context; incorporating the rules into classification schema to classify the claims; generating said classification schema using said computer; wherein the schema calculates at least one score and one or more concept vectors to identify the claims that demonstrate a threshold probability for recovery. 9. The method of claim 2 wherein the step of processing unstructured data includes utilizing an N-Gram analysis. | 0.855297 |
9,381,426 | 1 | 3 | 1. A system for avatar display and interaction using a gesture-based paradigm, comprising: a downloadable or web-accessible software application executable on an electronic computing device; an electronic visual display, a set of physical manifestations, or a combination thereof that outputs audio and video of digital characters or avatars; a storage module for receiving and storing a basis set of poses in the form of an array of microposes on said downloadable or web-accessible software application, said array of microposes being unique to a specific avatar, said array of microposes being end positions of said avatar without transitions between each of said array of microposes; a pose indicator having a spatial or device position that corresponds to said each micropose; and an access module that accesses said stored array of microposes, such that a first indicating position of said pose indicator causes said access module to access a first resulting position of said avatar for presentation on said electronic visual or physical display, said first resulting position corresponding to a first micropose or a first blended pose synthesized from a weighted blend of two or more corresponding microposes preselected from said array of microposes, said access module further accessing said stored array of microposes, such that a second indicating position of said pose indicator causes said access module to access a second resulting position of said avatar for display on said electronic visual display, said second resulting position corresponding to a second micropose or a second blended pose synthesized from a weighted blend of two or more corresponding microposes preselected from said array of microposes, said first resulting position and said second resulting position having a transition action therebetween that does not directly correspond to said spatial position of said pose indicator, said transition action displayed on said electronic visual or physical display, said transition action occurring based on measures of virtual plausibility and physical possibility, such that when said avatar is in said first resulting position, said first micropose or said first blended pose is fully weighted, and when said avatar is in said second resulting position, said second micropose or said second blended pose is fully weighted, and when said avatar is performing said transition action, intermediate states are determined in such a way as to avoid visual implausibility and physical implausibility, whereby said system blends said first and second blended poses based on said first and second microposes, respectively, and minimizes network demand or traffic for digital puppeteering, and maximizes quality of said digital characters or avatars on said electronic visual display. | 1. A system for avatar display and interaction using a gesture-based paradigm, comprising: a downloadable or web-accessible software application executable on an electronic computing device; an electronic visual display, a set of physical manifestations, or a combination thereof that outputs audio and video of digital characters or avatars; a storage module for receiving and storing a basis set of poses in the form of an array of microposes on said downloadable or web-accessible software application, said array of microposes being unique to a specific avatar, said array of microposes being end positions of said avatar without transitions between each of said array of microposes; a pose indicator having a spatial or device position that corresponds to said each micropose; and an access module that accesses said stored array of microposes, such that a first indicating position of said pose indicator causes said access module to access a first resulting position of said avatar for presentation on said electronic visual or physical display, said first resulting position corresponding to a first micropose or a first blended pose synthesized from a weighted blend of two or more corresponding microposes preselected from said array of microposes, said access module further accessing said stored array of microposes, such that a second indicating position of said pose indicator causes said access module to access a second resulting position of said avatar for display on said electronic visual display, said second resulting position corresponding to a second micropose or a second blended pose synthesized from a weighted blend of two or more corresponding microposes preselected from said array of microposes, said first resulting position and said second resulting position having a transition action therebetween that does not directly correspond to said spatial position of said pose indicator, said transition action displayed on said electronic visual or physical display, said transition action occurring based on measures of virtual plausibility and physical possibility, such that when said avatar is in said first resulting position, said first micropose or said first blended pose is fully weighted, and when said avatar is in said second resulting position, said second micropose or said second blended pose is fully weighted, and when said avatar is performing said transition action, intermediate states are determined in such a way as to avoid visual implausibility and physical implausibility, whereby said system blends said first and second blended poses based on said first and second microposes, respectively, and minimizes network demand or traffic for digital puppeteering, and maximizes quality of said digital characters or avatars on said electronic visual display. 3. A system for avatar display and interaction as in claim 1 , further comprising: said pose indicator selecting said avatar prior to placement in said first indicating position. | 0.886912 |
9,703,833 | 4 | 5 | 4. A non-transitory computer-readable medium storing program code, the program code executable by a processor of a computing system to cause the computing system to: receive a request conforming to a modeled query and join filter criteria associated with join conditions, the request comprising a first subrequest associated with a text search result item list and a second subrequest associated with an analytical view and a table for data of the analytical view; receive, via a get service, a query ID associated with the modeled query; retrieve metadata associated with the query ID to be transmitted to a user, the metadata generated by a database administrator; transmit the modeled query based on the metadata to the user; receive an additional join filter from the user wherein the additional join filter comprises additional join filter criteria and is based on the received modeled query; define a join between the text search result item list and the table, the join associating one or more attributes of the text search result item list with one or more facets of the table, wherein definition of the join comprises embedding of the text search result item list into the table; receive search results corresponding to the text search result item list; and filter the search results and a result set of data of the analytical view based on the join, the join filter criteria and on the additional join filter criteria. | 4. A non-transitory computer-readable medium storing program code, the program code executable by a processor of a computing system to cause the computing system to: receive a request conforming to a modeled query and join filter criteria associated with join conditions, the request comprising a first subrequest associated with a text search result item list and a second subrequest associated with an analytical view and a table for data of the analytical view; receive, via a get service, a query ID associated with the modeled query; retrieve metadata associated with the query ID to be transmitted to a user, the metadata generated by a database administrator; transmit the modeled query based on the metadata to the user; receive an additional join filter from the user wherein the additional join filter comprises additional join filter criteria and is based on the received modeled query; define a join between the text search result item list and the table, the join associating one or more attributes of the text search result item list with one or more facets of the table, wherein definition of the join comprises embedding of the text search result item list into the table; receive search results corresponding to the text search result item list; and filter the search results and a result set of data of the analytical view based on the join, the join filter criteria and on the additional join filter criteria. 5. The medium according to claim 4 , wherein the analytical view comprises at least one calculated member and the text search result item list comprises at least one item. | 0.613122 |
9,305,553 | 5 | 6 | 5. The computer-based method of claim 3 wherein organizing the speech corpuses into clusters further comprises: (d) creating a second speech recognition engine based on 30 the second one of the speech corpuses; (e) applying the second speech recognition engine to produce a recognized version of the first speech corpus; and (f) calculating a second edit distance between the recognized version of the first speech corpus and the transcription of the first one of the speech corpuses. | 5. The computer-based method of claim 3 wherein organizing the speech corpuses into clusters further comprises: (d) creating a second speech recognition engine based on 30 the second one of the speech corpuses; (e) applying the second speech recognition engine to produce a recognized version of the first speech corpus; and (f) calculating a second edit distance between the recognized version of the first speech corpus and the transcription of the first one of the speech corpuses. 6. The computer-based method of claim 5 further comprising: (g) calculating an effective edit distance between the first speech corpus and the second speech corpus based on the first and second edit distances; and (h) organizing the first and second speech corpuses into the same cluster if the effective edit distance is less than a particular value. | 0.879959 |
7,664,744 | 1 | 13 | 1. A method comprising performing a machine-executed operation involving instructions, wherein said instructions are instructions which, when executed by one or more processors, cause the one or more processors to perform certain steps including: receiving a first set of query terms; for each vertical in a plurality of verticals, determining a number of previous searches that both (a) were performed based on the first set of query terms and (b) produced a set of search results, in the vertical, from which at least one search result was selected by a user; ranking verticals in the plurality of verticals based at least in part on said numbers determined for each vertical in the plurality of verticals, thereby generating a ranked list of verticals; selecting one or more selected verticals from the ranked list of verticals based on ranks of verticals in the ranked list of verticals; and presenting, for each particular vertical of the one or more selected verticals, one or more search results that are (a) generated based on the first set of query terms and (b) within the particular vertical wherein the machine-executed operation is at least one of (a) storing said instructions onto a machine-readable storage medium, or (b) executing the instructions. | 1. A method comprising performing a machine-executed operation involving instructions, wherein said instructions are instructions which, when executed by one or more processors, cause the one or more processors to perform certain steps including: receiving a first set of query terms; for each vertical in a plurality of verticals, determining a number of previous searches that both (a) were performed based on the first set of query terms and (b) produced a set of search results, in the vertical, from which at least one search result was selected by a user; ranking verticals in the plurality of verticals based at least in part on said numbers determined for each vertical in the plurality of verticals, thereby generating a ranked list of verticals; selecting one or more selected verticals from the ranked list of verticals based on ranks of verticals in the ranked list of verticals; and presenting, for each particular vertical of the one or more selected verticals, one or more search results that are (a) generated based on the first set of query terms and (b) within the particular vertical wherein the machine-executed operation is at least one of (a) storing said instructions onto a machine-readable storage medium, or (b) executing the instructions. 13. The method of claim 1 , wherein the plurality of verticals comprises two or more of: a “web” vertical, a “video” vertical, an “images” vertical, a “local” vertical, a “shopping” vertical, an “answers” vertical, an “audio” vertical, a “directory” vertical, a “jobs” vertical, and a “news” vertical. | 0.761111 |
8,224,650 | 1 | 12 | 1. A computer readable storage medium having instructions, which when executed on a computer generate client side markup for a client in a client/server system, the instructions comprising: a set of multimodal controls defined on an authoring page for a website for defining visual renderings and at least one of recognition and audible prompting on a client in a server/client system, each multimodal control on the authoring page having a first set of attributes to control a first modality of visual rendering and a second set of attributes to control a second modality of at least one of recognition and audibly prompting the multimodal controls being related to client side markup executable by a client browser the set of multimodal controls comprising: a question control for generating markup related to audible prompting of a question; and an answer control for generating markup related to a grammar for recognition, the question and answer controls being associated with a semantic map comprising one or more semantic items that form a layer between individually associated visual domain primary controls and a non-visual recognition domain of the question and answer controls, the associated visual domain primary controls comprising markup; and a module operable on a computer, the module being configured to receive the authoring page and generate client side markup executable by the client browser on the client in the server/client system in accordance with the first and second sets of attributes of the multimodal controls on the authoring page. | 1. A computer readable storage medium having instructions, which when executed on a computer generate client side markup for a client in a client/server system, the instructions comprising: a set of multimodal controls defined on an authoring page for a website for defining visual renderings and at least one of recognition and audible prompting on a client in a server/client system, each multimodal control on the authoring page having a first set of attributes to control a first modality of visual rendering and a second set of attributes to control a second modality of at least one of recognition and audibly prompting the multimodal controls being related to client side markup executable by a client browser the set of multimodal controls comprising: a question control for generating markup related to audible prompting of a question; and an answer control for generating markup related to a grammar for recognition, the question and answer controls being associated with a semantic map comprising one or more semantic items that form a layer between individually associated visual domain primary controls and a non-visual recognition domain of the question and answer controls, the associated visual domain primary controls comprising markup; and a module operable on a computer, the module being configured to receive the authoring page and generate client side markup executable by the client browser on the client in the server/client system in accordance with the first and second sets of attributes of the multimodal controls on the authoring page. 12. The computer readable storage medium of claim 1 , wherein the set of controls access and use a first library for the visual rendering and a second library for the at least one of recognition and audibly prompting, the first library including methods for generating the client side markup and a plurality of event handlers, the first library further comprising a plurality of website authoring tools, the second library including markup information for performing the at least one of recognition and audibly prompting. | 0.824105 |
8,601,578 | 14 | 16 | 14. The method of claim 10 , wherein the selected one of the business listing configuration rules includes a threshold; and the method further comprises transmitting a threshold alert when a plurality of business listings having been identified as being potentially suspicious business listings exceeds the threshold. | 14. The method of claim 10 , wherein the selected one of the business listing configuration rules includes a threshold; and the method further comprises transmitting a threshold alert when a plurality of business listings having been identified as being potentially suspicious business listings exceeds the threshold. 16. The method of claim 14 , wherein the threshold is a percentage of business listings that have been identified as being potentially suspicious business listings. | 0.960915 |
4,689,682 | 9 | 10 | 9. A method according to claim 6, wherein address words of the third sequence that define locations of the input scene having a second selected spatial relationship with said predetermined location, the second selected spatial relationship and the first-mentioned selected spatial relationship being mutually exclusive, are modified by combining each of them with a second offset word. | 9. A method according to claim 6, wherein address words of the third sequence that define locations of the input scene having a second selected spatial relationship with said predetermined location, the second selected spatial relationship and the first-mentioned selected spatial relationship being mutually exclusive, are modified by combining each of them with a second offset word. 10. A method according to claim 9, wherein the address words of the third sequence that define locations of the input scene having the first-mentioned selected spatial relationship with said predetermined location are modified by adding each of them to the first-mentioned offset word and the address words of the third sequence that define locations to the input scene having the second selected spatial relationship with said predetermined location are modified by subtracting each of them from the second offset word. | 0.790323 |
9,299,344 | 6 | 7 | 6. A headset, comprising: a first microphone for receiving audio input; a memory; and a processor for executing instructions stored in the memory, the instructions comprising a sound classifier, wherein, when executing the sound classifier, the processor is configured for: receiving a plurality of frames of audio generated from the audio input received by the first microphone; analyzing each of the plurality of frames of audio; classifying a first number of the frames of audio as speech; classifying a second number of the frames of audio as non-transient background noise; classifying a third number of the frames of audio as transient noise events; and transmitting signals indicative of at least the classifications of the frames of audio to a speech recognition system. | 6. A headset, comprising: a first microphone for receiving audio input; a memory; and a processor for executing instructions stored in the memory, the instructions comprising a sound classifier, wherein, when executing the sound classifier, the processor is configured for: receiving a plurality of frames of audio generated from the audio input received by the first microphone; analyzing each of the plurality of frames of audio; classifying a first number of the frames of audio as speech; classifying a second number of the frames of audio as non-transient background noise; classifying a third number of the frames of audio as transient noise events; and transmitting signals indicative of at least the classifications of the frames of audio to a speech recognition system. 7. The headset of claim 6 , comprising a second microphone for receiving audio input, wherein, when executing the sound classifier, the processor is configured for receiving a plurality of frames of audio generated from the audio input received by the second microphone. | 0.900074 |
9,251,166 | 13 | 14 | 13. A system comprising: an application server comprising: a processor; a retrieving engine to retrieve a plurality of search queries; a layout engine to: generate a plurality of search query nodes that represent one or more of the plurality of search queries; create a visual representation of the search query nodes where one or more connections between the search query nodes indicate one or more relationships between two or more of the plurality of search queries; a partitioning engine to partition the visual representation into a plurality of tiles, each tile representing a defined portion of a rendering of the visual representation, each tile configured to be accessed independently of one or more other tiles of the plurality of tiles; and a selection module to select a tile containing one of the plurality of search query nodes corresponding to the submitted search query, from the plurality of tiles, and one or more tiles surrounding the identified tile. | 13. A system comprising: an application server comprising: a processor; a retrieving engine to retrieve a plurality of search queries; a layout engine to: generate a plurality of search query nodes that represent one or more of the plurality of search queries; create a visual representation of the search query nodes where one or more connections between the search query nodes indicate one or more relationships between two or more of the plurality of search queries; a partitioning engine to partition the visual representation into a plurality of tiles, each tile representing a defined portion of a rendering of the visual representation, each tile configured to be accessed independently of one or more other tiles of the plurality of tiles; and a selection module to select a tile containing one of the plurality of search query nodes corresponding to the submitted search query, from the plurality of tiles, and one or more tiles surrounding the identified tile. 14. The system of claim 13 , wherein the layout engine is further configured to create the visual representation by assigning Cartesian coordinates to the plurality of search queries. | 0.829291 |
8,676,793 | 12 | 15 | 12. A method for building a custom word list for use in text operations on an electronic device comprising: determining a source associated with a text item; identifying words in the text item composed by and associated with a user; and assigning a weighting to each identified word based in part on the source of the text item, wherein the source is determined based on an identity of the user associated with at least one portion of the text item. | 12. A method for building a custom word list for use in text operations on an electronic device comprising: determining a source associated with a text item; identifying words in the text item composed by and associated with a user; and assigning a weighting to each identified word based in part on the source of the text item, wherein the source is determined based on an identity of the user associated with at least one portion of the text item. 15. The method of claim 12 , further comprising adjusting the weighting of an identified word when the word is used in text operations on the electronic device. | 0.858907 |
7,752,082 | 19 | 20 | 19. The apparatus as claimed in claim 17 , wherein said one or more functions apply to said plurality of reviews when one or more reviews are syndicated to a requesting user, wherein accepting input from said subject-owner is responsive to verifying said subject-owner. | 19. The apparatus as claimed in claim 17 , wherein said one or more functions apply to said plurality of reviews when one or more reviews are syndicated to a requesting user, wherein accepting input from said subject-owner is responsive to verifying said subject-owner. 20. The apparatus as claimed in claim 19 , wherein said plurality of reviews includes a first review and a second review and wherein said one or more functions includes a filtering function, said filtering function configured such that said second review is not included in said syndication. | 0.865899 |
8,355,916 | 11 | 12 | 11. The apparatus of claim 7 wherein the generating the first mode recognition lattice is further based on a first mode feature lattice. | 11. The apparatus of claim 7 wherein the generating the first mode recognition lattice is further based on a first mode feature lattice. 12. The apparatus of claim 11 further comprising: means for generating the first mode feature lattice based on the utterance. | 0.910587 |
9,038,016 | 15 | 17 | 15. A system comprising: a memory storing an executable graphical model; and a processor configured to: receive a graphical specification of a parent class of graphical objects in a graphical modeling environment; receive a graphical specification of a first child class of graphical objects and a second child class of graphical objects in the graphical modeling environment, wherein: the first child class of graphical objects is a first subclass of the parent class of graphical objects in a hierarchy of classes of graphical objects, the second child class of graphical objects is a second subclass of the parent class of graphical objects in the hierarchy of classes of graphical objects, and the first child class of graphical objects and the second child class of graphical objects depend respectively on the parent class of graphical objects for common features that are shared by the first child class of graphical objects and the second child class of graphical objects; receive an instruction to incorporate an instance of the parent class of graphical objects into an executable graphical model in the graphical modeling environment; instantiate an instance of the first child class of graphical objects and an instance of the second child class of graphical objects in the executable graphical model; execute the executable graphical model; and dynamically switch between the instance of the first child class of graphical objects and the instance of the second child class of graphical objects during the execution of the executable graphical model. | 15. A system comprising: a memory storing an executable graphical model; and a processor configured to: receive a graphical specification of a parent class of graphical objects in a graphical modeling environment; receive a graphical specification of a first child class of graphical objects and a second child class of graphical objects in the graphical modeling environment, wherein: the first child class of graphical objects is a first subclass of the parent class of graphical objects in a hierarchy of classes of graphical objects, the second child class of graphical objects is a second subclass of the parent class of graphical objects in the hierarchy of classes of graphical objects, and the first child class of graphical objects and the second child class of graphical objects depend respectively on the parent class of graphical objects for common features that are shared by the first child class of graphical objects and the second child class of graphical objects; receive an instruction to incorporate an instance of the parent class of graphical objects into an executable graphical model in the graphical modeling environment; instantiate an instance of the first child class of graphical objects and an instance of the second child class of graphical objects in the executable graphical model; execute the executable graphical model; and dynamically switch between the instance of the first child class of graphical objects and the instance of the second child class of graphical objects during the execution of the executable graphical model. 17. The system of claim 15 , wherein: the instance of the parent class of graphical objects is a variable graphical object that contains the first child class of graphical objects and the second child class of graphical objects, and the dynamically switching comprises switching the variable graphical object between the instance of the first child class of graphical objects and the instance of the second child class of graphical objects. | 0.501134 |
7,548,895 | 33 | 34 | 33. The computer-implemented method of claim 31 further comprising: employing environmental or contextual information to facilitate in determining an apparent intent. | 33. The computer-implemented method of claim 31 further comprising: employing environmental or contextual information to facilitate in determining an apparent intent. 34. The method of claim 33 , further comprising: dynamically detecting an apparent intent related to a task while monitoring a human communication session between a user and a second party over a communication network by performing phrase recognition of spoken or textual content, the dynamic detecting assisted by the contextual or environmental information of time of day, day of the week, and device used by the user for the human communication session; prompting the user with the candidate task following the trigger event of termination of the communication session for confirmation of a candidate task associated with the detected intent; and storing a confirmed task referenced to context of the human communication session in a computer-readable storage medium for execution by an application on a computer for the user. | 0.500602 |
9,891,819 | 1 | 4 | 1. A method of inputting characters in a portable terminal, comprising the steps of: displaying a plurality of characters on a keyboard; detecting a touch on the keyboard; displaying a first character corresponding to a key corresponding to the touch on the keyboard as enlarged relative to other characters upon detecting the touch; displaying a second character corresponding to a key corresponding to a touch-move on the keyboard as enlarged relative to other characters on the keyboard upon detecting the touch-move without a release of the touch; displaying the second character, which is displayed enlarged when detecting the release of the touch, in a character input area upon detecting the release of the touch on the keyboard; and in response to displaying the second character, displaying a plurality of recommended words in a vicinity of the keyboard in the character input area, wherein the recommended words are determined based on the second character and other characters which have been displayed in the character input area. | 1. A method of inputting characters in a portable terminal, comprising the steps of: displaying a plurality of characters on a keyboard; detecting a touch on the keyboard; displaying a first character corresponding to a key corresponding to the touch on the keyboard as enlarged relative to other characters upon detecting the touch; displaying a second character corresponding to a key corresponding to a touch-move on the keyboard as enlarged relative to other characters on the keyboard upon detecting the touch-move without a release of the touch; displaying the second character, which is displayed enlarged when detecting the release of the touch, in a character input area upon detecting the release of the touch on the keyboard; and in response to displaying the second character, displaying a plurality of recommended words in a vicinity of the keyboard in the character input area, wherein the recommended words are determined based on the second character and other characters which have been displayed in the character input area. 4. The method of claim 1 , wherein the second character is displayed as enlarged near its corresponding key or in a predetermined portion of the character input area. | 0.677043 |
9,805,712 | 1 | 4 | 1. A method for recognizing a voice, comprising: collecting, with a processor, voice information input by a user; extracting, with the processor, characteristics from the voice information to obtain characteristic information; decoding, with the processor, the characteristic information according to an acoustic model and a language model obtained in advance to obtain recognized voice information, wherein the acoustic model is obtained by data compression in advance; wherein decoding the characteristic information according to an acoustic model and a language model obtained in advance to obtain recognized voice information comprises: performing a data compression on the characteristic information to obtain compressed characteristic information, and calculating the compressed characteristic information according to the acoustic model that is obtained by the data compression in advance to obtain a score of acoustic model; calculating data after acoustic model scoring according to the language model to obtain a score of language model; obtaining the recognized voice information according to the score of acoustic model and the score of language model. | 1. A method for recognizing a voice, comprising: collecting, with a processor, voice information input by a user; extracting, with the processor, characteristics from the voice information to obtain characteristic information; decoding, with the processor, the characteristic information according to an acoustic model and a language model obtained in advance to obtain recognized voice information, wherein the acoustic model is obtained by data compression in advance; wherein decoding the characteristic information according to an acoustic model and a language model obtained in advance to obtain recognized voice information comprises: performing a data compression on the characteristic information to obtain compressed characteristic information, and calculating the compressed characteristic information according to the acoustic model that is obtained by the data compression in advance to obtain a score of acoustic model; calculating data after acoustic model scoring according to the language model to obtain a score of language model; obtaining the recognized voice information according to the score of acoustic model and the score of language model. 4. The method according to claim 1 , wherein calculating the compressed characteristic information comprises: performing a parallel computation on the compressed characteristic information. | 0.668421 |
7,966,556 | 1 | 8 | 1. A method comprising: receiving from a reviewer a plurality of comments about a word processing document, the comments including a first and second comment; associating the comments with the word processing document; assigning the comments to a plurality of editors, including assigning the first comment to a first editor and assigning the second comment to a second editor; and presenting at least one of the first comment to the first editor and the second comment to the second editor. | 1. A method comprising: receiving from a reviewer a plurality of comments about a word processing document, the comments including a first and second comment; associating the comments with the word processing document; assigning the comments to a plurality of editors, including assigning the first comment to a first editor and assigning the second comment to a second editor; and presenting at least one of the first comment to the first editor and the second comment to the second editor. 8. The method of claim 1 , wherein the reviewers and the plurality of editors share a single copy of the word processing document. | 0.870775 |
10,162,883 | 1 | 4 | 1. A method for automatically linking text to concepts in a knowledge base using a differential analysis, the method comprising: receiving, at a computer system, a plurality of text strings; building a conceptual index that links the text strings to the knowledge base, the building comprising for each of the text strings: selecting a plurality of data sources that correspond to at least a subset of the concepts in the knowledge base, the selecting based on contents of the text string; calculating, for each of the selected data sources, a probability that the text string is output by a language model built using the selected data source; calculating a probability that the text string is output by a generic language model that is not related to any particular concept in the knowledge base; calculating link confidence scores for each of the at least a subset of the concepts based on a differential analysis of the probabilities; and creating an entry in the conceptual index that includes a link between the text string and one of the concepts in the knowledge base, the creating based at least in part on a link confidence score of the concept being more than a first threshold value away from a prescribed threshold; generating a conceptual inverted index based on entries in the conceptual index, each entry of the conceptual inverted index corresponding to a different one of the concepts in the knowledge base and comprising pointers to at least a subset of text strings of the plurality of text strings linked to the concept in the conceptual index; receiving a query from an agent external to the computer system, the query specifying a concept in the knowledge base; processing the query by the computer system, the processing comprising searching the conceptual inverted index for the concept specified in the query and returning a pointer to a text string in an entry of the conceptual inverted index corresponding to the concept; and returning a set of documents to the external agent through the use of the conceptual inverted index, based on the received query. | 1. A method for automatically linking text to concepts in a knowledge base using a differential analysis, the method comprising: receiving, at a computer system, a plurality of text strings; building a conceptual index that links the text strings to the knowledge base, the building comprising for each of the text strings: selecting a plurality of data sources that correspond to at least a subset of the concepts in the knowledge base, the selecting based on contents of the text string; calculating, for each of the selected data sources, a probability that the text string is output by a language model built using the selected data source; calculating a probability that the text string is output by a generic language model that is not related to any particular concept in the knowledge base; calculating link confidence scores for each of the at least a subset of the concepts based on a differential analysis of the probabilities; and creating an entry in the conceptual index that includes a link between the text string and one of the concepts in the knowledge base, the creating based at least in part on a link confidence score of the concept being more than a first threshold value away from a prescribed threshold; generating a conceptual inverted index based on entries in the conceptual index, each entry of the conceptual inverted index corresponding to a different one of the concepts in the knowledge base and comprising pointers to at least a subset of text strings of the plurality of text strings linked to the concept in the conceptual index; receiving a query from an agent external to the computer system, the query specifying a concept in the knowledge base; processing the query by the computer system, the processing comprising searching the conceptual inverted index for the concept specified in the query and returning a pointer to a text string in an entry of the conceptual inverted index corresponding to the concept; and returning a set of documents to the external agent through the use of the conceptual inverted index, based on the received query. 4. The method of claim 1 , wherein the generic language model is derived from a generic data source not specific to any of the concepts in the knowledge base. | 0.764881 |
7,752,193 | 11 | 13 | 11. The method of claim 8 further comprising: generating one or more tables storing information on the one or more variations for each of the normalized words, wherein, the query engine is configured to search the one or more tables for information on the one or more variations matching the input query word responsive to a command to consider the one or more variations. | 11. The method of claim 8 further comprising: generating one or more tables storing information on the one or more variations for each of the normalized words, wherein, the query engine is configured to search the one or more tables for information on the one or more variations matching the input query word responsive to a command to consider the one or more variations. 13. The method of claim 11 , wherein the variation of one of the normalized words includes a casing variation. | 0.966133 |
8,019,656 | 33 | 34 | 33. The product summary generator of claim 32 , wherein characteristics of peer products in the class of peer products cause a change in a scalarization range of the existing attribute value of the selected product, thereby introducing a new assertion based upon a changed relative position of the selected product in the peer class. | 33. The product summary generator of claim 32 , wherein characteristics of peer products in the class of peer products cause a change in a scalarization range of the existing attribute value of the selected product, thereby introducing a new assertion based upon a changed relative position of the selected product in the peer class. 34. The product summary generator of claim 33 , wherein the characteristics of peer products in the class of peer products includes the number or type of peer products. | 0.96129 |
8,938,394 | 9 | 12 | 9. A first computing device, comprising: at least one processor; and at least one module, operable by the at least one processor, to: determine a context of the first computing device, the context including an indication that a second computing device is proximate to the first computing device; determine, based at least in part on the context, a subset of contextual audio triggers from a plurality of contextual audio triggers, each contextual audio trigger from the plurality of contextual audio triggers usable to initiate interaction with the first computing device, wherein each contextual audio trigger from the subset of contextual audio triggers is associated with a respective operation of the first computing device and with the context of the first computing device, and wherein one of the subset of contextual audio triggers is associated with a first operation to cause the second computing device to perform a second operation; receive audio data; and responsive to determining that a portion of the audio data corresponds to a particular contextual audio trigger from the subset of contextual audio triggers, perform the respective operation associated with the particular contextual audio trigger. | 9. A first computing device, comprising: at least one processor; and at least one module, operable by the at least one processor, to: determine a context of the first computing device, the context including an indication that a second computing device is proximate to the first computing device; determine, based at least in part on the context, a subset of contextual audio triggers from a plurality of contextual audio triggers, each contextual audio trigger from the plurality of contextual audio triggers usable to initiate interaction with the first computing device, wherein each contextual audio trigger from the subset of contextual audio triggers is associated with a respective operation of the first computing device and with the context of the first computing device, and wherein one of the subset of contextual audio triggers is associated with a first operation to cause the second computing device to perform a second operation; receive audio data; and responsive to determining that a portion of the audio data corresponds to a particular contextual audio trigger from the subset of contextual audio triggers, perform the respective operation associated with the particular contextual audio trigger. 12. The first computing device of claim 9 , wherein the context includes an indication of an application executing at the first computing device, and wherein each contextual audio trigger from the subset of contextual audio triggers is associated with a respective operation performed by the application executing at the first computing device. | 0.771883 |
8,340,385 | 20 | 24 | 20. The non-transitory computer readable medium of claim 18 , wherein the computer executable instructions defining the step of selecting one of the plurality LV candidates by ranking the plurality of LV candidates based on geometrical relationships between each detected LV candidate and the other detected LV candidates, between each detected LV candidate and the detected apex candidates, and between each detected LV candidate and the detected base candidates using a trained ranking model comprise computer executable instructions defining the steps of: extracting a plurality of features for each detected LV candidate, said features including a first group of features based on geometrical relationships between each detected LV candidate and the other detected LV candidates, a second group of features based on geometrical relationships between each detected LV candidate and the detected apex candidates, and a third group of features based on geometrical relationships between each detected LV candidate and the detected base candidates; and ranking the plurality of LV candidates based on the extracted features using the trained ranking model. | 20. The non-transitory computer readable medium of claim 18 , wherein the computer executable instructions defining the step of selecting one of the plurality LV candidates by ranking the plurality of LV candidates based on geometrical relationships between each detected LV candidate and the other detected LV candidates, between each detected LV candidate and the detected apex candidates, and between each detected LV candidate and the detected base candidates using a trained ranking model comprise computer executable instructions defining the steps of: extracting a plurality of features for each detected LV candidate, said features including a first group of features based on geometrical relationships between each detected LV candidate and the other detected LV candidates, a second group of features based on geometrical relationships between each detected LV candidate and the detected apex candidates, and a third group of features based on geometrical relationships between each detected LV candidate and the detected base candidates; and ranking the plurality of LV candidates based on the extracted features using the trained ranking model. 24. The non-transitory computer readable medium of claim 20 , wherein the trained ranking model is trained based on geometrical relationships between LV candidates, apex candidates, and base candidates detected in annotated training data. | 0.869945 |
8,423,952 | 1 | 9 | 1. A method for automatic extraction of process goals from a semantically annotated structured process model of a process comprising model elements comprising functions and events named by natural language expressions and annotated with semantic linkages to a reference process ontology comprising the steps of: (a) splitting said process model, at each exit split connector that leads to more than one end event, into a plurality of partial process models separated for each end event of said process model, such that each partial process model of the plurality of partial process models has one or more of the model elements and only one end event; (b) creating for each partial process model an annotated partial process model by separately annotating the one or more of the model elements of each partial process model with extracted process goals and constraints, such that (1) each start event is annotated with an extracted root goal constraint, (2) each function is annotated with an extracted process goal, (3) each event is annotated with an extracted local goal constraint, and (4) the end event is annotated with an extracted root goal, wherein each process goal represents a purpose or an outcome of process; (c) decoupling of the process goals from each annotated partial process model; and (d) generating a hierarchical process goal tree for each annotated partial process model by organizing the decoupled process goals as goal nodes into the hierarchical process goal tree starting with the end event as a root goal node that is decomposed into a set of subgoals by inserting the goal nodes and decomposition nodes into the goal tree depending on the annotated model elements detected. | 1. A method for automatic extraction of process goals from a semantically annotated structured process model of a process comprising model elements comprising functions and events named by natural language expressions and annotated with semantic linkages to a reference process ontology comprising the steps of: (a) splitting said process model, at each exit split connector that leads to more than one end event, into a plurality of partial process models separated for each end event of said process model, such that each partial process model of the plurality of partial process models has one or more of the model elements and only one end event; (b) creating for each partial process model an annotated partial process model by separately annotating the one or more of the model elements of each partial process model with extracted process goals and constraints, such that (1) each start event is annotated with an extracted root goal constraint, (2) each function is annotated with an extracted process goal, (3) each event is annotated with an extracted local goal constraint, and (4) the end event is annotated with an extracted root goal, wherein each process goal represents a purpose or an outcome of process; (c) decoupling of the process goals from each annotated partial process model; and (d) generating a hierarchical process goal tree for each annotated partial process model by organizing the decoupled process goals as goal nodes into the hierarchical process goal tree starting with the end event as a root goal node that is decomposed into a set of subgoals by inserting the goal nodes and decomposition nodes into the goal tree depending on the annotated model elements detected. 9. The method according to claim 1 , wherein the decoupling of the process goals from the annotated partial process models is performed by a goal tree construction algorithm starting with a semantically annotated end event of the respective partial process model. | 0.659326 |
8,326,343 | 3 | 5 | 3. The mobile communication terminal of claim 1 , further comprising a memory unit for storing a plurality of speech data sets and information regarding mappings between depths of objects and the speech data sets. | 3. The mobile communication terminal of claim 1 , further comprising a memory unit for storing a plurality of speech data sets and information regarding mappings between depths of objects and the speech data sets. 5. The mobile communication terminal of claim 3 , wherein the memory unit stores mapping information in which the depths of objects are mapped to the stored speech data sets in a one-to-one manner according to a user selection. | 0.850066 |
8,489,529 | 3 | 4 | 3. The method of claim 1 , wherein each module is a single-hidden layer neural network. | 3. The method of claim 1 , wherein each module is a single-hidden layer neural network. 4. The method of claim 3 , wherein a hidden layer in the single-hidden layer neural network comprises a plurality of sigmoidal units. | 0.922494 |
9,652,787 | 11 | 14 | 11. The method of claim 8 , wherein the generating of the message comprises: for each lexical slot in the plurality of lexical slots: accessing the corpus of source data corresponding to the lexical slot; selecting a term from the corpus of source data in accordance with the grammatical constraint corresponding to the lexical slot; and populating the lexical slot with the selected term. | 11. The method of claim 8 , wherein the generating of the message comprises: for each lexical slot in the plurality of lexical slots: accessing the corpus of source data corresponding to the lexical slot; selecting a term from the corpus of source data in accordance with the grammatical constraint corresponding to the lexical slot; and populating the lexical slot with the selected term. 14. The method of claim 11 , wherein the selecting of the term is based on trending information obtained from the social network platform. | 0.936813 |
8,271,936 | 23 | 24 | 23. The medium of claim 20 , wherein the criteria is added based on design considerations. | 23. The medium of claim 20 , wherein the criteria is added based on design considerations. 24. The medium of claim 23 , wherein the design considerations comprise at least one of optimal memory usage or optimal execution efficiency. | 0.951844 |
8,667,414 | 1 | 8 | 1. A method comprising: receiving, by a device, an indication of a gesture input at a portion of a presence-sensitive surface associated with a virtual keyboard, the virtual keyboard comprising a set of virtual keys, each virtual key from the set of virtual keys being associated with a region of the presence-sensitive surface; defining, by the device, a series of input points that represent a path of the gesture input across the virtual keyboard; defining, by the device, respective sets of anchor points corresponding to respective words in a set of candidate words, each of the anchor points corresponding to a location of the presence-sensitive surface associated with a virtual key from the set of virtual keys; identifying, by the device, for each respective anchor point in each of the sets of anchor points, a respective relevant input point in the series of input points; determining, by the device, a respective distance score for each respective anchor point in the sets of anchor points, wherein for each respective anchor point in the sets of anchor points, the respective distance score for the respective anchor point is based at least in part on a distance on the presence-sensitive surface between the respective anchor point and the respective relevant input point for the respective anchor point, wherein determining the respective distance score for each respective anchor point in each respective set of anchor points comprises adjusting, by the device, the respective distance score for the respective anchor point in response to determining that the respective anchor point is not a closest one of the anchor points in the respective set of anchor points to the respective relevant input point for the respective anchor point; and identifying, by the device, based at least in part on the respective distance scores for the respective anchor points, a word in the set of candidate words that corresponds to the gesture input. | 1. A method comprising: receiving, by a device, an indication of a gesture input at a portion of a presence-sensitive surface associated with a virtual keyboard, the virtual keyboard comprising a set of virtual keys, each virtual key from the set of virtual keys being associated with a region of the presence-sensitive surface; defining, by the device, a series of input points that represent a path of the gesture input across the virtual keyboard; defining, by the device, respective sets of anchor points corresponding to respective words in a set of candidate words, each of the anchor points corresponding to a location of the presence-sensitive surface associated with a virtual key from the set of virtual keys; identifying, by the device, for each respective anchor point in each of the sets of anchor points, a respective relevant input point in the series of input points; determining, by the device, a respective distance score for each respective anchor point in the sets of anchor points, wherein for each respective anchor point in the sets of anchor points, the respective distance score for the respective anchor point is based at least in part on a distance on the presence-sensitive surface between the respective anchor point and the respective relevant input point for the respective anchor point, wherein determining the respective distance score for each respective anchor point in each respective set of anchor points comprises adjusting, by the device, the respective distance score for the respective anchor point in response to determining that the respective anchor point is not a closest one of the anchor points in the respective set of anchor points to the respective relevant input point for the respective anchor point; and identifying, by the device, based at least in part on the respective distance scores for the respective anchor points, a word in the set of candidate words that corresponds to the gesture input. 8. The method of claim 1 , wherein the word is a first word and the method comprises: determining, by the device, respective anchor scores for respective words in the set of candidate words, the respective anchor scores for the respective words based at least in part on the distance scores for the anchor points that correspond to the respective words; pruning, by the device, one or more words from the set of candidate words based at least in part on the respective anchor scores for the respective words; after pruning the one or more words from the set of candidate words based at least in part on the respective anchor scores for the respective words, determining, by the device, respective shape scores for respective words remaining in the set of candidate words, the respective shape scores for the respective words remaining in the set of candidate words being based at least in part on distances between the input points and closest points on shape templates for the respective words remaining in the set of candidate words; and identifying, by the device, based at least in part on the respective anchor scores and the respective shape scores for the respective words remaining in the set of candidate words, that the first word corresponds to the gesture input. | 0.500392 |
7,912,724 | 1 | 17 | 1. A method, comprising: performing by a computer: accessing a set containing a limited number of phoneme sequences, wherein each phoneme sequence comprises one or more phonemes; associating each advertising file of a plurality of advertising files with one or more of the limited number of phoneme sequences, wherein said associating is based on comparing at least one sequence of one or more phonemes present within audio data of the advertising file to the set of phoneme sequences; analyzing requested content, wherein said analyzing is based on comparing at least one sequence of one or more phonemes present within audio data of the requested content to the set of phoneme sequences; and matching one of the plurality of advertising files to the requested content, wherein said matching is based on results of said associating and said analyzing. | 1. A method, comprising: performing by a computer: accessing a set containing a limited number of phoneme sequences, wherein each phoneme sequence comprises one or more phonemes; associating each advertising file of a plurality of advertising files with one or more of the limited number of phoneme sequences, wherein said associating is based on comparing at least one sequence of one or more phonemes present within audio data of the advertising file to the set of phoneme sequences; analyzing requested content, wherein said analyzing is based on comparing at least one sequence of one or more phonemes present within audio data of the requested content to the set of phoneme sequences; and matching one of the plurality of advertising files to the requested content, wherein said matching is based on results of said associating and said analyzing. 17. The method of claim 1 , wherein the plurality of advertising files are classified according to product categories. | 0.857488 |
10,073,839 | 13 | 14 | 13. A computer program product for enhancing language, the computer program product comprising a computer readable storage device having program code stored thereon, wherein the computer readable storage device is not a transitory, propagating signal per se, the program code executable by a processor to perform a method comprising: automatically gathering, by the processor, source text from a plurality of text sources, wherein at least a portion of the source text is stored as natural language documents, the plurality of text sources including at least one social media website, and storing the source text to a thesaurus data infrastructure; receiving, by the processor, subject text being exposed to thesaurus processing; identifying, by the processor, a context of the subject text; identifying, by the processor, source text having context similar to the context of the subject text by accessing the thesaurus data infrastructure and processing the source text using dynamically created rules to identify the source text having context similar to the context of the subject text, the dynamically created rules generated by performing initial processing on the source text when the source text is gathered; analyzing, by the processor, the identified source text to identify at least one candidate word or phrase contained in the source text to recommend as a replacement for at least one word or phrase contained in the subject text by performing natural language inference processing on the source text stored as natural language documents; and recommending, by the processor, the identified at least one candidate word or phrase as the replacement for the at least one word or phrase contained in the subject text by presenting the at least one candidate word or phrase on a display; wherein the recommendations follow the thesaurus further querying previously acquired source texts or documents having similar context. | 13. A computer program product for enhancing language, the computer program product comprising a computer readable storage device having program code stored thereon, wherein the computer readable storage device is not a transitory, propagating signal per se, the program code executable by a processor to perform a method comprising: automatically gathering, by the processor, source text from a plurality of text sources, wherein at least a portion of the source text is stored as natural language documents, the plurality of text sources including at least one social media website, and storing the source text to a thesaurus data infrastructure; receiving, by the processor, subject text being exposed to thesaurus processing; identifying, by the processor, a context of the subject text; identifying, by the processor, source text having context similar to the context of the subject text by accessing the thesaurus data infrastructure and processing the source text using dynamically created rules to identify the source text having context similar to the context of the subject text, the dynamically created rules generated by performing initial processing on the source text when the source text is gathered; analyzing, by the processor, the identified source text to identify at least one candidate word or phrase contained in the source text to recommend as a replacement for at least one word or phrase contained in the subject text by performing natural language inference processing on the source text stored as natural language documents; and recommending, by the processor, the identified at least one candidate word or phrase as the replacement for the at least one word or phrase contained in the subject text by presenting the at least one candidate word or phrase on a display; wherein the recommendations follow the thesaurus further querying previously acquired source texts or documents having similar context. 14. The computer program product of claim 13 , wherein the at least one candidate word or phrase contained in the source text comprises a plurality of candidate words or phrases, the method further comprising: Assigning, using the processor, a ranking to each of the of the candidate words or phrases, each ranking assigned to a respective candidate word or phrase indicating a level of confidence that the respective candidate word or phrase is an appropriate replacement for the word or phrase contained in the subject text. | 0.500949 |
9,390,197 | 1 | 10 | 1. A method comprising: receiving first activity information for a sender of a message sent to at least one recipient by a collection resource at a Web site, wherein the message comprises text associated with the Web site, the collection resource adds a first link to the message, and no personally identifiable information of the sender is collected in collecting the first activity information; storing the first activity information at a storage server; receiving second activity information when a first recipient accesses the first link sent by the sender corresponding to the first activity information stored at the storage server, wherein no personally identifiable information of the first recipient is collected in the second activity information; using at least one processor, using the first activity information to identify a first node in a social graph as being representative of the sender; using the second activity information to identify a second node in the social graph as being representative of the first recipient; determining a category for the first link as a first category type; identifying a first edge between the first and second nodes is representative of the first category type; in the social graph, updating a value of the first edge between the first and second nodes; when the sender sends the message to the first recipient and a second recipient, and the first recipient accesses the first link, updating the value of the first edge between the first and second nodes by a first amount; and when the sender sends the message to only the first recipient and no other recipients, and the first recipient accesses the first link, updating the value of the first edge between the first and second nodes by a second amount, wherein the second amount is greater than the first amount. | 1. A method comprising: receiving first activity information for a sender of a message sent to at least one recipient by a collection resource at a Web site, wherein the message comprises text associated with the Web site, the collection resource adds a first link to the message, and no personally identifiable information of the sender is collected in collecting the first activity information; storing the first activity information at a storage server; receiving second activity information when a first recipient accesses the first link sent by the sender corresponding to the first activity information stored at the storage server, wherein no personally identifiable information of the first recipient is collected in the second activity information; using at least one processor, using the first activity information to identify a first node in a social graph as being representative of the sender; using the second activity information to identify a second node in the social graph as being representative of the first recipient; determining a category for the first link as a first category type; identifying a first edge between the first and second nodes is representative of the first category type; in the social graph, updating a value of the first edge between the first and second nodes; when the sender sends the message to the first recipient and a second recipient, and the first recipient accesses the first link, updating the value of the first edge between the first and second nodes by a first amount; and when the sender sends the message to only the first recipient and no other recipients, and the first recipient accesses the first link, updating the value of the first edge between the first and second nodes by a second amount, wherein the second amount is greater than the first amount. 10. The method of claim 1 wherein the message comprises a video. | 0.945017 |
9,262,412 | 17 | 18 | 17. The computer-readable medium of claim 16 , wherein the first and second areas are located within a text editing area, the text editing area being separate from a text input area. | 17. The computer-readable medium of claim 16 , wherein the first and second areas are located within a text editing area, the text editing area being separate from a text input area. 18. The computer-readable medium of claim 17 , wherein the first area is located above the second area within the text editing area and below the text input area. | 0.932556 |
9,304,747 | 10 | 12 | 10. A system comprising: one or more processors configured to include: an accessing module to access first grammar data associated with a first grammar and second grammar data associated with a second grammar, wherein a grammar comprises one or more rules that define a programming language that corresponds to the grammar; a transformation module to determine from the first grammar data and the second grammar data whether the first grammar and the second grammar correspond to the same programming language, wherein determining whether the first grammar and the second grammar correspond to the same programming language includes: an application module to apply one or more transformational steps to both the first grammar data and the second grammar data; a corresponding module to, after each transformational step, determine whether the first grammar data and the second grammar data correspond; a comparison module, in accordance with a determination that the first grammar data and the second grammar data correspond, determine that the first grammar and the second grammar both correspond to the same programming language; a step selection module to, in accordance with a determination that the first grammar data and the second grammar data do not correspond, selecting a next transformational step in the one or more transformational steps, wherein prior to selecting the next transformational step: a determination module to determine whether there are any remaining transformational steps, and a difference module to, in accordance with a determination that there are no remaining transformational steps, determine that the first grammar and the second grammar do not correspond to the same programming language. | 10. A system comprising: one or more processors configured to include: an accessing module to access first grammar data associated with a first grammar and second grammar data associated with a second grammar, wherein a grammar comprises one or more rules that define a programming language that corresponds to the grammar; a transformation module to determine from the first grammar data and the second grammar data whether the first grammar and the second grammar correspond to the same programming language, wherein determining whether the first grammar and the second grammar correspond to the same programming language includes: an application module to apply one or more transformational steps to both the first grammar data and the second grammar data; a corresponding module to, after each transformational step, determine whether the first grammar data and the second grammar data correspond; a comparison module, in accordance with a determination that the first grammar data and the second grammar data correspond, determine that the first grammar and the second grammar both correspond to the same programming language; a step selection module to, in accordance with a determination that the first grammar data and the second grammar data do not correspond, selecting a next transformational step in the one or more transformational steps, wherein prior to selecting the next transformational step: a determination module to determine whether there are any remaining transformational steps, and a difference module to, in accordance with a determination that there are no remaining transformational steps, determine that the first grammar and the second grammar do not correspond to the same programming language. 12. The system of claim 10 , wherein the transformation module further includes a storing module to sort all deterministic alternatives in accordance with a predetermined sorting method. | 0.510526 |
8,224,833 | 10 | 11 | 10. An apparatus for searching a system, the apparatus comprising: an interface configured for receiving a user context that identifies a search context relative to a personal identity of an individual seeking a search result; and a context correlation resource configured for identifying a portion of a connection context as relevant to the user context, the connection context identifying relationships between chosen destinations accessible via information sources that are reachable via a network, the chosen destinations including data objects and address identifiers for identified individuals having respective personal identities, each of the relationships having a strength increased by an aggregation of artifacts recorded in the network by the system and that represent accessing of at least a corresponding first and second of the chosen destinations by different individuals having different personal identities, each artifact identifying the corresponding personal identity and the corresponding chosen destination, at least one of the relationships established based on a determined correlation between a first and a second of the artifacts recorded in response as a first of the individuals accesses the first and second of the chosen destinations using a first and a second of available user devices, respectively, the strength of the one relationship increased by the aggregation of the associated artifacts, representing the accessing of the first and second chosen destinations by the different individuals, relative to the respective determined correlations; the context correlation resource configured for generating as the search result an ordered list of destination targets, including selected identified individuals identified based on their respective personal identities and selected data objects determined as relevant to the user context, including ordering the ordered list according to the portion of the connection context, the apparatus implemented as a processor-based device. | 10. An apparatus for searching a system, the apparatus comprising: an interface configured for receiving a user context that identifies a search context relative to a personal identity of an individual seeking a search result; and a context correlation resource configured for identifying a portion of a connection context as relevant to the user context, the connection context identifying relationships between chosen destinations accessible via information sources that are reachable via a network, the chosen destinations including data objects and address identifiers for identified individuals having respective personal identities, each of the relationships having a strength increased by an aggregation of artifacts recorded in the network by the system and that represent accessing of at least a corresponding first and second of the chosen destinations by different individuals having different personal identities, each artifact identifying the corresponding personal identity and the corresponding chosen destination, at least one of the relationships established based on a determined correlation between a first and a second of the artifacts recorded in response as a first of the individuals accesses the first and second of the chosen destinations using a first and a second of available user devices, respectively, the strength of the one relationship increased by the aggregation of the associated artifacts, representing the accessing of the first and second chosen destinations by the different individuals, relative to the respective determined correlations; the context correlation resource configured for generating as the search result an ordered list of destination targets, including selected identified individuals identified based on their respective personal identities and selected data objects determined as relevant to the user context, including ordering the ordered list according to the portion of the connection context, the apparatus implemented as a processor-based device. 11. The apparatus of claim 10 , wherein the context correlation resource is configured for identifying the selected identified individuals and the selected data objects, relevant to the user context, from an information context identifying destinations in the system that are accessible by the individual. | 0.753635 |
9,881,003 | 1 | 6 | 1. A computer-implemented method comprising: receiving, by at least one processor, digital graphic novel content; producing, by at least one processor, a numerical map that represents an image extracted from the digital graphic novel content; responsive to inputting the numerical map into a first artificial neural network of a machine learning model configured to determine regions of the digital graphic novel content that are likely to include speech bubbles, receiving, by the at least one processor, from the first artificial neural network, a plurality of candidate regions of the digital graphic novel content that are likely to include speech bubbles; and responsive to inputting the plurality of candidate regions into a second artificial neural network of the machine learning model, receiving, by at least one processor, from the second artificial neural network, features of the digital graphic novel content that include a plurality of speech bubbles containing text; generating, by at least one processor, based on the features of the digital graphic novel content, contextual information corresponding to the features, the contextual information including the text of the plurality of speech bubbles in an intended reading order of the plurality of speech bubbles; and automatically translating, by at least one processor, based at least in part on the contextual information, from a first natural language to a second natural language, the text contained in the plurality of speech bubbles to produce translated text. | 1. A computer-implemented method comprising: receiving, by at least one processor, digital graphic novel content; producing, by at least one processor, a numerical map that represents an image extracted from the digital graphic novel content; responsive to inputting the numerical map into a first artificial neural network of a machine learning model configured to determine regions of the digital graphic novel content that are likely to include speech bubbles, receiving, by the at least one processor, from the first artificial neural network, a plurality of candidate regions of the digital graphic novel content that are likely to include speech bubbles; and responsive to inputting the plurality of candidate regions into a second artificial neural network of the machine learning model, receiving, by at least one processor, from the second artificial neural network, features of the digital graphic novel content that include a plurality of speech bubbles containing text; generating, by at least one processor, based on the features of the digital graphic novel content, contextual information corresponding to the features, the contextual information including the text of the plurality of speech bubbles in an intended reading order of the plurality of speech bubbles; and automatically translating, by at least one processor, based at least in part on the contextual information, from a first natural language to a second natural language, the text contained in the plurality of speech bubbles to produce translated text. 6. The computer-implemented method of claim 1 , wherein the contextual information further includes depicted weather contained in the digital graphic novel content, and automatically translating the text comprises applying a translation algorithm to the text contained in the plurality of speech bubbles that is tailored for the depicted weather contained in the digital graphic novel content. | 0.697692 |
9,661,093 | 16 | 19 | 16. An electronic device, comprising: a network interface; memory; and a processor configured to: receive, via the network interface, an enable connection monitor request that is configured to enable a liveness monitor on a Transmission Control Protocol (TCP) or User Datagram Protocol (UDP) connection monitoring between the electronic device and a remote device, wherein the enable connection monitor request comprises: a connection monitor timeout field that indicates how long a connection monitor can remain idle before the connection monitor is terminated; and a connection monitor interval field that indicates how frequently an update is sent to the remote device; and send, via the network interface, a status report indicating whether the connection monitor has successfully been enabled. | 16. An electronic device, comprising: a network interface; memory; and a processor configured to: receive, via the network interface, an enable connection monitor request that is configured to enable a liveness monitor on a Transmission Control Protocol (TCP) or User Datagram Protocol (UDP) connection monitoring between the electronic device and a remote device, wherein the enable connection monitor request comprises: a connection monitor timeout field that indicates how long a connection monitor can remain idle before the connection monitor is terminated; and a connection monitor interval field that indicates how frequently an update is sent to the remote device; and send, via the network interface, a status report indicating whether the connection monitor has successfully been enabled. 19. The electronic device of claim 16 , wherein the processor is configured to: receive, via the network interface, a disable connection monitor request to terminate the connection monitor; and send, via the network interface, a status report indicating whether a commissioning device has received the disable connection monitor and disabled the connection monitor. | 0.501366 |
9,355,568 | 16 | 20 | 16. A computer program product for implementing within a computer system a method for utilizing an electronic reader to provide output by the electronic reader at a rate corresponding to a user in order to overcome a lack of user-specific focus, the computer program product comprising: a computer-readable, non-transitory medium for providing computer program code means utilized to implement the method, wherein the computer program code means is comprised of executable code for implementing the steps for: providing, by a processor of the computer system, a text for digital access within the computer system, the computer system comprising a tactile input device and a visually perceptible output device; and emphasizing, by the processor, a word of the text when the word is selected through the use of the tactile input device, wherein the emphasizing of the word includes implementing: a first mode in which the word is visually distinguished on the visually perceptible output device from a neighboring word when a pointer passes over or near the word from any direction, and in which the word is audibly and visually emphasized at a rate determined by the user when the pointer specifically passes over or near the word in a reading direction, wherein the system is configured to require the pointer to pass over or near the word in the reading direction in order for the word to be both audibly and visually emphasized. | 16. A computer program product for implementing within a computer system a method for utilizing an electronic reader to provide output by the electronic reader at a rate corresponding to a user in order to overcome a lack of user-specific focus, the computer program product comprising: a computer-readable, non-transitory medium for providing computer program code means utilized to implement the method, wherein the computer program code means is comprised of executable code for implementing the steps for: providing, by a processor of the computer system, a text for digital access within the computer system, the computer system comprising a tactile input device and a visually perceptible output device; and emphasizing, by the processor, a word of the text when the word is selected through the use of the tactile input device, wherein the emphasizing of the word includes implementing: a first mode in which the word is visually distinguished on the visually perceptible output device from a neighboring word when a pointer passes over or near the word from any direction, and in which the word is audibly and visually emphasized at a rate determined by the user when the pointer specifically passes over or near the word in a reading direction, wherein the system is configured to require the pointer to pass over or near the word in the reading direction in order for the word to be both audibly and visually emphasized. 20. The computer program product of claim 16 , further comprising executable code for implementing a step for gathering information about the user's use of the computer program product over a plurality of uses of such product. | 0.918647 |
10,037,491 | 16 | 17 | 16. The system of claim 1 , wherein to determine a context sentiment type includes using a learning machine that is trained using sample context known to be positive sentiment-entailing, negative sentiment-entailing, or neutral. | 16. The system of claim 1 , wherein to determine a context sentiment type includes using a learning machine that is trained using sample context known to be positive sentiment-entailing, negative sentiment-entailing, or neutral. 17. The system of claim 16 , wherein the learning machine includes a decision tree, a neural network, a Bayesian classifier, or a support vector machine. | 0.958893 |
8,272,025 | 7 | 8 | 7. A software program stored in a computer system to identify policy conflicts between a base policy and a changed policy, the software program comprising: a first code segment that generates a first graph that represents the base policy, the first graph including a plurality of base nodes and one or more base edges, each of the base nodes having a content and an identity, the content of each of the base nodes representing an attribute, a logic statement and/or a decision statement of the base policy, and the base edges representing one or more semantic relationships among the base nodes; a second code segment that generates the identity of each base node by hashing the content of the base node and an identity of each child-base node of the base node; a third code segment that generates a second graph that represents the changed policy, the second graph including a plurality of changed nodes and one or more changed edges, each of the changed nodes having a content and an identity, the content of each of the changed nodes representing an attribute, a logic statement and/or a decision statement of the changed policy, and the changed edges representing one or more semantic relationships among the changed nodes; a fourth code segment that generates the identity of each changed node by hashing the content of the changed node and an identity of each child-changed node of the changed node; a fifth code segment that compares base decision paths against changed decision paths, each of the base decision paths extending from a base root-node to a base node whose content represents a base decision, each of the changed decision paths extending from a changed root-node to a changed node whose content represents a changed decision; and a sixth code segment that outputs a base decision path that does not have a corresponding changed decision path, and a changed decision path that does not have a corresponding base decision path as potentially conflicting paths. | 7. A software program stored in a computer system to identify policy conflicts between a base policy and a changed policy, the software program comprising: a first code segment that generates a first graph that represents the base policy, the first graph including a plurality of base nodes and one or more base edges, each of the base nodes having a content and an identity, the content of each of the base nodes representing an attribute, a logic statement and/or a decision statement of the base policy, and the base edges representing one or more semantic relationships among the base nodes; a second code segment that generates the identity of each base node by hashing the content of the base node and an identity of each child-base node of the base node; a third code segment that generates a second graph that represents the changed policy, the second graph including a plurality of changed nodes and one or more changed edges, each of the changed nodes having a content and an identity, the content of each of the changed nodes representing an attribute, a logic statement and/or a decision statement of the changed policy, and the changed edges representing one or more semantic relationships among the changed nodes; a fourth code segment that generates the identity of each changed node by hashing the content of the changed node and an identity of each child-changed node of the changed node; a fifth code segment that compares base decision paths against changed decision paths, each of the base decision paths extending from a base root-node to a base node whose content represents a base decision, each of the changed decision paths extending from a changed root-node to a changed node whose content represents a changed decision; and a sixth code segment that outputs a base decision path that does not have a corresponding changed decision path, and a changed decision path that does not have a corresponding base decision path as potentially conflicting paths. 8. The software program stored in the computer system of claim 7 wherein the first graph and the second graph are acyclic graphs. | 0.952222 |
7,613,719 | 18 | 20 | 18. A method of processing information to drive an application, comprising: providing an interactive interface to a user for entering a natural language input; receiving the natural language input; analyzing the natural language input to identify semantic information contained therein; accessing a schema to identify a command object, a frame object and an entity object based on the semantic information and the natural language input, the command object identifying a command performed in the application, the frame object identifying how to render data retrieved from a data source stored in a computer storage medium and the entity object associated with a portion of the retrieved data that is designated for use by the application; and performing an action associated with the application based on the command object, the frame object and the entity object wherein the action includes rendering all of the designated data into each of a plurality of candidate tables based on a plurality of candidate interpretations of semantic information provided in the natural language input wherein rendering each of the candidate tables includes having the frame object associate the entity object with the command object such that the frame object defines what portion of the designated data identified by the entity object is displayed in the columns and what portion of the designated data identified by the entity object is displayed in the rows. | 18. A method of processing information to drive an application, comprising: providing an interactive interface to a user for entering a natural language input; receiving the natural language input; analyzing the natural language input to identify semantic information contained therein; accessing a schema to identify a command object, a frame object and an entity object based on the semantic information and the natural language input, the command object identifying a command performed in the application, the frame object identifying how to render data retrieved from a data source stored in a computer storage medium and the entity object associated with a portion of the retrieved data that is designated for use by the application; and performing an action associated with the application based on the command object, the frame object and the entity object wherein the action includes rendering all of the designated data into each of a plurality of candidate tables based on a plurality of candidate interpretations of semantic information provided in the natural language input wherein rendering each of the candidate tables includes having the frame object associate the entity object with the command object such that the frame object defines what portion of the designated data identified by the entity object is displayed in the columns and what portion of the designated data identified by the entity object is displayed in the rows. 20. The method of claim 18 wherein accessing the schema includes identifying multiple entity objects. | 0.509709 |
8,818,717 | 7 | 8 | 7. A method for increasing route accuracies, the method comprising: receiving a first GPS waypoint and a first position accuracy prediction (PAP) parameter associated with the first GPS waypoint, wherein the first PAP parameter comprises a first quality parameter set having a first weight value, a first confidence value for the first GPS waypoint, and a first error distance for the first GPS waypoint; comparing, with a computer processor, the first PAP parameter to a corpus PAP parameter associated with a corpus GPS waypoint, wherein the corpus PAP parameter comprises a second quality parameter set having a second weight value, a second confidence value for the corpus GPS waypoint, and a second error distance for the corpus GPS waypoint, wherein the comparing step comprises: calculating a weight average based on the first and second weight values; computationally extending the first error distance from the PAP parameter of the first GPS waypoint to provide a first probability distribution circle; computationally extending the second error distance from the PAP parameter of the corpus GPS waypoint to provide a second probability distribution circle; and computationally generating a vector line between the first GPS waypoint and the corpus GPS waypoint; and determining, with the computer processor, an updated GPS waypoint along the vector line between the first GPS waypoint and the corpus waypoint and within an overlapping area of the first and second probability distribution circles based on the calculated weight average. | 7. A method for increasing route accuracies, the method comprising: receiving a first GPS waypoint and a first position accuracy prediction (PAP) parameter associated with the first GPS waypoint, wherein the first PAP parameter comprises a first quality parameter set having a first weight value, a first confidence value for the first GPS waypoint, and a first error distance for the first GPS waypoint; comparing, with a computer processor, the first PAP parameter to a corpus PAP parameter associated with a corpus GPS waypoint, wherein the corpus PAP parameter comprises a second quality parameter set having a second weight value, a second confidence value for the corpus GPS waypoint, and a second error distance for the corpus GPS waypoint, wherein the comparing step comprises: calculating a weight average based on the first and second weight values; computationally extending the first error distance from the PAP parameter of the first GPS waypoint to provide a first probability distribution circle; computationally extending the second error distance from the PAP parameter of the corpus GPS waypoint to provide a second probability distribution circle; and computationally generating a vector line between the first GPS waypoint and the corpus GPS waypoint; and determining, with the computer processor, an updated GPS waypoint along the vector line between the first GPS waypoint and the corpus waypoint and within an overlapping area of the first and second probability distribution circles based on the calculated weight average. 8. The method of claim 7 , and further comprising replacing the corpus GPS waypoint with the updated GPS waypoint. | 0.922025 |
9,092,746 | 1 | 3 | 1. An information processing device comprising: a memory, one or more processors coupled to said memory for executing: a communication unit configured to transmit textual information; a schedule storage unit configured to store schedule information; a keyword storage unit configured to store multiple keywords that are classified into multiple categories; a keyword extraction unit configured to extract keywords from the textual information transmitted by the communication unit on the basis of the keywords stored in the keyword storage unit, and specify one category corresponding the extracted keywords when extracting a keyword which was classified into a plurality of categories based on a position thereof and relationships to other words in the text information; a schedule information creation unit configured to create new schedule information or revised schedule information which causes schedule information stored in the schedule storage unit to be updated, based on the keywords extracted by the keyword extraction unit and the categories of the extracted keywords; and a schedule updating unit configured to store the new schedule information into the schedule storage unit, and update the schedule information stored in the schedule storage unit with the revised schedule information, wherein the schedule information creation unit is configured to: determine whether the extracted keywords include a keyword classified to a category for revising the schedule, indicating completion of a job, or settlement of existing schedule information, and create the new schedule information including date and content when determining there is no keyword classified to the category for revising the schedule, indicating completion of a job, or settlement of existing schedule information; and create schedule information for updating the existing schedule information when determining there is a keyword classified to the category for revising the schedule, indicating completion of a job, or settlement of existing schedule information, and wherein the schedule updating unit is configured to: compare the new schedule information with the schedule information stored in the schedule storage unit to find a similar schedule information which is similar to the new schedule information, update the found similar schedule information with the new schedule information when finding the similar schedule information, and store the new schedule information in the schedule information storing unit when not finding the similar schedule information; and compare the schedule information for modifying and the schedule information stored in the schedule storage unit to find a similar schedule information which is similar to the schedule information for modifying, update the found similar schedule information with the schedule information for modifying when finding the similar schedule information stored in the schedule storage unit, and store the schedule information for modifying in the schedule storage unit when not finding the similar schedule information in the schedule storage unit. | 1. An information processing device comprising: a memory, one or more processors coupled to said memory for executing: a communication unit configured to transmit textual information; a schedule storage unit configured to store schedule information; a keyword storage unit configured to store multiple keywords that are classified into multiple categories; a keyword extraction unit configured to extract keywords from the textual information transmitted by the communication unit on the basis of the keywords stored in the keyword storage unit, and specify one category corresponding the extracted keywords when extracting a keyword which was classified into a plurality of categories based on a position thereof and relationships to other words in the text information; a schedule information creation unit configured to create new schedule information or revised schedule information which causes schedule information stored in the schedule storage unit to be updated, based on the keywords extracted by the keyword extraction unit and the categories of the extracted keywords; and a schedule updating unit configured to store the new schedule information into the schedule storage unit, and update the schedule information stored in the schedule storage unit with the revised schedule information, wherein the schedule information creation unit is configured to: determine whether the extracted keywords include a keyword classified to a category for revising the schedule, indicating completion of a job, or settlement of existing schedule information, and create the new schedule information including date and content when determining there is no keyword classified to the category for revising the schedule, indicating completion of a job, or settlement of existing schedule information; and create schedule information for updating the existing schedule information when determining there is a keyword classified to the category for revising the schedule, indicating completion of a job, or settlement of existing schedule information, and wherein the schedule updating unit is configured to: compare the new schedule information with the schedule information stored in the schedule storage unit to find a similar schedule information which is similar to the new schedule information, update the found similar schedule information with the new schedule information when finding the similar schedule information, and store the new schedule information in the schedule information storing unit when not finding the similar schedule information; and compare the schedule information for modifying and the schedule information stored in the schedule storage unit to find a similar schedule information which is similar to the schedule information for modifying, update the found similar schedule information with the schedule information for modifying when finding the similar schedule information stored in the schedule storage unit, and store the schedule information for modifying in the schedule storage unit when not finding the similar schedule information in the schedule storage unit. 3. The information processing device according to claim 1 , wherein: the keyword extraction unit is configured to specify sentences in the textual information each of which includes at least one keyword on the basis of the keywords stored in the keyword storage unit, delete sentences each of which does not include any keywords, and extract the keywords from the specified sentences; the schedule information creation unit is configured to extract the schedule information based on the extracted keywords and category of the extracted keywords; the keyword extraction unit is configured to re-extract the keywords from the sentences which include correct schedule information; and the schedule information creation unit is configured to create the schedule information based on the re-extracted keywords and category of the re-extracted keywords. | 0.550901 |
9,753,698 | 1 | 2 | 1. A method of isolating a shared memory-based state from concurrent clients of an application including an application component, the method comprising: partitioning a memory-based state into a plurality of domains, each domain including separate address spaces of a memory and including variables within boundaries of the domain, wherein the variables are isolated from outside of the boundaries of the domain, and wherein the variables within each domain are isolated from the other domains; introducing a plurality of agents inside the boundaries of the domains corresponding with a client of the application, wherein the agent acts on behalf of the client to access the variables within the domain, and the agent does not use the same application component or the same thread of execution as the client, wherein the agents include at least one read agent to read from variables within the domain, at least one write agent to read from or write to variables within the domain and at least one third agent to neither read from nor write to variables within the domain; executing any number of third agents concurrently with each other or with read agents or with one write agent; executing any number of read agents concurrently as long as no write agents are executing; executing only one write agent at a time such that the instance of the write agent as exclusive access to the domain while executing the write agent; wherein the domains and the agents are each both declarative and runtime constructs in a programming language based model; and enforcing isolation of the variables within the domain from the clients through communications between the agent and the corresponding client via message passing with a compiler and supporting runtime and through the agent interacting with other agents via message-passing over separately defined channels. | 1. A method of isolating a shared memory-based state from concurrent clients of an application including an application component, the method comprising: partitioning a memory-based state into a plurality of domains, each domain including separate address spaces of a memory and including variables within boundaries of the domain, wherein the variables are isolated from outside of the boundaries of the domain, and wherein the variables within each domain are isolated from the other domains; introducing a plurality of agents inside the boundaries of the domains corresponding with a client of the application, wherein the agent acts on behalf of the client to access the variables within the domain, and the agent does not use the same application component or the same thread of execution as the client, wherein the agents include at least one read agent to read from variables within the domain, at least one write agent to read from or write to variables within the domain and at least one third agent to neither read from nor write to variables within the domain; executing any number of third agents concurrently with each other or with read agents or with one write agent; executing any number of read agents concurrently as long as no write agents are executing; executing only one write agent at a time such that the instance of the write agent as exclusive access to the domain while executing the write agent; wherein the domains and the agents are each both declarative and runtime constructs in a programming language based model; and enforcing isolation of the variables within the domain from the clients through communications between the agent and the corresponding client via message passing with a compiler and supporting runtime and through the agent interacting with other agents via message-passing over separately defined channels. 2. The method of claim 1 wherein method includes isolating the plurality of domains from each other. | 0.731183 |
9,262,479 | 1 | 4 | 1. A computer-implemented method, comprising: receiving, by a computer system configured to execute computer-executable instructions, a continuous query, the continuous query identifying an archived view, the archived view identifying a join operation between a fact relation and a dimension relation; generating a query plan for the continuous query; initializing a state of an operator in the query plan corresponding to the dimension relation; identifying if the state of the operator identifies an event that detects a change to the dimension relation; re-starting the continuous query based at least in part on the event that detects the change to the dimension relation; identifying a view root operator in the archived view; constructing an archiver query for the operator, the operator topologically preceding the view root operator; executing the archiver query to obtain a result set of data records related to an application; and generating a snapshot output of one or more data values related to the application based at least in part on the result set of data records related to the application. | 1. A computer-implemented method, comprising: receiving, by a computer system configured to execute computer-executable instructions, a continuous query, the continuous query identifying an archived view, the archived view identifying a join operation between a fact relation and a dimension relation; generating a query plan for the continuous query; initializing a state of an operator in the query plan corresponding to the dimension relation; identifying if the state of the operator identifies an event that detects a change to the dimension relation; re-starting the continuous query based at least in part on the event that detects the change to the dimension relation; identifying a view root operator in the archived view; constructing an archiver query for the operator, the operator topologically preceding the view root operator; executing the archiver query to obtain a result set of data records related to an application; and generating a snapshot output of one or more data values related to the application based at least in part on the result set of data records related to the application. 4. The computer-implemented method of claim 1 , further comprising: traversing the query plan in topological order to identify the view root operator, the view root operator being identified by an output operator to store event information related to the application; inserting a buffer operator between the view root operator and the output operator in the query plan; and storing the event information from the view root operator in the buffer operator. | 0.811047 |
8,589,150 | 9 | 10 | 9. The computer program product of claim 1 , wherein the computer program product is operable such that the text is stored in a database associated with the application, where such text is dynamically retrieved by the application to be displayed as needed. | 9. The computer program product of claim 1 , wherein the computer program product is operable such that the text is stored in a database associated with the application, where such text is dynamically retrieved by the application to be displayed as needed. 10. The computer program product of claim 9 , wherein the computer program product is operable such that the text stored in the database is replaced with the changed text. | 0.90127 |
8,387,122 | 23 | 24 | 23. The method of claim 22 , wherein the parties also share resources and control access to the resources that they are sharing by specifying shared knowledge questions that must be successfully answered by entering an acceptable proposed answer, further comprising the steps of using the computing device for: (a) determining a number of successful attempts by the user to enter an acceptable proposed answer to a shared knowledge question of a specific party and thereby gain access to the resource of the specific party; and (b) further determining the degree of relationship between the user and the specific party based at least in part on the number of successful attempts by the user to access one or more resources of the specific party. | 23. The method of claim 22 , wherein the parties also share resources and control access to the resources that they are sharing by specifying shared knowledge questions that must be successfully answered by entering an acceptable proposed answer, further comprising the steps of using the computing device for: (a) determining a number of successful attempts by the user to enter an acceptable proposed answer to a shared knowledge question of a specific party and thereby gain access to the resource of the specific party; and (b) further determining the degree of relationship between the user and the specific party based at least in part on the number of successful attempts by the user to access one or more resources of the specific party. 24. The method of claim 23 , further comprising the step of using the computing device for applying weighting factors to the shared knowledge questions used in determining the degree of relation function. | 0.936685 |
9,471,635 | 1 | 5 | 1. A system for optimizing a query, comprising: a memory, and at least one processor operatively coupled to the memory; a construction module executed via the at least one processor and capable of building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern; a flow module executed via the at least one processor and capable of determining a plurality of flows of query variables between the plurality of components; a cost determination and ranking module executed via the at least one processor and capable of determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query; a constraint module executed via the at least one processor and capable of generating one or more constraints for ruling out invalid flows of the plurality of flows; and an integral linear programming (ILP) solver, wherein the cost determination and ranking module uses the ILP solver to solve a linear optimization problem of determining the combination of the plurality of flows between the plurality of components that results in the minimum cost under the one or more constraints generated by the constraint module; wherein the one or more constraints comprise a component constraint enforcing semantics of an external view of one or more of the components, a graph constraint enforcing semantics of the plurality of flows of query variables, and a predecessor constraint enforcing semantics of one or more potential predecessors. | 1. A system for optimizing a query, comprising: a memory, and at least one processor operatively coupled to the memory; a construction module executed via the at least one processor and capable of building a data structure for a query, the data structure including a plurality of components, wherein each of the plurality of components corresponds to at least one graph pattern; a flow module executed via the at least one processor and capable of determining a plurality of flows of query variables between the plurality of components; a cost determination and ranking module executed via the at least one processor and capable of determining a combination of the plurality of flows between the plurality of components that results in a minimum cost to execute the query; a constraint module executed via the at least one processor and capable of generating one or more constraints for ruling out invalid flows of the plurality of flows; and an integral linear programming (ILP) solver, wherein the cost determination and ranking module uses the ILP solver to solve a linear optimization problem of determining the combination of the plurality of flows between the plurality of components that results in the minimum cost under the one or more constraints generated by the constraint module; wherein the one or more constraints comprise a component constraint enforcing semantics of an external view of one or more of the components, a graph constraint enforcing semantics of the plurality of flows of query variables, and a predecessor constraint enforcing semantics of one or more potential predecessors. 5. The system according to claim 1 , wherein a component of the plurality of components represents an access method for the graph pattern. | 0.738636 |
9,275,045 | 12 | 14 | 12. A handheld electronic device, comprising: a display; a processor apparatus comprising a processor and a memory in electronic communication with one another, said processor apparatus having stored therein a number of routines which, when executed on said processor, cause said handheld electronic device to perform operations comprising: receiving an input, wherein the input is associated with a pending linguistic element and at least one previously entered linguistic element; determining that the at least one previously entered linguistic element has a predetermined characteristic, wherein the predetermined characteristic comprises belonging to a particular class of verbs; determining a preferred output for the pending linguistic element based on the predetermined characteristic of the at least one previously entered linguistic element, wherein the preferred output of the pending linguistic element differs from the at least one previously entered linguistic element; displaying on the display a variant component comprising the at least preferred output of the pending linguistic element and an alternative output, wherein the variant component is displayed in proximity to a display of the at least one previously entered linguistic element; and based on selection from the variant component, presenting on the display a selected output of the pending linguistic element in the output apparatus. | 12. A handheld electronic device, comprising: a display; a processor apparatus comprising a processor and a memory in electronic communication with one another, said processor apparatus having stored therein a number of routines which, when executed on said processor, cause said handheld electronic device to perform operations comprising: receiving an input, wherein the input is associated with a pending linguistic element and at least one previously entered linguistic element; determining that the at least one previously entered linguistic element has a predetermined characteristic, wherein the predetermined characteristic comprises belonging to a particular class of verbs; determining a preferred output for the pending linguistic element based on the predetermined characteristic of the at least one previously entered linguistic element, wherein the preferred output of the pending linguistic element differs from the at least one previously entered linguistic element; displaying on the display a variant component comprising the at least preferred output of the pending linguistic element and an alternative output, wherein the variant component is displayed in proximity to a display of the at least one previously entered linguistic element; and based on selection from the variant component, presenting on the display a selected output of the pending linguistic element in the output apparatus. 14. A handheld electronic device according to claim 12 , wherein the preferred output is a diacritical version of the pending linguistic element. | 0.741993 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.