sentence1
stringlengths 40
15.9k
| sentence2
stringlengths 88
20k
| label
float64 0.5
0.99
|
|---|---|---|
1. A computer-implemented method for performing a location search, comprising: at a server system including one or more processors and memory storing one or more programs, the one or more processors executing the one or more programs to perform the operations of: receiving, from a client system distinct from the server, a location search query for a desired geographical location; determining key words corresponding to the location search query, wherein at least a subset of the key words incorrectly describe the desired geographical location; searching for geographical locations corresponding to the key words, including searching an index of documents to identify one or more documents that correspond to the key words in the location search query, wherein each of the identified documents corresponds to a geographical feature at a geographical location and includes terms matching the key words of the location search query, and wherein the terms matching the key words of the location search query include terms that incorrectly describe the geographical feature; and providing, to the client system, a map to be displayed at the client system, the map including one or more location tags at the one or more geographical locations corresponding to the one or more identified documents. | 1. A computer-implemented method for performing a location search, comprising: at a server system including one or more processors and memory storing one or more programs, the one or more processors executing the one or more programs to perform the operations of: receiving, from a client system distinct from the server, a location search query for a desired geographical location; determining key words corresponding to the location search query, wherein at least a subset of the key words incorrectly describe the desired geographical location; searching for geographical locations corresponding to the key words, including searching an index of documents to identify one or more documents that correspond to the key words in the location search query, wherein each of the identified documents corresponds to a geographical feature at a geographical location and includes terms matching the key words of the location search query, and wherein the terms matching the key words of the location search query include terms that incorrectly describe the geographical feature; and providing, to the client system, a map to be displayed at the client system, the map including one or more location tags at the one or more geographical locations corresponding to the one or more identified documents. 15. The method of claim 1 , wherein the providing includes providing a geographical map image corresponding to the one or more geographical locations. | 0.584436 |
1. A method for analyzing executable software code using a computer comprising a processor and a memory, the method comprising: processing the executable software code to generate an optimized, exhaustive data flow model including parsing the executable software code to facilitate identification of data flows for inclusion in the exhaustive data flow model; processing the executable software code to generate an optimized, exhaustive control flow model; and storing, in the memory, an intermediate representation of the executable software code that provides a complete model of the executable software code based on the optimized data flow model and the optimized control flow model, thereby facilitating analysis of the executable software code according to comparison of the intermediate representation to reference models. | 1. A method for analyzing executable software code using a computer comprising a processor and a memory, the method comprising: processing the executable software code to generate an optimized, exhaustive data flow model including parsing the executable software code to facilitate identification of data flows for inclusion in the exhaustive data flow model; processing the executable software code to generate an optimized, exhaustive control flow model; and storing, in the memory, an intermediate representation of the executable software code that provides a complete model of the executable software code based on the optimized data flow model and the optimized control flow model, thereby facilitating analysis of the executable software code according to comparison of the intermediate representation to reference models. 12. The computer-implemented method of claim 1 wherein processing the executable software code to generate an exhaustive control flow model of the executable software code comprises: generating control flow signatures for the executable software code; and comparing the generated control flow signatures to one or more predefined control flow signatures, each representing a known control flow model. | 0.5 |
27. An object-oriented computer program product for processing structured information for implementation by a computer in an object-oriented framework, comprising: a storage means; a first obtaining means for obtaining an interactive input from a user; a second obtaining means for obtaining a first structural description of a first structured information format; a third obtaining means for obtaining a second structural description of a second structured information format; means for interactively creating a rule to transform an element of the first structured information format into an element of the second structured information format utilizing the interactive input from the user, the first structural description, and the second structural description; and means for outputting the rule, wherein at least one of the first obtaining means, the second obtaining means, the third obtaining means, the means for interactively creating, and the means for outputting includes a software object. | 27. An object-oriented computer program product for processing structured information for implementation by a computer in an object-oriented framework, comprising: a storage means; a first obtaining means for obtaining an interactive input from a user; a second obtaining means for obtaining a first structural description of a first structured information format; a third obtaining means for obtaining a second structural description of a second structured information format; means for interactively creating a rule to transform an element of the first structured information format into an element of the second structured information format utilizing the interactive input from the user, the first structural description, and the second structural description; and means for outputting the rule, wherein at least one of the first obtaining means, the second obtaining means, the third obtaining means, the means for interactively creating, and the means for outputting includes a software object. 28. A computer program product according to claim 27, wherein the first structured information format includes ISO/IEC 9070 public identifier naming format, the second structured information format includes an operating system file name format and the means for interactively creating comprises: means for interactively creating a rule to transform an element of a first structured information format which includes an ISO/IEC 9070 public identifier element into an element of a second structured information format which includes an operating system file name format element utilizing the interactive input from the user, the first structural description which includes a structural description of the ISO/IEC 9070 public identifier format, and the second structural description which includes a structural description of the operating system file name format. | 0.612096 |
1. A computer implemented method of aligning widgets on a page, the method comprising: providing, via a computing device, a graphical development environment, the graphical development environment depicting a representation of a page and a plurality of user-selectable data-capable widgets, each widget comprising one or more graphical display sub-components and a computer-executable functional characteristic; determining for each widget, via the computing device, a respective most significant graphical display sub-component from among the graphical display sub-components included in the widget, said respective most significant graphical display sub-component being a reference for relative alignment of other widgets with respect to said each widget within the page; determining, for each widget, via the computing device, a respective relative alignment border of the reference for relative alignment, the respective relative alignment border being selected from one of a top, left, right, bottom, and center of the respective for relative alignment; determining, via the computing device, a grouping relationship between each of the plurality of widgets, wherein at least one widget in the determined group has a respective relative alignment border that is different from the respective relative alignment border of at least one other widget within the determined group; and for each widget in each determined group, aligning, via the computing device, the widgets with the respective relative alignment border of each widget in the group based on an alignment selected from the group consisting of a horizontal alignment, a vertical alignment, and a centered alignment such that the selected alignment is applied to each of said respective relative alignment borders in order to align each widget with respect to the other widgets in the determined group within the page. | 1. A computer implemented method of aligning widgets on a page, the method comprising: providing, via a computing device, a graphical development environment, the graphical development environment depicting a representation of a page and a plurality of user-selectable data-capable widgets, each widget comprising one or more graphical display sub-components and a computer-executable functional characteristic; determining for each widget, via the computing device, a respective most significant graphical display sub-component from among the graphical display sub-components included in the widget, said respective most significant graphical display sub-component being a reference for relative alignment of other widgets with respect to said each widget within the page; determining, for each widget, via the computing device, a respective relative alignment border of the reference for relative alignment, the respective relative alignment border being selected from one of a top, left, right, bottom, and center of the respective for relative alignment; determining, via the computing device, a grouping relationship between each of the plurality of widgets, wherein at least one widget in the determined group has a respective relative alignment border that is different from the respective relative alignment border of at least one other widget within the determined group; and for each widget in each determined group, aligning, via the computing device, the widgets with the respective relative alignment border of each widget in the group based on an alignment selected from the group consisting of a horizontal alignment, a vertical alignment, and a centered alignment such that the selected alignment is applied to each of said respective relative alignment borders in order to align each widget with respect to the other widgets in the determined group within the page. 5. The method of claim 1 , further comprising storing the grouping relationship in an application model datastore, along with alignment information setting forth an alignment relationship between the widgets in each determined group. | 0.637187 |
3. The method of claim 1 , further comprising modifying one or more of the executable script commands generated by said transforming module. | 3. The method of claim 1 , further comprising modifying one or more of the executable script commands generated by said transforming module. 4. The method of claim 3 , wherein one or more of the executable script command modifications are based on interactions with the software program user interface. | 0.971195 |
1. A system comprising: a computer-readable memory storing executable instructions; and one or more physical computer processors in communication with the computer-readable memory, wherein the one or more physical computer processors are programmed by the executable instructions to at least: automatically predict pronunciations using a grapheme-to-phoneme model for a list of words having manually provided pronunciations, wherein the grapheme-to-phoneme model is adapted to generate a predicted pronunciation and a confidence score for the predicted pronunciation based upon an input word; generate a prediction performance model for the grapheme-to-phoneme model based on: a comparison of automatically predicted pronunciations of the list of words with the manually provided pronunciations for the list of words, and confidence scores for the automatically predicted pronunciations, wherein the prediction performance model is adapted to generate performance information for the grapheme-to-phoneme model, the performance information indicating a degree of confidence in the grapheme-to-phoneme model to predict a new word added to the system based upon an input predicted pronunciation generated by the grapheme-to-phoneme model for the new word and the confidence score for the input predicted pronunciation generated by the grapheme-to-phoneme model; receive an electronic record including candidate words to be added to an automatic speech recognition lexicon, the automatic speech recognition lexicon including words having the automatically predicted pronunciations generated by the grapheme-to-phoneme model; generate, from the grapheme-to-phoneme model, a predicted pronunciation for a candidate word and a confidence score for a candidate word, wherein the candidate word is included in the candidate words; generate, from the prediction performance model, an annotation priority for the candidate word based on the confidence score for the predicted pronunciation of the candidate word and the predicted pronunciation of the candidate word; determine that the annotation priority for the candidate word exceeds a priority threshold; and route the candidate word to a manual pronunciation generator. | 1. A system comprising: a computer-readable memory storing executable instructions; and one or more physical computer processors in communication with the computer-readable memory, wherein the one or more physical computer processors are programmed by the executable instructions to at least: automatically predict pronunciations using a grapheme-to-phoneme model for a list of words having manually provided pronunciations, wherein the grapheme-to-phoneme model is adapted to generate a predicted pronunciation and a confidence score for the predicted pronunciation based upon an input word; generate a prediction performance model for the grapheme-to-phoneme model based on: a comparison of automatically predicted pronunciations of the list of words with the manually provided pronunciations for the list of words, and confidence scores for the automatically predicted pronunciations, wherein the prediction performance model is adapted to generate performance information for the grapheme-to-phoneme model, the performance information indicating a degree of confidence in the grapheme-to-phoneme model to predict a new word added to the system based upon an input predicted pronunciation generated by the grapheme-to-phoneme model for the new word and the confidence score for the input predicted pronunciation generated by the grapheme-to-phoneme model; receive an electronic record including candidate words to be added to an automatic speech recognition lexicon, the automatic speech recognition lexicon including words having the automatically predicted pronunciations generated by the grapheme-to-phoneme model; generate, from the grapheme-to-phoneme model, a predicted pronunciation for a candidate word and a confidence score for a candidate word, wherein the candidate word is included in the candidate words; generate, from the prediction performance model, an annotation priority for the candidate word based on the confidence score for the predicted pronunciation of the candidate word and the predicted pronunciation of the candidate word; determine that the annotation priority for the candidate word exceeds a priority threshold; and route the candidate word to a manual pronunciation generator. 7. The system of claim 1 , wherein the one or more physical computer processors are programmed by the executable instructions to route the candidate word by at least: obtaining manual annotation resource information identifying an annotation resource; and generating a manual annotation route for the candidate word to the annotation resource based on the manual annotation resource information. | 0.531495 |
2. The system of claim 1 , wherein the agent is programmed to poll the server for data for the server application. | 2. The system of claim 1 , wherein the agent is programmed to poll the server for data for the server application. 3. The system of claim 2 , wherein, when data is present for the client application, the agent is programmed to obtain the data from the at least one queue and to pass the data to the server application. | 0.952292 |
3. The method of claim 2 , wherein calculating the grammar score comprises: determining a first number of commonly misused phrases in the voice-to-text data; determining a second number of double words in the voice-to-text data; and determining a third number of grammar errors, wherein the grammar score is based on the first number, second number; and third number. | 3. The method of claim 2 , wherein calculating the grammar score comprises: determining a first number of commonly misused phrases in the voice-to-text data; determining a second number of double words in the voice-to-text data; and determining a third number of grammar errors, wherein the grammar score is based on the first number, second number; and third number. 4. The method of claim 3 , wherein calculating the grammar score further comprises: determining a fourth number of sentences in the voice-to-text data; and normalizing the first, second, and third numbers by the fourth number of sentences, wherein the grammar score is based on the normalized first, second, and third numbers. | 0.8715 |
11. An apparatus comprising: a processor configured to convert a verbal component of a communication session into textual information, and to scan the converted textual information for a text string to trigger an application, wherein the processor is further configured to invoke the application to perform an action in response to the textual information, for or on behalf of a party of the communication session, to provide supplemental information about the textual information, wherein the supplemental information or a confirmation of the action is transmitted to the party. | 11. An apparatus comprising: a processor configured to convert a verbal component of a communication session into textual information, and to scan the converted textual information for a text string to trigger an application, wherein the processor is further configured to invoke the application to perform an action in response to the textual information, for or on behalf of a party of the communication session, to provide supplemental information about the textual information, wherein the supplemental information or a confirmation of the action is transmitted to the party. 14. An apparatus of claim 11 , wherein the supplemental information is provided from one or more network information resources or services including: a calendar service; a weather forecast service; a business information service; and a navigation service. | 0.591787 |
11. A method for automated auditing of an insurance agreement, said method comprising: storing within a database an audit template having a plurality of questions and answer options associated with each question; providing the insurance agreement for determining whether the insurance agreement is in compliance with a standard; prompting an input of a first selection criteria including at least one attribute describing the insurance agreement, the first selection criteria identifying a type of insurance agreement to be audited including at least one of life insurance, health insurance, personal property insurance, business casualty insurance, key-man insurance, and board of director's liability insurance; receiving, via a computer, the first selection criteria; automatically retrieving, via the computer, a second selection criteria including other attributes describing the insurance agreement, the second selection criteria based on the first selection criteria, the second selection criteria including at least a face value of the insurance agreement; automatically retrieving, via the computer, relevant questions from the audit template in accordance with the first and second selection criteria, the relevant questions associated with at least one of the attributes describing the insurance agreement, wherein each question is assigned a weight; grouping the questions into categories selected from a group of categories consisting of: coverage, compliance, pricing, risk selection and underwriting; organizing the retrieved questions into a plurality of pre-assigned categories, wherein each question included within the audit template is pre-assigned to a category based on subject matter of the associated question, the plurality of pre-assigned categories including at least one of coverage, compliance, pricing, risk selection, underwriting, and line of business, and at least one of the plurality of pre-assigned categories is assigned a category weight; presenting the retrieved questions and associated answer options to a user; receiving answers from the user; generating categorical scores based on the received answers and the pre-assigned categories and comparing the categorical scores to corresponding categorical threshold scores to determine whether the insurance agreement is in compliance with the standard; and generating, via the computer, an audit score as a function of the received answers and the category weight, wherein the audit score represents a measure of compliance of the insurance agreement with the standard including whether the insurance agreement is in compliance within each category of the retrieved questions, wherein at least one question of the retrieved questions is assigned a zero-weight value such that the answer to a zero-weight value question is not scored, wherein each question is associated with at least two answer options, and wherein an answer weight for each question varies between the at least two answer options. | 11. A method for automated auditing of an insurance agreement, said method comprising: storing within a database an audit template having a plurality of questions and answer options associated with each question; providing the insurance agreement for determining whether the insurance agreement is in compliance with a standard; prompting an input of a first selection criteria including at least one attribute describing the insurance agreement, the first selection criteria identifying a type of insurance agreement to be audited including at least one of life insurance, health insurance, personal property insurance, business casualty insurance, key-man insurance, and board of director's liability insurance; receiving, via a computer, the first selection criteria; automatically retrieving, via the computer, a second selection criteria including other attributes describing the insurance agreement, the second selection criteria based on the first selection criteria, the second selection criteria including at least a face value of the insurance agreement; automatically retrieving, via the computer, relevant questions from the audit template in accordance with the first and second selection criteria, the relevant questions associated with at least one of the attributes describing the insurance agreement, wherein each question is assigned a weight; grouping the questions into categories selected from a group of categories consisting of: coverage, compliance, pricing, risk selection and underwriting; organizing the retrieved questions into a plurality of pre-assigned categories, wherein each question included within the audit template is pre-assigned to a category based on subject matter of the associated question, the plurality of pre-assigned categories including at least one of coverage, compliance, pricing, risk selection, underwriting, and line of business, and at least one of the plurality of pre-assigned categories is assigned a category weight; presenting the retrieved questions and associated answer options to a user; receiving answers from the user; generating categorical scores based on the received answers and the pre-assigned categories and comparing the categorical scores to corresponding categorical threshold scores to determine whether the insurance agreement is in compliance with the standard; and generating, via the computer, an audit score as a function of the received answers and the category weight, wherein the audit score represents a measure of compliance of the insurance agreement with the standard including whether the insurance agreement is in compliance within each category of the retrieved questions, wherein at least one question of the retrieved questions is assigned a zero-weight value such that the answer to a zero-weight value question is not scored, wherein each question is associated with at least two answer options, and wherein an answer weight for each question varies between the at least two answer options. 14. The method of claim 11 wherein generating the audit score further comprises: generating the audit score for each category as a function of the received answers and the category weight for questions grouped in each category. | 0.556212 |
17. A computer-based system for transmitting an electronic document, comprising: an computer that is remote from a device sending a message, the computer including a memory storing instructions; and a processor configured to: execute the instructions to receive the message, the message including a document including metadata, execute the instructions to automatically create a cleansed version of the document by removing at least a portion of the metadata from the document, execute the instructions to replace the document received with the message with the cleansed version of the document, and execute the instructions to transmit the message with the cleansed version of the document. | 17. A computer-based system for transmitting an electronic document, comprising: an computer that is remote from a device sending a message, the computer including a memory storing instructions; and a processor configured to: execute the instructions to receive the message, the message including a document including metadata, execute the instructions to automatically create a cleansed version of the document by removing at least a portion of the metadata from the document, execute the instructions to replace the document received with the message with the cleansed version of the document, and execute the instructions to transmit the message with the cleansed version of the document. 21. The system of claim 17 , wherein the processor is further configured to execute the instructions to notify an end user associated with the message that the document included metadata. | 0.841202 |
23. A non-transitory computer readable medium comprising a plurality of instructions executable on a processor of an electronic device for adapting the electronic device to implement a method of generating context specific terms, wherein the method comprises: obtaining a first collection of terms from at least one electronic file associated with a given context; comparing the first collection of terms with a second collection of terms to generate candidate terms present in the first collection of terms that are not in the second collection of terms; determining a relevance for each of the candidate terms; determining whether to add a given candidate term to a collection of context specific terms for the given context if the relevance for the given candidate term is above a threshold; and if it is determined that the given candidate term is to be added, adding the given candidate term to the collection of context specific terms for the given context; wherein determining whether to add the given candidate term to the collection of context specific terms comprises ensuring that the given candidate term is a valid term. | 23. A non-transitory computer readable medium comprising a plurality of instructions executable on a processor of an electronic device for adapting the electronic device to implement a method of generating context specific terms, wherein the method comprises: obtaining a first collection of terms from at least one electronic file associated with a given context; comparing the first collection of terms with a second collection of terms to generate candidate terms present in the first collection of terms that are not in the second collection of terms; determining a relevance for each of the candidate terms; determining whether to add a given candidate term to a collection of context specific terms for the given context if the relevance for the given candidate term is above a threshold; and if it is determined that the given candidate term is to be added, adding the given candidate term to the collection of context specific terms for the given context; wherein determining whether to add the given candidate term to the collection of context specific terms comprises ensuring that the given candidate term is a valid term. 26. The computer readable medium of claim 23 , wherein the plurality of instructions further comprise instructions to adapt the processor to obtain at least one of the first collection of terms and the second collection of terms from one or more existing repositories having a common characteristic comprising at least one of a common language, a common subject matter and a common organizational group. | 0.5 |
1. A method using one or more computer processors, comprising: providing, using the one or more computer processors, a first message in a first language to a first transformation module in a sequence of computer-implemented transformation modules, each transformation module comprising executable instructions configured to be executed by the one or more computer processors for performing message transformation operations, wherein each subsequent transformation module in the sequence accepts, as input, an output of a preceding transformation module in the sequence and provides, as output, a respective transformed message, wherein at least one transformation module in the sequence identifies at least a portion of the output of the at least one transformation module as not to be transformed by subsequent transformation modules in the sequence, and wherein the output of a final transformation module in the sequence comprises a transformed message in the first language; and querying, using the one or more computer processors, a computer data store for a translation of the transformed message in a second language. | 1. A method using one or more computer processors, comprising: providing, using the one or more computer processors, a first message in a first language to a first transformation module in a sequence of computer-implemented transformation modules, each transformation module comprising executable instructions configured to be executed by the one or more computer processors for performing message transformation operations, wherein each subsequent transformation module in the sequence accepts, as input, an output of a preceding transformation module in the sequence and provides, as output, a respective transformed message, wherein at least one transformation module in the sequence identifies at least a portion of the output of the at least one transformation module as not to be transformed by subsequent transformation modules in the sequence, and wherein the output of a final transformation module in the sequence comprises a transformed message in the first language; and querying, using the one or more computer processors, a computer data store for a translation of the transformed message in a second language. 5. The method of claim 1 , wherein one or more transformation modules perform a spelling check on the first message. | 0.788043 |
1. In a computerized search system in which queries are submitted by users who receive, in response, a list of documents selected from a corpus of documents wherein the list comprises documents deemed responsive to a user's query, a method of determining relevance of the documents comprising: obtaining, at a server computer comprising a processor, the query from a user; determining initial probabilities that a plurality of categories of a taxonomy contain documents relevant to the query, at least one of the initial probabilities being non-zero, wherein the initial probabilities are numeric values; determining a relevance of the documents matching the query in each category having non-zero initial probability; and determining a relevance of documents to the query based on the initial probabilities of the plurality of categories and the relevance of the documents matching the query, wherein determining the relevance of documents to the query comprises: for each particular category containing a particular document, determining a value of the relevance of a particular document to the query by multiplying a determined relevance of the particular document matching the query by the initial probability that the particular category includes relevant documents; generating updated probabilities that the categories of the taxonomy contain relevant documents by multiplying individual ones of the relevance of documents to the query by a weighting factor, wherein the weighting factors used to generate the updated probabilities decay monotonically with the relevance value of the documents to the query; determining an updated relevance of documents to the query based on the updated probabilities and the relevance of the documents matching the query; and summing the updated relevance values to determine the relevance of the documents to the query. | 1. In a computerized search system in which queries are submitted by users who receive, in response, a list of documents selected from a corpus of documents wherein the list comprises documents deemed responsive to a user's query, a method of determining relevance of the documents comprising: obtaining, at a server computer comprising a processor, the query from a user; determining initial probabilities that a plurality of categories of a taxonomy contain documents relevant to the query, at least one of the initial probabilities being non-zero, wherein the initial probabilities are numeric values; determining a relevance of the documents matching the query in each category having non-zero initial probability; and determining a relevance of documents to the query based on the initial probabilities of the plurality of categories and the relevance of the documents matching the query, wherein determining the relevance of documents to the query comprises: for each particular category containing a particular document, determining a value of the relevance of a particular document to the query by multiplying a determined relevance of the particular document matching the query by the initial probability that the particular category includes relevant documents; generating updated probabilities that the categories of the taxonomy contain relevant documents by multiplying individual ones of the relevance of documents to the query by a weighting factor, wherein the weighting factors used to generate the updated probabilities decay monotonically with the relevance value of the documents to the query; determining an updated relevance of documents to the query based on the updated probabilities and the relevance of the documents matching the query; and summing the updated relevance values to determine the relevance of the documents to the query. 3. The method of claim 1 , wherein determining the relevance of documents to the query further comprises summing all the relevance values of the particular document over all the categories where the particular document is found. | 0.562039 |
23. The method of claim 17 , further comprising one of displaying and hiding each of the segments independently of each other, according to at least one user-adjustable display setting. | 23. The method of claim 17 , further comprising one of displaying and hiding each of the segments independently of each other, according to at least one user-adjustable display setting. 24. The method of claim 23 , further comprising displaying a symbolic representation in place of at least one hidden segment to indicate a meaning of the hidden segment. | 0.94611 |
15. A system residing in a computer-readable medium for folder and file based management of layers and classes of a layered software application that is being developed into a runtime environment, said system comprising: a folder manager coupled to a storage area, said folder manager for: receiving inputs to said system including receiving a portion of code representing a method performed by a class of the layered software application and receiving instructions for storing said class of said layered software application, and opening a layer file folder within said storage area, said layer file folder for storing information related to a software development layer of said layered software application, said software development layer representing a unique version of said layered software application; a file manager coupled to said storage area, said file manager for opening a class file stored within said layer file folder, said class file represents said class of said layered software application and said class file for storing a software application class implemented in said software development layer; and a write manager coupled to said storage area, said write manager for writing textual information into said class file of said layer file folder, said textual information defining a said method implemented as part of said class in said software development layer. | 15. A system residing in a computer-readable medium for folder and file based management of layers and classes of a layered software application that is being developed into a runtime environment, said system comprising: a folder manager coupled to a storage area, said folder manager for: receiving inputs to said system including receiving a portion of code representing a method performed by a class of the layered software application and receiving instructions for storing said class of said layered software application, and opening a layer file folder within said storage area, said layer file folder for storing information related to a software development layer of said layered software application, said software development layer representing a unique version of said layered software application; a file manager coupled to said storage area, said file manager for opening a class file stored within said layer file folder, said class file represents said class of said layered software application and said class file for storing a software application class implemented in said software development layer; and a write manager coupled to said storage area, said write manager for writing textual information into said class file of said layer file folder, said textual information defining a said method implemented as part of said class in said software development layer. 20. The system of claim 15 , wherein said write manager is configured to write a class header into said class file, said class header comprising information for defining a formalized structure of operation for any methods implemented within said software application class. | 0.526967 |
1. A computer-based method for detecting anomalies in the traffic passing through an internet protocol (IP) network, said method comprising: extracting, from a database, a single instance of each unique packet header associated with a plurality of IP-to-IP packets, the IP-to-IP packets having been transmitted across the IP network over a predefined period of time; analyzing by a computer the packet headers to identify anomalous conversations based on at least one of a conversation uniqueness, a time of week uniqueness, and a data quantity uniqueness; and providing by the computer alerts corresponding to detected anomalous conversations. | 1. A computer-based method for detecting anomalies in the traffic passing through an internet protocol (IP) network, said method comprising: extracting, from a database, a single instance of each unique packet header associated with a plurality of IP-to-IP packets, the IP-to-IP packets having been transmitted across the IP network over a predefined period of time; analyzing by a computer the packet headers to identify anomalous conversations based on at least one of a conversation uniqueness, a time of week uniqueness, and a data quantity uniqueness; and providing by the computer alerts corresponding to detected anomalous conversations. 6. The method of claim 1 , wherein said analyzing the packet headers to identify anomalous conversations based on a data quantity uniqueness comprises determining whether a particular conversation conducted on the IP network has used a statistically different amount of bandwidth in a given hour of the week over a historical and statistically relevant period. | 0.62521 |
9. The mobile device of claim 8 , further comprising: a display configured to display a list of e-books. | 9. The mobile device of claim 8 , further comprising: a display configured to display a list of e-books. 11. The mobile device of claim 9 , wherein the display is further configured to output at least one of: a list output screen, when the e-book has e-book auxiliary content, for showing pages and words, serving as items, included in the e-book auxiliary content, according to a user's inputs; or a text output screen where the words to which the e-book auxiliary content are applied are displayed differently from other words on a same page of the e-book. | 0.865998 |
7. A software application lifecycle management platform computing device, comprising at least one processor and a memory coupled to the processor which is configured to execute programmed instructions comprising and stored in the memory to: obtain software application related data and one or more outcomes of prior corresponding software application deliveries from at least one of a knowledge repository or a learning repository based on the software application related data; generate a set of models based on the outcomes of the prior corresponding software application deliveries wherein the generating further comprises deriving a confidence level for each of the set of models, generating a search query based on the software application related data, and searching the knowledge repository for the outcomes of the prior corresponding software application deliveries based on the search query, wherein the searching is executed against the learning repository when there is no match in the knowledge repository; and output one or more options for selection based on the set of models along with the corresponding confidence level. | 7. A software application lifecycle management platform computing device, comprising at least one processor and a memory coupled to the processor which is configured to execute programmed instructions comprising and stored in the memory to: obtain software application related data and one or more outcomes of prior corresponding software application deliveries from at least one of a knowledge repository or a learning repository based on the software application related data; generate a set of models based on the outcomes of the prior corresponding software application deliveries wherein the generating further comprises deriving a confidence level for each of the set of models, generating a search query based on the software application related data, and searching the knowledge repository for the outcomes of the prior corresponding software application deliveries based on the search query, wherein the searching is executed against the learning repository when there is no match in the knowledge repository; and output one or more options for selection based on the set of models along with the corresponding confidence level. 8. The software application lifecycle management platform computing device of claim 7 , wherein the processor coupled to the memory is further configured to execute at least one additional programmed instruction to prompt a user to input a required outcome and a decision factor via a provided user interface, wherein the decision factor comprises a combination of input and desired output factors and requirement-to-requirement modeling, requirement-to-tasks modeling, requirement-to-test cases modeling, test cases-to-test cases modeling, or requirement-to-end-to-end solution modeling. | 0.506039 |
10. A computer-readable storage medium having computer-executable instructions for implementing a method of communicating between a requesting process and a serving process, the computer executable instructions comprising instructions for: processing an unmanaged Internet protocol context call from an Internet application; providing direct access to managed Internet protocol context information in response to the unmanaged Internet protocol context call via an unmanaged Internet protocol context class which corresponds to a managed Internet protocol context class, wherein the unmanaged Internet protocol context call is not native to a system processing the unmanaged Internet protocol context class call, and wherein the unmanaged Internet protocol context class is native to the system processing the unmanaged Internet protocol context class call and wherein the unmanaged Internet protocol context class is natively mapped within the system to a corresponding managed Internet protocol context class native to the system and written in a managed programming language, whereby the mapped unmanaged Internet protocol context class is represented as native within the system to the corresponding managed Internet protocol context class; interacting with the corresponding managed Internet protocol context class, whereby the mapped unmanaged Internet protocol context class is used to communicate directly and natively on the system with the corresponding managed Internet protocol context class; and providing a response to the unmanaged Internet protocol context call based on the managed Internet protocol context information in response to interacting with the corresponding managed Internet protocol context class. | 10. A computer-readable storage medium having computer-executable instructions for implementing a method of communicating between a requesting process and a serving process, the computer executable instructions comprising instructions for: processing an unmanaged Internet protocol context call from an Internet application; providing direct access to managed Internet protocol context information in response to the unmanaged Internet protocol context call via an unmanaged Internet protocol context class which corresponds to a managed Internet protocol context class, wherein the unmanaged Internet protocol context call is not native to a system processing the unmanaged Internet protocol context class call, and wherein the unmanaged Internet protocol context class is native to the system processing the unmanaged Internet protocol context class call and wherein the unmanaged Internet protocol context class is natively mapped within the system to a corresponding managed Internet protocol context class native to the system and written in a managed programming language, whereby the mapped unmanaged Internet protocol context class is represented as native within the system to the corresponding managed Internet protocol context class; interacting with the corresponding managed Internet protocol context class, whereby the mapped unmanaged Internet protocol context class is used to communicate directly and natively on the system with the corresponding managed Internet protocol context class; and providing a response to the unmanaged Internet protocol context call based on the managed Internet protocol context information in response to interacting with the corresponding managed Internet protocol context class. 14. The computer-readable storage medium of claim 10 , wherein providing a response to the unmanaged Internet protocol context call based on the managed Internet protocol context information comprises one or more of the group consisting of: reading, by the serving process, Internet protocol context information in the unmanaged programming language; and writing, by the serving process, Internet protocol context information in the unmanaged programming language. | 0.781043 |
31. A computer executable method for determining metadata to be assigned to a document, the method comprising: identifying a document to be published to a collection of documents organized according to a hierarchical taxonomy, wherein each of a plurality of documents included in the collection of documents is associated with one or more knowledge categories included in the hierarchical taxonomy; applying a trained text classifier to the identified document, wherein the trained text classifier identifies one or more recommended knowledge categories from the hierarchical taxonomy based on content of the identified document; presenting the one or more recommended knowledge categories to a user; enabling the user to expand at least one knowledge category included in the one or more recommended knowledge categories to present one or more related knowledge categories included in the hierarchical taxonomy, wherein the related knowledge categories include: one or more knowledge categories at a next more general level in the hierarchical taxonomy than the at least one knowledge category; and one or more knowledge categories at a next more specific level in the hierarchical taxonomy than the at least one knowledge category; enabling the user to make a selection of at least one selected knowledge category for the document from the one or more recommended knowledge categories and the one or more related knowledge categories; and assigning the at least one selected knowledge category as metadata in publishing the document to the collection of documents. | 31. A computer executable method for determining metadata to be assigned to a document, the method comprising: identifying a document to be published to a collection of documents organized according to a hierarchical taxonomy, wherein each of a plurality of documents included in the collection of documents is associated with one or more knowledge categories included in the hierarchical taxonomy; applying a trained text classifier to the identified document, wherein the trained text classifier identifies one or more recommended knowledge categories from the hierarchical taxonomy based on content of the identified document; presenting the one or more recommended knowledge categories to a user; enabling the user to expand at least one knowledge category included in the one or more recommended knowledge categories to present one or more related knowledge categories included in the hierarchical taxonomy, wherein the related knowledge categories include: one or more knowledge categories at a next more general level in the hierarchical taxonomy than the at least one knowledge category; and one or more knowledge categories at a next more specific level in the hierarchical taxonomy than the at least one knowledge category; enabling the user to make a selection of at least one selected knowledge category for the document from the one or more recommended knowledge categories and the one or more related knowledge categories; and assigning the at least one selected knowledge category as metadata in publishing the document to the collection of documents. 39. The computer executable method of claim 31 , further comprising enabling the at least one selected knowledge category to be removed from association with the document. | 0.608739 |
12. A method for conducting a query-based search in documents as claimed in claim 11 , wherein the matching search results are divided into two lists, a first list comprising the matching search results uncovered during the search obtained through a result handler and a second list comprising the extracted categories. | 12. A method for conducting a query-based search in documents as claimed in claim 11 , wherein the matching search results are divided into two lists, a first list comprising the matching search results uncovered during the search obtained through a result handler and a second list comprising the extracted categories. 13. A method for conducting a query-based search in documents as claimed in claim 12 , wherein the matching search results are presented as a browsable tree structure. | 0.919735 |
1. A computer-implemented method for automated analysis of web source content, the method comprising: analyzing a web site structure to identify web page documents of the web site; for the web page documents: i. defining text fragments and their types based on content marking by content tags; ii. deriving terms from a dictionary; iii. finding the terms within the text fragments; iv. determining a suspiciousness parameter value of the text by counting a number of terms with a lexical property “suspicious” in the text fragment, wherein the suspiciousness parameter is “true” if a predetermined number of terms with the “suspicious” lexical property is found in the text; v. determining a genre of the web page document; vi. defining thematic properties of the text of the web page document based on the thematic characteristics of terms found in the text; vii. saving the genre and thematic properties of the text in a document index; viii. finding “child” web page documents linked to the web page documents that have the “suspicious” status and assigning the “suspicious” status to the “child” web page documents; ix. repeating analysis of the text of the web page document if the “suspicious” status is changed; determining a genre of the web site based on the genres of the web page documents; saving the site genre property into a site index; calculating a document disallowance parameter based on rules for all of the web site documents with the “suspicious” status and saving the disallowance parameters into web site document indices; assigning a “disallowed” status to the web page documents if its disallowance parameter exceeds a threshold; saving the “disallowed” status to the web page documents into a web page index; finding a document with a maximum value of the disallowance parameter in a web site index and saving the disallowance parameter as a site disallowance parameter; assigning the “disallowed” status to the web site if its disallowance parameter exceeds a threshold; and blocking the web site based on the “disallowed” status of the web site, wherein the rules include the thematic properties of the texts of the web page documents, genre properties of the web page documents and a genre property of the web site. | 1. A computer-implemented method for automated analysis of web source content, the method comprising: analyzing a web site structure to identify web page documents of the web site; for the web page documents: i. defining text fragments and their types based on content marking by content tags; ii. deriving terms from a dictionary; iii. finding the terms within the text fragments; iv. determining a suspiciousness parameter value of the text by counting a number of terms with a lexical property “suspicious” in the text fragment, wherein the suspiciousness parameter is “true” if a predetermined number of terms with the “suspicious” lexical property is found in the text; v. determining a genre of the web page document; vi. defining thematic properties of the text of the web page document based on the thematic characteristics of terms found in the text; vii. saving the genre and thematic properties of the text in a document index; viii. finding “child” web page documents linked to the web page documents that have the “suspicious” status and assigning the “suspicious” status to the “child” web page documents; ix. repeating analysis of the text of the web page document if the “suspicious” status is changed; determining a genre of the web site based on the genres of the web page documents; saving the site genre property into a site index; calculating a document disallowance parameter based on rules for all of the web site documents with the “suspicious” status and saving the disallowance parameters into web site document indices; assigning a “disallowed” status to the web page documents if its disallowance parameter exceeds a threshold; saving the “disallowed” status to the web page documents into a web page index; finding a document with a maximum value of the disallowance parameter in a web site index and saving the disallowance parameter as a site disallowance parameter; assigning the “disallowed” status to the web site if its disallowance parameter exceeds a threshold; and blocking the web site based on the “disallowed” status of the web site, wherein the rules include the thematic properties of the texts of the web page documents, genre properties of the web page documents and a genre property of the web site. 16. A non-transitory computer storage medium storing computer code for executing the steps of claim 1 . | 0.563928 |
18. The method as claimed in claim 15 , wherein generating the segmentation rules including the series of filters comprises: providing a higher level user interface that provides higher level conceptual metaphors that allow the user to generate rules; and generating rules based on user's input through the higher level user interface. | 18. The method as claimed in claim 15 , wherein generating the segmentation rules including the series of filters comprises: providing a higher level user interface that provides higher level conceptual metaphors that allow the user to generate rules; and generating rules based on user's input through the higher level user interface. 19. The method as claimed in claim 18 , wherein providing the higher level user interface comprises: providing an interactive graphical representation of data to allow the user to visually set segments. | 0.870698 |
1. A computer-implemented method for managing access to electronic documents, the computer-implemented method comprising: at a network device, detecting a request to access a particular electronic document stored on the network device; and in response to detecting the request to access the particular electronic document stored on the network device, applying a document retention policy to the particular electronic document by: determining that the particular electronic document belongs to a particular electronic document retention classification from a plurality of electronic document retention classifications, retrieving document retention policy data for the particular electronic document retention classification, wherein the document retention policy data for the particular document retention classification specifies one or more deletion criteria for the particular document retention classification, determining whether any of the one or more deletion criteria for the particular electronic document retention classification are satisfied, if any of the one or more deletion criteria for the particular electronic document retention classification are satisfied, then causing the particular electronic document to be deleted, if none of the one or more deletion criteria for the particular electronic document retention classification are satisfied, then applying a document security policy to the particular electronic document by: determining that the particular electronic document belongs to a particular document security classification from the plurality of document security classifications, retrieving document security policy data for the particular document security classification, wherein the document security policy data for the particular document security classification specifies one or more access criteria for the particular document security classification, determining, based upon the one or more access criteria for the particular document security classification and one or more attributes of a user associated with the request to access the particular electronic document, whether the user is authorized to access the particular electronic document, and if the user is not authorized to access the particular electronic document, then preventing access to the particular electronic document. | 1. A computer-implemented method for managing access to electronic documents, the computer-implemented method comprising: at a network device, detecting a request to access a particular electronic document stored on the network device; and in response to detecting the request to access the particular electronic document stored on the network device, applying a document retention policy to the particular electronic document by: determining that the particular electronic document belongs to a particular electronic document retention classification from a plurality of electronic document retention classifications, retrieving document retention policy data for the particular electronic document retention classification, wherein the document retention policy data for the particular document retention classification specifies one or more deletion criteria for the particular document retention classification, determining whether any of the one or more deletion criteria for the particular electronic document retention classification are satisfied, if any of the one or more deletion criteria for the particular electronic document retention classification are satisfied, then causing the particular electronic document to be deleted, if none of the one or more deletion criteria for the particular electronic document retention classification are satisfied, then applying a document security policy to the particular electronic document by: determining that the particular electronic document belongs to a particular document security classification from the plurality of document security classifications, retrieving document security policy data for the particular document security classification, wherein the document security policy data for the particular document security classification specifies one or more access criteria for the particular document security classification, determining, based upon the one or more access criteria for the particular document security classification and one or more attributes of a user associated with the request to access the particular electronic document, whether the user is authorized to access the particular electronic document, and if the user is not authorized to access the particular electronic document, then preventing access to the particular electronic document. 8. The computer-implemented method as recited in claim 1 , further comprising generating self-executing data which, when processed by one or more processors, causes performance of the steps in response to detecting the request to access the particular electronic document stored on the network device. | 0.81851 |
1. A document processing apparatus for importing a specified first document file into a second document file to be edited, comprising: a determination unit adapted to determine whether or not security information is added to the first document file; an import controller that imports the first document file with the security information into the second document file in order to generate a third document file, if the determination unit determines that the security information is added to the first document file; a receiving unit adapted to receive an instruction for editing the third document file in a unit of a page included in the third document file; an edition controller that, if edit prohibition security information is added to the first document file, permits editing the third document file by movement of all pages which are imported from the first document file into the third document file, and prohibits editing the third document file by editing of each page among the pages imported from the first document file; an adding unit adapted to add additional information to a page based on the first document file; a control unit adapted to cause printing based on the additional information added by the adding unit; and an export control unit adapted to export the first document file including the security information from the third document file, wherein the export control unit exports the first document file excluding the additional information, wherein a processor is configured to function as said edition controller, and wherein said edition controller relocates pages of the third document file without changing the location of pages in the first document file. | 1. A document processing apparatus for importing a specified first document file into a second document file to be edited, comprising: a determination unit adapted to determine whether or not security information is added to the first document file; an import controller that imports the first document file with the security information into the second document file in order to generate a third document file, if the determination unit determines that the security information is added to the first document file; a receiving unit adapted to receive an instruction for editing the third document file in a unit of a page included in the third document file; an edition controller that, if edit prohibition security information is added to the first document file, permits editing the third document file by movement of all pages which are imported from the first document file into the third document file, and prohibits editing the third document file by editing of each page among the pages imported from the first document file; an adding unit adapted to add additional information to a page based on the first document file; a control unit adapted to cause printing based on the additional information added by the adding unit; and an export control unit adapted to export the first document file including the security information from the third document file, wherein the export control unit exports the first document file excluding the additional information, wherein a processor is configured to function as said edition controller, and wherein said edition controller relocates pages of the third document file without changing the location of pages in the first document file. 2. The document processing method according to claim 1 , further comprising a restriction message displaying step of displaying a message for restricting an operation on the third document file generated as a result of importing of the first document file to which security information is added. | 0.5 |
9. The method according to claim 8 , wherein said filtering and re-ordering comprises: evaluating the binary logic formula; and adding a redacted document to the redacted search results if the binary logic formula evaluates to true. | 9. The method according to claim 8 , wherein said filtering and re-ordering comprises: evaluating the binary logic formula; and adding a redacted document to the redacted search results if the binary logic formula evaluates to true. 10. The method according to claim 9 , wherein said filtering and re-ordering comprises hiding the redacted document from the redacted search results if the binary logic formula evaluates to false. | 0.869128 |
12. A method of generating and storing a plurality of definitions to be applied to a plurality of electronic files as metadata, by execution of computer readable program code by at least one processor of at least one computer system, comprising: providing a multi-level database comprising a plurality of terms, wherein each term of the plurality of terms is included in the multi-level database once and only once, said plurality of terms comprising a plurality of first-level terms having a first common theme and a plurality of second-level terms having a second common theme, said multi-level database further comprising a plurality of numeric first-level term codes and a plurality of numeric second-level term codes, wherein each first-level term is assigned a numeric first-level term code of the plurality of numeric first-level term codes, and each second-level term is assigned a numeric second-level term code of the plurality of numeric second-level term codes, wherein the multi-level database is divided into a plurality of sections including a first section and a second section, said first section comprising a plurality of first-level tables, a plurality of numeric first-level table codes, and a first node table, wherein each first-level table is assigned a numeric first-level table code of the plurality of numeric first-level table codes, and the plurality of first-level terms and the plurality of numeric first-level term codes are located in the plurality of first-level tables, said second section comprising a plurality of second-level tables, a plurality of numeric second-level table codes, and a second node table, wherein each second-level table of the plurality of second-level tables is assigned a numeric second-level table code of the plurality of numeric second-level table codes, and the plurality of second-level terms and the plurality of numeric second-level term codes are located in the plurality of second-level tables, wherein the first section communicates with the second section through the first node table and the second node table; forming a first code string in the first node table, by joining together at least one numeric first-level term code from a first-level table of the plurality of first-level tables, at least one numeric first-level table code, and first-level code language describing the location and relations of said first-level table, using at least one of the processors; forming a second code string in the second node table, by joining together at least one numeric second-level term code from a second-level table of the plurality of second-level tables, at least one numeric second-level table code, and second-level code language describing the location and relations of said second-level table, using at least one of the processors; forming a combined code string in the second node table, by joining together the first code string and the second code string, using at least one of the processors; creating a plurality of definitions, each definition comprising a final code string, wherein each final code string is formed in a final node table of the multi-level database, using at least one of the processors; and joining each definition of the plurality of definitions with a defined word and phrase of a plurality of defined words and phrases, using at least one of the processors, wherein the plurality of definitions and the plurality of defined words and phrases function as an industry-specific electronic dictionary. | 12. A method of generating and storing a plurality of definitions to be applied to a plurality of electronic files as metadata, by execution of computer readable program code by at least one processor of at least one computer system, comprising: providing a multi-level database comprising a plurality of terms, wherein each term of the plurality of terms is included in the multi-level database once and only once, said plurality of terms comprising a plurality of first-level terms having a first common theme and a plurality of second-level terms having a second common theme, said multi-level database further comprising a plurality of numeric first-level term codes and a plurality of numeric second-level term codes, wherein each first-level term is assigned a numeric first-level term code of the plurality of numeric first-level term codes, and each second-level term is assigned a numeric second-level term code of the plurality of numeric second-level term codes, wherein the multi-level database is divided into a plurality of sections including a first section and a second section, said first section comprising a plurality of first-level tables, a plurality of numeric first-level table codes, and a first node table, wherein each first-level table is assigned a numeric first-level table code of the plurality of numeric first-level table codes, and the plurality of first-level terms and the plurality of numeric first-level term codes are located in the plurality of first-level tables, said second section comprising a plurality of second-level tables, a plurality of numeric second-level table codes, and a second node table, wherein each second-level table of the plurality of second-level tables is assigned a numeric second-level table code of the plurality of numeric second-level table codes, and the plurality of second-level terms and the plurality of numeric second-level term codes are located in the plurality of second-level tables, wherein the first section communicates with the second section through the first node table and the second node table; forming a first code string in the first node table, by joining together at least one numeric first-level term code from a first-level table of the plurality of first-level tables, at least one numeric first-level table code, and first-level code language describing the location and relations of said first-level table, using at least one of the processors; forming a second code string in the second node table, by joining together at least one numeric second-level term code from a second-level table of the plurality of second-level tables, at least one numeric second-level table code, and second-level code language describing the location and relations of said second-level table, using at least one of the processors; forming a combined code string in the second node table, by joining together the first code string and the second code string, using at least one of the processors; creating a plurality of definitions, each definition comprising a final code string, wherein each final code string is formed in a final node table of the multi-level database, using at least one of the processors; and joining each definition of the plurality of definitions with a defined word and phrase of a plurality of defined words and phrases, using at least one of the processors, wherein the plurality of definitions and the plurality of defined words and phrases function as an industry-specific electronic dictionary. 17. The method of claim 12 , wherein the plurality of electronic files includes health care data, further comprising segregating sensitive data of the health care data from non-sensitive data of the health care data, using at least one of the processors. | 0.777024 |
3. The system of claim 1 wherein the hyperlink includes a link label. | 3. The system of claim 1 wherein the hyperlink includes a link label. 4. The system of claim 3 wherein the link label is the textual representation. | 0.970977 |
11. A computerized system for classifying and redacting an email message for distributing to multiple recipients having different security levels, the system comprising: a processor; a non-transitory computer readable storage medium having computer readable instructions stored thereon for execution by the processor, causing the processor to: select a segment of the email message; automatically analyze contents of the selected segment in real time by using an artificial intelligence (AI) system; automatically classify the segment, based on results of the analysis performed by the artificial intelligence system, and in accordance with a set of classification options characterizing a type of information contained in the segment; automatically mark the segment in accordance with a respective classification option to produce a marked segment; automatically classify the email message based on classifications of segments of the email message; and automatically redact the email message in real time in accordance with a respective clearance level of a recipient of the email message, producing a redacted email message, comprising: (i) arranging recipients of the email message in a hierarchy in accordance with respective clearance levels such that a recipient with a higher clearance level occupies a higher level in the hierarchy in comparison to a recipient with a lower clearance level; and (ii) automatically distributing the redacted email message to the recipients of a particular level in the hierarchy concurrently with the redacting marked segments for the recipients at the immediate lower level in the hierarchy. | 11. A computerized system for classifying and redacting an email message for distributing to multiple recipients having different security levels, the system comprising: a processor; a non-transitory computer readable storage medium having computer readable instructions stored thereon for execution by the processor, causing the processor to: select a segment of the email message; automatically analyze contents of the selected segment in real time by using an artificial intelligence (AI) system; automatically classify the segment, based on results of the analysis performed by the artificial intelligence system, and in accordance with a set of classification options characterizing a type of information contained in the segment; automatically mark the segment in accordance with a respective classification option to produce a marked segment; automatically classify the email message based on classifications of segments of the email message; and automatically redact the email message in real time in accordance with a respective clearance level of a recipient of the email message, producing a redacted email message, comprising: (i) arranging recipients of the email message in a hierarchy in accordance with respective clearance levels such that a recipient with a higher clearance level occupies a higher level in the hierarchy in comparison to a recipient with a lower clearance level; and (ii) automatically distributing the redacted email message to the recipients of a particular level in the hierarchy concurrently with the redacting marked segments for the recipients at the immediate lower level in the hierarchy. 16. The system of claim 11 , wherein the AI is a decision tree AI system, comprising decision nodes and conclusion nodes, each decision node having outcomes connecting the decision node to another decision node or to the conclusion node. | 0.533446 |
13. A computer program product comprising a non-transitory computer-readable storage medium containing computer program code for performing the steps: receiving from a user an utterance in a first language including a first term; translating, by a speech translation system, the utterance in the first language into a second language; receiving an indication from the user to initiate a user customization process for customizing one or more modules of the speech translation system to the user; and under the user customization process: receiving an indication from the user to add the first term to one or more modules of the speech translation system; in response to the received indication from the user, determining word class information for the first term; adding by the speech translation system the first term, the determined word class information, and at least a portion of the translation of the utterance in the second language to a first machine translation module associated with the first language of the speech translation system; and adding the first term and the at least a portion of the translation of the utterance in the second language to a shared database for a community such that the customization performed by the user is available for use by other users of the community in translations by the speech translation system. | 13. A computer program product comprising a non-transitory computer-readable storage medium containing computer program code for performing the steps: receiving from a user an utterance in a first language including a first term; translating, by a speech translation system, the utterance in the first language into a second language; receiving an indication from the user to initiate a user customization process for customizing one or more modules of the speech translation system to the user; and under the user customization process: receiving an indication from the user to add the first term to one or more modules of the speech translation system; in response to the received indication from the user, determining word class information for the first term; adding by the speech translation system the first term, the determined word class information, and at least a portion of the translation of the utterance in the second language to a first machine translation module associated with the first language of the speech translation system; and adding the first term and the at least a portion of the translation of the utterance in the second language to a shared database for a community such that the customization performed by the user is available for use by other users of the community in translations by the speech translation system. 21. The computer program product of claim 13 , further comprising computer program code for performing the steps: in response to the received indication from the user, determining a pronunciation in the first language for the first term; and adding the first term, the determined word class information, and the pronunciation in the first language to a first recognition lexicon of the first language of a first automatic speech recognition module of the speech translation system. | 0.5 |
16. The transformation apparatus according to claim 11 , said optimizer: building a dependency graph in accordance with dependency relations amongst predicates in said logic rules, wherein every node corresponds to one predicate in said logic rules and dependency relations amongst respective predicates are denoted by directed edges among nodes; and optimizing said logic rules in accordance with said dependency graph. | 16. The transformation apparatus according to claim 11 , said optimizer: building a dependency graph in accordance with dependency relations amongst predicates in said logic rules, wherein every node corresponds to one predicate in said logic rules and dependency relations amongst respective predicates are denoted by directed edges among nodes; and optimizing said logic rules in accordance with said dependency graph. 17. The transformation apparatus according to claim 16 , said optimizing said logic rules in accordance with said dependency graph comprising: said computing device generating an optimal processing order for predicates, in accordance with said dependency graph; and said computing device pushing constraints in higher level predicates of said dependency graph downwards to lower level predicates of said dependency graph. | 0.878368 |
1. A computer-implemented method of organizing a collection of documents, the computer implemented method comprising: identifying at a server a plurality of documents responsive to a search query; accessing at the server usage information associated with the plurality of documents, the usage information including, for each document, a frequency of visit value based on a number of times the document was visited during a time period and a unique visit value based on a number of unique visitors to the document; determining at the server, for each document, a usage score from the frequency of visit value and the unique visit value associated with the document; and organizing at the server the plurality of documents based, in part, on the usage scores for the documents. | 1. A computer-implemented method of organizing a collection of documents, the computer implemented method comprising: identifying at a server a plurality of documents responsive to a search query; accessing at the server usage information associated with the plurality of documents, the usage information including, for each document, a frequency of visit value based on a number of times the document was visited during a time period and a unique visit value based on a number of unique visitors to the document; determining at the server, for each document, a usage score from the frequency of visit value and the unique visit value associated with the document; and organizing at the server the plurality of documents based, in part, on the usage scores for the documents. 8. The computer-implemented method of claim 1 , wherein, for each document, the frequency of visit value is equal to a percentage change based on the number times the document was visited during the time period and the number of times the document was visited during a previous time period. | 0.764354 |
1. A data processing method based on collective document data containing sentences by different writers for generating a candidate synonym for an object word used in the document data, the data processing method comprising the steps of: inputting the object word as a concept for candidate synonyms; generating at least one piece of partial data of the collective document data for a writer, the partial data containing only the sentences by the writer; extracting words contained in the collective document data based on the object word by calculating degrees of relatedness between the extracted words and the object word, and generating a first set of candidate synonyms, which has as elements for the first set, a predetermined number of the extracted words ranked highest in descending order of the degree of relatedness; extracting words contained in the partial data based on the object word by calculating degrees of relatedness between the extracted words in the partial data and the object word, and generating a second set of candidate synonyms for the writer, which has as elements for the second set, a predetermined number of the extracted words ranked highest in descending order of the degree of relatedness; evaluating, among the words contained in the first set of candidate synonyms, the words of the first set, which are matched with the words ranked in places equal to or higher than a threshold value place in any of the second sets of candidate synonyms, are evaluated to be absolute, wherein said absolute, is a definitive candidate synonym; evaluating, among the words contained in the first set of candidate synonyms except the words evaluated to be absolute, the words of the first set, which are matched with the words ranked in places lower than the threshold value place in any of the second sets of candidate synonyms, are evaluated to be negative, wherein said negative is not a definitive candidate synonym; and generating the candidate synonyms for the object word from the words of the first set of candidate synonyms by excluding the words evaluated to be negative, wherein the calculation of the degrees of relatedness is realized by the steps of: extracting all words of a first word class and all words of a second word class from the document data or the partial data, the words of the second word class having modification relations with the words of the first word class; generating a matrix using all the extracted words of the first word class and all the extracted words of the second class as indices of rows or columns thereof, the matrix having a size of the number of the words of the first word class by the number of the words of the second word class; substituting a frequency of the modification relation between the word of the first word class and the word of the second word class with elements for the matrix and indexing each element of the elements into the matrix; extracting said each element of the elements of the row or column having the word of the first word class matching the object word from the matrix generated based on the document data to set the row or column as an object word vector; extracting each element of the elements of an arbitrary row or an arbitrary column from the matrix generated based on the document data or the partial data; setting the row or column as a vector of the word of the first word class indicated by the row or column; and calculating a degree of relatedness of the word of the first word class with the object word by taking a scalar product of the vector of the word of the first word class and the object word vector. | 1. A data processing method based on collective document data containing sentences by different writers for generating a candidate synonym for an object word used in the document data, the data processing method comprising the steps of: inputting the object word as a concept for candidate synonyms; generating at least one piece of partial data of the collective document data for a writer, the partial data containing only the sentences by the writer; extracting words contained in the collective document data based on the object word by calculating degrees of relatedness between the extracted words and the object word, and generating a first set of candidate synonyms, which has as elements for the first set, a predetermined number of the extracted words ranked highest in descending order of the degree of relatedness; extracting words contained in the partial data based on the object word by calculating degrees of relatedness between the extracted words in the partial data and the object word, and generating a second set of candidate synonyms for the writer, which has as elements for the second set, a predetermined number of the extracted words ranked highest in descending order of the degree of relatedness; evaluating, among the words contained in the first set of candidate synonyms, the words of the first set, which are matched with the words ranked in places equal to or higher than a threshold value place in any of the second sets of candidate synonyms, are evaluated to be absolute, wherein said absolute, is a definitive candidate synonym; evaluating, among the words contained in the first set of candidate synonyms except the words evaluated to be absolute, the words of the first set, which are matched with the words ranked in places lower than the threshold value place in any of the second sets of candidate synonyms, are evaluated to be negative, wherein said negative is not a definitive candidate synonym; and generating the candidate synonyms for the object word from the words of the first set of candidate synonyms by excluding the words evaluated to be negative, wherein the calculation of the degrees of relatedness is realized by the steps of: extracting all words of a first word class and all words of a second word class from the document data or the partial data, the words of the second word class having modification relations with the words of the first word class; generating a matrix using all the extracted words of the first word class and all the extracted words of the second class as indices of rows or columns thereof, the matrix having a size of the number of the words of the first word class by the number of the words of the second word class; substituting a frequency of the modification relation between the word of the first word class and the word of the second word class with elements for the matrix and indexing each element of the elements into the matrix; extracting said each element of the elements of the row or column having the word of the first word class matching the object word from the matrix generated based on the document data to set the row or column as an object word vector; extracting each element of the elements of an arbitrary row or an arbitrary column from the matrix generated based on the document data or the partial data; setting the row or column as a vector of the word of the first word class indicated by the row or column; and calculating a degree of relatedness of the word of the first word class with the object word by taking a scalar product of the vector of the word of the first word class and the object word vector. 6. The data processing method according to claim 1 , further comprising the step of removing the noun from objects of the calculation of the degrees of relatedness, if the frequency of a noun appearing in the document data or the partial data is lower than a predetermined frequency. | 0.602592 |
1. A system for assessing copyright fees based on the content being copied, comprising: a processor; a scanning module operable to scan a document comprising at least one page; a content identifying module operable to identify a content on each scanned page of the document and comprising an Optical Character Recognition (OCR) engine operable to extract a stream of text from each scanned page of the document; and a copyright holder identifying module operable to identify a copyright holder of the identified content; wherein the identifying a copyright holder of the identified content comprises: processing the stream of text into contiguous text segments; forming a separate query for each of the contiguous text segments; and searching a copyrighted content database for matching copyrighted content based on the query; wherein the processing the stream of text into contiguous text segments is based on textual coherence determined in accordance with linguistic analysis of the scanned text. | 1. A system for assessing copyright fees based on the content being copied, comprising: a processor; a scanning module operable to scan a document comprising at least one page; a content identifying module operable to identify a content on each scanned page of the document and comprising an Optical Character Recognition (OCR) engine operable to extract a stream of text from each scanned page of the document; and a copyright holder identifying module operable to identify a copyright holder of the identified content; wherein the identifying a copyright holder of the identified content comprises: processing the stream of text into contiguous text segments; forming a separate query for each of the contiguous text segments; and searching a copyrighted content database for matching copyrighted content based on the query; wherein the processing the stream of text into contiguous text segments is based on textual coherence determined in accordance with linguistic analysis of the scanned text. 5. The system of claim 1 wherein the copyright holder identifying module is further operable to identify copyrighted content and wherein the copyright holder is remunerated for copying of the copyrighted content. | 0.560606 |
1. A system for identifying keywords in search results comprising: a processor; a memory coupled to the processor, wherein the memory includes instructions that when executed by the processor perform operations comprising: connecting a plurality of neurons as a bidirectional neural network, the neurons being associated with words and documents, the neurons associated with words forming a first layer, and the neurons associated with documents forming a second layer, each neuron having multiple inputs from other neurons, a single output connecting the neuron to other neurons, and a threshold function at the single output, wherein at least some of the neurons of the first layer have connections between them and represent keywords in the documents; displaying to a user, on a display device, words of the search query and additional keywords from the documents and identifying the neurons that correspond to keywords associated with at least one of the documents; and changing positions of the keywords on a display relative to each other based on input from the user, wherein the change in position of one keyword changes the position of other displayed keywords. | 1. A system for identifying keywords in search results comprising: a processor; a memory coupled to the processor, wherein the memory includes instructions that when executed by the processor perform operations comprising: connecting a plurality of neurons as a bidirectional neural network, the neurons being associated with words and documents, the neurons associated with words forming a first layer, and the neurons associated with documents forming a second layer, each neuron having multiple inputs from other neurons, a single output connecting the neuron to other neurons, and a threshold function at the single output, wherein at least some of the neurons of the first layer have connections between them and represent keywords in the documents; displaying to a user, on a display device, words of the search query and additional keywords from the documents and identifying the neurons that correspond to keywords associated with at least one of the documents; and changing positions of the keywords on a display relative to each other based on input from the user, wherein the change in position of one keyword changes the position of other displayed keywords. 7. The system of claim 1 , wherein the keywords are generated based solely on a plurality of chosen documents. | 0.631136 |
5. The method of claim 1 , wherein calculating an aggregate probabilistic utility score further comprises: obtaining utility scores for each of the other candidate geographic locations, the utility scores being uniquely associated with the respective candidate geographic location; and calculating the aggregate probabilistic utility score based, at least in part, on the utility scores. | 5. The method of claim 1 , wherein calculating an aggregate probabilistic utility score further comprises: obtaining utility scores for each of the other candidate geographic locations, the utility scores being uniquely associated with the respective candidate geographic location; and calculating the aggregate probabilistic utility score based, at least in part, on the utility scores. 7. The method of claim 5 , wherein calculating the aggregate probabilistic utility score based, at least in part, on the utility scores further comprises: combining the candidate confidence level for the respective candidate geographic location with the utility scores. | 0.903145 |
1. A method for enabling structured communication among a social network including a computer, the method comprising: receiving, by the computer, input pertaining to a question; formulating by the computer the question based upon the input; generating by the computer an answer pattern including potential responses to the question based upon a form of the question; translating and transmitting by the computer a message including the question and the answer pattern having the potential responses to the question to a plurality of users over a corresponding plurality of preferred messaging platforms from among a plurality of different messaging platforms for eliciting responses to the question from two or more of the users using the answer pattern; collecting and aggregating by the computer the responses to the question from a corresponding two or more of the plurality of preferred messaging platforms; and presenting by the computer the responses in a summary format, wherein the plurality of preferred messaging platforms comprises, for each user of the plurality of users, a corresponding preferred messaging platform for that user from among the plurality of preferred messaging platforms. | 1. A method for enabling structured communication among a social network including a computer, the method comprising: receiving, by the computer, input pertaining to a question; formulating by the computer the question based upon the input; generating by the computer an answer pattern including potential responses to the question based upon a form of the question; translating and transmitting by the computer a message including the question and the answer pattern having the potential responses to the question to a plurality of users over a corresponding plurality of preferred messaging platforms from among a plurality of different messaging platforms for eliciting responses to the question from two or more of the users using the answer pattern; collecting and aggregating by the computer the responses to the question from a corresponding two or more of the plurality of preferred messaging platforms; and presenting by the computer the responses in a summary format, wherein the plurality of preferred messaging platforms comprises, for each user of the plurality of users, a corresponding preferred messaging platform for that user from among the plurality of preferred messaging platforms. 13. The method of claim 1 , further comprising receiving a response from an unregistered user. | 0.710669 |
1. One or more computer-readable storage media devices having computer-readable instructions thereon which, when executed, implement a method comprising: presenting a user interface that enables a user to create a tag that is to be used to tag one or more digital objects; defining the tag using the user interface; strongly typing the tag by providing a unique ID that is associated with an individual or group of people, wherein the tag is configured to associate a changeable property with the unique ID, the changeable property being a name, wherein different names associated with a same unique ID are automatically resolved to the same unique ID independent of a user resolving the different names; using the tag to present multiple user-selectable communication options to the user that the user can select, via a cursor, to cause initiation of a communication with a tagged entity, responsive to the user interacting with the one or more digital objects; and presenting the tag in a navigation tree that is displayed on the user interface and which includes a tag node that is expandable to expose a list of previously created tags. | 1. One or more computer-readable storage media devices having computer-readable instructions thereon which, when executed, implement a method comprising: presenting a user interface that enables a user to create a tag that is to be used to tag one or more digital objects; defining the tag using the user interface; strongly typing the tag by providing a unique ID that is associated with an individual or group of people, wherein the tag is configured to associate a changeable property with the unique ID, the changeable property being a name, wherein different names associated with a same unique ID are automatically resolved to the same unique ID independent of a user resolving the different names; using the tag to present multiple user-selectable communication options to the user that the user can select, via a cursor, to cause initiation of a communication with a tagged entity, responsive to the user interacting with the one or more digital objects; and presenting the tag in a navigation tree that is displayed on the user interface and which includes a tag node that is expandable to expose a list of previously created tags. 6. The one or more computer-readable storage media devices of claim 1 , wherein one of the user-selectable communication options comprises an email service. | 0.598443 |
1. One or more computer-readable storage devices that store executable instructions to provide search results, the executable instructions, when executed by a computer, causing the computer to perform acts comprising: receiving a query from a user; determining that the query is one to be asked to a person in addition to, or instead of, a search engine; comparing said query to a corpus of information to obtain objective results; comparing said query to a social graph to identify one or more people whose relationship to said user meets a closeness condition and who have an aspect of relevance to said query; creating person results that comprise said one or more people and, for each of said one or more people, an explanation of each person's relevance to said query, said social graph indicating attributes for people in said social graph, said explanation of a given person's relevance comprising an attribute that is indicated in said social graph for said given person, said attribute matching a term in said query; and providing, to said user, a set of results that comprise said objective results and said person results. | 1. One or more computer-readable storage devices that store executable instructions to provide search results, the executable instructions, when executed by a computer, causing the computer to perform acts comprising: receiving a query from a user; determining that the query is one to be asked to a person in addition to, or instead of, a search engine; comparing said query to a corpus of information to obtain objective results; comparing said query to a social graph to identify one or more people whose relationship to said user meets a closeness condition and who have an aspect of relevance to said query; creating person results that comprise said one or more people and, for each of said one or more people, an explanation of each person's relevance to said query, said social graph indicating attributes for people in said social graph, said explanation of a given person's relevance comprising an attribute that is indicated in said social graph for said given person, said attribute matching a term in said query; and providing, to said user, a set of results that comprise said objective results and said person results. 2. The one or more computer-readable storage devices of claim 1 , said aspect of relevance being based on a comparison of words in said query with attributes of people in said social graph. | 0.700524 |
15. The computing device of claim 13 , further comprising: a network adapter configured to communicatively couple to a peer client device, the peer client device assigned a kin status with the client device based on a similarity between the modified history log of media data usage of the client device and another history log of media data usage of the peer client device. | 15. The computing device of claim 13 , further comprising: a network adapter configured to communicatively couple to a peer client device, the peer client device assigned a kin status with the client device based on a similarity between the modified history log of media data usage of the client device and another history log of media data usage of the peer client device. 16. The computing device of claim 15 , further comprising instructions, which, when executed by the at least one processor, cause the at least one processor to group the client device and the peer client device based on a threshold parameter of a compatibility rating, the compatibility rating generated based on the kin status. | 0.757302 |
1. A method for validating documentation for at least one software functionality, comprising: determining, by at least one processor, one or more issues in one or more of a plurality of documentation topics that document at least one software functionality based at least upon applying one or more business rules to the one or more of the plurality of documentation topics, including one or more of: applying the one or more business rules to metadata of the one or more of the plurality of documentation topics to cross-reference the metadata of the one or more of the plurality of documentation topics with a semantic model for the at least one software functionality, applying the one or more business rules to content of the one or more of the plurality of documentation topics to cross-reference the content of the one or more of the plurality of documentation topics with the semantic model for the at least one software functionality, and applying the one or more business rules to metadata of the one or more of the plurality of documentation topics and metadata of one or more related documentation topics to test consistency between the metadata of the one or more of the plurality of documentation topics with the metadata of the one or more related documentation topics; and responsive to determining the one or more issues, inserting, by the at least one processor, one or more entries into an issues report, wherein the one or more entries include information regarding the one or more issues. | 1. A method for validating documentation for at least one software functionality, comprising: determining, by at least one processor, one or more issues in one or more of a plurality of documentation topics that document at least one software functionality based at least upon applying one or more business rules to the one or more of the plurality of documentation topics, including one or more of: applying the one or more business rules to metadata of the one or more of the plurality of documentation topics to cross-reference the metadata of the one or more of the plurality of documentation topics with a semantic model for the at least one software functionality, applying the one or more business rules to content of the one or more of the plurality of documentation topics to cross-reference the content of the one or more of the plurality of documentation topics with the semantic model for the at least one software functionality, and applying the one or more business rules to metadata of the one or more of the plurality of documentation topics and metadata of one or more related documentation topics to test consistency between the metadata of the one or more of the plurality of documentation topics with the metadata of the one or more related documentation topics; and responsive to determining the one or more issues, inserting, by the at least one processor, one or more entries into an issues report, wherein the one or more entries include information regarding the one or more issues. 10. The method of claim 1 , wherein the at least one software functionality comprises an interface for a web service. | 0.897747 |
1. A computer-implemented method for composing a valid HTML document using template transclusion, comprising: retrieving a transcluded template file including a transcluded template; retrieving a transcluding template file including a transcluding template, the transcluding template including credentials to the transcluded template; validating that a data-type of an input parameter in the transcluding template matches a data-type of the transcluded template; building a binary transcluded template object from the transcluded template and a binary transcluding template object from the transcluding template based on the validating; and uploading the binary transcluded template object and the binary transcluding template object to a server to generate the valid HTML document that is sent for display on a browser, wherein content in the valid HTML document associated with the transcluded template is included within content in the valid HTML document associated with the transcluding template. | 1. A computer-implemented method for composing a valid HTML document using template transclusion, comprising: retrieving a transcluded template file including a transcluded template; retrieving a transcluding template file including a transcluding template, the transcluding template including credentials to the transcluded template; validating that a data-type of an input parameter in the transcluding template matches a data-type of the transcluded template; building a binary transcluded template object from the transcluded template and a binary transcluding template object from the transcluding template based on the validating; and uploading the binary transcluded template object and the binary transcluding template object to a server to generate the valid HTML document that is sent for display on a browser, wherein content in the valid HTML document associated with the transcluded template is included within content in the valid HTML document associated with the transcluding template. 9. The computer-implemented method of claim 1 , wherein the transcluding template inherits the data-type from the protocol buffer. | 0.746729 |
4. The device as claimed in claim 1, further comprising first detection means connected to the first memory means and the input means for determining the equivalency of letters between one of the entry words and the first word, the first detection means being further connected to the addressing means and the inflection control means for controlling the operation thereof, and second detection means connected to the inflection control means and the input means for determining the equivalency of letters between the inflected words formed and the first word. | 4. The device as claimed in claim 1, further comprising first detection means connected to the first memory means and the input means for determining the equivalency of letters between one of the entry words and the first word, the first detection means being further connected to the addressing means and the inflection control means for controlling the operation thereof, and second detection means connected to the inflection control means and the input means for determining the equivalency of letters between the inflected words formed and the first word. 7. The device as claimed in claim 4, wherein the inflection control means comprises: means coupled to the second memory means for storing a particular rule pattern developed from the second memory means; fourth memory means for storing information used to change endings of a word for inflection purposes; second addressing means coupled to the storing means and the fourth memory means for selectively addressing the fourth memory in accordance with the particular rule pattern in the storing means so as to select a type of ending from the fourth memory means; and control means coupled to the fourth memory and the first memory means for inflecting one of the entry words from the first memory means using the ending selected from the fourth memory means. | 0.725767 |
8. The device as set forth in claim 2 , wherein performing the classification analysis further comprises: determining a complexity level of the first post; and performing the classification analysis based on the complexity level. | 8. The device as set forth in claim 2 , wherein performing the classification analysis further comprises: determining a complexity level of the first post; and performing the classification analysis based on the complexity level. 9. The device as set forth in claim 8 wherein the performing the classification analysis based on the complexity level further comprises performing a rules based classification analysis when the complexity level is below a threshold complexity level. | 0.904924 |
8. A method for segmenting an image, comprising: receiving the image, wherein the image includes a plurality of pixels; generating an n-gram based on a natural language phrase that references an object depicted within a first region of image, wherein the n-gram includes an ordered set of tokens; generating an image data structure that encodes a mapping between each of a plurality of image features and a corresponding portion of the plurality of pixels, wherein the plurality of images features are identified within the image based on an image feature identification model; generating a set of token data structures based on a natural language model, wherein each of the token data structures encodes semantic features of a corresponding token of the set of tokens; iteratively generating a segmentation map based on a first recurrent neural network (RNN) and a plurality of iteratively generated combinations of the image data structure and portions of the set of token data structures, wherein the first RNN propagates the segmentation map during the iterative generation of the segmentation data structure and the segmentation map identifies a subset of the plurality of pixels that are included in the first region of the image; and segmenting the image based on the iteratively generated segmentation map. | 8. A method for segmenting an image, comprising: receiving the image, wherein the image includes a plurality of pixels; generating an n-gram based on a natural language phrase that references an object depicted within a first region of image, wherein the n-gram includes an ordered set of tokens; generating an image data structure that encodes a mapping between each of a plurality of image features and a corresponding portion of the plurality of pixels, wherein the plurality of images features are identified within the image based on an image feature identification model; generating a set of token data structures based on a natural language model, wherein each of the token data structures encodes semantic features of a corresponding token of the set of tokens; iteratively generating a segmentation map based on a first recurrent neural network (RNN) and a plurality of iteratively generated combinations of the image data structure and portions of the set of token data structures, wherein the first RNN propagates the segmentation map during the iterative generation of the segmentation data structure and the segmentation map identifies a subset of the plurality of pixels that are included in the first region of the image; and segmenting the image based on the iteratively generated segmentation map. 9. The method for claim 8 , further comprising: iteratively generating an n-gram data structure based on a second RNN and the set of token data structures, wherein the second RNN propagates the n-gram data structure during the iterative generation of the n-gram data structure; and iteratively generating the segmentation map further based on a plurality of iteratively generated combinations of the image data structure and the n-gram data structure. | 0.504386 |
1. A method for associating an entity of a contact with a character string, wherein a database stores a plurality of contacts, and each contact has a defined set of entities, comprising: determining, for a first subgroup of the defined set of entities, using a processor, whether the character string comprises a structure associated with the first subgroup of the defined set of entities, prior to any probabilistic approximation, wherein the structure comprises at least one character other than alphanumeric characters; replacing all numerical digits in the character string with a corresponding digit placeholder to generate a blurred character string in response to a determination that the character string does not comprise the structure associated with the first subgroup; and determining, for a second subgroup of the defined set of entities, using a processor, a probabilistic approximation that the blurred character string is associated with at least one of the defined set of entities in the second subgroup by scoring the blurred character string for each of the defined set of entities associated with the blurred character string; and identifying the character string as one of the set of defined entities having a highest score that satisfies a predetermined score threshold. | 1. A method for associating an entity of a contact with a character string, wherein a database stores a plurality of contacts, and each contact has a defined set of entities, comprising: determining, for a first subgroup of the defined set of entities, using a processor, whether the character string comprises a structure associated with the first subgroup of the defined set of entities, prior to any probabilistic approximation, wherein the structure comprises at least one character other than alphanumeric characters; replacing all numerical digits in the character string with a corresponding digit placeholder to generate a blurred character string in response to a determination that the character string does not comprise the structure associated with the first subgroup; and determining, for a second subgroup of the defined set of entities, using a processor, a probabilistic approximation that the blurred character string is associated with at least one of the defined set of entities in the second subgroup by scoring the blurred character string for each of the defined set of entities associated with the blurred character string; and identifying the character string as one of the set of defined entities having a highest score that satisfies a predetermined score threshold. 4. The method of claim 1 , wherein the step of evaluating a probabilistic approximation further comprises calculating a posterior probability over a limited set of character string features. | 0.761527 |
1. A method for identifying a term as unnumbered within a patent disclosure, comprising the steps of: tokenizing the patent disclosure to form a tokenized patent disclosure comprising a plurality of tokens; identifying a pattern of tokens comprising a first token immediately followed by a second token, wherein the second token is a numeric token or an alphanumeric token; comparing the first token to a predetermined list of ignorable tokens; discarding first tokens that are in the list of ignorable tokens; making a term dictionary, wherein the term dictionary contains a list of terms, each term comprising a non-discarded first token, and the term dictionary further contains the associated reference label for each term, the associated reference label comprising the second token immediately following the non-discarded first token; identifying a token type associated with each token within the tokenized patent disclosure; identifying a token sequence within the tokenized patent disclosure; comparing the token sequence to determine if the token types of each token within the token sequence matches a predetermined pattern of token types; searching the term dictionary to determine if the term is in the term dictionary; and indicating the term as an unnumbered term if the term is not in the term dictionary, and the token sequence matches a predetermined pattern; wherein each of the steps is performed on a computer comprising a microprocessor and non-transitory storage. | 1. A method for identifying a term as unnumbered within a patent disclosure, comprising the steps of: tokenizing the patent disclosure to form a tokenized patent disclosure comprising a plurality of tokens; identifying a pattern of tokens comprising a first token immediately followed by a second token, wherein the second token is a numeric token or an alphanumeric token; comparing the first token to a predetermined list of ignorable tokens; discarding first tokens that are in the list of ignorable tokens; making a term dictionary, wherein the term dictionary contains a list of terms, each term comprising a non-discarded first token, and the term dictionary further contains the associated reference label for each term, the associated reference label comprising the second token immediately following the non-discarded first token; identifying a token type associated with each token within the tokenized patent disclosure; identifying a token sequence within the tokenized patent disclosure; comparing the token sequence to determine if the token types of each token within the token sequence matches a predetermined pattern of token types; searching the term dictionary to determine if the term is in the term dictionary; and indicating the term as an unnumbered term if the term is not in the term dictionary, and the token sequence matches a predetermined pattern; wherein each of the steps is performed on a computer comprising a microprocessor and non-transitory storage. 3. The method of claim 1 , wherein the step of comparing the token sequence to determine if the token sequence matches a predetermined pattern of token types comprises comparing the token sequence to a pattern comprised of a form of the verb ‘to be’ followed by an article, followed by a term, followed by a punctuation mark. | 0.583766 |
1. A computer-implemented system that responds to human communications, comprising: a recognition component that dynamically monitors human communications for an apparent intent related to a task discussed by a user during a communication session with a human second party; a task component that receives, at least in part, an apparent intent from the recognition component and associates it with a task to form a candidate task for prompting a user; and a computer readable storage medium comprising data structures and sets of codes for causing a computer to execute the recognition and task components. | 1. A computer-implemented system that responds to human communications, comprising: a recognition component that dynamically monitors human communications for an apparent intent related to a task discussed by a user during a communication session with a human second party; a task component that receives, at least in part, an apparent intent from the recognition component and associates it with a task to form a candidate task for prompting a user; and a computer readable storage medium comprising data structures and sets of codes for causing a computer to execute the recognition and task components. 6. The computer-implemented system of claim 1 , the communications comprising audio communications. | 0.665341 |
15. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising: transmitting, by a client device, a search query to a search engine; receiving, by the client device and from the search engine, data identifying resources that are responsive to the search query; obtaining a subset of the identified resources; determining, by the client device, a number of times that each term of a set of terms that occur in the obtained resources occurs in the obtained resources; transmitting, by the client device and to the search engine, an occurrence count that specifies the number of times that each term of the set of terms occurs in the obtained resources; and receiving, by the client device and from the search engine, code that, when invoked by the client device, implements controls for automatically reformulating the search query to include or exclude one or more frequently occurring terms identified in the occurrence count. | 15. A non-transitory computer-readable medium storing software comprising instructions executable by one or more computers which, upon such execution, cause the one or more computers to perform operations comprising: transmitting, by a client device, a search query to a search engine; receiving, by the client device and from the search engine, data identifying resources that are responsive to the search query; obtaining a subset of the identified resources; determining, by the client device, a number of times that each term of a set of terms that occur in the obtained resources occurs in the obtained resources; transmitting, by the client device and to the search engine, an occurrence count that specifies the number of times that each term of the set of terms occurs in the obtained resources; and receiving, by the client device and from the search engine, code that, when invoked by the client device, implements controls for automatically reformulating the search query to include or exclude one or more frequently occurring terms identified in the occurrence count. 17. The medium of claim 15 , wherein the code that implements controls for automatically reformulating the search query include or exclude the one or more frequently occurring terms identified in the occurrence count implements controls for: automatically reformulating the search query to include or exclude n most frequently occurring terms identified in the occurrence count, wherein n is a positive integer; and automatically reformulating the search query to promote or demote the n most frequently occurring terms identifies in the occurrence count. | 0.504545 |
1. A method for identifying related names, comprising: storing, using a processor of a computer, a collection of names from different languages, wherein each of the names has a native orthographic form and a romanized form; receiving an input name in a known encoding scheme; determining an alphabet of the input name based on the known encoding scheme; generating romanized names based on the input name and the determined alphabet using multiple transliteration schemas; identifying a culture associated with the input name; selecting one or more culture-sensitive regularization rules for the identified culture, wherein there are different culture-sensitive regularization rules for different cultures; applying the selected one or more culture-sensitive regularization rules to one of the romanized names to create an additional romanized name; matching the romanized names and the additional romanized name against the romanized names in the collection of names from the different languages; and returning data store records that have romanized names that match at least one of the romanized names and the additional romanized name. | 1. A method for identifying related names, comprising: storing, using a processor of a computer, a collection of names from different languages, wherein each of the names has a native orthographic form and a romanized form; receiving an input name in a known encoding scheme; determining an alphabet of the input name based on the known encoding scheme; generating romanized names based on the input name and the determined alphabet using multiple transliteration schemas; identifying a culture associated with the input name; selecting one or more culture-sensitive regularization rules for the identified culture, wherein there are different culture-sensitive regularization rules for different cultures; applying the selected one or more culture-sensitive regularization rules to one of the romanized names to create an additional romanized name; matching the romanized names and the additional romanized name against the romanized names in the collection of names from the different languages; and returning data store records that have romanized names that match at least one of the romanized names and the additional romanized name. 3. The method of claim 1 , wherein the culture-sensitive regularization rules are applied using a user-supplied cultural value. | 0.898734 |
20. A device comprising: one or more computer processors; and a memory comprising instructions that when executed by the one or more computer processors cause the one or more computer processors to: output, for display, a graphical keyboard comprising a plurality of keys; receive a plurality of indications of gestures detected at a presence-sensitive input device, a first indication of the plurality of indications of gestures being associated with traversal of a first key from the plurality of keys and subsequently a second indication of the plurality of indications of gestures being associated with traversal of a second key of the plurality of keys, wherein a first character is associated with the first key and a second character is associated with the second key; output, based at least in part on the first and second indications of the plurality of indications of gestures traversing the first key and subsequently the second key, a candidate phrase comprising a group of candidate words, wherein at least one of a first candidate word or a second candidate word from the group of candidate words comprises the second character subsequent to the first character; determine, based at least in part on the candidate phrase, a next word that is subsequent to the first candidate word and the second candidate word in the candidate phrase; and output, for display, the next word. | 20. A device comprising: one or more computer processors; and a memory comprising instructions that when executed by the one or more computer processors cause the one or more computer processors to: output, for display, a graphical keyboard comprising a plurality of keys; receive a plurality of indications of gestures detected at a presence-sensitive input device, a first indication of the plurality of indications of gestures being associated with traversal of a first key from the plurality of keys and subsequently a second indication of the plurality of indications of gestures being associated with traversal of a second key of the plurality of keys, wherein a first character is associated with the first key and a second character is associated with the second key; output, based at least in part on the first and second indications of the plurality of indications of gestures traversing the first key and subsequently the second key, a candidate phrase comprising a group of candidate words, wherein at least one of a first candidate word or a second candidate word from the group of candidate words comprises the second character subsequent to the first character; determine, based at least in part on the candidate phrase, a next word that is subsequent to the first candidate word and the second candidate word in the candidate phrase; and output, for display, the next word. 23. The device of claim 20 , wherein the graphical user interface includes at least one text-suggestion region, and wherein the next word is included in the at least one text-suggestion region. | 0.732369 |
1. A method of handling events generated by user interaction with a display that includes a first window and a second window, including: generating a popup control for the first window responsive to a first user event representing user interaction with the first window; in circumstances when the user relocates a cursor from the first window to the second window and a mousedown or touch start event, collectively referred to as the mousedown event, generated within the second window, is suppressed from propagation to the first window, receiving a mouseup or touch end event, collectively referred to as the mouseup event, propagated from the second window and a location of the mouseup event, responsive to the mouseup event in the second window, triggering a dismiss class within the first window, wherein the dismiss class dismisses at least a portion of the popup control of the first window. | 1. A method of handling events generated by user interaction with a display that includes a first window and a second window, including: generating a popup control for the first window responsive to a first user event representing user interaction with the first window; in circumstances when the user relocates a cursor from the first window to the second window and a mousedown or touch start event, collectively referred to as the mousedown event, generated within the second window, is suppressed from propagation to the first window, receiving a mouseup or touch end event, collectively referred to as the mouseup event, propagated from the second window and a location of the mouseup event, responsive to the mouseup event in the second window, triggering a dismiss class within the first window, wherein the dismiss class dismisses at least a portion of the popup control of the first window. 3. The method of claim 1 , wherein the dismiss class further dismisses the whole popup control for the first window. | 0.898632 |
20. A videoconferencing apparatus, comprising: means for generating compressed video data from a videoconferencing video stream; means for generating a compressed audio data based on a videoconferencing audio stream; means for generating text data based on the videoconferencing audio stream; and means for generating time alignment information indicative of a time of generation of the compressed video, audio, and text data and operable for time aligning the compressed video data, compressed audio data, and the text data. | 20. A videoconferencing apparatus, comprising: means for generating compressed video data from a videoconferencing video stream; means for generating a compressed audio data based on a videoconferencing audio stream; means for generating text data based on the videoconferencing audio stream; and means for generating time alignment information indicative of a time of generation of the compressed video, audio, and text data and operable for time aligning the compressed video data, compressed audio data, and the text data. 22. An apparatus as in claim 20 , further comprising means for a storing the compressed video data associated the time alignment information. | 0.72944 |
23. The computer-readable memory of claim 17 wherein saving the edited text item comprises creating a new secondary file. | 23. The computer-readable memory of claim 17 wherein saving the edited text item comprises creating a new secondary file. 24. The computer-readable memory of claim 23 wherein the new secondary file includes at least one resource bundle, and the method further comprises creating the new secondary file for a translated version of the software application. | 0.92454 |
2. The method of claim 1 , comprising: determining whether a user, who utilizes a computing device to interact with a computerized service, is either an authorized user or an attacker; wherein the determining comprises: generating a temporary input/output interference that causes an anomaly between (A) input gestures that the user performs via an input unit of said computing device, and (B) output that is displayed on a display unit of said computing device as a result of the input gestures; wherein the temporary input/output interference is a binary-type interference defined to trigger one of two possible manual user responses, wherein the two possible manual user responses comprise: a first possible manual user response that is performed by a majority of a general population of users; and a second possible manual user response that is performed by a minority of the general population of users; tracking user interactions via said input unit in response to said temporary input/output interference; detecting a manual correction operation that the user performs via said input unit in response to said temporary input/output interference; determining whether said manual correction operation that the user performs via said input unit, matches either the first possible manual user response or the second possible manual user response; if said manual user correction operation that the user performs, matches the first possible manual user response that is performed by majority of the general population of users, then discarding said temporary input/output interference from being re-used in subsequent usage sessions of said user; if said manual user correction operation that the user performs, matches the second possible manual user response that is performed by minority of the general population of users, then updating a user profile to indicate that said temporary input/output interference is to be re-used in subsequent usage sessions of said user. | 2. The method of claim 1 , comprising: determining whether a user, who utilizes a computing device to interact with a computerized service, is either an authorized user or an attacker; wherein the determining comprises: generating a temporary input/output interference that causes an anomaly between (A) input gestures that the user performs via an input unit of said computing device, and (B) output that is displayed on a display unit of said computing device as a result of the input gestures; wherein the temporary input/output interference is a binary-type interference defined to trigger one of two possible manual user responses, wherein the two possible manual user responses comprise: a first possible manual user response that is performed by a majority of a general population of users; and a second possible manual user response that is performed by a minority of the general population of users; tracking user interactions via said input unit in response to said temporary input/output interference; detecting a manual correction operation that the user performs via said input unit in response to said temporary input/output interference; determining whether said manual correction operation that the user performs via said input unit, matches either the first possible manual user response or the second possible manual user response; if said manual user correction operation that the user performs, matches the first possible manual user response that is performed by majority of the general population of users, then discarding said temporary input/output interference from being re-used in subsequent usage sessions of said user; if said manual user correction operation that the user performs, matches the second possible manual user response that is performed by minority of the general population of users, then updating a user profile to indicate that said temporary input/output interference is to be re-used in subsequent usage sessions of said user. 4. The method of claim 2 , wherein the discarding comprises: if said manual user correction operation that the user performs, matches the first possible manual user response that is performed by at least 75 percent of the general population of users, then discarding said temporary input/output interference from being re-used in subsequent usage sessions of said user. | 0.748801 |
1. A method, comprising: recording user interactions from a plurality of users with one or more contextual shortcuts, said one or more contextual shortcuts comprising one or more user-selectable keyword anchors; updating an index based, at least in part, on said user interactions from said plurality of users, said updating comprising adding at least one previously non-indexed electronic document to said index at least partially in response to receiving one or more user interactions with said one or more contextual shortcuts contained within said at least one previously non-indexed electronic document, wherein said index is searchable by said plurality of users; receiving a search query from a user based, at least in part, on a user selection of a given user-selectable keyword anchor associated with a contextual shortcut; and performing a search query on one or more electronic documents of said index based, at least in part, on said user selection of said given user-selectable keyword anchor in an electronic document to determine a ranked list of electronic documents associated with said search query, wherein said ranked list is determined based at least in part on the recorded said user interactions from the plurality of users. | 1. A method, comprising: recording user interactions from a plurality of users with one or more contextual shortcuts, said one or more contextual shortcuts comprising one or more user-selectable keyword anchors; updating an index based, at least in part, on said user interactions from said plurality of users, said updating comprising adding at least one previously non-indexed electronic document to said index at least partially in response to receiving one or more user interactions with said one or more contextual shortcuts contained within said at least one previously non-indexed electronic document, wherein said index is searchable by said plurality of users; receiving a search query from a user based, at least in part, on a user selection of a given user-selectable keyword anchor associated with a contextual shortcut; and performing a search query on one or more electronic documents of said index based, at least in part, on said user selection of said given user-selectable keyword anchor in an electronic document to determine a ranked list of electronic documents associated with said search query, wherein said ranked list is determined based at least in part on the recorded said user interactions from the plurality of users. 5. The method of claim 1 , further comprising: indexing said recorded user interactions; and transmitting said ranked list of electronic documents to said user via said contextual search interface based at least in part on said indexed recorded user interactions. | 0.842294 |
16. A method comprising: receiving a first search request, the first search request associated with first audio input data from a device; identifying a first search query from the first search request; identifying a set of categories associated with the first search query, the set of categories including two or more categories, each of the two or more categories being ranked according to respective relevance scores to the first search query; identifying a first set of results associated with a first category, the first category having a highest relevance score to the first search query; causing the first set of results to be transmitted to the device, the first set of results being presented to the user of the device; receiving a second search request, the second search request associated with second audio input data from the device; analyzing the second search request for indicators that an incorrect category was presented; determining the second search request includes one or more of the indicators that the incorrect category was presented; and decreasing the relevance score of the first category for the first search query when a voice volume difference is determined to be above a volume difference threshold; identifying a second category of the set of categories associated with the first search query; and increasing the relevance score of the second category for the first search query when the voice volume difference is determined to be below the volume difference threshold. | 16. A method comprising: receiving a first search request, the first search request associated with first audio input data from a device; identifying a first search query from the first search request; identifying a set of categories associated with the first search query, the set of categories including two or more categories, each of the two or more categories being ranked according to respective relevance scores to the first search query; identifying a first set of results associated with a first category, the first category having a highest relevance score to the first search query; causing the first set of results to be transmitted to the device, the first set of results being presented to the user of the device; receiving a second search request, the second search request associated with second audio input data from the device; analyzing the second search request for indicators that an incorrect category was presented; determining the second search request includes one or more of the indicators that the incorrect category was presented; and decreasing the relevance score of the first category for the first search query when a voice volume difference is determined to be above a volume difference threshold; identifying a second category of the set of categories associated with the first search query; and increasing the relevance score of the second category for the first search query when the voice volume difference is determined to be below the volume difference threshold. 19. The method of claim 16 , wherein analyzing the second search request for indicators that an incorrect category was presented further comprises: identifying a second search query from the second search request; calculating a search query similarity score by comparing the first search query and the second search query; and determining the search query similarity score is above a similarity score threshold indicating that the second search query is a repeat search query of the first search query. | 0.670719 |
6. The method as recited in claim 1 , including the further step of designating a document as a key article. | 6. The method as recited in claim 1 , including the further step of designating a document as a key article. 7. The method of claim 6 , including the further step of providing text related to a document. | 0.98433 |
7. A system in which a user is able to engage in multiple modes of communication with a speech-enabled application, comprising: a first device configured to execute the speech-enabled application so as to engage in a communication session with a user; a voice interface operable by the user during the communication session; and a text interface operable by the user during the communication session; wherein the system is configured such that the first device is able to receive, at a first time during the communication session, a first signal from a voice server via a communication channel, the first signal corresponding to speech recognition results generated by the voice server of a voice input originating from the voice interface, and to process the first signal with the speech-enabled application during the communication session with the user to generate a first responsive output; and wherein the system is further configured such that the first device is able to receive, at a second time during the communication session with the user, a second signal from the voice server via the communication channel, the second signal corresponding to a text input originating from the text interface operated by the user during the communication session, to process the second signal with the speech-enabled application during the communication session with the user to generate a second responsive output, and to communicate a third signal corresponding to the second responsive output to the text interface via a communication path exclusive of the voice server; and wherein the system is further configured such that the voice server is able to receive the text input via a communications network. | 7. A system in which a user is able to engage in multiple modes of communication with a speech-enabled application, comprising: a first device configured to execute the speech-enabled application so as to engage in a communication session with a user; a voice interface operable by the user during the communication session; and a text interface operable by the user during the communication session; wherein the system is configured such that the first device is able to receive, at a first time during the communication session, a first signal from a voice server via a communication channel, the first signal corresponding to speech recognition results generated by the voice server of a voice input originating from the voice interface, and to process the first signal with the speech-enabled application during the communication session with the user to generate a first responsive output; and wherein the system is further configured such that the first device is able to receive, at a second time during the communication session with the user, a second signal from the voice server via the communication channel, the second signal corresponding to a text input originating from the text interface operated by the user during the communication session, to process the second signal with the speech-enabled application during the communication session with the user to generate a second responsive output, and to communicate a third signal corresponding to the second responsive output to the text interface via a communication path exclusive of the voice server; and wherein the system is further configured such that the voice server is able to receive the text input via a communications network. 9. The system of claim 7 , wherein the first device comprises an automated response system. | 0.559243 |
10. A tangible computer readable medium having encoded thereon computer-executable instructions which, when executed by a computer, cause the computer to perform the method of claim 1 . | 10. A tangible computer readable medium having encoded thereon computer-executable instructions which, when executed by a computer, cause the computer to perform the method of claim 1 . 17. The method of claim 10 , wherein facilitating communication further includes: communicating the translation of the second language communication to the customer audibly using speech synthesis. | 0.916046 |
10. A system including at least one processor and at least one computer readable memory, said computer readable memory having program code stored thereon for operating a Web Services search method in a networked environment, wherein said program code for operating said Web services search method is operable when a Service Broker is inquired by a Service Consumer for offering Web Services, and a Service Provider provides an inquired Web Service to the Service Consumer, said program code comprising: program code for retrieving data mining input data relating to description details of the inquired Web Services from respective Service descriptions of the inquired Web Services; program code for performing a data mining function on said data mining input data, wherein a clustering is performed with a distance calculation function including said description details, wherein the distance calculation includes the degree of interaction between said Web Services, and wherein the clustering yields a cluster model comprising a plurality of clusters and a mapping for each Web Service to one of said clusters, wherein Web Services having a similar semantic meaning are collected in a single cluster, yielding a data mining result; wherein said program code for performing said data mining function adds cluster information comprised of said data mining result to a service model and for storing this cluster information in a database; and program code for offering search response data based on said cluster model in response to Web Services search operations. | 10. A system including at least one processor and at least one computer readable memory, said computer readable memory having program code stored thereon for operating a Web Services search method in a networked environment, wherein said program code for operating said Web services search method is operable when a Service Broker is inquired by a Service Consumer for offering Web Services, and a Service Provider provides an inquired Web Service to the Service Consumer, said program code comprising: program code for retrieving data mining input data relating to description details of the inquired Web Services from respective Service descriptions of the inquired Web Services; program code for performing a data mining function on said data mining input data, wherein a clustering is performed with a distance calculation function including said description details, wherein the distance calculation includes the degree of interaction between said Web Services, and wherein the clustering yields a cluster model comprising a plurality of clusters and a mapping for each Web Service to one of said clusters, wherein Web Services having a similar semantic meaning are collected in a single cluster, yielding a data mining result; wherein said program code for performing said data mining function adds cluster information comprised of said data mining result to a service model and for storing this cluster information in a database; and program code for offering search response data based on said cluster model in response to Web Services search operations. 14. The system of claim 10 , wherein the Web Service Consumer inquiry is a request and comprises a Web Service Description of a service preknown by the Web Service Consumer and previously unknown to the Service Broker. | 0.554131 |
17. A method that manages pay-per-click advertising, by determining an amount to be charged in response to a click of a hyperlink associated with a target keyword, comprising accessing with a computer processor, a particular amount a first advertiser is willing to be charged in response to a click of a hyperlink associated with said first advertiser, accessing with a computer processor, first and second different statistics related to one or more of a rate of use by users, number of times a hyperlink was viewed, data that relates to an increase or decrease in the use of a keyword by users, demographics of users associated with a keyword or demographics of advertisers associated with a keyword, and without human intervention, determining with a computer processor, an amount to be charged to a second advertiser in response to a click of a hyperlink associated with said target keyword and said second advertiser, wherein said amount to be charged to said second advertiser is determined using said particular amount, and is also determined using said first and second statistics. | 17. A method that manages pay-per-click advertising, by determining an amount to be charged in response to a click of a hyperlink associated with a target keyword, comprising accessing with a computer processor, a particular amount a first advertiser is willing to be charged in response to a click of a hyperlink associated with said first advertiser, accessing with a computer processor, first and second different statistics related to one or more of a rate of use by users, number of times a hyperlink was viewed, data that relates to an increase or decrease in the use of a keyword by users, demographics of users associated with a keyword or demographics of advertisers associated with a keyword, and without human intervention, determining with a computer processor, an amount to be charged to a second advertiser in response to a click of a hyperlink associated with said target keyword and said second advertiser, wherein said amount to be charged to said second advertiser is determined using said particular amount, and is also determined using said first and second statistics. 20. The method of claim 17 wherein said amount meets pre-identified requirements of said second advertiser. | 0.625175 |
3. A computer program product comprising a computer useable medium having control logic stored therein for indicating legal case histories, said control logic comprising: first computer readable program code means for causing the computer to identify occurrences of a piece of text having a predetermined format in a textual document and to determine a legal case history for at least one piece of formatted text in the textual document and storing it in a database; second computer readable program code means for causing the computer to receive a request from a client access device for a legal case history for a piece of formatted text in the textual document and to search the database based on the request and to retrieve the requested legal case history from the database; and third computer readable program code means for causing the computer to indicate the legal case history such that an indication is provided of a parent case and of at least one related case, the parent case having a visual connection to the related case. | 3. A computer program product comprising a computer useable medium having control logic stored therein for indicating legal case histories, said control logic comprising: first computer readable program code means for causing the computer to identify occurrences of a piece of text having a predetermined format in a textual document and to determine a legal case history for at least one piece of formatted text in the textual document and storing it in a database; second computer readable program code means for causing the computer to receive a request from a client access device for a legal case history for a piece of formatted text in the textual document and to search the database based on the request and to retrieve the requested legal case history from the database; and third computer readable program code means for causing the computer to indicate the legal case history such that an indication is provided of a parent case and of at least one related case, the parent case having a visual connection to the related case. 7. A computer program product comprising a computer useable medium having control logic stored therein for indicating legal case histories as recited in claim 3 wherein the third computer readable program code means is further adapted to cause the computer to display the legal case history on an output device in a graphical flow-chart format, wherein the graphical flow-chart format includes a graphical representation of a parent case and a graphical representation of at least one related case, the graphical representation of the parent case being visually connected to the graphical representation of the related case by a visual indicator, the graphical representations of the parent case and at least one related case being positioned to illustrate the relationship between the cases. | 0.5 |
6. A system having a storage device to store instructions, and a processing device to execute the instructions, wherein the execution of the instructions cause the processing device to perform one or more operations comprising: receiving annotated data; parsing, at least partially, the annotated data, wherein parsing includes identifying syntactic structure of sentences within the annotated data; and extracting training sets from the parsed annotated data, wherein the training sets are based on a plurality of features, wherein extracting comprises at least one of tagging the annotated data for marking words, and defining and segmenting words based on languages, wherein extracting further comprises extracting entity names and relations between entity names based on the information sets, and wherein extracting further comprises identifying information sets using memory-based Information Gain (IG)-Trees, wherein the IG-Trees are generated based on the plurality of features, wherein the plurality of features comprise one or more of words, phrases, sentences, and objects, and wherein each information set is identified based on a corresponding memory-based IG-Tree including one or more of a person-name IG-Tree, an entity-name IG-Tree, a noun phrase IG-Tree, and a relation IG-Tree. | 6. A system having a storage device to store instructions, and a processing device to execute the instructions, wherein the execution of the instructions cause the processing device to perform one or more operations comprising: receiving annotated data; parsing, at least partially, the annotated data, wherein parsing includes identifying syntactic structure of sentences within the annotated data; and extracting training sets from the parsed annotated data, wherein the training sets are based on a plurality of features, wherein extracting comprises at least one of tagging the annotated data for marking words, and defining and segmenting words based on languages, wherein extracting further comprises extracting entity names and relations between entity names based on the information sets, and wherein extracting further comprises identifying information sets using memory-based Information Gain (IG)-Trees, wherein the IG-Trees are generated based on the plurality of features, wherein the plurality of features comprise one or more of words, phrases, sentences, and objects, and wherein each information set is identified based on a corresponding memory-based IG-Tree including one or more of a person-name IG-Tree, an entity-name IG-Tree, a noun phrase IG-Tree, and a relation IG-Tree. 10. The system of claim 6 , wherein the marked words comprise one or more of nouns, verbs, proper nouns, pronouns, adverbs, and adjectives, wherein the marked words are compared with previously-identified marked words to identify missing marked words. | 0.738232 |
20. A system for recording medical transactions, the system comprising distinct and multi-linguistic representation layers, allowing the de novo composition and construction of medical transaction codes; including: a user interface including means for inputting medical transactions in a semiotic form one, the semiotic form one input being a free form-type, abbreviation-oriented natural language textual input, a transaction parser-coder configured to parse said semiotic form one input and to convert it into coded medical transactions in a semiotic form two output, the transaction codes composed and constructed de novo, the semiotic form two output embodying high level machine-parseable computer language statements comprehensible to a high certainty level by human users, means for evoking a display of system reflection in the form of coded medical transactions in said semiotic form two and system-rated confidence levels representing the match between a code and correspondence with perceived user intent, means for receiving user selection input for verifying a selected coded medical transaction, a transaction mapper configured to convert a semiotic form two input into a semiotic form three transaction by mapping the selected coded transaction into data row in a relational database to render the transaction data amenable to structured query language processing, and a text editor having an interface for enabling a user to compose semiotic form one input using a minimal number of keystrokes to compose medical transactions during a clinical consultation to document medical history, findings, evaluations, management and planning, each key component of the transaction being abbreviated down to an abbreviation of maximum four characters. | 20. A system for recording medical transactions, the system comprising distinct and multi-linguistic representation layers, allowing the de novo composition and construction of medical transaction codes; including: a user interface including means for inputting medical transactions in a semiotic form one, the semiotic form one input being a free form-type, abbreviation-oriented natural language textual input, a transaction parser-coder configured to parse said semiotic form one input and to convert it into coded medical transactions in a semiotic form two output, the transaction codes composed and constructed de novo, the semiotic form two output embodying high level machine-parseable computer language statements comprehensible to a high certainty level by human users, means for evoking a display of system reflection in the form of coded medical transactions in said semiotic form two and system-rated confidence levels representing the match between a code and correspondence with perceived user intent, means for receiving user selection input for verifying a selected coded medical transaction, a transaction mapper configured to convert a semiotic form two input into a semiotic form three transaction by mapping the selected coded transaction into data row in a relational database to render the transaction data amenable to structured query language processing, and a text editor having an interface for enabling a user to compose semiotic form one input using a minimal number of keystrokes to compose medical transactions during a clinical consultation to document medical history, findings, evaluations, management and planning, each key component of the transaction being abbreviated down to an abbreviation of maximum four characters. 21. The system of claim 20 , wherein the semiotic form one and the transaction parser-coder are designed to be misspelling intolerant and compatible with both brief and verbose free-form input. | 0.545153 |
9. A computer program product for implementing a floating index navigation tool, the computer program product comprising a non-transitory computer-readable medium having stored therein instructions for causing a computer to: in response to updating a search term using a floating text box, build first and second search queries; issue the first and second search queries to at least one database comprising a searchable index of content; responsive to receipt of search results from the first and second search queries, display the first query search results as a first floating index extending horizontally to the left and to the right of the floating text box and display the second query search results as a second floating index extending vertically above and below the floating text box. | 9. A computer program product for implementing a floating index navigation tool, the computer program product comprising a non-transitory computer-readable medium having stored therein instructions for causing a computer to: in response to updating a search term using a floating text box, build first and second search queries; issue the first and second search queries to at least one database comprising a searchable index of content; responsive to receipt of search results from the first and second search queries, display the first query search results as a first floating index extending horizontally to the left and to the right of the floating text box and display the second query search results as a second floating index extending vertically above and below the floating text box. 17. The computer program product of claim 9 wherein building first and second search queries takes into account a user preference, and wherein the user preference includes case preferences and organization preferences. | 0.501892 |
1. A method for determining a reputation associated with an electronic document accessible via a network address, comprising: determining an identity relating to a person, wherein the identity is associated with the electronic document; determining that the person is a member of a group, wherein the group is associated with a group-related service and wherein the group is associated with a group reputation; determining an identity reputation, wherein the identity reputation is associated with the identity and wherein the identity reputation is based at least in part on the group reputation; and determining a document reputation, wherein determining the document reputation uses the identity reputation. | 1. A method for determining a reputation associated with an electronic document accessible via a network address, comprising: determining an identity relating to a person, wherein the identity is associated with the electronic document; determining that the person is a member of a group, wherein the group is associated with a group-related service and wherein the group is associated with a group reputation; determining an identity reputation, wherein the identity reputation is associated with the identity and wherein the identity reputation is based at least in part on the group reputation; and determining a document reputation, wherein determining the document reputation uses the identity reputation. 10. The method of claim 1 , wherein the identity is associated with a comment, wherein the comment is associated with the document. | 0.592866 |
20. A non-transitory computer-readable medium comprising one or more sets of instructions which, when executed by one or more processors, causes the one or more processors to perform a method for associating a document file with a record in a reference database, the method comprising: receiving the document file, the document file comprising unstructured data related to a record in the reference database; organizing data extracted from the unstructured data in the document file into an array of strings; obtaining a first set of strings by filtering at least a portion of the array of strings using at least one of: string position, position of a portion of a string, string value, value of a portion of a string, string format, format of a portion of a string, a property of one or more characters within a string, and string length; comparing the first set of strings from the array of strings against a comparison reference database comprising a plurality of records from the database, wherein a record comprises at least one data field element; dynamically generating a match pattern by selecting, from results of comparing the first set of strings from the array of strings against the comparison reference database, a set of matches to one or more data field elements within a record from the plurality of records in the comparison reference database to form the match pattern; determining a number of occurrences of the match pattern within records from the plurality of records in the comparison reference database; and responsive to the number of occurrences of the match pattern within records from the plurality of records in the comparison reference database being below a threshold number, associating the document file with the record corresponding with the set of matches from which the match pattern was formed. | 20. A non-transitory computer-readable medium comprising one or more sets of instructions which, when executed by one or more processors, causes the one or more processors to perform a method for associating a document file with a record in a reference database, the method comprising: receiving the document file, the document file comprising unstructured data related to a record in the reference database; organizing data extracted from the unstructured data in the document file into an array of strings; obtaining a first set of strings by filtering at least a portion of the array of strings using at least one of: string position, position of a portion of a string, string value, value of a portion of a string, string format, format of a portion of a string, a property of one or more characters within a string, and string length; comparing the first set of strings from the array of strings against a comparison reference database comprising a plurality of records from the database, wherein a record comprises at least one data field element; dynamically generating a match pattern by selecting, from results of comparing the first set of strings from the array of strings against the comparison reference database, a set of matches to one or more data field elements within a record from the plurality of records in the comparison reference database to form the match pattern; determining a number of occurrences of the match pattern within records from the plurality of records in the comparison reference database; and responsive to the number of occurrences of the match pattern within records from the plurality of records in the comparison reference database being below a threshold number, associating the document file with the record corresponding with the set of matches from which the match pattern was formed. 27. The non-transitory computer-readable medium of claim 20 wherein the method further comprises: responsive to the number of occurrences of the match pattern within records from the plurality of records in the comparison reference database not being below a threshold number, providing at least a portion of the plurality of records that possess a match pattern to a user to facilitate the user's selection of a record to associate with the document file. | 0.515144 |
16. The apparatus for controlling access to a secure area as in claim 15 further comprising the minimization processor that generates the Boolean equation based upon the plurality of user credentials where the generated Boolean equation provides a predetermined response to each user credential of the plurality of credentials where the generated Boolean equation is saved in memory in place of the user credentials. | 16. The apparatus for controlling access to a secure area as in claim 15 further comprising the minimization processor that generates the Boolean equation based upon the plurality of user credentials where the generated Boolean equation provides a predetermined response to each user credential of the plurality of credentials where the generated Boolean equation is saved in memory in place of the user credentials. 18. The apparatus for controlling access as in claim 16 wherein the minimization processor further comprises a Karnaugh mapping process. | 0.799485 |
9. The method of claim 8 , wherein the removal affordance includes a snooze affordance for automatically bringing the user-selected conversation back to the first list of conversations when the predefined criteria are met. | 9. The method of claim 8 , wherein the removal affordance includes a snooze affordance for automatically bringing the user-selected conversation back to the first list of conversations when the predefined criteria are met. 13. The method of claim 9 , wherein the criteria include a time triggering condition upon which the user-selected conversation is brought back to the first list of conversations. | 0.915 |
16. The system of claim 15 , further comprising merging hierarchal database records having hyperspace attribute differences within a predefined criteria to eliminate similar exemplars that are likely to represent a same entity, the merging resulting in a reduced set of hierarchal database records. | 16. The system of claim 15 , further comprising merging hierarchal database records having hyperspace attribute differences within a predefined criteria to eliminate similar exemplars that are likely to represent a same entity, the merging resulting in a reduced set of hierarchal database records. 17. The system of claim 16 , further comprising: recalculating the field value weights for the reduced set of hierarchal database records; and re-clustering the reduced set of records based at least in part on the recalculated field value weights. | 0.965915 |
10. A computer-implemented process for increasing the speed of text entry, comprising: using a computing device for: receiving text in the form of a phonetic string; determining the language and the script of the phonetic string; generating a list of candidates in the determined language and the determined script to replace the phonetic string, while performing automatic script changing when a user changes from typing the text in a first script to typing text in a second script; ranking the candidates in the list of candidates; sending the ranked list of candidates back to the user; the user selecting one of the candidates on the ranked list of candidates to replace the input phonetic string; and replacing the input phonetic string with the user-selected candidate in the text the user is typing. | 10. A computer-implemented process for increasing the speed of text entry, comprising: using a computing device for: receiving text in the form of a phonetic string; determining the language and the script of the phonetic string; generating a list of candidates in the determined language and the determined script to replace the phonetic string, while performing automatic script changing when a user changes from typing the text in a first script to typing text in a second script; ranking the candidates in the list of candidates; sending the ranked list of candidates back to the user; the user selecting one of the candidates on the ranked list of candidates to replace the input phonetic string; and replacing the input phonetic string with the user-selected candidate in the text the user is typing. 19. The computer-implemented process of claim 10 , wherein the input text in the form of a phonetic string is received from the user as a verbal command and is converted to text. | 0.802863 |
1. An apparatus comprising: a processing platform comprising one or more processing devices each comprising a processor coupled to a memory, the processing platform being configured for combined processing of structured and unstructured service event data; the structured service event data comprising service event data stored in one or more structured data fields of a service events database; the unstructured service event data including documents comprising unstructured text data of the service events database, the unstructured service event data comprising unstructured service request summaries including one or more problem summaries and one or more corresponding solution summaries; wherein the processing platform is configured: to apply preprocessing to the unstructured text data by: constructing one or more term indexes of the unstructured text data based at least in part on associations between the unstructured service request summaries and structured data in one or more of the structured data fields of the service events database; generating, for a domain comprising the documents, one or more in-domain dictionaries utilizing the one or more term indexes; processing the one or more in-domain dictionaries to construct a topic model; and automatically determining at least a subset of a plurality of topics automatically utilizing the topic model, as sets of related terms from the unstructured text data, without reference to a set of rules characterizing predefined topics; to assign each of the documents to one or more of a plurality of clusters corresponding to respective topics; to provide an interface configured to permit selection of one or more of the structured data fields; and to generate at least one visualization as a function of the selected one or more structured data fields and particular ones of the cluster topics that relate to the selected one or more structured data fields. | 1. An apparatus comprising: a processing platform comprising one or more processing devices each comprising a processor coupled to a memory, the processing platform being configured for combined processing of structured and unstructured service event data; the structured service event data comprising service event data stored in one or more structured data fields of a service events database; the unstructured service event data including documents comprising unstructured text data of the service events database, the unstructured service event data comprising unstructured service request summaries including one or more problem summaries and one or more corresponding solution summaries; wherein the processing platform is configured: to apply preprocessing to the unstructured text data by: constructing one or more term indexes of the unstructured text data based at least in part on associations between the unstructured service request summaries and structured data in one or more of the structured data fields of the service events database; generating, for a domain comprising the documents, one or more in-domain dictionaries utilizing the one or more term indexes; processing the one or more in-domain dictionaries to construct a topic model; and automatically determining at least a subset of a plurality of topics automatically utilizing the topic model, as sets of related terms from the unstructured text data, without reference to a set of rules characterizing predefined topics; to assign each of the documents to one or more of a plurality of clusters corresponding to respective topics; to provide an interface configured to permit selection of one or more of the structured data fields; and to generate at least one visualization as a function of the selected one or more structured data fields and particular ones of the cluster topics that relate to the selected one or more structured data fields. 2. The apparatus of claim 1 wherein selection of the one or more structured data fields via the interface activates a structured data filter which adapts the visualization in accordance with the selected one or more structured data fields. | 0.530593 |
8. A computer system comprising: a data storage medium; a network interface for communicating between said data storage medium and said data sources; a user interface in communication with said network interface and said data storage medium; wherein said computer system implements a computer program for searching and retrieving data from said plurality of heterogeneous data sources, the program comprising: a configure element for communicating with each data source, wherein each data source has at least one associated data source type or data source owner; a data source owner of said at least one data source uses meta-data information to pre-configure data of said data source based on said data source type or data source owner; said configure element is configured to configure and select at least one data source from which to retrieve data; the selection is based on said pre-configured data of said data source type or data source owner; a search element for communicating with the configure element and each selected data source, said search element configured to retrieve said data from at least one of the heterogeneous data sources in accordance with a task request; a search translator for each data source, to communicate with both the configure element and the search element; wherein said data storage medium stores at least the retrieved data; said user interface is configured to allow a user to provide said request and view said retrieved data; wherein each of said search translators is associated with one of said data source type or data source owner; wherein each of said search translators verifies that a search request syntax provided by said search element is appropriate to its corresponding data source type or data source owner; and wherein said search translators are selected from a group consisting of SQL translators, X-QUERY translators, XPATH translators, and Directory SDK for Java translators. | 8. A computer system comprising: a data storage medium; a network interface for communicating between said data storage medium and said data sources; a user interface in communication with said network interface and said data storage medium; wherein said computer system implements a computer program for searching and retrieving data from said plurality of heterogeneous data sources, the program comprising: a configure element for communicating with each data source, wherein each data source has at least one associated data source type or data source owner; a data source owner of said at least one data source uses meta-data information to pre-configure data of said data source based on said data source type or data source owner; said configure element is configured to configure and select at least one data source from which to retrieve data; the selection is based on said pre-configured data of said data source type or data source owner; a search element for communicating with the configure element and each selected data source, said search element configured to retrieve said data from at least one of the heterogeneous data sources in accordance with a task request; a search translator for each data source, to communicate with both the configure element and the search element; wherein said data storage medium stores at least the retrieved data; said user interface is configured to allow a user to provide said request and view said retrieved data; wherein each of said search translators is associated with one of said data source type or data source owner; wherein each of said search translators verifies that a search request syntax provided by said search element is appropriate to its corresponding data source type or data source owner; and wherein said search translators are selected from a group consisting of SQL translators, X-QUERY translators, XPATH translators, and Directory SDK for Java translators. 11. A system according to claim 8 , wherein the configure element comprises a data source configurator operable to communicate with each of the data sources and an administrative element operable to communicate with the search element. | 0.526042 |
11. The method of claim 1 , wherein at least one trending topic of the trending topics is a topic cluster including multiple related trending topics. | 11. The method of claim 1 , wherein at least one trending topic of the trending topics is a topic cluster including multiple related trending topics. 13. The method of claim 11 , wherein the related trending topics are trending topics that have a cosine similarity index larger than a predetermined threshold value. | 0.963372 |
1. A method for a portable media player compatible with a peripheral device, comprising: connecting to the peripheral device; receiving from the peripheral device a user interface (UI) document defining layout and functionality of a UI for interacting with the peripheral device, the UI document identifying a widget and an update rate for the widget; and executing a UI presentation program by a microprocessor of the portable media player to generate the UI based on the UI document, the executing comprising: displaying the UI for the peripheral device on a display of the portable media player; periodically requesting information from the peripheral device at the update rate in the UI document; and in response to the information, updating the UI in a manner described by the UI document. | 1. A method for a portable media player compatible with a peripheral device, comprising: connecting to the peripheral device; receiving from the peripheral device a user interface (UI) document defining layout and functionality of a UI for interacting with the peripheral device, the UI document identifying a widget and an update rate for the widget; and executing a UI presentation program by a microprocessor of the portable media player to generate the UI based on the UI document, the executing comprising: displaying the UI for the peripheral device on a display of the portable media player; periodically requesting information from the peripheral device at the update rate in the UI document; and in response to the information, updating the UI in a manner described by the UI document. 7. The method of claim 1 , wherein the executing further comprises: receiving an input from a user through the UI; in response to the input, modifying an operation of the portable media player in a manner described by the UI document. | 0.569271 |
2. The method of claim 1 wherein the plurality of edges i and the plurality of nodes form a telecommunication network and the descriptive data is associated with communication sessions utilizing resources of the telecommunication network during a predetermined time, wherein each edge i represents a connection through which at least one communication session was connected during the predetermined time period. | 2. The method of claim 1 wherein the plurality of edges i and the plurality of nodes form a telecommunication network and the descriptive data is associated with communication sessions utilizing resources of the telecommunication network during a predetermined time, wherein each edge i represents a connection through which at least one communication session was connected during the predetermined time period. 3. The method of claim 2 wherein the plurality of descriptive attributes j associated with the plurality of edges j comprise at least one of an amount of communication sessions over the corresponding edge j, an accumulated duration measure for communication sessions over the corresponding edge j, an amount of common neighbors for the nodes associated with the corresponding edge j, and one or more demographic parameters for the nodes associated with the corresponding edge j. | 0.91617 |
8. A computer-implemented method of co-browsing a transactional document comprising: fetching, via an interaction module of an online conferencing transactional platform system, an image of a transactional document and a field identifier for an interactive transactional document element to be filled out; executing, via a processor, code of the online conferencing transactional platform system interaction module to associate the interactive transactional document element with coordinates on a webpage background displaying the transactional document, wherein the interactive transactional document element to overlay a location for an corresponding transactional document element appearing in the webpage background display of the transactional document; transmitting a webpage display of the transactional document and the interactive transactional document element in real time for co-browsing to a signer end user terminal via a network interface device and to a moderator terminal such that the displayed interactive transactional document elements are aligned with corresponding coordinates in real time on both the signer end user terminal and the moderator terminal for simultaneous review and edit; simultaneously displaying a video-conference image on the webpage display transmitted to the signer terminal; receiving at a storage device user input from the signer end user terminal and the moderator terminal corresponding to the interactive transactional document element associated with the field identifier, wherein the field identifier has a field network address; posting the transactional document and received information corresponding to the interactive transactional document element associated with the field identifier to a remotely-connected secure signature application programming interface (API); and receiving a filled-out transactional document in an i-frame from the remotely-connected secure signature API, and to transmit the filled-out transactional document i-frame for display to the signer end user terminal to enable a secure embedded signature process at the signer terminal. | 8. A computer-implemented method of co-browsing a transactional document comprising: fetching, via an interaction module of an online conferencing transactional platform system, an image of a transactional document and a field identifier for an interactive transactional document element to be filled out; executing, via a processor, code of the online conferencing transactional platform system interaction module to associate the interactive transactional document element with coordinates on a webpage background displaying the transactional document, wherein the interactive transactional document element to overlay a location for an corresponding transactional document element appearing in the webpage background display of the transactional document; transmitting a webpage display of the transactional document and the interactive transactional document element in real time for co-browsing to a signer end user terminal via a network interface device and to a moderator terminal such that the displayed interactive transactional document elements are aligned with corresponding coordinates in real time on both the signer end user terminal and the moderator terminal for simultaneous review and edit; simultaneously displaying a video-conference image on the webpage display transmitted to the signer terminal; receiving at a storage device user input from the signer end user terminal and the moderator terminal corresponding to the interactive transactional document element associated with the field identifier, wherein the field identifier has a field network address; posting the transactional document and received information corresponding to the interactive transactional document element associated with the field identifier to a remotely-connected secure signature application programming interface (API); and receiving a filled-out transactional document in an i-frame from the remotely-connected secure signature API, and to transmit the filled-out transactional document i-frame for display to the signer end user terminal to enable a secure embedded signature process at the signer terminal. 13. The computer implemented method of claim 8 further comprising: transmitting to the remotely-connected secure signature API a first signer signature for the filled-out transactional document i-frame prior to initiating remote signing secure signature process by a second signer end user. | 0.51996 |
1. A method comprising: outputting, by a computing device and for display at a presence-sensitive display, a graphical keyboard comprising a plurality of keys; receiving, by the computing device, an indication of a multi-touch gesture detected at the presence-sensitive display, the multi-touch gesture performed by a user having a first finger and a second finger, the multi-touch gesture comprising a first sub-gesture of the first finger that traverses a first group of keys of the plurality of keys and a second sub-gesture of the second finger that traverses a second group of keys of the plurality of keys, the first sub-gesture being disjoint from the second sub-gesture, wherein at least a portion of the first sub-gesture is performed simultaneously with at least a portion the second sub-gesture; determining, by the computing device and in response to receiving the indication of the first sub-gesture of the first finger and the second sub-gesture of the second finger, a candidate word based at least in part on the first and second groups of keys, wherein the determining comprises: determining, by the computing device and based at least in part on the first sub-gesture of the first finger, a first group of points on the presence-sensitive display traversed by the first sub-gesture; determining, by the computing device and based at least in part on the second sub-gesture of the second finger, a second group of points on the presence-sensitive display traversed by the second sub-gesture; determining, by the computing device and based at least in part on the first and second groups of points on the presence-sensitive display, at least one probability that at least one key included in at least one of the first and second groups of keys is associated with at least one of the first sub-gesture of the first finger and the second sub-gesture of the second finger; and determining, by the computing device, the candidate word based at least in part on the at least one probability that the at least one key is associated with at least one of the first sub-gesture of the first finger and the second sub-gesture of the second finger; and outputting, by the computing device and for display at the presence-sensitive display, the candidate word. | 1. A method comprising: outputting, by a computing device and for display at a presence-sensitive display, a graphical keyboard comprising a plurality of keys; receiving, by the computing device, an indication of a multi-touch gesture detected at the presence-sensitive display, the multi-touch gesture performed by a user having a first finger and a second finger, the multi-touch gesture comprising a first sub-gesture of the first finger that traverses a first group of keys of the plurality of keys and a second sub-gesture of the second finger that traverses a second group of keys of the plurality of keys, the first sub-gesture being disjoint from the second sub-gesture, wherein at least a portion of the first sub-gesture is performed simultaneously with at least a portion the second sub-gesture; determining, by the computing device and in response to receiving the indication of the first sub-gesture of the first finger and the second sub-gesture of the second finger, a candidate word based at least in part on the first and second groups of keys, wherein the determining comprises: determining, by the computing device and based at least in part on the first sub-gesture of the first finger, a first group of points on the presence-sensitive display traversed by the first sub-gesture; determining, by the computing device and based at least in part on the second sub-gesture of the second finger, a second group of points on the presence-sensitive display traversed by the second sub-gesture; determining, by the computing device and based at least in part on the first and second groups of points on the presence-sensitive display, at least one probability that at least one key included in at least one of the first and second groups of keys is associated with at least one of the first sub-gesture of the first finger and the second sub-gesture of the second finger; and determining, by the computing device, the candidate word based at least in part on the at least one probability that the at least one key is associated with at least one of the first sub-gesture of the first finger and the second sub-gesture of the second finger; and outputting, by the computing device and for display at the presence-sensitive display, the candidate word. 21. The method of claim 1 , wherein the candidate word is determined contemporaneously with receiving at least one of the first sub-gesture and the second sub-gesture at the presence-sensitive display. | 0.661602 |
5. The computer-implemented method of claim 1 , wherein the action taken in response to identifying that the mobile device completed the gesture comprises providing feedback to a person, the feedback comprising at least one of auditory feedback, tactile feedback, and visual feedback. | 5. The computer-implemented method of claim 1 , wherein the action taken in response to identifying that the mobile device completed the gesture comprises providing feedback to a person, the feedback comprising at least one of auditory feedback, tactile feedback, and visual feedback. 6. The computer-implemented method of claim 5 , wherein the feedback indicates that speech recording is commencing. | 0.930647 |
20. The computer implemented method of claim 19 , wherein scanning the base information for potential keywords and comparing the potential keywords against a database of keywords comprises applying a rules-based algorithm to assess the potential keywords from the base information against a database of keywords. | 20. The computer implemented method of claim 19 , wherein scanning the base information for potential keywords and comparing the potential keywords against a database of keywords comprises applying a rules-based algorithm to assess the potential keywords from the base information against a database of keywords. 21. The computer implemented method of claim 20 further comprising maintaining a heat index for each of the keywords in the database of, the heat index reflecting the frequency in which the first keyword appears in job searches. | 0.879487 |
1. A method comprising: determining a first plurality of proposed solutions for a clustered storage system, wherein each of the first plurality of proposed solutions comprises a set of configuration settings of the clustered storage system for the proposed solution and a set of one or more specific actions to execute on the clustered storage system to implement the proposed solution; for each of the first plurality of proposed solutions, determining a first service level objective evaluation value for a first service level objective of a workload of the clustered storage system, wherein determining the first service level objective evaluation value uses a first predicted value for a first service level objective metric of the first service level objective and a first target value of the first service level objective metric; determining a proposed solution evaluation value for the proposed solution based, at least in part, on the first service level objective evaluation value and a first predicted value for a first cost metric corresponding to the proposed solution; selecting a first proposed solution from the first plurality of proposed solutions based, at least in part, on the proposed solution evaluation values computed for the first plurality of proposed solutions; and applying the selected first proposed solution to the clustered storage system. | 1. A method comprising: determining a first plurality of proposed solutions for a clustered storage system, wherein each of the first plurality of proposed solutions comprises a set of configuration settings of the clustered storage system for the proposed solution and a set of one or more specific actions to execute on the clustered storage system to implement the proposed solution; for each of the first plurality of proposed solutions, determining a first service level objective evaluation value for a first service level objective of a workload of the clustered storage system, wherein determining the first service level objective evaluation value uses a first predicted value for a first service level objective metric of the first service level objective and a first target value of the first service level objective metric; determining a proposed solution evaluation value for the proposed solution based, at least in part, on the first service level objective evaluation value and a first predicted value for a first cost metric corresponding to the proposed solution; selecting a first proposed solution from the first plurality of proposed solutions based, at least in part, on the proposed solution evaluation values computed for the first plurality of proposed solutions; and applying the selected first proposed solution to the clustered storage system. 2. The method of claim 1 , wherein determining the first plurality of proposed solutions is based on detection of a trigger, wherein the trigger comprises one of a service level objective violation, addition of a workload to the clustered storage system, removal of a workload from the clustered storage system, modification of one of the workloads of the clustered storage system, addition of a storage resource to the clustered storage system, removal of a storage resource from the clustered storage system, and modification of a storage resource in the clustered storage system. | 0.591851 |
1. A method of displaying annotations created for different versions of a document comprising: determining, by operation of one or more processors, a family identifier associated with the document, having an initial version and one or more subsequent versions, wherein the family identifier is associated with the initial version of the document and with the one or more subsequent versions, and wherein each subsequent version of the document modifies textual content of the document relative to other versions; determining, by operation of the one or more processors, a version identifier associated with one of the versions of the document, wherein the version identifier provides an indication of either the initial version or a given one of the subsequent versions of the document; retrieving, from an annotation store, a set of one or more annotation records wherein each retrieved annotation record indicates the family identifier and the determined version identifier of the document displaying, for each annotation record with a version identifier matching the determined version identifier, an indication that annotation content is available for a text passage in the version of the document associated with the determined version identifier; retrieving, from the annotation store, at least a first annotation record, wherein the first annotation record has a version identifier that does not match the determined version identifier; upon determining that the first annotation record is associated with annotated content not present in the document associated with the determined version identifier, displaying an indication that annotated content is available for the text content not present in the document associated with the determined version identifier; upon request, displaying the annotation content associated with the first annotation along with annotated content from a version of the document associated with the first annotation; and selecting at least one annotation record with a matching family identifier but non-matching version identifier to associate with the determined version of the document. | 1. A method of displaying annotations created for different versions of a document comprising: determining, by operation of one or more processors, a family identifier associated with the document, having an initial version and one or more subsequent versions, wherein the family identifier is associated with the initial version of the document and with the one or more subsequent versions, and wherein each subsequent version of the document modifies textual content of the document relative to other versions; determining, by operation of the one or more processors, a version identifier associated with one of the versions of the document, wherein the version identifier provides an indication of either the initial version or a given one of the subsequent versions of the document; retrieving, from an annotation store, a set of one or more annotation records wherein each retrieved annotation record indicates the family identifier and the determined version identifier of the document displaying, for each annotation record with a version identifier matching the determined version identifier, an indication that annotation content is available for a text passage in the version of the document associated with the determined version identifier; retrieving, from the annotation store, at least a first annotation record, wherein the first annotation record has a version identifier that does not match the determined version identifier; upon determining that the first annotation record is associated with annotated content not present in the document associated with the determined version identifier, displaying an indication that annotated content is available for the text content not present in the document associated with the determined version identifier; upon request, displaying the annotation content associated with the first annotation along with annotated content from a version of the document associated with the first annotation; and selecting at least one annotation record with a matching family identifier but non-matching version identifier to associate with the determined version of the document. 2. The method of claim 1 , wherein the family identifier comprises a hash value generated from a SHA-1, MD5, or other hash algorithm. | 0.5 |
1. A computer-implemented method of automatically generating a coherence score for a text using a scoring model, comprising: identifying a plurality of lexical chains within a text to be scored with a processing system, wherein a lexical chain comprises a set of words spaced within the text, certain words in the lexical chain being non-contiguous; identifying a discourse element within the text with the processing system based on lookup operations with a computer database of discourse elements, wherein the discourse element comprises a word within the text; determining a coherence metric with the processing system based on a relationship between the lexical chains and the discourse element; wherein determining the coherence metric comprises determining: a first count of lexical chains that end before the discourse element; a second count of lexical chains that begin after the discourse element; and a third count of lexical chains that begin before and end after the discourse element; wherein the coherence metric is determined based on the first count, the second count, and the third count; generating a coherence score using the processing system by applying a scoring model to the coherence metric, wherein the scoring model comprises multiple weighted features whose feature weights are determined by training the scoring model relative to a plurality of training texts, the coherence score being combined with other non-lexical chain features by an automated essay evaluation engine to determine a transmitted quality level of the text. | 1. A computer-implemented method of automatically generating a coherence score for a text using a scoring model, comprising: identifying a plurality of lexical chains within a text to be scored with a processing system, wherein a lexical chain comprises a set of words spaced within the text, certain words in the lexical chain being non-contiguous; identifying a discourse element within the text with the processing system based on lookup operations with a computer database of discourse elements, wherein the discourse element comprises a word within the text; determining a coherence metric with the processing system based on a relationship between the lexical chains and the discourse element; wherein determining the coherence metric comprises determining: a first count of lexical chains that end before the discourse element; a second count of lexical chains that begin after the discourse element; and a third count of lexical chains that begin before and end after the discourse element; wherein the coherence metric is determined based on the first count, the second count, and the third count; generating a coherence score using the processing system by applying a scoring model to the coherence metric, wherein the scoring model comprises multiple weighted features whose feature weights are determined by training the scoring model relative to a plurality of training texts, the coherence score being combined with other non-lexical chain features by an automated essay evaluation engine to determine a transmitted quality level of the text. 4. The method of claim 1 , wherein a plurality of discourse elements are identified within the text, wherein one or more coherence metrics are determined for each of the plurality of discourse elements. | 0.54837 |
12. A method for submitting a query and receiving results on a wireless mobile device comprising the steps of: speaking to said wireless mobile device a predefined command for starting a query; speaking requisite information for said query to said wireless mobile device; converting said information to text in said wireless device; formatting, in said wireless device, said text for a messaging protocol to create a message; addressing resulting message to a search engine; and transmitting said message from said wireless device, over a wireless network to said search engine. | 12. A method for submitting a query and receiving results on a wireless mobile device comprising the steps of: speaking to said wireless mobile device a predefined command for starting a query; speaking requisite information for said query to said wireless mobile device; converting said information to text in said wireless device; formatting, in said wireless device, said text for a messaging protocol to create a message; addressing resulting message to a search engine; and transmitting said message from said wireless device, over a wireless network to said search engine. 17. The method of claim 12 wherein said query is selected from a list of available queries on said wireless mobile device. | 0.570225 |
11. A system for font recommendation comprising: one or more processors configured to: obtain a product category; determine whether a font recommendation should be made with respect to the product category, comprising: obtain font information of a frequently used font within a webpage that corresponds to a product in the product category; and determine whether a predetermined correspondence exists between the product category and the frequently used font, including by looking up the product category and the frequently used font in the plurality of predetermined correspondences, wherein the font recommendation is to be made in the event that no predetermined correspondence is determined; in the event that the font recommendation should be made: determine a recommended font that corresponds to the product category, the determination being based at least in part on a plurality of predetermined correspondences, and the plurality of predetermined correspondences indicating associations between a plurality of product categories and a respective plurality of fonts; and output information pertaining to the recommended font; and a memory coupled to the one or more processors and configured to provide the processor with instructions. | 11. A system for font recommendation comprising: one or more processors configured to: obtain a product category; determine whether a font recommendation should be made with respect to the product category, comprising: obtain font information of a frequently used font within a webpage that corresponds to a product in the product category; and determine whether a predetermined correspondence exists between the product category and the frequently used font, including by looking up the product category and the frequently used font in the plurality of predetermined correspondences, wherein the font recommendation is to be made in the event that no predetermined correspondence is determined; in the event that the font recommendation should be made: determine a recommended font that corresponds to the product category, the determination being based at least in part on a plurality of predetermined correspondences, and the plurality of predetermined correspondences indicating associations between a plurality of product categories and a respective plurality of fonts; and output information pertaining to the recommended font; and a memory coupled to the one or more processors and configured to provide the processor with instructions. 12. The system of claim 11 , wherein the one or more processors are further configured to: receive, from a user, product information, wherein the product category is extracted from the product information. | 0.731379 |
1. A method for generating a plurality of application programming interfaces (APIs) in a codeless manner, the method comprising: receiving a request for a plurality of APIs based on a description of a database schema; upon identifying the database schema description, generating a set of data graphs that identifies relationships between a set of data objects included in the description; generating the plurality of APIs based on the set of data graphs and providing the generated APIs to a user for selecting a subset of the plurality of APIs; and upon selection of an API, generating a JavaScript object notation based model (JSON-based model) associated with the selected API, the JSON-based model comprising a JSON file and a JavaScript (JS) file for an application to use to exchange data with the database. | 1. A method for generating a plurality of application programming interfaces (APIs) in a codeless manner, the method comprising: receiving a request for a plurality of APIs based on a description of a database schema; upon identifying the database schema description, generating a set of data graphs that identifies relationships between a set of data objects included in the description; generating the plurality of APIs based on the set of data graphs and providing the generated APIs to a user for selecting a subset of the plurality of APIs; and upon selection of an API, generating a JavaScript object notation based model (JSON-based model) associated with the selected API, the JSON-based model comprising a JSON file and a JavaScript (JS) file for an application to use to exchange data with the database. 5. The method of claim 1 , wherein the identification of the database schema description comprises connecting to a data storage that includes the database. | 0.631161 |
6. The accumulator-based phase memory of claim 5 , wherein the waveform generator is located on a direct digital synthesis (DDS) device. | 6. The accumulator-based phase memory of claim 5 , wherein the waveform generator is located on a direct digital synthesis (DDS) device. 7. The accumulator-based phase memory of claim 6 , wherein the divide-by-N clock is located on the DDS device. | 0.927243 |
1. A system, comprising: one or more processors; and memory that includes a plurality of computer-executable components executable by the one or more processors, the plurality of computer-executable components comprising: a pre-processing component to process a bilingual web page into a Document Object Model (DOM) tree that includes at least one node; a seed mining component to link bilingual snippet pairs of the at least one node into a plurality of translation snippet pairs; a pattern learning component to determine one or more best fit candidate patterns based on the plurality of translation snippet pairs via a Support Vector Machine (SVM) classifier; a data mining component to mine one or more translation pairs from the bilingual web page using the one or more best fit candidate patterns; and a data storage component to store the one or more translation pairs, wherein the one or more translation pairs including at least one of a term pair, a phrase pair, or a sentence pair. | 1. A system, comprising: one or more processors; and memory that includes a plurality of computer-executable components executable by the one or more processors, the plurality of computer-executable components comprising: a pre-processing component to process a bilingual web page into a Document Object Model (DOM) tree that includes at least one node; a seed mining component to link bilingual snippet pairs of the at least one node into a plurality of translation snippet pairs; a pattern learning component to determine one or more best fit candidate patterns based on the plurality of translation snippet pairs via a Support Vector Machine (SVM) classifier; a data mining component to mine one or more translation pairs from the bilingual web page using the one or more best fit candidate patterns; and a data storage component to store the one or more translation pairs, wherein the one or more translation pairs including at least one of a term pair, a phrase pair, or a sentence pair. 11. The system of claim 1 , data mining component is to mine one or more translation pairs from the bilingual web page by: merging each bilingual snippet pair of the one or more nodes in the bilingual web page into a string; transforming each of the one or more best fit candidate patterns into a standard regular expression; and matching the one or more standard regular expressions with the strings to derive translation pairs. | 0.519908 |
1. A system for bridging a first communications network having a payload subnetwork and a signaling subnetwork with a second communications network that is packet-switched, comprising: a. a communications management object that coordinates the transfer of information between the first communications network and the second communications network, wherein the communications management object coordinates the transfer of information between the first communications network and the second communications network by initiating at least one of the tasks of communications session setup, communications session tear down, bridging of two communications requests or routing of a communications to a communications access point in one of the first communications network or the second communications network. b. a payload object linked to the communications management object, wherein said payload object transfers payload information between the system and the payload subnetwork of the first communications network; c. a signaling object linked to the communications management object, wherein said signaling object transfers signaling information between the system and the signaling subnetwork of the first communications network in accordance with a signaling protocol associated with the signaling subnetwork; and d. a packet object linked to the communications management object, wherein said packet object transfers payload and address information between the system and the second communications network in accordance with a communications protocol associated with the second communications network. | 1. A system for bridging a first communications network having a payload subnetwork and a signaling subnetwork with a second communications network that is packet-switched, comprising: a. a communications management object that coordinates the transfer of information between the first communications network and the second communications network, wherein the communications management object coordinates the transfer of information between the first communications network and the second communications network by initiating at least one of the tasks of communications session setup, communications session tear down, bridging of two communications requests or routing of a communications to a communications access point in one of the first communications network or the second communications network. b. a payload object linked to the communications management object, wherein said payload object transfers payload information between the system and the payload subnetwork of the first communications network; c. a signaling object linked to the communications management object, wherein said signaling object transfers signaling information between the system and the signaling subnetwork of the first communications network in accordance with a signaling protocol associated with the signaling subnetwork; and d. a packet object linked to the communications management object, wherein said packet object transfers payload and address information between the system and the second communications network in accordance with a communications protocol associated with the second communications network. 2. The system according to claim 1, wherein the payload object may be linked to a plurality of access points contained within the payload subnetwork of the first communications network. | 0.617481 |
17. 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 collection of facts, each fact represented as an entity-attribute-value tuple; identifying expected values for one or more individual attributes, where the identifying expected values includes, for each particular attribute: identifying facts having the attribute, calculating a value score for facts of the collection of facts having the particular attribute for each particular value, calculating a global score for all facts of the collection having the attribute, and comparing the value score to the global score such that a value is identified as an expected value if the comparison satisfies a specified threshold. | 17. 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 collection of facts, each fact represented as an entity-attribute-value tuple; identifying expected values for one or more individual attributes, where the identifying expected values includes, for each particular attribute: identifying facts having the attribute, calculating a value score for facts of the collection of facts having the particular attribute for each particular value, calculating a global score for all facts of the collection having the attribute, and comparing the value score to the global score such that a value is identified as an expected value if the comparison satisfies a specified threshold. 20. The computer storage medium of claim 17 , further comprising instructions that when executed by data processing apparatus cause the data processing apparatus to perform operations comprising: receiving one or more string-category associations, where each string is associated with zero or more categories; identifying a category for facts in the collection of facts using the strings of the facts; calculating a category score for facts of the collection of facts having the particular attribute and belonging to the category; and comparing the category score to the global score such that the category is identified as an expected category for the attribute if the comparison satisfies a specified threshold. | 0.5 |
13. A computer-implemented method, comprising: receiving, in a media content authoring environment, a command to provide to a runtime environment a piece of media comprising a runtime-determined movement of a hierarchical object, the runtime-determined movement determined using the inverse kinematics procedure to move component objects of the hierarchical object in order to position an end effector on the hierarchical object nearer to a target location, the inverse kinematics procedure moving the component objects in response to receiving a variable identifying the end effector and the target location; and providing the piece of media for consumption by a consumption application in the runtime environment separate from the media content authoring environment, wherein the piece of media comprises the inverse kinematics procedure, wherein the inverse kinematics procedure uses both an authoring environment variable specified in the media content authoring environment and a runtime variable separately specified at runtime to determine a movement for the hierarchical object, and wherein the consumption application does not comprise the inverse kinematics procedure. | 13. A computer-implemented method, comprising: receiving, in a media content authoring environment, a command to provide to a runtime environment a piece of media comprising a runtime-determined movement of a hierarchical object, the runtime-determined movement determined using the inverse kinematics procedure to move component objects of the hierarchical object in order to position an end effector on the hierarchical object nearer to a target location, the inverse kinematics procedure moving the component objects in response to receiving a variable identifying the end effector and the target location; and providing the piece of media for consumption by a consumption application in the runtime environment separate from the media content authoring environment, wherein the piece of media comprises the inverse kinematics procedure, wherein the inverse kinematics procedure uses both an authoring environment variable specified in the media content authoring environment and a runtime variable separately specified at runtime to determine a movement for the hierarchical object, and wherein the consumption application does not comprise the inverse kinematics procedure. 16. The method of claim 13 , wherein the runtime variable specifies the target location. | 0.67182 |
14. A non-transitory computer readable storage medium having embodied thereon a program, the program being executable by a processor for performing a method comprising: receiving, by a social networking computer system, an advertisement request from an advertiser to advertise using a social networking system; identifying an indication in the advertisement request of an action on an object, the action selectable by the advertiser from a plurality of actions on objects provided to the advertiser by the social networking computer system; identifying an indication in the advertisement request for providing a message to a viewing user that another user connected to the viewing user in the social networking system has performed the indicated action; determining, by the social networking computer system, that the identified action was taken on the object by another user connected to the viewing user; receiving, at the social networking computer system from a client device of the viewing user, a request for social networking information to be displayed in a web page that is within a domain of an external system that is different from a domain of the social networking system; selecting, by the social networking computer system, a story for the viewing user for display on the client device as a social advertisement, wherein: the story is sponsored by an advertiser and is based on the advertisement request received by the social networking computer system, and the story comprises information about the identified action taken on the object by the other user; and sending, by the social networking computer system, the social advertisement to the client device for display in the interface of the page of the web page of the external system. | 14. A non-transitory computer readable storage medium having embodied thereon a program, the program being executable by a processor for performing a method comprising: receiving, by a social networking computer system, an advertisement request from an advertiser to advertise using a social networking system; identifying an indication in the advertisement request of an action on an object, the action selectable by the advertiser from a plurality of actions on objects provided to the advertiser by the social networking computer system; identifying an indication in the advertisement request for providing a message to a viewing user that another user connected to the viewing user in the social networking system has performed the indicated action; determining, by the social networking computer system, that the identified action was taken on the object by another user connected to the viewing user; receiving, at the social networking computer system from a client device of the viewing user, a request for social networking information to be displayed in a web page that is within a domain of an external system that is different from a domain of the social networking system; selecting, by the social networking computer system, a story for the viewing user for display on the client device as a social advertisement, wherein: the story is sponsored by an advertiser and is based on the advertisement request received by the social networking computer system, and the story comprises information about the identified action taken on the object by the other user; and sending, by the social networking computer system, the social advertisement to the client device for display in the interface of the page of the web page of the external system. 21. The computer readable storage medium of claim 14 , wherein sponsorship of the story selected for display as a social advertisement maximizes the chance that the story will be provided for display to the viewing user in a situation where the story might not otherwise be selected for display. | 0.554596 |
23. The system of claim 19 , wherein the language model is trained using a corpus that has been annotated to distinguish between the first pronunciation and the second pronunciation of the first candidate character. | 23. The system of claim 19 , wherein the language model is trained using a corpus that has been annotated to distinguish between the first pronunciation and the second pronunciation of the first candidate character. 24. The system of claim 23 , wherein for at least one of the first pronunciation and second pronunciation of the first candidate character, a corresponding new symbol or encoded representation thereof is created and added to the annotated corpus. | 0.94494 |
1. A system for document analysis, comprising a processor and software configured to a) receive textual documents over an electronic communication network and convert textual documents into image files, identify text in said image files, wherein said text is mapped to the document image using a database comprising text of the document; b) permit a user to add contextual markups to said image files wherein said contextual markups are images or HTML tags that are added to an invisible image that maps exactly onto each image of said image file, and wherein said image file is not modified, c) generate an originality report, wherein said generating said originality report comprises the step of highlighting said sections of said image file identified in the originality report as allegedly containing plagiarized text, wherein said highlighting is glyph aware highlighting that associates glyphs with images using the pixel coordinates of the image, which maps to a text database of said document; and d) display said image file on a display screen, wherein said image file simultaneously displays said contextual markups and said highlights. | 1. A system for document analysis, comprising a processor and software configured to a) receive textual documents over an electronic communication network and convert textual documents into image files, identify text in said image files, wherein said text is mapped to the document image using a database comprising text of the document; b) permit a user to add contextual markups to said image files wherein said contextual markups are images or HTML tags that are added to an invisible image that maps exactly onto each image of said image file, and wherein said image file is not modified, c) generate an originality report, wherein said generating said originality report comprises the step of highlighting said sections of said image file identified in the originality report as allegedly containing plagiarized text, wherein said highlighting is glyph aware highlighting that associates glyphs with images using the pixel coordinates of the image, which maps to a text database of said document; and d) display said image file on a display screen, wherein said image file simultaneously displays said contextual markups and said highlights. 4. The system of claim 1 , wherein said documents are selected from the group consisting of assignments, students' manuscripts, grant applications and journal manuscripts. | 0.662797 |
1. A computerized method for constructing, analyzing, displaying, and editing a mathematical formula entered by a user for use in a software application, said computerized method comprising the acts of: responsive to receiving a mathematical formula entered into said software application by said user, said computerized method providing, to a display device viewable by said user, an application-preferred view of said mathematical formula, said application-preferred view suitable for use in said software application utilizing said mathematical formula; responsive to receiving a mathematical formula entered into said software application by said user, said computerized method providing, to said display device viewable by said user, one or more additional views of said mathematical formula, said one or more additional views different from said application-preferred view, wherein at least one of said one or more additional views of said mathematical formula displays a hierarchical diagram graphically clarifying the structure of said mathematical formula; and responsive to providing said one or more additional views of said mathematical formula, providing one or more computerized means configured for synchronizing the display of said application-preferred and said one or more additional views of said mathematical formula. | 1. A computerized method for constructing, analyzing, displaying, and editing a mathematical formula entered by a user for use in a software application, said computerized method comprising the acts of: responsive to receiving a mathematical formula entered into said software application by said user, said computerized method providing, to a display device viewable by said user, an application-preferred view of said mathematical formula, said application-preferred view suitable for use in said software application utilizing said mathematical formula; responsive to receiving a mathematical formula entered into said software application by said user, said computerized method providing, to said display device viewable by said user, one or more additional views of said mathematical formula, said one or more additional views different from said application-preferred view, wherein at least one of said one or more additional views of said mathematical formula displays a hierarchical diagram graphically clarifying the structure of said mathematical formula; and responsive to providing said one or more additional views of said mathematical formula, providing one or more computerized means configured for synchronizing the display of said application-preferred and said one or more additional views of said mathematical formula. 10. The method of claim 1 , in which at least one of said one or more computerized means configured for synchronizing the display, to said display device, of said application-preferred and said one or more additional views of said mathematical formula is operative to cause a display device to reflect the selection or highlighting of one or more portions of said mathematical formula in one of said views by causing said display device to select or highlight the same or related portions of said mathematical formula in at least one other of said views. | 0.5 |
1. A method of displaying in a calculator, comprising: receiving a first mathematical expression in an expression entry area on the calculator; displaying results in a first window on the calculator, wherein the results displayed in the first window comprise a result for the first mathematical expression; displaying, in a second window on the calculator, a usage history comprising the first mathematical expression, a second mathematical expression, and results displayed in the second window, wherein the results displayed in the second window comprise the result for the first mathematical expression and a result for the second mathematical expression, wherein the usage history is displayed in a hierarchical tree such that a result for a given mathematical expression is displayed in the second window on a different hierarchical level than the given mathematical expression; and displaying organizational tabs for the second window, wherein each organizational tab is operable to display a given category of data associated with the usage history, and wherein the results in the first window and the results in the second window are displayed simultaneously. | 1. A method of displaying in a calculator, comprising: receiving a first mathematical expression in an expression entry area on the calculator; displaying results in a first window on the calculator, wherein the results displayed in the first window comprise a result for the first mathematical expression; displaying, in a second window on the calculator, a usage history comprising the first mathematical expression, a second mathematical expression, and results displayed in the second window, wherein the results displayed in the second window comprise the result for the first mathematical expression and a result for the second mathematical expression, wherein the usage history is displayed in a hierarchical tree such that a result for a given mathematical expression is displayed in the second window on a different hierarchical level than the given mathematical expression; and displaying organizational tabs for the second window, wherein each organizational tab is operable to display a given category of data associated with the usage history, and wherein the results in the first window and the results in the second window are displayed simultaneously. 6. The method of claim 1 , wherein the given mathematical expression is displayed on a parent level and the result for the given mathematical expression is displayed on a child level under the given mathematical expression. | 0.606531 |
10. The information processing apparatus according to claim 1 , wherein said description information is represented by a tree structure including a plurality of leaves bearing the same keyword; each of said plurality of leaves corresponds to an end of said tree structure, and said information processing apparatus further comprises: a description information conversion means for assigning said keyword and ID information representing said keyword to at least one of said plurality of leaves, and assigning reference information corresponding to said ID information to the other leaves, and said storage means stores the converted description information provided from said description information conversion means. | 10. The information processing apparatus according to claim 1 , wherein said description information is represented by a tree structure including a plurality of leaves bearing the same keyword; each of said plurality of leaves corresponds to an end of said tree structure, and said information processing apparatus further comprises: a description information conversion means for assigning said keyword and ID information representing said keyword to at least one of said plurality of leaves, and assigning reference information corresponding to said ID information to the other leaves, and said storage means stores the converted description information provided from said description information conversion means. 11. The information processing apparatus according to claim 10 , wherein said description information conversion means assigns said keyword and said ID information to the one leaf appearing first in said tree structure among said plurality of leaves. | 0.828259 |
7. The computer system of claim 6 , wherein the identified additional terms are ranked based at least in part on a relationship network corresponding to search query object. | 7. The computer system of claim 6 , wherein the identified additional terms are ranked based at least in part on a relationship network corresponding to search query object. 8. The computer system of claim 7 , wherein the relationship network is generated from a pre-existing knowledgebase. | 0.922704 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.