90 likes | 199 Vues
In this lecture, Sandiway Fong discusses the intricacies of Japanese grammar, focusing on predicate-argument structures. Key topics include the rules for declarative, wh-, and yes/no questions and the conversion of syntactic parse trees into more computable structures. The lecture covers the processes involved in utilizing lexical items, specifically using the example of "taroo-gahon-o.kaimashita" to illustrate the predicate-argument format. Students are reminded of their upcoming homework due and are guided through modifying lexical and syntactic rules.
E N D
LING 388: Language and Computers Sandiway Fong Lecture25
Administrivia • Reminder: • Homework 8 due on Thursday
jg24.pl • S rules: for declarative, wh- and yes/no-questions, scrambled and unscrambled
jg24.pl • VP, sentence-final and case particle rules:
jg24.pl • Lexical items:
Today’s Topic • Let’s have the Japanese grammar compute predicate-argument structures instead of syntactic parse trees: • taroo-gahon-o kaimashita • BuyerGoodspredicate(Framenet: Commerce_buy) • kaimashita(taroo,hon) for simplicity of implementation, let’s use the notation: • predarg(<Predicate>,<Argument1>,<Argument2>) • predarg(kau+past,taroo,hon)
Converting j24.pl • Step 1: remove the syntactic labels from the lexical rules New lexical rules:
Converting j24.pl • Step 2: change the S and VP rules to output predarg(V,Subject,Object,Mark)
Converting j24.pl • Let’s convert all the other rules: