Natural Language Premise Selection: Finding Supporting Statements for Mathematical Text
Table 4: Comparing number of hops needed for obtaining premises.
['[EMPTY]', 'TFIDF', 'PV-DBOW']
We can also consider the fact that the premises are transitive, i.e., if one a mathematical text τi has a premise x and a mathematical text τj has τi as a premise, then x should also be a premise of τj. From the results, we notice that the more hops needed to obtain the premise, the worse our baselines perform.