System and method for text analysis

A computer implemented method for generating a Directed Acyclic Graph (DAG) from an initial multi-chain subject to at least one constraint, the method comprising:

• expressing the initial multi-chain as a character string that serves as a current input string to which the at least one constraint is subsequently applied;
• providing at least one regular expression that expresses the at least one constraint, said at least one regular expression being in a character string format and being denoted as P;
• applying P to the current input string to generate at least one output string, wherein each generated output string violates the at least one constraint to a lesser extent than does the input string or does not violate the at least one constraint, and wherein each generated output string violating the at least one constraint will serve as a current input string to which the at least one constraint is subsequently applied;
• and
• recursively repeating said applying P to each current input string that had been determined from applying P previously, until said applying P does not generate any more output strings violating the at least one constraint, wherein a set of the generated output strings that do not violate the at least one constraint represents the DAG.

A computer program product stored on a computer usable medium, said computer program product comprising computer readable program code adapted to perform a method for generating a Directed Acyclic Graph (DAG) from an initial multi-chain subject to at least one constraint, the method comprising:

• expressing the initial multi-chain as a character string that serves as a current input string to which the at least one constraint is subsequently applied;
• providing at least one regular expression that expresses the at least one constraint, said at least one regular expression being in a character string format and being denoted as P;
• applying P to the current input string to generate at least one output string, wherein each generated output string violates the at least one constraint to a lesser extent than does the input string or does not violate the at least one constraint, and wherein each generated output string violating the at least one constraint will serve as a current input string to which the at least one constraint is subsequently applied;
• and
• recursively repeating said applying P to each current input string that had been determined from applying P previously, until said applying P does not generate any more output strings violating the at least one constraint, wherein a set of the generated output strings that do not violate the at least one constraint represents the DAG.

A computer system comprising a processor and a computer usable memory, said memory storing computer readable program code which when executed by the processor performs a method for generating a Directed Acyclic Graph (DAG) from an initial multi-chain subject to at least one constraint, the method comprising:

• expressing the initial multi-chain as a character string that serves as a current input string to which the at least one constraint is subsequently applied;
• providing at least one regular expression that expresses the at least one constraint, said at least one regular expression being in a character string format and being denoted as P;
• applying P to the current input string to generate at least one output string, wherein each generated output string violates the at least one constraint to a lesser extent than does the input string or does not violate the at least one constraint, and wherein each generated output string violating the at least one constraint will serve as a current input string to which the at least one constraint is subsequently applied;
• and
• recursively repeating said applying P to each current input string that had been determined from applying P previously, until said applying P does not generate any more output strings violating the at least one constraint, wherein a set of the generated output strings that do not violate the at least one constraint represents the DAG.