8 Then, for the 50 closest matching images, we check if at least one of the caption contains either the target word or the competitor.
as the competitor is embedded in the longer word, we expect the network to produce an embedding close to that of the competitor at the beginning and then when the acoustic signal does 7 Phonemic transcription found in CMU Pronouncing Dictionnary was used 8 we compute the cosine distance between the embedding produced at time step t and all the images (5000) of our collection.