Affiliation:
1. Nanchang University
2. Jiangxi Normal University
Abstract
In this paper, we discuss a technique based on semantic constraints to improve the performance and portability of a reformulation-based question answering system. First, we present a method for acquiring semantic-based reformulations automatically. The goal is to generate patterns from correlative articles based on lexical, syntactic and semantic constraints. and a method to evaluate and re-rank candidate answers that satisfy these constraints is adopted. The evaluation on questions from TREC QA tracks 2003 and 2004 shows that the automatically acquired semantic patterns allows us to avoid the manual work of formulating semantically equivalent reformulations, while still reach an acceptable performance.
Publisher
Trans Tech Publications, Ltd.
Reference20 articles.
1. Hovy, E., Gerber et al., Towards semantics-based answer pinpointing. In: Proc. First International Conf. Human Language Technology Research. Association for Computational Linguistics, Morristown, USA, 2001. p.1–7.
2. C.S. Lee, Y.F. Kao, Y.H. Kuo, M.H. Wang, Automated ontology construction for unstructured text documents, Journal of Data & Knowledge Engineering , 2007(60), p.547–566.
3. Hoojung Chung et al., A practical QA system in restricted domains, in: Proceedings of the ACL 2004 Workshop on Question Answering in Restricted Domains, Spain, 2004, p.223–236.
4. Zhang, D., Lee, W.S., Question classification using support vector machines. In: Proc. 26th Annual International ACM SIGIR Conf. Research and Development in Information Retrieval. ACM Press, New York, USA, 2003, p.26–32.
5. D. Moldovan, M. Pasca, S. Harabagiu, M. Surdeanu, Performance issue and error analysis in an open-domain question answering system, ACM Transactions on Information Systems (TOIS) 21 (2) , 2003, pp.113-154.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献