Part III. The Declarative Specification of Formal Fragments A - PowerPoint PPT Presentation

Part III. The Declarative Specification of Formal Fragments

A Computational Model of Natural Language Communication 196 11. DBS.1: Hearer-Mode 11.1 Automatic Word Form Recognition 11.1.1 Surface recognition and lexical lookup hearer surface recognition Julia sleeps unanalyzed surface external sign Julia sleeps lexical lookup sur: sleeps sur: Julia analyzed surface noun: Julia verb: sleep (isolated proplet) cat: ns3’ v cat: snp sem: f sem: pres mdr: mdr: fnc: arg: ... idy: + prn: prn: � 2006 Roland Hausser c

A Computational Model of Natural Language Communication 197 11.2 Lexicon of LA-hear.1 11.2.1 The lexical entries of LA-hear.1 proper names: sur: Julia sur: John sur: Susanne 2 3 2 3 2 3 noun: Julia noun: John noun: Susanne 6 7 6 7 6 7 6 7 6 7 6 7 cat: nm cat: nm cat: nm 6 7 6 7 6 7 6 7 6 7 6 7 sem: f sem: m sem: f 6 7 6 7 6 7 6 7 6 7 6 7 mdr: mdr: mdr: 6 7 6 7 6 7 6 7 6 7 6 7 fnc: fnc: fnc: 6 7 6 7 6 7 6 7 6 7 6 7 idy: idy: idy: 4 5 4 5 4 5 prn: prn: prn: sur: sleeps sur: sings sur: dreams 2 3 2 3 2 3 erb: sleep verb: sing verb: dream 6 7 6 7 6 7 6 7 6 7 6 7 cat: ns3 ′ v cat: ns3 ′ v cat: ns3 ′ v 6 7 6 7 6 7 6 7 6 7 6 7 sem: pres sem: pres sem: pres 6 7 6 7 6 7 6 7 6 7 6 7 mdr: mdr: mdr: 6 7 6 7 6 7 6 7 6 7 6 7 6 arg: 7 6 arg: 7 6 arg: 7 6 7 6 7 6 7 6 7 6 7 6 7 nc: nc: nc: 6 7 6 7 6 7 6 pc: 7 6 pc: 7 6 pc: 7 4 5 4 5 4 5 prn: prn: prn: punctuation sign » sur: . – cat: v ′ decl � 2006 Roland Hausser c

A Computational Model of Natural Language Communication 198 11.2.2 Values of the cat attribute decl = declarative sentence nm = proper name ns3 ′ = nominative third person singular valency position v = verb, unmarked for sentence mood v ′ = valency position for verb unmarked for sentence mood 11.2.3 Values of the sem attribute f = femininum m = masculinum pres = present tense � 2006 Roland Hausser c

A Computational Model of Natural Language Communication 199 11.2.4 Intra-propositional continuation attributes arg : specifies the arguments of verbs (list) fnc : specifies the functor of nouns (atom) mdr : specifies the modifiers of nouns and verbs (list) mdd : specifies the modified of adnominals and adverbials (atom) 11.2.5 Extra-propositional continuation attributes idy : identity between nouns. Takes a number as value. nc : next conjunct. Takes an optional conjunction, a proposition number, and a verb concept as value. pc : previous conjunct. Takes values similar to nc . 11.2.6 Book-keeping attribute of LA-hear.1 prn : proposition number � 2006 Roland Hausser c

A Computational Model of Natural Language Communication 200 11.3 Preamble of LA-hear.1 11.3.1 List of binding variables SM = sentence mood VT = verb type filler VT ′ = verb type valency position NP = noun phrase filler NP ′ = noun phrase valency position α, β, γ , etc. = for individual concepts like Julia, sleep, young, etc. i, j, k = for number values of the prn and idy attributes 11.3.2 Restriction of binding variables SM ǫ {decl} VT ǫ {v} VT ′ ǫ {v ′ } NP ǫ {nm} NP ′ ǫ {ns3 ′ } � 2006 Roland Hausser c

A Computational Model of Natural Language Communication 201 11.3.3 Matching between a variable and a constant 2 3 rule level: 4 cat: NP 5 matching? 2 3 language level: 4 cat: nm 5 If variable X has the values a, b, or c, then the variable Y must have the values p or q. 11.3.4 Agreement conditions if VT ǫ { v }, then VT ′ ǫ { v ′ } if NP ǫ { nm }, then NP ′ ǫ { ns3 ′ } � 2006 Roland Hausser c

A Computational Model of Natural Language Communication 202 11.4 Definition of LA-hear.1 11.4.1 Formal Definition of LA-hear.1 ˆ ˜ { 1 NOM+FV }) } ST S = def { ( cat: X NOM+FV {2 S+IP} delete NP ′ nw.cat 2 verb: β 3 acopy α nw.arg 2 3 noun: α cat: NP ′ X VT ecopy β ss.fnc 6 7 cat: NP 6 7 6 7 arg: ecopy PC nw.pc 6 7 6 7 fnc: 6 7 4 5 nc: acopy PCV nw.pc 4 5 prn: k pc: set β NCV copy ss copy nw { 3 IP+START } S+IP replace SM VT 2 3 verb: α set k PC h i cat: VT ′ SM cat: VT 4 5 set α PCV prn: k copy ss IP+START {1 NOM+FV} increment nw.prn 2 3 2 3 verb: α noun: β ecopy k ss.nc cat: SM cat: NP 4 5 4 5 acopy ‘NCV’ ss.nc nc: prn: k copy ss copy nw ST F = def {( ˆ cat: decl ˜ rp S+IP )} � 2006 Roland Hausser c

A Computational Model of Natural Language Communication 203 11.4.2 Definitions of the operations delete variable proplet-attr. = delete the value corresponding to the variable in the corresponding attribute of the corresponding proplet at the level of language. delete NP ′ nw.cat (in NOM+FV) example : acopy variable proplet-attr. = additively copy value(s) corresponding to the variable into the specified target slot; default position is at the end of the target slot. acopy α nw.arg (in NOM+FV) examples : acopy PCV nw.pc (in NOM+FV) acopy ‘NCV’ ss.nc (in IP+START) ecopy variable proplet-attr. = exclusively copy value(s) corresponding to the variable into the specified proplet attribute. ecopy β ss.fnc (in NOM+FV) examples : ecopy PC nw.pc (in NOM+FV) ecopy k ss.nc (in IP+START) set value variable = rule-based (rather than matching-based) binding of a variable to a value. set β NCV (in NOM+FV) examples : set k PC (in S+IP) set α PCV (in S+IP) replace variable2 variable1 = replace value of variable1 with value of variable2. replace SM VT (in S+IP) examples : increment proplet-attr. = increment numerical value of corresponding attribute by one. increment nw.prn (in IP+START) example : copy ss = include the proplets of the sentence start in the result. examples : NOM+FV, S+IP, IP+START copy nw = include the proplet of the next word in the result. examples : NOM+FV, IP+START 11.5 Interpreting a Sequence of Sentences � 2006 Roland Hausser c

A Computational Model of Natural Language Communication 204 11.5.1 Combining Julia and sleeps NOM+FV {2 S+IP} delete NP ′ nw.cat 2 verb: β 3 acopy α nw.arg 2 3 noun: α cat: NP ′ X VT ecopy β ss.fnc 6 7 cat: NP 6 7 6 7 arg: ecopy PC nw.pc 6 7 6 7 fnc: 6 7 4 5 nc: acopy PCV nw.pc 4 5 prn: k set β NCV pc: copy ss copy nw sur: 1.2 sleeps 2 3 2 3 sur: sur: 1.1 Julia 2 3 2 sur: 3 verb: sleep verb: sleep 6 7 6 7 noun: Julia noun: Julia 6 cat: ns3 ′ v 7 6 7 6 7 6 7 cat: v 6 7 6 7 6 7 6 7 cat: nm cat: nm 6 7 6 7 6 7 6 7 sem: pres sem: pres 6 7 6 7 6 7 6 7 sem: f sem: f 6 7 6 7 6 7 6 7 mdr: = mdr: 6 7 6 7 ⇒ 6 7 6 7 mdr: mdr: 6 7 6 7 6 7 6 7 arg: arg: Julia 6 7 6 7 6 7 6 7 fnc: 6 7 fnc: sleep 6 7 6 7 6 7 6 nc: 7 6 nc: 7 6 7 6 7 idy: 1 6 7 idy: 1 6 7 4 5 4 5 6 7 6 7 pc: pc: prn: 1 4 5 prn: 1 4 5 1 1 prn: prn: 1 2 2 � 2006 Roland Hausser c

A Computational Model of Natural Language Communication 205 11.5.2 Combining Julia sleeps and . S+IP {3 IP+START} replace SM VT 2 3 verb: α set k PC cat: VT ′ SM ˆ ˜ cat: VT set α PCV 4 5 prn: k copy ss 2 3 2 3 sur: sur: 2 sur: 3 2 sur: 3 verb: sleep verb: sleep 6 7 6 7 noun: Julia noun: Julia 6 7 6 7 6 7 6 7 cat: v cat: decl 6 7 6 7 6 7 6 7 cat: nm cat: nm 6 7 6 7 6 7 6 7 sem: pres sem: pres 6 7 6 7 » sur: 1.3 . 6 7 6 7 – sem: f sem: f 6 7 6 7 6 7 6 7 mdr: = mdr: 6 7 6 7 ⇒ cat: v ′ decl 6 7 6 7 mdr: mdr: 6 7 6 7 6 7 6 7 3 arg: Julia arg: Julia 6 7 6 7 6 7 6 7 fnc: sleep 6 7 fnc: sleep 6 7 6 7 6 7 6 nc: 7 6 nc: 7 6 7 6 7 idy: 1 6 7 idy: 1 6 7 4 5 4 5 6 7 6 7 pc: pc: prn: 1 4 5 prn: 1 4 5 1 1 prn: 1 prn: 1 2 2 � 2006 Roland Hausser c

A Computational Model of Natural Language Communication 206 11.5.3 Combining Julia sleeps. and John 3 IP+START {1 NOM+FV } increment nw.prn 2 3 2 3 verb: α noun: β ecopy k ss.nc cat: SM cat: NP 4 5 4 5 acopy ‘NCV’ ss.nc nc: prn: k copy ss copy nw 2 3 2 3 sur: sur: sur: 2.1 John 2 3 2 sur: 3 verb: sleep verb: sleep 6 7 6 7 noun: John noun: John 6 7 6 7 6 7 6 7 cat: decl cat: decl 6 7 6 7 6 7 6 7 cat: nm cat: nm 6 7 6 7 6 7 6 7 sem: pres sem: pres 6 7 6 7 6 7 6 7 sem: m sem: m 6 7 6 7 6 7 6 7 = mdr: mdr: 6 7 ⇒ 6 7 6 7 6 7 mdr: mdr: 6 7 6 7 6 7 6 7 6 arg: Julia 7 6 arg: Julia 7 6 7 6 7 6 7 fnc: 6 7 fnc: 6 7 6 7 6 nc: 7 6 nc: 2 NCV 7 6 7 6 7 6 7 idy: 6 7 idy: 2 4 5 4 5 6 pc: 7 6 pc: 7 4 5 prn: 4 5 prn: 2 4 4 prn: 1 prn: 1 2 2 � 2006 Roland Hausser c