{'fraction_non_alphanumeric': 0.028058361391694726, 'fraction_numerical': 0.029180695847362513, 'mean_word_length': 5.109589041095891, '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}}
Learning an optimal distance metric in a linguistic vector space

Much natural language processing still depends on the Euclidean distance function between the two feature vectors, but the Euclidean distance suffers from severe defects as to feature weightings and feature correlations. In this paper we propose an optimal metric distance function that can be used as an alternative to the Euclidean distance, accommodating the two problems at the same time. This metric is optimal in the sense of global quadratic minimization, and can be obtained from the clusters in the training data in a supervised fashion.We have confirmed the effect of the proposed metric by the sentence retrieval, document retrieval, and K-means clustering of general vectorial data. © 2006 Wiley Periodicals, Inc. Syst Comp Jpn, 37(9): 12–21, 2006; Published online in Wiley InterScience (). DOI 10.1002sscj.20533