6. The system of claim 4 , wherein the creator to create an input document schema tree includes an annotator to annotate a subset of the input document schematic tree into a binary tree.
4. A system for decomposing a two-dimensional structured representation of an input document using multiple one-dimensional methods, comprising: a creator to create an input document schema tree with nodes; a deriver to derive a set of valid input paths in the two-dimensional structured representation of the input schema and a set of valid output paths in a two-dimensional structured representation of an output schema; a determiner to determine a first mapping and/or re-labeling function from the input paths into the output paths, applying suitable classification rules; and a determiner to determine a second mapping and/or re-labeling function from the suitable classification rules to structural actions; wherein the determiner to determine a first mapping and/or re-labeling function from the input paths into the output paths, applying suitable classification rules, comprises: an establisher to establish leaf extraction rules that include one-dimensional simple path leaf delimiter candidates, associated classification labels, and associated confidence levels; a storage device to store path candidates in a candidate index wherein the candidate index is in the form of a tree data structure that stores all simple path delimiter candidates, the simple path delimiter candidates including reverse path delimiters, and the candidate index stores information sufficient to determine the most discriminative delimiters; where the candidate index allows incremental accommodation of new annotated samples; a determiner to determine, for each leaf, which leaf delimiter candidate has a highest confidence level; a determiner to determine a classification label for the leaf content based on the leaf delimiter candidate having the highest confidence level; and provider to provide a classification label for each leaf with respect to which leaf delimiter has the highest confidence level to achieve a valid two-dimensional tree according to the output schema.