{'fraction_non_alphanumeric': 0.028906955736224028, 'fraction_numerical': 0.004516711833785004, 'mean_word_length': 5.087912087912088, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Building a global dictionary for semantic technologies

This paper proposes a novel method for ﬁnding linear mappings among word vectors for various languages. Compared to previous approaches, this method does not learn translation matrices between two speciﬁc languages, but between a given language and a shared, universal space. The system was trained in two different modes, ﬁrst between two languages, and after that applying three languages at the same time. In the ﬁrst case two different training data were applied; Dinu’s English-Italian benchmark data [1], and English-Italian translation pairs extracted from the PanLex database [2]. In the second case only the PanLex database was used. The system performs on English-Italian languages with the best setting signiﬁcantly better than the baseline system of Mikolov et al. [3], and it provides a comparable performance with the more sophisticated systems of Faruqui and Dyer [4] and Dinu et al. [1]. Exploiting the richness of the PanLex database, the proposed method makes it possible to learn linear mappings among an arbitrary number languages.