17. A method for generating a text generation system comprising: receiving n-gram statistics for a set of n-grams, generated for a corpus of documents or receiving the set of n-grams and generating the n-gram statistics therefrom; generating an input directed graph based on the n-gram statistics, edges of the input directed graph being joined through nodes of the graph, each edge having an associated label corresponding to a sequence of symbols in the corpus and a multiplicity, representing a number of occurrences of the sequence of symbols in the corpus, of at least one, each of the n-grams in the set being represented by a respective one of the labels, whereby a Eulerian cycle through the graph traverses each edge a number of times corresponding to the multiplicity of the edge; iteratively applying at least one reduction rule to generate a reduced directed graph, edges of the reduced directed graph being joined through nodes of the reduced directed graph, each edge having an associated label consisting of a sequence of symbols and a multiplicity of at least one, one path through the reduced directed graph in which each edge is traversed the respective multiplicity of times reconstructing the corpus sequence from the labels in the order in which the edges are traversed, and wherein the sequences of symbols in the reduced directed graph vary in number of symbols; providing a text generation component which receives an input sequence of symbols and, in a first iteration, generates a first output sequence as a candidate for appending to the input sequence of symbols, the first output sequence being generated from a selected label of the reduced directed graph, the label being selected by sampling a label from an identified set of labels with a probability which is a function of the multiplicity of the edges that are labeled with the labels in the set of labels, the selected label including a prefix and a suffix, the prefix of the selected label matching at least a last symbol of the input sequence of symbols, the suffix of the selected label following the prefix, the suffix including at least one symbol; and providing a graphical user interface for displaying, to a user, at least one of: the first output sequence, an extended output sequence generated by the text generation in a subsequent iteration, and a document generated from the first output sequence or extended output sequence, the extended output sequence including the first output sequence and at least one subsequent output sequence generated from a further selected label of the reduced directed graph; wherein at least one of the iteratively applying of the at least one reduction rule and the providing of the text generation component is performed with a processor.
17. A method for generating a text generation system comprising: receiving n-gram statistics for a set of n-grams, generated for a corpus of documents or receiving the set of n-grams and generating the n-gram statistics therefrom; generating an input directed graph based on the n-gram statistics, edges of the input directed graph being joined through nodes of the graph, each edge having an associated label corresponding to a sequence of symbols in the corpus and a multiplicity, representing a number of occurrences of the sequence of symbols in the corpus, of at least one, each of the n-grams in the set being represented by a respective one of the labels, whereby a Eulerian cycle through the graph traverses each edge a number of times corresponding to the multiplicity of the edge; iteratively applying at least one reduction rule to generate a reduced directed graph, edges of the reduced directed graph being joined through nodes of the reduced directed graph, each edge having an associated label consisting of a sequence of symbols and a multiplicity of at least one, one path through the reduced directed graph in which each edge is traversed the respective multiplicity of times reconstructing the corpus sequence from the labels in the order in which the edges are traversed, and wherein the sequences of symbols in the reduced directed graph vary in number of symbols; providing a text generation component which receives an input sequence of symbols and, in a first iteration, generates a first output sequence as a candidate for appending to the input sequence of symbols, the first output sequence being generated from a selected label of the reduced directed graph, the label being selected by sampling a label from an identified set of labels with a probability which is a function of the multiplicity of the edges that are labeled with the labels in the set of labels, the selected label including a prefix and a suffix, the prefix of the selected label matching at least a last symbol of the input sequence of symbols, the suffix of the selected label following the prefix, the suffix including at least one symbol; and providing a graphical user interface for displaying, to a user, at least one of: the first output sequence, an extended output sequence generated by the text generation in a subsequent iteration, and a document generated from the first output sequence or extended output sequence, the extended output sequence including the first output sequence and at least one subsequent output sequence generated from a further selected label of the reduced directed graph; wherein at least one of the iteratively applying of the at least one reduction rule and the providing of the text generation component is performed with a processor. 18. The method of claim 17 , wherein the generating of the first output sequence comprises, for the first iteration: identifying a set of the labels for the edges in the reduced directed graph, which each include, as a prefix, at least the last symbol of the input sequence, and as a suffix, at least one subsequent symbol; sampling a label from the set, and generating the first output sequence from the suffix of the label.