sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|
10. A non-transitory computer storage medium encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising: receiving a conceptual representation of a building including one or more user-defined floor levels and multiple surfaces defining geometrical volumetric spaces; and responsive to a request to generate an analytical energy model, automatically generating the analytical energy model by: deriving geometric information from the conceptual representation; based on the geometric information, defining one or more mass volumes; algorithmically assigning one or more surface types to mass volume surfaces based, at least in part, on surface type definitions, a number of space adjacencies and the geometric information, associated with a corresponding mass volume surface, the surface type definitions specifying a material construction of a corresponding surface type; defining one or more thermal mass zones based on the determined one or more mass volumes and a corresponding number of user-defined floor levels; deriving, using a model generator, thermal properties of the one or more thermal mass zones; combining the defined one or more thermal mass zones, the derived thermal properties, and predefined analytical energy model parameters to generate the analytical energy model. | 10. A non-transitory computer storage medium encoded with a computer program, the program comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising: receiving a conceptual representation of a building including one or more user-defined floor levels and multiple surfaces defining geometrical volumetric spaces; and responsive to a request to generate an analytical energy model, automatically generating the analytical energy model by: deriving geometric information from the conceptual representation; based on the geometric information, defining one or more mass volumes; algorithmically assigning one or more surface types to mass volume surfaces based, at least in part, on surface type definitions, a number of space adjacencies and the geometric information, associated with a corresponding mass volume surface, the surface type definitions specifying a material construction of a corresponding surface type; defining one or more thermal mass zones based on the determined one or more mass volumes and a corresponding number of user-defined floor levels; deriving, using a model generator, thermal properties of the one or more thermal mass zones; combining the defined one or more thermal mass zones, the derived thermal properties, and predefined analytical energy model parameters to generate the analytical energy model. 17. The computer storage medium of claim 10 , wherein the predefined analytical energy model parameters include default values and are sufficient to generate the analytical energy model in combination with the conceptual representation. | 0.750526 |
1. An autonomously moving robot that drives while evading obstacles, comprising: a memory to memorize map information of a driving domain and various parameters for driving; an input instruction receiver to input a destination and a command for moving; a route determiner to form a driving route to the destination; an environmental information acquisitioner to acquire environmental information on the driving route including an object becoming an obstacle; a driver to drive the autonomously moving robot; a self-location recognition sensor to recognize a self-location on a basis of information provided by the environmental information acquisitioner and the map information; and a driving controller to control the driver to arrive at the destination while evading obstacles and recognizing the self-location, wherein the environmental information acquisitioner further comprises: an imaging apparatus that takes an environmental image on the driving route; an image recognition processor to extract an edge image from the taken environmental image, and to evaluate a degree of circularity of the edge image by arithmetically processing the shape of the edge image, and if the evaluated degree of circularity is larger than a predetermined threshold value, the image recognition processor extracts an area including the evaluated edge image from the environmental image as a candidate region including a human head; a ranging apparatus to detect an object existing in an environment on the driving route, and to measure a distance range and an orientation of the object; a range information analyzer to arithmetically process the measured distance range and the orientation of the object to obtain a width of the object related to an angle region where collected data of the measured distance range and the orientation is generally constant, wherein the object is recognized based on the obtained width being within predetermined values; and an environment recognizer to perform recognition processing by comparing information based on an orientation in actual space of the candidate region including the human head extracted by the image recognition processor with information based on an orientation of the object having the width that is within the predetermined values recognized by the range information analyzer, and wherein when the compared information is consistent with one another, the environment recognizer outputs the information of the distance range and the orientation of the object as an environmental information on a person on the driving route to the driving controller. | 1. An autonomously moving robot that drives while evading obstacles, comprising: a memory to memorize map information of a driving domain and various parameters for driving; an input instruction receiver to input a destination and a command for moving; a route determiner to form a driving route to the destination; an environmental information acquisitioner to acquire environmental information on the driving route including an object becoming an obstacle; a driver to drive the autonomously moving robot; a self-location recognition sensor to recognize a self-location on a basis of information provided by the environmental information acquisitioner and the map information; and a driving controller to control the driver to arrive at the destination while evading obstacles and recognizing the self-location, wherein the environmental information acquisitioner further comprises: an imaging apparatus that takes an environmental image on the driving route; an image recognition processor to extract an edge image from the taken environmental image, and to evaluate a degree of circularity of the edge image by arithmetically processing the shape of the edge image, and if the evaluated degree of circularity is larger than a predetermined threshold value, the image recognition processor extracts an area including the evaluated edge image from the environmental image as a candidate region including a human head; a ranging apparatus to detect an object existing in an environment on the driving route, and to measure a distance range and an orientation of the object; a range information analyzer to arithmetically process the measured distance range and the orientation of the object to obtain a width of the object related to an angle region where collected data of the measured distance range and the orientation is generally constant, wherein the object is recognized based on the obtained width being within predetermined values; and an environment recognizer to perform recognition processing by comparing information based on an orientation in actual space of the candidate region including the human head extracted by the image recognition processor with information based on an orientation of the object having the width that is within the predetermined values recognized by the range information analyzer, and wherein when the compared information is consistent with one another, the environment recognizer outputs the information of the distance range and the orientation of the object as an environmental information on a person on the driving route to the driving controller. 14. The autonomously moving robot described in claim 1 , wherein the driving controller takes an attention attracting action to a person when the autonomously moving robot passes near the person detected. | 0.561954 |
10. A system for enhancing information search queries for information retrieval by computer, comprising a browser program; information pages served to the browser program; a plurality of established term usage subject areas (TUSAs) wherein each TUSA comprises a predetermined subject area; an identified corpus of documents, messages, expositions, or communications exemplifying patterns of term usage specific to each TUSA wherein the corpus for each TUSA includes documents, messages, expositions, or communications disparate from information search queries; means for analyzing documents, messages, expositions, or communications within each corpus of each TUSA to extract term co-occurrence and usage patterns and statistics; means for receiving an information search query relative to the browser program wherein the information search query includes one or more search terms; means for identifying and assigning a primary TUSA corresponding to the information search query; means for locating alternative or additional query terms or query phrases within the primary TUSA based on the term co-occurrence and usage patterns extracted through the analysis of the documents, messages, expositions, or communications within the corpus of the primary TUSA; means for presenting the located alternative or additional query terms or phrases within the primary TUSA to the user via an interface for use in refining the information search query; means for permitting a selection and de-selection of alternative or additional query terms or phrases from among the located alternative or additional query terms or phrases presented by an executive action that does not necessarily require typing individual characters; a mechanism to combine alternative or additional query terms or phrases selected from among the located alternative or additional query terms or phrases presented with the information search query received to create a new, enhanced information search query; and a mechanism to submit the new, enhanced information search query to a search engine to generate information search query results. | 10. A system for enhancing information search queries for information retrieval by computer, comprising a browser program; information pages served to the browser program; a plurality of established term usage subject areas (TUSAs) wherein each TUSA comprises a predetermined subject area; an identified corpus of documents, messages, expositions, or communications exemplifying patterns of term usage specific to each TUSA wherein the corpus for each TUSA includes documents, messages, expositions, or communications disparate from information search queries; means for analyzing documents, messages, expositions, or communications within each corpus of each TUSA to extract term co-occurrence and usage patterns and statistics; means for receiving an information search query relative to the browser program wherein the information search query includes one or more search terms; means for identifying and assigning a primary TUSA corresponding to the information search query; means for locating alternative or additional query terms or query phrases within the primary TUSA based on the term co-occurrence and usage patterns extracted through the analysis of the documents, messages, expositions, or communications within the corpus of the primary TUSA; means for presenting the located alternative or additional query terms or phrases within the primary TUSA to the user via an interface for use in refining the information search query; means for permitting a selection and de-selection of alternative or additional query terms or phrases from among the located alternative or additional query terms or phrases presented by an executive action that does not necessarily require typing individual characters; a mechanism to combine alternative or additional query terms or phrases selected from among the located alternative or additional query terms or phrases presented with the information search query received to create a new, enhanced information search query; and a mechanism to submit the new, enhanced information search query to a search engine to generate information search query results. 12. A system for enhancing information search queries for information retrieval by computer in claim 10 , further comprising a mechanism for selection of web pages for display of advertisements and ancillaries based on term co-occurrences and derived statistics analyzed in the text of the web pages with the primary TUSA or the located alternative or additional query terms or phrases within the primary TUSA presented. | 0.601741 |
1. An alphanumeric character recognition system for analyzing symbols each written in a sequence of strokes comprising: means for defining a writing area, means to separate said writing area into a minimum number of elongated side-by-side parallel contact areas, means for storing for predetermined symbols said sequence of strokes as to the respective side-by-side areas contacted, writing means for writing symbols in said writing area, said writing means connected to said storing means to feed thereto said sequence of strokes contacting said side-by-side parallel areas when a symbol is being written, comparison means for comparing said stored sequence of strokes of said predetermined symbols with said written sequence of strokes, and utilization means having the output of said comparison means connected thereto. | 1. An alphanumeric character recognition system for analyzing symbols each written in a sequence of strokes comprising: means for defining a writing area, means to separate said writing area into a minimum number of elongated side-by-side parallel contact areas, means for storing for predetermined symbols said sequence of strokes as to the respective side-by-side areas contacted, writing means for writing symbols in said writing area, said writing means connected to said storing means to feed thereto said sequence of strokes contacting said side-by-side parallel areas when a symbol is being written, comparison means for comparing said stored sequence of strokes of said predetermined symbols with said written sequence of strokes, and utilization means having the output of said comparison means connected thereto. 19. The system of claim 1 wherein said stored sequence of strokes for said predetermined symbols further includes grouping the stored information. | 0.621789 |
1. A method for creating a personalized musical file comprising: receiving a birth data; determining an angular distribution of planets on a birth sky based, at least in part, on the birth data; selecting a plurality of sequences of characters based, at least in part, on the angular distribution of planets; generating a recorded musical portion for at least some of the plurality of sequences of characters; assembling at least some of the recorded musical portions in a musical file; and recording the musical file. | 1. A method for creating a personalized musical file comprising: receiving a birth data; determining an angular distribution of planets on a birth sky based, at least in part, on the birth data; selecting a plurality of sequences of characters based, at least in part, on the angular distribution of planets; generating a recorded musical portion for at least some of the plurality of sequences of characters; assembling at least some of the recorded musical portions in a musical file; and recording the musical file. 4. The method for creating a musical file of claim 1 , comprising: defining 72 angular name portions; assigning 72 Names of Shem ha-Meforash with the 72 angular name portions; defining 12 angular astrological sign portions, each angular sign portion comprising 6 angular name portions; assigning 12 astrological signs with the 12 angular astrological sign positions, respectively; associating 10 celestial objects of the birth sky, with their respective angle; and inferring 10 Names of Shem ha-Meforash from the positions of the 10 celestial objects. | 0.613909 |
1. A computer-implemented method for optimizing the level of engagement of components within a defined ecosystem or context, the method comprising: defining an initial ecosystem or context ‘A’ in structural, functional, operational, and conceptual terms in a computer; identifying one or more components in the defined ecosystem or context ‘A’; determining whether all identified components account for all of the structural, functional, operational, and conceptual terms of the initial ecosystem or context ‘A’; quantifying at least one of a level of disengagement and a level of engagement for each of the identified components in the computer; determining whether the quantifying of the at least one of the level of disengagement and the level of engagement is complete; for each of the identified components, measuring one or more gaps between a current component engagement level and a potential component engagement level in the computer; and outputting a report associated with the one or more identified components and the one or more measured gaps between the current component engagement level and the potential component engagement level. | 1. A computer-implemented method for optimizing the level of engagement of components within a defined ecosystem or context, the method comprising: defining an initial ecosystem or context ‘A’ in structural, functional, operational, and conceptual terms in a computer; identifying one or more components in the defined ecosystem or context ‘A’; determining whether all identified components account for all of the structural, functional, operational, and conceptual terms of the initial ecosystem or context ‘A’; quantifying at least one of a level of disengagement and a level of engagement for each of the identified components in the computer; determining whether the quantifying of the at least one of the level of disengagement and the level of engagement is complete; for each of the identified components, measuring one or more gaps between a current component engagement level and a potential component engagement level in the computer; and outputting a report associated with the one or more identified components and the one or more measured gaps between the current component engagement level and the potential component engagement level. 9. The method of claim 1 , further comprising: moving the one or more identified components from a current location to a potential location on a component interface definition meta-structure map. | 0.681226 |
1. In a language processing function measuring device, which is equipped with a word presenting unit to present words to a subject, a biological activity measuring unit to measure a biological activity of the subject and a calculation unit to calculate information measured by the biological activity measuring unit, the improvement comprising: the calculation unit includes a word database where word data indicating words are presented to the subject, a category data of the words, and attribute data of the words are related and then stored, respectively, and, a word extractor to search the word database and to extract words belonging to or relating to a predetermined category, and satisfying a predetermined attribute, based upon predetermined search conditions that are entered by a user, and the word presenting unit presents a portion of or entire words indicated by the word data indicating words extracted by the word extractor. | 1. In a language processing function measuring device, which is equipped with a word presenting unit to present words to a subject, a biological activity measuring unit to measure a biological activity of the subject and a calculation unit to calculate information measured by the biological activity measuring unit, the improvement comprising: the calculation unit includes a word database where word data indicating words are presented to the subject, a category data of the words, and attribute data of the words are related and then stored, respectively, and, a word extractor to search the word database and to extract words belonging to or relating to a predetermined category, and satisfying a predetermined attribute, based upon predetermined search conditions that are entered by a user, and the word presenting unit presents a portion of or entire words indicated by the word data indicating words extracted by the word extractor. 4. The language processing function measuring device according to claim 1 , wherein, the biological activity measuring unit is equipped with a brain activity measuring unit to measure the brain activity in the subject and the calculation unit calculates at least either brain activity time data indicating the time variation of the brain activity in the subject or brain activity position data indicating the position of brain activity in the subject based upon the brain activity measurement data from the brain activity measuring unit. | 0.64215 |
5. The method of claim 1 , wherein the changing of the intermediate blank space includes setting a size of the intermediate blank space based on the blank space information in the layout information. | 5. The method of claim 1 , wherein the changing of the intermediate blank space includes setting a size of the intermediate blank space based on the blank space information in the layout information. 8. The method of claim 5 , wherein the changing of the intermediate blank space includes setting the size of the intermediate blank space by summing an top margin and a bottom margin of the original document according to the blank space information and the page gap. | 0.930155 |
17. A method comprising: generating, at a first video processor, a first histogram based solely on a first video picture; identifying a first plurality of clip lines for the first histogram; concurrently determining, at the video processor device, a number of histogram points at a set of bins of the first histogram that are clipped by each clip line of the plurality of clip lines, wherein each clip line is applied to each bin of the set of bins, and wherein the number of histogram points clipped by each clip line is based upon the total number of points of the first histogram above that clip line; determining, at the video processor device, a final clip line of the histogram based upon a number of points of the histogram determined to be clipped by a first clip line of the plurality of clip lines, wherein the final clip line is not one of the first plurality of clip lines; and determining a translation matrix based upon the final clip line and the first histogram. | 17. A method comprising: generating, at a first video processor, a first histogram based solely on a first video picture; identifying a first plurality of clip lines for the first histogram; concurrently determining, at the video processor device, a number of histogram points at a set of bins of the first histogram that are clipped by each clip line of the plurality of clip lines, wherein each clip line is applied to each bin of the set of bins, and wherein the number of histogram points clipped by each clip line is based upon the total number of points of the first histogram above that clip line; determining, at the video processor device, a final clip line of the histogram based upon a number of points of the histogram determined to be clipped by a first clip line of the plurality of clip lines, wherein the final clip line is not one of the first plurality of clip lines; and determining a translation matrix based upon the final clip line and the first histogram. 19. The method of claim 17 , further including: determining the plurality of clip lines based upon a number of first histogram points to be redistributed. | 0.671467 |
5. The method of claim 1 , where each of the first interface type and the second interface type further includes a data transfer parameter related to a data transfer between the two components of the model, and where selecting the interface type is further based on the data transfer parameter. | 5. The method of claim 1 , where each of the first interface type and the second interface type further includes a data transfer parameter related to a data transfer between the two components of the model, and where selecting the interface type is further based on the data transfer parameter. 6. The method of claim 5 , where the data transfer parameter is associated with the at least one signal, the at least one signal including at least one of: a reset signal, a clock signal, or a clock-enable signal, and the at least one signal being associated with controlling the data transfer between the two components of the model. | 0.859569 |
13. A system, comprising: a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: receive a request to identify at least one image associated with a text value; identify at least one association category from a plurality of association categories with which to perform a search; search a data structure, using the at least one association category, for an identification of the at least one image that is associated with the text value, wherein the at least one image is a visual representation of the text value; determine whether an update should be performed to one or more association categories within the plurality of association categories; responsive to an indication to perform an update of the one or more association categories, update at least one text-to-image association in the one or more association categories; responsive to identifying at least one image associated with the text value, retrieve the at least one image; and present the at least one image in a graphical user interface to a user. | 13. A system, comprising: a processor; and a memory coupled to the processor, wherein the memory comprises instructions which, when executed by the processor, cause the processor to: receive a request to identify at least one image associated with a text value; identify at least one association category from a plurality of association categories with which to perform a search; search a data structure, using the at least one association category, for an identification of the at least one image that is associated with the text value, wherein the at least one image is a visual representation of the text value; determine whether an update should be performed to one or more association categories within the plurality of association categories; responsive to an indication to perform an update of the one or more association categories, update at least one text-to-image association in the one or more association categories; responsive to identifying at least one image associated with the text value, retrieve the at least one image; and present the at least one image in a graphical user interface to a user. 14. The system of claim 13 , wherein the instructions to identify the at least one association category is performed with respect to a priority of the plurality of association categories, wherein the priority of the plurality of association categories is set by the user, and wherein the priority of the plurality of association categories is stored in user preferences. | 0.694209 |
15. The computer storage medium of claim 10 , wherein the other users obtained from the social networking site are displayed with each challenge. | 15. The computer storage medium of claim 10 , wherein the other users obtained from the social networking site are displayed with each challenge. 16. The computer storage medium of claim 15 , wherein a version of the application is displayed with each display of the other users. | 0.970089 |
15. The method of claim 12 , wherein the processor and database are controlled by a first entity and the at least one fingerprint is received from a second entity, and wherein the plurality of query fingerprints are generated by: receiving, by a second processor from the second entity, a plaintext query; generating, by the second processor, a plurality of query shingles from the plaintext query so that there is no character overlap between adjacent shingles; cryptographically hashing, by the second processor, the plurality of query shingles to form the plurality of query fingerprints. | 15. The method of claim 12 , wherein the processor and database are controlled by a first entity and the at least one fingerprint is received from a second entity, and wherein the plurality of query fingerprints are generated by: receiving, by a second processor from the second entity, a plaintext query; generating, by the second processor, a plurality of query shingles from the plaintext query so that there is no character overlap between adjacent shingles; cryptographically hashing, by the second processor, the plurality of query shingles to form the plurality of query fingerprints. 17. The method of claim 15 , wherein prior to determining whether any of the received query fingerprints match any of the artifact fingerprints stored in the database, the method comprises: receiving, by the second processor, a set of artificially common fingerprints in the artifact fingerprints; and removing, by the second processor, any fingerprints from the plurality of query fingerprints matching any of the fingerprints in the set of artificially common fingerprints. | 0.726409 |
1. A computer-implemented system that facilitates document searching, the system comprising a processing unit executing computer-executable program components stored in memory comprising: a search component for: receiving a query from a user that has logged into the system using a first user account having a first level of user access rights, the query to be used for searching a data store of different document versions, the different document versions including a first version accessible by the first level of user access rights and a second version accessible by a second level of user access rights but not accessible by the first level of user access rights, searching for the different document versions according to the first user account used to log into the system and a second user account dynamically created for the user for searching the data store, the dynamically created second user account for the user having the second level of user access rights; submitting different versions of the query to the data store in multiple passes corresponding to different levels of user access rights, and receiving intermediate search results comprising the different document versions returned in response to the different versions of the query, wherein a first version of the query using the first level of user access rights is submitted to the data store in a first pass to return a first intermediate search result set including one or more first version documents accessed according to the first level of user access rights, and a second version of the query using the second level of user access rights is submitted to the data store in a second pass to return a second intermediate search result set including one or more second version documents accessed according to the second level of user access rights; and a merge component for: determining actual user access rights of the user, and merging the first and second intermediate search result sets into a final result set that is accessible to the user and that includes first version documents and second version documents if it is determined that the actual user access rights of the user include the second level of user access rights. | 1. A computer-implemented system that facilitates document searching, the system comprising a processing unit executing computer-executable program components stored in memory comprising: a search component for: receiving a query from a user that has logged into the system using a first user account having a first level of user access rights, the query to be used for searching a data store of different document versions, the different document versions including a first version accessible by the first level of user access rights and a second version accessible by a second level of user access rights but not accessible by the first level of user access rights, searching for the different document versions according to the first user account used to log into the system and a second user account dynamically created for the user for searching the data store, the dynamically created second user account for the user having the second level of user access rights; submitting different versions of the query to the data store in multiple passes corresponding to different levels of user access rights, and receiving intermediate search results comprising the different document versions returned in response to the different versions of the query, wherein a first version of the query using the first level of user access rights is submitted to the data store in a first pass to return a first intermediate search result set including one or more first version documents accessed according to the first level of user access rights, and a second version of the query using the second level of user access rights is submitted to the data store in a second pass to return a second intermediate search result set including one or more second version documents accessed according to the second level of user access rights; and a merge component for: determining actual user access rights of the user, and merging the first and second intermediate search result sets into a final result set that is accessible to the user and that includes first version documents and second version documents if it is determined that the actual user access rights of the user include the second level of user access rights. 6. The system of claim 1 , further comprising a cache component for storing the versions under a same ID. | 0.657649 |
30. A computer-readable computer memory medium selected from the group consisting of: application-specific integrated circuits, standard integrated circuits, field-programmable gate arrays, complex programmable logic devices, hard disks, and memory, wherein the computer-readable computer memory medium is storing or executing instructions that, when executed, controls a computer processor to facilitate patent related searches from a patent corpus of patent related publications, by automatically performing citation analysis upon each iteration of a patent related search, the citation analysis comprising citations from a respective face of each patent publication, which lists backward references as well as forward references to patents and/or patent publications, by performing a method comprising: receiving an indication of input text and/or patent related publications as input; automatically analyzing the indicated input using semantic analysis of the indicated source input to automatically extract a first set of search-based keywords and/or phrases that are present in the indicated input, wherein the automatically analyzing the indicated input using semantic analysis parses the indicated source input to determine grammatical usage to automatically extract the first set of search-based keywords and/or phrases; from the automatically determined first set of keywords, performing an initial search iteration automatically, and wherein the initial search iteration is performed without additional user input, by performing the steps of: automatically determining an initial set of patent related publications that include the automatically extracted first set of search-based keywords; automatically determining a correlated set of patent related publications that are correlated to the initial set of patent related publications using automatic citation analysis of the initial set of patent related publications, wherein the correlated set is determined to be one or more patent related publications from the corpus that have unique citation relationships to any one of the patent related publications of the initial set, and wherein the correlated set is automatically sorted based upon the correlated patent related publications that involve the most number of citation paths with the initial set of patent related publications; and automatically extracting from the automatically determined initial set of patent related publications a set of related keywords not found in the first set of keywords or in the source input; and presenting indicators to the determined initial set and the sorted determined correlated set of patent related publications and the set of related keywords as output from the initial search iteration. | 30. A computer-readable computer memory medium selected from the group consisting of: application-specific integrated circuits, standard integrated circuits, field-programmable gate arrays, complex programmable logic devices, hard disks, and memory, wherein the computer-readable computer memory medium is storing or executing instructions that, when executed, controls a computer processor to facilitate patent related searches from a patent corpus of patent related publications, by automatically performing citation analysis upon each iteration of a patent related search, the citation analysis comprising citations from a respective face of each patent publication, which lists backward references as well as forward references to patents and/or patent publications, by performing a method comprising: receiving an indication of input text and/or patent related publications as input; automatically analyzing the indicated input using semantic analysis of the indicated source input to automatically extract a first set of search-based keywords and/or phrases that are present in the indicated input, wherein the automatically analyzing the indicated input using semantic analysis parses the indicated source input to determine grammatical usage to automatically extract the first set of search-based keywords and/or phrases; from the automatically determined first set of keywords, performing an initial search iteration automatically, and wherein the initial search iteration is performed without additional user input, by performing the steps of: automatically determining an initial set of patent related publications that include the automatically extracted first set of search-based keywords; automatically determining a correlated set of patent related publications that are correlated to the initial set of patent related publications using automatic citation analysis of the initial set of patent related publications, wherein the correlated set is determined to be one or more patent related publications from the corpus that have unique citation relationships to any one of the patent related publications of the initial set, and wherein the correlated set is automatically sorted based upon the correlated patent related publications that involve the most number of citation paths with the initial set of patent related publications; and automatically extracting from the automatically determined initial set of patent related publications a set of related keywords not found in the first set of keywords or in the source input; and presenting indicators to the determined initial set and the sorted determined correlated set of patent related publications and the set of related keywords as output from the initial search iteration. 42. The computer-readable computer memory medium of claim 30 , further comprising: constraining the correlated set of patent related publications that are correlated to the initial set of patent related publications using citation analysis based upon classification information. | 0.635264 |
8. The method of claim 7 , wherein the text is extracted in text segments. | 8. The method of claim 7 , wherein the text is extracted in text segments. 9. The method of claim 8 , further comprising: identifying themes with the text segments that have been extracted. | 0.970678 |
1. A computer-implemented process for generating declaration statements for objects defined in the external declarations of a source file, the process comprising the steps of: identifying data-type identifiers in an external declaration of the source file; storing a representation of the data-type identifiers as data-type keywords in a first memory location; identifying object declarators in the external declaration; storing a representation of the object declarators in a second memory location; determining whether the external declaration is an external definition or a typedef declaration; when the external declaration is an external definition, combining the data-type keywords in the first memory location and the object declarators in the second memory location to generate a declaration statement; when the external declaration is a typedef declaration, generating an entry in a symbol table with the data-type keywords from the first memory location, indexed by the object declarators from the second memory location; and repeating the preceding steps until all external declarations of the source file have been analyzed. | 1. A computer-implemented process for generating declaration statements for objects defined in the external declarations of a source file, the process comprising the steps of: identifying data-type identifiers in an external declaration of the source file; storing a representation of the data-type identifiers as data-type keywords in a first memory location; identifying object declarators in the external declaration; storing a representation of the object declarators in a second memory location; determining whether the external declaration is an external definition or a typedef declaration; when the external declaration is an external definition, combining the data-type keywords in the first memory location and the object declarators in the second memory location to generate a declaration statement; when the external declaration is a typedef declaration, generating an entry in a symbol table with the data-type keywords from the first memory location, indexed by the object declarators from the second memory location; and repeating the preceding steps until all external declarations of the source file have been analyzed. 2. The process of claim 1, wherein the step of storing data-type identifiers as data-type keywords in the first memory location comprises: determining whether the data-type identifier is a data-type keyword; when the data-type identifier is not a data-type keyword, scanning the symbol table for an entry indexed by the data-type identifier in the external declaration; and replacing the data-type identifier in the first memory location with the data-type keywords indexed by the data type identifier in the symbol table. | 0.52898 |
10. A method for cognitive recording and sharing of live events comprising: receiving, at a processing device, a biometric signal from an individual; obtaining a biometric signature of the individual based on a received biometric signal data; receive, at the processing device, from devices of one or more other individuals in proximity to the individual, a signal representing one or more of: a recognized emotional state of, a biometric signature of, and a determined precognition input of the one or more other individuals in proximity to the individual; determining, at said processing device, the individual's current emotional state based on the signature in combination with the signals received from the devices of said one or more other individuals in proximity to the individual; and triggering a recording device to record a live event responsive to determined emotional state. | 10. A method for cognitive recording and sharing of live events comprising: receiving, at a processing device, a biometric signal from an individual; obtaining a biometric signature of the individual based on a received biometric signal data; receive, at the processing device, from devices of one or more other individuals in proximity to the individual, a signal representing one or more of: a recognized emotional state of, a biometric signature of, and a determined precognition input of the one or more other individuals in proximity to the individual; determining, at said processing device, the individual's current emotional state based on the signature in combination with the signals received from the devices of said one or more other individuals in proximity to the individual; and triggering a recording device to record a live event responsive to determined emotional state. 11. The method as claimed in claim 10 , further comprising: configuring a processing device to further receive a recording of said live event, analyzing at said processing device, aspects of said recording, and automatically sharing said recording via a network connection with other individuals based on said analysis. | 0.683467 |
17. A process for identifying a type of symbols generated by an operating system, comprising the steps of: matching a first set of data corresponding to a first language currently used by said operating system to generate a plurality of symbols with a plurality of signals sendable by an input device, said matching allowing a user to generate a plurality of symbols by manipulating an input device, said operating system running on a computer system comprising a central processing unit, said input device and a display device; displaying a cursor on said display device, said cursor having a color signifying that said first language is currently being used by said operating system to match said symbols with said signals sent by said input device; receiving said signals from said input device; deteimining whether said signals received from said input device include a command to change from using said first language to using a second language to match said symbols with said signals sent by said input device; if said signals include said command to change from said first language to said second language: matching a second set of data corresponding to said second language to said signals sendable by said input device; changing said color of said cursor on said display device to signify that said second language is currently being used to generate said symbols in response to manipulation of said input device; and returning to said step of receiving said signals from said input device; and if said signals do not include a command to change from said first language to said second language: displaying said symbols of said first language corresponding to said signals sent from said input device on said display device; moving said cursor; and returning to said step of displaying a cursor on said display device, said cursor having a color signifying said first language. | 17. A process for identifying a type of symbols generated by an operating system, comprising the steps of: matching a first set of data corresponding to a first language currently used by said operating system to generate a plurality of symbols with a plurality of signals sendable by an input device, said matching allowing a user to generate a plurality of symbols by manipulating an input device, said operating system running on a computer system comprising a central processing unit, said input device and a display device; displaying a cursor on said display device, said cursor having a color signifying that said first language is currently being used by said operating system to match said symbols with said signals sent by said input device; receiving said signals from said input device; deteimining whether said signals received from said input device include a command to change from using said first language to using a second language to match said symbols with said signals sent by said input device; if said signals include said command to change from said first language to said second language: matching a second set of data corresponding to said second language to said signals sendable by said input device; changing said color of said cursor on said display device to signify that said second language is currently being used to generate said symbols in response to manipulation of said input device; and returning to said step of receiving said signals from said input device; and if said signals do not include a command to change from said first language to said second language: displaying said symbols of said first language corresponding to said signals sent from said input device on said display device; moving said cursor; and returning to said step of displaying a cursor on said display device, said cursor having a color signifying said first language. 21. The process of claim 17, said operating system displaying a window on said display device, said window containing a plurality of buttons. | 0.619048 |
1. A method comprising: selecting a plurality of storage cells based on a received read target address; reading a plurality of charge levels of a storage format word from the selected plurality of storage cells; generating elements of a results vector based on a weighted summation between a plurality of Walsh functions, each Walsh function weighted with a corresponding charge level, wherein each respective Walsh function represents a respective row of a Hadamard matrix, the respective row being (i) mutually orthogonal to all other rows of the Hadamard matrix and (ii) orthogonal to an all-one row of the Hadamard matrix; generating elements of a numerical vector based on a maximal likelihood interpretation of the elements of the results vector; and mapping the numerical vector to a set bits of a read data word. | 1. A method comprising: selecting a plurality of storage cells based on a received read target address; reading a plurality of charge levels of a storage format word from the selected plurality of storage cells; generating elements of a results vector based on a weighted summation between a plurality of Walsh functions, each Walsh function weighted with a corresponding charge level, wherein each respective Walsh function represents a respective row of a Hadamard matrix, the respective row being (i) mutually orthogonal to all other rows of the Hadamard matrix and (ii) orthogonal to an all-one row of the Hadamard matrix; generating elements of a numerical vector based on a maximal likelihood interpretation of the elements of the results vector; and mapping the numerical vector to a set bits of a read data word. 3. The method of claim 1 , wherein a summation of the elements of the generated numerical vector is equal to 0. | 0.673692 |
20. A system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to: receive, from a client system of a first user of an online social network, a search query comprising one or more n-grams; determine, based on a contextual speller model, that at least one n-gram of the one or more n-grams is misspelled, wherein the contextual speller model is based at least on a standard language model and a personal language model customized for the first user based on social-networking data associated with the first user; identify, for each misspelled n-gram, one or more variant-tokens based at least on the search query and the contextual speller model; generate one or more unique combinations of the n-grams and variant-tokens, wherein each unique combination comprises a variant-token corresponding to each misspelled n-gram; calculate a relevance-score for each unique combination based at least in part on the search query and the contextual speller model, wherein the relevance-score for a unique combination is based on a comparison of a probability associated with the n-grams or variant tokens of the unique combination in the standard language model of the contextual speller model to a probability associated with the n-grams or variant tokens of the unique combination in the personal language model of the contextual speller model; generate one or more corrected queries, each corrected query comprising a unique combination having a relevance-score greater than a threshold relevance-score; and send, to the client system of the first user for display in response to receiving the search query, one or more of the corrected queries. | 20. A system comprising: one or more processors; and a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to: receive, from a client system of a first user of an online social network, a search query comprising one or more n-grams; determine, based on a contextual speller model, that at least one n-gram of the one or more n-grams is misspelled, wherein the contextual speller model is based at least on a standard language model and a personal language model customized for the first user based on social-networking data associated with the first user; identify, for each misspelled n-gram, one or more variant-tokens based at least on the search query and the contextual speller model; generate one or more unique combinations of the n-grams and variant-tokens, wherein each unique combination comprises a variant-token corresponding to each misspelled n-gram; calculate a relevance-score for each unique combination based at least in part on the search query and the contextual speller model, wherein the relevance-score for a unique combination is based on a comparison of a probability associated with the n-grams or variant tokens of the unique combination in the standard language model of the contextual speller model to a probability associated with the n-grams or variant tokens of the unique combination in the personal language model of the contextual speller model; generate one or more corrected queries, each corrected query comprising a unique combination having a relevance-score greater than a threshold relevance-score; and send, to the client system of the first user for display in response to receiving the search query, one or more of the corrected queries. 31. The system of claim 20 , wherein the personal language model is further customized based on social-networking data associated with a first group of users. | 0.613771 |
18. A computer-implemented method for transforming an XML file into an add-in function for use in a spreadsheet application comprising: scanning an add-in XML file for an instruction; determining an interface XML file to be exposed by the instruction; accepting the interface XML file from a COM server; determining if the instruction comprises a function qualifier; wherein the function qualifier modifies a function specification in the interface XML file; applying the function qualifier to the function specification; converting the function specification to an intermediate function; determining if the instruction comprises an implementation specifier for the function specification, wherein the implementation specifier overrides the default implementation of the interface XML file; determining the implementation specifier for the add-in function if the instruction does not comprise an implementation specifier; applying an implementation specifier to the intermediate function; converting the intermediate function to an add-in function; and transmitting the add-in function to the spreadsheet application for processing. | 18. A computer-implemented method for transforming an XML file into an add-in function for use in a spreadsheet application comprising: scanning an add-in XML file for an instruction; determining an interface XML file to be exposed by the instruction; accepting the interface XML file from a COM server; determining if the instruction comprises a function qualifier; wherein the function qualifier modifies a function specification in the interface XML file; applying the function qualifier to the function specification; converting the function specification to an intermediate function; determining if the instruction comprises an implementation specifier for the function specification, wherein the implementation specifier overrides the default implementation of the interface XML file; determining the implementation specifier for the add-in function if the instruction does not comprise an implementation specifier; applying an implementation specifier to the intermediate function; converting the intermediate function to an add-in function; and transmitting the add-in function to the spreadsheet application for processing. 23. The computer-implemented method of claim 18 , further comprising the step of copying the interface XML file to the intermediate function if the instruction does not comprise the function qualifier. | 0.743059 |
11. The method of claim 1 , further comprising: determining that the search query is parent-like; and selecting only candidate refinement queries that are parent-like as being refinement queries for the search query. | 11. The method of claim 1 , further comprising: determining that the search query is parent-like; and selecting only candidate refinement queries that are parent-like as being refinement queries for the search query. 12. The method of claim 11 , where determining that a particular query is parent-like includes: generating a modified query that semantically represents a grouping, where the grouping is related to a lexical item represented by the particular query; and determining that the particular query is parent-like when the modified query has a frequency of being submitted beyond a threshold value. | 0.891473 |
7. A method for improving text recognition capability in a mobile communication terminal with a camera, the method comprising the steps of: determining if text exists in an input image; determining text color and text-background color surrounding the text when the text is determined to exist; unifying background regions beyond a text region into the determined text-background color; and recognizing an inverted text image or text image with the unified background regions from an inversion-processing unit, and then outputting the result of recognition. | 7. A method for improving text recognition capability in a mobile communication terminal with a camera, the method comprising the steps of: determining if text exists in an input image; determining text color and text-background color surrounding the text when the text is determined to exist; unifying background regions beyond a text region into the determined text-background color; and recognizing an inverted text image or text image with the unified background regions from an inversion-processing unit, and then outputting the result of recognition. 8. The method as claimed in claim 7 , further comprising: determining if the text image with the unified background is inverted; and inversion-processing the text image if the text image is an inverted image. | 0.741419 |
11. A method comprising: processing, by at least one server computer, electronic page requests and determining whether to implement normal page navigation operations or minimal download operations, wherein in response to implementing the minimal download operations creating difference packages associated with previously-rendered electronic pages and target electronic pages including script differences, style differences, and other differences, wherein, each difference package to include information associated with differences between a previously-rendered electronic page and a target electronic page as part of a navigation operation, the information associated with differences to include a page script set, a page style sheet set, and markup differences associated with the previously-rendered electronic page and the target electronic page; using a client computer to request electronic pages, browse electronic pages, and use difference packages as part of processing page navigation operations, wherein each electronic page is configured to be rendered according to a number of page portions that include one or more script portions, style portions, and markup portions, further using the client computer to use a difference package provided by the at least one server computer to perform a difference application at the client computer to update one or multiple areas of the target electronic page using differences included with the difference package as part of simulating a page navigation mechanism that includes an unload operation associated with the previously-rendered electronic page and a render operation for the target electronic page followed by running target global script and firing target load events; using an electronic page request operation to determine whether to use normal page navigation operations or minimal download operations, wherein the minimal download operations operate to determine page differences between the target page and the previously-rendered page, the page differences including script differences, style differences, and other differences; and using the difference package to update an interactive interface at the client computer to navigate between electronic pages as part of providing simulated page transition operations including performing a difference application of the page differences at the client computer to render the target electronic page, wherein using the difference package further includes displaying the target electronic page including using new script, styles, and encoded markup included with the difference package and adding an inline style to a global style array for each inline style of the target electronic page. | 11. A method comprising: processing, by at least one server computer, electronic page requests and determining whether to implement normal page navigation operations or minimal download operations, wherein in response to implementing the minimal download operations creating difference packages associated with previously-rendered electronic pages and target electronic pages including script differences, style differences, and other differences, wherein, each difference package to include information associated with differences between a previously-rendered electronic page and a target electronic page as part of a navigation operation, the information associated with differences to include a page script set, a page style sheet set, and markup differences associated with the previously-rendered electronic page and the target electronic page; using a client computer to request electronic pages, browse electronic pages, and use difference packages as part of processing page navigation operations, wherein each electronic page is configured to be rendered according to a number of page portions that include one or more script portions, style portions, and markup portions, further using the client computer to use a difference package provided by the at least one server computer to perform a difference application at the client computer to update one or multiple areas of the target electronic page using differences included with the difference package as part of simulating a page navigation mechanism that includes an unload operation associated with the previously-rendered electronic page and a render operation for the target electronic page followed by running target global script and firing target load events; using an electronic page request operation to determine whether to use normal page navigation operations or minimal download operations, wherein the minimal download operations operate to determine page differences between the target page and the previously-rendered page, the page differences including script differences, style differences, and other differences; and using the difference package to update an interactive interface at the client computer to navigate between electronic pages as part of providing simulated page transition operations including performing a difference application of the page differences at the client computer to render the target electronic page, wherein using the difference package further includes displaying the target electronic page including using new script, styles, and encoded markup included with the difference package and adding an inline style to a global style array for each inline style of the target electronic page. 14. The method of claim 11 , further comprising simulating a page transition using the minimal download operations after examining a target URL of the target page to determine that the target page is in a same page template class as the master page. | 0.503672 |
14. A non-transitory computer readable medium comprising a plurality of computer-executable instructions stored thereon that, when executed, cause a computing system to perform processing for extracting one or more descriptors of a specified term in text data from the text data, the processing comprising: receiving, from a user: an address for at least one information source, the address being a uniform resource locator (URL) address or a location of a text file within a storage device, the term being at least one word or other text token; and the specified term; creating a tagged information file by associating part of speech tags to text data obtained from the at least one information source, including to any descriptors present in the text data, wherein a descriptor comprises one or more words of the text data that succeed or precede the specified term; identifying a location of the specified term in the tagged information file using an approximate text matching technique, wherein the approximate text matching technique: detects the specified term grouped together with the descriptors of the specified term in the text data using the tagged information file, the specified term grouped together with the descriptors of the specified term forming a variable region or variable window that is context sensitive and not of a fixed size; and identifies, through a finite state machine, a grammatical context shift in the context sensitive region pertaining to the specified term in the text data by analyzing the part of speech tags of the tagged information file, wherein the grammatical context shift is indicated by an autonomous transition of the finite state machine from a first state associated with a first part of speech tag of the tagged information file to a second state associated with a second part of speech tag of the tagged information file for parts of speech associated with words before and after the specified term; determining based on the determined grammatical context shift the one or more descriptors of the specified term; extracting the one or more descriptors of the specified term from the text data; and providing a report comprising the extracted one or more descriptors of the specified term. | 14. A non-transitory computer readable medium comprising a plurality of computer-executable instructions stored thereon that, when executed, cause a computing system to perform processing for extracting one or more descriptors of a specified term in text data from the text data, the processing comprising: receiving, from a user: an address for at least one information source, the address being a uniform resource locator (URL) address or a location of a text file within a storage device, the term being at least one word or other text token; and the specified term; creating a tagged information file by associating part of speech tags to text data obtained from the at least one information source, including to any descriptors present in the text data, wherein a descriptor comprises one or more words of the text data that succeed or precede the specified term; identifying a location of the specified term in the tagged information file using an approximate text matching technique, wherein the approximate text matching technique: detects the specified term grouped together with the descriptors of the specified term in the text data using the tagged information file, the specified term grouped together with the descriptors of the specified term forming a variable region or variable window that is context sensitive and not of a fixed size; and identifies, through a finite state machine, a grammatical context shift in the context sensitive region pertaining to the specified term in the text data by analyzing the part of speech tags of the tagged information file, wherein the grammatical context shift is indicated by an autonomous transition of the finite state machine from a first state associated with a first part of speech tag of the tagged information file to a second state associated with a second part of speech tag of the tagged information file for parts of speech associated with words before and after the specified term; determining based on the determined grammatical context shift the one or more descriptors of the specified term; extracting the one or more descriptors of the specified term from the text data; and providing a report comprising the extracted one or more descriptors of the specified term. 19. The non-transitory computer readable medium of claim 14 , wherein the first and second part of speech tags are associated with adjacent words. | 0.574459 |
26. The system of claim 25 further comprising a second feedback means arranged such that direct feedback is provided on errors in demonstration of target education skills. | 26. The system of claim 25 further comprising a second feedback means arranged such that direct feedback is provided on errors in demonstration of target education skills. 27. The system of claim 26 where the feedback is varied including direct feedback, indirect feedback and both direct and indirect feedback. | 0.953139 |
33. A processor implemented speech recognition method, comprising: receiving a recognized sentence generated through speech recognition; evaluating the sentence by calculating a degree of suitability for each word in the sentence that takes into consideration a relationship of each word with other words in the sentence; selecting, by the processor and based on the calculated degrees of suitability, a target word to be corrected among words in the sentence; sampling candidate words, dependent on the selecting of the target word, considering relationships between the words of the sentence and a position of the target word; selecting, by the processor and dependent on the sampling of the candidate words, at least one of the sampled candidate words based on processor evaluated suitabilities of the sampled candidate words; and respectively revising the sentence by replacing the target word with the selected at least one sampled candidate word, further including performing the processor evaluating of the suitabilities of the sampled candidate words based on respectively dynamically weighted sampling results of the sampled candidate words by a bidirectional neural network linguistic model and by a neural network acoustic model. | 33. A processor implemented speech recognition method, comprising: receiving a recognized sentence generated through speech recognition; evaluating the sentence by calculating a degree of suitability for each word in the sentence that takes into consideration a relationship of each word with other words in the sentence; selecting, by the processor and based on the calculated degrees of suitability, a target word to be corrected among words in the sentence; sampling candidate words, dependent on the selecting of the target word, considering relationships between the words of the sentence and a position of the target word; selecting, by the processor and dependent on the sampling of the candidate words, at least one of the sampled candidate words based on processor evaluated suitabilities of the sampled candidate words; and respectively revising the sentence by replacing the target word with the selected at least one sampled candidate word, further including performing the processor evaluating of the suitabilities of the sampled candidate words based on respectively dynamically weighted sampling results of the sampled candidate words by a bidirectional neural network linguistic model and by a neural network acoustic model. 35. A non-transitory computer-readable storage medium storing instructions to cause computing hardware to perform the method of claim 33 . | 0.639063 |
5. The method of claim 1 , wherein said one or more documents comprise documents being processed by at least one user, and wherein said method further comprises the step of maintaining a word count for each word in said one or more documents and wherein said word frequencies in said predefined misspelling criteria are based on said word counts. | 5. The method of claim 1 , wherein said one or more documents comprise documents being processed by at least one user, and wherein said method further comprises the step of maintaining a word count for each word in said one or more documents and wherein said word frequencies in said predefined misspelling criteria are based on said word counts. 6. The method of claim 5 , further comprising the step of suggesting a correction of said at least one given word using said word within said predefined edit distance and having a frequency above said predefined high threshold. | 0.860978 |
8. A reminder setting apparatus, comprising: at least a processor, a microphone, a display, and at least a non-transitory computer readable storage medium storing instructions of programs executed by the processor, wherein the programs comprise: a speech acquiring module, configured to acquire a speech signal using the microphone and extract, from the speech signal, a plurality of speech segments; a first recognizing module, configured to apply the plurality of speech segments to a predefined keyword search network including foreground models and background models, each foreground model configured to recognize a time-specific keyword from a language and each background model configured to a non-time-specific keyword from the language, and acquire time information in the speech signal acquired by the speech acquiring module when one or more of the plurality of speech segments are identified by the predefined keyword search network as containing a time-specific keyword associated with one of the foreground models, the time information including the time-specific keyword, and start and end times of the identified speech segments in the speech signal; a time determining module, configured to determine a reminder time for reminder setting according to the time information acquired by the first recognizing module; a second recognizing module, configured to acquire, by using continuous speech recognition, a text sequence corresponding to the speech signal acquired by the speech acquiring module; a content determining module, configured to determine reminder content according to the time information acquired by the first recognizing module and the text sequence acquired by the second recognizing module; and a reminder setting module, configured to set a reminder according to the reminder time determined by the time determining module and the reminder content determined by the content determining module and display, on the display, the reminder including the reminder time, the reminder content and an option to replay the speech signal. | 8. A reminder setting apparatus, comprising: at least a processor, a microphone, a display, and at least a non-transitory computer readable storage medium storing instructions of programs executed by the processor, wherein the programs comprise: a speech acquiring module, configured to acquire a speech signal using the microphone and extract, from the speech signal, a plurality of speech segments; a first recognizing module, configured to apply the plurality of speech segments to a predefined keyword search network including foreground models and background models, each foreground model configured to recognize a time-specific keyword from a language and each background model configured to a non-time-specific keyword from the language, and acquire time information in the speech signal acquired by the speech acquiring module when one or more of the plurality of speech segments are identified by the predefined keyword search network as containing a time-specific keyword associated with one of the foreground models, the time information including the time-specific keyword, and start and end times of the identified speech segments in the speech signal; a time determining module, configured to determine a reminder time for reminder setting according to the time information acquired by the first recognizing module; a second recognizing module, configured to acquire, by using continuous speech recognition, a text sequence corresponding to the speech signal acquired by the speech acquiring module; a content determining module, configured to determine reminder content according to the time information acquired by the first recognizing module and the text sequence acquired by the second recognizing module; and a reminder setting module, configured to set a reminder according to the reminder time determined by the time determining module and the reminder content determined by the content determining module and display, on the display, the reminder including the reminder time, the reminder content and an option to replay the speech signal. 11. The apparatus according to claim 8 , wherein the content determining module comprises: a content information determining unit and a reminder content determining unit; wherein: the content information determining unit is configured to determine content information in the text sequence according to the time information and the text sequence, wherein the content information is a subset of the part, in the text sequence, not corresponding to the time information; and the reminder content determining unit is configured to use the content information determined by the content information determining unit and/or the speech segment corresponding to the content information in the speech signal as the reminder content for reminder setting. | 0.543735 |
2. A computer apparatus comprising: a storage unit configured to store programming language data that is text based programming language data combining functions and connection characters formed of character data, and defines a relationship between the functions based on a positional relation between the functions with reference to the connection characters in a display space of a text editor, the functions including determination functions representing determination processing, the connection character including a first connection character connecting functions positioned separately in a horizontal direction and a second connection character connecting functions positioned separately in a vertical direction in the display space specifically; at least one memory configured to store computer program code; and at least one processor configured to access said at least one memory and operate as instructed by said computer program code, said computer program code including: interpretation processing code configured to cause said at least one processor to distinguish the functions and the connection characters by identifying a data type of each character on each line in the programming language data, discriminate whether a function is a discrimination function or not, then with the function discriminated as the discrimination function, associate a right side function connected to the function via the first connection character as a function to be executed in either a Yes branch or a No branch, associate a lower side function connected to the function via the second connection character as a function to be executed in either of the Yes branch or the No branch, to which a branch has not been assigned as the processing of distinguish the functions and the connection characters in a character string of the programming language data, interpret a relationships between the functions based on the positional relation in the display space, wherein the interpretation processing code causes said at least one processor to generate an intermediate code as a code prior to translation into a machine language, based on a result of interpreting relationships between the functions and control to perform processes according to the intermediate code one by one in a predetermined module unit based on a unit of the functions; allow the interpretation processing code of the text based programming language data such that the processes instructed in the text based programming language data are performed in the computer apparatus, and a programming environment employing the text based programming language data is achieved to reduce program data size, wherein the text based programming language data is as a text Visual Programming Language (VPL); and generate code in the machine language based on the interpreted relationships between the functions. | 2. A computer apparatus comprising: a storage unit configured to store programming language data that is text based programming language data combining functions and connection characters formed of character data, and defines a relationship between the functions based on a positional relation between the functions with reference to the connection characters in a display space of a text editor, the functions including determination functions representing determination processing, the connection character including a first connection character connecting functions positioned separately in a horizontal direction and a second connection character connecting functions positioned separately in a vertical direction in the display space specifically; at least one memory configured to store computer program code; and at least one processor configured to access said at least one memory and operate as instructed by said computer program code, said computer program code including: interpretation processing code configured to cause said at least one processor to distinguish the functions and the connection characters by identifying a data type of each character on each line in the programming language data, discriminate whether a function is a discrimination function or not, then with the function discriminated as the discrimination function, associate a right side function connected to the function via the first connection character as a function to be executed in either a Yes branch or a No branch, associate a lower side function connected to the function via the second connection character as a function to be executed in either of the Yes branch or the No branch, to which a branch has not been assigned as the processing of distinguish the functions and the connection characters in a character string of the programming language data, interpret a relationships between the functions based on the positional relation in the display space, wherein the interpretation processing code causes said at least one processor to generate an intermediate code as a code prior to translation into a machine language, based on a result of interpreting relationships between the functions and control to perform processes according to the intermediate code one by one in a predetermined module unit based on a unit of the functions; allow the interpretation processing code of the text based programming language data such that the processes instructed in the text based programming language data are performed in the computer apparatus, and a programming environment employing the text based programming language data is achieved to reduce program data size, wherein the text based programming language data is as a text Visual Programming Language (VPL); and generate code in the machine language based on the interpreted relationships between the functions. 5. The computer apparatus according to claim 2 , wherein the first connection character and the second connection character are textual characters. | 0.529074 |
1. A computer-implemented method comprising: receiving information at an electronic marketplace from multiple executing programs of multiple task requesters that indicates multiple tasks available to be performed by multiple human task performers who have registered with the electronic marketplace as being able to perform tasks, each of the task requesters supplying one or more of the multiple available tasks and indicating for each of the supplied one or more available tasks one or more associated required qualifications for a human who performs the task and associated compensation to be provided by the task requester for satisfactory performance of the task, the electronic marketplace being provided by one or more configured computer processors to facilitate task performance transactions between the task requesters and the human task performers and otherwise being unaffiliated with the multiple task requesters and with the multiple human task performers; and for each of at least some of the multiple available tasks, automatically facilitating performance of the task by, automatically identifying at least one of the multiple human task performers who each has one or more qualifications that satisfy the required qualifications for the task, the automatic identifying of the at least one human task performers being performed by the one or more computer processors; providing information about the task to each of the at least one identified human task performers to enable one or more of the at least one identified human task performers to select to participate in a transaction with the task requester who supplied the task that involves the one or more identified human task performers performing the task for that task requester in exchange for the associated compensation for the task from that task requester; and after receiving results for the task based on performance of the task by the one or more identified human task performers, and without further human intervention, automatically supplying the received results to an executing program of the task requester who supplied the task and facilitating providing of the associated compensation for the task to the one or more identified human task performers on behalf of that task requester, the automatic supplying and facilitating of the providing of the associated compensation being performed by the one or more configured computer processors. | 1. A computer-implemented method comprising: receiving information at an electronic marketplace from multiple executing programs of multiple task requesters that indicates multiple tasks available to be performed by multiple human task performers who have registered with the electronic marketplace as being able to perform tasks, each of the task requesters supplying one or more of the multiple available tasks and indicating for each of the supplied one or more available tasks one or more associated required qualifications for a human who performs the task and associated compensation to be provided by the task requester for satisfactory performance of the task, the electronic marketplace being provided by one or more configured computer processors to facilitate task performance transactions between the task requesters and the human task performers and otherwise being unaffiliated with the multiple task requesters and with the multiple human task performers; and for each of at least some of the multiple available tasks, automatically facilitating performance of the task by, automatically identifying at least one of the multiple human task performers who each has one or more qualifications that satisfy the required qualifications for the task, the automatic identifying of the at least one human task performers being performed by the one or more computer processors; providing information about the task to each of the at least one identified human task performers to enable one or more of the at least one identified human task performers to select to participate in a transaction with the task requester who supplied the task that involves the one or more identified human task performers performing the task for that task requester in exchange for the associated compensation for the task from that task requester; and after receiving results for the task based on performance of the task by the one or more identified human task performers, and without further human intervention, automatically supplying the received results to an executing program of the task requester who supplied the task and facilitating providing of the associated compensation for the task to the one or more identified human task performers on behalf of that task requester, the automatic supplying and facilitating of the providing of the associated compensation being performed by the one or more configured computer processors. 41. The method of claim 1 including, before the providing of information about each of the at least some available tasks to each of the at least one identified human task performers for that task, automatically determining that the human task performer is authorized to receive that information. | 0.57138 |
1. A method for monitoring and controlling business level SLAs (service level agreements) via probe points, comprising: operating at least one host computer to execute a business process commitment language (BPCL) configurator, the BPCL configurator to configure an actuator for implementing management directives; operating the BPCL configurator to configure a condition evaluator for evaluating logical conditions; and operating the BPCL configurator to configure a key performance indicator (KPI) calculator for calculating a KPI value, wherein the at least one host computer determines the probe points of a business process for controlling SLAs based upon business directives, wherein the at least one host computer determines the probe points of the business process upon determining that at least one probe point is unavailable for detecting a dependency between the KPI and at least one of the business directives, wherein the determined probe points replace the unavailable probe point. | 1. A method for monitoring and controlling business level SLAs (service level agreements) via probe points, comprising: operating at least one host computer to execute a business process commitment language (BPCL) configurator, the BPCL configurator to configure an actuator for implementing management directives; operating the BPCL configurator to configure a condition evaluator for evaluating logical conditions; and operating the BPCL configurator to configure a key performance indicator (KPI) calculator for calculating a KPI value, wherein the at least one host computer determines the probe points of a business process for controlling SLAs based upon business directives, wherein the at least one host computer determines the probe points of the business process upon determining that at least one probe point is unavailable for detecting a dependency between the KPI and at least one of the business directives, wherein the determined probe points replace the unavailable probe point. 4. The method of claim 1 , wherein BPCL is described using XML syntax. | 0.892424 |
6. The method of claim 1 , where the class is defined by a class definition that includes a specification of constituent methods, and each specified constituent method, of the constituent methods, corresponds to an instance of a meta-method class. | 6. The method of claim 1 , where the class is defined by a class definition that includes a specification of constituent methods, and each specified constituent method, of the constituent methods, corresponds to an instance of a meta-method class. 7. The method of claim 6 , where the specification of the constituent methods includes a specification of an attribute and a value of the attribute, and the attribute is represented by a property of the meta-method class. | 0.939011 |
13. The system of claim 12 , wherein the processing unit is further configured to execute instructions for: outputting, for at least one group, a regular expression signature using a signature generation system; and evaluating search results using the regular expression signature to identify malicious links. | 13. The system of claim 12 , wherein the processing unit is further configured to execute instructions for: outputting, for at least one group, a regular expression signature using a signature generation system; and evaluating search results using the regular expression signature to identify malicious links. 14. The system of claim 13 , wherein the processing unit is further configured to execute instructions for: blocking malicious links based on the regular expression signature. | 0.836229 |
1. A method for enforcing context model based Service-Oriented Architecture (SOA) policies, comprising: gathering, via a policy engine device, instance documents related to policy enforcement according to a business requirement, where the instance documents are instantiated from corresponding schema documents; generating an instantiated context model comprising references to the gathered instance documents from a context model definition; generating a policy set to be enforced via the instantiated context model according to the gathered instance documents; determining an enforcement sequence of policies in the policy set; applying the policies to the instantiated context model according to the enforcement sequence; and providing context model-based forward chaining, comprising: determining whether the instantiated context model should be updated; if the instantiated context model should be updated: updating the instantiated context model with at least one updated instance document comprising: executing an updating operation to create the at least one updated instance document; detecting and resolving a conflict caused by the updating operation; generating the updated instantiated context model according to the at least one updated instance document and the instantiated context model; and re-applying the policies to only the at least one updated instance document within the updated instantiated context model according to the enforcement sequence. | 1. A method for enforcing context model based Service-Oriented Architecture (SOA) policies, comprising: gathering, via a policy engine device, instance documents related to policy enforcement according to a business requirement, where the instance documents are instantiated from corresponding schema documents; generating an instantiated context model comprising references to the gathered instance documents from a context model definition; generating a policy set to be enforced via the instantiated context model according to the gathered instance documents; determining an enforcement sequence of policies in the policy set; applying the policies to the instantiated context model according to the enforcement sequence; and providing context model-based forward chaining, comprising: determining whether the instantiated context model should be updated; if the instantiated context model should be updated: updating the instantiated context model with at least one updated instance document comprising: executing an updating operation to create the at least one updated instance document; detecting and resolving a conflict caused by the updating operation; generating the updated instantiated context model according to the at least one updated instance document and the instantiated context model; and re-applying the policies to only the at least one updated instance document within the updated instantiated context model according to the enforcement sequence. 8. The method according to claim 1 , where generating a policy set to be enforced via the instantiated context model according to the gathered instance documents comprises: determining policies related to the gathered instance documents; filtering the determined policies according to a document-policy binding; and collecting the filtered policies to generate the policy set. | 0.653918 |
16. The method of claim 8 , further comprising: computing semi-join reductions of maximal source sub-queries associated with the compact query plan to provide a derivative query plan. | 16. The method of claim 8 , further comprising: computing semi-join reductions of maximal source sub-queries associated with the compact query plan to provide a derivative query plan. 17. The method of claim 16 , wherein computing the semi-join reductions further comprises: determining a reducer set of variables for each output variable of the compact query plan that can be transitively reduced by each one of the reducer set of variables. | 0.905767 |
10. The computer program product of claim 7 , the method further comprising generating one or more semantic forms of at least one of the words from the search string, wherein the semantic forms are used in searching the multi-document index. | 10. The computer program product of claim 7 , the method further comprising generating one or more semantic forms of at least one of the words from the search string, wherein the semantic forms are used in searching the multi-document index. 11. The computer program product of claim 10 , wherein generating the one or more semantic forms comprises: identifying one or more synonyms, abbreviations, acronyms, or naming conventions for the at least one of the words from the search string; generating, for each of the at least one of the words from the search string and the one or more semantic forms, a wildcard query that has a wildcard character before and after the word or the semantic form; and searching the documents using each of the generated wildcard queries. | 0.889528 |
2. The method of claim 1 , wherein the computer comprises a multi-context disambiguator. | 2. The method of claim 1 , wherein the computer comprises a multi-context disambiguator. 3. The method of claim 2 , further comprising: enumerating more than one choice for at least one semantically ambiguous aspect of at least one of the alternative syntactic parses. | 0.822835 |
1. A method performed by a virtual machine executing on a client computing device for abstracting communications with a data source located remotely from the client computing device, the method comprising: based on an expression in an application that requests a model document using a Uniform Resource Locator (“URL”), identifying, from a first portion of the URL, a communication channel that is configured to access a resource from the data source; instantiating an instance of the identified communication channel configured to communicate with the data source; causing the communication channel to translate a request represented in a second portion of the URL into a format expected by the data source; transmitting the request to the data source; translating content in a response received from the data source into a format of the model document requested by the application; binding a user interface component associated with the application to the model document, wherein the binding associates the user interface component with a URL object that references the model document, and wherein the URL object is provided by the virtual machine; and receiving, by the URL object, a call from the user interface component to cause a data update associated with an event to be implemented on the model document; wherein program logic of the application is defined separately from the virtual machine. | 1. A method performed by a virtual machine executing on a client computing device for abstracting communications with a data source located remotely from the client computing device, the method comprising: based on an expression in an application that requests a model document using a Uniform Resource Locator (“URL”), identifying, from a first portion of the URL, a communication channel that is configured to access a resource from the data source; instantiating an instance of the identified communication channel configured to communicate with the data source; causing the communication channel to translate a request represented in a second portion of the URL into a format expected by the data source; transmitting the request to the data source; translating content in a response received from the data source into a format of the model document requested by the application; binding a user interface component associated with the application to the model document, wherein the binding associates the user interface component with a URL object that references the model document, and wherein the URL object is provided by the virtual machine; and receiving, by the URL object, a call from the user interface component to cause a data update associated with an event to be implemented on the model document; wherein program logic of the application is defined separately from the virtual machine. 7. The method as recited in claim 1 , further comprising allowing applications to programmatically modify contents of an XML document using a change operation and implement at least one data manipulation primitive from replace, replace text, append, prepend, insert, remove, remove children, new, and delete. | 0.531153 |
6. An intention estimating method of estimating a user's intention from the user's language input, said method comprising: slitting the inputted language into a plurality of morphemes and extracting, from the morphemes, one or more intention estimation units each of which is a unit on which an estimation of said intention is to be performed, each of the intention estimation units consisting of one or more morphemes; estimating a respective partial intention which indicates a respective intention for each of said extracted intention estimation units; calculating an intention co-occurrence weight having a value which depends on a relationship between said estimated partial intentions; and generating an intention sequence corresponding to said inputted language by using said estimated one or more said partial intentions, and generating an intention estimation result corresponding to said inputted language by using both a score showing a likelihood of said generated intention sequence and the intention co-occurrence weight calculated for said partial intentions which construct said generated intention sequence. | 6. An intention estimating method of estimating a user's intention from the user's language input, said method comprising: slitting the inputted language into a plurality of morphemes and extracting, from the morphemes, one or more intention estimation units each of which is a unit on which an estimation of said intention is to be performed, each of the intention estimation units consisting of one or more morphemes; estimating a respective partial intention which indicates a respective intention for each of said extracted intention estimation units; calculating an intention co-occurrence weight having a value which depends on a relationship between said estimated partial intentions; and generating an intention sequence corresponding to said inputted language by using said estimated one or more said partial intentions, and generating an intention estimation result corresponding to said inputted language by using both a score showing a likelihood of said generated intention sequence and the intention co-occurrence weight calculated for said partial intentions which construct said generated intention sequence. 7. The intention estimating method according to claim 6 , wherein, the calculating the intention co-occurrence weight includes referring to intention hierarchical layer graph data in which said intentions are hierarchized and defined according to the relationship between said intentions to calculate said intention co-occurrence weight by using a weight which is defined for each of said intentions which constructs each hierarchical layer. | 0.669177 |
2. The touch sensitive display device of claim 1 , wherein the control unit converts the at least one word overlapped by the word-selecting interface in response to a position from which the first contact is detected in the virtual keyboard of the first area and wherein the controller displays the converted at least one word in the at least one soft button, respectively. | 2. The touch sensitive display device of claim 1 , wherein the control unit converts the at least one word overlapped by the word-selecting interface in response to a position from which the first contact is detected in the virtual keyboard of the first area and wherein the controller displays the converted at least one word in the at least one soft button, respectively. 4. The touch sensitive display device of claim 2 , wherein if the second contact is detected from the soft button, the controller inputs the converted word displayed in the soft button into the text input box. | 0.829646 |
14. The method as recited in claim 1 , wherein defining a model relating to transmission behavior of prior email comprises defining a model derived from statistics relating to transmission behavior of emails of one of said email accounts. | 14. The method as recited in claim 1 , wherein defining a model relating to transmission behavior of prior email comprises defining a model derived from statistics relating to transmission behavior of emails of one of said email accounts. 22. The method as recited in claim 14 , wherein defining a model relating to transmission of emails from one of said email accounts comprises defining said model based on the size of said emails that are transmitted by said email account. | 0.863201 |
44. A system for generating a pronounceable security password according to claim 43, further comprising means for determining if consecutive characters of said first pronounceable word segment correspond to a stored first word segment portion categorized in a non-selection category. | 44. A system for generating a pronounceable security password according to claim 43, further comprising means for determining if consecutive characters of said first pronounceable word segment correspond to a stored first word segment portion categorized in a non-selection category. 45. A system for generating a pronounceable security password according to claim 44, further comprising: means for identifying one of said stored first word segment portions categorized in said one or more selection categories and corresponding to consecutive characters at an end portion of said first pronounceable word segment; means for retrieving a second one of said stored second word segment portions from the set of stored second word segment portions associated with the identified stored first word segment portion, wherein selection of any one of said stored second word segment portions in said associated set of stored second word segment portions is of substantially equal probability; and means for combining said first pronounceable word segment with said second retrieved second word segment portion to form a part of said password; wherein said pronounceable security password also includes said second retrieved second word segment portion only if consecutive characters of said part of said password fail to correspond to those of said stored plurality of first word segment portions categorized in said non-selection category. | 0.813343 |
22. The system of claim 20 , wherein the operations further comprise: determining a first category-specific count representing a total number of times the query prefix was issued by users from user locations having the first category; and providing the first category-specific query suggestion in accordance with the first category-specific count. | 22. The system of claim 20 , wherein the operations further comprise: determining a first category-specific count representing a total number of times the query prefix was issued by users from user locations having the first category; and providing the first category-specific query suggestion in accordance with the first category-specific count. 23. The system of claim 22 , wherein the one or more queries include two queries, and providing the first category-specific query suggestion in accordance with the first category-specific count comprises: ranking the first category-specific query within the two queries in accordance with the first category-specific count. | 0.896964 |
1. A computer-implemented method executed by a processor that performs operations for reducing ambiguities present in electronically stored words, the operations comprising: receiving a plurality of characters in electronic form, the received plurality of characters corresponding to a sequence of words and including an ambiguous word that has one or more characters whose value is substantially uncertain; comparing at least some of the words in the sequence to a first ontology, the first ontology defining a plurality of nodes, each node being associated with a word, and each node being connected to at least one other node by a link, each link being associated with a concept that relates the words associated with the nodes connected by the link in a predetermined context, wherein at least some of the nodes are associated with non-textual image information that identifies an enhancement to character-based text. | 1. A computer-implemented method executed by a processor that performs operations for reducing ambiguities present in electronically stored words, the operations comprising: receiving a plurality of characters in electronic form, the received plurality of characters corresponding to a sequence of words and including an ambiguous word that has one or more characters whose value is substantially uncertain; comparing at least some of the words in the sequence to a first ontology, the first ontology defining a plurality of nodes, each node being associated with a word, and each node being connected to at least one other node by a link, each link being associated with a concept that relates the words associated with the nodes connected by the link in a predetermined context, wherein at least some of the nodes are associated with non-textual image information that identifies an enhancement to character-based text. 16. The method of claim 1 , wherein the non-textual image information that identifies an enhancement to character-based text comprises color information. | 0.763755 |
1. A method comprising: accessing first data representing text, wherein the text defines at least two grammatical break positions representing a particular type of grammatical break between two portions of the text; identifying, from among the at least two grammatical break positions, a position that is closest to a target position within the text, wherein the target position is within a range from a first position to a second position, wherein the first position is positioned after 100 words from a beginning of the text, and wherein the second position is positioned before 130 words from the beginning of the text; based on the identified position within the text, generating second data that represents a proper subset of the text, wherein the proper subset extends from an initial position within the text to the identified position within the text; and providing output based on the generated second data. | 1. A method comprising: accessing first data representing text, wherein the text defines at least two grammatical break positions representing a particular type of grammatical break between two portions of the text; identifying, from among the at least two grammatical break positions, a position that is closest to a target position within the text, wherein the target position is within a range from a first position to a second position, wherein the first position is positioned after 100 words from a beginning of the text, and wherein the second position is positioned before 130 words from the beginning of the text; based on the identified position within the text, generating second data that represents a proper subset of the text, wherein the proper subset extends from an initial position within the text to the identified position within the text; and providing output based on the generated second data. 3. The method of claim 1 , wherein the particular type of grammatical break between the two portions of the text comprises a sentence break between two paragraphs of the text. | 0.816667 |
9. The system of claim 8 , wherein said reporting engine is configured to provide notification of potential user attrition based upon a comparison of a, user profile in said database with historic user profile data. | 9. The system of claim 8 , wherein said reporting engine is configured to provide notification of potential user attrition based upon a comparison of a, user profile in said database with historic user profile data. 10. The system of claim 9 , further comprising a data mining engine configured to provide access to detailed data supporting said periodic reports. | 0.969292 |
10. A method for creating a messaging hierarchy among multiple network entities in a computer network, the method comprising: locating a parent tier entity by a first entity in the network upon joining the network; sending subscription information for the first entity to the parent tier entity, wherein said subscription information defines a desired scope of content to which the first entity subscribes; and determining whether the desired scope is encompassed by a scope of content to which the parent tier entity subscribes; when determined that the desired scope is encompassed by the scope of content to which the parent tier entity subscribes, not propagating the subscription information for the first entity further; when determined that the desired scope is not encompassed by the scope of content to which the parent tier entity subscribes, sending said subscription information from the parent tier entity to entities above the parent tier entity in the messaging hierarchy and to entities below the parent tier entity which provide at least a portion of data corresponding to said desired scope; wherein the messaging hierarchy is formed by virtual connections between the network entities in response to publication/subscription information exchanged between entities and corresponds to a data hierarchy defined for the messaging hierarchy, wherein information embedded within published content to which one or more entities subscribe defines said data hierarchy; wherein the multiple network entities act as publication entities, subscription entities and guest entities, wherein publication entities provide data to the messaging hierarchy, subscription entities receive data from publication entities, and guest entities are operable to temporarily join the network to distribute data or perform queries. | 10. A method for creating a messaging hierarchy among multiple network entities in a computer network, the method comprising: locating a parent tier entity by a first entity in the network upon joining the network; sending subscription information for the first entity to the parent tier entity, wherein said subscription information defines a desired scope of content to which the first entity subscribes; and determining whether the desired scope is encompassed by a scope of content to which the parent tier entity subscribes; when determined that the desired scope is encompassed by the scope of content to which the parent tier entity subscribes, not propagating the subscription information for the first entity further; when determined that the desired scope is not encompassed by the scope of content to which the parent tier entity subscribes, sending said subscription information from the parent tier entity to entities above the parent tier entity in the messaging hierarchy and to entities below the parent tier entity which provide at least a portion of data corresponding to said desired scope; wherein the messaging hierarchy is formed by virtual connections between the network entities in response to publication/subscription information exchanged between entities and corresponds to a data hierarchy defined for the messaging hierarchy, wherein information embedded within published content to which one or more entities subscribe defines said data hierarchy; wherein the multiple network entities act as publication entities, subscription entities and guest entities, wherein publication entities provide data to the messaging hierarchy, subscription entities receive data from publication entities, and guest entities are operable to temporarily join the network to distribute data or perform queries. 15. The method of claim 10 wherein each network entity has a data persistence setting. | 0.572539 |
3. A method of analyzing behavior of one or more subjects of a living species comprising the steps of: a) collecting audio/visual records illustrating portions of the life of a subject, said portion of the life of the subject including an activity, and optionally, events preceding the activity and events following the activity; b) creating text describing the audio/visual record of each said portions, activity or events; c) storing said audio/visual records; d) indexing said audio/visual records using a sequential coding; e) associating said text with said audio/visual records; f) associating said keywords with said audio/visual records; g) recording said association between said audio/visual records and said text; h) recording the association between said audio/visual records and keywords; i) searching said audio/visual records, keywords and text to locate desired visual records; j) retrieving the audio/visual record, associated keywords and associated text; and k) comparing and contrasting the audio/visual records having the same keywords associated therewith, so that the same event recorded for different subjects can be contrasted and the preceding activity and following activity related thereto can be contrasted. | 3. A method of analyzing behavior of one or more subjects of a living species comprising the steps of: a) collecting audio/visual records illustrating portions of the life of a subject, said portion of the life of the subject including an activity, and optionally, events preceding the activity and events following the activity; b) creating text describing the audio/visual record of each said portions, activity or events; c) storing said audio/visual records; d) indexing said audio/visual records using a sequential coding; e) associating said text with said audio/visual records; f) associating said keywords with said audio/visual records; g) recording said association between said audio/visual records and said text; h) recording the association between said audio/visual records and keywords; i) searching said audio/visual records, keywords and text to locate desired visual records; j) retrieving the audio/visual record, associated keywords and associated text; and k) comparing and contrasting the audio/visual records having the same keywords associated therewith, so that the same event recorded for different subjects can be contrasted and the preceding activity and following activity related thereto can be contrasted. 10. The method of claim 3 wherein said audio/visual records, keywords and text are displayed in an observable manner such that one or more audio/visual records, keywords and textual description can be concurrently viewed for one or more subjects and for one or more behaviors. | 0.67223 |
1. A method of providing information regarding the location of a remotely located vehicle, comprising the steps: (A) generating an assistance request signal from the vehicle; (B) receiving the assistance request signal at a second location, remote from the vehicle; (C) determining a longitudinal placement of the vehicle; (D) determining a latitudinal placement of the vehicle; (E) determining a speed of travel of the vehicle; (F) determining a direction of travel of the vehicle; (G) generating a textual description of the vehicle location using the placement and travel information from steps (C) through (F) and providing the textual description at the second location in response to said step a), the textual description listing a street on which the vehicle is located and describing the vehicle location textually without a graphical map representation; and (H) at the second location, dispatching assistance to the vehicle location based upon the textual description. | 1. A method of providing information regarding the location of a remotely located vehicle, comprising the steps: (A) generating an assistance request signal from the vehicle; (B) receiving the assistance request signal at a second location, remote from the vehicle; (C) determining a longitudinal placement of the vehicle; (D) determining a latitudinal placement of the vehicle; (E) determining a speed of travel of the vehicle; (F) determining a direction of travel of the vehicle; (G) generating a textual description of the vehicle location using the placement and travel information from steps (C) through (F) and providing the textual description at the second location in response to said step a), the textual description listing a street on which the vehicle is located and describing the vehicle location textually without a graphical map representation; and (H) at the second location, dispatching assistance to the vehicle location based upon the textual description. 16. The method of claim 1 further including the step of determining the street on which the vehicle is located automatically by a computer. | 0.659395 |
1. A method of visualizing a hierarchy, the method comprising: receiving a plurality of data records of a hierarchy that has a plurality of nodes, wherein a node includes at least zero data records and at least zero other nodes, the data records each including a field that identifies the position of the record in the hierarchy; displaying a plurality of levels to represent the hierarchy, the displaying including displaying a glyph to represent a node of each branch of the hierarchy, radially arranging nodes that are at a common level in the hierarchy, and connecting nodes to portray hierarchical relationships; selectively labeling at least some of the nodes; and displaying records that terminate at a given node as glyphs arranged on a pan located beneath the node at which the records terminate. | 1. A method of visualizing a hierarchy, the method comprising: receiving a plurality of data records of a hierarchy that has a plurality of nodes, wherein a node includes at least zero data records and at least zero other nodes, the data records each including a field that identifies the position of the record in the hierarchy; displaying a plurality of levels to represent the hierarchy, the displaying including displaying a glyph to represent a node of each branch of the hierarchy, radially arranging nodes that are at a common level in the hierarchy, and connecting nodes to portray hierarchical relationships; selectively labeling at least some of the nodes; and displaying records that terminate at a given node as glyphs arranged on a pan located beneath the node at which the records terminate. 7. A method of visualizing a hierarchy in accordance with claim 1 and further comprising shape coding a glyph representing a node depending on a property of the node. | 0.819264 |
6. A computer-implemented system for communicating between an application and a database, the system comprising: a code generator to generate a code of databinding files to bind data of the database to a program of the application wherein said code identifies tables to persist the data in the database, wherein said code generates a table of metadata from the identified tables, wherein said code generates stored procedures from the metadata table, generates value objects (VO) from the metadata table and generates at least one XML binding definition from the metadata table; and at least one run-time component coupled to the code generator to integrate the generated code of the stored procedures to the VOs via the XML binding definitions into the application when the application is run. | 6. A computer-implemented system for communicating between an application and a database, the system comprising: a code generator to generate a code of databinding files to bind data of the database to a program of the application wherein said code identifies tables to persist the data in the database, wherein said code generates a table of metadata from the identified tables, wherein said code generates stored procedures from the metadata table, generates value objects (VO) from the metadata table and generates at least one XML binding definition from the metadata table; and at least one run-time component coupled to the code generator to integrate the generated code of the stored procedures to the VOs via the XML binding definitions into the application when the application is run. 14. The system of claim 6 wherein the application comprises an application written in JAVA programming language. | 0.600607 |
1. A method performed by one or more computers, the method comprising: receiving a current search query submitted by a current user of a current user device to a search engine system; determining that the current search query is similar to a first previously submitted search query of a plurality of previously submitted search queries that have previously been submitted by the current user to the search engine system, wherein determining that the current search query is similar to the first previously submitted search query comprises determining that at least one first term from the current search query matches a corresponding term that appears in the first previously submitted search query; determining that a different second term satisfies the condition that: (i) the different second term appears in the first previously submitted search query that is similar to the current search query, (ii) the different second term does not appear in the current search query, and (iii) the different second term appears in at least a threshold number of other distinct search queries of the plurality of previously submitted search queries that have previously been submitted by the current user, wherein each other distinct search query is distinct from both the first previously submitted search query and the current search query; generating a revised search query by adding the different second term to the current search query; obtaining search results for the revised search query from a search engine; and providing the search results to the current user in a response to the current search query. | 1. A method performed by one or more computers, the method comprising: receiving a current search query submitted by a current user of a current user device to a search engine system; determining that the current search query is similar to a first previously submitted search query of a plurality of previously submitted search queries that have previously been submitted by the current user to the search engine system, wherein determining that the current search query is similar to the first previously submitted search query comprises determining that at least one first term from the current search query matches a corresponding term that appears in the first previously submitted search query; determining that a different second term satisfies the condition that: (i) the different second term appears in the first previously submitted search query that is similar to the current search query, (ii) the different second term does not appear in the current search query, and (iii) the different second term appears in at least a threshold number of other distinct search queries of the plurality of previously submitted search queries that have previously been submitted by the current user, wherein each other distinct search query is distinct from both the first previously submitted search query and the current search query; generating a revised search query by adding the different second term to the current search query; obtaining search results for the revised search query from a search engine; and providing the search results to the current user in a response to the current search query. 7. The method of claim 1 , further comprising: assigning a first weight to the different second term in the revised search query, the first weight indicating that occurrences of the different second term in a resource are given less weight than identical occurrences of terms from the current search query when generating a score for the resource in response to the revised search query. | 0.687601 |
8. A system for tracking quality measures in one or more documents, wherein said documents are respectively associated with content abstracted from the documents, comprising: a processor; a display device; a user-input device; and a non-transient computer-readable information storage device having program instructions recorded therein, said program instructions when executed by the processor controlling the system to: determine that the one or more documents belong to a collection of documents that correspond to a single patient encounter; determine, based on the abstracted content, a quality measure category; obtain a quality measure definition corresponding to a quality measure included in the determined quality measure category, said definition including at least one quality measure criterion, keywords corresponding to the at least one quality measure criterion and queries corresponding to the at least one quality measure criterion; determine, based on the keywords corresponding to the criterion, whether a portion of the abstracted content satisfies the at least one quality measure criterion; determine that no information was located in the documents satisfying the at least one quality measure criteria; selectively generate, based on the quality measure definition, a report including the query corresponding to the criterion, a query response, and indicates criteria in the definition for which no abstracted content satisfying the criteria was included in the collection of documents; determine that the patient encounter is ongoing; and generate an alert to take an action for satisfying the at least one quality measure criteria that has not been satisfied, while the encounter is ongoing. | 8. A system for tracking quality measures in one or more documents, wherein said documents are respectively associated with content abstracted from the documents, comprising: a processor; a display device; a user-input device; and a non-transient computer-readable information storage device having program instructions recorded therein, said program instructions when executed by the processor controlling the system to: determine that the one or more documents belong to a collection of documents that correspond to a single patient encounter; determine, based on the abstracted content, a quality measure category; obtain a quality measure definition corresponding to a quality measure included in the determined quality measure category, said definition including at least one quality measure criterion, keywords corresponding to the at least one quality measure criterion and queries corresponding to the at least one quality measure criterion; determine, based on the keywords corresponding to the criterion, whether a portion of the abstracted content satisfies the at least one quality measure criterion; determine that no information was located in the documents satisfying the at least one quality measure criteria; selectively generate, based on the quality measure definition, a report including the query corresponding to the criterion, a query response, and indicates criteria in the definition for which no abstracted content satisfying the criteria was included in the collection of documents; determine that the patient encounter is ongoing; and generate an alert to take an action for satisfying the at least one quality measure criteria that has not been satisfied, while the encounter is ongoing. 11. The system of claim 8 , wherein the content abstracted from the documents comprises content abstracted based on a lexicon of medical terminology. | 0.745868 |
13. The non-transitory computer-readable medium of claim 12 , wherein the node-type of the at least one node is a secondary class node type and instructions for said selecting comprise instructions for: determining which node has a secondary class node type, that is at a lower position within the grammatical tree than any other node having a secondary class node type. | 13. The non-transitory computer-readable medium of claim 12 , wherein the node-type of the at least one node is a secondary class node type and instructions for said selecting comprise instructions for: determining which node has a secondary class node type, that is at a lower position within the grammatical tree than any other node having a secondary class node type. 14. The non-transitory computer-readable medium of claim 13 , wherein the secondary class node type comprises at least one of a node type representing a prepositional phrase, an adjective phrase, an adverbial phrase, or a dependent clause. | 0.908696 |
1. A method comprising: receiving, by a processor, an image to be forwarded to a client device of a user; retrieving, by the processor, text data associated with the image; resizing, by the processor, the image based on a screen size of the client device; determining, by the processor, textual content to be forwarded to the client device with the resized image, comprising: comparing, by the processor, length of the retrieved text data associated with the image to a predetermined threshold length associated with the screen size of the client device; and generating, by the processor, a summary of the retrieved text data associated with the image upon determination that the length of the text data is greater than the predetermined threshold length; identifying, by the processor, location within the resized image for placement of the textual content, said identification of the location comprising determining if a predetermined position is associated with a content category of the resized image, wherein said location is then associated with said predetermined position, and wherein, when said resized image does not have an associated predetermined position, said location is based on positions of location elements within said resized image; producing, by the processor, a notification comprising the resized image and the textual content positioned at the location within the resized image; and transmitting, by the processor, the notification for display at the client device. | 1. A method comprising: receiving, by a processor, an image to be forwarded to a client device of a user; retrieving, by the processor, text data associated with the image; resizing, by the processor, the image based on a screen size of the client device; determining, by the processor, textual content to be forwarded to the client device with the resized image, comprising: comparing, by the processor, length of the retrieved text data associated with the image to a predetermined threshold length associated with the screen size of the client device; and generating, by the processor, a summary of the retrieved text data associated with the image upon determination that the length of the text data is greater than the predetermined threshold length; identifying, by the processor, location within the resized image for placement of the textual content, said identification of the location comprising determining if a predetermined position is associated with a content category of the resized image, wherein said location is then associated with said predetermined position, and wherein, when said resized image does not have an associated predetermined position, said location is based on positions of location elements within said resized image; producing, by the processor, a notification comprising the resized image and the textual content positioned at the location within the resized image; and transmitting, by the processor, the notification for display at the client device. 5. The method of claim 1 , wherein resizing the image further comprises: accessing, by the processor, a database comprising specifications of the client device; obtaining from the database, by the processor, the screen size of the client device. | 0.625566 |
29. A method comprising: receiving a request from a source to access content of a target Web domain, the request being addressed to a domain address of the target Web domain; retrieving historical relevance data associated with at least one previous request from another source to the target Web domain from a database; identifying at least one interest keyword that is determined to be relevant to the request based on a combination of the domain address of the target Web domain and the historical relevance data, the historical relevance data including one or more context factors collected from the at least one previous request to the target Web domain; transmitting the at least one interest keyword to a server that serves Web content associated with the interest keyword to the source, responsive to the request; and redirecting the source to access advertising content defined by the at least one interest keyword, responsive to the request. | 29. A method comprising: receiving a request from a source to access content of a target Web domain, the request being addressed to a domain address of the target Web domain; retrieving historical relevance data associated with at least one previous request from another source to the target Web domain from a database; identifying at least one interest keyword that is determined to be relevant to the request based on a combination of the domain address of the target Web domain and the historical relevance data, the historical relevance data including one or more context factors collected from the at least one previous request to the target Web domain; transmitting the at least one interest keyword to a server that serves Web content associated with the interest keyword to the source, responsive to the request; and redirecting the source to access advertising content defined by the at least one interest keyword, responsive to the request. 35. The method of claim 29 further comprising: collecting one or more source context factors pertaining to the target Web domain, wherein the identifying operation comprises identifying at least one interest keyword that is determined to be relevant to the request based on a combination of the domain address of the target Web domain, the collected source context factors, and historical relevance data associated with the target Web domain. | 0.570143 |
1. A method for coreference resolution comprising: receiving a set of document clusters, each cluster in the set of document clusters comprising a set of text documents; identifying instances of each of a set of candidate named entities in the document clusters, the instances of a respective candidate named entity being text elements; for each of the candidate named entities, generating an event profile, the event profile comprising an optionally normalized vector of size k, where k is the number of document clusters in the set, in which each index of the vector is based on the occurrences of the identified instances of the candidate named entity in a respective one of the k clusters; with a processor, computing a similarity between a pair of the candidate named entities based on their respective event profiles; and providing a decision for merging of the candidate named entities into a common real named entity, based on the computed similarity. | 1. A method for coreference resolution comprising: receiving a set of document clusters, each cluster in the set of document clusters comprising a set of text documents; identifying instances of each of a set of candidate named entities in the document clusters, the instances of a respective candidate named entity being text elements; for each of the candidate named entities, generating an event profile, the event profile comprising an optionally normalized vector of size k, where k is the number of document clusters in the set, in which each index of the vector is based on the occurrences of the identified instances of the candidate named entity in a respective one of the k clusters; with a processor, computing a similarity between a pair of the candidate named entities based on their respective event profiles; and providing a decision for merging of the candidate named entities into a common real named entity, based on the computed similarity. 19. A computer program product comprising a non-transitory computer-readable medium storing instructions, which when executed by a computer, perform the method of claim 1 . | 0.6919 |
9. A method of improving computer-based search results by organizing electronic documents of a document corpus, each one of the electronic documents comprising a predetermined classification code and having similarity values based on a similarity with respect to other electronic documents in the document corpus, the method comprising: comparing each individual electronic document in the document corpus with each other electronic document in the document corpus, thereby forming document pairs, wherein the electronic documents of the document pairs are compared by: calculating a similarity value with respect to the electronic documents of a document pair from a plurality of attributes of the electronic documents in the document corpus, the plurality of attributes comprising a citation attribute, a text-based attribute, and one or more of the following attributes: an author attribute expressed as s ( p , q ) = number of common authors number of distinct authors , a publication attribute, an institution attribute expressed as s ( p , q ) = number of common institutions number of distinct institutions , a downloads attribute expressed as s ( p , q ) = number of downloads of two documents in a same time period total number of downloads of two documents , and a clustering results attribute expressed as s ( p , q ) = number of common clusters total number of clusters , wherein the calculating comprises: calculating a similarity vector S (p,q) for each document pair in the document corpus, wherein the similarity vector S (p,q) is expressed by: S _ ( p , q ) = ( s ( p , q ) 1 ⋮ s ( p , q ) n ) , where s(p,q) is a similarity measure of a first electronic document p to a second electronic document q of the document pair with respect to an individual attribute of the plurality of attributes; and calculating the similarity value for each document pair comprises summing weighted individual similarity measures of the similarity vector S (p,q) such that the similarity value is expressed by: S ( p , q ) = ∑ i w i s ( p , q ) i where w i is a weighting factor for each attribute i of the plurality of attributes; and associating the similarity value with both electronic documents of the document pair; for one or more predetermined classification codes: applying a classifier to each electronic document having the predetermined classification code to associate an evaluation code with each electronic document, wherein the classifier uses the similarity values of the electronic documents having the predetermined classification code; for one or more predetermined classification codes, after determining an evaluation classification for each electronic document in the document corpus: applying a clustering algorithm to electronic documents having an evaluation code that is the same as the predetermined classification code to create a plurality of hierarchical clusters under the predetermined classification code, wherein the clustering algorithm uses the similarity values of the electronic documents in the document corpus to save metadata associated with each individual electronic document in the document corpus; and providing the electronic documents in the plurality of hierarchical clusters such that, when a computer-based search is completed, the computer-based search searches the document corpus and the results are derived from the saved metadata and are graphically presented at a user computing device as a plurality of dots, each dot in the plurality of dots corresponding to each electronic document of the document corpus, the plurality of dots arranged according to the plurality of hierarchical clusters. | 9. A method of improving computer-based search results by organizing electronic documents of a document corpus, each one of the electronic documents comprising a predetermined classification code and having similarity values based on a similarity with respect to other electronic documents in the document corpus, the method comprising: comparing each individual electronic document in the document corpus with each other electronic document in the document corpus, thereby forming document pairs, wherein the electronic documents of the document pairs are compared by: calculating a similarity value with respect to the electronic documents of a document pair from a plurality of attributes of the electronic documents in the document corpus, the plurality of attributes comprising a citation attribute, a text-based attribute, and one or more of the following attributes: an author attribute expressed as s ( p , q ) = number of common authors number of distinct authors , a publication attribute, an institution attribute expressed as s ( p , q ) = number of common institutions number of distinct institutions , a downloads attribute expressed as s ( p , q ) = number of downloads of two documents in a same time period total number of downloads of two documents , and a clustering results attribute expressed as s ( p , q ) = number of common clusters total number of clusters , wherein the calculating comprises: calculating a similarity vector S (p,q) for each document pair in the document corpus, wherein the similarity vector S (p,q) is expressed by: S _ ( p , q ) = ( s ( p , q ) 1 ⋮ s ( p , q ) n ) , where s(p,q) is a similarity measure of a first electronic document p to a second electronic document q of the document pair with respect to an individual attribute of the plurality of attributes; and calculating the similarity value for each document pair comprises summing weighted individual similarity measures of the similarity vector S (p,q) such that the similarity value is expressed by: S ( p , q ) = ∑ i w i s ( p , q ) i where w i is a weighting factor for each attribute i of the plurality of attributes; and associating the similarity value with both electronic documents of the document pair; for one or more predetermined classification codes: applying a classifier to each electronic document having the predetermined classification code to associate an evaluation code with each electronic document, wherein the classifier uses the similarity values of the electronic documents having the predetermined classification code; for one or more predetermined classification codes, after determining an evaluation classification for each electronic document in the document corpus: applying a clustering algorithm to electronic documents having an evaluation code that is the same as the predetermined classification code to create a plurality of hierarchical clusters under the predetermined classification code, wherein the clustering algorithm uses the similarity values of the electronic documents in the document corpus to save metadata associated with each individual electronic document in the document corpus; and providing the electronic documents in the plurality of hierarchical clusters such that, when a computer-based search is completed, the computer-based search searches the document corpus and the results are derived from the saved metadata and are graphically presented at a user computing device as a plurality of dots, each dot in the plurality of dots corresponding to each electronic document of the document corpus, the plurality of dots arranged according to the plurality of hierarchical clusters. 10. The method of claim 9 , wherein the citation attribute is based on direct citations, co-citations and bibliographic couplings. | 0.516402 |
1. A method for identifying documents referring to an entity, the entity being associated with a first set of features, the method comprising: identifying a first set of documents based on a first model and the first set of features, wherein the first model includes a first set of rules specifying at least one combination of features from the first set of features that are sufficient for identifying a document referring to the entity, each document of the first set of documents comprising a sufficient number of features in common with the first set of features to identify a document referring to the entity according to the first model; determining a second model based on the features of the first set of documents, wherein the second model includes a second set of rules specifying at least one combination of features from the first set of documents that are sufficient for identifying a document referring to the entity; identifying a second set of documents based on the second model and the first set of features, each document of the second set of documents comprising a sufficient number of features in common with the first set of features to identify a document referring to the entity according to the second model; identifying a second set of features based on the second set of documents; determining if the second set of features are associated with the entity; and responsive to determining that the second set of features are associated with the entity, identifying a third set of documents based on a third model and the second set of features, the third set of documents each comprising a sufficient number of features in common with the second set of features to identify a document referring to the entity according to the third model. | 1. A method for identifying documents referring to an entity, the entity being associated with a first set of features, the method comprising: identifying a first set of documents based on a first model and the first set of features, wherein the first model includes a first set of rules specifying at least one combination of features from the first set of features that are sufficient for identifying a document referring to the entity, each document of the first set of documents comprising a sufficient number of features in common with the first set of features to identify a document referring to the entity according to the first model; determining a second model based on the features of the first set of documents, wherein the second model includes a second set of rules specifying at least one combination of features from the first set of documents that are sufficient for identifying a document referring to the entity; identifying a second set of documents based on the second model and the first set of features, each document of the second set of documents comprising a sufficient number of features in common with the first set of features to identify a document referring to the entity according to the second model; identifying a second set of features based on the second set of documents; determining if the second set of features are associated with the entity; and responsive to determining that the second set of features are associated with the entity, identifying a third set of documents based on a third model and the second set of features, the third set of documents each comprising a sufficient number of features in common with the second set of features to identify a document referring to the entity according to the third model. 5. The method of claim 1 , wherein the second set of features includes at least one feature not included in the first set of features. | 0.543733 |
21. A method, comprising: receiving content to display on a smart sign, the content is in a default language; receiving, from the smart sign, an indication of a mobile device that is in proximity to the smart sign, a preferred language of a user of the mobile device, and a location of the mobile device relative to the smart sign; translating the content into the preferred language of the user; determining at least one visual characteristic for the translated content based on the location of the mobile device; providing the translated content to the smart sign for display based on the at least one visual characteristic; receiving, from the smart sign, an indication that a plurality of mobile devices are now in proximity to the smart sign and a total number of preferred languages of users of the plurality of mobile devices; and providing a non-text version of the content to the smart sign for display in response to the number of preferred languages exceeds a predetermined threshold. | 21. A method, comprising: receiving content to display on a smart sign, the content is in a default language; receiving, from the smart sign, an indication of a mobile device that is in proximity to the smart sign, a preferred language of a user of the mobile device, and a location of the mobile device relative to the smart sign; translating the content into the preferred language of the user; determining at least one visual characteristic for the translated content based on the location of the mobile device; providing the translated content to the smart sign for display based on the at least one visual characteristic; receiving, from the smart sign, an indication that a plurality of mobile devices are now in proximity to the smart sign and a total number of preferred languages of users of the plurality of mobile devices; and providing a non-text version of the content to the smart sign for display in response to the number of preferred languages exceeds a predetermined threshold. 23. The method of claim 21 , further comprises: determining a first size at which to display the translated content and a second size at which to display the content in the default language; and providing the translated content and the content in the default language to the smart sign for display based on the determined first and second sizes. | 0.760581 |
1. A computer-implemented method comprising: displaying a graphical user interface for a language translation application on a user device, the graphical user interface comprising a first graphical representation identifying a source language, a second graphical representation identifying a target language, and a third graphical representation indicating the user device operating in a listening mode that is arranged adjacent to both the first graphical representation identifying the source language and the second graphical representation identifying the target language; animating, in response to a request to initiate listening for an utterance in the source language, the third graphical representation indicating the listening mode while the language translation application prepares to listen for the source language; highlighting, in response to the language translation application completing preparations to listen for the source language, the third graphical representation indicating the listening mode while also highlighting the first graphical representation identifying the source language to create a visual correspondence between the first graphical representation identifying the source language and the third graphical representation indicating the listening mode indicating that the language translation application is prepared to receive voice input in the source language; receiving an utterance spoken in the source language for translation into the target language while the third graphical representation indicating the listening mode and the first graphical representation identifying the source language are highlighted to create a visual correspondence between the first graphical representation identifying the source language and the third graphical representation indicating the listening mode; replacing, in response to the language translation application preparing an output of a translation of the utterance into the target language, the third graphical representation indicating the listening mode on the graphical user interface with a fourth graphical representation indicating a translation transcription mode on the graphical user interface; and highlighting, in response to the language translation application completing preparations to output the translation of the transcription into the target language, the fourth graphical representation indicating the translation transcription mode while also highlighting the second graphical representation identifying the target language to create a visual correspondence between the second graphical representation identifying the target language and the fourth graphical representation indicating the translation transcription mode indicating that the language translation application is outputting a translation of the utterance in the target language. | 1. A computer-implemented method comprising: displaying a graphical user interface for a language translation application on a user device, the graphical user interface comprising a first graphical representation identifying a source language, a second graphical representation identifying a target language, and a third graphical representation indicating the user device operating in a listening mode that is arranged adjacent to both the first graphical representation identifying the source language and the second graphical representation identifying the target language; animating, in response to a request to initiate listening for an utterance in the source language, the third graphical representation indicating the listening mode while the language translation application prepares to listen for the source language; highlighting, in response to the language translation application completing preparations to listen for the source language, the third graphical representation indicating the listening mode while also highlighting the first graphical representation identifying the source language to create a visual correspondence between the first graphical representation identifying the source language and the third graphical representation indicating the listening mode indicating that the language translation application is prepared to receive voice input in the source language; receiving an utterance spoken in the source language for translation into the target language while the third graphical representation indicating the listening mode and the first graphical representation identifying the source language are highlighted to create a visual correspondence between the first graphical representation identifying the source language and the third graphical representation indicating the listening mode; replacing, in response to the language translation application preparing an output of a translation of the utterance into the target language, the third graphical representation indicating the listening mode on the graphical user interface with a fourth graphical representation indicating a translation transcription mode on the graphical user interface; and highlighting, in response to the language translation application completing preparations to output the translation of the transcription into the target language, the fourth graphical representation indicating the translation transcription mode while also highlighting the second graphical representation identifying the target language to create a visual correspondence between the second graphical representation identifying the target language and the fourth graphical representation indicating the translation transcription mode indicating that the language translation application is outputting a translation of the utterance in the target language. 6. The method of claim 1 , wherein the third graphical representation indicating the listening mode comprises a microphone icon. | 0.559788 |
17. A real time computer implemented method for assisting a user to complete a programming language statement in a computer program, said real time method comprising: the computer enabling a programming language editor having a character position cursor; continuously resolving symbolic portions of available ones of a plurality of programming language statements into a partial program compilation; the computer identifying a present programming language statement and at least one segment of said present programming language statement based on a location of said character position cursor; the computer automatically determining a finite set of information related to said present programming language statement and said at least one segment of said present programming language statement based on said partial program compilation; and the computer automatically generating an assist window of said finite set of information in a location proximate to said character position cursor. | 17. A real time computer implemented method for assisting a user to complete a programming language statement in a computer program, said real time method comprising: the computer enabling a programming language editor having a character position cursor; continuously resolving symbolic portions of available ones of a plurality of programming language statements into a partial program compilation; the computer identifying a present programming language statement and at least one segment of said present programming language statement based on a location of said character position cursor; the computer automatically determining a finite set of information related to said present programming language statement and said at least one segment of said present programming language statement based on said partial program compilation; and the computer automatically generating an assist window of said finite set of information in a location proximate to said character position cursor. 18. The computer implemented method according to claim 17 wherein said step of identifying further comprises: the computer determining an identity of input to said programming language editor by said user; the computer enabling a reverse parse evaluation of said present programming language statement into identifiable tokens for each of said at least one segment therein in response to said input being an on-demand request by said user; the computer enabling execution of a editing task in response to said input being a programming language editor command; the computer enabling a first type of commit of an identified menu item from a selection menu assist window in response to said input being a commit key, wherein said step of enabling a first type of commit includes; the computer identifying said commit key as a non-delimiter type commit key; and the computer discarding said commit key; the computer enabling a second type of commit of an identified menu item from a selection menu assist window in response to said input being a commit key, wherein said second type of commit includes: identifying said commit key as a delimiter type commit key; and inserting said commit key after said identified menu item in said present programming language statement; and adding to said present programming language statement at a location of said character position cursor in response to said input being a non-commit key type input character. | 0.5 |
4. A method for automatically generating a knowledge base in a computer from a graphical representation of a logical tree having at least one non-disjunctive branch, comprising the steps of: a) verifying the organization of said logical tree; b) verifying the content of said logical tree; c) generating a plurality of global attributes; d) creating a plurality of classes; and e) creating a plurality of rules as defined by said tree using said plurality of global attributes and said plurality of classes, wherein said rules are executable by an inference engine in a backward chaining mode; wherein said step of verifying the content of said tree comprises the steps of: b1) verifying that a valid formula is associated with each said leg; b2) verifying that a valid test is associated with each said test node; b3) verifying that a valid solution is associated with each solution node; and b4) verifying that each link node in said logical tree is linked to either a procedure or to a domain. | 4. A method for automatically generating a knowledge base in a computer from a graphical representation of a logical tree having at least one non-disjunctive branch, comprising the steps of: a) verifying the organization of said logical tree; b) verifying the content of said logical tree; c) generating a plurality of global attributes; d) creating a plurality of classes; and e) creating a plurality of rules as defined by said tree using said plurality of global attributes and said plurality of classes, wherein said rules are executable by an inference engine in a backward chaining mode; wherein said step of verifying the content of said tree comprises the steps of: b1) verifying that a valid formula is associated with each said leg; b2) verifying that a valid test is associated with each said test node; b3) verifying that a valid solution is associated with each solution node; and b4) verifying that each link node in said logical tree is linked to either a procedure or to a domain. 13. The method of claim 4 wherein said step of creating a plurality of rules comprises the steps of: e1) starting with a first node of an ordered node list, identifying a left-most path leg leading into said first node; e2) identifying the node from which the left-most path leg identified in step e1 originates; e3) if the first node is a solution node, formatting a rule consequent by adding this node to a global solution attribute list; e4) if the first node is a domain link node, formatting the rule consequent by adding this node to the global solution attribute list; e5) if the first node is a procedure link node, formatting the rule consequent by asserting a global truth attribute associated with the root node of the linked procedure to true; e6) if the first node is a test node, formatting the rule consequent by asserting the global truth attribute associated with this node to true; e7) formatting a Boolean expression in the knowledge base language based on a formula found at the current path leg, wherein this expression is made a part of a rule antecedent; e8) determining if the node from which this path originates is the root node and, if not, formatting a Boolean expression to test the global truth attribute associated with the originating node, wherein this expression is made a part of the rule antecedent, and concatenating the node and path Boolean expressions with a logical AND; e9) repeating steps e1 through e8 for each path leading into the first node and, each time a path is processed, concatenating the resulting expression to the rule antecedent with a logical OR; and e10) generating a knowledge base language rule using the formatted rule antecedent and the rule consequent. | 0.625619 |
1. A method, performed on a computing device, for providing a seamless conversation service between interacting environments, comprising: using the computing device to perform actions including: facilitating commencement of a conversation between two or more parties over a communication path in a first interacting environment; monitoring a user context associated with the conversation between the two or more parties, wherein the monitoring of user context between the two or more parties comprises extracting user context data describing attributes that are relevant to behavioral needs of the two or more parties; and enabling the two or more parties to seamlessly continue the conversation in a second interacting environment while maintaining a transparency of functionality of the communication path, wherein the enabling of the two or more parties to seamlessly continue the conversation comprises using a plurality of predetermined communication rules and the user context being monitored to decide whether to enable the conversation to continue, wherein the plurality of predetermined communication rules comprise customer specified communication rules and provider specified communication rules. | 1. A method, performed on a computing device, for providing a seamless conversation service between interacting environments, comprising: using the computing device to perform actions including: facilitating commencement of a conversation between two or more parties over a communication path in a first interacting environment; monitoring a user context associated with the conversation between the two or more parties, wherein the monitoring of user context between the two or more parties comprises extracting user context data describing attributes that are relevant to behavioral needs of the two or more parties; and enabling the two or more parties to seamlessly continue the conversation in a second interacting environment while maintaining a transparency of functionality of the communication path, wherein the enabling of the two or more parties to seamlessly continue the conversation comprises using a plurality of predetermined communication rules and the user context being monitored to decide whether to enable the conversation to continue, wherein the plurality of predetermined communication rules comprise customer specified communication rules and provider specified communication rules. 2. The method according to claim 1 , wherein the first and second interacting environments comprise an environment selected from the group consisting of a virtual universe, social network and real world. | 0.665707 |
6. A system of editing language communication sheets comprising a processor, a memory, a screen, a storage device and an input device, wherein: the storage device comprises: an expression database, the expression database comprising a plurality of expressions, wherein the expressions comprising expressions in the first language and expressions in the second language, and two expressions individually from the first language and the second language having substantially identical meanings are correlated, the expression database comprises a plurality of correlation indices, each correlation index correlating an expression having a substantially identical meaning in the first language and the second language with identical meaning have a same correlation index so that two vocalizations individually in the first language and the second language with substantially identical meanings are correlated; a picture database, the picture database comprising a plurality of pictures, wherein at least one of the pictures is correlated with one expression of the expression database, each picture comprises a picture file name, and each picture file name corresponds to a correlation index to provide a correlation between the picture and an expression; and a vocalization database, the vocalization database comprising a plurality of vocalizations corresponding to the plurality of expressions, wherein the vocalizations comprise vocalizations in the first language and vocalizations in the second language, and two vocalizations individually from the first language and the second language having substantially identical meanings are correlated, wherein at least one of the vocalizations is correlated with one expression of the expression database, each vocalization comprises a vocalization file name, each vocalization file name corresponding to a correlation index so that a correlation is provided between the vocalization and an expression; the memory comprises a software program executable by the processor to achieve the following functions: providing a picture/text editing interface, wherein the picture/text editing interface has a picture/text editing area and a function key area; providing a dividing function for a communication sheet to divide the picture/text editing area into a plurality of language communication units; providing a correlation searching function, wherein the correlation searching function performs at least one of the following functions: finding a corresponding picture for an expression according to the correlations between the expressions and the pictures; and finding a corresponding vocalization for an expression according to the correlations between the expressions and the vocalization; providing an expression insertion function inserting an expression into any one of the language communication units; providing a picture insertion function capable of inserting a picture into any one of the language communication units; and providing a language assigning function, wherein the language assigning function assigns expressions in all language communication units as expressions in the first language or as expressions in the second language in one operation. | 6. A system of editing language communication sheets comprising a processor, a memory, a screen, a storage device and an input device, wherein: the storage device comprises: an expression database, the expression database comprising a plurality of expressions, wherein the expressions comprising expressions in the first language and expressions in the second language, and two expressions individually from the first language and the second language having substantially identical meanings are correlated, the expression database comprises a plurality of correlation indices, each correlation index correlating an expression having a substantially identical meaning in the first language and the second language with identical meaning have a same correlation index so that two vocalizations individually in the first language and the second language with substantially identical meanings are correlated; a picture database, the picture database comprising a plurality of pictures, wherein at least one of the pictures is correlated with one expression of the expression database, each picture comprises a picture file name, and each picture file name corresponds to a correlation index to provide a correlation between the picture and an expression; and a vocalization database, the vocalization database comprising a plurality of vocalizations corresponding to the plurality of expressions, wherein the vocalizations comprise vocalizations in the first language and vocalizations in the second language, and two vocalizations individually from the first language and the second language having substantially identical meanings are correlated, wherein at least one of the vocalizations is correlated with one expression of the expression database, each vocalization comprises a vocalization file name, each vocalization file name corresponding to a correlation index so that a correlation is provided between the vocalization and an expression; the memory comprises a software program executable by the processor to achieve the following functions: providing a picture/text editing interface, wherein the picture/text editing interface has a picture/text editing area and a function key area; providing a dividing function for a communication sheet to divide the picture/text editing area into a plurality of language communication units; providing a correlation searching function, wherein the correlation searching function performs at least one of the following functions: finding a corresponding picture for an expression according to the correlations between the expressions and the pictures; and finding a corresponding vocalization for an expression according to the correlations between the expressions and the vocalization; providing an expression insertion function inserting an expression into any one of the language communication units; providing a picture insertion function capable of inserting a picture into any one of the language communication units; and providing a language assigning function, wherein the language assigning function assigns expressions in all language communication units as expressions in the first language or as expressions in the second language in one operation. 10. The system as claimed in claim 6 , wherein the pictures include pictures of a first type and pictures of a second type, and the software program further provides a picture format type assigning means for assigning all pictures in all language communication units as pictures of the first type or pictures of the second type in one operation. | 0.599551 |
12. A computer-implemented NLP-based content recommendation widget, comprising: a memory; and a content recommender module that is configured to, when executed, receive a text segment for processing; identify one or more candidate named entities to which a received text segment refers based, at least in part, upon a natural language processing (NLP) parsing and linguistic analysis of the text segment; and derive and present related content based at least in part upon a natural language processing parsing and linguistic analysis of entity based information and context related information, wherein the related content includes a representation of connections and wherein the connections are presented graphically and illustrate relationships between entities based upon actions. | 12. A computer-implemented NLP-based content recommendation widget, comprising: a memory; and a content recommender module that is configured to, when executed, receive a text segment for processing; identify one or more candidate named entities to which a received text segment refers based, at least in part, upon a natural language processing (NLP) parsing and linguistic analysis of the text segment; and derive and present related content based at least in part upon a natural language processing parsing and linguistic analysis of entity based information and context related information, wherein the related content includes a representation of connections and wherein the connections are presented graphically and illustrate relationships between entities based upon actions. 13. The system of claim 12 , wherein the module is further configured, when executed, to display one or more indicators for navigating to the related content. | 0.67678 |
49. A terminal device, comprising: a screen on which onscreen representation is formed; a network interface interfacing with a network; and a processor configured to perform functions including: (a) starting obtaining operation for obtaining, over a network, a page made by a markup language and definition information, which is information to be applied to the entire page so as to render the page as designated by a markup language document of the page, the obtaining performed through the network in response to a user request for the page; (b) displaying text of the page in a first browsing mode which makes less rich presentation on the screen than a second browsing mode in which definition information is applied; (c) judging whether or not acquisition of the entirety of the definition information is obtained from over the network; and(d) switching onscreen representation, depending on a result of the judging, by replacing the onscreen representation in the first browsing mode with an onscreen representation in the second browsing mode. | 49. A terminal device, comprising: a screen on which onscreen representation is formed; a network interface interfacing with a network; and a processor configured to perform functions including: (a) starting obtaining operation for obtaining, over a network, a page made by a markup language and definition information, which is information to be applied to the entire page so as to render the page as designated by a markup language document of the page, the obtaining performed through the network in response to a user request for the page; (b) displaying text of the page in a first browsing mode which makes less rich presentation on the screen than a second browsing mode in which definition information is applied; (c) judging whether or not acquisition of the entirety of the definition information is obtained from over the network; and(d) switching onscreen representation, depending on a result of the judging, by replacing the onscreen representation in the first browsing mode with an onscreen representation in the second browsing mode. 50. The terminal device according to claim 49 , wherein the definition information includes an external style sheet and an external script. | 0.650502 |
1. A computer-implemented method comprising: receiving a query that includes a first geographic entity name; identifying a candidate substitute term for the first geographic entity name, wherein the candidate substitute term is a second geographic entity name; determining that the geographic entity name and the second geographic entity name have a particular relationship in a geographic data set that includes a plurality of names of geographic entities and respective relationships between pairs of geographic entities; obtaining search results that satisfy the query; and demoting a score of an obtained search result that corresponds to a document that includes the second geographic entity name based at least in part on the determined particular relationship between the first geographic entity and the second geographic entity. | 1. A computer-implemented method comprising: receiving a query that includes a first geographic entity name; identifying a candidate substitute term for the first geographic entity name, wherein the candidate substitute term is a second geographic entity name; determining that the geographic entity name and the second geographic entity name have a particular relationship in a geographic data set that includes a plurality of names of geographic entities and respective relationships between pairs of geographic entities; obtaining search results that satisfy the query; and demoting a score of an obtained search result that corresponds to a document that includes the second geographic entity name based at least in part on the determined particular relationship between the first geographic entity and the second geographic entity. 3. The method of claim 1 , wherein demoting a score of an obtained search result that corresponds to a document that includes the second geographic entity name comprises: determining that the document includes the second geographic entity name; and omitting occurrences of the second geographic entity name in the document when computing the score for the corresponding search result. | 0.581772 |
10. A method of monitoring software development and project flow in the insurance industry using user stories, the method comprising: receiving, via a communication interface, via one or more networks, information included in communications among a product owner, at least one developer, and a project manager; identifying, by a processor, from the monitored communication a plurality of user stories for completion during the development; assigning, by a processor, each of the plurality of user stories a priority and a value determined by the effort required to complete the respective user story and storing the user story and associated priority and value in the memory as a product backlog; at the processor, accessing the memory to read the product backlog and associated priorities and values and selecting at least one user story and associated priority and value from the product backlog for building based on the associated priority and value; calibrating, at the processor, a difference in the value of each of the plurality of user stories by comparing a centralized position of each of the plurality of user stories and an associated Fibonacci position, and iteratively adjusting the Fibonacci position of each of the plurality of user stories based on the difference between the centralized position and the value as compared to a median value until the difference is below a threshold; upon completion of any of the user stories included in the backlog, updating, by the processor, the product backlog in the memory; and at the processor, iterating the selecting and updating based on the monitored communication that evidences that user stories are being completed and that additional story points are selected for inclusion in the backlog; and displaying, on a display device, the backlog as selected by the processor from the product backlog and the status of the software development and project flow based on user stories remaining in the product backlog as compared to the user stories completed from the product backlog. | 10. A method of monitoring software development and project flow in the insurance industry using user stories, the method comprising: receiving, via a communication interface, via one or more networks, information included in communications among a product owner, at least one developer, and a project manager; identifying, by a processor, from the monitored communication a plurality of user stories for completion during the development; assigning, by a processor, each of the plurality of user stories a priority and a value determined by the effort required to complete the respective user story and storing the user story and associated priority and value in the memory as a product backlog; at the processor, accessing the memory to read the product backlog and associated priorities and values and selecting at least one user story and associated priority and value from the product backlog for building based on the associated priority and value; calibrating, at the processor, a difference in the value of each of the plurality of user stories by comparing a centralized position of each of the plurality of user stories and an associated Fibonacci position, and iteratively adjusting the Fibonacci position of each of the plurality of user stories based on the difference between the centralized position and the value as compared to a median value until the difference is below a threshold; upon completion of any of the user stories included in the backlog, updating, by the processor, the product backlog in the memory; and at the processor, iterating the selecting and updating based on the monitored communication that evidences that user stories are being completed and that additional story points are selected for inclusion in the backlog; and displaying, on a display device, the backlog as selected by the processor from the product backlog and the status of the software development and project flow based on user stories remaining in the product backlog as compared to the user stories completed from the product backlog. 12. The method of claim 10 wherein the communication among a product owner, at least one developer, and a project manager occurs at at least a planning meeting. | 0.631229 |
11. A system of tagging utterances with Named Entity Recognition (“NER”) labels using unmanaged crowds, the comprising: an end user device having one or more physical processors programmed with computer program instructions that, when executed by the one or more physical processors, cause the end user device to: obtain a plurality of utterances relating to a domain, the domain being associated with a plurality of entities, each entity relating to a category of information in the domain; generate a first annotation job configured to request that at least a first portion of the utterance be assigned to one of a first set of entities, from among the plurality of entities, wherein a number of the first set of entities does not exceed a maximum number such that cognitive load imposed on a user to whom the first annotation job is provided is controlled; generate a second annotation job configured to request that at least a second portion of the utterance be assigned to one of a second set of entities, from among the plurality of entities, wherein: a number of the second set of entities does not exceed the maximum number such that cognitive load imposed on a user to whom the second annotation job is provided is controlled, the first portion and the second portion are the same or different and the first set of entities is different than the second set of entities, and the user to whom the first annotation job is provided is the same or different from the user to whom the second annotation job is provided; cause the first annotation job and the second annotation job to be deployed to the unmanaged crowd; and receive a plurality of annotations provided by the unmanaged crowd, the plurality of annotations comprising a first annotation relating to the first annotation job and a second annotation relating to the second annotation job. | 11. A system of tagging utterances with Named Entity Recognition (“NER”) labels using unmanaged crowds, the comprising: an end user device having one or more physical processors programmed with computer program instructions that, when executed by the one or more physical processors, cause the end user device to: obtain a plurality of utterances relating to a domain, the domain being associated with a plurality of entities, each entity relating to a category of information in the domain; generate a first annotation job configured to request that at least a first portion of the utterance be assigned to one of a first set of entities, from among the plurality of entities, wherein a number of the first set of entities does not exceed a maximum number such that cognitive load imposed on a user to whom the first annotation job is provided is controlled; generate a second annotation job configured to request that at least a second portion of the utterance be assigned to one of a second set of entities, from among the plurality of entities, wherein: a number of the second set of entities does not exceed the maximum number such that cognitive load imposed on a user to whom the second annotation job is provided is controlled, the first portion and the second portion are the same or different and the first set of entities is different than the second set of entities, and the user to whom the first annotation job is provided is the same or different from the user to whom the second annotation job is provided; cause the first annotation job and the second annotation job to be deployed to the unmanaged crowd; and receive a plurality of annotations provided by the unmanaged crowd, the plurality of annotations comprising a first annotation relating to the first annotation job and a second annotation relating to the second annotation job. 12. The system of claim 11 , wherein the computer system is further programmed to: determine whether to retain at least some of the plurality of annotations from consideration to build a NER model. | 0.620704 |
1. A mobile communication terminal capable of text-to-speech synthesis, the terminal comprising: a display unit for displaying at least one object on a screen; a controller for identifying a characteristic of an activated object on the screen and finding a speech data mapped to the identified characteristic; a speech synthesizer for converting textual contents of the activated object into audio data using the speech data; and an audio processor for outputting the audio data in speech sounds. | 1. A mobile communication terminal capable of text-to-speech synthesis, the terminal comprising: a display unit for displaying at least one object on a screen; a controller for identifying a characteristic of an activated object on the screen and finding a speech data mapped to the identified characteristic; a speech synthesizer for converting textual contents of the activated object into audio data using the speech data; and an audio processor for outputting the audio data in speech sounds. 2. The mobile communication terminal of claim 1 , further comprising an input unit for receiving a command of object addition or removal from a user, wherein the controller activates, in response to a command of object addition or removal received by the input unit, a newly selected object, identifies a characteristic of the newly activated object, and finds a speech data mapped to the identified characteristic of the newly activated object. | 0.538556 |
1. A computerized method for calculating a normalized activity score value to rank an identified document, the method comprising: identifying a stored document; determining a number of times the identified document was cited in a subject matter community of the identified document; determining a probability distribution that individual documents within the subject matter community are cited a variable number of times by other individual documents in the subject matter community; calculating a probability function by performing a regression on the probability distribution; calculating the activity score value according to an activity score function formulated as an inverse of the probability function such that the activity score function is defined by: Score ( x ) = k ( a · x α + 1 ) p , wherein: Score(x) is the activity score value, k and p are constants, x is the number of documents citing the identified document, and a and α are learned from the regression on the probability distribution; and the activity score function is such that the activity score value is calculated according to a probability that the individual document in the subject matter community is cited a number of times greater than or equal to the number of times the identified document was cited in the subject matter community; weighting the activity score value by an age of the identified document; and storing in computer memory a ranking of the identified document based on the activity score value. | 1. A computerized method for calculating a normalized activity score value to rank an identified document, the method comprising: identifying a stored document; determining a number of times the identified document was cited in a subject matter community of the identified document; determining a probability distribution that individual documents within the subject matter community are cited a variable number of times by other individual documents in the subject matter community; calculating a probability function by performing a regression on the probability distribution; calculating the activity score value according to an activity score function formulated as an inverse of the probability function such that the activity score function is defined by: Score ( x ) = k ( a · x α + 1 ) p , wherein: Score(x) is the activity score value, k and p are constants, x is the number of documents citing the identified document, and a and α are learned from the regression on the probability distribution; and the activity score function is such that the activity score value is calculated according to a probability that the individual document in the subject matter community is cited a number of times greater than or equal to the number of times the identified document was cited in the subject matter community; weighting the activity score value by an age of the identified document; and storing in computer memory a ranking of the identified document based on the activity score value. 2. The method of claim 1 , wherein the subject matter community comprises a jurisdiction of a legal community. | 0.688068 |
32. The computer-readable medium of claim 31 , wherein the method further comprises performing upon selection of the matching input mode: analyzing the speech application grammar associated with the interaction node; generating a plurality of utterances based on the speech application grammar corresponding to the interaction node, the plurality of utterances associated with respective weighted values; and choosing the utterance to be provided as the response to the speech application based on the respective weighted values associated with the plurality of utterances. | 32. The computer-readable medium of claim 31 , wherein the method further comprises performing upon selection of the matching input mode: analyzing the speech application grammar associated with the interaction node; generating a plurality of utterances based on the speech application grammar corresponding to the interaction node, the plurality of utterances associated with respective weighted values; and choosing the utterance to be provided as the response to the speech application based on the respective weighted values associated with the plurality of utterances. 33. The computer-readable medium of claim 32 , wherein the method further comprises: converting the chosen utterance into an equivalent speech form of input prior to provisioning of the utterance as the response. | 0.889661 |
1. A computer-implemented method of automated standardization of distinct non-standard names in a transactions processing database to associate said distinct non-standard names with standard names of particular entities, comprising: identifying features of a distinct name that are non-standard features of a standard name of an entity stored in said database, the non-standard features creating ambiguity between the distinct name and the standard name, and creating a characteristic feature set for said distinct name containing said identified non-standard features; processing said distinct name using a regular expression rule selected based upon the characteristic feature set of said distinct name to cleanse said distinct name by removing the non-standard features of the characteristic feature set from the distinct name to convert the distinct name to a standard name format; comparing the standard name format to standard names of entities in the database to determine possible matches; and identifying based upon said comparing the distinct name as corresponding to the standard name of the entity. | 1. A computer-implemented method of automated standardization of distinct non-standard names in a transactions processing database to associate said distinct non-standard names with standard names of particular entities, comprising: identifying features of a distinct name that are non-standard features of a standard name of an entity stored in said database, the non-standard features creating ambiguity between the distinct name and the standard name, and creating a characteristic feature set for said distinct name containing said identified non-standard features; processing said distinct name using a regular expression rule selected based upon the characteristic feature set of said distinct name to cleanse said distinct name by removing the non-standard features of the characteristic feature set from the distinct name to convert the distinct name to a standard name format; comparing the standard name format to standard names of entities in the database to determine possible matches; and identifying based upon said comparing the distinct name as corresponding to the standard name of the entity. 5. The method of claim 1 further comprising forming a plurality of regular expression rules, each rule being formed to correspond to a different predetermined set of non-standard features, and said processing comprising processing said distinct name using a selected regular expression rule tailored to the non-standard feature set of said distinct name. | 0.509623 |
2. The method of claim 1 , wherein a characteristic of the candidate user comprises one or more characteristics common to the user and the candidate user. | 2. The method of claim 1 , wherein a characteristic of the candidate user comprises one or more characteristics common to the user and the candidate user. 5. The method of claim 2 , wherein the user score for the candidate user is proportional to a percentage of characteristics common to the user and the candidate user. | 0.95165 |
3. The medium of claim 1 , wherein the transmitting the advertisement is in response to a search submitted by the user. | 3. The medium of claim 1 , wherein the transmitting the advertisement is in response to a search submitted by the user. 5. The medium of claim 3 , wherein the search submitted by the user indicates a subject matter. | 0.982249 |
5. The method of claim 4 , wherein the step of calculating said similarity measure comprises: creating an (N+P−1)×(N+P−1) alignment matrix (D ms ) by setting the character index i of the k-th hypothesis string (a ms :=(Interval 1 , . . . , Interval N-1 , Phoneme 1 , . . . , Phoneme P ) T ) as coordinate for the columns and the character index j of the reference string (b ms :=(Interval 1 , . . . , Interval N-1 , Phoneme 1 , . . . , Phoneme P ) T ) as coordinate for the rows of said matrix and filling the alignment matrix (D ms ) by calculating and setting each (i,j)-element of said matrix according to a filling scheme for filling accumulated cost factors (d i,j =f(d i-1,j , d i,j-1 , d i-1,j-1 , w(a i , b j ))) into the cells of said alignment matrix (D ms ), executing an alignment function based on the Viterbi search algorithm to compare the combined reference string (REF ms ) with the combined hypothesis strings (HYPO ms0 , HYPO ms1 , HYPO ms2 , . . . , HYPO ms,k , . . . , HYPO ms,M+Q−1 ) of all stored melodies and lyrics, thereby returning at least one of a string of characters and a sequence of cost factors (w(a i , b j )) indicating which characters of the combined reference string (REF ms ) closely match with the characters of the k-th combined hypothesis string (HYPO ms,k ), and executing a backtracking algorithm which starts with the lowest cost factor in the last column of the alignment matrix (D ms ) and goes back through the alignment matrix towards the first row and the first column of said matrix along a tracking path derived by the alignment function. | 5. The method of claim 4 , wherein the step of calculating said similarity measure comprises: creating an (N+P−1)×(N+P−1) alignment matrix (D ms ) by setting the character index i of the k-th hypothesis string (a ms :=(Interval 1 , . . . , Interval N-1 , Phoneme 1 , . . . , Phoneme P ) T ) as coordinate for the columns and the character index j of the reference string (b ms :=(Interval 1 , . . . , Interval N-1 , Phoneme 1 , . . . , Phoneme P ) T ) as coordinate for the rows of said matrix and filling the alignment matrix (D ms ) by calculating and setting each (i,j)-element of said matrix according to a filling scheme for filling accumulated cost factors (d i,j =f(d i-1,j , d i,j-1 , d i-1,j-1 , w(a i , b j ))) into the cells of said alignment matrix (D ms ), executing an alignment function based on the Viterbi search algorithm to compare the combined reference string (REF ms ) with the combined hypothesis strings (HYPO ms0 , HYPO ms1 , HYPO ms2 , . . . , HYPO ms,k , . . . , HYPO ms,M+Q−1 ) of all stored melodies and lyrics, thereby returning at least one of a string of characters and a sequence of cost factors (w(a i , b j )) indicating which characters of the combined reference string (REF ms ) closely match with the characters of the k-th combined hypothesis string (HYPO ms,k ), and executing a backtracking algorithm which starts with the lowest cost factor in the last column of the alignment matrix (D ms ) and goes back through the alignment matrix towards the first row and the first column of said matrix along a tracking path derived by the alignment function. 6. The method of claim 5 , wherein the elements (d i,j ) of said alignment matrix (D ms ) are characterized according to the following filling scheme: d ij := min { d i - 1 , j + w ( a i , 0 ) ∀ i , j ∈ { 1 , 2 , … , N + P - 1 } d i - 1 , j - 1 + w ( a i , b j ) ∀ i , j ∈ { 1 , 2 , … , N + P - 1 } d i , j - 1 + w ( 0 , b j ) ∀ i , j ∈ { 1 , 2 , … , N + P - 1 } wherein the initial conditions are
d 0,0 :=0,
d i,0 :=d i-1,0 +w ( a i , 0) ∀ i ε { 1, 2, 3, . . . , N+P− 1}, and
d 0,j :=d 0,j-1 +w (0, b j ) ∀ j ε { 1, 2, 3, . . . , N+P− 1}, and wherein w(a i , 0 ) is a cost factor associated with the deletion of the character a i of the k-th hypothesis string (HYPO ms,k ), w( 0 , b j ) is a cost factor associated with the insertion of the character b j into the combined reference string (REF ms ), and w(a i , b j ) is a cost factor associated with the replacement of the element a, of the k-th combined hypothesis string (HYPO ms,k ) by the element b j of the combined reference string (REF ms ), wherein w(a i , b j ) is set to zero if a i =b j and set to a value greater than zero if a i ≠b j . | 0.631949 |
1. A method comprising: receiving, by at least one data processor, a plurality of data files from a plurality of data sources that comprise textual content; categorizing, by the at least one data processor, the plurality of data files into a taxonomy of categories in which each category has associated sample textual content defining a concept for the category and each category is a run-length encoded collection of at least one identification corresponding to at least one of the plurality of data files, the categorizing comprising, for each category: comparing, by the at least one data processor, for each of the plurality of data files, the textual content of the data file with the sample textual content for the category; calculating, by the at least one data processor, based on the comparing and for each of the plurality of data files, a file score corresponding to the degree of similarity between the defined concept of the category and a determined concept for the data file; and generating, by the at least one data processor, the identification stored in the run-length encoded collection by at least associating, for each of the plurality of data files, the data file with the category if the file score is equal to or greater than a pre-determined minimum score for the category; and providing, by the at least one data processor, at least a portion of the data file and/or the associated file score. | 1. A method comprising: receiving, by at least one data processor, a plurality of data files from a plurality of data sources that comprise textual content; categorizing, by the at least one data processor, the plurality of data files into a taxonomy of categories in which each category has associated sample textual content defining a concept for the category and each category is a run-length encoded collection of at least one identification corresponding to at least one of the plurality of data files, the categorizing comprising, for each category: comparing, by the at least one data processor, for each of the plurality of data files, the textual content of the data file with the sample textual content for the category; calculating, by the at least one data processor, based on the comparing and for each of the plurality of data files, a file score corresponding to the degree of similarity between the defined concept of the category and a determined concept for the data file; and generating, by the at least one data processor, the identification stored in the run-length encoded collection by at least associating, for each of the plurality of data files, the data file with the category if the file score is equal to or greater than a pre-determined minimum score for the category; and providing, by the at least one data processor, at least a portion of the data file and/or the associated file score. 8. The method of claim 1 , wherein providing at least a portion of the data file and/or the associated file score comprises at least one of: displaying, by the at least one data processor, at least a portion of the data file and/or the associated file score, loading, by the at least one data processor, at least a portion of the data file and/or the associated file score into memory, transmitting, by the at least one data processor, data including at least a portion of the data file and/or the associated file score to a remote computing device, or storing, by the at least one data processor, at least a portion of the data file and/or the associated file score into persistent memory. | 0.5 |
46. An apparatus comprising: means for parsing patent data to generate a set of nodes; means for selecting at least one node of the set of nodes; means for determining initial links from meta data associated with the patent data for the at least one node; means for creating links among the set of nodes based on the metadata; means for identifying a set of seed nodes; means for determining a community structure for the set of seed nodes, the community structure including a plurality of communities; and means for assigning concepts to the plurality of communities, wherein the means for determining the community structure comprises: means for initiating a percolation message from a source node of a linked network, the linked network comprising a plurality of nodes and a plurality of edges, each edge connecting at least two of the plurality of nodes, wherein a node is a neighbor if the node is connected to another node in the plurality of nodes by an edge, wherein the percolation message comprises a percolation probability and an identifier of the source node, and wherein initiating a percolation message from the source node comprises transmitting the percolation message to each neighbor of the source node with the percolation probability; means for propagating the percolation message through the linked network, wherein propagating the percolation message through the linked network comprises: means for transmitting the percolation message from each node that receives the percolation message to each neighbor of each node that receives the percolation message; and means for transmitting a response to the source node from each node that receives the percolation message; means for collecting each response to the percolation message at the source node; and means for storing a list of nodes that transmitted the response at the source node. | 46. An apparatus comprising: means for parsing patent data to generate a set of nodes; means for selecting at least one node of the set of nodes; means for determining initial links from meta data associated with the patent data for the at least one node; means for creating links among the set of nodes based on the metadata; means for identifying a set of seed nodes; means for determining a community structure for the set of seed nodes, the community structure including a plurality of communities; and means for assigning concepts to the plurality of communities, wherein the means for determining the community structure comprises: means for initiating a percolation message from a source node of a linked network, the linked network comprising a plurality of nodes and a plurality of edges, each edge connecting at least two of the plurality of nodes, wherein a node is a neighbor if the node is connected to another node in the plurality of nodes by an edge, wherein the percolation message comprises a percolation probability and an identifier of the source node, and wherein initiating a percolation message from the source node comprises transmitting the percolation message to each neighbor of the source node with the percolation probability; means for propagating the percolation message through the linked network, wherein propagating the percolation message through the linked network comprises: means for transmitting the percolation message from each node that receives the percolation message to each neighbor of each node that receives the percolation message; and means for transmitting a response to the source node from each node that receives the percolation message; means for collecting each response to the percolation message at the source node; and means for storing a list of nodes that transmitted the response at the source node. 49. The apparatus of claim 46 , further comprising at least one of: means for finding a patent landscape from the community structure; means for identifying the patent landscape based on different node types and identifying gaps in the patent landscape; means for monitoring the patent landscape over time; and means for monitoring the patent landscape for competitors. | 0.5 |
13. A computer program embodied on a non-transitory computer readable storage medium for performing a method for generating a single tutorial application linked to one or more source code files when the program is executed on a computer device, the method comprising: receiving user input indicating one or more source code elements to be selected and one or more data elements to be tagged to one or more selected source code elements; tagging one or more selected source code elements with one or more of the data elements; generating the single tutorial application linked to one or more source code files from the tagged source code elements; displaying the generated single tutorial application, the tagged source code elements, and the data elements in a display interface, wherein the display interface simultaneously displays: a list of tutorial steps contained within the generated single tutorial application; a code window containing a source code element associated with a selected one of the tutorial steps of the list of tutorial steps; and an explanation window containing the one or more data elements associated with the source code element displayed in the code window, and selectively running the source code element displayed in the code window, wherein results of the running are displayed in a results window in the display interface simultaneously with the list of tutorial steps, the code window, and the explanation window; wherein each of the list of tutorial steps, the code window, the explanation window, and the results window are integrated as separate segments of the generated single tutorial application within a single window, and wherein the generated single tutorial application is self-contained. | 13. A computer program embodied on a non-transitory computer readable storage medium for performing a method for generating a single tutorial application linked to one or more source code files when the program is executed on a computer device, the method comprising: receiving user input indicating one or more source code elements to be selected and one or more data elements to be tagged to one or more selected source code elements; tagging one or more selected source code elements with one or more of the data elements; generating the single tutorial application linked to one or more source code files from the tagged source code elements; displaying the generated single tutorial application, the tagged source code elements, and the data elements in a display interface, wherein the display interface simultaneously displays: a list of tutorial steps contained within the generated single tutorial application; a code window containing a source code element associated with a selected one of the tutorial steps of the list of tutorial steps; and an explanation window containing the one or more data elements associated with the source code element displayed in the code window, and selectively running the source code element displayed in the code window, wherein results of the running are displayed in a results window in the display interface simultaneously with the list of tutorial steps, the code window, and the explanation window; wherein each of the list of tutorial steps, the code window, the explanation window, and the results window are integrated as separate segments of the generated single tutorial application within a single window, and wherein the generated single tutorial application is self-contained. 14. The computer program as claimed in claim 13 , wherein the selected source code elements are tagged by a markup language. | 0.661585 |
20. An automated method of classifying text to one or more target classes in a target classification system, the method comprising: identifying metadata relating to a portion of text; generating a vector based on the metadata relating to a portion of the text; and determining one or more scores based on the vector and metadata associated with one of the target classes. | 20. An automated method of classifying text to one or more target classes in a target classification system, the method comprising: identifying metadata relating to a portion of text; generating a vector based on the metadata relating to a portion of the text; and determining one or more scores based on the vector and metadata associated with one of the target classes. 25. The method of claim 20 , wherein the portion of text is related to a news story. | 0.861758 |
5. A computer system for operating a voice domain name network for use over a telephone network including: a voice domain computer having voice recognition capability to take a call from a first caller over telephone network and to recognize a name spoken in the call; a database connected to said computer, said database containing a plurality of voice domain names wherein each voice domain name in said database includes a corresponding Internet URL and telephone number associated with a registrant of the Internet URL, wherein the voice domain names in said database are entered into the database from voice information; a search engine configured to search for a specific voice domain name in the plurality of voice domain names and to search the Internet for an Internet URL in response to the call and to perform a telephone routine to connect the call to the telephone number associated with the registrant; means for offering to register the Internet URL by voice through the telephone network if said search engine fails to find the specific voice domain; means for generating a voice offer over the telephone network to register the Internet URL for the first caller if the Internet URL is found to be unregistered on the Internet and then registering the Internet URL as a domain name on the Internet and as the specific voice domain name in said database. | 5. A computer system for operating a voice domain name network for use over a telephone network including: a voice domain computer having voice recognition capability to take a call from a first caller over telephone network and to recognize a name spoken in the call; a database connected to said computer, said database containing a plurality of voice domain names wherein each voice domain name in said database includes a corresponding Internet URL and telephone number associated with a registrant of the Internet URL, wherein the voice domain names in said database are entered into the database from voice information; a search engine configured to search for a specific voice domain name in the plurality of voice domain names and to search the Internet for an Internet URL in response to the call and to perform a telephone routine to connect the call to the telephone number associated with the registrant; means for offering to register the Internet URL by voice through the telephone network if said search engine fails to find the specific voice domain; means for generating a voice offer over the telephone network to register the Internet URL for the first caller if the Internet URL is found to be unregistered on the Internet and then registering the Internet URL as a domain name on the Internet and as the specific voice domain name in said database. 12. The system of claim 5 , further comprising means for determining that the name spoken by the first caller is similar to but not the same as at least one voice domain name in said database and stating or spelling the at least one voice domain name to the first caller. | 0.509673 |
13. A method comprising: receiving, at a device, a first speech input from a user; generating a voice sample based on the first speech input; in response to authenticating that the user is an authorized user of the device, transmitting the voice sample to a voiceprint service for generating a text-independent voiceprint based on the voice sample, wherein the text-independent voiceprint is configured to be compared to subsequent speech inputs received at the device; and while the device is in a locked state: receiving a second speech input at the device, the second speech input including a command associated with a restricted feature of the device; authenticating, using the second speech input, whether the second speech input is spoken by an authorized user of the device, wherein the authenticating includes comparing the second speech input to the text-independent voiceprint; in response to authenticating that the second speech input is spoken by an authorized user of the device, executing the command identified in the speech input to invoke the restricted feature of the device; and in response to not authenticating that the speech input is spoken by an authorized user of the device, forgo executing the command identified in the speech input to invoke the restricted feature of the device, where the method is performed by one or more processors of the device. | 13. A method comprising: receiving, at a device, a first speech input from a user; generating a voice sample based on the first speech input; in response to authenticating that the user is an authorized user of the device, transmitting the voice sample to a voiceprint service for generating a text-independent voiceprint based on the voice sample, wherein the text-independent voiceprint is configured to be compared to subsequent speech inputs received at the device; and while the device is in a locked state: receiving a second speech input at the device, the second speech input including a command associated with a restricted feature of the device; authenticating, using the second speech input, whether the second speech input is spoken by an authorized user of the device, wherein the authenticating includes comparing the second speech input to the text-independent voiceprint; in response to authenticating that the second speech input is spoken by an authorized user of the device, executing the command identified in the speech input to invoke the restricted feature of the device; and in response to not authenticating that the speech input is spoken by an authorized user of the device, forgo executing the command identified in the speech input to invoke the restricted feature of the device, where the method is performed by one or more processors of the device. 16. The method of claim 13 , further comprising: in response to failing to authenticate that the second speech input is spoken by an authorized user of the device, outputting an error indication. | 0.560536 |
2. A navigation apparatus for use in a vehicle for searching for a destination that is defined as a crossing of two streets based on two different streets, the navigation apparatus comprising: a map data storage configured to store map data including data for enabling a destination search; an input unit configured to provide an inputted text string, which is inputted by a user, the inputted text string being either a body name or a formal name; a display unit; and a control unit configured to perform a search of the destination based on the inputted text string from the input unit, wherein the control unit includes a search unit configured to search a list of formal street names of a plurality of streets recorded as destination search data of the map data for a street that includes the inputted text string from the input unit, which can be either a body name or a formal name, in a formal street name text string contained in the list of formal street names, the formal street name text string includes a body name text string for representing a proper noun of a street name and at least one of a prefix, a suffix or a street type, the search unit generates a list of body names corresponding to matched formal street names; a display control unit that controls the display unit to display a list of searched streets; and the search unit is configured to provide the list of body names to the display control unit, the display control unit is configured to control the display unit such that the display unit displays the list of body names to the user, wherein the user selects a selected body name from the list of body names via the input unit, the control unit is configured to perform a search for an intersection of a first street and a second street by using (1) the selected body name associated with the first street, (2) an inputted text string associated with the first street, (3) a selected body name associated with the second street, and (4) an inputted text string associated with the second street, such that the inputted text string associated with the first street and inputted text string associated with the second street are each used twice, once by the search unit to generate the list of body names for each of the first street and the second street, and again by the control unit to search for the intersection, and the control unit displays the intersection of the first street and the second street. | 2. A navigation apparatus for use in a vehicle for searching for a destination that is defined as a crossing of two streets based on two different streets, the navigation apparatus comprising: a map data storage configured to store map data including data for enabling a destination search; an input unit configured to provide an inputted text string, which is inputted by a user, the inputted text string being either a body name or a formal name; a display unit; and a control unit configured to perform a search of the destination based on the inputted text string from the input unit, wherein the control unit includes a search unit configured to search a list of formal street names of a plurality of streets recorded as destination search data of the map data for a street that includes the inputted text string from the input unit, which can be either a body name or a formal name, in a formal street name text string contained in the list of formal street names, the formal street name text string includes a body name text string for representing a proper noun of a street name and at least one of a prefix, a suffix or a street type, the search unit generates a list of body names corresponding to matched formal street names; a display control unit that controls the display unit to display a list of searched streets; and the search unit is configured to provide the list of body names to the display control unit, the display control unit is configured to control the display unit such that the display unit displays the list of body names to the user, wherein the user selects a selected body name from the list of body names via the input unit, the control unit is configured to perform a search for an intersection of a first street and a second street by using (1) the selected body name associated with the first street, (2) an inputted text string associated with the first street, (3) a selected body name associated with the second street, and (4) an inputted text string associated with the second street, such that the inputted text string associated with the first street and inputted text string associated with the second street are each used twice, once by the search unit to generate the list of body names for each of the first street and the second street, and again by the control unit to search for the intersection, and the control unit displays the intersection of the first street and the second street. 19. The navigation apparatus of claim 2 , wherein the inputted text string is the formal street name. | 0.559429 |
1. A method comprising: receiving a first request, wherein the first request is a request to provide a requested service, the requested service is one of a plurality of services, the first request conforms to a request format defined in a first language, the first request is received by a module configured to receive the first request from a plurality of source types, and the plurality of source types comprises an applet executing on a first remote network node, and a control module executing on a second remote network node; parsing the first request by providing the first request to a language parser, wherein the language parser is configured to parse the first language; obtaining results of parsing the first request from the language parser; in response to the obtaining the results, selecting a first device, wherein the selecting comprises determining whether the first device is coupled to the language parser, and in response to a determination that the first device is not coupled to the language parser, adding the first device to a plurality of devices coupled to the language parser; and coupling the first device to the language parser, wherein the first device is configured to provide the requested service, each of the plurality of devices is configured to provide a corresponding service of the plurality of services, and at least two devices among the plurality of devices are configured to provide the requested service; and converting the first request to a second request, wherein the second request conforms to a request format defined in a second language, the first device is configured to provide the requested service in response to receiving the second request, a language-specific interface of each device of the plurality of devices is incompatible with a language-specific interface of each other device of the plurality of devices, and the each other device of the plurality of devices are those devices of the plurality of devices other than the each device. | 1. A method comprising: receiving a first request, wherein the first request is a request to provide a requested service, the requested service is one of a plurality of services, the first request conforms to a request format defined in a first language, the first request is received by a module configured to receive the first request from a plurality of source types, and the plurality of source types comprises an applet executing on a first remote network node, and a control module executing on a second remote network node; parsing the first request by providing the first request to a language parser, wherein the language parser is configured to parse the first language; obtaining results of parsing the first request from the language parser; in response to the obtaining the results, selecting a first device, wherein the selecting comprises determining whether the first device is coupled to the language parser, and in response to a determination that the first device is not coupled to the language parser, adding the first device to a plurality of devices coupled to the language parser; and coupling the first device to the language parser, wherein the first device is configured to provide the requested service, each of the plurality of devices is configured to provide a corresponding service of the plurality of services, and at least two devices among the plurality of devices are configured to provide the requested service; and converting the first request to a second request, wherein the second request conforms to a request format defined in a second language, the first device is configured to provide the requested service in response to receiving the second request, a language-specific interface of each device of the plurality of devices is incompatible with a language-specific interface of each other device of the plurality of devices, and the each other device of the plurality of devices are those devices of the plurality of devices other than the each device. 10. The method of claim 1 , wherein the at least two devices configured to provide the requested service comprise: the first device, wherein the first device is configured to provide the requested service, and the first device comprises a first application program interface (API) configured to receive instructions in a first device-specific native language; and a second device, wherein the second device is configured to provide the requested service, the second device comprises a second API configured to receive instructions in a second device-specific native language, the second device-specific native language is distinct from the first device-specific native language, and the second device is configured to receive requests only in a format that is incompatible with the request format defined in the second language. | 0.534594 |
11. An apparatus for determining whether an operator text is to be generated in response to a received alert condition, the apparatus comprising: at least one processor; and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to at least: analyze a primary data feed and at least one confirmatory data feed to identify one or more features related to the received alert condition; determine whether the received alert condition in the primary data feed is confirmed by at least one confirmatory data feed, wherein the alert condition is validated in an instance in which a signal correlation between the primary data feed and the confirmatory data feed satisfies a correlation threshold; determine whether the one or more features in the primary data feed are explainable by at least one diagnostic data feed; and traverse, using the one or more features, a decision tree, wherein the decision tree is operable to determine that at least a portion of an operator text is to be generated in an instance in which a feature of the one or more features evaluates as true for at least one node of the decision tree; and generate an output text that is displayable in a user interface that describes at least a diagnosis based on the at least one diagnostic data feed for the feature of the one or more features that evaluated as true. | 11. An apparatus for determining whether an operator text is to be generated in response to a received alert condition, the apparatus comprising: at least one processor; and at least one memory including computer program code, the at least one memory and the computer program code configured to, with the at least one processor, cause the apparatus to at least: analyze a primary data feed and at least one confirmatory data feed to identify one or more features related to the received alert condition; determine whether the received alert condition in the primary data feed is confirmed by at least one confirmatory data feed, wherein the alert condition is validated in an instance in which a signal correlation between the primary data feed and the confirmatory data feed satisfies a correlation threshold; determine whether the one or more features in the primary data feed are explainable by at least one diagnostic data feed; and traverse, using the one or more features, a decision tree, wherein the decision tree is operable to determine that at least a portion of an operator text is to be generated in an instance in which a feature of the one or more features evaluates as true for at least one node of the decision tree; and generate an output text that is displayable in a user interface that describes at least a diagnosis based on the at least one diagnostic data feed for the feature of the one or more features that evaluated as true. 19. The apparatus according to claim 11 , wherein the message data structures comprise numerical data that describes at least one of the alert condition, a description of a stable period for the primary data feed, a description of a behavior of one or more related data feeds or a recommendation. | 0.782064 |
8. A computer program product for providing a semi-supervised data integration model for named entity classification from a first repository of entity information in view of an auxiliary repository of classification assistance data, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code being executable by a computer to perform a method comprising: comparing training data to named entity candidates taken from the first repository, thereby forming a positive training seed set in view of identified commonality between the training data and the named entity candidates; in view of the positive training seed set, populating a decision tree; in view of populating the decision tree, creating classification rules for classifying the named entity candidates; sampling a number of entities from the named entity candidates; in view of the classification rules, labeling the sampled entities as positive examples and/or negative examples; in view of the positive examples and the auxiliary repository, updating the positive training seed set to include identified commonality between the positive examples and the auxiliary repository; in view of the negative examples and the auxiliary repository, updating a negative training seed set to include negative examples which lack commonality with the auxiliary repository; and in view of both the updated positive and negative training seed sets, updating the decision tree and the classification rules. | 8. A computer program product for providing a semi-supervised data integration model for named entity classification from a first repository of entity information in view of an auxiliary repository of classification assistance data, the computer program product comprising: a non-transitory computer readable storage medium having computer readable program code embodied therewith, the computer readable program code being executable by a computer to perform a method comprising: comparing training data to named entity candidates taken from the first repository, thereby forming a positive training seed set in view of identified commonality between the training data and the named entity candidates; in view of the positive training seed set, populating a decision tree; in view of populating the decision tree, creating classification rules for classifying the named entity candidates; sampling a number of entities from the named entity candidates; in view of the classification rules, labeling the sampled entities as positive examples and/or negative examples; in view of the positive examples and the auxiliary repository, updating the positive training seed set to include identified commonality between the positive examples and the auxiliary repository; in view of the negative examples and the auxiliary repository, updating a negative training seed set to include negative examples which lack commonality with the auxiliary repository; and in view of both the updated positive and negative training seed sets, updating the decision tree and the classification rules. 9. The computer program product of claim 8 , comprising: repeating the sampling, the labeling of the sampled entities, the updating of the positive and negative training seed sets, and the updating of the decision tree and the classification rules until a threshold condition is met, the threshold condition comprising one of: a maximum number of iterations and a change in a number of rules in the classification rules between iterations. | 0.608496 |
5. A computer-implemented method comprising: determining, with a data processing apparatus having one or more processors, a group of candidate translations for each source sentence in a plurality of source sentences; and for one or more iterations: calculating, with the data processing apparatus, a first aggregate error surface and an optimal model parameter for each feature function in a plurality of feature functions for a linear statistical machine translation model; ranking, with the data processing apparatus, the plurality of feature functions according to a quality criterion; calculating, with the data processing apparatus, a second aggregate error surface and an optimal number of updates for ranked feature functions; determining, with the data processing apparatus, a group of feature functions from the plurality of feature functions using the optimal number of updates for ranked feature functions, the group of feature functions including a particular feature function if updating the particular feature function with the respective optimal model parameter does not increase an error count; and updating, with the data processing apparatus, each feature function of the group of feature functions with the corresponding optimal model parameter. | 5. A computer-implemented method comprising: determining, with a data processing apparatus having one or more processors, a group of candidate translations for each source sentence in a plurality of source sentences; and for one or more iterations: calculating, with the data processing apparatus, a first aggregate error surface and an optimal model parameter for each feature function in a plurality of feature functions for a linear statistical machine translation model; ranking, with the data processing apparatus, the plurality of feature functions according to a quality criterion; calculating, with the data processing apparatus, a second aggregate error surface and an optimal number of updates for ranked feature functions; determining, with the data processing apparatus, a group of feature functions from the plurality of feature functions using the optimal number of updates for ranked feature functions, the group of feature functions including a particular feature function if updating the particular feature function with the respective optimal model parameter does not increase an error count; and updating, with the data processing apparatus, each feature function of the group of feature functions with the corresponding optimal model parameter. 6. The method of claim 5 , where calculating the first aggregate error surface and the optimal model parameter for each feature function further comprises: for each feature function in the plurality of feature functions: for each source sentence in the plurality of source sentences: calculating a minimum cost surface as a function of feature function model parameter; calculating a source sentence error surface using the minimum cost surface; merging the source sentence error surfaces for each source sentence into the first aggregate error surface for the feature function; and identifying the optimal model parameter for the feature function that minimizes the first aggregate error surface for the feature function. | 0.5 |
16. A computing device, comprising: a processor; an imagining element; a display element; and memory including instructions that, when executed by the processor, cause the computing device to: capture, using the imagining element, an image of text; cause the text within the image to be recognized with a character recognition engine; receive, from the character recognition engine, a score for each text string associated with the text, each score corresponding to a level of recognition confidence for a respective text string; adjust the score for each text string based on a function of distance from a center of the image, the score associated with a text string near the center being adjusted upward relative to a text string closer to an edge of the image; filter out at least a portion of the text that is at least one of a determined distance from an edge of the image or are associated with a determined volume of text; compare the text to content references associated with content, the content references including text strings corresponding to corresponding to identifying features of the content; identify a determined number of text strings matching content reference text strings at least equaling or exceeding a combined threshold, the combined threshold indicating a number of matches or approximate matches to within an allowable deviation; and submit the determined number of text strings to at least one content database. | 16. A computing device, comprising: a processor; an imagining element; a display element; and memory including instructions that, when executed by the processor, cause the computing device to: capture, using the imagining element, an image of text; cause the text within the image to be recognized with a character recognition engine; receive, from the character recognition engine, a score for each text string associated with the text, each score corresponding to a level of recognition confidence for a respective text string; adjust the score for each text string based on a function of distance from a center of the image, the score associated with a text string near the center being adjusted upward relative to a text string closer to an edge of the image; filter out at least a portion of the text that is at least one of a determined distance from an edge of the image or are associated with a determined volume of text; compare the text to content references associated with content, the content references including text strings corresponding to corresponding to identifying features of the content; identify a determined number of text strings matching content reference text strings at least equaling or exceeding a combined threshold, the combined threshold indicating a number of matches or approximate matches to within an allowable deviation; and submit the determined number of text strings to at least one content database. 17. The computing device of claim 16 , wherein the instructions that, when executed by the processor, further cause the computing device to: adjust the score for each text string in a line of text associated with at least two lines of text downward. | 0.701943 |
9. A computer-readable storage medium configured with data and with instructions that when executed by at least one processor causes the processor(s) to perform a process for managing object persistence, the process comprising the steps of: obtaining an ORM session from an object-relational mapper; receiving in a memory a code which contains calls to a fluent interface in an API Pattern; executing the code with at least one processor; and in the course of executing the code, automatically manipulating a persistence ignorant object within the ORM session in a manner consistent with the API Pattern. | 9. A computer-readable storage medium configured with data and with instructions that when executed by at least one processor causes the processor(s) to perform a process for managing object persistence, the process comprising the steps of: obtaining an ORM session from an object-relational mapper; receiving in a memory a code which contains calls to a fluent interface in an API Pattern; executing the code with at least one processor; and in the course of executing the code, automatically manipulating a persistence ignorant object within the ORM session in a manner consistent with the API Pattern. 13. The configured medium of claim 9 , wherein executing the code includes manipulating a persistence ignorant object in at least three of the following ways: accessing a non-scalar property that depends on the containing object for persistence; incrementally loading into volatile memory portions of a graph containing the object; checking whether a property of the object is marked as modified; marking a property of the object as modified; setting current and/or original values of the object from another object; setting current and/or original values of the object from a dictionary; creating a cloned object containing current, original, and/or database values of the object. | 0.676889 |
1. A system for context-sensitive monitoring of sensor performance for an arterial flow system, comprising the following computer-executable components: a sensor interface component that obtains sensor data from a plurality of sensors; a context analyzer component that analyzes contextual data received from at least one data source, the contextual data being associated with the sensor data; a sensor analyzer component that identifies which of the sensor data is degraded based at least in part upon analysis of the contextual data; and an output component that provides output sensor data based at least in part upon identification of the degraded sensor data. | 1. A system for context-sensitive monitoring of sensor performance for an arterial flow system, comprising the following computer-executable components: a sensor interface component that obtains sensor data from a plurality of sensors; a context analyzer component that analyzes contextual data received from at least one data source, the contextual data being associated with the sensor data; a sensor analyzer component that identifies which of the sensor data is degraded based at least in part upon analysis of the contextual data; and an output component that provides output sensor data based at least in part upon identification of the degraded sensor data. 10. The system of claim 1 , wherein the sensor analyzer component utilizes a traffic flow representation during identification of degraded sensor data. | 0.58209 |
24. The system of claim 23 , wherein the interest value comprises a selection score for the first article in a context of the first population group. | 24. The system of claim 23 , wherein the interest value comprises a selection score for the first article in a context of the first population group. 26. The system of claim 24 , wherein the interest value comprises at least the selection score divided by at least a total selection score for a set of documents provided in response to the search query, the total selection score corresponding to how many clicks users in the first population group made on any of the set of documents. | 0.882979 |
11. A tangible machine readable storage medium comprising instructions that, when executed, cause a machine to perform operations comprising: classifying participants of the conference call in a hierarchy according to respective priority values; detecting an attempt of a first participant and a second participant to speak at substantially a same time; detecting which one of the first and second participants has a lower priority ranking; blocking an audio signal of the one of the first participant and the second participant having the lower priority ranking; placing an identifier associated with the blocked one of the first and second participants in a queue; organizing the queue according to a behavior-based policy, wherein organizing the queue according to the behavior-based policy comprises comparing an utterance of a current speaker to a keyword associated with the conference call to determine a relevancy of the utterance; and increasing a first point total associated with the current speaker in response to determining that the utterance is substantially relevant, and decreasing the first point total associated with the current speaker in response to determining that the utterance is substantially irrelevant. | 11. A tangible machine readable storage medium comprising instructions that, when executed, cause a machine to perform operations comprising: classifying participants of the conference call in a hierarchy according to respective priority values; detecting an attempt of a first participant and a second participant to speak at substantially a same time; detecting which one of the first and second participants has a lower priority ranking; blocking an audio signal of the one of the first participant and the second participant having the lower priority ranking; placing an identifier associated with the blocked one of the first and second participants in a queue; organizing the queue according to a behavior-based policy, wherein organizing the queue according to the behavior-based policy comprises comparing an utterance of a current speaker to a keyword associated with the conference call to determine a relevancy of the utterance; and increasing a first point total associated with the current speaker in response to determining that the utterance is substantially relevant, and decreasing the first point total associated with the current speaker in response to determining that the utterance is substantially irrelevant. 16. A storage medium as defined in claim 11 , wherein organizing the queue according to the behavior-based policy comprises comparing a duration of speaking of the current speaker to a threshold. | 0.549674 |
1. A method, comprising: receiving, by a computer system, information indicative of a set of relationships that include first and second relationships between a user and one or more entities; based on an analysis of the information indicative of the set of relationships that include the first and second relationships and at least one additional item of information corresponding to the user, the computer system generating a link confidence code indicative of an estimated accuracy of the first and second relationships, wherein the link confidence code includes a metric indicative of an estimated accuracy of at least one of the first and second relationships; and providing, by the computer system, the link confidence code indicative of the estimated accuracy of the first and second relationships. | 1. A method, comprising: receiving, by a computer system, information indicative of a set of relationships that include first and second relationships between a user and one or more entities; based on an analysis of the information indicative of the set of relationships that include the first and second relationships and at least one additional item of information corresponding to the user, the computer system generating a link confidence code indicative of an estimated accuracy of the first and second relationships, wherein the link confidence code includes a metric indicative of an estimated accuracy of at least one of the first and second relationships; and providing, by the computer system, the link confidence code indicative of the estimated accuracy of the first and second relationships. 8. The method of claim 1 , wherein the analysis includes matching, by the computer system, each of a plurality of respective data elements for the first and second relationships to at least a portion of data elements included in the at least one additional item of information to generate an elemental match score for each of the plurality of respective data elements for the first and second relationships; and the computer system processing the elemental match scores to generate the link confidence code indicative of the estimated accuracy of the first and second relationships. | 0.5 |
5. A non-transitory computer-readable medium storing program code, the program code executable by a processor of a computing system to cause the computing system to: identify from a plurality of information models (i) a first information model of a database schema comprising a first dimension and a second dimension and (ii) a second information model of the database schema comprising a third dimension and a fourth dimension, where the first information model and the second information model are not joined to remaining information models; generate an auto-join query language statement on the first dimension of the first information model and the third dimension of the second information model, based on the first dimension and the third dimension being identical, where each auto-join is defined on an identical dimension; generate, for each dimension, a definition indicating each of the information models that includes the dimension, and a column defined by each of the information models which corresponds to the dimension; receive the auto-join query language statement including the first dimension of the first information model and the third dimension of the second information model; generate a structured language query for each of the information models based on the generated definitions indicating the first information model wherein in a case that the first informational model does not include an identical dimension with the remaining information models, include a NULL in place of a missing dimension in a SELECT statement of the structured language query generated for the first information model so that a returned result set includes a same number of columns; obtain a plurality of result sets, one for each of the structured language queries; determine at least one or more rows from each of result sets having identical dimension values; aggregate the rows from each of the result sets having identical dimension values into a single row in an aggregated result set; and present the single rows. | 5. A non-transitory computer-readable medium storing program code, the program code executable by a processor of a computing system to cause the computing system to: identify from a plurality of information models (i) a first information model of a database schema comprising a first dimension and a second dimension and (ii) a second information model of the database schema comprising a third dimension and a fourth dimension, where the first information model and the second information model are not joined to remaining information models; generate an auto-join query language statement on the first dimension of the first information model and the third dimension of the second information model, based on the first dimension and the third dimension being identical, where each auto-join is defined on an identical dimension; generate, for each dimension, a definition indicating each of the information models that includes the dimension, and a column defined by each of the information models which corresponds to the dimension; receive the auto-join query language statement including the first dimension of the first information model and the third dimension of the second information model; generate a structured language query for each of the information models based on the generated definitions indicating the first information model wherein in a case that the first informational model does not include an identical dimension with the remaining information models, include a NULL in place of a missing dimension in a SELECT statement of the structured language query generated for the first information model so that a returned result set includes a same number of columns; obtain a plurality of result sets, one for each of the structured language queries; determine at least one or more rows from each of result sets having identical dimension values; aggregate the rows from each of the result sets having identical dimension values into a single row in an aggregated result set; and present the single rows. 6. A medium according to claim 5 , wherein generation of one structured language query for one of the information models comprises: identification of one of the one or more dimensions which the one information model does not include; and inclusion of a NULL in the SELECT clause of the one structured language query for each of the dimensions which the one information model does not include. | 0.575 |
1. A method for providing search results comprising the steps of: receiving voiced utterances; converting said voiced utterances into data; identifying from said data, information comprising: (i) a query term to be searched for of a plurality of query terms to be searched for, (ii) a search engine identifier of a plurality of search engine identifiers representing a search engine of a plurality of search engines; modifying said query term to be searched for of a plurality of query terms to be searched for by replacing any spaces in said query term to be searched for of a plurality of query terms to be searched for with a query term separator compatible with said search engine of a plurality of search engines creating a modified query term to be searched for; constructing a uniform resource locator that includes said modified query term to be searched for, such that said constructed uniform resource locator represents a valid request to said search engine of a plurality of search engines to perform a search; opening said constructed uniform resource locator, via a uniform resource locator transmission method of a plurality of uniform resource locator transmissions methods; and providing results of the search system. | 1. A method for providing search results comprising the steps of: receiving voiced utterances; converting said voiced utterances into data; identifying from said data, information comprising: (i) a query term to be searched for of a plurality of query terms to be searched for, (ii) a search engine identifier of a plurality of search engine identifiers representing a search engine of a plurality of search engines; modifying said query term to be searched for of a plurality of query terms to be searched for by replacing any spaces in said query term to be searched for of a plurality of query terms to be searched for with a query term separator compatible with said search engine of a plurality of search engines creating a modified query term to be searched for; constructing a uniform resource locator that includes said modified query term to be searched for, such that said constructed uniform resource locator represents a valid request to said search engine of a plurality of search engines to perform a search; opening said constructed uniform resource locator, via a uniform resource locator transmission method of a plurality of uniform resource locator transmissions methods; and providing results of the search system. 2. The Method of claim 1 , further comprising: receiving and displaying web pages or other information returned by opening said search engine's uniform resource locator. | 0.825423 |
1. A machine interpreter comprising: a parallel translation data base for storing an example sentence of a first language and a corresponding translation of the example sentence of a second language; a variable semantic feature dictionary for designating a variable word group of at least one word corresponding to a particular word group, of at least one word, of the example sentence, and for storing word groups of the first and second languages in pairs; input means for inputting a request for retrieval from the parallel translation data base; retrieving means for retrieving an example sentence and a translated sentence from the parallel translation data base based upon an input retrieval request; display for displaying the example sentence and translated sentence retrieved from the parallel translation data base; control means for arranging words of a variable word group in the variable semantic feature dictionary corresponding to the particular word group of the example sentence, and for causing the display to display the arranged words and a word group corresponding to the arranged words; and substituting means for substituting a translated word of the arranged words, equivalent to a word requested by the input means, for the particular word of the example sentence. | 1. A machine interpreter comprising: a parallel translation data base for storing an example sentence of a first language and a corresponding translation of the example sentence of a second language; a variable semantic feature dictionary for designating a variable word group of at least one word corresponding to a particular word group, of at least one word, of the example sentence, and for storing word groups of the first and second languages in pairs; input means for inputting a request for retrieval from the parallel translation data base; retrieving means for retrieving an example sentence and a translated sentence from the parallel translation data base based upon an input retrieval request; display for displaying the example sentence and translated sentence retrieved from the parallel translation data base; control means for arranging words of a variable word group in the variable semantic feature dictionary corresponding to the particular word group of the example sentence, and for causing the display to display the arranged words and a word group corresponding to the arranged words; and substituting means for substituting a translated word of the arranged words, equivalent to a word requested by the input means, for the particular word of the example sentence. 3. The machine interpreter as defined in claim 1, wherein the control means arranges the words of the variable word group in the variable semantic feature dictionary corresponding to the particular word of the example sentence, and causes the display to display the words of the variable word group by setting a word identical to the particular word of the example sentence which is being displayed. | 0.52533 |
9. A method implemented in instructions executed by a computer processor of using a UI XML schema to define an application's graphical layout, the method comprising: defining a UI XML schema in which a valid UI XML document includes at least a view element in which the name of the application view is provided; specifying a graphical layout of at least one user interface component in elements and attributes in the UI XML document; in response to an application being launched, instantiating a runtime object that represents the application view and causing the at least one user interface component to be rendered on a graphical display in, accordance with the graphical layout defined in the UI XML document; binding the at least one user interface component to a set of data in a data model, the set of data identified by an XPath expression of an XBind; and in response to a trigger event: identifying an emitter view object as a source of the trigger event based on an indicator included with an XBind; and using a context of the emitter view object to execute computational logic of the application, the computational logic including at least one Action URL for submission to a communicator. | 9. A method implemented in instructions executed by a computer processor of using a UI XML schema to define an application's graphical layout, the method comprising: defining a UI XML schema in which a valid UI XML document includes at least a view element in which the name of the application view is provided; specifying a graphical layout of at least one user interface component in elements and attributes in the UI XML document; in response to an application being launched, instantiating a runtime object that represents the application view and causing the at least one user interface component to be rendered on a graphical display in, accordance with the graphical layout defined in the UI XML document; binding the at least one user interface component to a set of data in a data model, the set of data identified by an XPath expression of an XBind; and in response to a trigger event: identifying an emitter view object as a source of the trigger event based on an indicator included with an XBind; and using a context of the emitter view object to execute computational logic of the application, the computational logic including at least one Action URL for submission to a communicator. 14. The method recited in claim 9 , wherein instantiating a runtime object representing the application view, includes: identifying a semantic description of an open operation encountered in an application's process code; and evaluating an expression associated with the open operation that references a view defined in the UI XML document. | 0.618649 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.