When I was working on making the homebrew tests for ACE, I ran into the question of what is an actual good test for confirming ACE works end to end? For better or worse, I made the decision to attempt to create the smallest possible grammar that would still generate a parse by hacking away at
The result is https://github.com/dantiston/delphin-tiniest-grammar. As noted in the repo, it parses one string (
"n1 iv") and it generates the following MRS:
SENT: n1 iv [ LTOP: h0 INDEX: event2 RELS: < [ "_n1_n_rel"<-1:-1> LBL: handle3 ARG0: ref-ind4 ] [ "_iv_v_rel"<-1:-1> LBL: handle1 ARG0: event2 ARG1: ref-ind5 ] > HCONS: < h0 qeq handle1 > ]
I have some questions.
- I don’t remember all the details about my problem, but I struggled to get the
bare-npphrase to work, and subsequently the MRS does not have a quantifier relation. I am under the impression that means this is an invalid MRS, is that correct? If so, is it worth it to get the quantifier relation in, either forcibly or through the
- The grammar doesn’t have any lexical rules; should it to be useful?
- I tried and failed to get generation to work. I’m not sure if it didn’t work because I cut something important out (something from
semi.vpm?) or some other reason. I suppose testing generation is just as important as parsing?
- Does anyone else think this would be useful for their projects (or for pedagogy)? If so, should we move it to the main delphin repo?
Also, I haven’t tested it with the LKB yet