Source code to repeat the paper evaluation: We present the first unsupervised approach to the problem of learning a semantic parser, using Markov logic. Our USP system transforms dependency trees into quasi-logical forms, recursively induces lambda forms from these, and clusters them to abstract away syntactic variations of the same meaning. The MAP semantic parse of a sentence is obtained by recursively assigning its parts to lambda-form clusters and composing them. We evaluate our approach by using it to extract a knowledge base from biomedical abstracts and answer questions. USP substantially outperforms TextRunner, DIRT and an informed baseline on both precision and recall on this task.
M. Banko, M. Cafarella, S. Soderland, M. Broadhead, und O. Etzioni. Proceedings of the 20th International Joint Conference on Artifical Intelligence, Seite 2670--2676. San Francisco, CA, USA, Morgan Kaufmann Publishers Inc., (2007)
S. Basu, A. Banerjee, und R. Mooney. Proceedings of the 2004 SIAM International Conference on Data Mining, Seite 333--344. Lake Buena Vista, FL, Society for Industrial and Applied Mathematics, (April 2004)
N. Chambers, und D. Jurafsky. 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, Seite 602--610. Suntec, Singapore, Association for Computational Linguistics, (August 2009)
C. Christodoulopoulos, S. Goldwater, und M. Steedman. Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing, Seite 575--584. Stroudsburg, PA, USA, Association for Computational Linguistics, (2010)