Variant Search and Syntactic Tree Similarity Based Approach to Retrieve Matching Questions for SMS queries

摘要

Community based Question Answering archives have emerged as a very useful resource for instant access to comprehensive information in response to user queries. However, its access remains restricted to internet users. Access to this resource through Short Message Service (SMS) requires that a high precision automatic similar question matching system be built in order to decrease the search time by decreasing the number of SMS exchanges required. This paper proposes a solution that handles inherent noise in SMS queries through variant search, modeling the problem as one of combinatorial search. Following this, it uses syntactic tree matching to improve the ranking scheme. We present our analysis of the system and conduct experiments to test its feasibility. Experiments show that our approach outperforms the existing approaches significantly.