{'fraction_non_alphanumeric': 0.023391812865497075, 'fraction_numerical': 0.0, 'mean_word_length': 5.340740740740741, '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}}
Query Classification Based on Regularized Correlated Topic Model

This paper addresses the problem of query classification (QC), which aims to classify Web search queries into one or more predefined categories. The state-of-the-art solution for QC is to employ a bridging classifier via an intermediate taxonomy. In this paper, we advanced the bridging method by leveraging probabilistic topic models. The topic model, referred as RCTM (Regularized Correlated Topic Model), is an extension of the conventional CTM (Correlated Topic Model). RCTM learns a topic model by leveraging weak supervision from existing annotated data rather than in an unsupervised fashion, and thus it can effectively address the problem in topic modeling while the topics are predefined. The experimental evaluations show that our QC approach outperforms other baseline methods.