Tom Kwiatkowski,
Luke Zettlemoyer,
Sharon Goldwater and
Mark Steedman.
2010.
Inducing probabilistic CCG grammars from logical form with higher-order unification. In
Proceedings of the 2010 conference on empirical methods in natural language processing, pp
1223--1233.
Association for Computational Linguistics. cit
82. [
spf, semparse, d=geo]
pdf annote google scholar
(****)
Sentence to logical form mapping using CCG and unification (UBL) instead of GenLex.
Geo dataset, four languages, two meaning representations (funql, lambda).
Start with single lex item for each sentence mapping it to LF.
Introduce vertical bar | to ccg which can match / or \. (ZC07 similar?)
Understand the SGD gradient possibly reading CC07.
Starting with single lex item and trying splits look much less ad-hoc than ZC05,07 with Genlex and initial lexicon.
Only the proper noun NPs (e.g. Texas) are in the initial lexicon.
4.1 splitting constraints interesting, can learn them from data?
The split-merge process seem a bit ad-hoc, a more principled Bayesian approach may be possible.
Good related work discussion in Sec 6.
UBL geo880: p=.941 r=.850 f=.893
UBL-s (2pass): p=.885 r=.879 f=.882