Learning for Deep Language Understanding
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 1858-1864.
Abstract
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntactic-semantic grammar formalism for deep language understanding, which balances expressiveness with provable learnability results. The learnability result for LWFGs assumes that the semantic composition constraints are learnable. In this paper, we show what are the properties and principles the semantic representation and grammar formalism require, in order to be able to learn these constraints from examples, and give a learning algorithm. We also introduce a LWFG parser as a deductive system, used as an inference engine during LWFG induction. An example for learning a grammar for noun compounds is given.
@inproceedings{ijcai2011p311,
title = {Learning for Deep Language Understanding},
author = {Muresan, Smaranda},
booktitle = {Proceedings of the Twenty-Second International Joint Conference on
Artificial Intelligence, {IJCAI-11}},
publisher = {AAAI Press/International Joint Conferences on Artificial Intelligence},
editor = {Toby Walsh},
pages = {1858--1864},
year = {2011},
month = {7},
doi = {10.5591/978-1-57735-516-8/IJCAI11-311},
url = {https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-311},
}
TY - CPAPER TI - Learning for Deep Language Understanding AU - Muresan, Smaranda T2 - Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11 PB - AAAI Press/International Joint Conferences on Artificial Intelligence PY - 2011 SP - 1858 EP - 1864 DO - 10.5591/978-1-57735-516-8/IJCAI11-311 UR - https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-311 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: