On word pairs that are linked by "complex paths", i.e., more than one rule (lachen V -lächerlich A in Figure 1), our main observation in this respect is that rule paths show a clear "weakest link" property.
in this paper, we have addressed the task of recovering this distinction and called it semantic validation.