ABSTRACT
In parsing, a schematic way to show, economically and without redundancy, the syntactic representations of all possible well-formed substrings of a sentence. Since sentences of natural language frequently contain structurally ambiguous strings of words, as well as clearly definable constituents, it is often not possible to decide which of the possible structures of a string of words are appropriate for interpretation ( ambiguity). In order not to recompute all the parts of each new analysis (i.e. backtrack) in ambiguous structures, all pieces of accumulated knowledge are put into the chart, where they can be consulted as often as necessary and in any possible combination. One can picture a chart simply as a collection of all the possible tree diagrams of all the substrings of a sentence, in which the same parts of different tree diagrams are always represented only once.
