In light of this weakness, we recast requirements traceability as a supervised binary classification task, where we classify each pair of highand low-level requirements as positive (having a link) or negative (not having a link).
we propose a knowledge-rich approach to the task, where we extend a supervised baseline employing only word pairs and LDA-induced topics as features (see Section 4) with two types of humansupplied knowledge.