1. A computer-based method for finding text semantically related to a selected text by comparing one or more tuple conceptual graphs (TCG) for the selected text with one or more tuple conceptual graphs (TCGs) for a plurality of candidate similar texts, comprising the steps of: receiving, in a memory, an input text; parsing the input text, with a processor executing instructions stored in a memory, for syntactic linkages; transforming the parsed input text into one or more linearized conceptual tuple graphs (TCG), said transforming comprising executing an algebraic-based syntactic transformation with a processor in accordance with instructions stored in a memory to generate for the input text, a first TCG comprising one or more of a first name or other TCG identifier and a first set of linearized tuples, and for a plurality of candidate semantically related texts, at least one other TCG comprising one or more of a name or other TCG identifier and at least one other set of linearized tuples, wherein each of the first TCG and at least one other TCG comprise stored semantic relationships; storing each of said first TCG and at least one other TCG in a database; ordering, with a processor, the first and at least one other set of linearized tuples according to a sort criteria, and folding, with the processor, tuple relationships into a minimal canonical representation by successively examining and merging sorted tuple relationships and resolving arguments upon ties; comparing, with the processor, the first TCG and at least one other TCG to determine a match, and if a match is found then identifying the first TCG as an equal or partial match of at least one other TCG; and reporting one or more of the full or the most complete partial matches as similar text.
1. A computer-based method for finding text semantically related to a selected text by comparing one or more tuple conceptual graphs (TCG) for the selected text with one or more tuple conceptual graphs (TCGs) for a plurality of candidate similar texts, comprising the steps of: receiving, in a memory, an input text; parsing the input text, with a processor executing instructions stored in a memory, for syntactic linkages; transforming the parsed input text into one or more linearized conceptual tuple graphs (TCG), said transforming comprising executing an algebraic-based syntactic transformation with a processor in accordance with instructions stored in a memory to generate for the input text, a first TCG comprising one or more of a first name or other TCG identifier and a first set of linearized tuples, and for a plurality of candidate semantically related texts, at least one other TCG comprising one or more of a name or other TCG identifier and at least one other set of linearized tuples, wherein each of the first TCG and at least one other TCG comprise stored semantic relationships; storing each of said first TCG and at least one other TCG in a database; ordering, with a processor, the first and at least one other set of linearized tuples according to a sort criteria, and folding, with the processor, tuple relationships into a minimal canonical representation by successively examining and merging sorted tuple relationships and resolving arguments upon ties; comparing, with the processor, the first TCG and at least one other TCG to determine a match, and if a match is found then identifying the first TCG as an equal or partial match of at least one other TCG; and reporting one or more of the full or the most complete partial matches as similar text. 3. The computer-based method of claim 1 wherein the selected text and the suspected similar texts are textual articles in digital form.