sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|
1. On a computing device, a method of providing user feedback for a speech recognition system, the method comprising: displaying a graphical feedback indicator with an appearance that indicates the speech recognition system is in a passive listening mode; receiving a triggering input; in response to the triggering input, modifying an appearance of the graphical feedback indicator to have an appearance that indicates the speech recognition system is in an active listening mode; while in the active listening mode, receiving a speech input; when the speech recognition system understands the speech input, modifying the appearance of the graphical feedback indicator to have an appearance that indicates that the speech input is understood by the system, determining a location of a user providing the speech input, and modifying the appearance of the graphical feedback indicator to indicate the location of the user by adjusting a location of a volume indicator in a direction corresponding to the location of the user, the volume indicator comprising a ring-shaped portion of the indicator having a bar that represents a volume, wherein adjusting a location indicator comprises moving the bar to a side corresponding to the location of the user providing the speech input; and when the speech recognition system does not understand the speech input, then modifying the appearance of the graphical feedback indicator in a different manner to have an appearance that indicates the speech input is not understood by the system. | 1. On a computing device, a method of providing user feedback for a speech recognition system, the method comprising: displaying a graphical feedback indicator with an appearance that indicates the speech recognition system is in a passive listening mode; receiving a triggering input; in response to the triggering input, modifying an appearance of the graphical feedback indicator to have an appearance that indicates the speech recognition system is in an active listening mode; while in the active listening mode, receiving a speech input; when the speech recognition system understands the speech input, modifying the appearance of the graphical feedback indicator to have an appearance that indicates that the speech input is understood by the system, determining a location of a user providing the speech input, and modifying the appearance of the graphical feedback indicator to indicate the location of the user by adjusting a location of a volume indicator in a direction corresponding to the location of the user, the volume indicator comprising a ring-shaped portion of the indicator having a bar that represents a volume, wherein adjusting a location indicator comprises moving the bar to a side corresponding to the location of the user providing the speech input; and when the speech recognition system does not understand the speech input, then modifying the appearance of the graphical feedback indicator in a different manner to have an appearance that indicates the speech input is not understood by the system. 6. The method of claim 1 , further comprising modifying the appearance of the graphical feedback indicator from the passive listening mode to a different, active listening mode by maintaining a shape of the graphical feedback indicator while modifying the appearance. | 0.522607 |
23. A computer storage medium encoded with a computer program, the program comprising instructions that when executed by one or more computers cause the one or more computers to perform operations comprising: obtaining first profile data for a first user that is associated with a computing device; obtaining second profile data for second users that submitted search queries, the second users being different from the first user; determining, based on the first profile data and the second profile data, similarity scores that are each indicative of a degree of similarity between the first user and at least one of the second users; selecting a proper subset of the search queries based on the similarity scores; generating an update for an autocomplete cache of the computing device associated with the first user using the selected subset of the search queries; and providing the update to the computing device associated with the first user. | 23. A computer storage medium encoded with a computer program, the program comprising instructions that when executed by one or more computers cause the one or more computers to perform operations comprising: obtaining first profile data for a first user that is associated with a computing device; obtaining second profile data for second users that submitted search queries, the second users being different from the first user; determining, based on the first profile data and the second profile data, similarity scores that are each indicative of a degree of similarity between the first user and at least one of the second users; selecting a proper subset of the search queries based on the similarity scores; generating an update for an autocomplete cache of the computing device associated with the first user using the selected subset of the search queries; and providing the update to the computing device associated with the first user. 31. The computer storage medium of claim 23 , wherein: obtaining the first profile data for the first user comprises obtaining information that indicates a user type for the first user; obtaining the second profile data for the second users comprises obtaining information that indicates user types for the second users; and determining the similarity scores comprises: determining whether the user type for first user matches the user types for the respective second users; and determining the similarity scores based on whether the user type for the first user matches the user type for the respective second users. | 0.502921 |
12. A method according to claim 1 , further comprising: repeating: the extracting of a partial time series of first speech parameters {x i } p . . . q ; the extracting of a partial time series of second speech parameter vectors {Δ i } p . . . q ; and the converting of the partial time series of first speech parameter vectors and the partial series of second speech parameter vectors into a partial time series of third speech parameter vectors {y i } p . . . q ; wherein each repetition is performed using a successive value of p, thereby producing a plurality of successive partial time series of third speech parameter vectors; and combining the plurality of successive partial time series of third speech parameter vectors to form a time series of output speech parameter vectors {ŷ i } 1 . . . m , wherein each output speech parameter vector ŷ i corresponds to an identically indexed one of the synchronisation points; wherein the synthesizing of the speech utterance comprises synthesizing the speech utterance from the time series of output speech parameter vectors {ŷ i } 1 . . . m . | 12. A method according to claim 1 , further comprising: repeating: the extracting of a partial time series of first speech parameters {x i } p . . . q ; the extracting of a partial time series of second speech parameter vectors {Δ i } p . . . q ; and the converting of the partial time series of first speech parameter vectors and the partial series of second speech parameter vectors into a partial time series of third speech parameter vectors {y i } p . . . q ; wherein each repetition is performed using a successive value of p, thereby producing a plurality of successive partial time series of third speech parameter vectors; and combining the plurality of successive partial time series of third speech parameter vectors to form a time series of output speech parameter vectors {ŷ i } 1 . . . m , wherein each output speech parameter vector ŷ i corresponds to an identically indexed one of the synchronisation points; wherein the synthesizing of the speech utterance comprises synthesizing the speech utterance from the time series of output speech parameter vectors {ŷ i } 1 . . . m . 13. A method according to claim 12 , wherein: for each repletion, p and q are such that the partial time series of first speech parameter vectors {x i } p . . . q , the partial time series of second speech parameter vectors {Δ i } p . . . q and the partial time series of corresponding third speech parameter vectors {y i } p . . . q overlap each other by a non-zero number of vectors; and the combining the plurality of successive partial time series of third speech parameter vectors comprises forming a non-overlapping time series of output speech parameter vectors {ŷ i } 1 . . . m , including, for each of at least some of the plurality of successive partial time series of third speech parameter vectors: applying to final vectors of the partial time series of third speech parameter vectors a first scaling function that decreases with time; applying to initial vectors of an immediately successive partial time series of third speech parameter vectors a second scaling function that increases with time; and adding together the scaled overlapping final and initial vectors. | 0.754233 |
5. The system of claim 1 , wherein the data analyzer is adapted to process the market data in order to identify correlations or trends for future market events based on the one or more pseudonyms. | 5. The system of claim 1 , wherein the data analyzer is adapted to process the market data in order to identify correlations or trends for future market events based on the one or more pseudonyms. 7. The system of claim 5 , wherein the data analyzer is adapted to process the market data in order to identify trends for future market events based on a community mood measurement, and the report includes information associated with the correlations or trends. | 0.915161 |
13. The computer-implemented method of claim 1 , wherein the one or more queries to the database contain calls to other query procedures, and an approximation is used to optimize these called procedures, by eliminating query parts that will return an empty set of results in a context where they are called, regardless of any contents of the database. | 13. The computer-implemented method of claim 1 , wherein the one or more queries to the database contain calls to other query procedures, and an approximation is used to optimize these called procedures, by eliminating query parts that will return an empty set of results in a context where they are called, regardless of any contents of the database. 14. The computer-implemented method of claim 13 , wherein the context of a procedure in a database query is computed by traversing a call graph of that query, and keeping a stack of approximations of all contexts where the procedure is being used, and when entering a procedure in the call graph, pushing a conjunction of an approximation of a body of that procedure and a top of the stack onto the stack as a new context. | 0.870252 |
12. A system to display landmark information, comprising: one or more processors; and a non-transitory computer-readable medium having instructions stored thereon, the instructions executable by the one or more processors to: receive a user query comprising one or more keywords; select one or more corresponding tags from a landmark database corresponding to the one or more keywords; supplement the user query with the one or more corresponding tags; retrieve one or more landmark images based on the supplemented user query; create visual clusters from the one or more retrieved landmark images; and generate a user interface including one or more summary lists of the created visual clusters for the one or more retrieved landmark images, wherein each summary list corresponds to one of the one or more retrieved landmarks and includes descriptive information and access information for each visual cluster included in the summary list. | 12. A system to display landmark information, comprising: one or more processors; and a non-transitory computer-readable medium having instructions stored thereon, the instructions executable by the one or more processors to: receive a user query comprising one or more keywords; select one or more corresponding tags from a landmark database corresponding to the one or more keywords; supplement the user query with the one or more corresponding tags; retrieve one or more landmark images based on the supplemented user query; create visual clusters from the one or more retrieved landmark images; and generate a user interface including one or more summary lists of the created visual clusters for the one or more retrieved landmark images, wherein each summary list corresponds to one of the one or more retrieved landmarks and includes descriptive information and access information for each visual cluster included in the summary list. 17. The system of claim 12 , wherein the instructions are further executable by the one or more processors to evaluate each cluster based on popularity criteria and to order each cluster based on the evaluation. | 0.590861 |
10. The method of claim 1 , further comprising: detecting a first physical object; identifying the first detected physical object as a first character of the plurality of characters; detecting a second physical object; and identifying the second physical object as a second character of the plurality of characters, wherein: determining that the digital content of the virtual scene comprises a representation of at least one of the characters comprises determining that the digital content of the virtual scene comprises a representation of the first character and the second character, and accessing an indication of one or more context-based stimuli comprises determining a distance between the first physical character and the second physical character from the representation of the first physical object and the representation of the second physical object, and comparing the determined distance to a threshold. | 10. The method of claim 1 , further comprising: detecting a first physical object; identifying the first detected physical object as a first character of the plurality of characters; detecting a second physical object; and identifying the second physical object as a second character of the plurality of characters, wherein: determining that the digital content of the virtual scene comprises a representation of at least one of the characters comprises determining that the digital content of the virtual scene comprises a representation of the first character and the second character, and accessing an indication of one or more context-based stimuli comprises determining a distance between the first physical character and the second physical character from the representation of the first physical object and the representation of the second physical object, and comparing the determined distance to a threshold. 11. The method of claim 10 , further comprising: generating a command signal based on the comparison; and providing the command signal to one or more of the first physical object and the second physical object, the command signal being sufficient to cause either or both of the first physical object and the second physical object to perform an action defined by the command signal. | 0.756994 |
2. The method according to claim 1 , further comprising: determining the affiliated static decoding network one of before or after the speech signal is decoded according to the basic static decoding network. | 2. The method according to claim 1 , further comprising: determining the affiliated static decoding network one of before or after the speech signal is decoded according to the basic static decoding network. 3. The method according to claim 2 , wherein determining the affiliated static decoding network further comprises: determining an identity of the user according to a feature of the speech signal, and then determining the affiliated static decoding network according to the identity of the user; or determining the identity of the user according to at least one of an equipment code or an account number associated with the user, and then determining the affiliated static decoding network according to the identity of the user. | 0.870034 |
33. A non-transitory storage medium storing instructions, the instructions comprising: one or more instructions that, when executed by one or more processors of an electronic device, cause the electronic device to: access an external environment; access a late bound environment providing a late bound function call that is bound to an implementation of a late bound function at a run time of application program existing in the external program environment; and provide an interface mechanism to: automatically express semantics of the late bound program environment in a format compatible with the external program environment, automatically examine the late bound program, identify a set of one or more dependent late bound functions based on the examining, the identified set required by the late bound function call and enable a function call within the late bound program environment to execute, the function call executing while: the late bound function exists in the late bound environment and, the late bound function is executing within the external program environment; wherein the interface is a software component that executes within the external program environment. | 33. A non-transitory storage medium storing instructions, the instructions comprising: one or more instructions that, when executed by one or more processors of an electronic device, cause the electronic device to: access an external environment; access a late bound environment providing a late bound function call that is bound to an implementation of a late bound function at a run time of application program existing in the external program environment; and provide an interface mechanism to: automatically express semantics of the late bound program environment in a format compatible with the external program environment, automatically examine the late bound program, identify a set of one or more dependent late bound functions based on the examining, the identified set required by the late bound function call and enable a function call within the late bound program environment to execute, the function call executing while: the late bound function exists in the late bound environment and, the late bound function is executing within the external program environment; wherein the interface is a software component that executes within the external program environment. 38. The storage medium of claim 33 , wherein the interface mechanism is an Application Program Interface (API) running in the external environment. | 0.509062 |
18. The computer-readable storage medium of claim 15 , wherein the operations further comprise, responsive to detecting the instruction, transmitting a communication. | 18. The computer-readable storage medium of claim 15 , wherein the operations further comprise, responsive to detecting the instruction, transmitting a communication. 19. The computer-readable storage medium of claim 18 , wherein the communication comprises a portion of the transcript. | 0.900588 |
13. A data processing system comprising: a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: open a plurality of selected hypertext documents, create an affinity matrix for each of the selected hypertext documents, calculate an affinity indicator for each pair of selected hypertext documents in the affinity matrix according to a comparison between semantic information of a content of each selected hypertext document of the pair, group the selected hypertext documents into a set of groups by assigning each selected hypertext document to at least one group in the set of the groups according to the affinity indicators, wherein a number of selected hypertext documents in each group of the set of groups is limited to a predetermined number of selected hypertext documents and wherein the instructions to group the selected hypertext documents into the set of groups further causes the processor to: group the selected hypertext documents into a particular group up to the predetermined number of selected hypertext documents by: initializing the set of groups by assigning each single hypertext document to its own group and setting an affinity index for each group accordingly, and repeating the steps of: determining a pair of initialized groups with highest affinity indexes, merging the pair of initialized groups into a new group, for each new pair of groups, calculating a sum of the corresponding selected hypertext documents within the group, determining whether the sum of the corresponding selected hypertext documents exceeds the predetermined number of selected hypertext documents, blocking each new pair of groups between the new group and each other group to prevent the merging thereof when the sum of the corresponding selected hypertext documents exceeds the predetermined number of selected hypertext documents, and calculating the affinity index for each new group according to the affinity index between the initialized groups and the corresponding other group, until the highest affinity index is lower than the affinity threshold and the number of the groups is lower than or equal to a predetermined number of groups, and display the selected hypertext documents in an arrangement corresponding to the grouping thereof. | 13. A data processing system comprising: a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: open a plurality of selected hypertext documents, create an affinity matrix for each of the selected hypertext documents, calculate an affinity indicator for each pair of selected hypertext documents in the affinity matrix according to a comparison between semantic information of a content of each selected hypertext document of the pair, group the selected hypertext documents into a set of groups by assigning each selected hypertext document to at least one group in the set of the groups according to the affinity indicators, wherein a number of selected hypertext documents in each group of the set of groups is limited to a predetermined number of selected hypertext documents and wherein the instructions to group the selected hypertext documents into the set of groups further causes the processor to: group the selected hypertext documents into a particular group up to the predetermined number of selected hypertext documents by: initializing the set of groups by assigning each single hypertext document to its own group and setting an affinity index for each group accordingly, and repeating the steps of: determining a pair of initialized groups with highest affinity indexes, merging the pair of initialized groups into a new group, for each new pair of groups, calculating a sum of the corresponding selected hypertext documents within the group, determining whether the sum of the corresponding selected hypertext documents exceeds the predetermined number of selected hypertext documents, blocking each new pair of groups between the new group and each other group to prevent the merging thereof when the sum of the corresponding selected hypertext documents exceeds the predetermined number of selected hypertext documents, and calculating the affinity index for each new group according to the affinity index between the initialized groups and the corresponding other group, until the highest affinity index is lower than the affinity threshold and the number of the groups is lower than or equal to a predetermined number of groups, and display the selected hypertext documents in an arrangement corresponding to the grouping thereof. 16. The data processing system according to claim 13 , wherein the instructions to group the selected hypertext documents into the set of groups causes the processor to: group the selected hypertext documents according to an affinity threshold for the affinity indicators. | 0.514423 |
1. A method for analyzing an object being tracked in a sequence of video frames, comprising: receiving a representation of the tracked object, as depicted by a current video frame, of the sequence of video frames; evaluating, by operation of one or more computer processors, the representation of the tracked object using at least a first classifier and a second classifier, wherein the first classifier is configured to determine a first classification score indicating whether the tracked object depicts an instance of a first classification type, and wherein the second classifier is configured to determine a second classification score indicating whether the tracked object depicts an instance of a second classification type; adding the first classification score to a first rolling average, wherein the first rolling average provides an average of the first classification score determined for the tracked object for each of a specified number of previous video frames, of the plurality of; adding the second classification score to a second rolling average, wherein the second rolling average provides an average of the second classification score determined for the tracked object for each of a specified number of previous video frames, of the plurality, wherein the final classification value is determined from the first rolling average and the second rolling average; determining a final classification value for the tracked object in the current video frame, based on the first and second rolling averages; and passing the final classification value for the tracked objects to a machine learning engine configured to identify patterns of behavior engaged in by the tracked object, based at least in part on the final classification value. | 1. A method for analyzing an object being tracked in a sequence of video frames, comprising: receiving a representation of the tracked object, as depicted by a current video frame, of the sequence of video frames; evaluating, by operation of one or more computer processors, the representation of the tracked object using at least a first classifier and a second classifier, wherein the first classifier is configured to determine a first classification score indicating whether the tracked object depicts an instance of a first classification type, and wherein the second classifier is configured to determine a second classification score indicating whether the tracked object depicts an instance of a second classification type; adding the first classification score to a first rolling average, wherein the first rolling average provides an average of the first classification score determined for the tracked object for each of a specified number of previous video frames, of the plurality of; adding the second classification score to a second rolling average, wherein the second rolling average provides an average of the second classification score determined for the tracked object for each of a specified number of previous video frames, of the plurality, wherein the final classification value is determined from the first rolling average and the second rolling average; determining a final classification value for the tracked object in the current video frame, based on the first and second rolling averages; and passing the final classification value for the tracked objects to a machine learning engine configured to identify patterns of behavior engaged in by the tracked object, based at least in part on the final classification value. 2. The method of claim 1 , wherein the first classification type comprises a vehicle and the second classification type comprises a person. | 0.675828 |
15. A computer storage medium storing thereon computer executable instructions configured to process text, comprising: an instruction configured to assign a label to a component according to a probabilistic model, wherein said probabilistic model includes incorporated prototype information; an instruction configured to determine whether said component is included in said prototype information; if said component is included in said prototype information, using said prototype information in said probabilistic model, otherwise not using said prototype information in said probabilistic model; and an instruction configured to store said label assigned to said component. | 15. A computer storage medium storing thereon computer executable instructions configured to process text, comprising: an instruction configured to assign a label to a component according to a probabilistic model, wherein said probabilistic model includes incorporated prototype information; an instruction configured to determine whether said component is included in said prototype information; if said component is included in said prototype information, using said prototype information in said probabilistic model, otherwise not using said prototype information in said probabilistic model; and an instruction configured to store said label assigned to said component. 19. The computer storage medium according to claim 15 , wherein said probabilistic model is a Hidden Markov Model. | 0.743377 |
32. An entertainment system comprising: a broadcast network including a plurality of multiplexed channels each carrying video signals; a content distribution system to broadcast television content in video signals carried over the broadcast network on the plurality of multiplexed channels, the video signals carried by each said channel including content programming and a closed captioning stream of textual data; a plurality of client devices, each including one or more tuners for receiving the video signals carried on the multiplexed channels of the broadcast network; and an interest assessment system including: a closed caption decoder to extract, from each said channel, the closed captioning stream of textual data; a processor executing an application to search, for each said channel, the closed captioning stream of textual data for occurrences of textual data matching first search terms of an active list and second search terms of a passive list, wherein the application comprises a component for comparing the closed captioning stream of textual data to both the active list and the passive list; the active list comprising one or more predefined first character strings as the first search terms; the passive list comprising one or more second character strings as the second search terms that have been extracted by the closed caption decoder from one or more previously received closed captioning streams of textual data of previously received video signals that the viewer has viewed or recorded, the one or more second character strings being extracted base on a frequency of occurrence in the previously received textual data; the comparing including determining whether a number of matches of the first search terms of the active list and the second search terms of the passive list with the textual data exceeds a threshold number, wherein when the number of matches of the first search terms of the active list and the second search terms of the passive list does not exceed the threshold number after a predetermined period of time, ceasing to search a first closed captioning stream of textual data from a first channel before an end of the first closed captioning stream is reached, deleting the corresponding content programming from the buffer, and searching instead a second closed captioning stream of textual data from a second channel; and an output device to output a notification when the number of matches of the first search terms of the active list or the second search terms of the passive list in comparison with the textual data exceeds the threshold number indicating that content programming corresponding to viewer interests has been located. | 32. An entertainment system comprising: a broadcast network including a plurality of multiplexed channels each carrying video signals; a content distribution system to broadcast television content in video signals carried over the broadcast network on the plurality of multiplexed channels, the video signals carried by each said channel including content programming and a closed captioning stream of textual data; a plurality of client devices, each including one or more tuners for receiving the video signals carried on the multiplexed channels of the broadcast network; and an interest assessment system including: a closed caption decoder to extract, from each said channel, the closed captioning stream of textual data; a processor executing an application to search, for each said channel, the closed captioning stream of textual data for occurrences of textual data matching first search terms of an active list and second search terms of a passive list, wherein the application comprises a component for comparing the closed captioning stream of textual data to both the active list and the passive list; the active list comprising one or more predefined first character strings as the first search terms; the passive list comprising one or more second character strings as the second search terms that have been extracted by the closed caption decoder from one or more previously received closed captioning streams of textual data of previously received video signals that the viewer has viewed or recorded, the one or more second character strings being extracted base on a frequency of occurrence in the previously received textual data; the comparing including determining whether a number of matches of the first search terms of the active list and the second search terms of the passive list with the textual data exceeds a threshold number, wherein when the number of matches of the first search terms of the active list and the second search terms of the passive list does not exceed the threshold number after a predetermined period of time, ceasing to search a first closed captioning stream of textual data from a first channel before an end of the first closed captioning stream is reached, deleting the corresponding content programming from the buffer, and searching instead a second closed captioning stream of textual data from a second channel; and an output device to output a notification when the number of matches of the first search terms of the active list or the second search terms of the passive list in comparison with the textual data exceeds the threshold number indicating that content programming corresponding to viewer interests has been located. 33. The entertainment system as defined in claim 32 , wherein a greater weight is applied to the first search terms in the active list than a weight applied to the second search terms in the passive list when counting the number of matches. | 0.604279 |
12. The method of claim 9 , wherein receiving the at least one indication of an additional stroke relating to the handwritten sub-character comprises receiving at least one tap that represents an additional character stroke and does not indicate a specific character stroke, said at least one tap received at a location of the touch-sensitive input panel adjacent to an input location of the sub-character, wherein updating the hint list based on the number of additional strokes comprises updating the hint list based on a received number of taps. | 12. The method of claim 9 , wherein receiving the at least one indication of an additional stroke relating to the handwritten sub-character comprises receiving at least one tap that represents an additional character stroke and does not indicate a specific character stroke, said at least one tap received at a location of the touch-sensitive input panel adjacent to an input location of the sub-character, wherein updating the hint list based on the number of additional strokes comprises updating the hint list based on a received number of taps. 13. The method of claim 12 , wherein receiving a handwritten sub-character comprises receiving handwriting input at a touch-sensitive input panel and wherein receiving at least one tap comprises receiving input at a separate field of the touch-sensitive input panel than that used to input the handwritten sub-character. | 0.880089 |
2. The method of claim 1 , the method further comprising: generating, by the first electronic device, a user interface, wherein receiving the non-voice interaction comprises: receiving, by the first electronic device, a point of focus on the user interface, and wherein the first context is based on the point of focus. | 2. The method of claim 1 , the method further comprising: generating, by the first electronic device, a user interface, wherein receiving the non-voice interaction comprises: receiving, by the first electronic device, a point of focus on the user interface, and wherein the first context is based on the point of focus. 3. The method of claim 2 , wherein the user interface comprises a map display interface and wherein the point of focus includes a location on the map display that indicates a geolocation, which is used as the first context. | 0.912996 |
17. An apparatus for compressing genetic sequencing data in a text-based format, the apparatus including a processor and a non-transitory processor-readable medium having processor-executable instructions stored thereon, the processor-executable instructions comprising instructions for: receiving genetic sequencing data obtained using a high throughput genetic sequencing instrument; parsing information included in text of the genetic sequencing data into a plurality of fields, wherein the information includes title information, sequence data and quality data and wherein the plurality of fields includes a title information field, a sequence data field and a quality data field; collecting statistics with respect to one or more symbols represented by strings that are included in each of the plurality of fields; identifying, for each of the plurality of fields, an encoding algorithm that achieves greatest compression gains with respect to the field based on the collected statistics, by determining, for each field of the genetic sequencing data, an optimized encoding algorithm selected from the group consisting of an arithmetic encoding algorithm, a Markov encoding algorithm, and a Huffman encoding algorithm; generating bitstreams, compressed from the genetic sequencing data, by encoding each of the plurality of fields of the genetic sequencing data using the respective identified encoding algorithm; and outputting a unified bitstream by merging the generated bitstreams encoded for each of the plurality of fields. | 17. An apparatus for compressing genetic sequencing data in a text-based format, the apparatus including a processor and a non-transitory processor-readable medium having processor-executable instructions stored thereon, the processor-executable instructions comprising instructions for: receiving genetic sequencing data obtained using a high throughput genetic sequencing instrument; parsing information included in text of the genetic sequencing data into a plurality of fields, wherein the information includes title information, sequence data and quality data and wherein the plurality of fields includes a title information field, a sequence data field and a quality data field; collecting statistics with respect to one or more symbols represented by strings that are included in each of the plurality of fields; identifying, for each of the plurality of fields, an encoding algorithm that achieves greatest compression gains with respect to the field based on the collected statistics, by determining, for each field of the genetic sequencing data, an optimized encoding algorithm selected from the group consisting of an arithmetic encoding algorithm, a Markov encoding algorithm, and a Huffman encoding algorithm; generating bitstreams, compressed from the genetic sequencing data, by encoding each of the plurality of fields of the genetic sequencing data using the respective identified encoding algorithm; and outputting a unified bitstream by merging the generated bitstreams encoded for each of the plurality of fields. 18. The apparatus of claim 17 , wherein the instructions for parsing include instructions for parsing the title information line included in the text so as to identify constant fields, variable fields, and delimiters. | 0.526223 |
26. The system of claim 19 , wherein the instructions to generate the structured query comprises instructions to: combine the one or more first entities and the one or more first entity types to form a first query; submit the first query to a structured-query generator configured to generate the structured query based on the one or more first entities and the one or more first entity types; and receive one or more results from the structured-query generator, wherein the structured query is based upon the one or more results. | 26. The system of claim 19 , wherein the instructions to generate the structured query comprises instructions to: combine the one or more first entities and the one or more first entity types to form a first query; submit the first query to a structured-query generator configured to generate the structured query based on the one or more first entities and the one or more first entity types; and receive one or more results from the structured-query generator, wherein the structured query is based upon the one or more results. 27. The system of claim 26 , wherein the processors are further operable when executing instructions to identify the plurality of second entities matching the structured query, wherein the identifying comprises: submitting the structured query to a graph search engine configured to search the social graph for entities that match the structured query; receiving results from the graph search engine, wherein the plurality of second entities are based on the received results. | 0.76371 |
10. A non-transitory computer readable storage device including instructions stored thereon, the instructions, which when executed by a machine, cause the machine to perform operations comprising; receiving, a non-lexical code and a non-lexical code descriptor, the non-lexical code and the non-lexical code descriptor from structured data; determining a lexical code and a lexical code descriptor based on the received non-lexical code and non-lexical code descriptor; lexically combining the lexical code with the lexical code descriptor based on a template that indicates how to lexically combine the lexical code and the lexical code descriptor, wherein the instructions for lexically combining the lexical code with the lexical code descriptor include instructions for constraining the lexical combination by an ontological relationship between the lexical code and the lexical code descriptor; and associating the lexically combined lexical code and lexical code descriptor with the non-lexical code and the non-lexical code descriptor in a keyword database. | 10. A non-transitory computer readable storage device including instructions stored thereon, the instructions, which when executed by a machine, cause the machine to perform operations comprising; receiving, a non-lexical code and a non-lexical code descriptor, the non-lexical code and the non-lexical code descriptor from structured data; determining a lexical code and a lexical code descriptor based on the received non-lexical code and non-lexical code descriptor; lexically combining the lexical code with the lexical code descriptor based on a template that indicates how to lexically combine the lexical code and the lexical code descriptor, wherein the instructions for lexically combining the lexical code with the lexical code descriptor include instructions for constraining the lexical combination by an ontological relationship between the lexical code and the lexical code descriptor; and associating the lexically combined lexical code and lexical code descriptor with the non-lexical code and the non-lexical code descriptor in a keyword database. 12. The storage device of claim 10 , wherein the instructions for receiving the non-lexical code include instructions for receiving an element that includes the non-lexical code and the non-lexical code descriptor; and wherein the instructions for lexically combining the lexical code with the lexical code descriptor include instructions for looking up a code descriptor template in a lexical enrichment database as a function of the non-lexical code descriptor and the lexical code to determine the lexical code descriptor. | 0.673252 |
1. An apparatus comprising: a processor; and a memory storing code that is executable by the processor to: determine a text selection context for a touchscreen device; ascertain whether a text selection override policy is satisfied; and replace application text selection rules with one-touch user-defined context-aware text selection rules for the determined text selection context in response to ascertaining that the text selection override policy is satisfied, wherein application text selection rules for at least two different applications are replaced with the one-touch user-defined context-aware text selection rules. | 1. An apparatus comprising: a processor; and a memory storing code that is executable by the processor to: determine a text selection context for a touchscreen device; ascertain whether a text selection override policy is satisfied; and replace application text selection rules with one-touch user-defined context-aware text selection rules for the determined text selection context in response to ascertaining that the text selection override policy is satisfied, wherein application text selection rules for at least two different applications are replaced with the one-touch user-defined context-aware text selection rules. 2. The apparatus of claim 1 , wherein the text selection context comprises elements selected from the group consisting of content-type, touchscreen device configuration, application type, application status, communication status, override policy parameters, and combinations thereof. | 0.512563 |
10. The system of claim 9 , wherein the dynamic binary translator when executed by the processor causes the processor to perform a further method comprising generating a dependence graph of traces of the selected code segment, the dependence graph having labels of expected execution times for each trace. | 10. The system of claim 9 , wherein the dynamic binary translator when executed by the processor causes the processor to perform a further method comprising generating a dependence graph of traces of the selected code segment, the dependence graph having labels of expected execution times for each trace. 14. The system of claim 10 , wherein heuristically identifying the one or more memory dependencies further comprises: analyzing the dependence graph of the code segment; indentifying critical paths associated only with the memory dependencies in the dependence graph, the remaining paths of the dependence graph being non-critical paths; summing the expected execution times of traces identified as the critical paths; summing the expected execution times of traces of the non-critical paths; selecting the one or more memory dependencies based on the summed expected execution times of critical and non-critical paths. | 0.782363 |
1. A computer-implemented method comprising: receiving data specifying a new voice action submitted by an application developer, the data identifying (i) an application, and (ii) a voice command trigger term; validating the received data; generating a data structure instance that specifies (i) the application, (ii) the voice command trigger term, and (iii) one or more alternate voice command trigger terms that are each determined based at least on the voice command trigger term; after generating the data structure instance, enabling triggering of the new voice action by a spoken utterance based at least on storing the data structure instance at a database that comprises one or more other data structure instances, wherein one or more of the other data structure instances specify (i) an application, and (ii) one or more voice command trigger terms that includes at least one voice command trigger term that is determined based at least on another voice command trigger term in the same data structure instance; after enabling triggering of the new voice action by a spoken utterance and based at least on determining that a transcription of a spoken utterance includes a particular one of the alternate voice command trigger terms that are each determined based at least on the voice command trigger term, selecting a particular data structure instance from the database that specifies the particular one of the alternate voice command trigger terms that are each determined based at least on the voice command trigger term; and identifying a particular application that is specified by the particular data structure instance. | 1. A computer-implemented method comprising: receiving data specifying a new voice action submitted by an application developer, the data identifying (i) an application, and (ii) a voice command trigger term; validating the received data; generating a data structure instance that specifies (i) the application, (ii) the voice command trigger term, and (iii) one or more alternate voice command trigger terms that are each determined based at least on the voice command trigger term; after generating the data structure instance, enabling triggering of the new voice action by a spoken utterance based at least on storing the data structure instance at a database that comprises one or more other data structure instances, wherein one or more of the other data structure instances specify (i) an application, and (ii) one or more voice command trigger terms that includes at least one voice command trigger term that is determined based at least on another voice command trigger term in the same data structure instance; after enabling triggering of the new voice action by a spoken utterance and based at least on determining that a transcription of a spoken utterance includes a particular one of the alternate voice command trigger terms that are each determined based at least on the voice command trigger term, selecting a particular data structure instance from the database that specifies the particular one of the alternate voice command trigger terms that are each determined based at least on the voice command trigger term; and identifying a particular application that is specified by the particular data structure instance. 5. The computer-implemented method of claim 1 , wherein generating the data structure instance that specifies (i) the application, (ii) the voice command trigger term, and (iii) the one or more alternate voice command trigger terms that are each determined based at least on the voice command trigger term comprises: generating one or more alternate voice command trigger terms by applying one or more synonym rules, optionalization rules, or expansion rules to the voice command trigger term. | 0.64073 |
1. A method of controlling an experience of a plurality of unique users surrounded by a plurality of application devices connected to a network, the method comprising acts of: a server connected to the network, the server automatically identifying one of the plurality of unique users and an environment surrounding the identified user; receiving status of the plurality of application devices in the environment; retrieving a profile of the identified one user of the plurality of unique users and a context profile relating to the environment; generating at least one instruction for two or more of the plurality of application devices participating in the experience based at least in part on the identification of the identified one user of the plurality of unique users and at least in part on the received status of the plurality of application devices in the environment; and each of the two or more application devices participating in the experience receiving and upon receipt performing the at least one instruction. | 1. A method of controlling an experience of a plurality of unique users surrounded by a plurality of application devices connected to a network, the method comprising acts of: a server connected to the network, the server automatically identifying one of the plurality of unique users and an environment surrounding the identified user; receiving status of the plurality of application devices in the environment; retrieving a profile of the identified one user of the plurality of unique users and a context profile relating to the environment; generating at least one instruction for two or more of the plurality of application devices participating in the experience based at least in part on the identification of the identified one user of the plurality of unique users and at least in part on the received status of the plurality of application devices in the environment; and each of the two or more application devices participating in the experience receiving and upon receipt performing the at least one instruction. 4. The method according to claim 1 , wherein the plurality of application devices comprises at least one of Web tablet, set-top box, VCR, TV, PDA, lamp, coffee machine, radio, telephone, background wall, DVD player and electronic information panel. | 0.630008 |
16. The system according to claim 15 wherein said group of location attribute types further comprise at least one general location attribute type, and at least one specific location attribute type. | 16. The system according to claim 15 wherein said group of location attribute types further comprise at least one general location attribute type, and at least one specific location attribute type. 18. The system according to claim 16 wherein said specific location attribute type is further configured for representation of a root spatial unit size object class. | 0.902093 |
1. A method for using indexes to search a knowledge base in at least one computer system, the method executed by the computer system and comprising: accessing a knowledge base comprising a semantic network of relationships among concepts, each concept having a set of values associated with it, wherein each concept is an instance of a category and each value is an instance of an attribute and wherein categories and attributes form a knowledge base schema; receiving, from a user searching for one or more target concepts, a query represented as criteria and criteria values that specify constraints on the categories and the attributes; executing a search of the concepts and the values of the knowledge base to retrieve the one or more target concepts using indexes selected from a group consisting of: a) one or more transitive indexes that index transitive relationships from concepts in a first category through at least one second category to concepts in a third category and b) one or more transitive closure indexes that index transitive closure relationships amongst concepts within a category; and retrieving a result subset of the target concepts and the values that satisfies the criteria and criteria values. | 1. A method for using indexes to search a knowledge base in at least one computer system, the method executed by the computer system and comprising: accessing a knowledge base comprising a semantic network of relationships among concepts, each concept having a set of values associated with it, wherein each concept is an instance of a category and each value is an instance of an attribute and wherein categories and attributes form a knowledge base schema; receiving, from a user searching for one or more target concepts, a query represented as criteria and criteria values that specify constraints on the categories and the attributes; executing a search of the concepts and the values of the knowledge base to retrieve the one or more target concepts using indexes selected from a group consisting of: a) one or more transitive indexes that index transitive relationships from concepts in a first category through at least one second category to concepts in a third category and b) one or more transitive closure indexes that index transitive closure relationships amongst concepts within a category; and retrieving a result subset of the target concepts and the values that satisfies the criteria and criteria values. 14. The method of claim 1 , further comprising merging two or more indexes that correlate to attributes along an attribute path to form a single index. | 0.634342 |
1. A method of translating a subject code executable by a subject computing architecture into a target code executable by a second computing architecture, wherein the subject code includes at least a first program and a second program, comprising: providing a first translator instance which translates the subject code of the first program into the target code including translating a first portion of the subject code into a portion of the target code; caching said portion of the target code into a shared code cache facility; providing a second translator instance which is different from the first translator instance and which translates the subject code of the second program into the target code, wherein the second translator instance operates simultaneously with the first translator instance; retrieving the cached portion of the target code from the shared code cache facility upon a compatibility detection between said cached portion of the target code and a second portion of the subject code in the second program, including loading the portion of the target code in the shared code cache facility into a portion of memory which is shared amongst at least the first and second translator instances; and, copying at least one part of the shared code cache facility to a private portion of memory associated with the second translator instance upon modification of the at least one part of the shared code cache facility by the second translator instance. | 1. A method of translating a subject code executable by a subject computing architecture into a target code executable by a second computing architecture, wherein the subject code includes at least a first program and a second program, comprising: providing a first translator instance which translates the subject code of the first program into the target code including translating a first portion of the subject code into a portion of the target code; caching said portion of the target code into a shared code cache facility; providing a second translator instance which is different from the first translator instance and which translates the subject code of the second program into the target code, wherein the second translator instance operates simultaneously with the first translator instance; retrieving the cached portion of the target code from the shared code cache facility upon a compatibility detection between said cached portion of the target code and a second portion of the subject code in the second program, including loading the portion of the target code in the shared code cache facility into a portion of memory which is shared amongst at least the first and second translator instances; and, copying at least one part of the shared code cache facility to a private portion of memory associated with the second translator instance upon modification of the at least one part of the shared code cache facility by the second translator instance. 16. The method of claim 1 wherein the portion of target code cached as a unit comprises a subject library. | 0.575416 |
71. A non-transitory computer readable medium encoded with a computer program including instructions to cause a processor to: analyze electronic messages of a first user with respect to one or more features associated with the electronic messages; associate descriptive tags with the electronic messages of the first user based on analysis results; and perform tasks with respect to the electronic messages of the first user, on behalf of the first user, based on the descriptive tags associated with the respective electronic messages; wherein the computer program further includes instructions to cause the processor to, parse information from a first electronic message received by the first user, assign a meaning to the first electronic message based on the parsed information, identify a second electronic message received and tagged by a second user, and define a tag for the first electronic message based on a combination of the meaning of the first electronic message, the tag assigned to the second electronic message, and a relationship between the first and second users. | 71. A non-transitory computer readable medium encoded with a computer program including instructions to cause a processor to: analyze electronic messages of a first user with respect to one or more features associated with the electronic messages; associate descriptive tags with the electronic messages of the first user based on analysis results; and perform tasks with respect to the electronic messages of the first user, on behalf of the first user, based on the descriptive tags associated with the respective electronic messages; wherein the computer program further includes instructions to cause the processor to, parse information from a first electronic message received by the first user, assign a meaning to the first electronic message based on the parsed information, identify a second electronic message received and tagged by a second user, and define a tag for the first electronic message based on a combination of the meaning of the first electronic message, the tag assigned to the second electronic message, and a relationship between the first and second users. 73. The non-transitory computer readable medium of claim 71 , further including instructions to cause the processor to: determine the relationship between the first and second recipients with respect to an implied social graph of electronic message users. | 0.728502 |
16. A non-transitory computer-readable storage medium comprising executable instructions to cause a hardware processor to: identify, by the hardware processor, a first compliance script; determine a value of a cryptographic hash function of at least part of the first compliance script; determine, using the value of the cryptographic hash function, an installation path of a second compliance script; identify a security context associated with the second compliance script at installation time; and execute, by the hardware processor, the second compliance script within the security context to determine whether a parameter of a computer system is within an allowed range. | 16. A non-transitory computer-readable storage medium comprising executable instructions to cause a hardware processor to: identify, by the hardware processor, a first compliance script; determine a value of a cryptographic hash function of at least part of the first compliance script; determine, using the value of the cryptographic hash function, an installation path of a second compliance script; identify a security context associated with the second compliance script at installation time; and execute, by the hardware processor, the second compliance script within the security context to determine whether a parameter of a computer system is within an allowed range. 18. The non-transitory computer-readable storage medium of claim 16 , wherein executable instructions to execute the second compliance script comprise executable instruction to invoke at least one of: a mandatory access control function or a discretionary access control function. | 0.5 |
8. The method of claim 1 , wherein constructing the traversable representation comprises: parsing code of the program to identify control structures that govern alternative statements; and converting each control structure into a sub-graph with conditioning function and with alternative statements represented as separate paths in the graph that later merge and loop. | 8. The method of claim 1 , wherein constructing the traversable representation comprises: parsing code of the program to identify control structures that govern alternative statements; and converting each control structure into a sub-graph with conditioning function and with alternative statements represented as separate paths in the graph that later merge and loop. 9. The method of claim 8 , further comprising: linking the sub-graph structure to the functional dataflow graph by linking input and output interfaces of the sub-graph structure to surrounding nodes of the functional dataflow graph. | 0.881244 |
1. A method for recording a media content event at a media device, the method comprising: receiving by the media device, the media content event in a broadcasted media content stream; recording the media content event by the media device; monitoring real time provided by a system clock of the media device; comparing the monitored real time with a closing credits monitor time; in response to detecting the monitored real time reaches the closing credits monitor time, grabbing a series of subsequently received image frames from the media content event that is being recorded after the monitored real time reaches the closing credits monitor time, wherein the closing credits monitor real time is a predefined duration before recording end time of the media content event; wherein for each of the grabbed subsequently received image frames, the method further comprising: analyzing by the media device, the image frame to identify text presented in the analyzed image frame; identifying by the media device, at least one attribute pertaining to the identified text; comparing by the media device, the at least one attribute with a corresponding predefined closing credits attribute, wherein the corresponding predefined closing credits attribute is stored in a memory medium; and determining that the identified text corresponds to closing credits of the media content event in response to the at least one attribute matches the corresponding predefined closing credits attribute; and initiating an end of the recording of the media content event in response to determining that the identified text corresponds to the closing credits of the media content event. | 1. A method for recording a media content event at a media device, the method comprising: receiving by the media device, the media content event in a broadcasted media content stream; recording the media content event by the media device; monitoring real time provided by a system clock of the media device; comparing the monitored real time with a closing credits monitor time; in response to detecting the monitored real time reaches the closing credits monitor time, grabbing a series of subsequently received image frames from the media content event that is being recorded after the monitored real time reaches the closing credits monitor time, wherein the closing credits monitor real time is a predefined duration before recording end time of the media content event; wherein for each of the grabbed subsequently received image frames, the method further comprising: analyzing by the media device, the image frame to identify text presented in the analyzed image frame; identifying by the media device, at least one attribute pertaining to the identified text; comparing by the media device, the at least one attribute with a corresponding predefined closing credits attribute, wherein the corresponding predefined closing credits attribute is stored in a memory medium; and determining that the identified text corresponds to closing credits of the media content event in response to the at least one attribute matches the corresponding predefined closing credits attribute; and initiating an end of the recording of the media content event in response to determining that the identified text corresponds to the closing credits of the media content event. 4. The method of claim 1 , wherein each of a plurality of different media content events received in the broadcasted media content stream are uniquely identifiable by an identifier, wherein the predefined closing credits attribute is predefined based on the closing credits of the associated media content event, and wherein, for each of the plurality of different media content events, the media content identifier and the associated predefined closing credits attribute are stored in the memory medium, the method further comprising: comparing the identifier of the media content event that is being recorded with the stored identifiers of the plurality of different media content events; and retrieving the stored predefined closing credits attribute that is associated with the media content event that has the same identifier as the media content event that is being recorded. | 0.570026 |
1. A method for generating content of a topic for an intended audience, comprising: obtaining topic information regarding a topic to be presented to an intended audience; obtaining knowledge information regarding the intended audience; determining, using a processor, one or more metaphors relating to the topic and potentially understood by the intended audience based at least in part on the topic information and the knowledge information, wherein a metaphor of the one or more metaphors is a term, phrase, or image which when applied to the topic information suggests a resemblance to the topic information, but is not literally relevant to the topic information; determining, using a processor, one or more terms related to at least one metaphor of the one or more metaphors that correlate to one or more terms of the topic information, wherein the determining one or more terms comprises performing a comparative analysis between the topic information and the at least one metaphor; and preparing, using a processor, content for the topic information targeted to the intended audience based at least in part on the one or more terms related to the at least one metaphor. | 1. A method for generating content of a topic for an intended audience, comprising: obtaining topic information regarding a topic to be presented to an intended audience; obtaining knowledge information regarding the intended audience; determining, using a processor, one or more metaphors relating to the topic and potentially understood by the intended audience based at least in part on the topic information and the knowledge information, wherein a metaphor of the one or more metaphors is a term, phrase, or image which when applied to the topic information suggests a resemblance to the topic information, but is not literally relevant to the topic information; determining, using a processor, one or more terms related to at least one metaphor of the one or more metaphors that correlate to one or more terms of the topic information, wherein the determining one or more terms comprises performing a comparative analysis between the topic information and the at least one metaphor; and preparing, using a processor, content for the topic information targeted to the intended audience based at least in part on the one or more terms related to the at least one metaphor. 11. The method of claim 1 , wherein performing the comparative analysis comprises associating terms of the topic information with terms related to the one or more metaphors based on a preconfigured mapping between topics and metaphors. | 0.5 |
8. A method for interacting with a user of a device through a character presented by the device, the method comprising: determining that a trigger event has occurred by processing (i) information about the trigger event and (ii) data received from the device of the user or data received from a calendar of the user; causing, in response to determining that the trigger event has occurred, a session with the character to be started on the device; selecting a first script for interactions between the user and the character presented by the device; selecting a first movie clip data item from a data store of movie clip data items, wherein the first movie clip data item corresponds to a first movie clip and comprises an identifier of a character in the first movie clip; obtaining information about the character in the first movie clip using the identifier; causing the device to present the first move clip to the user; constructing a phrase using the script and the information about the character in the first movie clip; and causing the character presented by device to present the phrase to the user. | 8. A method for interacting with a user of a device through a character presented by the device, the method comprising: determining that a trigger event has occurred by processing (i) information about the trigger event and (ii) data received from the device of the user or data received from a calendar of the user; causing, in response to determining that the trigger event has occurred, a session with the character to be started on the device; selecting a first script for interactions between the user and the character presented by the device; selecting a first movie clip data item from a data store of movie clip data items, wherein the first movie clip data item corresponds to a first movie clip and comprises an identifier of a character in the first movie clip; obtaining information about the character in the first movie clip using the identifier; causing the device to present the first move clip to the user; constructing a phrase using the script and the information about the character in the first movie clip; and causing the character presented by device to present the phrase to the user. 16. The method of claim 8 , wherein the first movie clip data item comprises a start time and an end time of the first movie clip. | 0.645833 |
17. A computer system for localizing programming models, comprising: given a programming model having one or more elements, each element having an element name initially in a language spoken by an author of the programming model, storage means for storing a set of property files of the model, a different property file for different languages, for each element name, (a) the element name being paired to corresponding string values generating the element name in different languages resulting in element name-string value pairs, and (b) the resulting pairs being stored in the different language property files according to language; and display means coupled to access the storage means and for generating display of each element name in a respective language of different geographic locales, by: for each of the different geographic locales, (i) obtaining local system defined geographic locale, (ii) using the obtained local system defined geographic locale, (a) opening the property file of the language corresponding to the obtained local system geographic locale, (b) looking up the element name-string value pairs in the opened property file, and (c) obtaining the respective string values of each element name in the respective language spoken in the obtained local system defined geographic locale and free of user specification of spoken language to use, and (iii) using the obtained string values, displaying each element name in the respective language spoken in the obtained local system defined geographic locale in a manner free of manual translation of the element names across the different geographic locales, and a manner free of code changes, wherein obtaining from the storage means includes locating the respective string values automatically as a function of the obtained local system defined geographic locale and not as a function of a user specified language preference. | 17. A computer system for localizing programming models, comprising: given a programming model having one or more elements, each element having an element name initially in a language spoken by an author of the programming model, storage means for storing a set of property files of the model, a different property file for different languages, for each element name, (a) the element name being paired to corresponding string values generating the element name in different languages resulting in element name-string value pairs, and (b) the resulting pairs being stored in the different language property files according to language; and display means coupled to access the storage means and for generating display of each element name in a respective language of different geographic locales, by: for each of the different geographic locales, (i) obtaining local system defined geographic locale, (ii) using the obtained local system defined geographic locale, (a) opening the property file of the language corresponding to the obtained local system geographic locale, (b) looking up the element name-string value pairs in the opened property file, and (c) obtaining the respective string values of each element name in the respective language spoken in the obtained local system defined geographic locale and free of user specification of spoken language to use, and (iii) using the obtained string values, displaying each element name in the respective language spoken in the obtained local system defined geographic locale in a manner free of manual translation of the element names across the different geographic locales, and a manner free of code changes, wherein obtaining from the storage means includes locating the respective string values automatically as a function of the obtained local system defined geographic locale and not as a function of a user specified language preference. 20. A computer system as claimed in claim 17 wherein the different languages include any of French, Japanese, Italian, English, German and Russian. | 0.525558 |
7. A computer system for verifying artifacts created from an original source ontology model, comprising: a processor; and a memory connected to the processor, wherein the memory is encoded with instructions and wherein the instructions when executed comprise: instructions for creating an annotation framework to represent ontology taxonomy, wherein for each property in the original source ontology model an annotation is inserted into a programmable artifact, said programmable artifact further comprising a java model; instructions for transforming the original source ontology model into said programmable artifact using said annotation framework, said annotation framework mapping from the original source ontology model to said programmable artifact and to the original source ontology model from said programmable artifact, wherein the instructions for transforming the original ontology model are executed by utilizing stereotypes from Uniform Modeling Language as a type of extensibility mechanism; instructions for parsing said annotated java model to create a generated ontology model as semantically equivalent to the original source ontology model; and instructions for conducting an isomorphic comparison of said generated ontology model to the original source ontology model to verify semantic equivalency of said generated ontology model and the original source ontology model. | 7. A computer system for verifying artifacts created from an original source ontology model, comprising: a processor; and a memory connected to the processor, wherein the memory is encoded with instructions and wherein the instructions when executed comprise: instructions for creating an annotation framework to represent ontology taxonomy, wherein for each property in the original source ontology model an annotation is inserted into a programmable artifact, said programmable artifact further comprising a java model; instructions for transforming the original source ontology model into said programmable artifact using said annotation framework, said annotation framework mapping from the original source ontology model to said programmable artifact and to the original source ontology model from said programmable artifact, wherein the instructions for transforming the original ontology model are executed by utilizing stereotypes from Uniform Modeling Language as a type of extensibility mechanism; instructions for parsing said annotated java model to create a generated ontology model as semantically equivalent to the original source ontology model; and instructions for conducting an isomorphic comparison of said generated ontology model to the original source ontology model to verify semantic equivalency of said generated ontology model and the original source ontology model. 9. The method of claim 7 , further comprising instructions for storing said generated ontology model in a memory. | 0.742836 |
1. An apparatus comprising: at least one processing device comprising a processor coupled to a memory and implementing a behavioral security analysis system, the behavioral security analysis system comprising: a computational semantic parser configured to process data associated with a security information and event management system to generate a plurality of logical descriptors, the data comprising log data of the security information and event management system; and a learning engine coupled to the computational semantic parser and configured to generate a plurality of behavioral security descriptors based at least in part on at least a subset of the logical descriptors; wherein the behavioral security descriptors are made accessible to an alerting engine of the security information and event management system and utilized to generate one or more security alerts; and wherein the computational semantic parser comprises: a syntactic decomposition module configured to decompose at least a portion of the log data into component elements comprising respective atomic syntactic units; a lexical meaning assignment module configured to assign lexical meanings to the component elements utilizing metadata associated with the component elements and a lexicon of syntactic types, the metadata comprising position information and attributes associated with the atomic syntactic units; a denotation assignment module configured to assign context denotation information to the component elements; and a semantic recomposition module configured to generate a given logical descriptor based on at least one combinatorial tree having nodes associated with respective ones of the component elements and a tree structure determined using the assigned lexical meanings and context denotation information. | 1. An apparatus comprising: at least one processing device comprising a processor coupled to a memory and implementing a behavioral security analysis system, the behavioral security analysis system comprising: a computational semantic parser configured to process data associated with a security information and event management system to generate a plurality of logical descriptors, the data comprising log data of the security information and event management system; and a learning engine coupled to the computational semantic parser and configured to generate a plurality of behavioral security descriptors based at least in part on at least a subset of the logical descriptors; wherein the behavioral security descriptors are made accessible to an alerting engine of the security information and event management system and utilized to generate one or more security alerts; and wherein the computational semantic parser comprises: a syntactic decomposition module configured to decompose at least a portion of the log data into component elements comprising respective atomic syntactic units; a lexical meaning assignment module configured to assign lexical meanings to the component elements utilizing metadata associated with the component elements and a lexicon of syntactic types, the metadata comprising position information and attributes associated with the atomic syntactic units; a denotation assignment module configured to assign context denotation information to the component elements; and a semantic recomposition module configured to generate a given logical descriptor based on at least one combinatorial tree having nodes associated with respective ones of the component elements and a tree structure determined using the assigned lexical meanings and context denotation information. 7. The apparatus of claim 1 wherein the lexicon of syntactic types comprises one or more explicit listings corresponding to computational semantic constructs defined in a lambda calculus. | 0.702504 |
43. The method of claim 40 , wherein said invalid fragment is indicated to be invalid by an invalid attribute. | 43. The method of claim 40 , wherein said invalid fragment is indicated to be invalid by an invalid attribute. 44. The method of claim 43 , wherein said invalid attribute is defined in said prescribed syntax. | 0.96765 |
1. An apparatus for information retrieval, comprising: a computer system including a computer processor being programmed to receive a query from a remotely located user system via a network, the query specifying one or more numerical data constraints, and contextual constraints; said computer system including a memory storing a computer-searchable electronic index, the index comprising a plurality of entries, each of the index entries representing an item of numerical data extracted from at least one of a plurality of electronic source documents including one or more natural language documents, wherein the item of numerical data comprises a numerical value, a prefix corresponding to a degree of significant digits, and a unit of measure; said computer system processor being further programmed to determine the relevancy of the query to each of one or more of the index entries based at least partly on a comparison between the numerical data constraint and the index entry's item of numerical data, at least partly on a comparison between the contextual constraint and contextual information extracted from the corresponding source document from which the index entry's item of numerical data was extracted, and at least partly on an evaluation of at least one positional relationship between the index entry's item of numerical data and the contextual information within a given source document, and generate a response to the query based on the relevancy. | 1. An apparatus for information retrieval, comprising: a computer system including a computer processor being programmed to receive a query from a remotely located user system via a network, the query specifying one or more numerical data constraints, and contextual constraints; said computer system including a memory storing a computer-searchable electronic index, the index comprising a plurality of entries, each of the index entries representing an item of numerical data extracted from at least one of a plurality of electronic source documents including one or more natural language documents, wherein the item of numerical data comprises a numerical value, a prefix corresponding to a degree of significant digits, and a unit of measure; said computer system processor being further programmed to determine the relevancy of the query to each of one or more of the index entries based at least partly on a comparison between the numerical data constraint and the index entry's item of numerical data, at least partly on a comparison between the contextual constraint and contextual information extracted from the corresponding source document from which the index entry's item of numerical data was extracted, and at least partly on an evaluation of at least one positional relationship between the index entry's item of numerical data and the contextual information within a given source document, and generate a response to the query based on the relevancy. 27. The information retrieval apparatus of claim 1 wherein the computer system comprises a plurality of computer servers located at one or more locations each geographically remote from the user system. | 0.570352 |
1. A method for generating a submittal register via a processing device, the submittal register for use in interactive construction planning and specification management, the method comprising: receiving a first file containing a plurality of construction specification documents for a construction project in a first format; converting the first file to a first file converted format; removing conversion errors from the first file in the first file converted format; applying an algorithm to the first file in the first file converted format to produce a second file; running a quality control check of the second file; applying a processing program to the second file; generating the submittal register for the plurality of construction specification documents based on the applied processing program to the second file, the generated submittal register including a plurality of elements of information for the construction project, the plurality of elements of information including project specification data and at least one drawing image for the construction project; identifying at least one hyperlink for each of the plurality of elements of information; automatically associating the at least one hyperlink with each of the plurality of elements of information and with at least one other related one of the plurality of elements of information; in response to receipt of a selection of any of the at least one hyperlink, providing at least one option to selectively access each of the at least one other related one of the plurality of elements of information; in response to the access selection, presenting the selected at least one other related one of the plurality of elements of information, wherein the applying a processing program to the second file includes applying an algorithm to identify one or more selected from a group consisting of summary text in the second file, one or more submittal categories for submittal information in the second file, and a submittal description in the second file; and associating at least two selected from a group consisting of the submittal categories, the summary text, and the submittal description with one other, wherein at least one of the associated submittal categories, the summary text, or the submittal description are searchable. | 1. A method for generating a submittal register via a processing device, the submittal register for use in interactive construction planning and specification management, the method comprising: receiving a first file containing a plurality of construction specification documents for a construction project in a first format; converting the first file to a first file converted format; removing conversion errors from the first file in the first file converted format; applying an algorithm to the first file in the first file converted format to produce a second file; running a quality control check of the second file; applying a processing program to the second file; generating the submittal register for the plurality of construction specification documents based on the applied processing program to the second file, the generated submittal register including a plurality of elements of information for the construction project, the plurality of elements of information including project specification data and at least one drawing image for the construction project; identifying at least one hyperlink for each of the plurality of elements of information; automatically associating the at least one hyperlink with each of the plurality of elements of information and with at least one other related one of the plurality of elements of information; in response to receipt of a selection of any of the at least one hyperlink, providing at least one option to selectively access each of the at least one other related one of the plurality of elements of information; in response to the access selection, presenting the selected at least one other related one of the plurality of elements of information, wherein the applying a processing program to the second file includes applying an algorithm to identify one or more selected from a group consisting of summary text in the second file, one or more submittal categories for submittal information in the second file, and a submittal description in the second file; and associating at least two selected from a group consisting of the submittal categories, the summary text, and the submittal description with one other, wherein at least one of the associated submittal categories, the summary text, or the submittal description are searchable. 6. The method of claim 1 , wherein the second file is a spreadsheet format. | 0.663187 |
2. The method of claim 1 , wherein the data store of information is indexed into one or more indexes to facilitate the determining of the first and second data sets. | 2. The method of claim 1 , wherein the data store of information is indexed into one or more indexes to facilitate the determining of the first and second data sets. 3. The method of claim 2 , wherein a one of the indexes comprises an index of all users indexed by corresponding user IDs that includes, for each particular user ID, the set of other users identified by their respective user IDs whose respective user nodes are connected to the user node corresponding to the particular user ID in the index. | 0.943246 |
17. A system for facilitating navigation of previously presented screen data in an ongoing online meeting, the system comprising: a storage device for storing screen data representing a previously presented portion of an ongoing online meeting; image processing circuitry for capturing, in response to a trigger event, a screenshot of the screen data for the ongoing online meeting; display circuitry for causing the display, on a viewer computing device while the ongoing online meeting is still ongoing, of an image thumbnail generated from the screenshot, the image thumbnail facilitating navigation, on the viewer computing device, of the previously presented portion of the ongoing online meeting; a user interface for receiving, at the viewer computing device while the ongoing online meeting is still ongoing, a selection of the image thumbnail; and presentation circuitry for causing the display, in response to the selection of the image thumbnail, on the viewer computing device, simultaneously and while the ongoing online meeting is still ongoing, first screen data corresponding to a currently presented portion of the ongoing online meeting and second screen data corresponding to the screenshot, wherein the first screen data is presented picture-in-picture inside the second screen data or the second screen data is presented picture-in-picture inside the first screen data; wherein the trigger event comprises a size of an accumulative bounding box encapsulating changes to the stored screen data increasing past a threshold. | 17. A system for facilitating navigation of previously presented screen data in an ongoing online meeting, the system comprising: a storage device for storing screen data representing a previously presented portion of an ongoing online meeting; image processing circuitry for capturing, in response to a trigger event, a screenshot of the screen data for the ongoing online meeting; display circuitry for causing the display, on a viewer computing device while the ongoing online meeting is still ongoing, of an image thumbnail generated from the screenshot, the image thumbnail facilitating navigation, on the viewer computing device, of the previously presented portion of the ongoing online meeting; a user interface for receiving, at the viewer computing device while the ongoing online meeting is still ongoing, a selection of the image thumbnail; and presentation circuitry for causing the display, in response to the selection of the image thumbnail, on the viewer computing device, simultaneously and while the ongoing online meeting is still ongoing, first screen data corresponding to a currently presented portion of the ongoing online meeting and second screen data corresponding to the screenshot, wherein the first screen data is presented picture-in-picture inside the second screen data or the second screen data is presented picture-in-picture inside the first screen data; wherein the trigger event comprises a size of an accumulative bounding box encapsulating changes to the stored screen data increasing past a threshold. 46. The system of claim 17 , wherein at least some of the screen data is represented by a plurality of tiles, and wherein another trigger event comprises a number of tiles encapsulating changes to the stored screen data increasing past a threshold. | 0.519209 |
16. The computer program product of claim 15 , wherein the computer is further caused to: rank the groups in hierarchical order based on a scoring factor; and determine a number of positions between a ranked group and a sequence of hierarchy locations. | 16. The computer program product of claim 15 , wherein the computer is further caused to: rank the groups in hierarchical order based on a scoring factor; and determine a number of positions between a ranked group and a sequence of hierarchy locations. 17. The computer program product of claim 16 , wherein the computer is further caused to: insert a symbol between hierarchy assigned location numbers to separated different hierarchy levels; and determine a number of steps between a sequence of hierarchy locations based on a number of symbols between hierarchy locations. | 0.893521 |
9. The system of claim 1 , wherein the audio/video report is a streaming file. | 9. The system of claim 1 , wherein the audio/video report is a streaming file. 10. The system of claim 9 , wherein the streaming file is a windows media player (.wmv) file. | 0.972074 |
9. The handheld electronic device of claim 8 , wherein the processor apparatus is structured to determine that a plurality of the compound language solutions have an equal quantity of other portions, to determine a length identity value for each of said plurality of compound language solutions, and to output said plurality of compound language solutions amongst themselves in order of decreasing priority according to the increasing length identity value. | 9. The handheld electronic device of claim 8 , wherein the processor apparatus is structured to determine that a plurality of the compound language solutions have an equal quantity of other portions, to determine a length identity value for each of said plurality of compound language solutions, and to output said plurality of compound language solutions amongst themselves in order of decreasing priority according to the increasing length identity value. 10. The handheld electronic device of claim 9 , wherein the processor apparatus is structured to determine that the first one of the compound language solutions and the second one of the compound language solutions have an equal length identity value and, responsive thereto, to initiate said making a determination. | 0.849004 |
11. A computer-implemented method comprising: providing a graphical design environment to a user using a processor, wherein the graphical design environment includes a drag and drop interface that allows the user to add a widget to a design; displaying a note field in a note interface in the graphical design environment that accepts a text string from the user; exporting the design from the graphical design environment and storing the design as an intermittent coded representation of the design in a markup language format, wherein a set of at least two widgets that include the widget are exported with the design; rendering the design in a design player using the intermitted coded representation of the design in the markup language format; displaying a discussion interface in the design player that: (i) is displayed in the design player consistently with the design; (ii) displays the text string from the user as a note; (iii) has a scrollbar; and (iv) accepts a comment from a second user regarding the note; allowing the second user to use the scrollbar to scroll through a set of notes that are associated with different portions of the design while viewing a fixed portion of the design; in response to selection of an interface element that is in the discussion interface with the note by the second user, placing the design player into a state wherein each widget in the set of at least two widgets is exposed for selection by the second user as a selected widget, and wherein selection of the selected widget by the second user links the note with the widget; and displaying the comment in the graphical design environment after being accepted in the discussion interface; wherein the text string and comment are: (i) stored in a data store along with an indication of the selected widget; (ii) read from the data store and rendered by the design player from the markup language format; and (iii) read from the data store and displayed in the graphical design environment from a design environment format; and wherein the data store is accessible to the graphical design environment and the design player. | 11. A computer-implemented method comprising: providing a graphical design environment to a user using a processor, wherein the graphical design environment includes a drag and drop interface that allows the user to add a widget to a design; displaying a note field in a note interface in the graphical design environment that accepts a text string from the user; exporting the design from the graphical design environment and storing the design as an intermittent coded representation of the design in a markup language format, wherein a set of at least two widgets that include the widget are exported with the design; rendering the design in a design player using the intermitted coded representation of the design in the markup language format; displaying a discussion interface in the design player that: (i) is displayed in the design player consistently with the design; (ii) displays the text string from the user as a note; (iii) has a scrollbar; and (iv) accepts a comment from a second user regarding the note; allowing the second user to use the scrollbar to scroll through a set of notes that are associated with different portions of the design while viewing a fixed portion of the design; in response to selection of an interface element that is in the discussion interface with the note by the second user, placing the design player into a state wherein each widget in the set of at least two widgets is exposed for selection by the second user as a selected widget, and wherein selection of the selected widget by the second user links the note with the widget; and displaying the comment in the graphical design environment after being accepted in the discussion interface; wherein the text string and comment are: (i) stored in a data store along with an indication of the selected widget; (ii) read from the data store and rendered by the design player from the markup language format; and (iii) read from the data store and displayed in the graphical design environment from a design environment format; and wherein the data store is accessible to the graphical design environment and the design player. 14. The computer-implemented method of claim 11 , further comprising: displaying an expansion icon in the discussion interface with the note; wherein selecting the expansion icon hides and displays a set of comments associated with the note; and the set of comments includes the comment. | 0.77605 |
8. The method recited in claim 1 wherein said first event is the elapse of a predetermined length of time after the occurrence of the previous first event. | 8. The method recited in claim 1 wherein said first event is the elapse of a predetermined length of time after the occurrence of the previous first event. 9. The method recited in claim 8 wherein said predetermined length of time is approximately 5 to 10 minutes. | 0.940901 |
1. A computer-implemented method comprising: obtaining, in response to searching one or more search indexes based on a query, a ranked set of search results that includes both (i) one or more particular web search results and (ii) one or more particular custom content search results, wherein the one or more particular web search results identify respective web resources that are indexed in the one or more search indices, and wherein the one or more particular custom content search results identify respective custom content resources in a collection of resources that are exposed to a search engine by an owner of the custom content resources and that are indexed in the one or more search indexes; identifying a presentation setting for presenting combined search results that include one or more web search results and one or more custom content search results, the presentation setting specifying how to visually distinguish the one or more web search results from the one or more custom content search results on a search results page, wherein the presentation setting is specified by the owner that exposed to the search engine the collection of resources that includes the one or more custom content resources that are identified by the one or more particular custom content search results; generating, based on the presentation setting for presenting combined search results that include one or more web search results and one or more custom content search results, a search results page that includes a subset of the ranked set of search results, the subset including one or more of the particular web search results and one or more of the particular custom content search results, including visually distinguishing the one or more web search results from the one or more custom content search results on the search results page according to the presentation setting; and providing the search results page for output in response to the query. | 1. A computer-implemented method comprising: obtaining, in response to searching one or more search indexes based on a query, a ranked set of search results that includes both (i) one or more particular web search results and (ii) one or more particular custom content search results, wherein the one or more particular web search results identify respective web resources that are indexed in the one or more search indices, and wherein the one or more particular custom content search results identify respective custom content resources in a collection of resources that are exposed to a search engine by an owner of the custom content resources and that are indexed in the one or more search indexes; identifying a presentation setting for presenting combined search results that include one or more web search results and one or more custom content search results, the presentation setting specifying how to visually distinguish the one or more web search results from the one or more custom content search results on a search results page, wherein the presentation setting is specified by the owner that exposed to the search engine the collection of resources that includes the one or more custom content resources that are identified by the one or more particular custom content search results; generating, based on the presentation setting for presenting combined search results that include one or more web search results and one or more custom content search results, a search results page that includes a subset of the ranked set of search results, the subset including one or more of the particular web search results and one or more of the particular custom content search results, including visually distinguishing the one or more web search results from the one or more custom content search results on the search results page according to the presentation setting; and providing the search results page for output in response to the query. 2. The method of claim 1 , wherein the presentation setting specifies a visual format for presenting the one or more custom content search results on the search results page. | 0.894832 |
1. A computer-readable medium excluding signals, the computer-readable medium having computer-executable instructions for performing steps comprising: (a) determining whether a sub-word of a writing line corresponds to a cursive writing style; (b) determining whether the sub-word corresponds to a hand-printed writing style; and (c) in response to (a) and (b), classifying a script type of the writing line as a first script type when a first number of sub-words that are classified as the first script type exceeds a second number of sub-words that are classified as a second script type. | 1. A computer-readable medium excluding signals, the computer-readable medium having computer-executable instructions for performing steps comprising: (a) determining whether a sub-word of a writing line corresponds to a cursive writing style; (b) determining whether the sub-word corresponds to a hand-printed writing style; and (c) in response to (a) and (b), classifying a script type of the writing line as a first script type when a first number of sub-words that are classified as the first script type exceeds a second number of sub-words that are classified as a second script type. 8. The computer-readable medium excluding signals, the computer-readable medium of claim 1 having computer-executable instructions to perform: (d) grouping at least one stroke to form the sub-word. | 0.679848 |
6. A method comprising: determining a time allotted to consume a portion of a media item; determining a consumption rate; calculating a range of words to be included in the portion of a media item based at least in part on the desired time and the consumption rate; determining an endpoint located within the media item with the range of words, the endpoint being a logical break to define a segment of the media item, wherein the endpoint separates a continuous body of content included in the media item; associating the endpoint with the media item without modifying the media item; and causing presentation of the media item. | 6. A method comprising: determining a time allotted to consume a portion of a media item; determining a consumption rate; calculating a range of words to be included in the portion of a media item based at least in part on the desired time and the consumption rate; determining an endpoint located within the media item with the range of words, the endpoint being a logical break to define a segment of the media item, wherein the endpoint separates a continuous body of content included in the media item; associating the endpoint with the media item without modifying the media item; and causing presentation of the media item. 7. The method as recited in claim 6 , further comprising associating a graphic with the endpoint, the graphic to be rendered adjacent to the endpoint when the media item is rendered with the endpoint. | 0.887584 |
6. A computer program product for providing a contextual search tool that improves search results presented to a user, the computer program product comprising at least one non-transitory computer-readable medium having computer-readable program code portions embodied therein, the computer-readable program code portions comprising: an executable portion configured for receiving a search from the user, wherein the search is received through a user computer system; an executable portion configured for accessing user profile information from a user profile; an executable portion configured for accessing user account information, wherein the user account information is access by accessing one or more financial accounts of the user; an executable portion configured for determining the search results to display in a contextual search interface based on the search received from the user, the user profile information, and the user account information from the one or more financial accounts of the user, wherein the contextual search interface is provided on the user computer system; an executable portion configured for displaying the search results in a search results section of the contextual search interface, wherein the search results comprise a list of the search results; an executable portion configured for displaying content in a content section of the contextual search interface, wherein the content is for at least one of the search results from the search results section, wherein the content in the content section of the contextual search interface changes when the user selects different search results from the search results section, and wherein the content section and the search results section are different sections; an executable portion configured for determining a user profile strength of the user profile based on the user profile information; an executable portion configured for determining dynamic contextual information based on the search from the user, wherein the dynamic contextual information comprises dynamic contextual questions related to each of the user profile information, the user account information, and the search from the user; an executable portion configured for displaying the dynamic contextual information and the user profile strength in a dynamic contextual information section of the contextual search interface, wherein the dynamic contextual information section is different from the search results section and the content section; an executable portion configured for receiving contextual information input from the user, wherein the contextual information input comprises at least an answer to the dynamic contextual question in the dynamic contextual information section of the contextual search interface relating to the user profile information, the user account information, and the search from the user, and wherein the contextual information input is received through the user computer system; an executable portion configured for receiving a selection of at least one of the search results from the user, wherein the selection of the at least one of the search results comprises a selection of a search result from the search results section, and wherein the selection of at least one of the search results is receive through the user computer system; an executable portion configured for determining updated search results, updated content, and updated dynamic contextual information and updated user profile strength based on the contextual information input from the user and the selection of the at least one of the search results, wherein the updated dynamic contextual information comprises at least one updated dynamic contextual question; and an executable portion configured for displaying the updated search results in the search results section, the updated content in the content section, and the updated dynamic contextual information and the updated user profile strength in the dynamic contextual information section. | 6. A computer program product for providing a contextual search tool that improves search results presented to a user, the computer program product comprising at least one non-transitory computer-readable medium having computer-readable program code portions embodied therein, the computer-readable program code portions comprising: an executable portion configured for receiving a search from the user, wherein the search is received through a user computer system; an executable portion configured for accessing user profile information from a user profile; an executable portion configured for accessing user account information, wherein the user account information is access by accessing one or more financial accounts of the user; an executable portion configured for determining the search results to display in a contextual search interface based on the search received from the user, the user profile information, and the user account information from the one or more financial accounts of the user, wherein the contextual search interface is provided on the user computer system; an executable portion configured for displaying the search results in a search results section of the contextual search interface, wherein the search results comprise a list of the search results; an executable portion configured for displaying content in a content section of the contextual search interface, wherein the content is for at least one of the search results from the search results section, wherein the content in the content section of the contextual search interface changes when the user selects different search results from the search results section, and wherein the content section and the search results section are different sections; an executable portion configured for determining a user profile strength of the user profile based on the user profile information; an executable portion configured for determining dynamic contextual information based on the search from the user, wherein the dynamic contextual information comprises dynamic contextual questions related to each of the user profile information, the user account information, and the search from the user; an executable portion configured for displaying the dynamic contextual information and the user profile strength in a dynamic contextual information section of the contextual search interface, wherein the dynamic contextual information section is different from the search results section and the content section; an executable portion configured for receiving contextual information input from the user, wherein the contextual information input comprises at least an answer to the dynamic contextual question in the dynamic contextual information section of the contextual search interface relating to the user profile information, the user account information, and the search from the user, and wherein the contextual information input is received through the user computer system; an executable portion configured for receiving a selection of at least one of the search results from the user, wherein the selection of the at least one of the search results comprises a selection of a search result from the search results section, and wherein the selection of at least one of the search results is receive through the user computer system; an executable portion configured for determining updated search results, updated content, and updated dynamic contextual information and updated user profile strength based on the contextual information input from the user and the selection of the at least one of the search results, wherein the updated dynamic contextual information comprises at least one updated dynamic contextual question; and an executable portion configured for displaying the updated search results in the search results section, the updated content in the content section, and the updated dynamic contextual information and the updated user profile strength in the dynamic contextual information section. 9. The computer program product of claim 6 , wherein the dynamic contextual information comprises a location associated with the search, and wherein the user can change the location associated with the search to a new location for the updated search, and wherein the updated search results are further based on the new location. | 0.648404 |
1. One or more computer-readable media storing computer-executable instructions that, when executed by one or more processors, instruct the one or more processors to perform acts comprising: receiving a query including a string; replacing a first portion of the string with a label of a category of relationship data to generate a modified query when the first portion of the string matches with metadata of the category of the relationship data in a predetermined order; regarding a second portion of the string as an intended word of the received query that indicates an intent of the received query and keeping the second portion of the string in the received query without replacement when the second portion of the string matches with at least one intended word in a dictionary associated with the category of the relationship data, the at least one intended word indicating a user intent; and performing a search based at least in part on the modified query. | 1. One or more computer-readable media storing computer-executable instructions that, when executed by one or more processors, instruct the one or more processors to perform acts comprising: receiving a query including a string; replacing a first portion of the string with a label of a category of relationship data to generate a modified query when the first portion of the string matches with metadata of the category of the relationship data in a predetermined order; regarding a second portion of the string as an intended word of the received query that indicates an intent of the received query and keeping the second portion of the string in the received query without replacement when the second portion of the string matches with at least one intended word in a dictionary associated with the category of the relationship data, the at least one intended word indicating a user intent; and performing a search based at least in part on the modified query. 9. The one or more computer-readable media of claim 1 , wherein the relationship data includes a relational data structure in a particular field. | 0.721297 |
13. An email generation and transmission system, comprising: an administrative server group communicatively coupled to one or more member server groups, each of the one or more member server groups including at least an application server and a replication server, each of the application server and the replication server including a processing unit and a memory coupled to the processing unit; the administrative server group programmed to allow a user to store an email template and set up a campaign query associated with the email template; the administrative server group programmed to facilitate the distribution of the email template and at least a portion of the associated campaign query to each of the application servers at each of the one or more member server groups; each of the application servers at each of the one or more member server groups programmed to replicate the email template and the at least a portion of the associated campaign query to each of the replication servers at each of the one or more member server groups; each of the replication servers at each of the one or more member server groups programmed to: run the campaign query to obtain a plurality of matching members; divide the plurality of matching users on each of the plurality of server groups into one or more batches of users; merge the email template with a set of information corresponding to each of the plurality of matching users from a first batch of users to generate a first batch of merged emails for each of the plurality of server groups; send the first batch of merged emails without saving copies of the merged emails; mark a status of what portion of the first batch of the merged emails was sent before a shutdown of at least one server in the plurality of server groups; and resume the sending of the first batch of the merged emails when the at least one server in the plurality of server groups is restarted after shutdown. | 13. An email generation and transmission system, comprising: an administrative server group communicatively coupled to one or more member server groups, each of the one or more member server groups including at least an application server and a replication server, each of the application server and the replication server including a processing unit and a memory coupled to the processing unit; the administrative server group programmed to allow a user to store an email template and set up a campaign query associated with the email template; the administrative server group programmed to facilitate the distribution of the email template and at least a portion of the associated campaign query to each of the application servers at each of the one or more member server groups; each of the application servers at each of the one or more member server groups programmed to replicate the email template and the at least a portion of the associated campaign query to each of the replication servers at each of the one or more member server groups; each of the replication servers at each of the one or more member server groups programmed to: run the campaign query to obtain a plurality of matching members; divide the plurality of matching users on each of the plurality of server groups into one or more batches of users; merge the email template with a set of information corresponding to each of the plurality of matching users from a first batch of users to generate a first batch of merged emails for each of the plurality of server groups; send the first batch of merged emails without saving copies of the merged emails; mark a status of what portion of the first batch of the merged emails was sent before a shutdown of at least one server in the plurality of server groups; and resume the sending of the first batch of the merged emails when the at least one server in the plurality of server groups is restarted after shutdown. 14. The email generation and transmission system of claim 13 , wherein each of the replication servers at each of the one or more member server groups is further programmed to merge the email template with a set of information corresponding to each of the plurality of matching users from a second batch to generate a second batch of merged emails for each of the plurality of server groups after an occurrence of at least one of a hardware failure or a software failure during the sending of the merged emails in the first batch, while the merged emails in the first batch that were not sent prior to the hardware failure or the software failure are not identified and not sent to the corresponding matching users. | 0.5 |
1. A method comprising: determining, using a processor, text subgroups within an electronic text; determining, using the processor, a relevance score for each of one or more words within each of the text subgroups; selecting, using the processor, one of the text subgroups to select a text seed; selecting, using the processor, the text seed within the selected text subgroup based on the relevance scores for the one or more words within the selected text subgroup; determining, using the processor, a similarity relationship between the selected text seed and one or more text subgroups adjacent to the selected text subgroup that do not include the selected text seed; creating, using the processor, a text cluster by associating the selected text seed with the one or more adjacent text subgroups based on the determined similarity relationship to the selected text subgroup; determining an activity indication of times when a user has user read other text subgroups within the electronic text; determining, using the processor, a similarity relationship between the text cluster and the other text subgroups; linking, using the processor, the text cluster to one of the other text subgroups based on the determined similarity relationship to the other text subgroups; and presenting at least one navigational link that links the text cluster to the one of other the text subgroups based on the times when the user read the other text subgroups. | 1. A method comprising: determining, using a processor, text subgroups within an electronic text; determining, using the processor, a relevance score for each of one or more words within each of the text subgroups; selecting, using the processor, one of the text subgroups to select a text seed; selecting, using the processor, the text seed within the selected text subgroup based on the relevance scores for the one or more words within the selected text subgroup; determining, using the processor, a similarity relationship between the selected text seed and one or more text subgroups adjacent to the selected text subgroup that do not include the selected text seed; creating, using the processor, a text cluster by associating the selected text seed with the one or more adjacent text subgroups based on the determined similarity relationship to the selected text subgroup; determining an activity indication of times when a user has user read other text subgroups within the electronic text; determining, using the processor, a similarity relationship between the text cluster and the other text subgroups; linking, using the processor, the text cluster to one of the other text subgroups based on the determined similarity relationship to the other text subgroups; and presenting at least one navigational link that links the text cluster to the one of other the text subgroups based on the times when the user read the other text subgroups. 11. The method of claim 1 , further comprising storing a navigational aid in metadata of the electronic text that indicates linkage of the text cluster with the other one of the text subgroups. | 0.63579 |
2. The method of claim 1 , wherein confirming that the potential call recipient is the intended call recipient using the personal recording made by the potential call recipient further comprises prompting the caller using a personal recording in which the potential call recipient states his or her name. | 2. The method of claim 1 , wherein confirming that the potential call recipient is the intended call recipient using the personal recording made by the potential call recipient further comprises prompting the caller using a personal recording in which the potential call recipient states his or her name. 6. The method of claim 2 , and before the step of confirming that the potential call recipient is the intended call recipient using the personal recording made by the potential call recipient, further comprising the step of determining whether a personal recording from the potential call recipient is available for use. | 0.874908 |
13. A system, comprising: a data store storing a query log that includes a set of previous search tokens from previous queries that were received during a current search session; and data processing apparatus including one or more processors configured to interact with the data store and to perform actions including: receiving a current search query associated with the current search session, the current search query including one or more current search tokens; comparing the one or more current search tokens to the set of previous search tokens; identifying, as a potentially inaccurate search token in the current search query, a current search token that is not included in the set of previous search tokens; identifying related tokens from the query log based upon the set of previous search queries associated with the current search session; comparing the potentially inaccurate search token to the related tokens to determine whether the potentially inaccurate search token is included in the related tokens; in response to determining that the potentially inaccurate search token is not included in the related tokens, identifying a replacement token from the related tokens; wherein the replacement token is a token with which the potentially inaccurate search token was previously replaced with at least a minimum specified rate; and substituting the potentially inaccurate search token in the current search query with the replacement token. | 13. A system, comprising: a data store storing a query log that includes a set of previous search tokens from previous queries that were received during a current search session; and data processing apparatus including one or more processors configured to interact with the data store and to perform actions including: receiving a current search query associated with the current search session, the current search query including one or more current search tokens; comparing the one or more current search tokens to the set of previous search tokens; identifying, as a potentially inaccurate search token in the current search query, a current search token that is not included in the set of previous search tokens; identifying related tokens from the query log based upon the set of previous search queries associated with the current search session; comparing the potentially inaccurate search token to the related tokens to determine whether the potentially inaccurate search token is included in the related tokens; in response to determining that the potentially inaccurate search token is not included in the related tokens, identifying a replacement token from the related tokens; wherein the replacement token is a token with which the potentially inaccurate search token was previously replaced with at least a minimum specified rate; and substituting the potentially inaccurate search token in the current search query with the replacement token. 14. The system of claim 13 , wherein the one or more processors are further configured to identify the related tokens by performing actions including: analyzing historical search queries from historical search sessions; identifying a token cluster from tokens included in the historical search queries, wherein each identified token cluster includes one or more previous search tokens from the set of previous search tokens; and identifying related tokens from the token clusters, the related tokens being other tokens that are included the token clusters in addition to the one or more previous search tokens. | 0.518045 |
17. A computer program product comprising: a non-transitory computer readable medium; a first program instruction for obtaining a proof of a property with respect to a bounded model having a bounded number of cycles, wherein the bounded model comprising an initial axiom and a transition relation axiom, wherein the proof of the property is a Directed Acyclic Graph (DAG), wherein each non-leaf node of the DAG is deducible from its child nodes, wherein a root of the DAG is the property, and wherein leaves of the DAG are associated with an axiom of the bounded model; a second program instruction for selecting a set of candidate invariants comprising at least one intermediate node of the DAG; a third program instruction for determining, without using the proof and using a Boolean satisfiability problem solver, a subset of the set of candidates, wherein the subset comprises invariants which are held in an unbounded model during each cycle after the bound, wherein the unbounded model is an unbounded version of the bounded model; and wherein said first, second, and third program instructions are stored on said non-transitory computer readable medium. | 17. A computer program product comprising: a non-transitory computer readable medium; a first program instruction for obtaining a proof of a property with respect to a bounded model having a bounded number of cycles, wherein the bounded model comprising an initial axiom and a transition relation axiom, wherein the proof of the property is a Directed Acyclic Graph (DAG), wherein each non-leaf node of the DAG is deducible from its child nodes, wherein a root of the DAG is the property, and wherein leaves of the DAG are associated with an axiom of the bounded model; a second program instruction for selecting a set of candidate invariants comprising at least one intermediate node of the DAG; a third program instruction for determining, without using the proof and using a Boolean satisfiability problem solver, a subset of the set of candidates, wherein the subset comprises invariants which are held in an unbounded model during each cycle after the bound, wherein the unbounded model is an unbounded version of the bounded model; and wherein said first, second, and third program instructions are stored on said non-transitory computer readable medium. 18. The computer program product of claim 17 , further comprising: a fourth program instruction for utilizing the subset for model checking of the unbounded model; and wherein said fourth program instruction is stored on said non-transitory computer readable medium. | 0.658187 |
10. A computer implemented method that simulates conversation with a human user, comprising: receiving media and converting the media into a system-specific format; comparing the converted media to a vocabulary and generating a plurality of intents and a plurality of sub-entities; and transforming the plurality of intents and the plurality of sub-entities into a pre-defined format and routing the plurality of intents and the plurality of sub-entities via a controller to a first selected knowledge engine and a second knowledge engine; and identifying the human user's generation from converted media through an exchange engine in communication with the controller; where the first selected knowledge engine selects the second knowledge engine and each active grammar in the vocabulary uniquely identifies each of the plurality of knowledge engines; transmitting a plurality of words or a phrase to a user display device in response. | 10. A computer implemented method that simulates conversation with a human user, comprising: receiving media and converting the media into a system-specific format; comparing the converted media to a vocabulary and generating a plurality of intents and a plurality of sub-entities; and transforming the plurality of intents and the plurality of sub-entities into a pre-defined format and routing the plurality of intents and the plurality of sub-entities via a controller to a first selected knowledge engine and a second knowledge engine; and identifying the human user's generation from converted media through an exchange engine in communication with the controller; where the first selected knowledge engine selects the second knowledge engine and each active grammar in the vocabulary uniquely identifies each of the plurality of knowledge engines; transmitting a plurality of words or a phrase to a user display device in response. 13. The computer implemented method of claim 10 where the active grammars comprise a plurality of words or phrases to be recognized. | 0.597761 |
5. The method of claim 4 , wherein the method comprises identifying one or more communication threads of the communication data. | 5. The method of claim 4 , wherein the method comprises identifying one or more communication threads of the communication data. 6. The method of claim 5 , wherein each communication thread includes two or more pieces of the communication data that are related, regardless of the source, by having similar information in one or more of the common fields. | 0.91374 |
15. The method of claim 1 in which a user is enabled to select at least one machine automated model development process applied to the entire set of historical data for a validated model process. | 15. The method of claim 1 in which a user is enabled to select at least one machine automated model development process applied to the entire set of historical data for a validated model process. 16. The method of claim 15 in which the user is enabled to point and click to cause display of information about the performance of the validated model process applied to the entire set of historical data. | 0.937017 |
3. The method according to claim 2 , further comprising: changing a state of the first user interface mechanism in response to the activation of the first user interface mechanism; changing a state of the second user interface mechanism in response to the activation of the first user interface mechanism; changing the state of the first user interface mechanism in response to the activation of the second user interface mechanism; changing the state of the second user interface mechanism in response to the activation of the second user interface mechanism. | 3. The method according to claim 2 , further comprising: changing a state of the first user interface mechanism in response to the activation of the first user interface mechanism; changing a state of the second user interface mechanism in response to the activation of the first user interface mechanism; changing the state of the first user interface mechanism in response to the activation of the second user interface mechanism; changing the state of the second user interface mechanism in response to the activation of the second user interface mechanism. 4. The method according to claim 3 , wherein changing the state of the first user interface mechanism in response to the activation of the first user interface mechanism comprises changing the state of the first user interface mechanism to a state in which the first user interface mechanism cannot be activated; wherein changing the state of the second user interface mechanism in response to the activation of the first user interface mechanism comprises changing the state of the second user interface mechanism to a state in which the second user interface mechanism can be activated; wherein changing the state of the first user interface mechanism in response to the activation of the second user interface mechanism comprises changing the state of the first user interface mechanism to a state in which the first user interface mechanism can be activated; wherein changing the state of the second user interface mechanism in response to the activation of the second user interface mechanism comprises changing the state of the second user interface mechanism to a state in which the second user interface mechanism can be activated. | 0.50732 |
9. A method for personalizing a recorded audio message, comprising the steps of: storing a plurality of personal greeting root name segment data representing audible greetings in a storage area in a predetermined order; assigning a unique index number to each personal greeting root name segment of said plurality of personal greeting root name segment data; acquiring a call recipient name from a call list; matching said call recipient name to an identical name in a match table to acquire a unique index number corresponding to said call recipient name, said match table capable of containing a plurality of said call recipient names mapping to said unique index number and therefore mapping said call recipient name to a personal greeting root name segment corresponding to said unique index number; recalling a personal greeting root name segment from said storage area using said unique index number; and combining said personal greeting root name segment with a stored message body to form a personalized message. | 9. A method for personalizing a recorded audio message, comprising the steps of: storing a plurality of personal greeting root name segment data representing audible greetings in a storage area in a predetermined order; assigning a unique index number to each personal greeting root name segment of said plurality of personal greeting root name segment data; acquiring a call recipient name from a call list; matching said call recipient name to an identical name in a match table to acquire a unique index number corresponding to said call recipient name, said match table capable of containing a plurality of said call recipient names mapping to said unique index number and therefore mapping said call recipient name to a personal greeting root name segment corresponding to said unique index number; recalling a personal greeting root name segment from said storage area using said unique index number; and combining said personal greeting root name segment with a stored message body to form a personalized message. 10. The method of claim 9, wherein said call recipient name is a first name. | 0.609642 |
10. A program product stored on a non-transitory computer readable storage medium, the program product operative to automatically create a target sample plan for optical proximity correction (OPC) calibration with a minimal number of clips when executed, the non-transitory computer readable storage medium comprising program code for: defining a sample plan including a plurality of clips, each of the plurality of clips representing portions of an integrated circuit (IC) layout; calculating a total relevancy score of a projected sample plan for the IC layout, wherein the projected sample plan includes a candidate clip representing an additional portion of the IC layout, and wherein the relevancy score is derived from at least one relevancy criterion and a relevancy weight for the at least one relevancy criterion, the at least one relevancy criterion being one of a topology type of a clip, a printing difficulty of a clip, and a dimensional ratio between clips in the projected sample plan; calculating a relevancy score difference between the total relevancy score of the projected sample plan and a total relevancy score of the sample plan without the candidate clip; adding the candidate clip to the sample plan for the IC layout and removing the candidate clip from the plurality of clips in response to the relevancy score difference substantially fitting a non-linear relevancy score function removing the candidate clip from the plurality of clips without adding the clip to the sample plan for the IC layout in response to the relevancy score difference substantially fitting a linear relevancy score function, wherein the candidate clip not being added to the sample plan indicates that the sample plan includes the minimal number of clips; and generating an OPC model using the sample plan with the minimal number of clips, wherein the sample plan with the minimal number of clips represents the target sample plan, and wherein the OPC model is used to manufacture at least one IC. | 10. A program product stored on a non-transitory computer readable storage medium, the program product operative to automatically create a target sample plan for optical proximity correction (OPC) calibration with a minimal number of clips when executed, the non-transitory computer readable storage medium comprising program code for: defining a sample plan including a plurality of clips, each of the plurality of clips representing portions of an integrated circuit (IC) layout; calculating a total relevancy score of a projected sample plan for the IC layout, wherein the projected sample plan includes a candidate clip representing an additional portion of the IC layout, and wherein the relevancy score is derived from at least one relevancy criterion and a relevancy weight for the at least one relevancy criterion, the at least one relevancy criterion being one of a topology type of a clip, a printing difficulty of a clip, and a dimensional ratio between clips in the projected sample plan; calculating a relevancy score difference between the total relevancy score of the projected sample plan and a total relevancy score of the sample plan without the candidate clip; adding the candidate clip to the sample plan for the IC layout and removing the candidate clip from the plurality of clips in response to the relevancy score difference substantially fitting a non-linear relevancy score function removing the candidate clip from the plurality of clips without adding the clip to the sample plan for the IC layout in response to the relevancy score difference substantially fitting a linear relevancy score function, wherein the candidate clip not being added to the sample plan indicates that the sample plan includes the minimal number of clips; and generating an OPC model using the sample plan with the minimal number of clips, wherein the sample plan with the minimal number of clips represents the target sample plan, and wherein the OPC model is used to manufacture at least one IC. 14. The program product of claim 10 , wherein in the case that the at least one relevancy criterion includes the printing difficulty, the plurality of clips includes a highest printing difficulty clip and a lowest printing difficulty clip, and the printing difficulty is calculated based on a critical dimension or a layout lithography difficulty estimator (LDE) of the clip. | 0.52954 |
1. A system for searching for content, the system comprising: a hardware processor that is configured to: receive a media search query for one or more media assets; identify a plurality of web search results from a corpus of web resources that are responsive to the media search query, wherein each of the web search results has an associated relevancy score; determine keyword information and contextual information from a subset of the web search results, wherein the subset of the web search results is selected from the plurality of web search results based on the associated relevancy score and wherein a plurality of media entities are determined from at least a portion of the keyword information and the contextual information; assign a topic score for the each of the plurality of media entities based on occurrence in the web search results; select at least one media entity from the plurality of media entities based on the topic score; identify a plurality of media assets from a corpus of media assets based at least in part on the selected media entity; and cause a subset of the plurality of media assets to be presented to a user in response to the media search query. | 1. A system for searching for content, the system comprising: a hardware processor that is configured to: receive a media search query for one or more media assets; identify a plurality of web search results from a corpus of web resources that are responsive to the media search query, wherein each of the web search results has an associated relevancy score; determine keyword information and contextual information from a subset of the web search results, wherein the subset of the web search results is selected from the plurality of web search results based on the associated relevancy score and wherein a plurality of media entities are determined from at least a portion of the keyword information and the contextual information; assign a topic score for the each of the plurality of media entities based on occurrence in the web search results; select at least one media entity from the plurality of media entities based on the topic score; identify a plurality of media assets from a corpus of media assets based at least in part on the selected media entity; and cause a subset of the plurality of media assets to be presented to a user in response to the media search query. 2. The system of claim 1 , wherein the hardware processor is further configured to rewrite the media search query by inserting one or more media terms prior to identifying the plurality of web search results from the corpus of web resources. | 0.797997 |
1. A method comprising: establishing multiple sessions with a database system, each session associated with at least one transaction; identifying transactions that operate on the same set of one or more tuples; re-allocating transactions between or among the sessions such that the identified transactions that operate on the same set of one or more tuples are allocated to one of the sessions; identifying statements in a particular one of the transactions that specify modification operations that are commutative and associative; combining the identified statements into one statement; and submitting the one statement to the database system. | 1. A method comprising: establishing multiple sessions with a database system, each session associated with at least one transaction; identifying transactions that operate on the same set of one or more tuples; re-allocating transactions between or among the sessions such that the identified transactions that operate on the same set of one or more tuples are allocated to one of the sessions; identifying statements in a particular one of the transactions that specify modification operations that are commutative and associative; combining the identified statements into one statement; and submitting the one statement to the database system. 6. The method of claim 1 , wherein establishing the multiple sessions, identifying the transactions, re-allocating the transactions, identifying the statements, combining the identified statements, and submitting the one statement are performed by a module separate from a database engine of the database system. | 0.577543 |
9. The system of claim 1 , wherein iteratively computing a respective final score for each entity comprises: iteratively computing new score values x t+1 and y t+1 according to: x t + 1 ( i ) = alpha × ( ∑ j ∈ N ( i ) ( W ( i , j ) ∑ k ∈ N ( j ) W ( k , j ) × y t ( j ) ) ) + x 0 ( i ) and y t + 1 ( j ) = beta × ( ∑ i ∈ N ( j ) ( W ( i , j ) ∑ k ∈ N ( i ) W ( i , k ) × x t ( i ) ) ) + y 0 ( j ) ; wherein: x t+1 (i) represents a score for a first entity i at a t+1 th iterative step; y t+1 (j) represents a score for a second entity j at a t+1 th iterative step; alpha and beta are propagation constants; N(p) represents a set of all nodes in the bipartite graph that share an edge with a vertex p; W(s,t) represents an aggregate weight of the edge in the bipartite graph between nodes s and t; x 0 (i) represents an initial score for the first entity i; and y 0 (j) represents an initial score for the second entity j. | 9. The system of claim 1 , wherein iteratively computing a respective final score for each entity comprises: iteratively computing new score values x t+1 and y t+1 according to: x t + 1 ( i ) = alpha × ( ∑ j ∈ N ( i ) ( W ( i , j ) ∑ k ∈ N ( j ) W ( k , j ) × y t ( j ) ) ) + x 0 ( i ) and y t + 1 ( j ) = beta × ( ∑ i ∈ N ( j ) ( W ( i , j ) ∑ k ∈ N ( i ) W ( i , k ) × x t ( i ) ) ) + y 0 ( j ) ; wherein: x t+1 (i) represents a score for a first entity i at a t+1 th iterative step; y t+1 (j) represents a score for a second entity j at a t+1 th iterative step; alpha and beta are propagation constants; N(p) represents a set of all nodes in the bipartite graph that share an edge with a vertex p; W(s,t) represents an aggregate weight of the edge in the bipartite graph between nodes s and t; x 0 (i) represents an initial score for the first entity i; and y 0 (j) represents an initial score for the second entity j. 11. The system of claim 9 , the operations further comprising: precomputing U ( i , j ) = W ( i , j ) ∑ k ∈ N ( i ) W ( i , k ) and V ( j , i ) = W ( i , j ) ∑ k ∈ N ( j ) W ( k , j ) ; distributing U(i,j) and V(j,i) on multiple worker nodes, wherein the multiple worker nodes are partitioned by i values for U(i,j) and by j values for V(j,i); and iteratively computing new score values x t+1 and y t+1 according to:
x t+1 ( i )=alpha×(Σ j∈N(i) V ( j,i )× y t ( j ))+ x 0 ( i ) and
y t+1 ( j )=beta×(Σ i∈N(j) U ( i,j )× x t ( i ))+ y 0 ( j ). | 0.804186 |
1. A method for characterizing a set of documents, comprising: identifying a network of multilevel hierarchically related documents having direct and indirect references associated with content relationships; for each respective document, determining a set of latent topic characteristics captured by a Bernoulli process, based on at least both an intrinsic content of the respective document and a set of latent topic characteristics based on a respective content of other documents which are directly referenced and indirectly referenced through at least one other document to the respective document, such that a topic distribution of each respective document is a mixture of distributions associated with at least the at least one other document; representing a set of latent topics for the respective document based on a joint probability distribution of at least the latent topic characteristics based on the intrinsic content and the respective content of other documents which are directly referenced and indirectly referenced through at least one other document to the respective document, dependent on the identified network and a random process; and storing, in a memory, the represented set of latent topics for the respective document. | 1. A method for characterizing a set of documents, comprising: identifying a network of multilevel hierarchically related documents having direct and indirect references associated with content relationships; for each respective document, determining a set of latent topic characteristics captured by a Bernoulli process, based on at least both an intrinsic content of the respective document and a set of latent topic characteristics based on a respective content of other documents which are directly referenced and indirectly referenced through at least one other document to the respective document, such that a topic distribution of each respective document is a mixture of distributions associated with at least the at least one other document; representing a set of latent topics for the respective document based on a joint probability distribution of at least the latent topic characteristics based on the intrinsic content and the respective content of other documents which are directly referenced and indirectly referenced through at least one other document to the respective document, dependent on the identified network and a random process; and storing, in a memory, the represented set of latent topics for the respective document. 5. The method according to claim 1 , wherein the iterative process at a reference level comprises iterating, for each document d j , for the i-th location in document d j , choosing a topic z ji from the topic distribution of document d j , p(z|d j ,θ d j ), where the distribution parameter θ d j is drawn from a Dirichlet distribution Dir(α), choosing a word w ji which follows the multinomial distribution p(w|z ji ,Λ) conditioned on the topic z ji , and incrementing the locations and documents, wherein the iterative process at a document level comprises iterating, for each document d s , for the i-th location in document d s , choosing a referenced document c si from p(c|d s ,Ξ), a multinomial distribution conditioned on the document d s , choosing a topic t si from the topic distribution of the document c si at the reference level, and choosing a word w si which follows the multinomial distribution p(w|t si ,Λ) conditioned on the topic t si , where Ξ is a mixing coefficient matrix which represents how much of the content of the respective document is from direct or indirect references, and a composition of Ξ and θ models the topic distribution at the document level, and incrementing the locations and documents, wherein a number of latent topics is K and the mixing coefficients are parameterized by an N×N matrix Ξ where Ξ js =p(c si =d j |d s ), which are treated as a fixed quantity computed from the reference information of the set of documents, wherein topic distributions at the reference level are parameterized by a K×N matrix Θ where Θ lj =p(z ji =l|d j ), which is to be estimated, and an M×K word probability matrix Λ, where Λ hl =p(w si h =1|t si =l), which is to be estimated, and wherein the references comprise citations, each document d s having a set of citations Q d s , further comprising constructing a matrix S to denote direct relationships among the documents wherein S ls = 1 Q d s for d l εQ d s and 0 otherwise, where |Q d s | denotes the size of the set Q d s , and employing a generative process for generating a related document c from the respective document d s , comprising: setting l=s; choosing t˜Bernoulli(β); if t=1, choosing h˜Multinomial(S .,l ), where S .,l denotes the l-th column; setting l=h, and returning to said choosing step; and if t=0, letting c=d l , to thereby combine a Bernoulli process and a random walk on a directed graph together, where a transitive property of the citations is captured, wherein the parameter β of the Bernoulli process determines a probability that the random walk stops at a current node, and the parameter β also specifies how much of the content of the respective document is influenced from the direct or indirect citations. | 0.5 |
29. The method of claim 27 , wherein the process is related to at least one of a web service and a business process. | 29. The method of claim 27 , wherein the process is related to at least one of a web service and a business process. 30. The method of claim 29 , wherein the plan script is executed in conjunction with a process script that is executed in connection with the process, the process script including a set of atomic process activities and corresponding order constraints of the atomic process activities, the set of atomic process activities being sub-activities of the process. | 0.890436 |
1. A method, comprising: receiving an input to a body of an electronic markup language document that is being displayed in a window; and in response to said receiving: generating a comment based on or including the input; storing the comment in a comment section of a data structure for the electronic document, wherein said storing comprises formatting the comment using a tag to identify the comment, wherein the comment section of the data structure is separate from a body section of the data structure, wherein the body section of the data structure includes content for the body of the electronic markup language document; and displaying the body of the electronic markup language document and an action user interface element in the window, wherein the action user interface element can be activated to perform an action in regard to at least part of the comment stored in the comment section of the data structure, wherein the action includes one or more of view, accept, reject, modify, delete, insert, or replace. | 1. A method, comprising: receiving an input to a body of an electronic markup language document that is being displayed in a window; and in response to said receiving: generating a comment based on or including the input; storing the comment in a comment section of a data structure for the electronic document, wherein said storing comprises formatting the comment using a tag to identify the comment, wherein the comment section of the data structure is separate from a body section of the data structure, wherein the body section of the data structure includes content for the body of the electronic markup language document; and displaying the body of the electronic markup language document and an action user interface element in the window, wherein the action user interface element can be activated to perform an action in regard to at least part of the comment stored in the comment section of the data structure, wherein the action includes one or more of view, accept, reject, modify, delete, insert, or replace. 5. The method of claim 1 , wherein the action user interface element is generated using a scripting language. | 0.617351 |
15. A system for building an n-gram classifier trained for analysis of social media content items, comprising: a media data store, the media data store storing training media items gathered from a social media source, wherein at least some of the training media items are associated with a language identifier indicating a language the media item is in, wherein each language identifier that indicates the language the media item is in is assigned based on one or more of: a language model, associated with a user who created the media item, indicating that the user who created the media item is mono-linguistic; or a common language identified by both a first language model associated with the user who created the media item and by a second language model associated with a user who received the media item; and a training classifier generation component configured to generate, for multiple selected n-grams from the training media items, a corresponding probability distribution that a particular media item is in a particular language given that the n-gram is in the particular media item; wherein at least one probability distribution corresponding to one of the multiple selected n-arams is based on an analysis of a frequency with which that n-aram occurs in a subset of the training media items having the same language identifier. | 15. A system for building an n-gram classifier trained for analysis of social media content items, comprising: a media data store, the media data store storing training media items gathered from a social media source, wherein at least some of the training media items are associated with a language identifier indicating a language the media item is in, wherein each language identifier that indicates the language the media item is in is assigned based on one or more of: a language model, associated with a user who created the media item, indicating that the user who created the media item is mono-linguistic; or a common language identified by both a first language model associated with the user who created the media item and by a second language model associated with a user who received the media item; and a training classifier generation component configured to generate, for multiple selected n-grams from the training media items, a corresponding probability distribution that a particular media item is in a particular language given that the n-gram is in the particular media item; wherein at least one probability distribution corresponding to one of the multiple selected n-arams is based on an analysis of a frequency with which that n-aram occurs in a subset of the training media items having the same language identifier. 16. The system of claim 15 , wherein each of the multiple selected n-grams has a length of four or five characters. | 0.831841 |
16. A database interfacing-processor-implemented method, comprising: generating a plurality of inter-linked table objects in a database, wherein each inter-linked table object contains a table object identifier and an additional business grammar information related to the table object, wherein said inter-linked table objects are interconnected based on business grammar rules for the plurality of data and application identifying items in at least one database; receiving an input string having a plurality of syntax tokens arranged in accordance with a syntax grammar format and following business grammar rules for the arrangement of a plurality of data and application identifying items in at least one database, wherein each of said plurality of syntax tokens in the input string relates to at least one of a plurality of inter-linked table objects in a database, each inter-linked table object containing a table object identifier and an additional business grammar information related to said table object; determining whether a dynamic or static string token parsing of the input string should be utilized; determining syntax grammar format based on the context in which the input string was received and whether the dynamic or static token parsing is required; parsing the input string for each syntax token based on the syntax grammar; generating a database selection command from a composite of the parsed syntax tokens and business grammar information; querying the database with the selection command; retrieving grammar responsive data based on the querying; and providing the grammar responsive data to at least one receiving application. | 16. A database interfacing-processor-implemented method, comprising: generating a plurality of inter-linked table objects in a database, wherein each inter-linked table object contains a table object identifier and an additional business grammar information related to the table object, wherein said inter-linked table objects are interconnected based on business grammar rules for the plurality of data and application identifying items in at least one database; receiving an input string having a plurality of syntax tokens arranged in accordance with a syntax grammar format and following business grammar rules for the arrangement of a plurality of data and application identifying items in at least one database, wherein each of said plurality of syntax tokens in the input string relates to at least one of a plurality of inter-linked table objects in a database, each inter-linked table object containing a table object identifier and an additional business grammar information related to said table object; determining whether a dynamic or static string token parsing of the input string should be utilized; determining syntax grammar format based on the context in which the input string was received and whether the dynamic or static token parsing is required; parsing the input string for each syntax token based on the syntax grammar; generating a database selection command from a composite of the parsed syntax tokens and business grammar information; querying the database with the selection command; retrieving grammar responsive data based on the querying; and providing the grammar responsive data to at least one receiving application. 17. The method of claim 16 , wherein the input string is received from the at least one receiving application. | 0.537109 |
2. A computer program product comprising a computer-readable storage medium having computer-readable program code instructions stored therein comprising: a first set of instructions for receiving a request with respect to at least one resource in a cloud, wherein the received request is in the form of a service level agreement; a second set of instructions for determining a set of resources among the at least one resource in the cloud in accordance with the received request, wherein the second set of instructions comprises: a third set of instructions for consulting an ontology including metadata associated with the at least one resource in the cloud, wherein consulting the ontology comprises comparing terms in the service level agreement with terms describing the at least one resource in the cloud; and a fourth set of instructions for computing the set of resources based on the metadata and the received request, wherein computing the set of resources comprises evaluating relationships among the at least one resource in the cloud; a fifth set of instructions for computing a cost factor with respect to the determined set of resources; and a sixth set of instructions for rendering the determined set of resources and the cost factor with respect to the determined set of resources. | 2. A computer program product comprising a computer-readable storage medium having computer-readable program code instructions stored therein comprising: a first set of instructions for receiving a request with respect to at least one resource in a cloud, wherein the received request is in the form of a service level agreement; a second set of instructions for determining a set of resources among the at least one resource in the cloud in accordance with the received request, wherein the second set of instructions comprises: a third set of instructions for consulting an ontology including metadata associated with the at least one resource in the cloud, wherein consulting the ontology comprises comparing terms in the service level agreement with terms describing the at least one resource in the cloud; and a fourth set of instructions for computing the set of resources based on the metadata and the received request, wherein computing the set of resources comprises evaluating relationships among the at least one resource in the cloud; a fifth set of instructions for computing a cost factor with respect to the determined set of resources; and a sixth set of instructions for rendering the determined set of resources and the cost factor with respect to the determined set of resources. 9. The computer program product of claim 2 , wherein the ontology is stored in a repository, and wherein the metadata includes definition information and instance information. | 0.550819 |
23. A non-transitory computer-readable storage medium storing instructions for enabling a computer to implement a method for testing a computer system, the method comprising: receiving, at the computer, a representation of a graphical user interface of the remote system; and controlling, at the computer, a flow of execution based on a testing script, the flow of execution including: searching the received representation of the remote system graphical user interface for a graphical element based on an image analysis; and responsive to a result of searching the received representation of the remote system graphical user interface for the graphical element, automatically providing a signal through a communications channel to execute an emulated user input action on the remote system graphical user interface, wherein the input action is specified by a specific script command in the testing script. | 23. A non-transitory computer-readable storage medium storing instructions for enabling a computer to implement a method for testing a computer system, the method comprising: receiving, at the computer, a representation of a graphical user interface of the remote system; and controlling, at the computer, a flow of execution based on a testing script, the flow of execution including: searching the received representation of the remote system graphical user interface for a graphical element based on an image analysis; and responsive to a result of searching the received representation of the remote system graphical user interface for the graphical element, automatically providing a signal through a communications channel to execute an emulated user input action on the remote system graphical user interface, wherein the input action is specified by a specific script command in the testing script. 30. The non-transitory computer-readable storage medium of claim 23 , wherein the method further includes: automatically providing, by the computer, as the signal, a first signal to execute an input action at the remote system, in response to a detected presence of the graphical element in the received representation of the remote system graphical user interface during the search. | 0.573748 |
18. The method of claim 16 , wherein the text data comprises a device delta language model trained on the text input by the user and incorporating the text data into one or more language models comprises merging the device delta language model into the one or more language models. | 18. The method of claim 16 , wherein the text data comprises a device delta language model trained on the text input by the user and incorporating the text data into one or more language models comprises merging the device delta language model into the one or more language models. 19. The method of claim 18 , wherein the one or more language models comprises a data structure associating sequences of terms with a frequency of occurrence for each sequence, and merging a first language model with a second language model comprises: adding the frequencies of occurrence for sequences in the data structure of the second language model to the frequencies of occurrence for corresponding sequences in the data structure of the first language model; and inserting a new sequence and its corresponding frequency of occurrence into the data structure of the first language model, if that sequence is in the data structure of the second language model but not in the data structure of the first language model. | 0.659014 |
1. A method for processing medical information, comprising the steps of: obtaining a medical record of a patient, wherein the medical record comprises patient information from structured and unstructured data sources; analyzing with a computer the patient information from at least the unstructured data source in the medical record using domain-specific criteria; and automatically extracting billing information from the medical record as part of the analysis. | 1. A method for processing medical information, comprising the steps of: obtaining a medical record of a patient, wherein the medical record comprises patient information from structured and unstructured data sources; analyzing with a computer the patient information from at least the unstructured data source in the medical record using domain-specific criteria; and automatically extracting billing information from the medical record as part of the analysis. 5. The method of claim 1 , wherein extracting billing information comprises extracting all billing codes that are supported by the patient information based on all domain-specific criteria in a domain knowledge base. | 0.630859 |
1. A machine-implemented method comprising: receiving a query from a user; based on the query, determining one or more potential intents of the user; based on the query, determining a plurality of matching resources that includes a first matching resource and a second matching resource that is different than the first matching resource; for the first matching resource of the plurality of matching resources, selecting, based on the one or more potential intents, a first abstract template from a plurality of abstract templates; for the second matching resource of the plurality of matching resources, selecting, based on the one or more potential intents, a second abstract template from the plurality of abstract templates; wherein each abstract template of the plurality of abstract templates: (a) corresponds to a different intent than any other intent to which any other abstract template of the plurality of abstract templates corresponds, and (b) dictates a different manner of displaying information about a resource than any other manner of displaying dictated by any other abstract template of the plurality of abstract templates; and generating a search results page that includes: for the first matching resource, a first abstract that is displayed based on the first abstract template, and for the second matching resource, a second abstract that is displayed based on the second abstract template; wherein the method is performed by one or more computing devices. | 1. A machine-implemented method comprising: receiving a query from a user; based on the query, determining one or more potential intents of the user; based on the query, determining a plurality of matching resources that includes a first matching resource and a second matching resource that is different than the first matching resource; for the first matching resource of the plurality of matching resources, selecting, based on the one or more potential intents, a first abstract template from a plurality of abstract templates; for the second matching resource of the plurality of matching resources, selecting, based on the one or more potential intents, a second abstract template from the plurality of abstract templates; wherein each abstract template of the plurality of abstract templates: (a) corresponds to a different intent than any other intent to which any other abstract template of the plurality of abstract templates corresponds, and (b) dictates a different manner of displaying information about a resource than any other manner of displaying dictated by any other abstract template of the plurality of abstract templates; and generating a search results page that includes: for the first matching resource, a first abstract that is displayed based on the first abstract template, and for the second matching resource, a second abstract that is displayed based on the second abstract template; wherein the method is performed by one or more computing devices. 21. The method of claim 1 , wherein: each abstract template of the plurality of abstract templates dictates a different manner of displaying information extracted from a resource than any other manner of displaying dictated by any other abstract template of the plurality of abstract templates; and information extracted from the first matching resource is Resource Description Framework (RDF) information extracted from the first matching resource. | 0.634542 |
6. The method as claimed in claim 3 , wherein the bands or blocks are frequency bands of the frequency spectrum of the respective frame of the unidentified information signal. | 6. The method as claimed in claim 3 , wherein the bands or blocks are frequency bands of the frequency spectrum of the respective frame of the unidentified information signal. 8. The method as claimed in claim 6 , wherein said property is the energy of a frequency band. | 0.975691 |
2. The computer-readable medium of claim 1 in which the application comprises zero or more markup components and zero or more script components. | 2. The computer-readable medium of claim 1 in which the application comprises zero or more markup components and zero or more script components. 7. The computer-readable medium of claim 2 in which the analyzing is performed by watching data, the data being selected from at least one of number of elements in the markup, number of attributes, values of attributes, length of attributes, inefficient XPath expression construction, number of cues to be evaluated at each clock tick, size of the markup, compliancy of included resources to applicable specification, or projected pixel buffer usage. | 0.855617 |
1. A method for electronically searching a user-personalized library of content, comprising: (a) receiving one or more search terms from a user having an electronically-searchable personalized library of content, the personalized library including a text searchable database and a page image database; (b) electronically searching the text searchable database for pages of content that match the search terms to produce search results; (c) providing the search results to the user; (d) receiving a search result selection from the user; (e) preparing a substitute image of a page image in the page image database corresponding to the search result selection from the user, wherein a portion of the content in the page image is suppressed in the substitute image in accordance with one or more access rules to limit the amount of content in the substitute image; (f) providing location information to the user that identifies the location of the search terms in the substitute image; and (g) providing to the user the substitute image responsive to the user's search result selection such that a portion of the content in the page image is suppressed in the substitute image provided to the user with an instruction to highlight the search terms in the substitute image, wherein the instruction to highlight the search terms in the substitute image comprises an instruction to apply a layer of color on or near the search terms. | 1. A method for electronically searching a user-personalized library of content, comprising: (a) receiving one or more search terms from a user having an electronically-searchable personalized library of content, the personalized library including a text searchable database and a page image database; (b) electronically searching the text searchable database for pages of content that match the search terms to produce search results; (c) providing the search results to the user; (d) receiving a search result selection from the user; (e) preparing a substitute image of a page image in the page image database corresponding to the search result selection from the user, wherein a portion of the content in the page image is suppressed in the substitute image in accordance with one or more access rules to limit the amount of content in the substitute image; (f) providing location information to the user that identifies the location of the search terms in the substitute image; and (g) providing to the user the substitute image responsive to the user's search result selection such that a portion of the content in the page image is suppressed in the substitute image provided to the user with an instruction to highlight the search terms in the substitute image, wherein the instruction to highlight the search terms in the substitute image comprises an instruction to apply a layer of color on or near the search terms. 13. The method of claim 1 , in which the access rules define an aggregate amount of unsuppressed content that can be provided to the user over a time frame. | 0.645106 |
1. A method for executing database queries, comprising: receiving a database query for execution by a database system, the database system configured to process database queries using a first processing unit including one or more central processing units (CPUs) and a second processing unit including one or more single instruction multiple thread (SIMT) based processing units; generating, by the database system, an intermediate executable representation including code for processing the database query, the processing performed by executing operators representing portions of computations for processing the database query; selecting, by the database system, a target processing unit for executing an operator of the database query based on factors comprising a data type of values stored in a column processed by the query; responsive to selection of the second processing unit for executing the operator of the database query: generating native code from the intermediate executable representation, wherein the native code is optimized for execution on the second processing unit; compiling the native code to executable code; and executing the executable code by the database system using the second processing unit; and sending the result of execution of the query. | 1. A method for executing database queries, comprising: receiving a database query for execution by a database system, the database system configured to process database queries using a first processing unit including one or more central processing units (CPUs) and a second processing unit including one or more single instruction multiple thread (SIMT) based processing units; generating, by the database system, an intermediate executable representation including code for processing the database query, the processing performed by executing operators representing portions of computations for processing the database query; selecting, by the database system, a target processing unit for executing an operator of the database query based on factors comprising a data type of values stored in a column processed by the query; responsive to selection of the second processing unit for executing the operator of the database query: generating native code from the intermediate executable representation, wherein the native code is optimized for execution on the second processing unit; compiling the native code to executable code; and executing the executable code by the database system using the second processing unit; and sending the result of execution of the query. 3. The method of claim 1 , wherein selecting the target processing unit for executing the operator of the database query comprises, selecting the first processing unit including one or more CPUs if the values stored in the column processed by the database query are one of: a binary large object or a character large object. | 0.578407 |
8. A server for providing a web application employing a cross-browser web dialog platform, the server comprising: a memory; a processor coupled to the memory, the processor executing web dialog platform, wherein the web dialog platform is configured to: present a parent web page to a user; in response to receiving a user selection, hide at least a portion of displayed web page elements by one of graying the elements, rendering the elements transparent, and modifying text and graphics colors; present a dialog over the hidden web page elements within the parent web page; in response to receiving another user selection through the dialog, present a new web page within the dialog, wherein a size of the dialog is adjusted automatically based on at least one of the contents of the new web page and a size of a view port displaying the web page, a portion of elements on the new web page are hidden by removing the elements selectively from the new web page, the selective removal including hiding of controls associated with saving, deleting, and checking entire content by at least one from a set of: graying the controls, rendering the controls transparent, and modifying text and graphics colors in response to a user interaction with the new web page changing to a content input mode, and the one or more controls are displayed upon completion of the content input mode; present one or more links within the new web page, wherein a behavior of the links within the new web page is specified based on interpreting the links within the new web page for desired link behavior and specifying separate behaviors for the links based on the interpretation. | 8. A server for providing a web application employing a cross-browser web dialog platform, the server comprising: a memory; a processor coupled to the memory, the processor executing web dialog platform, wherein the web dialog platform is configured to: present a parent web page to a user; in response to receiving a user selection, hide at least a portion of displayed web page elements by one of graying the elements, rendering the elements transparent, and modifying text and graphics colors; present a dialog over the hidden web page elements within the parent web page; in response to receiving another user selection through the dialog, present a new web page within the dialog, wherein a size of the dialog is adjusted automatically based on at least one of the contents of the new web page and a size of a view port displaying the web page, a portion of elements on the new web page are hidden by removing the elements selectively from the new web page, the selective removal including hiding of controls associated with saving, deleting, and checking entire content by at least one from a set of: graying the controls, rendering the controls transparent, and modifying text and graphics colors in response to a user interaction with the new web page changing to a content input mode, and the one or more controls are displayed upon completion of the content input mode; present one or more links within the new web page, wherein a behavior of the links within the new web page is specified based on interpreting the links within the new web page for desired link behavior and specifying separate behaviors for the links based on the interpretation. 9. The server of claim 8 , wherein the web dialog platform is further configured to: render the dialog at a fixed size outside the view port; determine a scrollable width and height of a body element of the new web page; determine the size of the view port of the parent web page; and set a new width and height of the dialog to a lesser one of the width and height of the body element of the new web page and the viewport of the parent page. | 0.607306 |
9. A non-transitory computer-readable medium having instructions stored thereon that, when executed by a processor of a computing device, causes the processor to perform operations comprising: transmitting, from the computing device and to a first remote service, an indication of a verbal input from a user of the computing device; receiving, by the computing device and from the first remote service, a response to the verbal input, the response to the verbal input including: (i) an indication of a particular application that the first remote service identified as having significance to the verbal input from the user of the computing device, and (ii) a symbolic representation of the verbal input; in response to receiving the response to the verbal input: (i) establishing a connection with a second remote service that corresponds to the particular application that the first remote service identified as having significance to the verbal input from the user of the computing device, and (ii) launching the particular application within an interface presented by the computing device; transmitting, from the computing device and to the second remote service, a query; receiving, by the computing device and from the second remote service, a response to the query; and presenting, by the computing device and through the interface as an output of the particular application, the response to the query. | 9. A non-transitory computer-readable medium having instructions stored thereon that, when executed by a processor of a computing device, causes the processor to perform operations comprising: transmitting, from the computing device and to a first remote service, an indication of a verbal input from a user of the computing device; receiving, by the computing device and from the first remote service, a response to the verbal input, the response to the verbal input including: (i) an indication of a particular application that the first remote service identified as having significance to the verbal input from the user of the computing device, and (ii) a symbolic representation of the verbal input; in response to receiving the response to the verbal input: (i) establishing a connection with a second remote service that corresponds to the particular application that the first remote service identified as having significance to the verbal input from the user of the computing device, and (ii) launching the particular application within an interface presented by the computing device; transmitting, from the computing device and to the second remote service, a query; receiving, by the computing device and from the second remote service, a response to the query; and presenting, by the computing device and through the interface as an output of the particular application, the response to the query. 15. The computer-readable medium of claim 9 , wherein the operations further comprise using the indication of the particular application that the first remote service identified as having significance to the verbal input from the user of the computing device to establish the connection with the second remote service that corresponds to the particular application. | 0.51497 |
10. A method for generating a graph lattice from exemplary images, said method comprising: receive by at least one processor exemplary data graphs of the exemplary images, wherein nodes of the exemplary data graphs are formed from primitives; generate by the at least one processor graph lattice nodes of size one from the primitives; until a termination condition is met and by the at least one processor, repeatedly: generate candidate graph lattice nodes from accepted graph lattice nodes, including the graph lattice nodes of size one and promoted graph lattice nodes, and the exemplary data graphs; select one or more candidate graph lattice nodes, the selected candidate graph lattice nodes preferentially discriminating exemplary data graphs which are less discriminable than other exemplary data graphs using the accepted graph lattice nodes, wherein the selection of the one or more candidate graph lattice nodes includes a scoring operation where a high score indicates that a particular exemplary data graph is mapped to by many subgraphs of accepted graph lattice nodes that are not mapped to many other exemplary data graphs, indicating there are many discriminating subgraph features for the particular exemplary data graph, and a low score indicates the particular exemplary data graph is not mapped to by unique or highly discriminative features, and is more confusable with other exemplary data graphs, wherein each graph lattice node, including the accepted graph lattice nodes and the candidate graph lattice nodes, includes a subgraph, a vote weight, and at least one mapping of the subgraph to the exemplary data graphs, and wherein the scoring operation includes: scoring each candidate graph lattice node according to a scoring function, the scoring function including a ratio, wherein a numerator of the ratio is based on the vote weight of the candidate graph lattice node, and wherein a denominator of the ratio is a summation of vote weights of accepted graph lattice nodes mapping to exemplary data graphs the candidate graph lattice node maps to; and, the selection of the one or more candidate graph lattice nodes further includes the selection of most highly scored candidate graph lattice nodes according to selection criteria; and, promote the selected graph lattice nodes to accepted status; wherein the graph lattice is formed from the accepted graph lattice nodes and relations between the accepted graph lattice nodes. | 10. A method for generating a graph lattice from exemplary images, said method comprising: receive by at least one processor exemplary data graphs of the exemplary images, wherein nodes of the exemplary data graphs are formed from primitives; generate by the at least one processor graph lattice nodes of size one from the primitives; until a termination condition is met and by the at least one processor, repeatedly: generate candidate graph lattice nodes from accepted graph lattice nodes, including the graph lattice nodes of size one and promoted graph lattice nodes, and the exemplary data graphs; select one or more candidate graph lattice nodes, the selected candidate graph lattice nodes preferentially discriminating exemplary data graphs which are less discriminable than other exemplary data graphs using the accepted graph lattice nodes, wherein the selection of the one or more candidate graph lattice nodes includes a scoring operation where a high score indicates that a particular exemplary data graph is mapped to by many subgraphs of accepted graph lattice nodes that are not mapped to many other exemplary data graphs, indicating there are many discriminating subgraph features for the particular exemplary data graph, and a low score indicates the particular exemplary data graph is not mapped to by unique or highly discriminative features, and is more confusable with other exemplary data graphs, wherein each graph lattice node, including the accepted graph lattice nodes and the candidate graph lattice nodes, includes a subgraph, a vote weight, and at least one mapping of the subgraph to the exemplary data graphs, and wherein the scoring operation includes: scoring each candidate graph lattice node according to a scoring function, the scoring function including a ratio, wherein a numerator of the ratio is based on the vote weight of the candidate graph lattice node, and wherein a denominator of the ratio is a summation of vote weights of accepted graph lattice nodes mapping to exemplary data graphs the candidate graph lattice node maps to; and, the selection of the one or more candidate graph lattice nodes further includes the selection of most highly scored candidate graph lattice nodes according to selection criteria; and, promote the selected graph lattice nodes to accepted status; wherein the graph lattice is formed from the accepted graph lattice nodes and relations between the accepted graph lattice nodes. 13. The method according to claim 10 , wherein the vote weight is 1/M, wherein M is the number of exemplary data graphs the subgraph maps to. | 0.652903 |
1. A method of preprocessing an image for optical character recognition (OCR), wherein the image comprises Arabic text and non-text items, the method comprising: determining a plurality of components associated with at least one of the Arabic text and the non-text items, wherein a component comprises a set of connected pixels; calculating a first set of characteristic parameters associated with the plurality of components; and merging the plurality of components based on the first set of characteristic parameters to form at least one of at least one sub-word and at least one word; calculating a second set of characteristic parameters associated with the at least one of each sub-word and each word, wherein the second set of characteristic parameters is one of a line height, a word spacing, and a line spacing; grouping at least two sub-words based on the second set of characteristic parameters to form one of at least one sub-word and at least one word; segmenting the at least one sub word and the at least one word into at least one horizontal line based on at least one of a line height and a line spacing; identifying at least one component associated with the at least one horizontal line comprising a height greater than a factor of the line height; determining a center of each horizontal line of the at least one horizontal line, wherein the center is a mid point between a top edge and a bottom edge of each horizontal line; calculating a distance between at least one of the center and the top edge, and the center and the bottom edge; and determining orientation of the image based on the distance. | 1. A method of preprocessing an image for optical character recognition (OCR), wherein the image comprises Arabic text and non-text items, the method comprising: determining a plurality of components associated with at least one of the Arabic text and the non-text items, wherein a component comprises a set of connected pixels; calculating a first set of characteristic parameters associated with the plurality of components; and merging the plurality of components based on the first set of characteristic parameters to form at least one of at least one sub-word and at least one word; calculating a second set of characteristic parameters associated with the at least one of each sub-word and each word, wherein the second set of characteristic parameters is one of a line height, a word spacing, and a line spacing; grouping at least two sub-words based on the second set of characteristic parameters to form one of at least one sub-word and at least one word; segmenting the at least one sub word and the at least one word into at least one horizontal line based on at least one of a line height and a line spacing; identifying at least one component associated with the at least one horizontal line comprising a height greater than a factor of the line height; determining a center of each horizontal line of the at least one horizontal line, wherein the center is a mid point between a top edge and a bottom edge of each horizontal line; calculating a distance between at least one of the center and the top edge, and the center and the bottom edge; and determining orientation of the image based on the distance. 7. The method of claim 1 , wherein the first set of characteristic parameters is at least one of a line height, a word spacing, a line spacing, a number of pixels corresponding to each component, a width of each component, a height of each component, coordinates of each component, density of each component, and aspect ratio of each component. | 0.544151 |
1. A system comprising: a processing device; and a storage device storing computer-executable instructions which, when executed by the processing device, cause the processing device to: receive a set of input images produced by an image capture device, the set of input images capturing scenes at respective locations at respective times; extract input image attributes from the input images; based at least on the input image attributes, identify matching source images in a knowledgebase that match the input images; obtain preliminary narrative information from the matching source images; determine semantic classifications of text fragments of the preliminary narrative information; generate an album narrative for the set of input images by ordering the text fragments of the preliminary narrative information based at least in part on both the respective times of the set of input images and the semantic classifications of the text fragments; generate an annotated album that includes the album narrative together with at least some of the input images in the set of input images; and provide the annotated album to a user. | 1. A system comprising: a processing device; and a storage device storing computer-executable instructions which, when executed by the processing device, cause the processing device to: receive a set of input images produced by an image capture device, the set of input images capturing scenes at respective locations at respective times; extract input image attributes from the input images; based at least on the input image attributes, identify matching source images in a knowledgebase that match the input images; obtain preliminary narrative information from the matching source images; determine semantic classifications of text fragments of the preliminary narrative information; generate an album narrative for the set of input images by ordering the text fragments of the preliminary narrative information based at least in part on both the respective times of the set of input images and the semantic classifications of the text fragments; generate an annotated album that includes the album narrative together with at least some of the input images in the set of input images; and provide the annotated album to a user. 5. The system of claim 1 , wherein the input image attributes include an emotion attribute that describes a presumed emotion exhibited by at least one person associated with at least one input image in the set of input images. | 0.578322 |
8. The method of claim 7 , wherein: the ontology further comprises concept statistics associated with the plurality of concepts; and resolving the conflict by evaluating the first and second classified tokens is based at least in part on the concept statistics. | 8. The method of claim 7 , wherein: the ontology further comprises concept statistics associated with the plurality of concepts; and resolving the conflict by evaluating the first and second classified tokens is based at least in part on the concept statistics. 9. The method of claim 8 , further comprising: generating data source statistics for the data source; and retrieving one or more updated data elements from the data source according to an update schedule, the update schedule based at least in part on the data source statistics. | 0.876439 |
1. A system, comprising memory operatively coupled to one or more processors that are configured to execute instructions that cause the system to perform a method comprising steps of: receiving from a first user a first expression of interest in being notified about interactions of a third user; receiving from a second user a second expression of interest in being notified about interactions of the third user; receiving an indication of a particular interaction of the third user; after receiving the first expression of interest, receiving the second expression of interest, and receiving the indication, performing the steps of: based, at least in part, on the first expression of interest, sending first information about the particular interaction to the first user; based, at least in part, on the second expression of interest, sending the first information about the particular interaction to the second user; and wherein the first information includes one or more links that provide access to one or more views that are associated with the particular interaction; receiving from the first user a first comment entered in a first text entry interface, wherein the first text entry interface is related to the first information; and sending the first comment to the second user to enable display of the first comment, in relation to the first information, to the second user. | 1. A system, comprising memory operatively coupled to one or more processors that are configured to execute instructions that cause the system to perform a method comprising steps of: receiving from a first user a first expression of interest in being notified about interactions of a third user; receiving from a second user a second expression of interest in being notified about interactions of the third user; receiving an indication of a particular interaction of the third user; after receiving the first expression of interest, receiving the second expression of interest, and receiving the indication, performing the steps of: based, at least in part, on the first expression of interest, sending first information about the particular interaction to the first user; based, at least in part, on the second expression of interest, sending the first information about the particular interaction to the second user; and wherein the first information includes one or more links that provide access to one or more views that are associated with the particular interaction; receiving from the first user a first comment entered in a first text entry interface, wherein the first text entry interface is related to the first information; and sending the first comment to the second user to enable display of the first comment, in relation to the first information, to the second user. 27. The system of claim 1 wherein the step of sending the first comment automatically causes display of the first comment, in relation to the first information, without causing redisplay of the first information, to the second user. | 0.75581 |
14. A multimedia device comprising: a user profile agent to receive a first video stream of a first television program obtained by way of the multimedia device, to determine from the first video stream, information comprising a plurality of keywords associated with user viewing habits, and to generate a user profile based on the information comprising the plurality of keywords; a first memory in communication with the user profile agent, the first memory to store the user profile comprising the plurality of keywords; a keyword detection agent, in communication with the first memory, to search, subsequently to the storing of the user profile comprising the plurality of keywords, text associated with a second video stream of a second television program output from the multimedia device for one of a word or phrase of the plurality of keywords of the user profile; a second memory in communication with the keyword detection agent, the second memory to store the word or phrase of the plurality of keywords detected in the text associated with the second video stream as a second keyword separately from the second video stream and separately from the first memory; and an information search agent, in communication with the memory, to connect to an information source associated with the second keyword detected by the keyword detection agent, and to provide additional information associated with the second keyword for output. | 14. A multimedia device comprising: a user profile agent to receive a first video stream of a first television program obtained by way of the multimedia device, to determine from the first video stream, information comprising a plurality of keywords associated with user viewing habits, and to generate a user profile based on the information comprising the plurality of keywords; a first memory in communication with the user profile agent, the first memory to store the user profile comprising the plurality of keywords; a keyword detection agent, in communication with the first memory, to search, subsequently to the storing of the user profile comprising the plurality of keywords, text associated with a second video stream of a second television program output from the multimedia device for one of a word or phrase of the plurality of keywords of the user profile; a second memory in communication with the keyword detection agent, the second memory to store the word or phrase of the plurality of keywords detected in the text associated with the second video stream as a second keyword separately from the second video stream and separately from the first memory; and an information search agent, in communication with the memory, to connect to an information source associated with the second keyword detected by the keyword detection agent, and to provide additional information associated with the second keyword for output. 19. The multimedia device of claim 14 , wherein the user profile agent is further configured to perform an analysis of metadata of the second video stream output from the multimedia device, and to update the user profile responsive to the analysis of the metadata of the second video stream. | 0.532823 |
1. A method comprising: receiving an initial query term set; based on the initial query term set determining a list of item categories that each represent a category of items available on a network; causing the list of item categories to be presented in a user interface to a user; receiving from the user, a selection of an item category from the list of item categories determined based on the initial query term set; performing phrase recognition on the initial query term set to determine recognized phrases; determining a synonym for each of the recognized phrases based on the user selected item category, the synonym comprising a plurality of words; causing the determined synonyms to be presented in the user interface to the user along with corresponding first selectors and corresponding second selectors, each of the first selectors being operable to select the corresponding synonym, each of the second selectors being operable to select a search option for the corresponding synonym, each second selector including: a first search option operable to cause the corresponding synonym to be matched whenever the plurality of words of the synonym are matched without regard to order, a second search option operable to cause the corresponding synonym to be matched whenever at least one of the plurality of words of the synonym is matched, and a third search option operable to cause the corresponding synonym to be matched whenever the plurality of words of the synonym are matched in order; receiving, from the user, a selection of a subset of the presented synonyms selected by the user from the determined synonyms, the selection indicating corresponding search options selected by the user; and determining, using one or more processors, results within the user selected item category that match the initial query term set and the selected subset of synonyms, the results being based on the selected search options for the selected subset of synonyms. | 1. A method comprising: receiving an initial query term set; based on the initial query term set determining a list of item categories that each represent a category of items available on a network; causing the list of item categories to be presented in a user interface to a user; receiving from the user, a selection of an item category from the list of item categories determined based on the initial query term set; performing phrase recognition on the initial query term set to determine recognized phrases; determining a synonym for each of the recognized phrases based on the user selected item category, the synonym comprising a plurality of words; causing the determined synonyms to be presented in the user interface to the user along with corresponding first selectors and corresponding second selectors, each of the first selectors being operable to select the corresponding synonym, each of the second selectors being operable to select a search option for the corresponding synonym, each second selector including: a first search option operable to cause the corresponding synonym to be matched whenever the plurality of words of the synonym are matched without regard to order, a second search option operable to cause the corresponding synonym to be matched whenever at least one of the plurality of words of the synonym is matched, and a third search option operable to cause the corresponding synonym to be matched whenever the plurality of words of the synonym are matched in order; receiving, from the user, a selection of a subset of the presented synonyms selected by the user from the determined synonyms, the selection indicating corresponding search options selected by the user; and determining, using one or more processors, results within the user selected item category that match the initial query term set and the selected subset of synonyms, the results being based on the selected search options for the selected subset of synonyms. 4. The method of claim 1 , wherein the performing of the phrase recognition comprises removing One word at a time from the initial query term set until a matching recognized phrase is found. | 0.586985 |
9. The method of claim 8 , further comprising: (f) maintaining a database of proper nouns and corresponding common nouns. | 9. The method of claim 8 , further comprising: (f) maintaining a database of proper nouns and corresponding common nouns. 10. The method of claim 9 , further comprising: (g) conducting a match query against the database to identify matching image tags and textual tags. | 0.900098 |
1. A computer-implemented method comprising: (A) receiving a search query; (B) providing a first user interface, the first user interface displaying first search results specifying resources that a search engine has identified as being responsive to the search query, the first user interface further displaying a subject matter link identifying a particular subject matter that the search engine has identified based on the first search results, the particular subject matter being associated with a particular collection of records that the search engine has selected from among multiple collections of records, all records in the particular collection having a common attribute structure of data elements that pertain to the particular subject matter, (C) wherein the first user interface further displays a second subject matter link identifying a second subject matter that the search engine has also identified based on the first search results, the second subject matter being associated with a second collection of records that the search engine has selected from among the multiple collections of records, all records in the second collection having a common attribute structure of data elements that pertain to the second subject matter, the common attribute structure of the second collection being different than the common attribute structure of the particular collection; (D) receiving a selection of the subject matter link; (E) formatting second search results based on a template that is associated with the particular subject matter, each of the second search results specifying a respective record, each record being in the particular collection of records associated with the particular subject matter; and (F) providing a second user interface that displays the second search results and an interface element that is associated with the template. | 1. A computer-implemented method comprising: (A) receiving a search query; (B) providing a first user interface, the first user interface displaying first search results specifying resources that a search engine has identified as being responsive to the search query, the first user interface further displaying a subject matter link identifying a particular subject matter that the search engine has identified based on the first search results, the particular subject matter being associated with a particular collection of records that the search engine has selected from among multiple collections of records, all records in the particular collection having a common attribute structure of data elements that pertain to the particular subject matter, (C) wherein the first user interface further displays a second subject matter link identifying a second subject matter that the search engine has also identified based on the first search results, the second subject matter being associated with a second collection of records that the search engine has selected from among the multiple collections of records, all records in the second collection having a common attribute structure of data elements that pertain to the second subject matter, the common attribute structure of the second collection being different than the common attribute structure of the particular collection; (D) receiving a selection of the subject matter link; (E) formatting second search results based on a template that is associated with the particular subject matter, each of the second search results specifying a respective record, each record being in the particular collection of records associated with the particular subject matter; and (F) providing a second user interface that displays the second search results and an interface element that is associated with the template. 3. The method of claim 1 , further comprising identifying the particular subject matter based on the first search results and the search query. | 0.586552 |
17. The computer system of claim 16 , wherein the step of identifying the first textual data in a form of a table includes: breaking the first test response into one or more blocks of non-blank lines; within each block, breaking each line into one or more words separated by whitespace; and for each block, identifying said each block as a table if the words in all lines of said each block start on a same column position in all rows of said each block. | 17. The computer system of claim 16 , wherein the step of identifying the first textual data in a form of a table includes: breaking the first test response into one or more blocks of non-blank lines; within each block, breaking each line into one or more words separated by whitespace; and for each block, identifying said each block as a table if the words in all lines of said each block start on a same column position in all rows of said each block. 18. The computer system of claim 17 , wherein the step of identifying the first textual data in a form of a table further includes: identifying a left-most column cell with values of all cells in the left-most column being distinct as a key column of the identified table; and generating a query for at least one of the cells in the identified table using a column name of a column of the identified table to which said at least one of the cells belong and a cell value of another cell in the key column on a same row as said one of the cells. | 0.746894 |
1. A computer-implemented method of automated standardization of distinct non-standard names in a transactions processing database to associate said distinct non-standard names with standard names of particular entities, comprising: identifying features of a distinct name that are non-standard features of a standard name of an entity stored in said database, the non-standard features creating ambiguity between the distinct name and the standard name, and creating a characteristic feature set for said distinct name containing said identified non-standard features; processing said distinct name using a regular expression rule selected based upon the characteristic feature set of said distinct name to cleanse said distinct name by removing the non-standard features of the characteristic feature set from the distinct name to convert the distinct name to a standard name format; comparing the standard name format to standard names of entities in the database to determine possible matches; and identifying based upon said comparing the distinct name as corresponding to the standard name of the entity. | 1. A computer-implemented method of automated standardization of distinct non-standard names in a transactions processing database to associate said distinct non-standard names with standard names of particular entities, comprising: identifying features of a distinct name that are non-standard features of a standard name of an entity stored in said database, the non-standard features creating ambiguity between the distinct name and the standard name, and creating a characteristic feature set for said distinct name containing said identified non-standard features; processing said distinct name using a regular expression rule selected based upon the characteristic feature set of said distinct name to cleanse said distinct name by removing the non-standard features of the characteristic feature set from the distinct name to convert the distinct name to a standard name format; comparing the standard name format to standard names of entities in the database to determine possible matches; and identifying based upon said comparing the distinct name as corresponding to the standard name of the entity. 3. The method of claim 1 , wherein said non-standard features comprise a position of one or more of a white space, numbers, and special characters, if any. | 0.592887 |
11. A machine-readable medium including machine-readable instructions providing a method for creating a music file, the method comprising: receiving a birth date; determining angular distribution of celestial objects on a birth sky based, at least in part, on the birth date; selecting a plurality of Names from Shem ha-Meforash based, at least in part, on the angular distribution of celestial objects; associating vowels with at least some of the Names; generating a recorded musical portion for at least some of the Names; assembling at least some of the recorded musical portions in a musical file; and recording the musical file. | 11. A machine-readable medium including machine-readable instructions providing a method for creating a music file, the method comprising: receiving a birth date; determining angular distribution of celestial objects on a birth sky based, at least in part, on the birth date; selecting a plurality of Names from Shem ha-Meforash based, at least in part, on the angular distribution of celestial objects; associating vowels with at least some of the Names; generating a recorded musical portion for at least some of the Names; assembling at least some of the recorded musical portions in a musical file; and recording the musical file. 14. The machine-readable medium including machine-readable instructions providing a method for creating a music file of claim 11 , wherein the plurality of Names is 10 Names. | 0.718225 |
7. The method of claim 5 , wherein the generating the response text data based on the preferred action data comprises: acquiring parameter data required for response from a data source based on the updated conversation parameter and the preferred action data; and generating the response text data based on the acquired parameter data and the preferred action data. | 7. The method of claim 5 , wherein the generating the response text data based on the preferred action data comprises: acquiring parameter data required for response from a data source based on the updated conversation parameter and the preferred action data; and generating the response text data based on the acquired parameter data and the preferred action data. 12. The method of claim 7 , wherein the generating the response text data based on the acquired parameter data and the preferred action data further comprises: performing a data conflict detection on the acquired parameter data; and if a data conflict is detected, discarding the parameter data that has the detected data conflict. | 0.882639 |
14. A computer-implemented method comprising: receiving, by data processing apparatus, a search query including content in a first spoken language, the search query relating to a topic based on a subject matter of the content included in the search query; determining a relevance of the topic of the search query to each potential second spoken language from a set of potential second spoken languages different from the first spoken language; selecting a subset of potential second spoken languages based on the relevance of each potential second spoken language to the topic of the search query, the subset having fewer potential second spoken languages than the set of potential second spoken languages in its entirety; translating, by the data processing apparatus, the content included in the search query to translated content in each of the potential second spoken languages of the subset that is determined based on the content included in the search query; identifying, by the data processing apparatus, content in each of the potential second spoken languages of the subset that satisfies the translated search query from content included in one or more of a plurality of network locations that include content in each of the potential second spoken languages of the subset; identifying, by the data processing apparatus, content in the first spoken language that satisfies the search query from content included in one or more of another plurality of network locations that include content in the first spoken language; translating, by the data processing apparatus, the identified content in each of the potential second spoken languages of the subset into the first spoken language; and providing, by the data processing apparatus, the translated identified content in the first spoken language and the identified content in the first spoken language in response to receiving the search query. | 14. A computer-implemented method comprising: receiving, by data processing apparatus, a search query including content in a first spoken language, the search query relating to a topic based on a subject matter of the content included in the search query; determining a relevance of the topic of the search query to each potential second spoken language from a set of potential second spoken languages different from the first spoken language; selecting a subset of potential second spoken languages based on the relevance of each potential second spoken language to the topic of the search query, the subset having fewer potential second spoken languages than the set of potential second spoken languages in its entirety; translating, by the data processing apparatus, the content included in the search query to translated content in each of the potential second spoken languages of the subset that is determined based on the content included in the search query; identifying, by the data processing apparatus, content in each of the potential second spoken languages of the subset that satisfies the translated search query from content included in one or more of a plurality of network locations that include content in each of the potential second spoken languages of the subset; identifying, by the data processing apparatus, content in the first spoken language that satisfies the search query from content included in one or more of another plurality of network locations that include content in the first spoken language; translating, by the data processing apparatus, the identified content in each of the potential second spoken languages of the subset into the first spoken language; and providing, by the data processing apparatus, the translated identified content in the first spoken language and the identified content in the first spoken language in response to receiving the search query. 15. The method of claim 14 , wherein each of the one or more of the plurality of network locations is represented by a corresponding first identifier and each of the one or more of the other plurality of network locations is represented by a corresponding second identifier, and wherein providing the translated identified content in the first spoken language and the identified content in the first spoken language in response to receiving the search query comprises: providing one or more first identifiers that represent the one or more of the other plurality of network locations from which the content in the first spoken language has been identified; and providing one or more second identifiers that represent the one or more of the plurality of network locations from which the content in each of the potential second spoken languages of the subset has been identified. | 0.5 |
7. A computer-readable storage medium having computer-executable program modules for generating structured data tangibly embodied therein, comprising: a data acquisition module for receiving an electronic document containing unstructured data describing facts about business hours of an enterprise; a data extraction module for extracting the unstructured data describing facts about the business hours of the enterprise from the electronic document; and a data parsing module for receiving the extracted unstructured data and creating structured representations of the facts about the business hours of the enterprise described by the unstructured data, wherein the data parsing module comprises: a value normalization module for receiving a string describing facts about the business hours of the enterprise extracted from the electronic document and for: parsing the string to classify symbols within the string, the parsing classifying symbols within the string as representing days of the week and classifying symbols within the string as representing times of the enterprise's business hours; collapsing the symbols representing days of the week in the string to form a collapsed string, the collapsed string having a symbol representing a sequence of days and the symbols representing times of the enterprise's business hours, wherein the symbol representing the sequence of days is described in the structured representation by a vector having bits indicating days of the week on which the enterprise is open; and interpreting the symbols within the collapsed string to determine business hours for the enterprise on the days in the sequence; wherein the structured representations of the facts about the business hours of the enterprise comprise a vector describing the symbol representing the sequence of days using bits indicating days of the week on which the enterprise is open. | 7. A computer-readable storage medium having computer-executable program modules for generating structured data tangibly embodied therein, comprising: a data acquisition module for receiving an electronic document containing unstructured data describing facts about business hours of an enterprise; a data extraction module for extracting the unstructured data describing facts about the business hours of the enterprise from the electronic document; and a data parsing module for receiving the extracted unstructured data and creating structured representations of the facts about the business hours of the enterprise described by the unstructured data, wherein the data parsing module comprises: a value normalization module for receiving a string describing facts about the business hours of the enterprise extracted from the electronic document and for: parsing the string to classify symbols within the string, the parsing classifying symbols within the string as representing days of the week and classifying symbols within the string as representing times of the enterprise's business hours; collapsing the symbols representing days of the week in the string to form a collapsed string, the collapsed string having a symbol representing a sequence of days and the symbols representing times of the enterprise's business hours, wherein the symbol representing the sequence of days is described in the structured representation by a vector having bits indicating days of the week on which the enterprise is open; and interpreting the symbols within the collapsed string to determine business hours for the enterprise on the days in the sequence; wherein the structured representations of the facts about the business hours of the enterprise comprise a vector describing the symbol representing the sequence of days using bits indicating days of the week on which the enterprise is open. 12. The computer-readable storage medium of claim 7 , wherein the vector describes open business hours for the enterprise on days of the week. | 0.713427 |
6. The method of claim 4 wherein: the input factors comprise a stored user interface paradigm preference; and choosing which user interface paradigm to present is based at least on the stored user interface paradigm preference. | 6. The method of claim 4 wherein: the input factors comprise a stored user interface paradigm preference; and choosing which user interface paradigm to present is based at least on the stored user interface paradigm preference. 7. The method of claim 6 wherein: the stored user interface paradigm preference is one or multiple separate stored user interface paradigm preferences, and the multiple separate stored user interface paradigm preferences are associated with different communication types. | 0.867719 |
3. The method of claim 1 , further comprising: receiving a video signal containing data representing the video and the text information. | 3. The method of claim 1 , further comprising: receiving a video signal containing data representing the video and the text information. 4. The method of claim 3 , wherein the video signal further contains the join point. | 0.924227 |
5. A method, comprising: obtaining an image of at least a portion of a document; processing the image to determine a plurality of image characteristics of the image wherein the plurality of image characteristics comprise at least one of a first image characteristic representing ascending letters in the image, a second image characteristic representing descending letters in the image, a third image characteristic representing a number of letters in a word in the image and a fourth image characteristic representing a number of words in a line of text in the image; and identifying a previously stored source document based at least in part on the plurality of image characteristics. | 5. A method, comprising: obtaining an image of at least a portion of a document; processing the image to determine a plurality of image characteristics of the image wherein the plurality of image characteristics comprise at least one of a first image characteristic representing ascending letters in the image, a second image characteristic representing descending letters in the image, a third image characteristic representing a number of letters in a word in the image and a fourth image characteristic representing a number of words in a line of text in the image; and identifying a previously stored source document based at least in part on the plurality of image characteristics. 13. The method of claim 5 , in which the plurality of image characteristics comprise page layout information of a page in the image. | 0.796552 |
1. A method in a content recommendation system, the method comprising: under control of a computing system, extracting quotations from a corpus of text documents; identifying one or more entities that are referenced by each of the extracted quotations, each of the identified entities being electronically represented by the content recommendation system; indexing, by the computing system, the extracted quotations, wherein indexing the extracted quotations includes storing a speaker-verb-quote triple in an inverted index managed by the content recommendation system; determining one or more of the extracted quotations that match a received quotation search request; and providing the determined one or more quotations. | 1. A method in a content recommendation system, the method comprising: under control of a computing system, extracting quotations from a corpus of text documents; identifying one or more entities that are referenced by each of the extracted quotations, each of the identified entities being electronically represented by the content recommendation system; indexing, by the computing system, the extracted quotations, wherein indexing the extracted quotations includes storing a speaker-verb-quote triple in an inverted index managed by the content recommendation system; determining one or more of the extracted quotations that match a received quotation search request; and providing the determined one or more quotations. 6. The method of claim 1 wherein extracting quotations includes detecting punctuation indicating a beginning or end of a quotation. | 0.603485 |
7. A system for generating a transliteration font, comprising: a processor; computer readable memory coupled to the processor; a user interface coupled to the processor; software stored in the computer readable memory and executable by the processor, the software having: means for generating a transliteration database including at least first and second data sets, said first data set including graphic representations of characters of an alphabet of a first language and phonetic data representing phonetic pronunciations associated with each of the characters of the alphabet of the first language, said second data set including graphic representations of characters of an alphabet of a second language and phonetic data representing phonetic pronunciations associated with each of the characters of the alphabet of the second language; means for storing the transliteration database in the computer readable memory; means for inputting a word in the first language, the word including at least one of the characters of the alphabet associated with the first language; means for storing the word in the first language in the computer readable memory; means for generating a phonetic representation of the word in the first language, the phonetic representation including the phonetic data representing the phonetic pronunciation of each of the characters of the alphabet of the first language associated with the word; means for comparing the phonetic representation of the word in the first language with corresponding phonetic data of the second language to generate a phonetic equivalent of each of the characters of the word in the alphabet of the second language; means for visually displaying the word in the first language; means for embedding a visual representation of the phonetic equivalent of each of the characters of the word in the second language directly adjacent each respective displayed character in the first language to form a representation of the word in a transliteration font, wherein the visual representation of the phonetic equivalent of each of the characters is embedded within a visual field of each respective displayed character in the first language and within a visual field of the word; means for storing the representation of the word in the transliteration font in the computer readable memory; and means for displaying the word in the transliteration font. | 7. A system for generating a transliteration font, comprising: a processor; computer readable memory coupled to the processor; a user interface coupled to the processor; software stored in the computer readable memory and executable by the processor, the software having: means for generating a transliteration database including at least first and second data sets, said first data set including graphic representations of characters of an alphabet of a first language and phonetic data representing phonetic pronunciations associated with each of the characters of the alphabet of the first language, said second data set including graphic representations of characters of an alphabet of a second language and phonetic data representing phonetic pronunciations associated with each of the characters of the alphabet of the second language; means for storing the transliteration database in the computer readable memory; means for inputting a word in the first language, the word including at least one of the characters of the alphabet associated with the first language; means for storing the word in the first language in the computer readable memory; means for generating a phonetic representation of the word in the first language, the phonetic representation including the phonetic data representing the phonetic pronunciation of each of the characters of the alphabet of the first language associated with the word; means for comparing the phonetic representation of the word in the first language with corresponding phonetic data of the second language to generate a phonetic equivalent of each of the characters of the word in the alphabet of the second language; means for visually displaying the word in the first language; means for embedding a visual representation of the phonetic equivalent of each of the characters of the word in the second language directly adjacent each respective displayed character in the first language to form a representation of the word in a transliteration font, wherein the visual representation of the phonetic equivalent of each of the characters is embedded within a visual field of each respective displayed character in the first language and within a visual field of the word; means for storing the representation of the word in the transliteration font in the computer readable memory; and means for displaying the word in the transliteration font. 11. The system for generating a transliteration font as recited in claim 7 , wherein the first language is Arabic. | 0.629403 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.