sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|
11. An article of manufacture for use in a computer system for mapping objects to a data store and for mapping the data store to the objects, said article of manufacture comprising a computer-readable storage medium having a computer program embodied in said medium which causes the computer system to: store in the computer system a schema mapping definition language construct; store in the computer system a database mapping language construct; store in the computer system a class mapping language construct; and store in the computer system a reference mapping language construct.
|
11. An article of manufacture for use in a computer system for mapping objects to a data store and for mapping the data store to the objects, said article of manufacture comprising a computer-readable storage medium having a computer program embodied in said medium which causes the computer system to: store in the computer system a schema mapping definition language construct; store in the computer system a database mapping language construct; store in the computer system a class mapping language construct; and store in the computer system a reference mapping language construct. 15. The article of manufacture of claim 11 wherein the attribute mapping language construct comprises: a keyword indicating a beginning of the attribute mapping language construct; an attribute type; a table name and a column name; an indication if the column name is a primary key; and a keyword indicating an end of the attribute mapping language construct.
| 0.689189 |
1. A device comprising: a processor; and one or more computer-readable media to store processor-executable instructions that, when executed, program the one or more processors to: identify a plurality of n-grams associated with at least a portion of a digital work, an n-gram of the plurality of n-grams comprising a sequence of at least one or more words, one or more phonemes, one or more syllables, one or more letters, or one or more base pairs; associate a first probability of occurrence with the n-gram based at least in part on a frequency of occurrence in at least the portion of the digital work; determine language model difference information based at least in part on the first probability of occurrence associated with the n-gram differing from a second probability of occurrence of the n-gram in a base language model by more than a threshold amount; and determine a word based at least in part on a captured utterance, the base language model, and the language model difference information.
|
1. A device comprising: a processor; and one or more computer-readable media to store processor-executable instructions that, when executed, program the one or more processors to: identify a plurality of n-grams associated with at least a portion of a digital work, an n-gram of the plurality of n-grams comprising a sequence of at least one or more words, one or more phonemes, one or more syllables, one or more letters, or one or more base pairs; associate a first probability of occurrence with the n-gram based at least in part on a frequency of occurrence in at least the portion of the digital work; determine language model difference information based at least in part on the first probability of occurrence associated with the n-gram differing from a second probability of occurrence of the n-gram in a base language model by more than a threshold amount; and determine a word based at least in part on a captured utterance, the base language model, and the language model difference information. 5. The device as recited in claim 1 , further comprising a communication interface, and wherein the processor-executable instructions further program the one or more processors to send, via the communication interface, the language model difference information to a user device in association with providing the digital work to the user device.
| 0.545203 |
1. A mobile terminal, comprising: a display; an input unit; a memory including a database of information associated with functions or menus of the mobile terminal; and a controller configured to: initiate a voice recognition function in response to a touch input to a soft button displayed on the display or to a hard button on the mobile terminal, wherein the voice recognition function is maintained for a predetermined amount of time since the touch input to the soft button or to the hard button if there is no voice input detected by the mobile terminal during the predetermined amount of time, and wherein an audio information indicating an activation of the voice recognition function is provided; convert a voice instruction input into text in response to detection of the voice instruction input; display information to inform execution of a menu or function associated with the voice instruction input if a recognition rate of the voice instruction input to be related to the menu or function is higher than a threshold value, wherein the recognition rate of the voice instruction input with respect to the menu or function is improved via learning from the detection of the voice instruction input and the execution of the menu or function; and execute the menu or function if the menu or function is only one among the functions or menus with the recognition rate of the voice instruction input to be related to the menu or function higher than the threshold value and display a plurality of menus or functions if a recognition rate of the voice instruction input to be related to each of the plurality of menus or functions is greater than the threshold value, wherein one of the plurality of menus or functions is executed in response to selection of said one of the plurality of menus or functions.
|
1. A mobile terminal, comprising: a display; an input unit; a memory including a database of information associated with functions or menus of the mobile terminal; and a controller configured to: initiate a voice recognition function in response to a touch input to a soft button displayed on the display or to a hard button on the mobile terminal, wherein the voice recognition function is maintained for a predetermined amount of time since the touch input to the soft button or to the hard button if there is no voice input detected by the mobile terminal during the predetermined amount of time, and wherein an audio information indicating an activation of the voice recognition function is provided; convert a voice instruction input into text in response to detection of the voice instruction input; display information to inform execution of a menu or function associated with the voice instruction input if a recognition rate of the voice instruction input to be related to the menu or function is higher than a threshold value, wherein the recognition rate of the voice instruction input with respect to the menu or function is improved via learning from the detection of the voice instruction input and the execution of the menu or function; and execute the menu or function if the menu or function is only one among the functions or menus with the recognition rate of the voice instruction input to be related to the menu or function higher than the threshold value and display a plurality of menus or functions if a recognition rate of the voice instruction input to be related to each of the plurality of menus or functions is greater than the threshold value, wherein one of the plurality of menus or functions is executed in response to selection of said one of the plurality of menus or functions. 4. The mobile terminal of claim 1 , wherein the information comprises data information output associated with the execution of the menu or function.
| 0.603143 |
13. A tangible computer program product comprising a computer readable storage medium having control logic stored therein for causing a computer to process text, the control logic comprising: computer readable first program code that causes the computer to generate an abstract mathematical vector space based on a collection of documents, wherein respective documents in the collection of documents have a representation in the abstract mathematical vector space and respective terms contained in the collection of documents have a representation in the abstract mathematical vector space; and computer readable second program code that causes the computer to perturb the abstract mathematical vector space to produce a perturbed abstract mathematical vector space that is stored in an electronic format accessible to a user, wherein perturbing the abstract mathematical vector space comprises at least one of (i) modifying the representation of a document with a newly computed representation for that document, and (ii) modifying the representation of a term with a newly computed representation for that term.
|
13. A tangible computer program product comprising a computer readable storage medium having control logic stored therein for causing a computer to process text, the control logic comprising: computer readable first program code that causes the computer to generate an abstract mathematical vector space based on a collection of documents, wherein respective documents in the collection of documents have a representation in the abstract mathematical vector space and respective terms contained in the collection of documents have a representation in the abstract mathematical vector space; and computer readable second program code that causes the computer to perturb the abstract mathematical vector space to produce a perturbed abstract mathematical vector space that is stored in an electronic format accessible to a user, wherein perturbing the abstract mathematical vector space comprises at least one of (i) modifying the representation of a document with a newly computed representation for that document, and (ii) modifying the representation of a term with a newly computed representation for that term. 17. The computer program product of claim 13 , wherein the computer readable second program code further comprises code that causes the computer to represent an additional document in the perturbed abstract mathematical vector space.
| 0.750279 |
12. A computing device, comprising: at least one processor; and a non-transitory computer-readable storage medium storing executable computer program code, the at least one processor configured to execute the executable computer program code to perform operations including: receiving a sentence including one or more words; determining an index set of possible head-modifier dependencies for the sentence, the index set including inner arcs and outer arcs, the inners arcs representing possible head-modifier dependency between words in the sentence separated by a first distance less than or equal to a distance threshold and outer arcs representing possible head-modifier dependency between words in the sentence separated by a second distance greater than the distance threshold; pruning the index set based on an augmented vine parsing algorithm to obtain a first pruned index set, the first pruned index set including: (i) each specific inner arc when a likelihood that the specific inner arc is appropriate is greater than a first threshold, and (ii) the outer arcs when a likelihood that there exists any possible outer arc that is appropriate is greater than the first threshold; pruning the first pruned index set based on a second parsing algorithm to obtain a second pruned index set; determining a most-likely parse for the sentence from the second pruned index set; and outputting the most-likely parse.
|
12. A computing device, comprising: at least one processor; and a non-transitory computer-readable storage medium storing executable computer program code, the at least one processor configured to execute the executable computer program code to perform operations including: receiving a sentence including one or more words; determining an index set of possible head-modifier dependencies for the sentence, the index set including inner arcs and outer arcs, the inners arcs representing possible head-modifier dependency between words in the sentence separated by a first distance less than or equal to a distance threshold and outer arcs representing possible head-modifier dependency between words in the sentence separated by a second distance greater than the distance threshold; pruning the index set based on an augmented vine parsing algorithm to obtain a first pruned index set, the first pruned index set including: (i) each specific inner arc when a likelihood that the specific inner arc is appropriate is greater than a first threshold, and (ii) the outer arcs when a likelihood that there exists any possible outer arc that is appropriate is greater than the first threshold; pruning the first pruned index set based on a second parsing algorithm to obtain a second pruned index set; determining a most-likely parse for the sentence from the second pruned index set; and outputting the most-likely parse. 18. The computing device of claim 12 , wherein determining the most-likely parse for the sentence from the second pruned index set is based on a margin infused relaxed algorithm.
| 0.588312 |
10. A system comprising: a storage device having instructions stored thereon; and data processing apparatus operable to execute the instructions to perform operations comprising: determining a first measure of a first corpus for a search query as a count of times the search query was submitted to search the first corpus in view of a count of times other queries were submitted to search the first corpus; determining a second measure of a second corpus for the search query as a count of times the search query was submitted to search the second corpus in view of a count of times other queries were submitted to search the second corpus; determining a click measure based on a count of selections of first corpus search results for the search query relative to a count of selections of second corpus search results for the search query; determining a measure of relative relevance of the first corpus and the second corpus for the search query based on the first measure, the second measure and the click measure; and providing the measure of relative relevance to a ranking engine for ranking of search results for a search corresponding to the search query.
|
10. A system comprising: a storage device having instructions stored thereon; and data processing apparatus operable to execute the instructions to perform operations comprising: determining a first measure of a first corpus for a search query as a count of times the search query was submitted to search the first corpus in view of a count of times other queries were submitted to search the first corpus; determining a second measure of a second corpus for the search query as a count of times the search query was submitted to search the second corpus in view of a count of times other queries were submitted to search the second corpus; determining a click measure based on a count of selections of first corpus search results for the search query relative to a count of selections of second corpus search results for the search query; determining a measure of relative relevance of the first corpus and the second corpus for the search query based on the first measure, the second measure and the click measure; and providing the measure of relative relevance to a ranking engine for ranking of search results for a search corresponding to the search query. 14. The system of claim 10 wherein determining the measure of relative relevance comprises computing a weighted combination of a relative search fraction of the first measure and the second measure, and the click measure.
| 0.661597 |
8. A receiving device comprising: a communication interface that receives a first audio/video stream including at least one segment of a show and at least one interstitial of the show, and that further receives supplemental data associated with the first audio/video stream, the supplemental data including closed captioning data associated with the first audio/video stream; a storage unit that stores the first audio/video stream and the supplemental data; control logic that: receives autonomous location information separately from the first audio/video stream, the autonomous location information that references the closed captioning data, the autonomous location information including a plurality of data segments, each comprising a displayable text string included within the closed captioning data as originally transmitted by a content provider; processes the closed captioning data recorded to locate a first video location corresponding with the presentation of a first of the plurality of data segments located in the closed captioning data recorded; determines that the first of the plurality of data segments is not located within the closed captioning data recorded; processes the closed captioning data recorded again to locate a second video location corresponding with the presentation of a second of the plurality of data segments in the closed captioning data recorded; identifies the boundaries of the at least one segment of the show based on the second video location and the autonomous location information; identifies substitute content based on the second video location and the autonomous location information to present in association with the at least one segment of the show; and an audio/video interface that outputs a second audio/video stream for presentation on a display device, the second audio/video stream including the at least one segment of the show and the substitute content.
|
8. A receiving device comprising: a communication interface that receives a first audio/video stream including at least one segment of a show and at least one interstitial of the show, and that further receives supplemental data associated with the first audio/video stream, the supplemental data including closed captioning data associated with the first audio/video stream; a storage unit that stores the first audio/video stream and the supplemental data; control logic that: receives autonomous location information separately from the first audio/video stream, the autonomous location information that references the closed captioning data, the autonomous location information including a plurality of data segments, each comprising a displayable text string included within the closed captioning data as originally transmitted by a content provider; processes the closed captioning data recorded to locate a first video location corresponding with the presentation of a first of the plurality of data segments located in the closed captioning data recorded; determines that the first of the plurality of data segments is not located within the closed captioning data recorded; processes the closed captioning data recorded again to locate a second video location corresponding with the presentation of a second of the plurality of data segments in the closed captioning data recorded; identifies the boundaries of the at least one segment of the show based on the second video location and the autonomous location information; identifies substitute content based on the second video location and the autonomous location information to present in association with the at least one segment of the show; and an audio/video interface that outputs a second audio/video stream for presentation on a display device, the second audio/video stream including the at least one segment of the show and the substitute content. 9. The receiving device of claim 8 , wherein the control logic sorts the closed captioning data according to a presentation order of the closed captioning data and stores the sorted closed captioning data in a data file separate from the first audio/video stream.
| 0.598438 |
17. The improvement of claim 16 , further comprising: a blocker, the first bone anchor being located between the blocker and the spacer, the blocker located near the sleeve, the blocker being fixed to the tensioned cord.
|
17. The improvement of claim 16 , further comprising: a blocker, the first bone anchor being located between the blocker and the spacer, the blocker located near the sleeve, the blocker being fixed to the tensioned cord. 18. The improvement of claim 17 wherein the blocker is adjacent the first bone anchor.
| 0.965517 |
1. A system for recognizing speech, comprising: a plurality of microphones, wherein each of said plurality of microphones is configured to acquire speech input comprising a plurality of speech segments from at least one of a plurality of speakers; a speech data storage unit configured to store the acquired speech input comprising the plurality of speech segments; a speech recognition processing unit configured to: receive at least one signal comprising speech input acquired by at least one of the plurality of microphones; identify the plurality of speech segments in the at least one signal; recognize a speech in each of the plurality of speech segments to generate a character string for each of the plurality of speech segments; and identify which of the plurality of speakers spoke each of the plurality of speech segments; a text editing unit configured to edit at least one of the character strings generated by the speech recognition processing unit to generate at least one edited character string; and a speech correspondence estimation unit configured to determine to which of the plurality of speech segments the at least one edited character string corresponds, and to store data associating the at least one edited character string with its corresponding speech segment stored in the speech data storage unit.
|
1. A system for recognizing speech, comprising: a plurality of microphones, wherein each of said plurality of microphones is configured to acquire speech input comprising a plurality of speech segments from at least one of a plurality of speakers; a speech data storage unit configured to store the acquired speech input comprising the plurality of speech segments; a speech recognition processing unit configured to: receive at least one signal comprising speech input acquired by at least one of the plurality of microphones; identify the plurality of speech segments in the at least one signal; recognize a speech in each of the plurality of speech segments to generate a character string for each of the plurality of speech segments; and identify which of the plurality of speakers spoke each of the plurality of speech segments; a text editing unit configured to edit at least one of the character strings generated by the speech recognition processing unit to generate at least one edited character string; and a speech correspondence estimation unit configured to determine to which of the plurality of speech segments the at least one edited character string corresponds, and to store data associating the at least one edited character string with its corresponding speech segment stored in the speech data storage unit. 2. The system for recognizing speech according to claim 1 , wherein the character strings for each of the plurality of speakers each comprise text, and wherein the system further comprises an output control unit that reproduces the speech input corresponding to designated recognition data in the text, the recognition data being designated using at least one of the speech segments as a unit.
| 0.5888 |
1. A computer-implemented method for an online keyword auction, comprising: dividing, by one or more computing devices, a plurality of bidders for a keyword into a plurality of procurement sets of at least one pair of a bidder and a web page placement; obtaining, by the one or more computing devices, a procurement set from the plurality of procurement sets; determining, by the one or more computing devices, external competition exists for each bidder in the procurement set that also belongs to a set of at least one bidder closed under replacement; determining, by the one or more computing devices, internal competition exists for each bidder in the procurement set that does not also belong to the set of at least one bidder closed under replacement; obtaining, by the one or more computing devices, another procurement set from the plurality of procurement sets; determining, by the one or more computing devices, that external competition does not exist for each bidder in the another procurement set that also belongs to the set of at least one bidder closed under replacement; removing, by the one or more computing devices, each bidder in the another procurement set from buying the web page placement for display of an advertisement; charging, by the one or more computing devices, the at least one bidder in the procurement set for buying the web page placement for display of an advertisement; and updating, by the one or more computing devices, a reserve price for the keyword.
|
1. A computer-implemented method for an online keyword auction, comprising: dividing, by one or more computing devices, a plurality of bidders for a keyword into a plurality of procurement sets of at least one pair of a bidder and a web page placement; obtaining, by the one or more computing devices, a procurement set from the plurality of procurement sets; determining, by the one or more computing devices, external competition exists for each bidder in the procurement set that also belongs to a set of at least one bidder closed under replacement; determining, by the one or more computing devices, internal competition exists for each bidder in the procurement set that does not also belong to the set of at least one bidder closed under replacement; obtaining, by the one or more computing devices, another procurement set from the plurality of procurement sets; determining, by the one or more computing devices, that external competition does not exist for each bidder in the another procurement set that also belongs to the set of at least one bidder closed under replacement; removing, by the one or more computing devices, each bidder in the another procurement set from buying the web page placement for display of an advertisement; charging, by the one or more computing devices, the at least one bidder in the procurement set for buying the web page placement for display of an advertisement; and updating, by the one or more computing devices, a reserve price for the keyword. 9. The method of claim 1 wherein dividing the plurality of bidders for the keyword into the plurality of procurement sets of at least one pair of the bidder and the web page placement comprises matching a plurality of bidders for the keyword to a plurality of web page placements.
| 0.504313 |
9. A speaker adaptation system for speech models of a set of symbols presentable to a user during a speaker adaptation session, the system comprising: an unsupervised adaptation functionality for multi-word symbols of said set of symbols, limited to a set of words associated with each multi-word symbol; wherein said set of words includes words from more than one language; a supervised adaptation functionality for single word symbols of said set of symbols; and a model adapter which adapts at least a portion of said speech models from at least a portion of speech from said user.
|
9. A speaker adaptation system for speech models of a set of symbols presentable to a user during a speaker adaptation session, the system comprising: an unsupervised adaptation functionality for multi-word symbols of said set of symbols, limited to a set of words associated with each multi-word symbol; wherein said set of words includes words from more than one language; a supervised adaptation functionality for single word symbols of said set of symbols; and a model adapter which adapts at least a portion of said speech models from at least a portion of speech from said user. 10. A system according to claim 9 and comprising a symbol string generator which generates a series of symbols to be said, where a multi-word symbol is presented as a symbol.
| 0.595833 |
11. A method for controlling an alarm system, comprising: providing a packet data network interface port; communicating, by an automated controller, with security alarm sensors through a security alarm system interface port; receiving, by the automated controller, at least one input from the security alarm system interface port; processing, by the automated controller, the at least one input to determine an alarm condition; and communicating, by the automated controller, information defining a markup language interface comprising the alarm condition through the packet data network interface port.
|
11. A method for controlling an alarm system, comprising: providing a packet data network interface port; communicating, by an automated controller, with security alarm sensors through a security alarm system interface port; receiving, by the automated controller, at least one input from the security alarm system interface port; processing, by the automated controller, the at least one input to determine an alarm condition; and communicating, by the automated controller, information defining a markup language interface comprising the alarm condition through the packet data network interface port. 14. The method according to claim 11 , wherein the information defining the markup language interface comprises XML.
| 0.804965 |
11. An inference-based home network error handling method for handling an error in a home network system that includes a device, a network and a service, comprising: setting inference rules describing an inference range and standard for inferring an error type and a handling rule on the basis of information of an irregularity of the home network system; recognizing the irregularity; inferring the error type that indicates whether the recognized irregularity is an error of the device, an error of the network, or an error of the service, and inferring an error handing rule for correcting the inferred error type by applying the set inference rules; and providing a result of the inferring to a user and performing error handling according to a selection by the user.
|
11. An inference-based home network error handling method for handling an error in a home network system that includes a device, a network and a service, comprising: setting inference rules describing an inference range and standard for inferring an error type and a handling rule on the basis of information of an irregularity of the home network system; recognizing the irregularity; inferring the error type that indicates whether the recognized irregularity is an error of the device, an error of the network, or an error of the service, and inferring an error handing rule for correcting the inferred error type by applying the set inference rules; and providing a result of the inferring to a user and performing error handling according to a selection by the user. 12. The method of claim 11 , further comprising, before recognizing the irregularity, setting an error recognition rule describing an error recognition range and an error recognition standard for recognizing the irregularity-in the home network system, before the recognizing.
| 0.772484 |
2. The method recited in claim 1 , further comprising associating metadata with the one or more objects.
|
2. The method recited in claim 1 , further comprising associating metadata with the one or more objects. 3. The method recited in claim 2 , further comprising associating the at least one rating with the metadata.
| 0.930396 |
1. A method of continuous speech recognition including dynamic generation of a current language model and interpretation in a speech recognition system according to a current context comprising the following steps: a. associating with each of a plurality of speech rules, a context wherein each of said speech rules will be active: b. during initialization of said speech recognition system, determining common contexts for said plurality of speech rules, and partitioning said plurality of speech rules into a partition of speech rule sets according to said common contexts wherein each of said plurality of speech rules resides in only one of said speech rule sets of said partition; c. upon the detection of speech, determining said current context of said speech recognition system; d. determining all speech rule sets which each have a context matching said current context, and storing said matched speech rule sets as a context matched set of speech rules; e. dynamically generating a current language model from said context matched set of speech rules in said partition for use by a speech recognizer; f. said speech recognizer using said current language model to recognize words contained in said speech; and g. an interpreter using said context matched set of speech to interpret and perform actions according to said words recognized by said speech recognizer.
|
1. A method of continuous speech recognition including dynamic generation of a current language model and interpretation in a speech recognition system according to a current context comprising the following steps: a. associating with each of a plurality of speech rules, a context wherein each of said speech rules will be active: b. during initialization of said speech recognition system, determining common contexts for said plurality of speech rules, and partitioning said plurality of speech rules into a partition of speech rule sets according to said common contexts wherein each of said plurality of speech rules resides in only one of said speech rule sets of said partition; c. upon the detection of speech, determining said current context of said speech recognition system; d. determining all speech rule sets which each have a context matching said current context, and storing said matched speech rule sets as a context matched set of speech rules; e. dynamically generating a current language model from said context matched set of speech rules in said partition for use by a speech recognizer; f. said speech recognizer using said current language model to recognize words contained in said speech; and g. an interpreter using said context matched set of speech to interpret and perform actions according to said words recognized by said speech recognizer. 5. The method of claim 1 wherein said context associated with each of said plurality of speech rules comprises a primitive label.
| 0.534985 |
15. A computer-readable storage device having instructions stored which, when executed by a processor, cause the processor to perform operations comprising: receiving data corresponding to a text query from a user; retrieving, based on the text query, a spoken document; searching a word index of the spoken document associated with the text query using the text query, to yield first search results; searching a sub-word index of the spoken document associated with the text query using the text query, to yield second search results; and returning, via a computer network and according to the first search results and the second search results, audio segments from the spoken document associated with the text query which correspond to the text query.
|
15. A computer-readable storage device having instructions stored which, when executed by a processor, cause the processor to perform operations comprising: receiving data corresponding to a text query from a user; retrieving, based on the text query, a spoken document; searching a word index of the spoken document associated with the text query using the text query, to yield first search results; searching a sub-word index of the spoken document associated with the text query using the text query, to yield second search results; and returning, via a computer network and according to the first search results and the second search results, audio segments from the spoken document associated with the text query which correspond to the text query. 16. The computer-readable storage device of claim 15 , having additional instructions stored which result in operations comprising combining the first search results and the second search results to yield combined results.
| 0.529709 |
14. A system directed to generating queries with an arbitrary number of input streams from a generic query template, comprising: a database; a data stream management system; a query manager; a processor, wherein the processor performs the steps of: sending a selected generic query template and at least one entered query input stream to the query manger, wherein the generic query template includes at least one predefined query string having placeholders at designated alterable field of the generic query, each placeholder of the generic query template having a mandatory designation or an optional designation; registering, with the query manager, the selected generic query template and the at least one entered query input stream; generating, with the query manager, at least one query output stream based on the registered generic query template and the at least one registered query input stream; loading, with the query manager, the registered generic query template with the at least one query output stream and the at least one registered query input stream; parsing, with the query manager, the loaded generic query template, comprising: retrieving, with the query manager, a query template orchestration configuration of the loaded generic query template from the database; and upon determining, with the query manager, that instructions are available in the query template orchestration configuration, executing, with the query manager, the instructions in the query template orchestration configuration, wherein each step of the instructions is executed for each of the at least one query input stream; forming a deployable query for instantiation within the data stream management system from substituting, within the query manager, the placeholders with the at least one query output stream and the at least one registered query input stream; and deploying the deployable query within the data stream management system for application against stream data.
|
14. A system directed to generating queries with an arbitrary number of input streams from a generic query template, comprising: a database; a data stream management system; a query manager; a processor, wherein the processor performs the steps of: sending a selected generic query template and at least one entered query input stream to the query manger, wherein the generic query template includes at least one predefined query string having placeholders at designated alterable field of the generic query, each placeholder of the generic query template having a mandatory designation or an optional designation; registering, with the query manager, the selected generic query template and the at least one entered query input stream; generating, with the query manager, at least one query output stream based on the registered generic query template and the at least one registered query input stream; loading, with the query manager, the registered generic query template with the at least one query output stream and the at least one registered query input stream; parsing, with the query manager, the loaded generic query template, comprising: retrieving, with the query manager, a query template orchestration configuration of the loaded generic query template from the database; and upon determining, with the query manager, that instructions are available in the query template orchestration configuration, executing, with the query manager, the instructions in the query template orchestration configuration, wherein each step of the instructions is executed for each of the at least one query input stream; forming a deployable query for instantiation within the data stream management system from substituting, within the query manager, the placeholders with the at least one query output stream and the at least one registered query input stream; and deploying the deployable query within the data stream management system for application against stream data. 15. The system of claim 14 , wherein the placeholders include at least one of an input stream placeholder, an output stream placeholder, a parameter placeholder and an input placeholder, wherein the input stream placeholder is substituted with the at least one registered query input stream, the output stream placeholder is substituted with the at least one query output stream, the parameter placeholder is substituted with a mathematical comparative operator expression, and the input placeholder is substituted with a query template segment or the input stream placeholder.
| 0.5 |
5. The system according to claim 3 , wherein said template manager has means for customizing navigation between said plurality of customized template based data entry screens.
|
5. The system according to claim 3 , wherein said template manager has means for customizing navigation between said plurality of customized template based data entry screens. 6. The system according to claim 5 , additionally comprising a portable printer for printing out said natural language report.
| 0.928745 |
13. The computer system of claim 12 , said capturing said semantic metadata comprising: determining whether said received heterogeneous data utilizes a standardized syntax; if having determined that said received heterogeneous data utilizes the standardized syntax, then retrieving from a library a syntactic metadata template corresponding to said syntactic metadata associated with said received heterogeneous data; if having determined that said received heterogeneous data does not utilize the standardized syntax, then receiving at least one syntax response from an end user and storing in said library said at least one syntax response as a unique syntactic metadata template.
|
13. The computer system of claim 12 , said capturing said semantic metadata comprising: determining whether said received heterogeneous data utilizes a standardized syntax; if having determined that said received heterogeneous data utilizes the standardized syntax, then retrieving from a library a syntactic metadata template corresponding to said syntactic metadata associated with said received heterogeneous data; if having determined that said received heterogeneous data does not utilize the standardized syntax, then receiving at least one syntax response from an end user and storing in said library said at least one syntax response as a unique syntactic metadata template. 14. The computer system of claim 13 , wherein said determining determines that said received heterogeneous data utilizes the standardized syntax, wherein each response of said at least one syntax response corresponds to a unique question of at least one syntax question sent to the end user, and wherein each question of said at least one syntax question relates to syntactic attributes of said received heterogeneous data.
| 0.836096 |
10. The method of claim 1 , wherein the analyzing the past non-threaded emails or documents comprises: creating a database, which is a running log of messages sent, a record of to whom the messages were sent, messages received, and a record of from whom the messages were received, the database comprising a correlation table comprising: corresponding values for the messages sent and the messages received that are considered similar in subject matter; and one or more uncommon words that appear within the messages sent and the messages received; wherein the corresponding repeatable values for the messages sent and the messages received are the corresponding values in the context index.
|
10. The method of claim 1 , wherein the analyzing the past non-threaded emails or documents comprises: creating a database, which is a running log of messages sent, a record of to whom the messages were sent, messages received, and a record of from whom the messages were received, the database comprising a correlation table comprising: corresponding values for the messages sent and the messages received that are considered similar in subject matter; and one or more uncommon words that appear within the messages sent and the messages received; wherein the corresponding repeatable values for the messages sent and the messages received are the corresponding values in the context index. 11. The method of claim 10 , wherein the database is derived by a combination of (i) preset list of the one or more uncommon words that are known and (ii) a real-time analysis of the messages and a related frequency of words in the messages in which a threshold percentage of usage defines targets for comparison.
| 0.818848 |
23. At a computer system in a Web Services environment, a computer program product for implementing a method of assisting a user in generating a more secure policy document by providing a rule-based tool that automatically selects security conditions for the user's general security criteria such that the user does not have exposure to all security details, the computer program product comprising one or more computer readable storage media having stored thereon computer executable instructions that, when executed by a processor, can cause the messaging system to perform: at a generation phase of the secure policy document: present a set of Web Service security options to a user at a user interface, which abstracts the user from any specific code that will be generated for a secure policy document that satisfies one or more of the set of Web Service security options, the set of Web Service security options including at least an option for communicating using a secure conversation and an option for communicating without using a secure conversation; receive user input selecting a general security criteria from the set of Web Service security options presented, the general security criteria being the option for communicating using a secure conversation; based on the received user input selecting the option for communicating using a secure conversation, access one or more security rules from a repository of extensible security metadata, the one or more security rules corresponding to the general security criteria and relating to client authentication tokens; present a set of Web Service client authentication token options to the user at the user interface, which abstracts the user from any specific code that will be generated for the secure policy document that satisfies one or more of the set of Web Service client authentication tokens to the user at the user interface; receive user input selecting one option from the set of Web Service client authentication token options; based on the received user input select one option from the set of Web Service client authentication token options, accessing one or more security rules from the repository of extensible security metadata, the one or more security rules corresponding to the Web Service client authentication token options and providing more specific rules for implementing the selected option from the set of Web Service client authentication token options; determining whether the secure policy document is a client policy document or a service policy document; and use the one or more security rules corresponding to the general security criteria and to the selected one option to generate the secure policy document in accordance with the general security criteria and the selected one option, wherein generating the secure policy document includes automatically selecting specific security conditions that enforce the general security criteria and selected one option input by the user, and wherein the security conditions that are more specific than the general security criteria and the selected one option input by the user are applied based whether the secure policy document is determined to be a client policy document or a service policy document, such that different one or more security rules are applied in creating the secure policy document when the secure policy document is a client policy document as compared to when the secure policy document is a service policy document.
|
23. At a computer system in a Web Services environment, a computer program product for implementing a method of assisting a user in generating a more secure policy document by providing a rule-based tool that automatically selects security conditions for the user's general security criteria such that the user does not have exposure to all security details, the computer program product comprising one or more computer readable storage media having stored thereon computer executable instructions that, when executed by a processor, can cause the messaging system to perform: at a generation phase of the secure policy document: present a set of Web Service security options to a user at a user interface, which abstracts the user from any specific code that will be generated for a secure policy document that satisfies one or more of the set of Web Service security options, the set of Web Service security options including at least an option for communicating using a secure conversation and an option for communicating without using a secure conversation; receive user input selecting a general security criteria from the set of Web Service security options presented, the general security criteria being the option for communicating using a secure conversation; based on the received user input selecting the option for communicating using a secure conversation, access one or more security rules from a repository of extensible security metadata, the one or more security rules corresponding to the general security criteria and relating to client authentication tokens; present a set of Web Service client authentication token options to the user at the user interface, which abstracts the user from any specific code that will be generated for the secure policy document that satisfies one or more of the set of Web Service client authentication tokens to the user at the user interface; receive user input selecting one option from the set of Web Service client authentication token options; based on the received user input select one option from the set of Web Service client authentication token options, accessing one or more security rules from the repository of extensible security metadata, the one or more security rules corresponding to the Web Service client authentication token options and providing more specific rules for implementing the selected option from the set of Web Service client authentication token options; determining whether the secure policy document is a client policy document or a service policy document; and use the one or more security rules corresponding to the general security criteria and to the selected one option to generate the secure policy document in accordance with the general security criteria and the selected one option, wherein generating the secure policy document includes automatically selecting specific security conditions that enforce the general security criteria and selected one option input by the user, and wherein the security conditions that are more specific than the general security criteria and the selected one option input by the user are applied based whether the secure policy document is determined to be a client policy document or a service policy document, such that different one or more security rules are applied in creating the secure policy document when the secure policy document is a client policy document as compared to when the secure policy document is a service policy document. 32. The computer program product of claim 23 , wherein the general security criteria and the one or more security rules are first stored in memory as data structures that include policy objects representing the general security criteria and the one or more security rules, the computer program product further comprising executable instruction that cause the messaging system to perform the following: receive user input to generate the secure policy document; and translate the data structures from policy objects to coded language for generating the secure policy document.
| 0.5 |
2. The method according to claim 1 wherein the step of incorporating symbols comprises: generating the public symbols table in the relational schema for public symbols in the changed program code file, the public symbols being symbols having a definition in the changed program code file; and generating the referenced symbols table in the relational schema for referenced symbols in the changed program code file, the referenced symbols being only referred to in the changed program code file.
|
2. The method according to claim 1 wherein the step of incorporating symbols comprises: generating the public symbols table in the relational schema for public symbols in the changed program code file, the public symbols being symbols having a definition in the changed program code file; and generating the referenced symbols table in the relational schema for referenced symbols in the changed program code file, the referenced symbols being only referred to in the changed program code file. 3. The method according to claim 2 wherein the step of generating the public symbols table comprises: locating public symbols in the changed program code file; and adding the located public symbols to the public symbols table; and wherein the step of generating the referenced symbols table comprises: locating referenced symbols in the changed program code file; and adding the located referenced symbols to the referenced symbols table.
| 0.808769 |
10. An apparatus comprising: one or more processors; and a memory, coupled to the one or more processors, and storing code therein that is executable by the one or more processors for: receiving clinician note data in a first electronic system that includes patient medical-related data; processing the clinician note data using a natural language data processor and medical record interpretation rules to automatically convert the clinician note data into an electronic medical record; sending the electronic medical record to a second electronic system to allow review and modification of the converted clinician note data in the electronic medical record; receiving feedback data in the first electronic system that indicates modifications to the converted clinician note data in the electronic medical record; processing the feedback data to identify modifications to the converted clinician note data in the electronic medical record; analyzing the modifications in the feedback data to determine whether to modify the medical record interpretation rules; and modifying the medical record interpretation rules in accordance with at least a portion of the feedback data for use in processing subsequently received clinician note data if analysis of the modifications in the feedback data determines to modify the medical record interpretation rules.
|
10. An apparatus comprising: one or more processors; and a memory, coupled to the one or more processors, and storing code therein that is executable by the one or more processors for: receiving clinician note data in a first electronic system that includes patient medical-related data; processing the clinician note data using a natural language data processor and medical record interpretation rules to automatically convert the clinician note data into an electronic medical record; sending the electronic medical record to a second electronic system to allow review and modification of the converted clinician note data in the electronic medical record; receiving feedback data in the first electronic system that indicates modifications to the converted clinician note data in the electronic medical record; processing the feedback data to identify modifications to the converted clinician note data in the electronic medical record; analyzing the modifications in the feedback data to determine whether to modify the medical record interpretation rules; and modifying the medical record interpretation rules in accordance with at least a portion of the feedback data for use in processing subsequently received clinician note data if analysis of the modifications in the feedback data determines to modify the medical record interpretation rules. 16. The apparatus of claim 10 wherein the medical record interpretation rules are customized in accordance to a member of a group consisting of: an individual clinician, a clinician's medical specialty, an individual patient, a patient's demographics, a medical facility, and a medical facility location.
| 0.684699 |
13. The computer-implemented method of claim 6 , wherein: the source graph comprises a supplemental graph comprising a plurality of supplemental objects; and the object selected from the source graph is a supplemental object corresponding to the second speaker.
|
13. The computer-implemented method of claim 6 , wherein: the source graph comprises a supplemental graph comprising a plurality of supplemental objects; and the object selected from the source graph is a supplemental object corresponding to the second speaker. 14. The computer-implemented method of claim 13 , wherein the supplemental object corresponding to the second speaker is selected based at least in part on a user profile.
| 0.896751 |
1. A method comprising: receiving, via an interactive turn-taking spoken dialog system speech from a user as part of a conversation with the interactive turn-taking spoken dialog system, wherein the speech comprises at least two words; performing a partial speech recognition prior to completion of the speech by: identifying a starting point associated with the speech, the starting point being at a first time; identifying content of the speech received between the first time and a second time, to yield identified content; identifying an intermediary end point associated with the speech corresponding to the second time, wherein the intermediary end point is a pinch node in a content lattice; and returning, via the interactive turn-taking spoken dialog system, a partial recognition of the identified content based on the starting point and the intermediary end point to yield partially recognized speech, wherein the partial recognition is based on a stability of the identified content between the starting point and the intermediary end point, the stability being based on a stability probability determined using a machine learning algorithm on a corpus of speech utterances; and presenting, via the interactive turn-taking spoken dialog system, the user with a response to the partially recognized speech.
|
1. A method comprising: receiving, via an interactive turn-taking spoken dialog system speech from a user as part of a conversation with the interactive turn-taking spoken dialog system, wherein the speech comprises at least two words; performing a partial speech recognition prior to completion of the speech by: identifying a starting point associated with the speech, the starting point being at a first time; identifying content of the speech received between the first time and a second time, to yield identified content; identifying an intermediary end point associated with the speech corresponding to the second time, wherein the intermediary end point is a pinch node in a content lattice; and returning, via the interactive turn-taking spoken dialog system, a partial recognition of the identified content based on the starting point and the intermediary end point to yield partially recognized speech, wherein the partial recognition is based on a stability of the identified content between the starting point and the intermediary end point, the stability being based on a stability probability determined using a machine learning algorithm on a corpus of speech utterances; and presenting, via the interactive turn-taking spoken dialog system, the user with a response to the partially recognized speech. 3. The method of claim 1 , training the machine learning algorithm to perform stability determinations by: performing recognition on the corpus of speech utterances to yield a respective partial result for each speech utterance in the corpus; and determining, using the machine learning algorithm, whether the respective partial result is one of stable or unstable.
| 0.503654 |
10. A method for multi-lingual networking and communication, comprising: at a first mobile device having a GPS-enabled map function and a screen: a) receiving individualized information corresponding to a plurality of members in a social network, wherein the individualized information comprises at least each member's location, each member's preferred language, whether or not each member is logged in, and one or more elements of each member's biographical information; b) using the GPS-enabled map function to display an interactive map configured to enable a user to select an area of the interactive map, wherein the user is a member of the social network; c) receiving a user selection of an area of the interactive map; d) displaying any logged-in member having a GPS location within the user-selected area of the interactive map; e) receiving a user selection of at least one member within the user-selected area of the interactive map, wherein the user selection of at least one member designates at least one selected member; f) receiving a user input from the user, wherein the user input is configured to communicate a desire to directly engage at least one selected member in communication, wherein the at least one selected member is not the user; g) transmitting the user input to a cloud-based server; h) receiving at least one selected member input in response to the user input; and i) automatically displaying each of the at least one selected member input on the user's mobile device screen in the user's preferred language; and at a cloud-based server: a) receiving the user input; b) translating the user input into a translated user input, wherein the translated user input comprises the user input translated into the preferred language of each of the at least one selected member; c) transmitting the translated user input to at least one second mobile device associated with one of the at least one selected member; d) receiving at least one selected member input; e) translating the at least one selected member input into at least one translated selected member input, wherein the at least one translated selected member input comprises the at least one selected member input translated into the preferred language of the user; and f) transmitting the at least one translated selected member input to the first mobile device; and at at least one second mobile device having a screen: a) receiving the at least one translated user input from the cloud-based server; b) displaying the at least one translated user input on the second mobile device screen; c) receiving at least one selected member input, wherein the at least one selected member input comprises at least one response entered in the preferred language of the at least one selected member; and d) transmitting the at least one selected member input to the cloud-based server.
|
10. A method for multi-lingual networking and communication, comprising: at a first mobile device having a GPS-enabled map function and a screen: a) receiving individualized information corresponding to a plurality of members in a social network, wherein the individualized information comprises at least each member's location, each member's preferred language, whether or not each member is logged in, and one or more elements of each member's biographical information; b) using the GPS-enabled map function to display an interactive map configured to enable a user to select an area of the interactive map, wherein the user is a member of the social network; c) receiving a user selection of an area of the interactive map; d) displaying any logged-in member having a GPS location within the user-selected area of the interactive map; e) receiving a user selection of at least one member within the user-selected area of the interactive map, wherein the user selection of at least one member designates at least one selected member; f) receiving a user input from the user, wherein the user input is configured to communicate a desire to directly engage at least one selected member in communication, wherein the at least one selected member is not the user; g) transmitting the user input to a cloud-based server; h) receiving at least one selected member input in response to the user input; and i) automatically displaying each of the at least one selected member input on the user's mobile device screen in the user's preferred language; and at a cloud-based server: a) receiving the user input; b) translating the user input into a translated user input, wherein the translated user input comprises the user input translated into the preferred language of each of the at least one selected member; c) transmitting the translated user input to at least one second mobile device associated with one of the at least one selected member; d) receiving at least one selected member input; e) translating the at least one selected member input into at least one translated selected member input, wherein the at least one translated selected member input comprises the at least one selected member input translated into the preferred language of the user; and f) transmitting the at least one translated selected member input to the first mobile device; and at at least one second mobile device having a screen: a) receiving the at least one translated user input from the cloud-based server; b) displaying the at least one translated user input on the second mobile device screen; c) receiving at least one selected member input, wherein the at least one selected member input comprises at least one response entered in the preferred language of the at least one selected member; and d) transmitting the at least one selected member input to the cloud-based server. 17. The method of claim 10 , further comprising the step of, at the first mobile device: caching at least one translated selected member input.
| 0.53507 |
33. A method of fitting graphical objects within a plurality of separate graphical frames in a document, each frame being associated with at least one fitting attribute with a value for fitting one or more of the graphical objects in the frame, comprising: using an algorithm to automatically determine a common scaling factor for the value of the at least one fitting attribute in each of the separate frames; and applying the common scaling factor to scale at least one value in each frame of the plurality of separate graphical frames to fit one or more of the graphical objects in each of the frames, wherein said applying modifies the size of at least one graphical object in each of the plurality of separate graphical frames, wherein said applying is performed without modifying the size of the frames of said plurality of separate graphical frames, wherein at least one of the scaled values is different than another one of the scaled values.
|
33. A method of fitting graphical objects within a plurality of separate graphical frames in a document, each frame being associated with at least one fitting attribute with a value for fitting one or more of the graphical objects in the frame, comprising: using an algorithm to automatically determine a common scaling factor for the value of the at least one fitting attribute in each of the separate frames; and applying the common scaling factor to scale at least one value in each frame of the plurality of separate graphical frames to fit one or more of the graphical objects in each of the frames, wherein said applying modifies the size of at least one graphical object in each of the plurality of separate graphical frames, wherein said applying is performed without modifying the size of the frames of said plurality of separate graphical frames, wherein at least one of the scaled values is different than another one of the scaled values. 47. The method of claim 33 , wherein the algorithm excludes fitting of graphical objects having a determined style.
| 0.660151 |
34. A system, comprising: a computer memory; at least one hardware processor interoperably coupled with the computer memory configured with: particular code that corresponds to a first module selectively designated for inclusion in a personalized container document, wherein the particular code provides parameters associated with the first module for use in generating module data for the first module, wherein the module data for the first module is adapted for use in the personalized container document, the parameters of the particular code including a first content element and one or more preference elements; additional code that specifies a second module selectively designated for inclusion in the personalized container document, wherein the additional code provides parameters associated with the second module for use in generating module data for the second module, wherein the module data for the second module is adapted for use in the personalized container document, the parameters of the additional code including a second content element; wherein the personalized container document defines an organization for a presentation of content associated with the first module and the second module in a container document display, wherein for each module a portion of the container document display is allocated for the presentation of content corresponding to the module; wherein module data for each module designated for inclusion in the container document is adapted to be served with the container document to a remote browser client, the module data for each module including computer-executable instructions executed on a hardware processor by a remote browser client to render content for the module for presentation in the container document display; and wherein the first content element is different than the second content element and the one or more preference elements include at least one module preference element adapted to specify at least two alternative presentation states of content for the first module, the at least one module preference element defining conditions that change independent of user input in the container document display for dynamically presenting content in one of the at least two presentation states, with content rendered, using the computer-executable instructions executed by the remote browser client, in a first of the at least two presentation states in response to a first condition and rendered, using the computer-executable instructions executed by the remote browser client, in a second of the at least two presentation states in response to a second condition.
|
34. A system, comprising: a computer memory; at least one hardware processor interoperably coupled with the computer memory configured with: particular code that corresponds to a first module selectively designated for inclusion in a personalized container document, wherein the particular code provides parameters associated with the first module for use in generating module data for the first module, wherein the module data for the first module is adapted for use in the personalized container document, the parameters of the particular code including a first content element and one or more preference elements; additional code that specifies a second module selectively designated for inclusion in the personalized container document, wherein the additional code provides parameters associated with the second module for use in generating module data for the second module, wherein the module data for the second module is adapted for use in the personalized container document, the parameters of the additional code including a second content element; wherein the personalized container document defines an organization for a presentation of content associated with the first module and the second module in a container document display, wherein for each module a portion of the container document display is allocated for the presentation of content corresponding to the module; wherein module data for each module designated for inclusion in the container document is adapted to be served with the container document to a remote browser client, the module data for each module including computer-executable instructions executed on a hardware processor by a remote browser client to render content for the module for presentation in the container document display; and wherein the first content element is different than the second content element and the one or more preference elements include at least one module preference element adapted to specify at least two alternative presentation states of content for the first module, the at least one module preference element defining conditions that change independent of user input in the container document display for dynamically presenting content in one of the at least two presentation states, with content rendered, using the computer-executable instructions executed by the remote browser client, in a first of the at least two presentation states in response to a first condition and rendered, using the computer-executable instructions executed by the remote browser client, in a second of the at least two presentation states in response to a second condition. 39. The system of claim 34 wherein the one or more preference elements specify one or more user preferences.
| 0.527309 |
11. A non-transitory computer readable storage medium storing executable program instructions, which, when executed by an electronic device with one or more processors, memory, and a touch-sensitive display, cause the electronic device to: receiving data relating to at least one of device movement and device proximity; receive a touch input at a location on the touch-sensitive display; process the received data relating to the at least one of device movement and device proximity to determine whether the electronic device is in one of a first or second state based on the received data relating to at least one of device movement and device proximity; if it is determined that the electronic device is in the first state, process the touch input, including determining the location the touch input was received on the touch-sensitive display, and performing a function associated with the location of the processed touch input; and if it is determined that the electronic device is in the second state, process the touch input, including determining the location the touch input was received on the touch-sensitive display, and forgoing the function associated with the location of the processed touch input.
|
11. A non-transitory computer readable storage medium storing executable program instructions, which, when executed by an electronic device with one or more processors, memory, and a touch-sensitive display, cause the electronic device to: receiving data relating to at least one of device movement and device proximity; receive a touch input at a location on the touch-sensitive display; process the received data relating to the at least one of device movement and device proximity to determine whether the electronic device is in one of a first or second state based on the received data relating to at least one of device movement and device proximity; if it is determined that the electronic device is in the first state, process the touch input, including determining the location the touch input was received on the touch-sensitive display, and performing a function associated with the location of the processed touch input; and if it is determined that the electronic device is in the second state, process the touch input, including determining the location the touch input was received on the touch-sensitive display, and forgoing the function associated with the location of the processed touch input. 12. The non-transitory computer readable storage medium of claim 11 , wherein the data relating to device proximity represents at least one of a distance and a rate of change of distance.
| 0.573677 |
14. A computer program product stored on a computer storage device, the product for generating a poet personality to configure a processor to: analyze a plurality of poems, each of the poems containing a plurality of words; generate a plurality of analysis models, each of said analysis models representing one of said plurality of poems; receive for the words in the poems rhyme numbers, with words that rhyme with each other having the same rhyme number; generate a data structure that specifies n-grams found in the text, with each analysis model having a set of weights, bigram, trigram and quadgram exponents; and store in computer storage the plurality of analysis models in a personality data structure including a set of parameters that control poetry generation using the personality data structure.
|
14. A computer program product stored on a computer storage device, the product for generating a poet personality to configure a processor to: analyze a plurality of poems, each of the poems containing a plurality of words; generate a plurality of analysis models, each of said analysis models representing one of said plurality of poems; receive for the words in the poems rhyme numbers, with words that rhyme with each other having the same rhyme number; generate a data structure that specifies n-grams found in the text, with each analysis model having a set of weights, bigram, trigram and quadgram exponents; and store in computer storage the plurality of analysis models in a personality data structure including a set of parameters that control poetry generation using the personality data structure. 18. The program of claim 14 wherein the program further configures the processing unit to: define values of weight for each of a bigram, trigram and quadgram structures for an author within the personality data structure; and define values of exponents for each of a bigram, trigram and quadgram structures for an author within the poet personality.
| 0.5 |
19. The system of claim 18 , further comprising: means for generating term vectors representative of each of the refinement query suggestions.
|
19. The system of claim 18 , further comprising: means for generating term vectors representative of each of the refinement query suggestions. 20. The system of claim 19 , where the means for generating the term vectors further comprises: means for performing a search to identify a document based on the identified particular refinement query suggestion; and means for generating the term vectors representing the document.
| 0.94895 |
15. A method for imaging and managing documents, comprising the steps of: creating a document profile associated with a document before the document is imaged, the document profile unique to the document and including at least a document key unique to the document; storing the document profile and the document key unique to the document before the document is imaged; printing a coversheet including a computer-readable identifier thereon before the document is imaged, wherein the at least one computer readable identifier is indicative of the document key; imaging the document and the printed coversheet, wherein the coversheet includes the at least one computer-readable identifier thereon; interpreting the identifier from the coversheet to match the document to the stored document profile based on the document key; monitoring imaged documents received by the system and pending document keys for which document profiles have been created to detect unmatched imaged documents and unmatched pending document keys, wherein the document is routed to an error storage if the imaged document is received but not matched to the document key.
|
15. A method for imaging and managing documents, comprising the steps of: creating a document profile associated with a document before the document is imaged, the document profile unique to the document and including at least a document key unique to the document; storing the document profile and the document key unique to the document before the document is imaged; printing a coversheet including a computer-readable identifier thereon before the document is imaged, wherein the at least one computer readable identifier is indicative of the document key; imaging the document and the printed coversheet, wherein the coversheet includes the at least one computer-readable identifier thereon; interpreting the identifier from the coversheet to match the document to the stored document profile based on the document key; monitoring imaged documents received by the system and pending document keys for which document profiles have been created to detect unmatched imaged documents and unmatched pending document keys, wherein the document is routed to an error storage if the imaged document is received but not matched to the document key. 25. The method according to claim 15 , wherein the step of interpreting the identifier includes comparing the document key to a group of pending document keys.
| 0.686599 |
7. A computerized method for processing historical vehicle replacement part database queries, the computerized method comprising: receiving input data at a data preprocessing unit, the input data including a digital representation of vehicle parts in a supplier's vehicle parts inventory; preprocessing the input data using the data preprocessing unit to generate historical vehicle replacement part database records each corresponding to one of the vehicle parts in the supplier's vehicle parts inventory, the preprocessing including converting part name and description information for each part into a unique part identifier associated with each part record to permit location of a part record using translation of the part name and description information into a corresponding part identifier; storing each historical vehicle replacement part database record in a database system using a database server coupled to the data preprocessing unit; receiving a user query at a web server, the user query being transmitted by a responding party client system, the user query having data corresponding to information contained in a subrogation claim received from a demanding party, different from the responding party, the user query data including a first vehicle parts list, a vehicle make, model and year, a historical date, and a geographic area of interest; transmitting the user query to an application server coupled to the web server by a data network, the application server being programmed to connect operatively to the database server and to the web server over the data network; generating a database query comprising information from the user query and information from a rule set, the database query being generated by the application server; querying, at the application server, the database system by sending the database query to the database server; receiving a database query result from the database server at the application server, the database query result being responsive to the querying, the database query result including a second list of vehicle parts matching the database query, the second list of vehicle parts including those parts corresponding to the parts in the first vehicle parts list and which are suitable for use on the vehicle make, model and year and which were available on the historical date, were located within the geographic area of interest, and which conform to a rule set; verifying automatically, at the application server, the accuracy of the subrogation claim by comparing the database query result with the subrogation claim information to generate a subrogation claim accuracy verification result; generating automatically, at the application server, an independent subrogation claim value based only on the subrogation claim accuracy verification result; generating dynamic content for transmitting to the client system using the application server, the dynamic content including a portion of the database query result and the independent subrogation claim value; and transmitting the dynamic content to the client system in response to the user query received from the client over an external communication link.
|
7. A computerized method for processing historical vehicle replacement part database queries, the computerized method comprising: receiving input data at a data preprocessing unit, the input data including a digital representation of vehicle parts in a supplier's vehicle parts inventory; preprocessing the input data using the data preprocessing unit to generate historical vehicle replacement part database records each corresponding to one of the vehicle parts in the supplier's vehicle parts inventory, the preprocessing including converting part name and description information for each part into a unique part identifier associated with each part record to permit location of a part record using translation of the part name and description information into a corresponding part identifier; storing each historical vehicle replacement part database record in a database system using a database server coupled to the data preprocessing unit; receiving a user query at a web server, the user query being transmitted by a responding party client system, the user query having data corresponding to information contained in a subrogation claim received from a demanding party, different from the responding party, the user query data including a first vehicle parts list, a vehicle make, model and year, a historical date, and a geographic area of interest; transmitting the user query to an application server coupled to the web server by a data network, the application server being programmed to connect operatively to the database server and to the web server over the data network; generating a database query comprising information from the user query and information from a rule set, the database query being generated by the application server; querying, at the application server, the database system by sending the database query to the database server; receiving a database query result from the database server at the application server, the database query result being responsive to the querying, the database query result including a second list of vehicle parts matching the database query, the second list of vehicle parts including those parts corresponding to the parts in the first vehicle parts list and which are suitable for use on the vehicle make, model and year and which were available on the historical date, were located within the geographic area of interest, and which conform to a rule set; verifying automatically, at the application server, the accuracy of the subrogation claim by comparing the database query result with the subrogation claim information to generate a subrogation claim accuracy verification result; generating automatically, at the application server, an independent subrogation claim value based only on the subrogation claim accuracy verification result; generating dynamic content for transmitting to the client system using the application server, the dynamic content including a portion of the database query result and the independent subrogation claim value; and transmitting the dynamic content to the client system in response to the user query received from the client over an external communication link. 10. The computerized method of claim 7 , wherein the historical date includes a historical date range.
| 0.9551 |
1. A system for use in adaptively updating template candidate order sets, comprising: a repository of information comprising a plurality of candidate order sets individually including a plurality of candidate items for order and associated corresponding related order parameters, an individual item for order being associated with a plurality of related order parameters; a data entry monitor for monitoring user selection of candidate items from a candidate order set acquired from said repository and recording candidate item usage data identifying items selected by a user for order from individual particular candidate order sets for a plurality of different candidate order sets; and a data processor device for determining from the recorded candidate item usage data parameters comprising at least one of, (a) data indicative of the number or proportion of candidate items of a particular candidate order set that were selected by a user during order entry and (b) data indicative of the number or proportion of candidate items of a particular candidate order set that were not selected by a user during order entry, said data processor device automatically identifies, based on the determined parameters, a candidate order set from the plurality of candidate order sets to be updated.
|
1. A system for use in adaptively updating template candidate order sets, comprising: a repository of information comprising a plurality of candidate order sets individually including a plurality of candidate items for order and associated corresponding related order parameters, an individual item for order being associated with a plurality of related order parameters; a data entry monitor for monitoring user selection of candidate items from a candidate order set acquired from said repository and recording candidate item usage data identifying items selected by a user for order from individual particular candidate order sets for a plurality of different candidate order sets; and a data processor device for determining from the recorded candidate item usage data parameters comprising at least one of, (a) data indicative of the number or proportion of candidate items of a particular candidate order set that were selected by a user during order entry and (b) data indicative of the number or proportion of candidate items of a particular candidate order set that were not selected by a user during order entry, said data processor device automatically identifies, based on the determined parameters, a candidate order set from the plurality of candidate order sets to be updated. 11. A system according to claim 1 , including an update processor for updating an the identified candidate order set by at least one of, (a) removing a candidate item, (b) adding a candidate item and (c) modifying a candidate item.
| 0.531205 |
23. The method of claim 15 further comprising determining a combined relevancy score associated with the entity based on the term aggregate relevancy score and at least one additional factor.
|
23. The method of claim 15 further comprising determining a combined relevancy score associated with the entity based on the term aggregate relevancy score and at least one additional factor. 24. The method of claim 23 , wherein the at least one additional factor comprises TFIDF.
| 0.937228 |
1. A computer-implemented method comprising: receiving, by a speech recognition model training system and from a client device, a request to generate a new speech recognition model for the client device, wherein the request includes: (i) one or more features extracted from speech data by a feature extractor on the client device, and (ii) metadata regarding the speech recognition model to be generated; generating, by the speech recognition model training system and using the one or more features extracted from speech data by the feature extractor on the client device, the new speech recognition model according to the metadata; and transmitting, by the speech recognition model training system and to the client device, at least a portion of the new speech recognition model.
|
1. A computer-implemented method comprising: receiving, by a speech recognition model training system and from a client device, a request to generate a new speech recognition model for the client device, wherein the request includes: (i) one or more features extracted from speech data by a feature extractor on the client device, and (ii) metadata regarding the speech recognition model to be generated; generating, by the speech recognition model training system and using the one or more features extracted from speech data by the feature extractor on the client device, the new speech recognition model according to the metadata; and transmitting, by the speech recognition model training system and to the client device, at least a portion of the new speech recognition model. 9. The method of claim 1 , wherein generating a new speech recognition model includes updating an existing speech recognition model.
| 0.65221 |
6. A data processing system for hybrid push/pull of continuous structured query language queries, the data processing system comprising: a bus; a memory connected to the bus, wherein the memory comprises computer executable instructions; a communication unit connected to the bus; a database connected to the bus; a processor unit connected to the bus, wherein the processor unit executes the computer executable instructions to direct the data processing system to: receive stream input, wherein the stream input comprises events of interest; build stream plans based on an original query from the stream input and a state machine, wherein building stream plans comprises splitting the original query into a push sub-query and a pull sub-query, and wherein the pull sub-query represents a portion of the original query from the stream input and the push sub-query represents a remaining portion of the original query from the stream input; replicate the stream input, wherein replicating the stream input comprises copying the stream input to produce a set of input streams, wherein one of the set of input streams is directed to a database and one of the set of input streams is directed to the state machine; responsive to a push sub-query trigger, determine whether a pattern of the push sub-query matches an event in the one of the set of input streams directed to the state machine to form a pattern match and create the push sub-query trigger in response to the pattern match, wherein the pattern match causes submit of the pull sub-query to execute against accumulated data in the database to produce a result; and send the result to a requestor.
|
6. A data processing system for hybrid push/pull of continuous structured query language queries, the data processing system comprising: a bus; a memory connected to the bus, wherein the memory comprises computer executable instructions; a communication unit connected to the bus; a database connected to the bus; a processor unit connected to the bus, wherein the processor unit executes the computer executable instructions to direct the data processing system to: receive stream input, wherein the stream input comprises events of interest; build stream plans based on an original query from the stream input and a state machine, wherein building stream plans comprises splitting the original query into a push sub-query and a pull sub-query, and wherein the pull sub-query represents a portion of the original query from the stream input and the push sub-query represents a remaining portion of the original query from the stream input; replicate the stream input, wherein replicating the stream input comprises copying the stream input to produce a set of input streams, wherein one of the set of input streams is directed to a database and one of the set of input streams is directed to the state machine; responsive to a push sub-query trigger, determine whether a pattern of the push sub-query matches an event in the one of the set of input streams directed to the state machine to form a pattern match and create the push sub-query trigger in response to the pattern match, wherein the pattern match causes submit of the pull sub-query to execute against accumulated data in the database to produce a result; and send the result to a requestor. 9. The data processing system of claim 6 , wherein executing the computer executable instructions to direct the data processing system to build stream plans based on an original query further comprises executing the computer executable instructions to direct the data processing system to: decompose the original query according to selectivities, wherein each of the selectivities represents a percentage of events in the stream input that satisfies a condition; and evaluate costs of stream plans according to the selectivities.
| 0.524027 |
14. The system of claim 13 , wherein the ICE match determining means indicates if each exact match is an ICE match for the lookup segment only in the case that each context hash code of the lookup segment matches a respective assigned context hash code of the translation memory source text providing the exact match.
|
14. The system of claim 13 , wherein the ICE match determining means indicates if each exact match is an ICE match for the lookup segment only in the case that each context hash code of the lookup segment matches a respective assigned context hash code of the translation memory source text providing the exact match. 15. The system of claim 14 , further comprising means for, in the case that greater than one exact match is determined, ranking each exact match according to a degree of context level matching.
| 0.847425 |
7. A method for synthesizing speech, comprising the steps of: indicating the amplitude of a waveform by using a random number; indicating the superposition period for waveforms by using a random number; generating a waveform having an amplitude indicated by said amplitude indicating step; superposing and adding the waveform generated in said generating step onto a waveform obtained by delaying the waveform, which is previously generated in said waveform generating step, by a superposition period indicated in said indicating step; and outputting the waveform added in said superposing and adding step as unvoiced speech.
|
7. A method for synthesizing speech, comprising the steps of: indicating the amplitude of a waveform by using a random number; indicating the superposition period for waveforms by using a random number; generating a waveform having an amplitude indicated by said amplitude indicating step; superposing and adding the waveform generated in said generating step onto a waveform obtained by delaying the waveform, which is previously generated in said waveform generating step, by a superposition period indicated in said indicating step; and outputting the waveform added in said superposing and adding step as unvoiced speech. 9. A method for synthesizing speech according to claim 7, further including the steps of: identifying whether speech to be synthesized is voiced speech or unvoiced speech, and controlling the superposition of the waveforms in accordance with the result of identification in said identifying step.
| 0.615265 |
6. A non-transitory computer-readable storage medium storing executable computer program instructions for detecting social networking spam, the computer program instructions comprising instructions for performing steps comprising: selecting a central member who is a user of a social networking environment; measuring degrees of association between the central member and other users of the social networking environment; defining a social networking group containing the central member and other members, where the other members are a subset of the other users of the social networking environment selected responsive to the other users' degrees of association with the central member; identifying that a new entry has been posted on a blog of the central member; analyzing the new entry in comparison to a group usage profile for the social networking group, the group usage profile indicating a pattern of publishing activity of the members of the social networking group in posting information on blogs of other members of the social networking group over a period of time; responsive to the analysis in comparison to the group usage profile indicating that the new entry deviates from the pattern of publishing activity, analyzing the new entry using a global usage profile comprising a spam usage profile to determine whether the new entry matches a spam signature representing known spam; detecting that the new entry is spam responsive to analyzing the new entry using the global usage profile; and determining a pattern of global publishing activity of users in posting information on blogs of other users in the social networking environment; wherein the global usage profile is based in part on the determined pattern of global publishing activity.
|
6. A non-transitory computer-readable storage medium storing executable computer program instructions for detecting social networking spam, the computer program instructions comprising instructions for performing steps comprising: selecting a central member who is a user of a social networking environment; measuring degrees of association between the central member and other users of the social networking environment; defining a social networking group containing the central member and other members, where the other members are a subset of the other users of the social networking environment selected responsive to the other users' degrees of association with the central member; identifying that a new entry has been posted on a blog of the central member; analyzing the new entry in comparison to a group usage profile for the social networking group, the group usage profile indicating a pattern of publishing activity of the members of the social networking group in posting information on blogs of other members of the social networking group over a period of time; responsive to the analysis in comparison to the group usage profile indicating that the new entry deviates from the pattern of publishing activity, analyzing the new entry using a global usage profile comprising a spam usage profile to determine whether the new entry matches a spam signature representing known spam; detecting that the new entry is spam responsive to analyzing the new entry using the global usage profile; and determining a pattern of global publishing activity of users in posting information on blogs of other users in the social networking environment; wherein the global usage profile is based in part on the determined pattern of global publishing activity. 8. The computer-readable storage medium of claim 6 , wherein the group usage profile comprises a catalog of signatures for normal usage patterns of the social networking group during different times of a day, different days of a week, and different months of a year.
| 0.723663 |
1. A method for generating a photo-realistic talking head for a text-to-speech synthesis application, comprising the steps of: sampling images of a subject; extracting a plurality of parameters from each image sample; storing the image sample parameters into an animation library; sampling multiphone images of the subject; sampling sounds associated with the multiphone images; extracting a plurality of parameters from each multiphone image sample; storing the multiphone image parameters and associated sound samples into a coarticulation library; reading, based on an input stimulus comprising one or more phoneme sequences, parameters from the coarticulation library corresponding to each phoneme sequence; generating, using parameters from the animation library corresponding to the read parameters, a sequence of animated frames, the sequence tracking the input stimulus.
|
1. A method for generating a photo-realistic talking head for a text-to-speech synthesis application, comprising the steps of: sampling images of a subject; extracting a plurality of parameters from each image sample; storing the image sample parameters into an animation library; sampling multiphone images of the subject; sampling sounds associated with the multiphone images; extracting a plurality of parameters from each multiphone image sample; storing the multiphone image parameters and associated sound samples into a coarticulation library; reading, based on an input stimulus comprising one or more phoneme sequences, parameters from the coarticulation library corresponding to each phoneme sequence; generating, using parameters from the animation library corresponding to the read parameters, a sequence of animated frames, the sequence tracking the input stimulus. 9. The method of claim 1, wherein the sound samples comprise samples converted from sound into data by a speech recognizer.
| 0.568998 |
1. A system for assessing information in natural language contents, comprising: a user interface configured to receive an object name as a query term and a value for a customized ranking parameter from a user; a computer storage configured to store an object-specific data set related to the object name, wherein the object-specific data set includes a plurality of property names and association-strength values, each property name being associated with an association-strength value, wherein the association strength values of the plurality of property names are above a predetermined threshold value, wherein the plurality of property names includes a first property name and a second property name, wherein the computer storage configured to store a plurality of documents containing text in a natural language; and a computer processing system in communication with the computer storage and the user interface, the computer processing system being configured to count a first frequency of the first property name in one of the plurality of documents, to count a second frequency of the second property name in the document, to calculate a relevance score as a function of the first frequency and the second frequency, to rank the plurality of documents using their respective relevance scores, and to return one or more documents to the user based on the ranking of the plurality of documents, wherein the function is in part defined by the customized ranking parameter.
|
1. A system for assessing information in natural language contents, comprising: a user interface configured to receive an object name as a query term and a value for a customized ranking parameter from a user; a computer storage configured to store an object-specific data set related to the object name, wherein the object-specific data set includes a plurality of property names and association-strength values, each property name being associated with an association-strength value, wherein the association strength values of the plurality of property names are above a predetermined threshold value, wherein the plurality of property names includes a first property name and a second property name, wherein the computer storage configured to store a plurality of documents containing text in a natural language; and a computer processing system in communication with the computer storage and the user interface, the computer processing system being configured to count a first frequency of the first property name in one of the plurality of documents, to count a second frequency of the second property name in the document, to calculate a relevance score as a function of the first frequency and the second frequency, to rank the plurality of documents using their respective relevance scores, and to return one or more documents to the user based on the ranking of the plurality of documents, wherein the function is in part defined by the customized ranking parameter. 10. The system of claim 1 , wherein the first property name is the object name, wherein the second property name is different from the object name, the computer processing system is further configured to sum the frequencies of property names that are different from the object name in the document to produce a total count, wherein the relevance score is calculated using a ratio of the first frequency to the sum of the first frequency and the total count.
| 0.597826 |
1. A method for voice enabling a Web page, the method comprising: receiving speech input for an input field in the Web page; determining whether the input field is a free form input field; and performing a plurality of first actions in response to determining that the input field is not a free form input field, wherein the plurality of first actions includes: generating a speech grammar for the input field based upon terms associated with the input field, wherein the terms associated with the input field comprise terms in a hidden title attribute of the input field, and wherein generating the speech grammar comprises generating the speech grammar for the input field based upon the terms in the hidden title attribute; providing the received speech input and the generated speech grammar to an ASR engine configured to recognize the received speech input to produce a first textual equivalent to the received speech input using the generated speech grammar; and inserting the first textual equivalent into the input field.
|
1. A method for voice enabling a Web page, the method comprising: receiving speech input for an input field in the Web page; determining whether the input field is a free form input field; and performing a plurality of first actions in response to determining that the input field is not a free form input field, wherein the plurality of first actions includes: generating a speech grammar for the input field based upon terms associated with the input field, wherein the terms associated with the input field comprise terms in a hidden title attribute of the input field, and wherein generating the speech grammar comprises generating the speech grammar for the input field based upon the terms in the hidden title attribute; providing the received speech input and the generated speech grammar to an ASR engine configured to recognize the received speech input to produce a first textual equivalent to the received speech input using the generated speech grammar; and inserting the first textual equivalent into the input field. 5. The method of claim 1 , wherein the terms associated with the input field are in the Web page.
| 0.838567 |
22. A computer-implemented method for exchanging private data, comprising the steps of: registering a plurality of data providers and a plurality of data buyers, the registration of each data buyer of the plurality of data buyers comprising receiving a legal representation from the data buyer that the data buyer will use any private data requested only in accordance with stated permissible uses; building, by the computer, a searchable index for each of the data buyers based on at least one index of private data for sale provided from one or more of the data providers; for each searchable index of each of the data buyers, encrypting and decrypting the searchable index by a public key unique to a respective one of the data buyers, when building the searchable indexes; receiving an encrypted query that identifies a data buyer of the plurality of data buyers and defines a purchase request for private data; retrieving the searchable index associated with the data buyer; determining, by the computer, whether at least one of the data providers maintains the private data requested by the data buyer by comparing the purchase request to the searchable index associated with the data buyer; encrypting and decrypting the searchable index associated with the data buyer by a private key unique to the data buyer, when determining whether at least one of the data providers maintains the private data requested; and in response to determining that at least one of the data providers maintains the private data requested, transmitting a message to the data buyer comprising information about the private data requested, the cost of purchasing the private data requested, and an anonymous exchange identifier code for uniquely identifying the private data requested.
|
22. A computer-implemented method for exchanging private data, comprising the steps of: registering a plurality of data providers and a plurality of data buyers, the registration of each data buyer of the plurality of data buyers comprising receiving a legal representation from the data buyer that the data buyer will use any private data requested only in accordance with stated permissible uses; building, by the computer, a searchable index for each of the data buyers based on at least one index of private data for sale provided from one or more of the data providers; for each searchable index of each of the data buyers, encrypting and decrypting the searchable index by a public key unique to a respective one of the data buyers, when building the searchable indexes; receiving an encrypted query that identifies a data buyer of the plurality of data buyers and defines a purchase request for private data; retrieving the searchable index associated with the data buyer; determining, by the computer, whether at least one of the data providers maintains the private data requested by the data buyer by comparing the purchase request to the searchable index associated with the data buyer; encrypting and decrypting the searchable index associated with the data buyer by a private key unique to the data buyer, when determining whether at least one of the data providers maintains the private data requested; and in response to determining that at least one of the data providers maintains the private data requested, transmitting a message to the data buyer comprising information about the private data requested, the cost of purchasing the private data requested, and an anonymous exchange identifier code for uniquely identifying the private data requested. 24. The computer-implemented method recited by claim 22 , wherein the private data requested comprises law enforcement information regarding an individual, the law enforcement information comprising at least one of a driver's license number of the individual and information regarding a criminal history of the individual.
| 0.606691 |
11. The method of claim 10 , wherein determining the type comprises identifying the ambiguous verbal block by using a finite state automaton operating on syntactic categories of sentence lexemes.
|
11. The method of claim 10 , wherein determining the type comprises identifying the ambiguous verbal block by using a finite state automaton operating on syntactic categories of sentence lexemes. 12. The method of claim 11 , wherein the finite state automaton is compiled from a set of regular expressions.
| 0.945286 |
1. A method for determining automatically whether an input speech templates matches any of the plurality of reference speech templates, said reference speech templates being stored in a dictionary, said method comprising the steps of: converting input speech with an analogue-to-digital conversion means, the output of said analogue-to-digital conversion means being a plurality of templates, said templates being digital representation of said input speech; determining with an endpoint detection means coupled to said analogue-to-digital conversion means for receiving digitized signals therefrom where the speech starts, the location of said speech template commencing and ending at at least two end-points; estimating superior end-points of said speech signals with a zero crossing means coupled to said analogue-to-digital conversion means and said end point detection means for receiving digitized signals therefrom; decomposing said speech signals into a plurality of vectors with a wavelet transforming means coupled to said end point detection means for receiving truncated speech signals therefrom, said vectors representing the time, scale and frequency domains of said truncated speech signals; averaging the plurality of vectors with an energy vector forming means coupled to said wavelet transforming means, said energy vector forming means producing a plurality of energy vectors; economizing the storage of energy vectors with a quantizing means coupled to said energy forming means by quantizing said energy vectors with reference to a threshold parameter, said energy vectors being converted into two bits for representing each vector for each block; determining a plurality of transient response of said energy vectors with a transient producing means coupled to said energy vector producing means for obviating the need for time aligning the speech and reference templates, said transient response being the difference in the amplitude of an energy vector of a block and that of the adjoining block; forming a speech map of said speech templates with a speech map forming means coupled to said quantizing means, said speech templates being accumulative of energy vectors in block by block manner; and comparing the speech map of said input speech templates and that of the reference speech templates from said dictionary with a template matching means coupled to said speech map forming means without searching through the entire contents of the dictionary, said template matching means being further coupled to said transient forming means and said dictionary for receiving therefrom transient response of said blocks and reference speech templates respectively.
|
1. A method for determining automatically whether an input speech templates matches any of the plurality of reference speech templates, said reference speech templates being stored in a dictionary, said method comprising the steps of: converting input speech with an analogue-to-digital conversion means, the output of said analogue-to-digital conversion means being a plurality of templates, said templates being digital representation of said input speech; determining with an endpoint detection means coupled to said analogue-to-digital conversion means for receiving digitized signals therefrom where the speech starts, the location of said speech template commencing and ending at at least two end-points; estimating superior end-points of said speech signals with a zero crossing means coupled to said analogue-to-digital conversion means and said end point detection means for receiving digitized signals therefrom; decomposing said speech signals into a plurality of vectors with a wavelet transforming means coupled to said end point detection means for receiving truncated speech signals therefrom, said vectors representing the time, scale and frequency domains of said truncated speech signals; averaging the plurality of vectors with an energy vector forming means coupled to said wavelet transforming means, said energy vector forming means producing a plurality of energy vectors; economizing the storage of energy vectors with a quantizing means coupled to said energy forming means by quantizing said energy vectors with reference to a threshold parameter, said energy vectors being converted into two bits for representing each vector for each block; determining a plurality of transient response of said energy vectors with a transient producing means coupled to said energy vector producing means for obviating the need for time aligning the speech and reference templates, said transient response being the difference in the amplitude of an energy vector of a block and that of the adjoining block; forming a speech map of said speech templates with a speech map forming means coupled to said quantizing means, said speech templates being accumulative of energy vectors in block by block manner; and comparing the speech map of said input speech templates and that of the reference speech templates from said dictionary with a template matching means coupled to said speech map forming means without searching through the entire contents of the dictionary, said template matching means being further coupled to said transient forming means and said dictionary for receiving therefrom transient response of said blocks and reference speech templates respectively. 2. A method according to claim 1 wherein the step of forming speech map of said dictionary includes adding energy vectors in block by block manner.
| 0.884735 |
1. A multilingual method for summarizing an article, which comprises: an offline stage which comprises: (a.) predefining a set of metrics; (b.) providing a collection of documents, and providing one or more of expert summaries for each article; (c.) indexing the sentences and words within each article; (d.) subjecting, using at least one computer processor, each sentence in said articles serially to the entire set of metrics, thereby obtaining for each sentence a plurality of sentence metrics values, each relating to one of said metrics respectively; (e.) guessing a population of u normalized weights vectors; (f.) for a selected weights vector u i in said population: (f.1.) for each sentence, calculating a sentence combined value, said combined value being a linear combination of the weights vector and said sentence metrics values; (f.2.) for each document ranking the sentences according to their combined values; (f.3.) for each document selecting a group of sentences having highest combined values; (f.4.) for each document, comparing said selected group with the one or more expert summaries, and obtaining a quality score for each article, selected group, and corresponding weights vector; (f.5.) repeating steps f1 to f4 for all the weights vectors in u; (g.) based on said quality scores, calculating a total score, and checking for convergence of a total of said quality scores in respect to previous iterations; (h.) upon convergence of said total quality scores, selecting a best weights vector which provides highest quality scores, and terminating the process; (i.) otherwise, if no convergence has yet obtained, selecting a group a of weights vectors out of population u that have provided highest quality scores, and by means of a genetic algorithm generating a new population u′ of weights vectors, and repeating steps f to h with the population u′ of weights vectors until convergence; and a real time stage which comprises: (j.) indexing sentences, and words within the document which needs summarization; (k.) calculating each of said predefined metrics of step a with respect to each of the sentences in the document to obtain sentence metric values; (l.) separately for each sentence, subjecting the sentence matrix values to the best weights vector as selected in step h of the offline stage, and summing up all weighted values to obtain a single combined value for each sentence; (m.) ranking the sentences according to their combined values to form a ranked list, and extracting a predetermined number of sentences from a top of the ranked list of sentences; and (n.) combining said extracted sentences thereby forming the document summary.
|
1. A multilingual method for summarizing an article, which comprises: an offline stage which comprises: (a.) predefining a set of metrics; (b.) providing a collection of documents, and providing one or more of expert summaries for each article; (c.) indexing the sentences and words within each article; (d.) subjecting, using at least one computer processor, each sentence in said articles serially to the entire set of metrics, thereby obtaining for each sentence a plurality of sentence metrics values, each relating to one of said metrics respectively; (e.) guessing a population of u normalized weights vectors; (f.) for a selected weights vector u i in said population: (f.1.) for each sentence, calculating a sentence combined value, said combined value being a linear combination of the weights vector and said sentence metrics values; (f.2.) for each document ranking the sentences according to their combined values; (f.3.) for each document selecting a group of sentences having highest combined values; (f.4.) for each document, comparing said selected group with the one or more expert summaries, and obtaining a quality score for each article, selected group, and corresponding weights vector; (f.5.) repeating steps f1 to f4 for all the weights vectors in u; (g.) based on said quality scores, calculating a total score, and checking for convergence of a total of said quality scores in respect to previous iterations; (h.) upon convergence of said total quality scores, selecting a best weights vector which provides highest quality scores, and terminating the process; (i.) otherwise, if no convergence has yet obtained, selecting a group a of weights vectors out of population u that have provided highest quality scores, and by means of a genetic algorithm generating a new population u′ of weights vectors, and repeating steps f to h with the population u′ of weights vectors until convergence; and a real time stage which comprises: (j.) indexing sentences, and words within the document which needs summarization; (k.) calculating each of said predefined metrics of step a with respect to each of the sentences in the document to obtain sentence metric values; (l.) separately for each sentence, subjecting the sentence matrix values to the best weights vector as selected in step h of the offline stage, and summing up all weighted values to obtain a single combined value for each sentence; (m.) ranking the sentences according to their combined values to form a ranked list, and extracting a predetermined number of sentences from a top of the ranked list of sentences; and (n.) combining said extracted sentences thereby forming the document summary. 3. The method according to claim 1 , wherein even before convergence, one or more of the best determined weights vectors is transferred to the new population u′ which is generated by the genetic algorithm.
| 0.556034 |
1. A computer-implemented method for processing input text, the method comprising acts of: locating, within the input text, at least one portion of text corresponding to at least one section heading of a plurality of section headings associated with a report template; causing a display device to visually display at least one indicator for the at least one section heading to indicate that the at least one portion of text corresponding to the at least one section heading has been located in the input text; and using a computer to automatically generate a structured report according to the report template, the structured report having a plurality of sections, the plurality of sections comprising at least one section corresponding to the at least one section heading, the at least one section being populated with the at least one portion of text corresponding to the at least one section heading, wherein the act of causing the display device to visually display at least one indicator comprises causing the display device to display an indicator separate from the structured report.
|
1. A computer-implemented method for processing input text, the method comprising acts of: locating, within the input text, at least one portion of text corresponding to at least one section heading of a plurality of section headings associated with a report template; causing a display device to visually display at least one indicator for the at least one section heading to indicate that the at least one portion of text corresponding to the at least one section heading has been located in the input text; and using a computer to automatically generate a structured report according to the report template, the structured report having a plurality of sections, the plurality of sections comprising at least one section corresponding to the at least one section heading, the at least one section being populated with the at least one portion of text corresponding to the at least one section heading, wherein the act of causing the display device to visually display at least one indicator comprises causing the display device to display an indicator separate from the structured report. 5. The computer-implemented method of claim 1 , wherein the act of causing the display device to visually display at least one indicator for the at least one section heading comprises causing the display device to visually display an indicator for every section heading of the plurality of section headings for which a corresponding portion of text is located within the input text.
| 0.649273 |
17. At least one non-transitory computer-readable medium storing computer-readable instructions that, when executed by one or more computing devices, cause at least one of the one or more computing devices to: receive a request directed to a tokenized database, wherein the tokenized database contains one or more tokenized data values and wherein the request does not include any tokenized data values; apply one or more rules to the request; rewrite the request based on at least one of the one or more rules, wherein the rewritten request is configured to cause one or more non-tokenized data values specified in the request to be tokenized by a software agent resident on the tokenized database when data is added to the tokenized database as a result of the request and wherein the rewritten request is configured to cause the tokenized database to return non-tokenized data values when data is received from the tokenized database as a result of the request; and transmit the rewritten request to the tokenized database.
|
17. At least one non-transitory computer-readable medium storing computer-readable instructions that, when executed by one or more computing devices, cause at least one of the one or more computing devices to: receive a request directed to a tokenized database, wherein the tokenized database contains one or more tokenized data values and wherein the request does not include any tokenized data values; apply one or more rules to the request; rewrite the request based on at least one of the one or more rules, wherein the rewritten request is configured to cause one or more non-tokenized data values specified in the request to be tokenized by a software agent resident on the tokenized database when data is added to the tokenized database as a result of the request and wherein the rewritten request is configured to cause the tokenized database to return non-tokenized data values when data is received from the tokenized database as a result of the request; and transmit the rewritten request to the tokenized database. 22. The at least one non-transitory computer-readable medium of claim 17 , wherein applying one or more rules and rewriting the request comprises: selecting an incomplete request rule when the request is determined to be incomplete; transmitting a request for missing data to the tokenized database, wherein the missing data is the incomplete portion of the request; receiving the missing data from the tokenized database; and rewriting the request to include missing data.
| 0.781969 |
7. The tangible computer-readable medium of claim 1 wherein, the step of modifying the at least one input mathematical expression in accordance with a search algorithm includes modifying the at least one input mathematical expression in accordance with an evolutionary search algorithm to produce the at least one modified mathematical expression.
|
7. The tangible computer-readable medium of claim 1 wherein, the step of modifying the at least one input mathematical expression in accordance with a search algorithm includes modifying the at least one input mathematical expression in accordance with an evolutionary search algorithm to produce the at least one modified mathematical expression. 10. The tangible computer-readable medium of claim 7 wherein, the goal function is an evolutionary multi-objective goal function.
| 0.95456 |
1. A machine-implemented method for assisting the authoring of electronic messages, comprising: invoking machine-implemented electronic messaging logic, said electronic messaging logic including user-interface object logic operable to display a user-interface object and invoke machine-implemented conversation advisor logic in response to user activation of said user-interface logic; initiating the creation of an electronic message using said electronic messaging logic, said electronic message being stored in digital form in a computer memory; invoking said conversation advisor logic in response to activation of said user-interface logic by an author of said electronic message; said conversation advisor logic accessing said electronic message in said computer memory; said conversation advisor logic inspecting one or more fields of said electronic message to identify intended recipients of said electronic message; said conversation advisor logic gathering and analyzing historical data relating to a conversation history in one or more previous electronic messages that link said author of said electronic message to said intended recipients, said gathering and analyzing of historical data including extracting and storing message content from said one or more previous electronic messages that is indicative of historical semantic styles and guidelines have been used in the past by said author to converse with said intended recipients via one or more electronic message applications; said conversation advisor logic sorting, tagging and storing said message content in a computer database as a sorted/tagged dataset that represents said historical data, said historical data being arranged in individual database entries that are each specific to a particular one of said intended recipients or to said intended recipients as a group; said conversation advisor logic being operable to populate some or all of said sorted/tagged dataset with data entries containing said historical data in advance of said electronic message being created by periodically searching for new electronic messages created by said electronic messaging logic and extracting said message content therefrom; said conversation advisor logic being operable to supplement said sorted/tagged dataset with one or more additional database entries during creation of said electronic message to account for any of said intended recipients who are not represented by existing database entries in said sorted/tagged dataset; said conversation advisor logic performing semantic analysis on said electronic message to extract words and phrases representing recipient fitness information that is indicative of whether said electronic message is appropriate for said intended recipients by virtue of being consistent with said historical data; said conversation advisor logic generating a fitness result for said electronic message by comparing said recipient fitness information to said historical data and identifying inconsistencies between said words and phrases represented by said recipient fitness information and said historical semantic styles and guidelines represented by said historical data; and said conversation advisor logic outputting said fitness result for viewing on an electronic display device associated with said author of said electronic message.
|
1. A machine-implemented method for assisting the authoring of electronic messages, comprising: invoking machine-implemented electronic messaging logic, said electronic messaging logic including user-interface object logic operable to display a user-interface object and invoke machine-implemented conversation advisor logic in response to user activation of said user-interface logic; initiating the creation of an electronic message using said electronic messaging logic, said electronic message being stored in digital form in a computer memory; invoking said conversation advisor logic in response to activation of said user-interface logic by an author of said electronic message; said conversation advisor logic accessing said electronic message in said computer memory; said conversation advisor logic inspecting one or more fields of said electronic message to identify intended recipients of said electronic message; said conversation advisor logic gathering and analyzing historical data relating to a conversation history in one or more previous electronic messages that link said author of said electronic message to said intended recipients, said gathering and analyzing of historical data including extracting and storing message content from said one or more previous electronic messages that is indicative of historical semantic styles and guidelines have been used in the past by said author to converse with said intended recipients via one or more electronic message applications; said conversation advisor logic sorting, tagging and storing said message content in a computer database as a sorted/tagged dataset that represents said historical data, said historical data being arranged in individual database entries that are each specific to a particular one of said intended recipients or to said intended recipients as a group; said conversation advisor logic being operable to populate some or all of said sorted/tagged dataset with data entries containing said historical data in advance of said electronic message being created by periodically searching for new electronic messages created by said electronic messaging logic and extracting said message content therefrom; said conversation advisor logic being operable to supplement said sorted/tagged dataset with one or more additional database entries during creation of said electronic message to account for any of said intended recipients who are not represented by existing database entries in said sorted/tagged dataset; said conversation advisor logic performing semantic analysis on said electronic message to extract words and phrases representing recipient fitness information that is indicative of whether said electronic message is appropriate for said intended recipients by virtue of being consistent with said historical data; said conversation advisor logic generating a fitness result for said electronic message by comparing said recipient fitness information to said historical data and identifying inconsistencies between said words and phrases represented by said recipient fitness information and said historical semantic styles and guidelines represented by said historical data; and said conversation advisor logic outputting said fitness result for viewing on an electronic display device associated with said author of said electronic message. 3. The method of claim 1 , wherein said recipient fitness information comprises words or phrases indicating a manner in which said intended recipients are addressed in a recipient salutation.
| 0.588352 |
27. A method, comprising: plugging a pluggable converter module into a framework configured to receive one or more pluggable modules, wherein the converter module is configured to convert office documents in an office document format to and from small device documents in a small device format; the converter module generating a small device document in the small device format from an office document in the office document format; wherein said generating a small device document in the small device format comprises excluding one or more format features of the office document from the small device document; modifying the small device document; the converter module generating a modified version of the office document in the office document format from the modified version of the small device document in the small device format; and wherein said generating a modified version of the office document in the office document format comprises restoring the one or more format features of the office document excluded from the small device document.
|
27. A method, comprising: plugging a pluggable converter module into a framework configured to receive one or more pluggable modules, wherein the converter module is configured to convert office documents in an office document format to and from small device documents in a small device format; the converter module generating a small device document in the small device format from an office document in the office document format; wherein said generating a small device document in the small device format comprises excluding one or more format features of the office document from the small device document; modifying the small device document; the converter module generating a modified version of the office document in the office document format from the modified version of the small device document in the small device format; and wherein said generating a modified version of the office document in the office document format comprises restoring the one or more format features of the office document excluded from the small device document. 31. The method as recited in claim 27 , further comprising: the converter module generating a modified version of the office document in an interim format from the modified version of the small device document in the small device format; generating a version of the office document in the interim format from the office document in the office document format; plugging a pluggable differencing module into the framework; plugging a pluggable merger module into the framework; the differencing module determining differences between the modified version of the office document in the interim format and the office document in the interim format, wherein each determined difference indicates changed content of the modified version of the office document in the interim format; and for each of the determined differences, the merger module merging corresponding changed content of the modified version of the office document in the interim format with the office document in the interim format to generate a synchronized version of the office document in the interim format.
| 0.543979 |
9. An apparatus for removing a mark in a document image, the apparatus comprising: an extracting device configured to extract connected components from a binary image corresponding to the document image; a clustering device configured to cluster the connected components based on grayscale features of the connected components to obtain one clustering center; a searching device configured to search, within numerical ranges of a clustering radius R from the clustering center and a grayscale threshold T, for a combination (R, T) which causes an evaluation value based on the grayscale features of the connected components to be higher than a first evaluation threshold; and a fine removing device configured to remove the mark in the document image based on the grayscale threshold in the combination; wherein the grayscale features of the connected components comprise: a minimum one of grayscale values of pixels in the document image, which correspond to all black pixels in each of connected components; wherein the fine removing device is further configured to remove the connected components, the grayscale features of which are greater than the grayscale threshold, as the mark in the document image.
|
9. An apparatus for removing a mark in a document image, the apparatus comprising: an extracting device configured to extract connected components from a binary image corresponding to the document image; a clustering device configured to cluster the connected components based on grayscale features of the connected components to obtain one clustering center; a searching device configured to search, within numerical ranges of a clustering radius R from the clustering center and a grayscale threshold T, for a combination (R, T) which causes an evaluation value based on the grayscale features of the connected components to be higher than a first evaluation threshold; and a fine removing device configured to remove the mark in the document image based on the grayscale threshold in the combination; wherein the grayscale features of the connected components comprise: a minimum one of grayscale values of pixels in the document image, which correspond to all black pixels in each of connected components; wherein the fine removing device is further configured to remove the connected components, the grayscale features of which are greater than the grayscale threshold, as the mark in the document image. 11. The apparatus according to claim 9 , wherein the clustering device is further configured: to count a number of connected components within a range of a given clustering radius when each connected component serves as a clustering center, in a feature space of the grayscale features; and to determine a connected component corresponding to a maximum one of counted numbers as the clustering center.
| 0.657593 |
1. In a computer system that is network connectable along with one or more other computer systems to a network, the computer system including a processor and system memory, a method for creating an electronic message that can be sent using a plurality of different message protocols, that is formatted to be compatible with a plurality of different message applications, and that can be stored and accessed by any of the plurality of different message applications using any of the plurality of different messaging protocols, the method comprising: an act of the processor creating a single message item representing the electronic message in accordance with a general message schema, the single message item creation including: an act of defining one or more general data fields according to the general message schema that correspond to one or more general properties common to the plurality of different message protocols and common to the plurality of different message applications, including at least one data field corresponding to a primary type to the message item, the primary type indicating a primary behavior of a plurality of content portions linked to the message item; an act of formatting the single message item for compatibility with the plurality of different message protocols, including for each different message protocol in the plurality of different message protocols: an act of adding protocol specific data fields from at least one protocol specific extension schema to the single message item itself, to make the plurality of linked content portions compatible with the message protocol, each protocol specific extension schema accounting for any properties that are not common between the plurality of different message protocols; and an act of assigning values to the protocol specific data fields within the single message item; an act of formatting the single message item for compatibility with the plurality of different message applications, including for each different message application in the plurality of different message applications: an act of adding application specific data fields from at least one application specific extension schema to the message item itself, to make the plurality of linked content portions compatible with the message application, each application specific extension schema accounting for properties that are not common between the plurality of different message applications; and an act of assigning values to the application specific data fields within the single message item; an act of assigning values to one or more of the general data fields, thereby defining at least one general property that is common between two different extension schemas; and an act of sending the single message item, which has been formatted to include the protocol specific data fields for each of the plurality of different message protocols and the application specific data fields for each of the plurality of different message applications, to two or more of the plurality of different message applications via two or more of the plurality of different message protocols.
|
1. In a computer system that is network connectable along with one or more other computer systems to a network, the computer system including a processor and system memory, a method for creating an electronic message that can be sent using a plurality of different message protocols, that is formatted to be compatible with a plurality of different message applications, and that can be stored and accessed by any of the plurality of different message applications using any of the plurality of different messaging protocols, the method comprising: an act of the processor creating a single message item representing the electronic message in accordance with a general message schema, the single message item creation including: an act of defining one or more general data fields according to the general message schema that correspond to one or more general properties common to the plurality of different message protocols and common to the plurality of different message applications, including at least one data field corresponding to a primary type to the message item, the primary type indicating a primary behavior of a plurality of content portions linked to the message item; an act of formatting the single message item for compatibility with the plurality of different message protocols, including for each different message protocol in the plurality of different message protocols: an act of adding protocol specific data fields from at least one protocol specific extension schema to the single message item itself, to make the plurality of linked content portions compatible with the message protocol, each protocol specific extension schema accounting for any properties that are not common between the plurality of different message protocols; and an act of assigning values to the protocol specific data fields within the single message item; an act of formatting the single message item for compatibility with the plurality of different message applications, including for each different message application in the plurality of different message applications: an act of adding application specific data fields from at least one application specific extension schema to the message item itself, to make the plurality of linked content portions compatible with the message application, each application specific extension schema accounting for properties that are not common between the plurality of different message applications; and an act of assigning values to the application specific data fields within the single message item; an act of assigning values to one or more of the general data fields, thereby defining at least one general property that is common between two different extension schemas; and an act of sending the single message item, which has been formatted to include the protocol specific data fields for each of the plurality of different message protocols and the application specific data fields for each of the plurality of different message applications, to two or more of the plurality of different message applications via two or more of the plurality of different message protocols. 23. The method as in claim 1 , wherein at least one application specific data field corresponds to one of an electronic mail application, an instant messaging application, a fax application, a voice message application, or a news group application.
| 0.641207 |
1. A method of processing a document using a computer, comprising: storing a version of the document in a memory of the computer; displaying a portion of the document on a display of the computer, the portion having an associated font face, an associated line spacing, an associated margin, an associated font color and an associated justification; providing a display of available commands for processing the document, the available commands including one or more of changing the associated font face, changing the associated line spacing, changing the associated margin, changing the associated font color and changing the associated justification; monitoring user actions associated with the displayed portion of the document, the user actions including identifying but not executing one of the available commands for processing the document; in response to the action of identifying but not executing one of the available commands being performed by the user, updating the display of the portion of the document on the display of the computer in accordance with the identified command.
|
1. A method of processing a document using a computer, comprising: storing a version of the document in a memory of the computer; displaying a portion of the document on a display of the computer, the portion having an associated font face, an associated line spacing, an associated margin, an associated font color and an associated justification; providing a display of available commands for processing the document, the available commands including one or more of changing the associated font face, changing the associated line spacing, changing the associated margin, changing the associated font color and changing the associated justification; monitoring user actions associated with the displayed portion of the document, the user actions including identifying but not executing one of the available commands for processing the document; in response to the action of identifying but not executing one of the available commands being performed by the user, updating the display of the portion of the document on the display of the computer in accordance with the identified command. 7. The method of claim 1 , further comprising altering the document in response to the user confirming execution of the one identified command.
| 0.593727 |
14. The computer implemented method of claim 13 , wherein the indication of the classification is an indication of the data extraction parser for that classification, and further comprising: selecting the data extraction parser for parsing the additional communication.
|
14. The computer implemented method of claim 13 , wherein the indication of the classification is an indication of the data extraction parser for that classification, and further comprising: selecting the data extraction parser for parsing the additional communication. 15. The computer implemented method of claim 14 , wherein the data extraction parser is configured based on the communications of the given cluster.
| 0.962164 |
8. The system of claim 7 , wherein the processor is further configured to provide an indication to stop executing the first query.
|
8. The system of claim 7 , wherein the processor is further configured to provide an indication to stop executing the first query. 9. The system of claim 8 , wherein the processor is further configured to provide an indication to execute another query.
| 0.953727 |
4. A computer controlled system for indexing presentation files in a database comprising a plurality of presentation files stored on a computer-readable medium, each of the presentation files comprising a plurality of slides forming a presentation, each of the slides comprising words, the system comprising: a processor; a computer memory holding computer program instructions that when executed by the processor perform the method comprising: selecting a slide in the presentation file; selecting at least one word present in the selected slide; counting a number of times the at least one word occurs in the selected slide; storing an identifier for the selected slide in a database of identifiers, the stored identifier having a link to the slide in the presentation file, the stored identifier comprising the at least one word and the number of times the at least one word occurs in the selected slide; and generating a query slide on which a search of the presentation files in the database is to be based, comprising: selecting at least one word present in the query slide; counting a number of times at least one word occurs in the query slide; creating an identifier for the query slide, the identifier comprising at least one word and the number of times at least one word occurs in the query slide; searching the database of identifiers for a slide having a stored identifier close to the identifier for the query slide; and returning at least one slide having a stored identifier close to the identifier for the query slide from the presentation file stored in the database of presentation files.
|
4. A computer controlled system for indexing presentation files in a database comprising a plurality of presentation files stored on a computer-readable medium, each of the presentation files comprising a plurality of slides forming a presentation, each of the slides comprising words, the system comprising: a processor; a computer memory holding computer program instructions that when executed by the processor perform the method comprising: selecting a slide in the presentation file; selecting at least one word present in the selected slide; counting a number of times the at least one word occurs in the selected slide; storing an identifier for the selected slide in a database of identifiers, the stored identifier having a link to the slide in the presentation file, the stored identifier comprising the at least one word and the number of times the at least one word occurs in the selected slide; and generating a query slide on which a search of the presentation files in the database is to be based, comprising: selecting at least one word present in the query slide; counting a number of times at least one word occurs in the query slide; creating an identifier for the query slide, the identifier comprising at least one word and the number of times at least one word occurs in the query slide; searching the database of identifiers for a slide having a stored identifier close to the identifier for the query slide; and returning at least one slide having a stored identifier close to the identifier for the query slide from the presentation file stored in the database of presentation files. 6. The system of claim 4 , further comprising a step of searching the database of identifiers for a list of slides in the presentation files in the database of presentation files having identifiers close to the identifier of the query slide, listed in order based upon closeness to the identifier of the query slide.
| 0.532922 |
1. A method for matching speech data used to determine the similarity between an input speech data and a sample speech data, the method comprising: segmenting the input speech data into a plurality of input speech frames; segmenting the sample speech data into a plurality of sample speech frames; building a matching matrix, wherein each element of the matching matrix corresponds to one of the input speech frames and one of the sample speech frames and indicates a distance value between the corresponding input speech frame and the corresponding sample speech frame; determining a minimum value of the distance values indicated in each row of elements of the matching matrix, thereby obtaining a plurality of minimum distance values of the respective rows of elements of the matching matrix, determining a second least value of the distance values indicated in each row of elements of the matching matrix, thereby obtaining a plurality of second least distance values of the respective rows of elements of the matching matrix; summing up the minimum distance values and the second least distance value of the distance values indicated in each row of elements of the matching matrix, thereby obtaining a row score, determined by: row score = ∑ j = 1 r min r ⊗ C [ MM ( i , j ) ] + ∑ j = 1 r min r ⊗ C - i c [ MM ( i , j ) ] ; determining a minimum value of the distance values indicated in each column of elements of the matching matrix, thereby obtaining a plurality of another minimum distance values of the respective columns of elements of the matching matrix, determining a second least value of the distance values indicated in each column of elements of the matching matrix, thereby obtaining a plurality of second least distance values of the respective columns of elements of the matching matrix; summing up the another minimum distance values and the second least value of the indicated distance values in each column of elements of the matching matrix distance values, thereby obtaining a column score, wherein: column score = ∑ i = 1 e min j ∈ R [ MM ( i , j ) ] + ∑ i = 1 e min j ∈ R - j k [ MM ( i , j ) ] ; calculating a matching score obtained by combining the distance row score and the column score; and determining whether the input speech data and the sample speech data are similar according to the matching score.
|
1. A method for matching speech data used to determine the similarity between an input speech data and a sample speech data, the method comprising: segmenting the input speech data into a plurality of input speech frames; segmenting the sample speech data into a plurality of sample speech frames; building a matching matrix, wherein each element of the matching matrix corresponds to one of the input speech frames and one of the sample speech frames and indicates a distance value between the corresponding input speech frame and the corresponding sample speech frame; determining a minimum value of the distance values indicated in each row of elements of the matching matrix, thereby obtaining a plurality of minimum distance values of the respective rows of elements of the matching matrix, determining a second least value of the distance values indicated in each row of elements of the matching matrix, thereby obtaining a plurality of second least distance values of the respective rows of elements of the matching matrix; summing up the minimum distance values and the second least distance value of the distance values indicated in each row of elements of the matching matrix, thereby obtaining a row score, determined by: row score = ∑ j = 1 r min r ⊗ C [ MM ( i , j ) ] + ∑ j = 1 r min r ⊗ C - i c [ MM ( i , j ) ] ; determining a minimum value of the distance values indicated in each column of elements of the matching matrix, thereby obtaining a plurality of another minimum distance values of the respective columns of elements of the matching matrix, determining a second least value of the distance values indicated in each column of elements of the matching matrix, thereby obtaining a plurality of second least distance values of the respective columns of elements of the matching matrix; summing up the another minimum distance values and the second least value of the indicated distance values in each column of elements of the matching matrix distance values, thereby obtaining a column score, wherein: column score = ∑ i = 1 e min j ∈ R [ MM ( i , j ) ] + ∑ i = 1 e min j ∈ R - j k [ MM ( i , j ) ] ; calculating a matching score obtained by combining the distance row score and the column score; and determining whether the input speech data and the sample speech data are similar according to the matching score. 8. The method as claimed in claim 1 , wherein the matching score is equal to the product of the column score and a fifth weighted value, plus the product of the row score and a sixth weighted value.
| 0.529636 |
22. The dynamic collaboration system of claim 21 , wherein a context lookup component included in the context translator module is operable to query the detected context indication against a knowledge model to generate a list of relations as a function of the detected context indication.
|
22. The dynamic collaboration system of claim 21 , wherein a context lookup component included in the context translator module is operable to query the detected context indication against a knowledge model to generate a list of relations as a function of the detected context indication. 25. The dynamic collaboration system of claim 22 , wherein the knowledge model comprises a plurality of information items representative of links to sources of corresponding information, wherein the information items are inter-related within the knowledge model.
| 0.945333 |
1. A method to identify a violation of a policy defined by a terms of use document that defines one or more permissible actions by a user using a computing entity, comprising: detecting an action associated with the computing entity; training a natural language processing (NLP)-based question and answer (Q&A) system to understand the terms of use document; implementing a policy management application or functionality designed to interact with said natural language processing (NLP)-based question and answer (Q&A) system to identify a violation of said terms of use document; converting the action using said natural language processing (NLP)-based question and answer (Q&A) system by accommodating unstructured questions such that the action is converted into a natural text query using a computer program executing on a hardware element; providing the natural text query for analysis to determine whether the action constitutes a violation of the terms of use document because the action detected is not one of the permissible actions, the determination being made by a natural language comparison of the natural text query against one or more terms of use that define the policy; receiving a response to the natural text query; and based on the response, taking a policy enforcement action at the computing entity that limits the computing entity's functionality.
|
1. A method to identify a violation of a policy defined by a terms of use document that defines one or more permissible actions by a user using a computing entity, comprising: detecting an action associated with the computing entity; training a natural language processing (NLP)-based question and answer (Q&A) system to understand the terms of use document; implementing a policy management application or functionality designed to interact with said natural language processing (NLP)-based question and answer (Q&A) system to identify a violation of said terms of use document; converting the action using said natural language processing (NLP)-based question and answer (Q&A) system by accommodating unstructured questions such that the action is converted into a natural text query using a computer program executing on a hardware element; providing the natural text query for analysis to determine whether the action constitutes a violation of the terms of use document because the action detected is not one of the permissible actions, the determination being made by a natural language comparison of the natural text query against one or more terms of use that define the policy; receiving a response to the natural text query; and based on the response, taking a policy enforcement action at the computing entity that limits the computing entity's functionality. 7. The method as described in claim 1 wherein said question and answer (Q&A) system is an open-domain Q&A system that is an NLP artificial intelligence (AI) based learning machine that analyzes terms of use as part of its knowledge corpus.
| 0.556047 |
1. A method comprising: receiving, with an authentication device, authentication information from an endpoint device; authenticating, with the authentication device, the endpoint device based on the authentication information; based on the authentication, storing, with the authentication device, authorization information in accordance with a first proprietary authorization data model; applying, with the authentication device, an export translation policy to translate the authorization information stored in accordance the first proprietary authorization data model into translated authorization information that complies with a second Interface for Metadata Access Point (IF-MAP) authorization data model conforming to an IF-MAP standard, wherein the second IF-MAP authorization data model is different from the first proprietary authorization data model; and publishing, with the authentication device, the translated authorization information in accordance with an IF-MAP protocol to an intermediate storage device that implements the second IF-MAP authorization data model.
|
1. A method comprising: receiving, with an authentication device, authentication information from an endpoint device; authenticating, with the authentication device, the endpoint device based on the authentication information; based on the authentication, storing, with the authentication device, authorization information in accordance with a first proprietary authorization data model; applying, with the authentication device, an export translation policy to translate the authorization information stored in accordance the first proprietary authorization data model into translated authorization information that complies with a second Interface for Metadata Access Point (IF-MAP) authorization data model conforming to an IF-MAP standard, wherein the second IF-MAP authorization data model is different from the first proprietary authorization data model; and publishing, with the authentication device, the translated authorization information in accordance with an IF-MAP protocol to an intermediate storage device that implements the second IF-MAP authorization data model. 4. The method of claim 1 , wherein the first proprietary authorization data model defines a first set of classes by which to classify portions of the authorization information, wherein the second IF-MAP authorization data model defines a second set of classes by which to classify portions of the translated authorization information, wherein at least one of the classes of the first set is different from at least one of the classes of the second set, wherein the export translation policy comprises data that defines rules to map each class of the first set of classes to one or more classes of the second set of classes, and wherein applying the export translation policy comprises applying the rules of the export translation policy to map each of the classified portions of the authentication information to a corresponding one or more of the classified portions of the translated authentication information.
| 0.774988 |
16. A computer-implemented method, comprising: displaying, on a device interface, a set of candidate objects for object recognition and an image having a missing object, the set of candidate images including the missing object and a first candidate object, wherein the first candidate object does not correspond to the image; detecting a selection of a candidate object from the set of candidate objects; and determining whether the selection was made by a human based on whether the candidate object corresponds to the missing object.
|
16. A computer-implemented method, comprising: displaying, on a device interface, a set of candidate objects for object recognition and an image having a missing object, the set of candidate images including the missing object and a first candidate object, wherein the first candidate object does not correspond to the image; detecting a selection of a candidate object from the set of candidate objects; and determining whether the selection was made by a human based on whether the candidate object corresponds to the missing object. 19. The computer-implemented method of claim 16 , wherein an area of the image that surrounds the missing object includes image inpainting that provides unnatural details, the unnatural details hinting to a human that the candidate object belongs in the area filled with the image inpainting.
| 0.783147 |
1. A computer system comprising: an object-action manager for building and operating a developer-defined user interface within predetermined parameters, the developer-defined user interface managing interaction between an end-user and an application created by a developer, the object-action manager further comprising parser means for reading a description file and creating data structures from the description file, the description file being created by the developer using a simple definition syntax, the parser means creates the data structures according to a late binding convention; object-list builder means connected to the parser means for defining an object-list interface screen according to the predetermined parameters and the data structures created from the description file; dialog-box builder means connected to the parser means for defining a task dialog interface screen and a step menu interface screen, both according to the predetermined parameters and the data structures created from the description file; library means connected to the object-list builder means and the dialog-box builder means for storing and operating access functions used during operation of the developer-defined user interface; and display handler means connected to the object-list builder means, the dialog-box builder means and the library means, the display handler means for displaying at least one interface screen and managing interaction between the end-user and the application created by the developer.
|
1. A computer system comprising: an object-action manager for building and operating a developer-defined user interface within predetermined parameters, the developer-defined user interface managing interaction between an end-user and an application created by a developer, the object-action manager further comprising parser means for reading a description file and creating data structures from the description file, the description file being created by the developer using a simple definition syntax, the parser means creates the data structures according to a late binding convention; object-list builder means connected to the parser means for defining an object-list interface screen according to the predetermined parameters and the data structures created from the description file; dialog-box builder means connected to the parser means for defining a task dialog interface screen and a step menu interface screen, both according to the predetermined parameters and the data structures created from the description file; library means connected to the object-list builder means and the dialog-box builder means for storing and operating access functions used during operation of the developer-defined user interface; and display handler means connected to the object-list builder means, the dialog-box builder means and the library means, the display handler means for displaying at least one interface screen and managing interaction between the end-user and the application created by the developer. 2. The object-action manager as recited in claim 1, wherein the object-list interface screen comprises: an object-list region which displays a set of objects and associated attributes, said object-list region accessible by the end-user and being scrollably viewable; and a menubar disposed above the object-list region and having action means and view means, both for manipulating the set of objects and associated attributes displayed on the object-list region.
| 0.535346 |
1. A computer-implemented method comprising: accessing, by a computer system, a search history that identifies one or more search queries that were previously submitted to one or more search services by one or more computing devices that are associated with a user; identifying, based at least in part on the search queries included in the search history, a geographic location to which future voice input from the user is likely to relate, the geographic location being identified independent of a current geographic location of the one or more computing devices; before performing automated speech recognition on voice input from the one or more computing devices, selecting, by the computer system and based at least in part on the geographic location that is identified based at least in part on the search queries included in the search history, a first grammar from among a plurality of grammars, the first grammar including a vocabulary that is relevant to the geographic location that is identified based at least in part on the search queries included in the search history; and outputting, by the computer system, information that identifies the first grammar, wherein the outputted information causes a grammar used to analyze subsequently-received voice input from the one or more computing devices to be changed to the first grammar.
|
1. A computer-implemented method comprising: accessing, by a computer system, a search history that identifies one or more search queries that were previously submitted to one or more search services by one or more computing devices that are associated with a user; identifying, based at least in part on the search queries included in the search history, a geographic location to which future voice input from the user is likely to relate, the geographic location being identified independent of a current geographic location of the one or more computing devices; before performing automated speech recognition on voice input from the one or more computing devices, selecting, by the computer system and based at least in part on the geographic location that is identified based at least in part on the search queries included in the search history, a first grammar from among a plurality of grammars, the first grammar including a vocabulary that is relevant to the geographic location that is identified based at least in part on the search queries included in the search history; and outputting, by the computer system, information that identifies the first grammar, wherein the outputted information causes a grammar used to analyze subsequently-received voice input from the one or more computing devices to be changed to the first grammar. 6. The computer-implemented method of claim 1 , wherein the geographic location is identified further based on content that were previously presented on the one or more computing devices.
| 0.743935 |
17. A system comprising: a plurality of modules, each module comprising instructions retained on at least one machine-readable storage medium, that when executed by a machine perform identified operations, wherein the modules comprise: a file access module to access a main file name of a main file and to access a relationship definition associated with a package of data items, the relationship definition identifying a class of relationships between data items included in the package of data items, the relationship definition associating the main file with information stored in a related file, the at least one relationship definition including a template string and a first pattern string; and a matching module to determine whether a first portion of the main file name matches the first pattern string and, based on the determination, selectively to: match the main file name to the first pattern string; substitute a second substring of the main file name into the first pattern string; derive a second pattern string from the template string and the first pattern string having the substituted second substring of the main file name; and identify a related file name that matches the second pattern string; wherein the information stored in the related file is related to information contained in the main file, and wherein the information stored in the related file is for use in rendering the main file without altering the information contained in the main file.
|
17. A system comprising: a plurality of modules, each module comprising instructions retained on at least one machine-readable storage medium, that when executed by a machine perform identified operations, wherein the modules comprise: a file access module to access a main file name of a main file and to access a relationship definition associated with a package of data items, the relationship definition identifying a class of relationships between data items included in the package of data items, the relationship definition associating the main file with information stored in a related file, the at least one relationship definition including a template string and a first pattern string; and a matching module to determine whether a first portion of the main file name matches the first pattern string and, based on the determination, selectively to: match the main file name to the first pattern string; substitute a second substring of the main file name into the first pattern string; derive a second pattern string from the template string and the first pattern string having the substituted second substring of the main file name; and identify a related file name that matches the second pattern string; wherein the information stored in the related file is related to information contained in the main file, and wherein the information stored in the related file is for use in rendering the main file without altering the information contained in the main file. 27. The system of claim 17 , wherein information identifying a nature of a relationship is associated with the relationship definition.
| 0.595483 |
1. A non-transitory processor-readable medium storing code representing instructions to be executed by a processor, the code comprising code to cause the processor to: receive a first request from a user of a client device, the first request being to initiate a speech recognition engine for a first web page displayed at the client device; download, in response to the first request and from a server associated with a first party, the speech recognition engine to the client device; analyze, using the speech recognition engine and in response to the first request, content of the first web page including text in a first identified language to produce first analyzed content based on the first identified language, the content of the first web page being received from a server associated with a second party different from the first party; send a first signal, the first signal to cause the client device to present the first analyzed content at the client device; receive a second request, the second request being to initiate the speech recognition engine for a second web page displayed at the client device; analyze, using the speech recognition engine and in response to the second request, content of the second web page including text in a second identified language to produce second analyzed content based on the second identified language, the content of the second web page being received from a server associated with a third party different from the first party and the second party; and send a second signal, the second signal to cause the client device to present the second analyzed content at the client device.
|
1. A non-transitory processor-readable medium storing code representing instructions to be executed by a processor, the code comprising code to cause the processor to: receive a first request from a user of a client device, the first request being to initiate a speech recognition engine for a first web page displayed at the client device; download, in response to the first request and from a server associated with a first party, the speech recognition engine to the client device; analyze, using the speech recognition engine and in response to the first request, content of the first web page including text in a first identified language to produce first analyzed content based on the first identified language, the content of the first web page being received from a server associated with a second party different from the first party; send a first signal, the first signal to cause the client device to present the first analyzed content at the client device; receive a second request, the second request being to initiate the speech recognition engine for a second web page displayed at the client device; analyze, using the speech recognition engine and in response to the second request, content of the second web page including text in a second identified language to produce second analyzed content based on the second identified language, the content of the second web page being received from a server associated with a third party different from the first party and the second party; and send a second signal, the second signal to cause the client device to present the second analyzed content at the client device. 8. The non-transitory processor-readable medium of claim 1 , wherein the speech recognition engine utilizes an acoustic model and a pronunciation lexicon for the first identified language to analyze the content of the first web page.
| 0.902256 |
13. The workflow system of claim 12 , further comprising a component for updating the embedded object of at least one of the plurality of documents to reflect changes to the at least one of the plurality of documents following the embedding of the object.
|
13. The workflow system of claim 12 , further comprising a component for updating the embedded object of at least one of the plurality of documents to reflect changes to the at least one of the plurality of documents following the embedding of the object. 14. The workflow system of claim 13 , wherein the component for updating the object modifies information in the object relating to at least one of a page size, rotation of a page, imposition of pages.
| 0.906018 |
1. A method of detecting duplicate documents, comprising: at a server having one or more processors and memory: receiving documents from one or more databases of documents, wherein each received document is associated with a respective query independent score; generating a document content identifier for each received document, each document content identifier comprising an identifier of a respective document's content; indexing at least a subset of the received documents to produce an document index that maps terms to documents in the one or more databases of documents; and while performing the indexing, identifying respective sets of received documents having the same content identifier, selecting a single document in each respective set of documents, in accordance with the query independent scores associated with the documents in the respective set of documents, as a representative document for the respective set of received documents, indexing the representative document, and with respect to each respective set of received documents, including only the representative document in the document index.
|
1. A method of detecting duplicate documents, comprising: at a server having one or more processors and memory: receiving documents from one or more databases of documents, wherein each received document is associated with a respective query independent score; generating a document content identifier for each received document, each document content identifier comprising an identifier of a respective document's content; indexing at least a subset of the received documents to produce an document index that maps terms to documents in the one or more databases of documents; and while performing the indexing, identifying respective sets of received documents having the same content identifier, selecting a single document in each respective set of documents, in accordance with the query independent scores associated with the documents in the respective set of documents, as a representative document for the respective set of received documents, indexing the representative document, and with respect to each respective set of received documents, including only the representative document in the document index. 2. The method of claim 1 , wherein the document content identifier for a respective document comprises a fixed length fingerprint of document content of the respective document.
| 0.853377 |
1. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to: receive a natural language document comprising tabular data; analyze the tabular data within the natural language document to identify at least one portion of the tabular data comprising an erroneous or missing data value; determine, for the at least one portion, a functional dependency of the at least one portion of the tabular data on one or more other portions of the tabular data by reference to the natural language document; determine for the at least one portion, a correct data value for the erroneous or missing data value of the at least one portion of the tabular data based on the determined functional dependency of the at least one portion; modify the tabular data to replace the erroneous or missing data value with the correct data value and thereby generate a modified tabular data structure; and perform a processing operation on the modified tabular data structure to generate a resulting output.
|
1. A computer program product comprising a computer readable storage medium having a computer readable program stored therein, wherein the computer readable program, when executed on a computing device, causes the computing device to: receive a natural language document comprising tabular data; analyze the tabular data within the natural language document to identify at least one portion of the tabular data comprising an erroneous or missing data value; determine, for the at least one portion, a functional dependency of the at least one portion of the tabular data on one or more other portions of the tabular data by reference to the natural language document; determine for the at least one portion, a correct data value for the erroneous or missing data value of the at least one portion of the tabular data based on the determined functional dependency of the at least one portion; modify the tabular data to replace the erroneous or missing data value with the correct data value and thereby generate a modified tabular data structure; and perform a processing operation on the modified tabular data structure to generate a resulting output. 7. The computer program product of claim 1 , wherein the computer readable program causes the computing device to analyze the tabular data to identify at least one portion of the tabular data comprising an erroneous or missing data value at least by: analyzing the at least one portion of the tabular data to determine whether the at least one portion of tabular data comprises a regular structure having a repeated pattern of data or an identifiable dependency between cells in the at least one portion of the tabular data; and in response to a regular structure being identified in the at least one portion of the tabular data, performing further analysis to determine if one or more cells within the at least one portion of the tabular data do not conform with the regular structure.
| 0.5 |
8. The method of claim 7 , further comprising determining connection strengths of connections in social graphs based on factors associated with online games and factors associated with electronic social networks, a given connection strength of a given connection representing a relational strength between two users, wherein a connection strength between the first user and the second user is determined based on factors associated with the first online game, and wherein a connection strength between the first user and the fourth user is determined based on factors associated with the first electronic social network.
|
8. The method of claim 7 , further comprising determining connection strengths of connections in social graphs based on factors associated with online games and factors associated with electronic social networks, a given connection strength of a given connection representing a relational strength between two users, wherein a connection strength between the first user and the second user is determined based on factors associated with the first online game, and wherein a connection strength between the first user and the fourth user is determined based on factors associated with the first electronic social network. 10. The method of claim 8 , wherein the factors associated with electronic social networks include one or more of nature of a relationship within an electronic social network, time elapsed since forming a relationship within an electronic social network, privileges within an electronic social network, status within an electronic social network, average communication frequency within an electronic social network, a virtual goods inventory within an electronic social network, or time spent engaging an electronic social network.
| 0.888141 |
12. The system of claim 7 , wherein the command sentences are voice command sentences.
|
12. The system of claim 7 , wherein the command sentences are voice command sentences. 13. The system of the claim 12 , wherein for each action, generating a training set of command sentences from the corresponding set of command sentences includes removing each n-gram from each sentence in the corresponding set of command sentences for the action that is also not a first n-gram for the action.
| 0.896056 |
1. A method for matching entity names, comprising: performing a matching analysis between a first entity name and a second entity name comprising comparing a first entity category descriptor amended to the first entity name with a second entity category descriptor amended to the second entity name, the first entity category descriptor amended to the first entity name comprising at least one of, the first entity category descriptor substituted for at least a portion of the first entity name, or the first entity category descriptor appended to the first entity name, at least some of the performing a matching analysis implemented at least in part via a processing unit.
|
1. A method for matching entity names, comprising: performing a matching analysis between a first entity name and a second entity name comprising comparing a first entity category descriptor amended to the first entity name with a second entity category descriptor amended to the second entity name, the first entity category descriptor amended to the first entity name comprising at least one of, the first entity category descriptor substituted for at least a portion of the first entity name, or the first entity category descriptor appended to the first entity name, at least some of the performing a matching analysis implemented at least in part via a processing unit. 2. The method of claim 1 , comprising one or more of: amending the first entity category descriptor to the first entity name; or amending the second entity category descriptor to the second entity name.
| 0.693144 |
11. The method of claim 8 , wherein said generating the similarity score information comprises generating a first pseudo-document similarity score Score pdsim (s e →r e ) for the individual candidate strings which describes a strength of relatedness of the individual candidate strings to the entity reference string r e , and a second pseudo-document similarity score Score pdsim (r e →s e ) for the individual candidate strings which describes a strength of relatedness of the entity reference string r e to the individual candidate strings.
|
11. The method of claim 8 , wherein said generating the similarity score information comprises generating a first pseudo-document similarity score Score pdsim (s e →r e ) for the individual candidate strings which describes a strength of relatedness of the individual candidate strings to the entity reference string r e , and a second pseudo-document similarity score Score pdsim (r e →s e ) for the individual candidate strings which describes a strength of relatedness of the entity reference string r e to the individual candidate strings. 16. The method of claim 11 , wherein said generating the first pseudo-document similarity score Score pdsim (s e →r e ) for the individual candidate strings comprises: receiving a set of pseudo-documents PD, individual pseudo-documents pdoc in the set of pseudo-documents PD corresponding to a document d in the set of documents D, and individual pseudo-documents pdoc containing a set of terms found in queries that have been submitted and which have resulted in the selection of the document d; determining, for the individual candidate strings, a number of the individual pseudo-documents pdoc that contain all of the terms in the individual candidate strings; and generating the first pseudo-document similarity score Score pdsim (s e →r e ) for the individual candidate strings using said number.
| 0.576685 |
1. A method of editing a document, the method including: a) receiving data associated with the document, the data including mark-up language data; b) processing the received data to render at least part of the document for display in a first display area of a display, and displaying as rendered the at least part of the document in the first display area, wherein the rendering comprises formatting the at least part of the document based on the mark-up language data; c) processing the received data to render the at least part of the document for display in a second display area of the display, and displaying as rendered the at least part of the document in the second display area, wherein the rendering comprises formatting the at least part of the document based on the mark-up language data; d) receiving editing data; e) editing the at least part of the document displayed in the second display area using the editing data, and applying said editing to the at least part of the document displayed in the first display area; f) storing data associated with the at least part of the document edited in e) as a first edited version; g) receiving further editing data; h) further editing the at least part of the document displayed in the second display area using the further editing data and applying the further editing to the edited at least part of the document displayed in the first display area; and i) storing as a second edited version data associated with the further edited at least part of the document.
|
1. A method of editing a document, the method including: a) receiving data associated with the document, the data including mark-up language data; b) processing the received data to render at least part of the document for display in a first display area of a display, and displaying as rendered the at least part of the document in the first display area, wherein the rendering comprises formatting the at least part of the document based on the mark-up language data; c) processing the received data to render the at least part of the document for display in a second display area of the display, and displaying as rendered the at least part of the document in the second display area, wherein the rendering comprises formatting the at least part of the document based on the mark-up language data; d) receiving editing data; e) editing the at least part of the document displayed in the second display area using the editing data, and applying said editing to the at least part of the document displayed in the first display area; f) storing data associated with the at least part of the document edited in e) as a first edited version; g) receiving further editing data; h) further editing the at least part of the document displayed in the second display area using the further editing data and applying the further editing to the edited at least part of the document displayed in the first display area; and i) storing as a second edited version data associated with the further edited at least part of the document. 16. A method according to claim 1 , including selecting and displaying in the first display area the first edited version.
| 0.558453 |
15. A computer-implemented selection method, comprising acts of: receiving an in-domain corpus of bilingual sentences and an out-domain corpus of bilingual sentences; generating an in-domain machine translation system from the in-domain corpus; training an in-domain language model based on the in-domain corpus and training an out-domain language model based on the out-domain corpus; applying a similarity measure to a sentence of the out-domain corpus and the in-domain language model, and to the sentence and the out-domain language model, to obtain similarity scores; selecting relevant sentences from the out-domain corpus based on the scores to create a subselected out-domain translation system; combining the in-domain machine translation system and the subselected out-domain translation system to create a domain adapted machine translation system; and utilizing a processor that executes instructions stored in memory to perform at least one of the acts of generating, training, applying, selecting, or combining.
|
15. A computer-implemented selection method, comprising acts of: receiving an in-domain corpus of bilingual sentences and an out-domain corpus of bilingual sentences; generating an in-domain machine translation system from the in-domain corpus; training an in-domain language model based on the in-domain corpus and training an out-domain language model based on the out-domain corpus; applying a similarity measure to a sentence of the out-domain corpus and the in-domain language model, and to the sentence and the out-domain language model, to obtain similarity scores; selecting relevant sentences from the out-domain corpus based on the scores to create a subselected out-domain translation system; combining the in-domain machine translation system and the subselected out-domain translation system to create a domain adapted machine translation system; and utilizing a processor that executes instructions stored in memory to perform at least one of the acts of generating, training, applying, selecting, or combining. 16. The method of claim 15 , further comprising ranking the sentences for selection according to similarity scores, the scores obtained as a combination of a difference of the similarity scores according to the in-domain language model and the out-domain language model on each of a source side and a target side.
| 0.503293 |
9. A computer system for generating a related search phrase to search a data repository, comprising: a processor; a keyword repository configured to relate each of a plurality of user-submitted keywords to at least one of a plurality of derivative keywords; a facet repository configured to store a contextual relationship between a keyword of the plurality of user-submitted keywords and a facet, wherein the facet is a term that is contextually related to the plurality of user-submitted keywords based on historical usage by multiple users of the user-submitted keywords when searching in a domain of a product; and a management engine executing on the processor and operatively connected to the facet repository, the management engine configured to: receive a first search phrase for a search within the domain of the product; evaluate the first search phrase based on the domain of the product, wherein evaluating the first search phrase comprises: obtaining the plurality of user-submitted keywords from the first search phrase, querying the keyword repository with at least two user-submitted keywords of the plurality of user-submitted keywords to obtain a derivative keyword of the plurality of derivative keywords, and identifying the facet from the facet repository using the plurality of user-submitted keywords based on the contextual relationship between the facet and the user-submitted keywords, wherein the facet, the derivative keyword, and the plurality of user-submitted keywords are used to obtain a plurality of search terms, apply a backward filter to revise the plurality of search terms into a second search phrase, and identifying a previously submitted question based on the facet, the derivative keyword, and the plurality of user-submitted keywords, wherein the second search phrase and the previously submitted question are displayed in a user interface.
|
9. A computer system for generating a related search phrase to search a data repository, comprising: a processor; a keyword repository configured to relate each of a plurality of user-submitted keywords to at least one of a plurality of derivative keywords; a facet repository configured to store a contextual relationship between a keyword of the plurality of user-submitted keywords and a facet, wherein the facet is a term that is contextually related to the plurality of user-submitted keywords based on historical usage by multiple users of the user-submitted keywords when searching in a domain of a product; and a management engine executing on the processor and operatively connected to the facet repository, the management engine configured to: receive a first search phrase for a search within the domain of the product; evaluate the first search phrase based on the domain of the product, wherein evaluating the first search phrase comprises: obtaining the plurality of user-submitted keywords from the first search phrase, querying the keyword repository with at least two user-submitted keywords of the plurality of user-submitted keywords to obtain a derivative keyword of the plurality of derivative keywords, and identifying the facet from the facet repository using the plurality of user-submitted keywords based on the contextual relationship between the facet and the user-submitted keywords, wherein the facet, the derivative keyword, and the plurality of user-submitted keywords are used to obtain a plurality of search terms, apply a backward filter to revise the plurality of search terms into a second search phrase, and identifying a previously submitted question based on the facet, the derivative keyword, and the plurality of user-submitted keywords, wherein the second search phrase and the previously submitted question are displayed in a user interface. 11. The computer system of claim 9 , wherein the domain of the product is tax preparation.
| 0.558115 |
10. One or more non-transitory computer-readable media storing sequences of instructions, which, when executed by one or more processors, cause: a database server establishing a plurality of database sessions for access to a plurality of pluggable databases in a container database, wherein said container database includes a separate database dictionary for each pluggable database of said plurality of pluggable databases, wherein said database server establishing a plurality of database sessions includes, for each database session of said plurality of database sessions: receiving a connection request; determining that the connection request is for access to a particular pluggable database of said plurality of said pluggable databases; and attaching the respective database dictionary of said particular pluggable database to said each database session.
|
10. One or more non-transitory computer-readable media storing sequences of instructions, which, when executed by one or more processors, cause: a database server establishing a plurality of database sessions for access to a plurality of pluggable databases in a container database, wherein said container database includes a separate database dictionary for each pluggable database of said plurality of pluggable databases, wherein said database server establishing a plurality of database sessions includes, for each database session of said plurality of database sessions: receiving a connection request; determining that the connection request is for access to a particular pluggable database of said plurality of said pluggable databases; and attaching the respective database dictionary of said particular pluggable database to said each database session. 13. The non-transitory computer-readable media of claim 10 , wherein said container database includes a root database dictionary, said root database dictionary defining each pluggable database of said plurality of pluggable databases.
| 0.725584 |
11. A system comprising: one or more processors; and computer-readable media comprising instructions that are executable by the one or more processors to implement a user interface that is operable to: present, in a first portion of the user interface, source content comprising part of a source document; present, in a second portion of the user interface and concurrently with the source content presented in the first portion of the user interface, markup and style information from a source of style information that is used to style an identified portion of the source content for display, the markup and style information presented responsive to identification by a user of the portion of source content from the first portion of the user interface, and the corresponding markup and style information that will be extracted from the source of style information being highlighted in the second portion of the user interface responsive to receiving a user input to copy the identified portion of source content; and receive a different user input to paste the identified portion of source content into target content with the corresponding markup and style information applied, the corresponding style information demarcated separately from elements of the corresponding markup that define the identified portion of source content that is copied and pasted, and the corresponding style information including style information that is external to the source document.
|
11. A system comprising: one or more processors; and computer-readable media comprising instructions that are executable by the one or more processors to implement a user interface that is operable to: present, in a first portion of the user interface, source content comprising part of a source document; present, in a second portion of the user interface and concurrently with the source content presented in the first portion of the user interface, markup and style information from a source of style information that is used to style an identified portion of the source content for display, the markup and style information presented responsive to identification by a user of the portion of source content from the first portion of the user interface, and the corresponding markup and style information that will be extracted from the source of style information being highlighted in the second portion of the user interface responsive to receiving a user input to copy the identified portion of source content; and receive a different user input to paste the identified portion of source content into target content with the corresponding markup and style information applied, the corresponding style information demarcated separately from elements of the corresponding markup that define the identified portion of source content that is copied and pasted, and the corresponding style information including style information that is external to the source document. 12. The system as recited in claim 11 , wherein the user interface is further operable to receive a user selection of markup and style information from the second portion of the user interface, the user selection causing the user interface to emphasize corresponding portions of the source content in the first portion of the user interface.
| 0.5 |
1. A method for generating a schema for data asset information, the method comprising: accessing complex type information corresponding to a logical relational data model that defines an organization of the data asset information, the logical relational data model including a parent entity and child entities corresponding to the parent entity; treating the complex type information to produce scrubbed complex type information, said treating of the complex type information including removing at least one foreign key from at least one of the child entities; translating the scrubbed complex type information to produce a hierarchical data model corresponding to the logical relational data model, the hierarchical data model including a plurality of containers respectively corresponding to the child entities of the logical relational data model, the treating and translating being carried out such that the at least one foreign key removed from the at least one child entity is omitted from a first level container in the hierarchical data model and is present in a second level container in the hierarchical data model, the first level container paralleling the child entity from which the foreign key is removed, the second level container being at a higher level in the hierarchical data model than that of the first level container; and generating a schema for the data asset information based upon the hierarchical data model.
|
1. A method for generating a schema for data asset information, the method comprising: accessing complex type information corresponding to a logical relational data model that defines an organization of the data asset information, the logical relational data model including a parent entity and child entities corresponding to the parent entity; treating the complex type information to produce scrubbed complex type information, said treating of the complex type information including removing at least one foreign key from at least one of the child entities; translating the scrubbed complex type information to produce a hierarchical data model corresponding to the logical relational data model, the hierarchical data model including a plurality of containers respectively corresponding to the child entities of the logical relational data model, the treating and translating being carried out such that the at least one foreign key removed from the at least one child entity is omitted from a first level container in the hierarchical data model and is present in a second level container in the hierarchical data model, the first level container paralleling the child entity from which the foreign key is removed, the second level container being at a higher level in the hierarchical data model than that of the first level container; and generating a schema for the data asset information based upon the hierarchical data model. 3. The method of claim 1 , wherein said treating of the complex type information comprises merging one of the child entities into the parent entity.
| 0.554257 |
15. The computer readable medium of claim 14 , further comprising instructions for: pairing available players based on time spent waiting pairing and on player demographic information; and conveying on a graphical interface a clue-selection game display to the clue-giving player and a guessing game display to the guessing player, wherein the clue-selection game display provides a selection of clues and cost weights for the clues in the selection of clues to the clue-giving player and the guessing game display provides for display of the selected clues to the guessing player.
|
15. The computer readable medium of claim 14 , further comprising instructions for: pairing available players based on time spent waiting pairing and on player demographic information; and conveying on a graphical interface a clue-selection game display to the clue-giving player and a guessing game display to the guessing player, wherein the clue-selection game display provides a selection of clues and cost weights for the clues in the selection of clues to the clue-giving player and the guessing game display provides for display of the selected clues to the guessing player. 16. The computer readable medium of claim 15 , further comprising instructions for: presenting a shared countdown clock visible in the clue-selection game display and in the guessing game display that indicates a time remaining for paired players to play one game round.
| 0.895538 |
8. A non-transitory computer readable medium having stored thereon instructions which when executed by a processor cause the processor to perform the method of: receiving more than one data set, each data set containing respective data records from one or more respective data sources; merging data of the respective data records into respective single records, each of the respective single records containing one or more data items from corresponding data records; comparing data within the respective single records to identify delta data within the respective single records; calculating respective single best records for data located in each of the respective single records containing delta data; if a discrepancy exists in a data value among the respective single records, executing a refinement action rule; and the refinement action rule based on data steward definitions monitored by an interactive dialog box to train a heuristic algorithm associated with at least one filter configured to perform a fuzzy search of data records.
|
8. A non-transitory computer readable medium having stored thereon instructions which when executed by a processor cause the processor to perform the method of: receiving more than one data set, each data set containing respective data records from one or more respective data sources; merging data of the respective data records into respective single records, each of the respective single records containing one or more data items from corresponding data records; comparing data within the respective single records to identify delta data within the respective single records; calculating respective single best records for data located in each of the respective single records containing delta data; if a discrepancy exists in a data value among the respective single records, executing a refinement action rule; and the refinement action rule based on data steward definitions monitored by an interactive dialog box to train a heuristic algorithm associated with at least one filter configured to perform a fuzzy search of data records. 12. The computer readable medium of claim 8 , further including executable instructions to cause a processor to perform the steps of: applying string pattern analysis to the data records to identify data field format inconsistencies; displaying on a user interface a graphical representation of the aggregate of occurrences of the data field format inconsistencies; capturing an interaction by a user with the graphical representation of the aggregate of occurrences; and storing the interaction in a data store as a refinement action rule.
| 0.514667 |
1. A four-corner cut square Chinese character input method based on excellent code, comprising the steps of: assigning predesigned code table to corresponding keys of a keyboard; inputting Chinese Character according to four-corner coding of Chinese character by using the corresponding keys on the keyboard, an inputting rule of Chinese character coding including twenty cutting rules which comprise the characteristic of the excellent code combining with cutting skill, wherein the twenty cutting rules are regulated by first and second ones of the twenty cutting rules and include the following requirements: taking code in four-corner order: upper left corner, upper right corner, lower left corner and lower right corner, once a code is taken from a corner, the cutting for this corner is completed and will be continued in next corner, after a stroke is taken from a corner, the rest strokes stand still and wait to be cut for the next corner; using horizontal, vertical cutting lines or head-to-tail cutting lines and an outer frame of the Chinese character to constitute different squares including shapes of and -shaped cutting frames; each cutting square only contains one definite code; excellent codes are systematic and there are no superposed strokes and crossed strokes between excellent codes, matriculated code can be separated from other strokes and can separate other codes, each cutting square contains one code only, including the cutting squares of shapes of and -shaped cutting frames; red code is full-cut and fully matriculated when it is cut; two incomplete codes are allowed to share a common stroke, a cutting point exists in a middle section of a common stroke, a cutting line passes through the cutting point to separate the common stroke into two complete strokes, the cutting line is not allowed to cut strokes that have no cutting point; inserting or adding radical codes, or other radical codes lacking some strokes, in order to prevent overlap among the Chinese characters of same type, including: cutting skill is implemented by: understanding of the twenty cutting rules; grasping excellent code table; apart from considering original order of the strokes and the squares, black code is cut according to the following three cutting steps: first step: first cutting line is placed between two parallel opposite sides of the outer frame of the Chinese character and can be vertical or horizontal, including: if the first step fails or there is more than one code in the cutting square, the second step will be used; second step: first and second cutting lines which are vertical to each other and run across two parallel sides, there are more than one code in a rectangle formed by the first cutting line, the second cutting line is carried out by turning 90 degrees with respect to the first cutting line and runs between two parallel sides: one side is the first cutting line, and the other side is the side of the outer frame of the Chinese character, the code is taken from a small square which is closest to the cutting corner, including, the two cutting lines of the second step are characterized that: they all run across or are connected between two parallel sides; if the second step fails, the third step will be used; third step: curved cutting: at least two cutting lines which turn continuously 90 degrees with respect to one another and are characterized in that: at least one or more of the cutting lines doesn't run across two parallel sides and constitutes different kinds of shapes of or -shaped cutting frames, all curved cutting lines are red codes, including,
|
1. A four-corner cut square Chinese character input method based on excellent code, comprising the steps of: assigning predesigned code table to corresponding keys of a keyboard; inputting Chinese Character according to four-corner coding of Chinese character by using the corresponding keys on the keyboard, an inputting rule of Chinese character coding including twenty cutting rules which comprise the characteristic of the excellent code combining with cutting skill, wherein the twenty cutting rules are regulated by first and second ones of the twenty cutting rules and include the following requirements: taking code in four-corner order: upper left corner, upper right corner, lower left corner and lower right corner, once a code is taken from a corner, the cutting for this corner is completed and will be continued in next corner, after a stroke is taken from a corner, the rest strokes stand still and wait to be cut for the next corner; using horizontal, vertical cutting lines or head-to-tail cutting lines and an outer frame of the Chinese character to constitute different squares including shapes of and -shaped cutting frames; each cutting square only contains one definite code; excellent codes are systematic and there are no superposed strokes and crossed strokes between excellent codes, matriculated code can be separated from other strokes and can separate other codes, each cutting square contains one code only, including the cutting squares of shapes of and -shaped cutting frames; red code is full-cut and fully matriculated when it is cut; two incomplete codes are allowed to share a common stroke, a cutting point exists in a middle section of a common stroke, a cutting line passes through the cutting point to separate the common stroke into two complete strokes, the cutting line is not allowed to cut strokes that have no cutting point; inserting or adding radical codes, or other radical codes lacking some strokes, in order to prevent overlap among the Chinese characters of same type, including: cutting skill is implemented by: understanding of the twenty cutting rules; grasping excellent code table; apart from considering original order of the strokes and the squares, black code is cut according to the following three cutting steps: first step: first cutting line is placed between two parallel opposite sides of the outer frame of the Chinese character and can be vertical or horizontal, including: if the first step fails or there is more than one code in the cutting square, the second step will be used; second step: first and second cutting lines which are vertical to each other and run across two parallel sides, there are more than one code in a rectangle formed by the first cutting line, the second cutting line is carried out by turning 90 degrees with respect to the first cutting line and runs between two parallel sides: one side is the first cutting line, and the other side is the side of the outer frame of the Chinese character, the code is taken from a small square which is closest to the cutting corner, including, the two cutting lines of the second step are characterized that: they all run across or are connected between two parallel sides; if the second step fails, the third step will be used; third step: curved cutting: at least two cutting lines which turn continuously 90 degrees with respect to one another and are characterized in that: at least one or more of the cutting lines doesn't run across two parallel sides and constitutes different kinds of shapes of or -shaped cutting frames, all curved cutting lines are red codes, including, 3. The four-corner cut square Chinese character input method based on excellent code as claimed in claim 1 , wherein a focus of attention of cutting skill is on squares so as not to break an original order of the squares, and a fourth one of the twenty cutting rules is explained as follows: the focus of attention during cutting is a key process of cutting, which has a direct influence on the accuracy of cutting the squares; when cutting a corner, the focus of attention is that: it should be the square which is located closest to the corner, in consistent with the cutting rule, and there is only one qualified code with a largest number of strokes, that is: the focus of attention is on the square; it will cause misjudgement when the focus of attention is put on the strokes; focus of attention when cutting is put on the strokes if straight cutting is preemptively used without considering the original squares-cutting order, the code which is far away from a cutting corner will be mistakenly cut, including: a second code of the Chinese character will be which is exposed out of , the second code of the Chinese character will be which is exposed out of , the code of in a middle of a lower part of the Chinese characters will be mistakenly cut without remembering to cut the code with more strokes; target to be cut: focus of attention is on the square which is closest to the cutting corner, the square only takes a best fit (qualified) code with the largest number of strokes; here follows are six examples of three steps: the stroke of the Chinese characters according to the cutting rule No. 15: the tail of the stroke should be pulled straight a little, which causes the square of the moves out of the cutting scope of the lower left corner, and as a result, a third code taken by the lower left corner cutting will be the stroke or which is square located closest to the lower left corner; normal cutting rule: the lower left and right corner cuttings to the last stroke are vertical cuttings which are made to take the third code and the fourth code , this cutting is consistent with the correct cutting rule; if the tail of the stroke is bent to the lower left corner to become , plus it is a red code, then curved cutting is used to take the third code , and a fourth code this is another inaccurate result; two different results appear due to different ways of writing, and such amphibolous results are not allowed; therefore, the cutting rule No. 12 is added to solve the above problem, the remanent stroke is cut into two parts and which are arranged in an up-and-down manner and a horizontal interval appears between the and , so that the remanent stroke of the third code becomes: the red code should use the curved cutting in the first place and now changes to use horizontal cutting, and as a result, the third code is still and the fourth code is putting an end to the two amphibolous results; the different Chinese characters have the same remanent stroke by using different corner cuttings, namely, vertical cutting or horizontal cutting; after the first cutting to the Chinese characters is made by curved cutting to take the first red code , please note that the second code can absolutely not be made by vertically cutting an exposed right arm, namely the stroke , from the right side of the , such cutting method will completely break the original order of the squares; if the second code of an upper right corner of the Chinese character is taken by vertically cutting the stroke exposed out of , it will break the original order of the squares, let alone that the is a red code which is not allowed to be far away from the cutting corner; the right cutting is such that: the second code of the upper right corner of the Chinese character should be made by curved cutting to take the stroke ; the third code of the two Chinese character is a two-stroke code, and their fourth code is a red code which has the priority to be cut; the code is inferior to , including: left downward stroke , hook, hook, left downward stroke , hook, hook; the cutting to the remanent strokes of the second code of the Chinese characters should be made by moving the out of the horizontal line of the instead of vertically cutting the which is located at the right side and far away from the cutting corner including: cutting the according to three steps—a cutting rule No. 18.
| 0.5 |
1. A method, comprising: receiving, at a user interface of a computing device, repair-related information associated with a repair order to repair a complaint about a vehicle, wherein the repair-related information comprises information about a first repair attribute of one or more repair attributes, and wherein the first repair attribute is associated with a first taxonomy of attributes; determining a first ontology related to the first repair attribute and a first template using the computing device for: determining a first attribute group in the first taxonomy of attributes associated with the first repair attribute, determining the first template based on the first repair attribute and the first attribute group, wherein the first ontology and/or the first taxonomy include one or more preferred terms that fit a canonical representation of terms; determining modified repair-related information using the user interface of the computing device by at least: determining that the repair-related information comprises a non-preferred term using the first ontology and/or first taxonomy, providing one or more preferred-term selections using the user interface, wherein the one or more preferred-term selections are associated with the one or more preferred terms that fit the canonical representation of terms, receiving a particular preferred-term selection of the one or more preferred-term selections using the user interface, the particular preferred-term selection associated with a particular preferred term of the one or more preferred terms that fit the canonical representation of terms, utilizing the first template to modify at least a first portion of the repair-related information comprising the information about the first repair attribute to fit the canonical representation of terms by replacing the non-preferred term in the repair-related information with the particular preferred term using the computing device, and displaying the modified repair-related information using the user interface; and generating an output of the computing device related to the repair order, the output comprising the modified repair-related information.
|
1. A method, comprising: receiving, at a user interface of a computing device, repair-related information associated with a repair order to repair a complaint about a vehicle, wherein the repair-related information comprises information about a first repair attribute of one or more repair attributes, and wherein the first repair attribute is associated with a first taxonomy of attributes; determining a first ontology related to the first repair attribute and a first template using the computing device for: determining a first attribute group in the first taxonomy of attributes associated with the first repair attribute, determining the first template based on the first repair attribute and the first attribute group, wherein the first ontology and/or the first taxonomy include one or more preferred terms that fit a canonical representation of terms; determining modified repair-related information using the user interface of the computing device by at least: determining that the repair-related information comprises a non-preferred term using the first ontology and/or first taxonomy, providing one or more preferred-term selections using the user interface, wherein the one or more preferred-term selections are associated with the one or more preferred terms that fit the canonical representation of terms, receiving a particular preferred-term selection of the one or more preferred-term selections using the user interface, the particular preferred-term selection associated with a particular preferred term of the one or more preferred terms that fit the canonical representation of terms, utilizing the first template to modify at least a first portion of the repair-related information comprising the information about the first repair attribute to fit the canonical representation of terms by replacing the non-preferred term in the repair-related information with the particular preferred term using the computing device, and displaying the modified repair-related information using the user interface; and generating an output of the computing device related to the repair order, the output comprising the modified repair-related information. 13. The method of claim 1 , wherein the first template comprises the first repair attribute.
| 0.619639 |
8. The method of claim 6 , further comprising: if the low execution plan and the high execution plan do not equal the current execution plan, then executing the selected expression; obtaining feedback from the executed selected expression; and obtaining exact cardinalities for the selected expression.
|
8. The method of claim 6 , further comprising: if the low execution plan and the high execution plan do not equal the current execution plan, then executing the selected expression; obtaining feedback from the executed selected expression; and obtaining exact cardinalities for the selected expression. 9. The method of claim 8 , further comprising: selecting a next expression from the subset of the set of relevant expressions; and using the exact cardinalities for the selected expression to refine the lower bound and the upper bound for the next expression.
| 0.87263 |
6. A computer-implemented method comprising: receiving, by a computing device comprising one or more processors, a first request to generate a first audio representation of a first text; determining, based at least on a first characteristic of the computing device, to use a local text-to-speech module to generate the first audio representation; generating the first audio representation using the local text-to-speech module; receiving a second request to generate a second audio representation of a second text; determining, based at least on a second characteristic of the computing device, to use a remote text-to-speech system to generate the second audio representation; sending the second text to the remote text-to-speech system; and receiving the second audio representation from the remote text-to-speech system.
|
6. A computer-implemented method comprising: receiving, by a computing device comprising one or more processors, a first request to generate a first audio representation of a first text; determining, based at least on a first characteristic of the computing device, to use a local text-to-speech module to generate the first audio representation; generating the first audio representation using the local text-to-speech module; receiving a second request to generate a second audio representation of a second text; determining, based at least on a second characteristic of the computing device, to use a remote text-to-speech system to generate the second audio representation; sending the second text to the remote text-to-speech system; and receiving the second audio representation from the remote text-to-speech system. 14. The computer-implemented method of claim 6 , further comprising: determining to store second voice data on the computing device based at least on usage data regarding previous requests for audio representations, the second voice data corresponding to the second voice; and receiving the second voice data from a server for storage on the computing device.
| 0.598775 |
16. A system comprising: a data repository that stores language capabilities of users within a pre-determined user group, the language capabilities of the users within the pre-determined user group being determined automatically based on mining a corpus of electronic documents associated with the pre-determined user group; and an analysis engine comprising a processor, the analysis engine configured to: receive data entered at a user interface of a user device by a first user associated with the pre-determined user group, the data comprising an identification of a) a source language and b) a target language to which translation from the source language is requested, determine, using data from the data repository, that one or more second users of the pre-determined user group is associated with the source language and associated with the target language, each of the second users being a candidate to perform a translation from the source language to the target language, and cause an identification of the one or more second users, each of whom is a candidate to perform a translation from the source language to the target language, to be transmitted to the user device for display on the user interface; wherein the display of the identification of the one or more second users is based on a permission that allows a corresponding second user to be identified to one or more other users in the pre-determined user group.
|
16. A system comprising: a data repository that stores language capabilities of users within a pre-determined user group, the language capabilities of the users within the pre-determined user group being determined automatically based on mining a corpus of electronic documents associated with the pre-determined user group; and an analysis engine comprising a processor, the analysis engine configured to: receive data entered at a user interface of a user device by a first user associated with the pre-determined user group, the data comprising an identification of a) a source language and b) a target language to which translation from the source language is requested, determine, using data from the data repository, that one or more second users of the pre-determined user group is associated with the source language and associated with the target language, each of the second users being a candidate to perform a translation from the source language to the target language, and cause an identification of the one or more second users, each of whom is a candidate to perform a translation from the source language to the target language, to be transmitted to the user device for display on the user interface; wherein the display of the identification of the one or more second users is based on a permission that allows a corresponding second user to be identified to one or more other users in the pre-determined user group. 22. The system of claim 16 , wherein the permission is provided by the corresponding second user.
| 0.65 |
1. A computer-implemented method comprising: receiving, by a first computing device that is configured to respond to a particular, predefined hotword and from a second computing device that is in a vicinity of the first computing device, data indicating that the second computing device is configured to respond to the particular, predefined hotword; transmitting, to the second computing device and by the first computing device, data indicating that the first computing device is configured to respond to the particular, predefined hotword; determining a group identifier that identifies the first computing device and the second computing device; receiving, by the first computing device, audio data that corresponds to an utterance; determining that the utterance likely includes the particular, predefined hotword; in response to determining that the utterance likely includes the particular, predefined hotword, transmitting, to a server, (i) data indicating that the first computing device likely received the particular, predefined hotword, (ii) data identifying the first computing device, and (iii) the group identifier that identifies the first computing device and the second computing device; receiving, from the server, an instruction to commence speech recognition processing on the audio data; and in response to receiving the instruction to commence speech recognition processing on the audio data, processing at least a portion of the audio data using an automated speech recognizer on the first computing device.
|
1. A computer-implemented method comprising: receiving, by a first computing device that is configured to respond to a particular, predefined hotword and from a second computing device that is in a vicinity of the first computing device, data indicating that the second computing device is configured to respond to the particular, predefined hotword; transmitting, to the second computing device and by the first computing device, data indicating that the first computing device is configured to respond to the particular, predefined hotword; determining a group identifier that identifies the first computing device and the second computing device; receiving, by the first computing device, audio data that corresponds to an utterance; determining that the utterance likely includes the particular, predefined hotword; in response to determining that the utterance likely includes the particular, predefined hotword, transmitting, to a server, (i) data indicating that the first computing device likely received the particular, predefined hotword, (ii) data identifying the first computing device, and (iii) the group identifier that identifies the first computing device and the second computing device; receiving, from the server, an instruction to commence speech recognition processing on the audio data; and in response to receiving the instruction to commence speech recognition processing on the audio data, processing at least a portion of the audio data using an automated speech recognizer on the first computing device. 2. The method of claim 1 , comprising: receiving, by the first computing device, additional audio data that corresponds to an additional utterance; determining that the additional utterance likely includes the particular, predefined hotword; in response to determining that the utterance likely includes the particular, predefined hotword, transmitting, to the server, (i) the data indicating that the first computing device likely received the particular, predefined hotword, (ii) the data identifying the first computing device, and (iii) the data identifying the group of nearby computing devices that includes the first computing device; receiving, from the server, an instruction to not commence speech recognition processing on the audio data; and in response to receiving the instruction to not commence speech recognition processing on the audio data, ceasing processing of the audio data using the automated speech recognizer on the first computing device.
| 0.5 |
1. A system for storing, retrieving and displaying a character, where the character is to be displayed in either a compressed character display format or a fixed-width character display format, which comprises: memory means for storing the character as an encoded font data, the encoded font data comprising a plurality of bytes; each byte of the encoded font data comprising a first set and a second set where each set comprises at least one bit, the collective first sets for the plurality of bytes representing both a fixed-width character and a compressed character, and the second set indicating whether the corresponding first set of the byte should be displayed when the system is in the compressed character display format; and means responsive to a control signal for causing the character to be displayed on a display, a first value for the control signal causing the character to be displayed in the fixed-width character display format and a second value for the control signal causing the character to be displayed in the compressed character display format.
|
1. A system for storing, retrieving and displaying a character, where the character is to be displayed in either a compressed character display format or a fixed-width character display format, which comprises: memory means for storing the character as an encoded font data, the encoded font data comprising a plurality of bytes; each byte of the encoded font data comprising a first set and a second set where each set comprises at least one bit, the collective first sets for the plurality of bytes representing both a fixed-width character and a compressed character, and the second set indicating whether the corresponding first set of the byte should be displayed when the system is in the compressed character display format; and means responsive to a control signal for causing the character to be displayed on a display, a first value for the control signal causing the character to be displayed in the fixed-width character display format and a second value for the control signal causing the character to be displayed in the compressed character display format. 2. The system according to claim 1, wherein the display is a dot matrix display.
| 0.590627 |
1. A method comprising: receiving, by one or more computing devices, a query associated with a first user of a social-networking system, the query comprising a first user attribute, the social-networking system comprising a graph that comprises a plurality of nodes and edges connecting the nodes, at least one node in the graph corresponding to the first user; identifying, by one or more of the computing devices, a plurality of second users of a third-party-application system that is external to the social-networking system, each of the second users of the third-party-application system being associated with a user attribute matching the first user attribute of the query; identifying, by one or more of the computing devices, one or more third users of the social-networking system, for each of the third users at least one node in the graph corresponding to the third user, at least one of the nodes corresponding to the first user and at least one of the nodes corresponding to a third user being connected to each other by an edge; comparing, by one or more of the computing devices, each of the second users of the third-party-application system with each of the third users of the social-networking system to identify one or more of the second users who match the third users based on the first user attribute of the query; and providing, by one or more of the computing devices, a search results page responsive to the receive query, the search results page comprising information associated with each of the second users of the third-party-application system who match the third users.
|
1. A method comprising: receiving, by one or more computing devices, a query associated with a first user of a social-networking system, the query comprising a first user attribute, the social-networking system comprising a graph that comprises a plurality of nodes and edges connecting the nodes, at least one node in the graph corresponding to the first user; identifying, by one or more of the computing devices, a plurality of second users of a third-party-application system that is external to the social-networking system, each of the second users of the third-party-application system being associated with a user attribute matching the first user attribute of the query; identifying, by one or more of the computing devices, one or more third users of the social-networking system, for each of the third users at least one node in the graph corresponding to the third user, at least one of the nodes corresponding to the first user and at least one of the nodes corresponding to a third user being connected to each other by an edge; comparing, by one or more of the computing devices, each of the second users of the third-party-application system with each of the third users of the social-networking system to identify one or more of the second users who match the third users based on the first user attribute of the query; and providing, by one or more of the computing devices, a search results page responsive to the receive query, the search results page comprising information associated with each of the second users of the third-party-application system who match the third users. 3. The method of claim 1 , wherein the third users are identified based at least in part on one or more second user attributes of the first user.
| 0.517771 |
36. A computer-readable medium containing a program which, when executed by a processor, performs a process of querying physical data logically represented by a data abstraction model, wherein the physical data being queried is contained in data structures generated from a data source having a different schema from the data structures containing the physical data being queried, the process comprising: receiving an abstract query comprising logical fields and corresponding values, wherein each of the logical fields is defined in the data abstraction model and wherein one or more of the logical fields are result fields to be returned by execution of the abstract query; and transforming, by operation of a processor, the abstract query into an executable query capable of being executed against the physical data; wherein the transforming is done using the data abstraction model and wherein the data abstraction model defines a specific path for traversing the data structures containing the physical data to reach the one or more result fields.
|
36. A computer-readable medium containing a program which, when executed by a processor, performs a process of querying physical data logically represented by a data abstraction model, wherein the physical data being queried is contained in data structures generated from a data source having a different schema from the data structures containing the physical data being queried, the process comprising: receiving an abstract query comprising logical fields and corresponding values, wherein each of the logical fields is defined in the data abstraction model and wherein one or more of the logical fields are result fields to be returned by execution of the abstract query; and transforming, by operation of a processor, the abstract query into an executable query capable of being executed against the physical data; wherein the transforming is done using the data abstraction model and wherein the data abstraction model defines a specific path for traversing the data structures containing the physical data to reach the one or more result fields. 37. The computer-readable medium of claim 36 , wherein the specific path is derived from relationships in the data source.
| 0.651977 |
4. The system according to claim 3 , wherein the incomplete information is provided to the recognition engine via the keying module for generating a precise location information and a precise field value information for the at least the portion of the object; wherein the precise location and field value information for the at least the portion of the object are provided to the keying module.
|
4. The system according to claim 3 , wherein the incomplete information is provided to the recognition engine via the keying module for generating a precise location information and a precise field value information for the at least the portion of the object; wherein the precise location and field value information for the at least the portion of the object are provided to the keying module. 5. The system according to claim 4 , wherein the second information concerning the at least the portion of the object includes object and data model definitions; wherein based on the object and data model definitions and the location and field value information, the keying module generates enriched object definitions and to provide document and data model visualization to the user.
| 0.889098 |
1. A method for assisting a user during web navigation, said web navigating performed over a communication network including one or more proxy servers, one or more web sites and at least one remote terminal, said communication network interconnecting said web site, said server, and said remote terminal, said method comprising the following steps: processing a request from said at least one remote terminal of one or more web pages from said one or more web sites; downloading said requested one or more web pages; automatically capturing a abstract containing only text from each of said one or more downloaded web pages and storing each textual abstract with their associated hyperlink in a database, wherein an abstract of a given downloaded web page comprises elements of said given downloaded web page including at least the following: title and one or more keywords, said elements previously identified based on received inputs; and transforming at least one HTML anchor element in each of said one or more downloaded web pages to render abstracts containing only text upon selecting such associated hyperlinks in a web page requested by said at least one remote terminal.
|
1. A method for assisting a user during web navigation, said web navigating performed over a communication network including one or more proxy servers, one or more web sites and at least one remote terminal, said communication network interconnecting said web site, said server, and said remote terminal, said method comprising the following steps: processing a request from said at least one remote terminal of one or more web pages from said one or more web sites; downloading said requested one or more web pages; automatically capturing a abstract containing only text from each of said one or more downloaded web pages and storing each textual abstract with their associated hyperlink in a database, wherein an abstract of a given downloaded web page comprises elements of said given downloaded web page including at least the following: title and one or more keywords, said elements previously identified based on received inputs; and transforming at least one HTML anchor element in each of said one or more downloaded web pages to render abstracts containing only text upon selecting such associated hyperlinks in a web page requested by said at least one remote terminal. 7. A method for assisting a user during web navigation, as per claim 1 , wherein said textual abstracts are automatically captured each time said one or more web pages are downloaded.
| 0.664914 |
11. A computer program product tangibly embodied in a non-transitory computer-readable storage medium for generating a character-by-character alignment between a first and a second character sequence, the computer program product being operable to cause a computer processor to: align the two character sequences in a hierarchical manner utilizing a plurality of hierarchical levels, wherein the first character sequence is an optical character recognition (OCR) text output of a document, and the second character sequence is a separate electronic version of the document, and wherein: for a first hierarchical level, unique words of the second character sequence are aligned with corresponding words of the first character sequence and unique word anchors for a lower hierarchical level are designated; for each hierarchical level below the first hierarchical level and above a final hierarchical level, instructions for aligning the two character sequences include: parsing the two character sequences at a current hierarchical level into character subsequences, aligning the character subsequences, and designating the character subsequences at the current hierarchical level as anchors, the parsing of the character sequences and aligning of the character subsequences being performed between the anchors generated from an immediately previous hierarchical level if the current hierarchical level is below the first hierarchical level; and for the final hierarchical level, the instructions for aligning include: performing character-by-character alignment between the first character sequence and the second character sequence by aligning each character in the first character sequence at the final hierarchical level to each respective character in the second character sequence at the final hierarchical level, each of the characters being between anchors generated from an immediately previous hierarchical level, and identifying extra OCR text, the extra OCR text comprising text that is included in the first character sequence and that is not included in the second character sequence, and eliminating the extra OCR text from the OCR text output.
|
11. A computer program product tangibly embodied in a non-transitory computer-readable storage medium for generating a character-by-character alignment between a first and a second character sequence, the computer program product being operable to cause a computer processor to: align the two character sequences in a hierarchical manner utilizing a plurality of hierarchical levels, wherein the first character sequence is an optical character recognition (OCR) text output of a document, and the second character sequence is a separate electronic version of the document, and wherein: for a first hierarchical level, unique words of the second character sequence are aligned with corresponding words of the first character sequence and unique word anchors for a lower hierarchical level are designated; for each hierarchical level below the first hierarchical level and above a final hierarchical level, instructions for aligning the two character sequences include: parsing the two character sequences at a current hierarchical level into character subsequences, aligning the character subsequences, and designating the character subsequences at the current hierarchical level as anchors, the parsing of the character sequences and aligning of the character subsequences being performed between the anchors generated from an immediately previous hierarchical level if the current hierarchical level is below the first hierarchical level; and for the final hierarchical level, the instructions for aligning include: performing character-by-character alignment between the first character sequence and the second character sequence by aligning each character in the first character sequence at the final hierarchical level to each respective character in the second character sequence at the final hierarchical level, each of the characters being between anchors generated from an immediately previous hierarchical level, and identifying extra OCR text, the extra OCR text comprising text that is included in the first character sequence and that is not included in the second character sequence, and eliminating the extra OCR text from the OCR text output. 17. The computer program product of claim 11 , wherein at each hierarchical level, the instructions for performing the alignment of the two character sequences result in at least one continuous multiple character subsequence in the first character sequence to be aligned with one character subsequence in the second character sequence, the continuous multiple character subsequences including an actual corresponding character subsequence and one or more extra character subsequences, and wherein the instructions for aligning the two character sequences further include, performing post-processing based on heuristic rules to separate the actual corresponding character subsequence from the one or more extra character subsequences.
| 0.513411 |
11. A system comprising: one or more processors programmed operable to perform operations comprising: obtaining a plurality of search results responsive to a search query submitted by a user, wherein each search result refers to a respective document that is associated with a respective plurality of click measures, each click measure relating to a different respective natural language and representing, at least, a measure of behavior of users associated with the respective language in regards to the document when the document was referred to in a search result previously provided in response to the search query; for each of a first plurality of the search results, reducing the click measure associated with the document referred to by the search result, wherein the click measure relates to a respective natural language that is incompatible with a natural language of the user; calculating a respective scoring factor for each of the first plurality of search results based on the respective click measures associated with the document referred to by the first search result; and ranking the search results based upon, at least, the calculated scoring factors.
|
11. A system comprising: one or more processors programmed operable to perform operations comprising: obtaining a plurality of search results responsive to a search query submitted by a user, wherein each search result refers to a respective document that is associated with a respective plurality of click measures, each click measure relating to a different respective natural language and representing, at least, a measure of behavior of users associated with the respective language in regards to the document when the document was referred to in a search result previously provided in response to the search query; for each of a first plurality of the search results, reducing the click measure associated with the document referred to by the search result, wherein the click measure relates to a respective natural language that is incompatible with a natural language of the user; calculating a respective scoring factor for each of the first plurality of search results based on the respective click measures associated with the document referred to by the first search result; and ranking the search results based upon, at least, the calculated scoring factors. 18. The system of claim 11 wherein the respective click measure is a ratio of a number of instances that the document was selected for the respective natural language and a number of instances that document was selected for all of the respective natural languages.
| 0.534035 |
17. A system for serving an electronic message and its associated attachments in response to client requests, comprising: memory; a processor; and at least one program, stored in the memory and executed by the processor, the at least one program including: instructions for generating an electronic message in response to a client request from a client computer, the electronic message including an attachment viewing link corresponding to an attachment associated with the electronic message; the attachment having a document type; instructions for converting the attachment into a converted document in response to an attachment viewing request corresponding to a single user action consisting of selection of the attachment viewing link, the converted document having a document type different from the document type of the attachment; and instructions for receiving the requests from the client computer and transferring the requested electronic message and the converted document to the client computer.
|
17. A system for serving an electronic message and its associated attachments in response to client requests, comprising: memory; a processor; and at least one program, stored in the memory and executed by the processor, the at least one program including: instructions for generating an electronic message in response to a client request from a client computer, the electronic message including an attachment viewing link corresponding to an attachment associated with the electronic message; the attachment having a document type; instructions for converting the attachment into a converted document in response to an attachment viewing request corresponding to a single user action consisting of selection of the attachment viewing link, the converted document having a document type different from the document type of the attachment; and instructions for receiving the requests from the client computer and transferring the requested electronic message and the converted document to the client computer. 19. The system of claim 17 , wherein the attachment has a document type selected from the set consisting of a word processing document type, a spreadsheet document type, a presentation document type, and a portable document type.
| 0.656028 |
8. A recommendation system comprising: a storage module configured to store an ontology database comprising an ontology hierarchy structure with N hierarchy levels, N is an integer, each of the hierarchy levels comprises at least one entity, the ontology database is configured to store a plurality of j th user data respectively corresponding to a plurality of users, and each of the j th data records at least one j th entity of the entities on a j th hierarchy level of the ontology hierarchy structure; a converting module configured to generate a plurality of k th user data corresponding to the users according to the j data respectively, wherein each of the k th user data records at least one k th entity of the entities on a k th hierarchy level of the ontology hierarchy structure; a clustering module configured to cluster the k th user data; and a recommendation module configured to recommend the entities in the ontology database to the users according to the clustering result; wherein the converting module is configured to calculate a sparsity of the j th user data, and map the j th entity recorded in each of the j th user data to at least one of the k th entity recorded in each of the k th user data according to the sparsity of the j th user data; wherein a first calculating value is equal to a product of a quantity of the users and a quantity of the entities on the j th hierarchy level, a second calculating value is equal to a quantity of a sum of the j th entity recorded by each of the j th user data divided by the first calculating value, and the sparsity of the j th user data is equal to 1 subtracted by the second calculating value.
|
8. A recommendation system comprising: a storage module configured to store an ontology database comprising an ontology hierarchy structure with N hierarchy levels, N is an integer, each of the hierarchy levels comprises at least one entity, the ontology database is configured to store a plurality of j th user data respectively corresponding to a plurality of users, and each of the j th data records at least one j th entity of the entities on a j th hierarchy level of the ontology hierarchy structure; a converting module configured to generate a plurality of k th user data corresponding to the users according to the j data respectively, wherein each of the k th user data records at least one k th entity of the entities on a k th hierarchy level of the ontology hierarchy structure; a clustering module configured to cluster the k th user data; and a recommendation module configured to recommend the entities in the ontology database to the users according to the clustering result; wherein the converting module is configured to calculate a sparsity of the j th user data, and map the j th entity recorded in each of the j th user data to at least one of the k th entity recorded in each of the k th user data according to the sparsity of the j th user data; wherein a first calculating value is equal to a product of a quantity of the users and a quantity of the entities on the j th hierarchy level, a second calculating value is equal to a quantity of a sum of the j th entity recorded by each of the j th user data divided by the first calculating value, and the sparsity of the j th user data is equal to 1 subtracted by the second calculating value. 9. The recommendation system as claimed in claim 8 , wherein the converting module is configured to map the j th entity recorded in each of the j th user data to at least one of the entities on the k th hierarchy level according to the ontology hierarchy structure, to serve as the k th entity recorded in each of the k th user data.
| 0.54932 |
5. The method of claim 1 , further comprising: determining a relevancy measure for each of the contacts which represents a relevance of the relationship between the first user and the contact, the relevancy measure for each contact being determined, at least in part, with reference to one or more of the first data source or the at least one external data source; wherein the relevancy measure is further determined with reference to one or more of a frequency of communication, a recency of communication, a volume of communication, a periodicity of communication, a number of connections, a group membership, a demographic characteristic, a name, a relationship category, or a geographic location.
|
5. The method of claim 1 , further comprising: determining a relevancy measure for each of the contacts which represents a relevance of the relationship between the first user and the contact, the relevancy measure for each contact being determined, at least in part, with reference to one or more of the first data source or the at least one external data source; wherein the relevancy measure is further determined with reference to one or more of a frequency of communication, a recency of communication, a volume of communication, a periodicity of communication, a number of connections, a group membership, a demographic characteristic, a name, a relationship category, or a geographic location. 7. The method of claim 5 further comprising grouping the plurality of contacts with reference to the relevancy measures.
| 0.923687 |
1. A computer-implemented method of disambiguating personal names, the method comprising: for each of multiple personal names, categorizing the personal name as being: famous; or non-famous and: common; or uncommon; and using the computer to: extract a first personal name identified in an electronic content item, wherein multiple people have the first personal name; if the first personal name is non-famous and common, execute a first model to identify, among the multiple people, one person to whom the electronic content item refers; if the first personal name is non-famous and uncommon, execute a second model, different from the first model, to identify the one person; and transmit the electronic content item to a user that requested content items that reference the one person.
|
1. A computer-implemented method of disambiguating personal names, the method comprising: for each of multiple personal names, categorizing the personal name as being: famous; or non-famous and: common; or uncommon; and using the computer to: extract a first personal name identified in an electronic content item, wherein multiple people have the first personal name; if the first personal name is non-famous and common, execute a first model to identify, among the multiple people, one person to whom the electronic content item refers; if the first personal name is non-famous and uncommon, execute a second model, different from the first model, to identify the one person; and transmit the electronic content item to a user that requested content items that reference the one person. 3. The method of claim 1 , wherein categorizing a personal name comprises: determining the number of persons in the multiple people; categorizing the personal name as common if the number of persons is greater than a threshold; and categorizing the personal name as uncommon if the number of persons is less than the threshold.
| 0.634208 |
15. A computer-implemented method, comprising: receiving a selection of a query string via a first querying-related window in a graphical user interface (GUI) of an application, the first querying-related window for editing cross-platform programming language compatible query strings, wherein the selected query string is incompatible with a cross-platform programming language; in response to receiving a selection of an editor, replicating, by a processing device, the selected query string into a second querying-related window for editing customized query strings using the selected editor and to enable a user to execute the customized query strings within the second querying-related window; translating a first query string received via the first querying-related window to a second query string that is compatible with an underlying database; displaying in a third querying-related window the second query string that is compatible with the underlying database; and displaying in a fourth querying-related window a result of executing the second query string against the underlying database, wherein the first querying-related window, the second querying-related window, the third querying-related window and the fourth querying-related window are displayed at a same time within a single instance of the GUI, the GUI comprising a plurality of querying-related windows.
|
15. A computer-implemented method, comprising: receiving a selection of a query string via a first querying-related window in a graphical user interface (GUI) of an application, the first querying-related window for editing cross-platform programming language compatible query strings, wherein the selected query string is incompatible with a cross-platform programming language; in response to receiving a selection of an editor, replicating, by a processing device, the selected query string into a second querying-related window for editing customized query strings using the selected editor and to enable a user to execute the customized query strings within the second querying-related window; translating a first query string received via the first querying-related window to a second query string that is compatible with an underlying database; displaying in a third querying-related window the second query string that is compatible with the underlying database; and displaying in a fourth querying-related window a result of executing the second query string against the underlying database, wherein the first querying-related window, the second querying-related window, the third querying-related window and the fourth querying-related window are displayed at a same time within a single instance of the GUI, the GUI comprising a plurality of querying-related windows. 16. The method of claim 15 , wherein the second querying-related window is part of a criteria editor.
| 0.611604 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.