Based on this first step relations connecting recognized entities can be extracted from texts as well.
We can generalize the definitions of contextual approximations by using the notion of k-step relation [16].
The result of the problem is found by finding a k-step relation returning a nonempty set.
(k-step relation) Let Δ I be the nonempty universe set, S a binary relation in Δ I, and k a natural number.
The idea behind the k-step relation is that when we are using a similarity relation, e.g., S Σ, it may happen that S Σ 1⊆S Σ 2⊆⋯⊆S Σ n.
Further, the law allows the loan to "relations, whether by consanguinity, adoption, or step-relation".
His mother is one of 33 siblings (no, it's not a typo), half-brothers and step-relations included.
Therein, as on ancient parchment, he scratched and then erased the names of all the people he had met but never wanted to know save Jack and Jackie Kennedy, step-relations, whose names he dropped whenever he could.He wrote 25 novels, some forgettable, others of sweeping scale and scope, in which factual "memoirs" of great men were intercut with asides by onlookers.
In the same way, the number of k-step relations is bounded by O |N I |) (line 5).
If all k-step relations return empty sets, then the solution will be empty (i.e., there are no contexts to solve the problem).
