An even simpler technique would be to parse texts in a random order conditioning each meaning m k for k ∈ {1,..., K} on all the previous semantics m <k = m 1 ,..., m k−1 : Here, and in further discussion, we assume that the above search problem can be efficiently solved, exactly or approximately.
a major weakness of this algorithm is that decisions about components of the composite semantic representation (e.g., argument values) are made only on the basis of a single text, which first mentions the corresponding aspects, without consulting any future texts k > k, and these decisions cannot be revised later.