12 Computational complexity is not an issue for standard semantic benchmarks such as SimLex-999 or MEN: these data sets require only N gt similarity computations in total, where N gt is the number of word pairs in each benchmark (999 or 3000).
complexity plays a major role in the USF evaluation: the system has to compute |W c | • |V r | similarity scores, where |W c | ≈ 5, 000, and |V r | is large for large vocabularies (typically covering > 100K words).