9. A system for improving efficiency of a computing device in extracting actionable information from a message, comprising: a parser, operable to receive a hierarchically structured message having text content and operable to break the message into nodes based on the hierarchical structure of the message, wherein the nodes are organized according to a tree structure corresponding to the hierarchical structure; a domain dictionary, in communication with the parser; a template library, in communication with the parser; wherein the parser is further operable to identify keywords in nodes of the message matching entries in the domain dictionary and assign node scores to each of the nodes based on keyword presence; wherein the parser is further operable to identify an area of interest in the message, the area of interest comprising a parent node and a child node of the parent node, based on the child node having a highest node score that is furthest from a root of the tree structure; wherein the parser is further operable to identify a template for the message from the template library, wherein the template library is built based on identifying tree structures and node scores from one or more areas of interest identified in previous messages; and wherein the parser is further operable to extract actionable information from the area of interest based on the template.
9. A system for improving efficiency of a computing device in extracting actionable information from a message, comprising: a parser, operable to receive a hierarchically structured message having text content and operable to break the message into nodes based on the hierarchical structure of the message, wherein the nodes are organized according to a tree structure corresponding to the hierarchical structure; a domain dictionary, in communication with the parser; a template library, in communication with the parser; wherein the parser is further operable to identify keywords in nodes of the message matching entries in the domain dictionary and assign node scores to each of the nodes based on keyword presence; wherein the parser is further operable to identify an area of interest in the message, the area of interest comprising a parent node and a child node of the parent node, based on the child node having a highest node score that is furthest from a root of the tree structure; wherein the parser is further operable to identify a template for the message from the template library, wherein the template library is built based on identifying tree structures and node scores from one or more areas of interest identified in previous messages; and wherein the parser is further operable to extract actionable information from the area of interest based on the template. 11. The system of claim 9 , wherein the keywords include: names; dates; holidays; and times.