This paper presents an approach for inducing transformation rules that map natural-language sentences into a formal semantic representation language. The approach assumes a formal grammar for the target representation language and learns transformation rules that exploit the non-terminal symbols in this grammar. Patterns for the transformation rules are learned using an induction algorithm based on longest-common-subsequences previously developed for an information extraction system. Experimental results are presented on learning to map English coaching instructions for Robocup soccer into an existing formal language for coaching simulated robotic agents.

PDF, PS

In A. Gelbukh, editors, Computational Linguistics and Intelligent Text Processing: Proceedings of the 8th International Conference, CICLing 2007, Mexico City, 311-324, Berlin, 2004. Springer Verlag.

@InCollection{mooney:cicling07, title={Learning Transformation Rules for Semantic Parsing}, author={Rohit J. Kate and Yuk Wah Wong and Ruifang Ge and Raymond J. Mooney}, booktitle={Computational Linguistics and Intelligent Text Processing: Proceedings of the 8th International Conference, CICLing 2007, Mexico City}, editor={A. Gelbukh}, address={Berlin}, publisher={Springer Verlag}, pages={311-324}, url="http://www.cs.utexas.edu/users/ai-lab/pub-view.php?PubID=51483", year={2004} }