2. A system for automated ontology building, comprising: a contextual token recognizer for creating, from text, representing at least one of date and time; a dependency graph calculator for calculating a dependency graph across the contextual tokens using at least one parse tree obtained by parsing the text; an instance generator for generating concept instance candidates and parent-child relationships based on pattern matching and transformation of the at least one parse tree; a concept candidate identifier for grouping concept instance candidates into concept candidates using concept candidate keys, the concept candidate keys being a sequence of triplets; a concept candidate based tree former for arranging the concept candidates into a tree having tree nodes and creating predicate-based relationships between the tree nodes based on patterns and predicates identified in the text; a node scorer and sorter for scoring and sorting the tree nodes; a tree rebalancer for performing an analysis of the tree nodes and rebalancing the tree based on the analysis to provide an ontology based on the text and formed as an output graph comprising a plurality of nodes; and a user interface for editing the ontology by selectively choosing from a plurality of options including adding a new node to the output graph, removing an existing node from the output graph, moving one of the plurality of nodes or a sub-graph across a parent-child hierarchy in the output graph, creating a new relation across the plurality of nodes, and removing an existing relation edges from the output graph.
2. A system for automated ontology building, comprising: a contextual token recognizer for creating, from text, representing at least one of date and time; a dependency graph calculator for calculating a dependency graph across the contextual tokens using at least one parse tree obtained by parsing the text; an instance generator for generating concept instance candidates and parent-child relationships based on pattern matching and transformation of the at least one parse tree; a concept candidate identifier for grouping concept instance candidates into concept candidates using concept candidate keys, the concept candidate keys being a sequence of triplets; a concept candidate based tree former for arranging the concept candidates into a tree having tree nodes and creating predicate-based relationships between the tree nodes based on patterns and predicates identified in the text; a node scorer and sorter for scoring and sorting the tree nodes; a tree rebalancer for performing an analysis of the tree nodes and rebalancing the tree based on the analysis to provide an ontology based on the text and formed as an output graph comprising a plurality of nodes; and a user interface for editing the ontology by selectively choosing from a plurality of options including adding a new node to the output graph, removing an existing node from the output graph, moving one of the plurality of nodes or a sub-graph across a parent-child hierarchy in the output graph, creating a new relation across the plurality of nodes, and removing an existing relation edges from the output graph. 8. The system of claim 2 , wherein each of the concept instance candidates are assigned a priority value based on the contextual tokens.