Specifically, for text data in languages L 1 , ..., L s , if we represent each language as a node in a graph and connect those language pairs for which we have a bilingual dictionary, the minimum requirement is that the whole graph is connected.
as a minimum, we will need s − 1 distinct bilingual dictionaries.