Variant search and syntactic tree similarity based approach to retrieve matching questions for SMS queries

Authors:
Akhil Langer;Rohit Banga;Ankush Mittal;L. Venkata Subramaniam
Affiliations:
IIT Roorkee, Roorkee, India;IIT Roorkee, Roorkee, India;College of Engineering Roorkee, Roorkee, India;IBM India Research Lab, New Delhi, India
Venue:
AND '10 Proceedings of the fourth workshop on Analytics for noisy unstructured text data
Year:
2010

Citing 6
Cited 1

Techniques for automatically correcting words in text

ACM Computing Surveys (CSUR)
Bitext maps and alignment via pattern recognition

Computational Linguistics
Language Models for Handwritten Short Message Services

ICDAR '07 Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01
A syntactic tree matching approach to finding similar questions in community-based qa services

Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval
SMS based interface for FAQ retrieval

ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
A generalized framework of exploring category information for question retrieval in community question answer archives

Proceedings of the 19th international conference on World wide web

A novel software system to facilitate better and easier communication for people with speaking disabilities

Proceedings of the International Conference on Advances in Computing, Communications and Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.