Abstract: A user is writing an email or other message. The message is inspected for a predetermined word and for at least one of: a predetermined phrase or a template match. A score is generated if the predetermined phrase or the template match is detected. A suggestion is provided to a user that the message may need an attachment if the predetermined word is detected or if the score is greater than a predetermined score. The inspection may begin when the user begins creating the message, indicates that the message should be sent, or at some point in between. The user may provide feedback that the suggestion is accepted or that the suggestion is rejected.

Abstract: A user is writing an email or other message. The message is inspected for a predetermined word and for at least one of: a predetermined phrase or a template match. A score is generated if the predetermined phrase or the template match is detected. A suggestion is provided to a user that the message may need an attachment if the predetermined word is detected or if the score is greater than a predetermined score. The inspection may begin when the user begins creating the message, indicates that the message should be sent, or at some point in between. The user may provide feedback that the suggestion is accepted or that the suggestion is rejected.

Abstract: A user is writing an email or other message. The message is inspected for a predetermined word and for at least one of: a predetermined phrase or a template match. A score is generated if the predetermined phrase or the template match is detected. A suggestion is provided to a user that the message may need an attachment if the predetermined word is detected or if the score is greater than a predetermined score. The inspection may begin when the user begins creating the message, indicates that the message should be sent, or at some point in between. The user may provide feedback that the suggestion is accepted or that the suggestion is rejected.

Abstract: The present disclosure is directed to a method of verifying a compound word. The method includes receiving an input signal indicative of a textual input and accessing a rule and a lexical data structure from data stores. The rule is applied to the textual input to determine whether the textual input is a valid compound word. An output signal is provided that is indicative of whether the textual input is a compound word.

Abstract: A user is writing an email or other message. The message is inspected for a predetermined word and for at least one of: a predetermined phrase or a template match. A score is generated if the predetermined phrase or the template match is detected. A suggestion is provided to a user that the message may need an attachment if the predetermined word is detected or if the score is greater than a predetermined score. The inspection may begin when the user begins creating the message, indicates that the message should be sent, or at some point in between. The user may provide feedback that the suggestion is accepted or that the suggestion is rejected.

Abstract: A user is writing an email or other message. A text processing layer prepares the message for analysis and performs some initial analysis and preparation such as a sentence separator, a “tokenizer”, a “unique body” identification, and/or possibly other filtering or analysis routines. An analytics layer analyzes the message using a “regular expressions” analysis, a statistical natural language processing analysis, and/or a template matching analysis. If an attachment is indicated, a suggestion to add an attachment is provided to the user. The analysis may begin when the user begins creating the message, indicates that the message should be sent, or at some point in between. The user may provide feedback that the suggestion is accepted or that the suggestion is rejected.

Abstract: The present disclosure is directed to a method of verifying a compound word. The method includes receiving an input signal indicative of a textual input and accessing a rule and a lexical data structure from data stores. The rule is applied to the textual input to determine whether the textual input is a valid compound word. An output signal is provided that is indicative of whether the textual input is a compound word.

Abstract: The present disclosure is directed to a method of verifying a compound word. The method includes receiving an input signal indicative of a textual input and accessing a rule and a lexical data structure from data stores. The rule is applied to the textual input to determine whether the textual input is a valid compound word. An output signal is provided that is indicative of whether the textual input is a compound word.

Abstract: A user is writing an email or other message. A text processing layer prepares the message for analysis and performs some initial analysis and preparation such as a sentence separator, a “tokenizer”, a “unique body” identification, and/or possibly other filtering or analysis routines. An analytics layer analyzes the message using a “regular expressions” analysis, a statistical natural language processing analysis, and/or a template matching analysis. If an attachment is indicated, a suggestion to add an attachment is provided to the user. The analysis may begin when the user begins creating the message, indicates that the message should be sent, or at some point in between. The user may provide feedback that the suggestion is accepted or that the suggestion is rejected.

Abstract: Various technologies and techniques are disclosed for aggregating and using data collected from multiple computers to modify a later behavior of those computers. In one implementation, a data aggregation system is described. A data collector is operable to collect behavior data over a network from one or more applications used by the computers, and to save the behavior data to a data store. A data installer is operable to access the behavior data in the data store and convert the behavior data into a format that will modify a future operation of at least one of the applications that is used on at least one of the computers. A method for creating and distributing a custom dictionary from data collected from multiple computers is described. A method for identifying related documents from data collected from multiple computers is also described.

Abstract: A method and product are provided that identify properly spelled words from an input string. Separate lexical entries are identified for different parts of an input word. Grammatical information associated with one of the lexical entries is examined to determine if it satisfies a grammatical constraint associated with another of the lexical entries. A properly spelled word is formed by combining the separate lexical entries if the grammatical information satisfies the constraint. Under some embodiments of the invention, the separate lexical entries are identified by performing a first search of a lexicon using a first part of the input string and by performing a second search of the lexicon using a second part of the input string.

Abstract: The present disclosure is directed to a method of verifying a compound word. The method includes receiving an input signal indicative of a textual input and accessing a rule and a lexical data structure from data stores. The rule is applied to the textual input to determine whether the textual input is a valid compound word. An output signal is provided that is indicative of whether the textual input is a compound word.