Competitive Grammar Writing Johns Hopkins University竞争性语法写作约翰霍普金斯大学.pptVIP

Eisner Tromble - HLT-NAACL Workshop on Computationally Hard Methods and Joint Inference in NLP - June 2006 Competitive Grammar Writing Jason Eisner Noah A. Smith Johns Hopkins Carnegie Mellon TeachCL Workshop @ ACL – June 20, 2008 1. Welcome to the lab exercise! Please form teams of ~3 people … Programmers, get a linguist on your team And vice-versa Undergrads, get a grad student on your team And vice-versa 2. Okay, team, please log in The 3 of you should use adjacent workstations Log in as individuals Your secret team directory: cd …/03-turbulent-kiwi You can all edit files there Publicly readable writeable No one else knows the secret directory name 3. Now write a grammar of English You have 2 hours. ? 3. Now write a grammar of English 1 S1 ? NP VP . 1 VP ? VerbT NP 20 NP ? Det N’ 1 NP ? Proper 20 N’ ? Noun 1 N’ ? N’ PP 1 PP ? Prep NP 3. Now write a grammar of English 1 S1 ? NP VP . 1 VP ? VerbT NP 20 NP ? Det N’ 1 NP ? Proper 20 N’ ? Noun 1 N’ ? N’ PP 1 PP ? Prep NP 3. Now write a grammar of English 3. Now write a grammar of English 1 S1 ? NP VP . 1 VP ? VerbT NP 20 NP ? Det N’ 1 NP ? Proper 20 N’ ? Noun 1 N’ ? N’ PP 1 PP ? Prep NP 3. Now write a grammar of English 1 S1 ? NP VP . 1 VP ? VerbT NP 20 NP ? Det N’ 1 NP ? Proper 20 N’ ? Noun 1 N’ ? N’ PP 1 PP ? Prep NP 4. Okay – go! 4. Okay – go! We’ll sample 20 random sentences from your PCFG. Human judges will vote on whether each sentence is grammatical. By the way, y’all will be the judges (double-blind). 5. Evaluation procedure We’ll sample 20 random sentences from your PCFG. Human judges will vote on whether each sentence is grammatical. Development set You might want your grammar to generate … Arthur is the king . Arthur rides the horse near the castle . riding to Camelot is hard . do coconuts speak ? what does Arthur ride ? who does Arthur suggest she carry ? why does England have a king ? are they suggesting Arthur ride to Camelot ? five strangers are at the Round Table . Gu