A Learnable Constraint-based Grammar Formalism

@inproceedings{Muresan2010ALC,
  title={A Learnable Constraint-based Grammar Formalism},
  author={Smaranda Muresan},
  booktitle={COLING},
  year={2010}
}
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic 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… CONTINUE READING
3 Citations
17 References
Similar Papers

Similar Papers

Loading similar papers…