Unless stated otherwise, we use two hidden layers, while in Section 5.3 we further analyze the influence of parameter H. To identify which word pairs are translations, one could enumerate all translation pairs and feed them to the classifier g. The time complexity of this brute-force approach is O(|V S | × |V T |) times the complexity of g. For large vocabularies this can be a prohibitively expensive procedure.
we have resorted to a heuristic which uses a noisy classifier: it generates 2N c << |V T | translation candidates for each source language word w S as follows.