3. The system of claim 1 , wherein each of said one or more marked-MDTs comprise a tuple (N, E, T), in which N is a set of one or more nodes n, wherein each of the one or more nodes n comprise a tuple(x, a, m) in which x comprises coordinates of the node n in a semantic space S, wherein S is one of a plurality of semantic spaces in a configuration selected from one of: singular semantic space, nested semantic spaces, parallel semantic spaces, or a combination thereof, a is a string tied to a single alphabet α, and m comprises a set of information about the node comprising one or more of: part of speech, inflection, tense, person, mood, case, animacy, shape, case, and position within a MDT, E is a set of one or more directed edges, either identical or differentiated by type, between coordinates x∈S of the one or more nodes n in N, and, T is a topic stack.
1. A system for translation from a first human language to a second language, comprising: one or more processors; and, one or more non-transitory memory units coupled to said one or more processors storing computer readable program instructions, wherein the computer readable program instructions configure the one or more processors to perform the steps of: receive an input representation of information in the first language; convert the input representation of information in the first language to one or more sets of one or more marked-lemma dependency trees (MDTs); convert said one or more sets of one or more marked-MDTs to a representation of information in said second language; and output said representation of information in said second language.