A Syntactic Description of German in a Formalism Designed for Machine Translation

Size: px
Start display at page:

Download "A Syntactic Description of German in a Formalism Designed for Machine Translation"

Transcription

1 A Syntactic Decription of German in a Formalim Deigned for Machine Tranlation Paul Schmldt A-Eurotra-D Martln-Luther-Str. 14 D-6600 Saarbrlickcn Wet-Germany Abtract: Thi paper preent a yntactic decription of a fragment of German that ha been worked out within the machine tranlation project Eurotra. t repreent the yntactic part of the German module of thi multilingual tranlation ytem. The linguitic tool for the following analye i the o-called CATframework. n the firt two ection of thi paper an introduction of the formalim and a linguitic characterization of tile framework i given. The CAT formalim a a whole i a theory of machine tranlation, the yntactic analyi part which i the ubject of thi paper i an LFG-like mapping of a contituent tructure onto a functional tructure. A third ection develop principle for a phrae tructure and a functional tructure for German and the mapping of phrae tructure onto functional tructure. n a fourth ection a treatment of unbounded movement phenomena i ketched. A the CAT-framework doe not provide any global mechanim try to give a local treatment of thi problem. O. ntroduction There are two baic given for Eurotra: (i) Stratificational decription of language. The decription of language conit of an analyi on three level: ECS (Eurotra-Contituent-Structure) which decribe language according to part/whole relation and word order, ERS (Eurotra-Relational-Structure) which decribe language in term of yntactic function and S (nterface Structure) which decribe language according to deep yntactic relation enriched by emantic information uch a emantic feature for characterizing lexical unit. (ii) The CAT-formalim. The CAT-formalim i the linguitic tool for the decription of language. A thi formalim ha no global mechanim there are ome retriction concerning the treatment of unbounded dependencie. Taking thc.~;e given into account, would like to preent the following topic: (i) An introduction to the formal language a far a neceary for the treatment of the linguitic phenomena 1 would like to decribe, (ii) A characterization of the Eurotra tratifieational decription of language a a functionally oriented theory, (iii) A development of principle for a yntactic decription of German (iv) A ketch of the treatment of unbounded dependencie 1. The formalim would like to introduce only thoe part of the CAT-formalim "which build the bai of my analye. That i two kind of rule: (i) oealled b-rule (tructure building rule). They build tructure qud tranform tructure into tructure. (ii) o-called feature-rule and killer-filter. They are put together into one cla a both of them operate on tructure created by b-rule expreing generalization over attribute b-rule (1)(a) {cat=} {cat=},(cat=} 1. (b) {eat=}l (cat=v},{cat=} l. (c) {cat=}[ {cat=det},{cat=.} ]. (d) (cat=v,lu=kaufen,lex=kau ft,t.=tened} n (l)(a)-(d) we have b-rule, which define a mall ECSgrammar. (d) i a rule for a terminal. The dominance relation i expreed by quare bracket. The grammar in (1) aign entence (2)(a) tructure (2)(b). (2)(a) Da Hau kauft der Mann (The houe, the man buy) (b) det n v det n da hau kauft der mann The ame way a in (l)(a)-(d) an ECS-grammar wa written we can write b-rule defining functional tructure. (3) i a b-rule defining the functional tructure for (2)(a): (3)(a) {cat=} [{f=,cat=v,frame=ubj obj}, (f=ubj,cat=,cae=nom}, (f=obj,cat=,cae=acc), * (f=mod}l. (f=yntactic function) (b) {l.=kanfen,f=,frame=u bj obj }. b-rule (3) create the functional tructure (4) for entence (2)(a). (4) _, f,v ubj, obj, L L L kaufen mann der hau da The tranformation will De done by tile tranlation b-rule (5). (5) tl = S:(cat=} NPl:{cat=}, ~:{cat=} V:{cat=v},NP2:{cat=}ll S:{cat=} <V,NP2,NP>. A tranlation-b-rule (t-rule) conit of a left hand ide (h) which define a repreentation, in our cae it would unify with the ECS-trueture in (2)(b), and a right hand ide (rh) which define a dominance and precedence relationhip between the item repreented by the variable (capital). f there i a b-rule on the next level, in our cae ERS, which atifie thee condition, the tranlation ucceed, t-rule (5) ay that tructure (2)(b) hall be tranlated into a tructure which i dominated by a node of category which dominate the three item repreented by the variable in the order given in the rh of the t-rule. A the verbal ernor, in our cae 'kaufen', require a ubj obj frame, expreed by the frame feature, (3)(a) i tile ERS-b-rule which would match with the rh of t-rule (5) and create (4). 589

2 1.2. f-rule and killer-filter f-rule f-rule and killer filter allow for the definition of a context part (thoe feature after the lah) and an action part a example (6) how. An f-rule applie to a repreentation only if the context part trictly unifie with the object. (6) { cae=c,nb=n,gead=g,/cat=} {/cat=det},{cae=c,nb=n,gend=g,/eat=n} (6) ay that for each coniting of a det and an n cae, number and gender of the n have to be percolated into the mother node. would like to make two remark: (i) the feature percolation in example (6) could be done in b-rule. Thu, it might eem that f-rule are uperfluou. However, a ection 4 will how, there are many cae where we need feature percolation by f-rule. (ii) will make a pecial ue of f-rule. will take everything a context and action part. That mean, if f-rule f unifie with repreentation r, r will be replaced by the reult of unification, if not, r urvive unchanged killer-filter Killer filter pecify tructure which are not well-formed and which therefore have to be deleted. We might imagine a rule which kill having a pronominal head and an in genitive. (7) killer-filter: {cat=rip} [{cat=detj,{cat=n,n type=pron},{cat=,cae=gen }. 2. CAT a a functionally oriented framework 2.1. A arion with a configurational framework For the linguitic ctmracterization of the Eurotra framework 1 would like to make a brief arion between two kind of linguitic theorie: (i) thoe which aume yntactic function a univeral primitive of language (prototypical: LFG) (ii) thoe which claim that yntactic function could be reduced to configurational fact (prototypicah GB). Each of the two poible way of decribing language force the linguit to decribe linguitic fact a word order, binding relation, agreement, cae aignment or long ditance movement in a certain way. The configurational framework claim that there i a general chema for phrae tructure rule which i the univeral pattern according to which all contituent tructure of all poible language are built. t i the x-bar chema: undergone movement tranformation, a functional decription conit in a mapping of phrae tructure onto functional tructure Completene and coherence in Eurotra There i an eential which hold for all functional framework, namely the letene and coherence principle. Thi principle ay: A functional tructure i well-formed iff it i lete and coherent. A functional tructure i lete iff it contain all the yntactic function required by the frame of the framebearing element. A functional tructure i coherent iff it contain only the required yntactic function. Enrotra allow for the expreion of thi principle in two different way: (i) Enumeration of frame The ERS grammar ha to enumerate all poible pattern, all frame which are poible, a b-rule, and the value of the frame feature of the determine that only the wanted and nothing but the wanted ernor go into the tructure building rule. (9) {cat=} [ {f=,cat=v,frame=ubj obj}, {f=nhj,cat=,cae=nom}, {f=obj,cat=,cae=acc}, *{f=mod} ] n (9) letene i expreed by the fact that both framebound yntactic function are obligatory. So, if one of the function i miing, the tructure i not well-formed. Coherence i expreed by the fact that the tructure building rule only allow for the two yntactic function and nothing ele. Thi prevent e.g. the creation of an oblique object. (ii) Completene and coherence by f-rule and killer There i, however another way of expreing letene and coherence which doe not require the enumeration of all frame. We need the following rule: (a) One ERS b-rule which enumerate all poible yntactic function optionally a (0) doe: (10) :b: {cat=} [ {f=,cat=v}, ^ {f=nbj,cnt=,cae=nom}, ^ {f=obj,cat=,cae=acc}, ^ {f=obj2,cat=}, ^ {f=obl,cat=pp}, ^ {f=,cat=}, * {f=mod,cat=pp} ^ {f=topic} ] (b) A eparate encoding of the function a verb i ubcategorized for, i.e. the frame feature i given up and a feature for each yntactic function i introduced: () pec Xdoublebar xbar xbar beta gamma (11) {lu=ee,ubj=ye,obj=ye,f=} All other yntactic function feature value will have to get the default "no" (by default f-rule). (12) {lu=ee,ubj=ye,obj=ye,obj2=no,obl=no,=no,f=} (8) repreent the x-bar chema, alo D(eep)-Structure in GB. On thi tructure movement rule operate creating S(urface)- tructure. So, thi i the kind of explanation a configurational framework give: There i a canonical chema (the x-bar chema) and each configuration not fitting into thi chema i explained a derived by univerally retricted movement tranformation. The functional alternative ha to rely on yntactic function a univeral primitive. So, phrae tructure doe not necearily claim a univeral tatu, and movement rule are not even neceary. Thi require a different treatment of the linguitic phenomena. How doe the CAT framework fit into thi? The adoption of the three level ytem (ECS,ERS,S) make Eurotra functionally oriented a it adopt the way of linguitic decription a functional approach ha to adopt. While a configurational deoription conit in mapping given configuration onto a canonical chema, the x-bar chema, by explaining configuration which do not fit into x-bar a having We can now tate letene and coherence independently by killer filter: (13) :k: {cat=} l {f=,cat=v,ubj--ye}, ^ {f=obj,cat=,cae=acc}, ^ {f=obj2,cat=}, ^ {f=obl,cat=pp}, ^ {f=,cat=}, * {f=mod,cat=pp} ^ {f=topic) (13) determine that if the feature for ubj=ye then there mut be a yntactle function "ub j" in thi repreentation. Expreed by a killer it read: if there i a tructure whoe ha an a-air ubj=ye and contain only function which are not ubj then thi tructure i not well-formed. The ame which ha been tated here for ubj can be tated for all function. To get coherence we ue a killer filter a in (14). 590

3 (14) :k: {cat=) [ {f=,cat=v,ubj=no}, {f=ubj,cat=,cae=nom}, " 0 (14) ay: f the tructure whoe ha the feature-value 'no' for the feature 'ubj' contain a feature bundle containing the feature f=ubj, plu anything ele, then thi tructure i not well-formed. 3. Syntactic decription of German 3.1. Principle of yntactic decription A we have een above, the yntactic decription of a language in Eurotra follow a functional approach. n our decription thi i not only reflected by the exitence of a functional level but alo by the uonhierarehical, nonconfigurational decription of the entence contituent we offer. A we do not ue the given x- bar chema we need no empty element on ECS and we decribe German a a uonconfigurational language. Though in German matrix claue we have SVO word order, German i uually conidered an SOV language. Matrix claue word order i conidered a derived from ubordinate claue word order by movement tranformation. (of. Koter 1975, Thierch 197~ L Rei On thi bai we would like to make another aumption concerning phrae tructure which ay that there i a unique tructure underlying all German entence (matrix claue and ubordinate claue). Thi hypothei i called "Symmetry Hypothei" or "Doppelkopfanalye" (ef. Rei 1985). t i hared by mot of the generative yntacticien uch a H. den Beten, H. Haider, J. Lenerz and J. Koter. will adopt ome verion of thi "Symm~try Hypothei" (SM) which will be developed in the following: 3.2. Phrae tructure decription (ECS) of German (i) The initial bae rule i (15) (15) bar --> co,up (ii) There are two left peripheral poitioq l and 2. We would like to repreent thi fact by the following expanion rule'. (16) cutup --> COMP1 COMP2 where COMP and COMP2 repreent poition which will be decribed thu: (iii) The B.. poition ha the feature +- tnd which pecifie it a the verb/lementizer poition, being filled in the bae onent only by lexical lementizer. Thi analyi yield the following tructure: (17) bar COMP COMP2 vfin (B) bar ] [ vfin (a) da der mann die frau liebt (that the man the woman love) (b) liebt(i) der mann die frau e(i) (love the man the women) (c} der mann(i) liebt(j) e(i) die frau e(j) (the man love the woman) (d} die frau(i) liebt(j) der mann e(i) e(9 ) (the woman love the man) (e) wet(i) liebt(j) e(i) die frau e(j) (who love the woman) (f) der(i) e(i) die frau liebt (who the woman love) (g) wet(i) e(i) die frau liebt (who the woman love) (18)(a) repreent the bae tructure decription. (18)(b) V/ repreentation a in ye/no quetion, tile finite verb having moved into COMP2 leaving behind a trace. (18)(c) repreent ordinary matrix claue word order derived by the two movement rule T and T2. (18)(d) repreent matrix claue word order with a topicalized direct object. (18)(e) i a cae of a matrix claue word order interrogative. (18)(f) a relative claue and (18)(g) a ubordinate claue interrogative. (18)(e) and (g) repreent a cae of wh-movement. Untened ubordinate claue which would not fit into thi chema would be analyed a PP: (19) pp[pohne[[vzufragen]]] (without aking ) Thi SH-analyi can at leat make the following claim: (i) The COMP2-poition a lementizer poition and a lauding ite for the verb-fronting tranformation nicely explain the relation between occurrence of lementizer and the occurrence of the finite verb (ii) A (18)(e) and (g) how, wh-movement can be repreented equally for matrix claue and ubordinate claue, namely a movement into COMP2. (iii) The Sll-- analyi i atible with the productive traditional "Stellungfelderhypothee" (c-f. Olon 1984). Another ubject of phrae tructure hould be mentioned here: the treatment of tile verbal-lex. We adopted the following approach: Every-"~'erb i a full verb. Auxiliarie are ubject control verw (of Netter1986, 1988, and Brenan 1982). ~20) bar... vfin vinfj.n vinfin vinfin da der brief von ihm zu chreiben verucht worden i~ (that tile letter by him to write tried been ha) (iv) Two movement rule operate on thi tructure, deriving all non SOV tructure. Thee two rule are: T : Verb fronting and T2 : Topicalization where COMP2 i the landing ite for the finite verb and COMP1 thb landing ite for X-double-bar. We will how now in (18) how poible German entence tructure can be derived according to SM. Thi treatment allow an eay calculation of tene, voice and apect on ERS, a there i till tructural information. A repreentation (20) how, all nonfinite verb are treated on ECS the ame way, namely a the head of left recurively branching -contituent. Thi enable an eay treatment of auxiliarie a raiing verb on ERS (ee ection 3.3.) Relational tructure (ERS) Principle The relational tgucture of a language i contituted by the property of lexical unit (lu) to bind certain other element. Thi property i uually called "valency". Formally thi fact i reflected in the formalim by the property of local tree. Each local tree contain jut one (ernor), it valency-bound element which are the (lement) and it non-valencybound element which are the mod(ifier): 591

4 (21) ubj,,n mod,ap mod,detp,adj,det mann alt d- man old the The valency of a lu i it property to bind a certain number and a certain kind of yntagma. n other word: a valency theory i a theory on how many and which kind of yntagma occur given that a certain lu occur. We conider verb, noun, adjective and prepoition a having the property of being able to bind other yntagma. A major part of every valency theory i the deign of a tet which i meant to determine the difference of lement and modifier. n the hitory of valency theory a lot of tet have been developed, among other the following: Elimination tet, free addability tet, adverbial claue tet, verb ubtitution tet, do-o-tet, backformation tet. We adopted a revied addability tet (ef. Schmidt 1986) Word order The mot important apect with the decriptiou of the relation between ECS and ERS i that the preent formalim allow for the treatment of free word order language. We conider German a having a relatively free word order. The deciive feature i that the rh of the t-rule are able to pecify only dominance relation which i expreed by the parenthei in (22). Permutation in the German middle field can eaily be treated a hown in example (22). (22) S:{eat=har} -:{eat=} TOPC,V:{cat=v}, ~:{cat=}[advl:* {cat--adv2}, NPh(cat=}, ADV2:* {cat=adv2}, NP2:{cat=}, ADV3:* (cat=adv2}, NP3:{cat=}, ADV4:* {cat=adv2}, VP:{cat=}l] S:<(TOPC,V,ADV1,NP1,ADV2,NP2,ADV3,NP3,ADV4,VP)> The verbal lex on ERS A hown in tructure (20), auxiliarie are analyed a full verb. The tructural analyi in (20) make it eay to treat auxiliarie a raiing verb on ERS, a (23) how. (23) 7.-- ~ov OOV,V ubj, l up(i) ubj,, (i).l gi v'v ~ev,v ubj,, da ein brief werder den n~(i>~ov <~j, by_phi,up ver- a chrei- e uehen ben yon ihm Paive The problem with paive i the following: There i a relation between the two entence in (24) (24) Die Kommiion verabchiedet den Beehlu (The Commiion adopt the deciion) Der Beehlu wurde yon der Kommiion verabchiedet (The deciion wa adopted by the council) which i in term of urface yntactic frame that the phrae being the ubject in (a), namely 'die Kommiion', i the by obj in (b) and the direct object of (a) i the urface yntaetie ubject of (b) (bearing all feature urface yntactic ubject uually have, a e.g. nominative cae). n term of thematic role we could ay that the agent i in both eae 'die Kommiion' once realized a an NP in nominative cae, once realized a a PP with the prepoition 'you'. We keep urface yntactic information and aim at the following tructure: (25) undef ubj ~v ubj.by_?bj warden bechlu verabchieden e von kommiion n univeral grammar paive uually i treated in a general way, a paivization i conidered a univeral proce: - n GB paivization i conidered a a movement proce which i contained in the general move alpha chema. - GPSG alo treat paive on the yntactic level in form of a metarule. - LFG being a "lexicalit" theory treat paive inthe lexicon by a lexical rule which i.th. like (ubj) -> zero/(by obj) (obj) -> ubj n Eurotra we have neither of thee device, neither movement rule nor metarule, nor lexical rule. However, it eem a if we could imulate the lexical rule jut by putting the "active frame" into the b-rule a in (26). (26) {cat=,voice=palve} l {f=,cat=v,frame=ubj_obj}, (f=ubj,eat=,cae=nom}, {f=by ohj,eat=pp,pform=von), '1} {lufverabchleden,f=,cat= v,framefu bj obj } Thi ha the ame effect a the LFG lexical rule: only one encoding of the verb with it active ub obj-frame i neceary. 4. Treatment of Unbounded Movement Phenomena 4.1. Wh-movement The Repreentation would like to explain my approach with an example: (27)(a) wa agt Han, behauptet Peter, verabchiedet der Rat (what ay Han claim Peter adopt the council) what doe Han ay that Peter claim the council adopt (b) wa agt Han According to our ECS grammar the following ECS tree i created: (28) bar l topic v u l-- i bar v bar _ v wa agt Han behaup- Peter verab- der rat tet chiedet (what ay Han claim Peter adopt the council) We imagine a functional repreentation like (29), (29) under ( ~ ~ gov gov ubj JSCOmp t--~(i) %... i agen han behaup- Peter verab- Rat e(i) e(i) e(i) wa tat chidet what) (ay han claim peter adopt council n (29) we can ee that a chain wa created from the topic of the 592

5 matrix claue via the topic of the embedded claue to the correct yntactic function lot. We have to guarantee that it i a correct chain which undertand a a chain that i correctly coindexed with the correct function in the ERS b-rule The Creation of the Correct Structure The tructure in (29) i created by inerting empty element by t-rule application in a very controlled way. 1 would like to give an exemplification by NP-lement. Structure inertion by t-rule exploit the fact that movement ha it landing ite which i the node called eompl in repreentation (17). n the lh of the t-rule thi information i exploited. We alo know that each phrae whk:h occupie the eompl poition on ECS ha to go to an ERS lot which ha f=topic. We need the four t-rule for doing the job. (30) tl= S:{cat=har) ~:(cat=,tn= tened} [TOPC:{cat=},V:(cat=v} h ~: {cat=,tn=untened} [NP2;{cat=),~:^{cat=pUnCrt},SBAR:^ {cat=har)l] =). S:{cat=} <V,NP2,{cat=,n type=empty},sbar,topc:{f=toplc} >. The t-rule in (30) treat" local wh-movenrent a in (2)(a) and create tructure (31 ). ( 31 ) unde f ubj obj topic ( i ) kaufen mann e(i) hau (30) create an empty -lot which ha to be interpreted a one of the b-rule lot ubj, obj or obj2 in (10). t will go to f=ubj,f=obj and f=obj2. t i up to letene and coherence to determine that (31) i well-formed in our cae. For the top of an unbounded dependency contruction (29), we need t-rule (32) which put the topicalized into the topic lot on ERS, but without creating a correponding empty up. (32) t2= $:{cat=bar} [~:{cat=,tn=tencd} [TOPC: {cat=up}, V: {cat=v}l, ~:{cat=,tn=untened} [NP2: ^{cat=up}, ~: ^{cat=punct}, SBAR: ^(cat=bar}ll S:{cat=} < V, NP2, SBAR, TOPC:{f=toplc,cat=} >. (33) treat the middle of unbounded dependency contruction i.e. a entence tructure which ha an empty topic. The middle build the link between embedded entence and matrix claue. t ha no empty correpondent in the tructure. Thi tructure i created by a t-rule which operate on an ECS repreentation which ha an empty topic landing ite (ee (28)). (33) i3= S:{cat=bar} ~: {cat=,tn=tened} lv:{cat=v}l, ~: {cat=,tn=untened} [Np2: ^{cat=up}, -: ^{cat=puuct}, SBAR: ^{cat=:bar}l] S:{cat=} < V,NP2,SBAR,{cat=,n type=empty,f=topic} >. For the bottom of the tructural repreentation we finally need a t-rule which create an empty topic and an empty correponding. (34) i thi rule. t i alo applied only under the condition that the ECS landing ite for wh-movement i empty. (34) t4= S:(cat=bar) ~:{cat=,tn=tened) V:{cat=v}l, ~:{cat=,tn=untened) [ NP2: ^{cat=,tp), -: ^{cat=punct}, SBAR: ^{cat=har}l] S:{cat=} <V,NP2,{cat=,n type=empty), SBAR,(cat=,n type=empty,f=topic } >. We now have all the piece needed for creating the correct tructure which can occur in unbounded dependency tructure. (28) only repreent a three-fold -tructure, however rule (33) eater for all poible middle a it will be applied a many time a there are middle. A few comment eem to be in order on thee rule: (30) and (32) on the one hand and (33) and (34) on the other hand have the ame lh which might caue overgeneration. Rule (31) cater for the cae that the i tile matrix-claue containing a moved NP which ha to find it functional lot downward omewhere in a functional tructure of an embedded claue. For thi cae we need a topic which ha up correpondent on the ame level. f we take (27)(b), rule (30) a well a rule (32) will be applied, both of them putting "wa" into the topic function, (30) creating an empty NP-lot, (32) not creating an empty NP. So, we have two rule (30) and (32) which apply to the ame lh producing two different ERS tructure. The letene and coherence tet determine which t-rule (30) or (32) create the correct tructure. Both of them will be applied but only one, namely (30) create the correct tructure according to the letene and coherence criterion. n the cae of rule (33) and (34) we have the ame problem. Both of them apply to the ame lh, once inerting an empty, once not. Again, letene and coherence ha to determine whether the reult of (33) or (34) i correct Feature Checking The creation of the correct tructure i only half of the tory. We have not guaranteed yet that only correct tructure are created and above all that only correct chain are created. Thi will be done by an interaction of f-rule percolating the relevant feature uch a gender, number, cae and the index feature and by killer filter which guarantee that only correctly indexed chain urvive. Firt of all we need f-rule which percolate the relevant feature. (35) :f: a_top to = {cat=z} [ {f=}, ^{f=ubj}, ^{f=obj}, ^{f=obj2}, {f=,top index=l,top.b=n,top _gend=g}, *{f=mod}, {f=topic,iudex=l,.b=n,gend=g}. (35) i an example which percolate number, gender and index from topic to. Another f-rule of the ame tyle will percolate thee feature from to the topic node of the embedded entence, and a third f-rule from topic to the empty functional lot. So, if we conider example (28) the pereolatiou of the relevant feature follow the following path: (36) obj e topic e topic topic The ame kind of f-rule will percolate the cae feature independently the ame path. (For the reaon ee below). For feature ehecking we need killer rule which kill all tructure which are not correctly indexed and thoe which repreent an empty chain. E.g. (37) i a rule which delete all tructure where the cae feature of the empty topic and the correponding empty up i not the ame. 59)

6 (37) :k: ktopic3= {cat=} [{f=,cat=v}, "0, {cat=,type=empty,cae~=c,lndex=l), *ll, {f=topic,cat=,cae=c,index=l}l. Actually we need another 6 killer which cheek number and gender. Rule (37) make clear what ha been the ene of the eparate cae-feature-percolation. f we percolated the eae feature in rule like (35) we could not ue the index - feature for feature checking. 1 would like to explain thi with an example. We need a rule to filter out the wrong repreentation (39) which i the repreentation of the following ill-formed entence: (38) * Den Bechlu agt Han, behauptet Peter, verabchiedet den Bechlu (The deciion ay Han, that Peter claim, adopt the deciion) (39) under ub3 topic(i) topic(i) ubj ubj obj topi (i) a- Han be- Peter verab- e(i) bechlu e(i) e(i) begem hauptt chiedet den chlu den (ay Han claim Peter adopt the deciion the deciion) According to our f-rule the index i percolated down into the empty ubject lot in the lowet. (t cannot go elewhere). Thi ubject ha cae=nom which i tated in the ERS b-rule. The cae feature i the mean to get rid of the wrong chain a there will be a clah between the "arriving" cae=accuative and the already tated cae=nominative. f the cae feature had not been percolated independently we would not have any poibility of applying killer rule (37) a the f-rule would not have been applied for the reaon of the impoibility of unification. My rule percolate the index into the ub j-lot and make poible the application of (37) Control Let u conider the following cae of ubject control: (40) da er den Bechlu zu verabchieden zu verprechen verucht that he trie to promie to adopt the deciion Our ECS-grammar would aign the ECS-trueture (41): (41) bar ubcon mp n prep v prep da er den bechlu zu verab- zu vet- rerchieden prechen ucht The ERS repreentation would look like (42). n the cae of control-tructure it i eay to control the inertion of tructure by t-rule a embedded control tructure are in our ytem. A we have een in ection 3, each i lacking a ubject which i inerted on ERS by t-rule (43): (42) under da veruchen ubj(i) er vetprechen ubj o(i) ubj obj verab- e(±) bechieden chlu (43) tl = VP:{cat=} [ NPl:{cat=},VP:(cat=},~:{cat=prep}, V:{cat=v,tn=untened}] VP:{cat=} V,{cat=,type=empty,f=ubj},NPl,VP >. n control tructure feature checking work the ame way a in wh-contruction. We only need a correct feature percolation which put the relevant feature to the -node and from there to the ub j-lot. We only have to take care that in the -node feature are not confued with topic-feature. Thi can be guaranteed by uing ctl cae etc. in. (44):f: f ctll = {cat=}[{f=,cat=v,ctl=ubj}, {f=ubj,cat=,nb=n,geud=g,index=}, "{}, {f=,cat=,ctl_nb=n,ctl_gend=g,ctl index=}, *1}1. 5, Summary The decription of a ignificant fragment of German above eem to be a good bai for a tranlation ytem. The functional tructure created in our ytem can eaily be mapped onto deep yntactic predicate-argument-tructure which are enriched by emantic information. From there tranfer hould happen. A far a the treatment of unbounded dependencie i concerned there might be ome problem in tranfer. Certain pied piping phenomena and multiple wh-movement might make neceary a more powerful mechanim. 6. Literature: Abraham,W.(ed)(1985) Erkl~irende Syntax de Deutchen, Tiibingen, (=Studien zur deutehen Grammatik 25). Arnold,D. et a1.(1987) The Eurotra Reference Manual, Releae 2.1., m. Utrecht. Brenan,J.(1982) The Paive in Lexical Thoery, in: Brenan,J The Mental Repreentation of Grammatical Relation Cambridge, Ma./London Engl. Koter,J.(1975) Dutch a an SOV Language. Linguitic Analyi l,pp.l Lenerz,J.(1984) Diachronic Syntax: Verb Poition and COMP in German, in: Toman (1984). Netter,K.(]986) Getting Thing out of Order. An LFG Propoal for the Treatment of German Word Order, Coling Proceeding (1986),p Olon,S.(1984) On Deriving V-1 and V-2 Structure in German, in: Toman (1984). Rei,M.(1985) Satzeinleitende Strukturen. Ueber COMP, Hauptund Nebenaetze, w- Bewegung und Doppelkopfanalye, in: Abraham (1985). Steiner,E., Sehmidt, P,, Zelinky, C. (1988) (forthcoming) from Syntax to Semantic. (New night from Machine Tranlation). London Schmidt,P.(1986) Valency Theory in a Stratificational MT Sytem,in: Coling Proceeding (1986). mod den Thierch, C.: Topic in German Syntax, uub. Di

PDF hosted at the Radboud Repository of the Radboud University Nijmegen

PDF hosted at the Radboud Repository of the Radboud University Nijmegen PDF hoted at the Radboud Repoitory of the Radboud Univerity Nijmegen The folloing full text i a publiher' verion. For additional information about thi publication click thi link. http://hdl.handle.net/2066/43776

More information

A Joint Many-Task Model: Growing a Neural Network for Multiple NLP Tasks

A Joint Many-Task Model: Growing a Neural Network for Multiple NLP Tasks A Joint Many-Tak Model: Growing a Neural Network for Multiple NLP Tak Kazuma Hahimoto, Caiming Xiong, Yohimaa Turuoka, and Richard Socher The Univerity of Tokyo {hay, turuoka}@logo.t.u-tokyo.ac.jp Saleforce

More information

Introduction to HPSG. Introduction. Historical Overview. The HPSG architecture. Signature. Linguistic Objects. Descriptions.

Introduction to HPSG. Introduction. Historical Overview. The HPSG architecture. Signature. Linguistic Objects. Descriptions. to as a linguistic theory to to a member of the family of linguistic frameworks that are called generative grammars a grammar which is formalized to a high degree and thus makes exact predictions about

More information

Developing a TT-MCTAG for German with an RCG-based Parser

Developing a TT-MCTAG for German with an RCG-based Parser Developing a TT-MCTAG for German with an RCG-based Parser Laura Kallmeyer, Timm Lichte, Wolfgang Maier, Yannick Parmentier, Johannes Dellert University of Tübingen, Germany CNRS-LORIA, France LREC 2008,

More information

INFORMATION SEEKING BEHAVIOR OF USERS OF ICT ORIENTED COLLEGES: A CASE STUDY

INFORMATION SEEKING BEHAVIOR OF USERS OF ICT ORIENTED COLLEGES: A CASE STUDY Review Of Reearch Impact Factor :.40(UIF) ISSN 49-894X Volume - 5 Iue - Oct - 05 INFORMATION SEEKING BEHAVIOR OF USERS OF ICT ORIENTED COLLEGES: A CASE STUDY Dr. Sachin D. Sakarkar Shri. R. R. Lahoti Science

More information

Context Free Grammars. Many slides from Michael Collins

Context Free Grammars. Many slides from Michael Collins Context Free Grammars Many slides from Michael Collins Overview I An introduction to the parsing problem I Context free grammars I A brief(!) sketch of the syntax of English I Examples of ambiguous structures

More information

"f TOPIC =T COMP COMP... OBJ

f TOPIC =T COMP COMP... OBJ TREATMENT OF LONG DISTANCE DEPENDENCIES IN LFG AND TAG: FUNCTIONAL UNCERTAINTY IN LFG IS A COROLLARY IN TAG" Aravind K. Joshi Dept. of Computer & Information Science University of Pennsylvania Philadelphia,

More information

Case government vs Case agreement: modelling Modern Greek case attraction phenomena in LFG

Case government vs Case agreement: modelling Modern Greek case attraction phenomena in LFG Case government vs Case agreement: modelling Modern Greek case attraction phenomena in LFG Dr. Kakia Chatsiou, University of Essex achats at essex.ac.uk Explorations in Syntactic Government and Subcategorisation,

More information

Basic Syntax. Doug Arnold We review some basic grammatical ideas and terminology, and look at some common constructions in English.

Basic Syntax. Doug Arnold We review some basic grammatical ideas and terminology, and look at some common constructions in English. Basic Syntax Doug Arnold doug@essex.ac.uk We review some basic grammatical ideas and terminology, and look at some common constructions in English. 1 Categories 1.1 Word level (lexical and functional)

More information

A Minimalist Approach to Code-Switching. In the field of linguistics, the topic of bilingualism is a broad one. There are many

A Minimalist Approach to Code-Switching. In the field of linguistics, the topic of bilingualism is a broad one. There are many Schmidt 1 Eric Schmidt Prof. Suzanne Flynn Linguistic Study of Bilingualism December 13, 2013 A Minimalist Approach to Code-Switching In the field of linguistics, the topic of bilingualism is a broad one.

More information

11/29/2010. Statistical Parsing. Statistical Parsing. Simple PCFG for ATIS English. Syntactic Disambiguation

11/29/2010. Statistical Parsing. Statistical Parsing. Simple PCFG for ATIS English. Syntactic Disambiguation tatistical Parsing (Following slides are modified from Prof. Raymond Mooney s slides.) tatistical Parsing tatistical parsing uses a probabilistic model of syntax in order to assign probabilities to each

More information

Constraining X-Bar: Theta Theory

Constraining X-Bar: Theta Theory Constraining X-Bar: Theta Theory Carnie, 2013, chapter 8 Kofi K. Saah 1 Learning objectives Distinguish between thematic relation and theta role. Identify the thematic relations agent, theme, goal, source,

More information

Minimalism is the name of the predominant approach in generative linguistics today. It was first

Minimalism is the name of the predominant approach in generative linguistics today. It was first Minimalism Minimalism is the name of the predominant approach in generative linguistics today. It was first introduced by Chomsky in his work The Minimalist Program (1995) and has seen several developments

More information

The building blocks of HPSG grammars. Head-Driven Phrase Structure Grammar (HPSG) HPSG grammars from a linguistic perspective

The building blocks of HPSG grammars. Head-Driven Phrase Structure Grammar (HPSG) HPSG grammars from a linguistic perspective Te building blocks of HPSG grammars Head-Driven Prase Structure Grammar (HPSG) In HPSG, sentences, s, prases, and multisentence discourses are all represented as signs = complexes of ponological, syntactic/semantic,

More information

Approaches to control phenomena handout Obligatory control and morphological case: Icelandic and Basque

Approaches to control phenomena handout Obligatory control and morphological case: Icelandic and Basque Approaches to control phenomena handout 6 5.4 Obligatory control and morphological case: Icelandic and Basque Icelandinc quirky case (displaying properties of both structural and inherent case: lexically

More information

The presence of interpretable but ungrammatical sentences corresponds to mismatches between interpretive and productive parsing.

The presence of interpretable but ungrammatical sentences corresponds to mismatches between interpretive and productive parsing. Lecture 4: OT Syntax Sources: Kager 1999, Section 8; Legendre et al. 1998; Grimshaw 1997; Barbosa et al. 1998, Introduction; Bresnan 1998; Fanselow et al. 1999; Gibson & Broihier 1998. OT is not a theory

More information

CS 598 Natural Language Processing

CS 598 Natural Language Processing CS 598 Natural Language Processing Natural language is everywhere Natural language is everywhere Natural language is everywhere Natural language is everywhere!"#$%&'&()*+,-./012 34*5665756638/9:;< =>?@ABCDEFGHIJ5KL@

More information

On the Notion Determiner

On the Notion Determiner On the Notion Determiner Frank Van Eynde University of Leuven Proceedings of the 10th International Conference on Head-Driven Phrase Structure Grammar Michigan State University Stefan Müller (Editor) 2003

More information

Inleiding Taalkunde. Docent: Paola Monachesi. Blok 4, 2001/ Syntax 2. 2 Phrases and constituent structure 2. 3 A minigrammar of Italian 3

Inleiding Taalkunde. Docent: Paola Monachesi. Blok 4, 2001/ Syntax 2. 2 Phrases and constituent structure 2. 3 A minigrammar of Italian 3 Inleiding Taalkunde Docent: Paola Monachesi Blok 4, 2001/2002 Contents 1 Syntax 2 2 Phrases and constituent structure 2 3 A minigrammar of Italian 3 4 Trees 3 5 Developing an Italian lexicon 4 6 S(emantic)-selection

More information

An Interactive Intelligent Language Tutor Over The Internet

An Interactive Intelligent Language Tutor Over The Internet An Interactive Intelligent Language Tutor Over The Internet Trude Heift Linguistics Department and Language Learning Centre Simon Fraser University, B.C. Canada V5A1S6 E-mail: heift@sfu.ca Abstract: This

More information

An Introduction to the Minimalist Program

An Introduction to the Minimalist Program An Introduction to the Minimalist Program Luke Smith University of Arizona Summer 2016 Some findings of traditional syntax Human languages vary greatly, but digging deeper, they all have distinct commonalities:

More information

Proof Theory for Syntacticians

Proof Theory for Syntacticians Department of Linguistics Ohio State University Syntax 2 (Linguistics 602.02) January 5, 2012 Logics for Linguistics Many different kinds of logic are directly applicable to formalizing theories in syntax

More information

Switched Control and other 'uncontrolled' cases of obligatory control

Switched Control and other 'uncontrolled' cases of obligatory control Switched Control and other 'uncontrolled' cases of obligatory control Dorothee Beermann and Lars Hellan Norwegian University of Science and Technology, Trondheim, Norway dorothee.beermann@ntnu.no, lars.hellan@ntnu.no

More information

Theoretical Syntax Winter Answers to practice problems

Theoretical Syntax Winter Answers to practice problems Linguistics 325 Sturman Theoretical Syntax Winter 2017 Answers to practice problems 1. Draw trees for the following English sentences. a. I have not been running in the mornings. 1 b. Joel frequently sings

More information

Construction Grammar. University of Jena.

Construction Grammar. University of Jena. Construction Grammar Holger Diessel University of Jena holger.diessel@uni-jena.de http://www.holger-diessel.de/ Words seem to have a prototype structure; but language does not only consist of words. What

More information

THE INTERNATIONAL JOURNAL OF HUMANITIES & SOCIAL STUDIES

THE INTERNATIONAL JOURNAL OF HUMANITIES & SOCIAL STUDIES THE INTERNATIONAL JOURNAL OF HUMANITIES & SOCIAL STUDIES PRO and Control in Lexical Functional Grammar: Lexical or Theory Motivated? Evidence from Kikuyu Njuguna Githitu Bernard Ph.D. Student, University

More information

Grammars & Parsing, Part 1:

Grammars & Parsing, Part 1: Grammars & Parsing, Part 1: Rules, representations, and transformations- oh my! Sentence VP The teacher Verb gave the lecture 2015-02-12 CS 562/662: Natural Language Processing Game plan for today: Review

More information

Some Principles of Automated Natural Language Information Extraction

Some Principles of Automated Natural Language Information Extraction Some Principles of Automated Natural Language Information Extraction Gregers Koch Department of Computer Science, Copenhagen University DIKU, Universitetsparken 1, DK-2100 Copenhagen, Denmark Abstract

More information

Parsing of part-of-speech tagged Assamese Texts

Parsing of part-of-speech tagged Assamese Texts IJCSI International Journal of Computer Science Issues, Vol. 6, No. 1, 2009 ISSN (Online): 1694-0784 ISSN (Print): 1694-0814 28 Parsing of part-of-speech tagged Assamese Texts Mirzanur Rahman 1, Sufal

More information

Control and Boundedness

Control and Boundedness Control and Boundedness Having eliminated rules, we would expect constructions to follow from the lexical categories (of heads and specifiers of syntactic constructions) alone. Combinatory syntax simply

More information

Som and Optimality Theory

Som and Optimality Theory Som and Optimality Theory This article argues that the difference between English and Norwegian with respect to the presence of a complementizer in embedded subject questions is attributable to a larger

More information

Syntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm

Syntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm Syntax Parsing 1. Grammars and parsing 2. Top-down and bottom-up parsing 3. Chart parsers 4. Bottom-up chart parsing 5. The Earley Algorithm syntax: from the Greek syntaxis, meaning setting out together

More information

The Verbmobil Semantic Database. Humboldt{Univ. zu Berlin. Computerlinguistik. Abstract

The Verbmobil Semantic Database. Humboldt{Univ. zu Berlin. Computerlinguistik. Abstract The Verbmobil Semantic Database Karsten L. Worm Univ. des Saarlandes Computerlinguistik Postfach 15 11 50 D{66041 Saarbrucken Germany worm@coli.uni-sb.de Johannes Heinecke Humboldt{Univ. zu Berlin Computerlinguistik

More information

Citation for published version (APA): Veenstra, M. J. A. (1998). Formalizing the minimalist program Groningen: s.n.

Citation for published version (APA): Veenstra, M. J. A. (1998). Formalizing the minimalist program Groningen: s.n. University of Groningen Formalizing the minimalist program Veenstra, Mettina Jolanda Arnoldina IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF if you wish to cite from

More information

Today we examine the distribution of infinitival clauses, which can be

Today we examine the distribution of infinitival clauses, which can be Infinitival Clauses Today we examine the distribution of infinitival clauses, which can be a) the subject of a main clause (1) [to vote for oneself] is objectionable (2) It is objectionable to vote for

More information

LNGT0101 Introduction to Linguistics

LNGT0101 Introduction to Linguistics LNGT0101 Introduction to Linguistics Lecture #11 Oct 15 th, 2014 Announcements HW3 is now posted. It s due Wed Oct 22 by 5pm. Today is a sociolinguistics talk by Toni Cook at 4:30 at Hillcrest 103. Extra

More information

Ch VI- SENTENCE PATTERNS.

Ch VI- SENTENCE PATTERNS. Ch VI- SENTENCE PATTERNS faizrisd@gmail.com www.pakfaizal.com It is a common fact that in the making of well-formed sentences we badly need several syntactic devices used to link together words by means

More information

a) analyse sentences, so you know what s going on and how to use that information to help you find the answer.

a) analyse sentences, so you know what s going on and how to use that information to help you find the answer. Tip Sheet I m going to show you how to deal with ten of the most typical aspects of English grammar that are tested on the CAE Use of English paper, part 4. Of course, there are many other grammar points

More information

cmp-lg/ Jul 1995

cmp-lg/ Jul 1995 A CONSTRAINT-BASED CASE FRAME LEXICON ARCHITECTURE 1 Introduction Kemal Oazer and Okan Ylmaz Department of Computer Engineering and Information Science Bilkent University Bilkent, Ankara 0, Turkey fko,okang@cs.bilkent.edu.tr

More information

ENGBG1 ENGBL1 Campus Linguistics. Meeting 2. Chapter 7 (Morphology) and chapter 9 (Syntax) Pia Sundqvist

ENGBG1 ENGBL1 Campus Linguistics. Meeting 2. Chapter 7 (Morphology) and chapter 9 (Syntax) Pia Sundqvist Meeting 2 Chapter 7 (Morphology) and chapter 9 (Syntax) Today s agenda Repetition of meeting 1 Mini-lecture on morphology Seminar on chapter 7, worksheet Mini-lecture on syntax Seminar on chapter 9, worksheet

More information

Multiple case assignment and the English pseudo-passive *

Multiple case assignment and the English pseudo-passive * Multiple case assignment and the English pseudo-passive * Norvin Richards Massachusetts Institute of Technology Previous literature on pseudo-passives (see van Riemsdijk 1978, Chomsky 1981, Hornstein &

More information

Argument structure and theta roles

Argument structure and theta roles Argument structure and theta roles Introduction to Syntax, EGG Summer School 2017 András Bárány ab155@soas.ac.uk 26 July 2017 Overview Where we left off Arguments and theta roles Some consequences of theta

More information

Chapter 4: Valence & Agreement CSLI Publications

Chapter 4: Valence & Agreement CSLI Publications Chapter 4: Valence & Agreement Reminder: Where We Are Simple CFG doesn t allow us to cross-classify categories, e.g., verbs can be grouped by transitivity (deny vs. disappear) or by number (deny vs. denies).

More information

Towards a Machine-Learning Architecture for Lexical Functional Grammar Parsing. Grzegorz Chrupa la

Towards a Machine-Learning Architecture for Lexical Functional Grammar Parsing. Grzegorz Chrupa la Towards a Machine-Learning Architecture for Lexical Functional Grammar Parsing Grzegorz Chrupa la A dissertation submitted in fulfilment of the requirements for the award of Doctor of Philosophy (Ph.D.)

More information

Basic Parsing with Context-Free Grammars. Some slides adapted from Julia Hirschberg and Dan Jurafsky 1

Basic Parsing with Context-Free Grammars. Some slides adapted from Julia Hirschberg and Dan Jurafsky 1 Basic Parsing with Context-Free Grammars Some slides adapted from Julia Hirschberg and Dan Jurafsky 1 Announcements HW 2 to go out today. Next Tuesday most important for background to assignment Sign up

More information

MODELING DEPENDENCY GRAMMAR WITH RESTRICTED CONSTRAINTS. Ingo Schröder Wolfgang Menzel Kilian Foth Michael Schulz * Résumé - Abstract

MODELING DEPENDENCY GRAMMAR WITH RESTRICTED CONSTRAINTS. Ingo Schröder Wolfgang Menzel Kilian Foth Michael Schulz * Résumé - Abstract T.A.L., vol. 38, n o 1, pp. 1 30 MODELING DEPENDENCY GRAMMAR WITH RESTRICTED CONSTRAINTS Ingo Schröder Wolfgang Menzel Kilian Foth Michael Schulz * Résumé - Abstract Parsing of dependency grammar has been

More information

Annotation Projection for Discourse Connectives

Annotation Projection for Discourse Connectives SFB 833 / Univ. Tübingen Penn Discourse Treebank Workshop Annotation projection Basic idea: Given a bitext E/F and annotation for F, how would the annotation look for E? Examples: Word Sense Disambiguation

More information

Universal Grammar 2. Universal Grammar 1. Forms and functions 1. Universal Grammar 3. Conceptual and surface structure of complex clauses

Universal Grammar 2. Universal Grammar 1. Forms and functions 1. Universal Grammar 3. Conceptual and surface structure of complex clauses Universal Grammar 1 evidence : 1. crosslinguistic investigation of properties of languages 2. evidence from language acquisition 3. general cognitive abilities 1. Properties can be reflected in a.) structural

More information

COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR

COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR COMPUTATIONAL COMPLEXITY OF LEFT-ASSOCIATIVE GRAMMAR ROLAND HAUSSER Institut für Deutsche Philologie Ludwig-Maximilians Universität München München, West Germany 1. CHOICE OF A PRIMITIVE OPERATION The

More information

Specifying a shallow grammatical for parsing purposes

Specifying a shallow grammatical for parsing purposes Specifying a shallow grammatical for parsing purposes representation Atro Voutilainen and Timo J~irvinen Research Unit for Multilingual Language Technology P.O. Box 4 FIN-0004 University of Helsinki Finland

More information

Dependency, licensing and the nature of grammatical relations *

Dependency, licensing and the nature of grammatical relations * UCL Working Papers in Linguistics 8 (1996) Dependency, licensing and the nature of grammatical relations * CHRISTIAN KREPS Abstract Word Grammar (Hudson 1984, 1990), in common with other dependency-based

More information

Natural Language Processing. George Konidaris

Natural Language Processing. George Konidaris Natural Language Processing George Konidaris gdk@cs.brown.edu Fall 2017 Natural Language Processing Understanding spoken/written sentences in a natural language. Major area of research in AI. Why? Humans

More information

cambridge occasional papers in linguistics Volume 8, Article 3: 41 55, 2015 ISSN

cambridge occasional papers in linguistics Volume 8, Article 3: 41 55, 2015 ISSN C O P i L cambridge occasional papers in linguistics Volume 8, Article 3: 41 55, 2015 ISSN 2050-5949 THE DYNAMICS OF STRUCTURE BUILDING IN RANGI: AT THE SYNTAX-SEMANTICS INTERFACE H a n n a h G i b s o

More information

Feature-Based Grammar

Feature-Based Grammar 8 Feature-Based Grammar James P. Blevins 8.1 Introduction This chapter considers some of the basic ideas about language and linguistic analysis that define the family of feature-based grammars. Underlying

More information

Heads and history NIGEL VINCENT & KERSTI BÖRJARS The University of Manchester

Heads and history NIGEL VINCENT & KERSTI BÖRJARS The University of Manchester Heads and history NIGEL VINCENT & KERSTI BÖRJARS The University of Manchester Heads come in two kinds: lexical and functional. While the former are treated in a largely uniform way across theoretical frameworks,

More information

Underlying and Surface Grammatical Relations in Greek consider

Underlying and Surface Grammatical Relations in Greek consider 0 Underlying and Surface Grammatical Relations in Greek consider Sentences Brian D. Joseph The Ohio State University Abbreviated Title Grammatical Relations in Greek consider Sentences Brian D. Joseph

More information

Derivations (MP) and Evaluations (OT) *

Derivations (MP) and Evaluations (OT) * Derivations (MP) and Evaluations (OT) * Leiden University (LUCL) The main claim of this paper is that the minimalist framework and optimality theory adopt more or less the same architecture of grammar:

More information

LING 329 : MORPHOLOGY

LING 329 : MORPHOLOGY LING 329 : MORPHOLOGY TTh 10:30 11:50 AM, Physics 121 Course Syllabus Spring 2013 Matt Pearson Office: Vollum 313 Email: pearsonm@reed.edu Phone: 7618 (off campus: 503-517-7618) Office hrs: Mon 1:30 2:30,

More information

LFG Semantics via Constraints

LFG Semantics via Constraints LFG Semantics via Constraints Mary Dalrymple John Lamping Vijay Saraswat fdalrymple, lamping, saraswatg@parc.xerox.com Xerox PARC 3333 Coyote Hill Road Palo Alto, CA 94304 USA Abstract Semantic theories

More information

Specification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments

Specification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments Specification and Evaluation of Machine Translation Toy Systems - Criteria for laboratory assignments Cristina Vertan, Walther v. Hahn University of Hamburg, Natural Language Systems Division Hamburg,

More information

1/20 idea. We ll spend an extra hour on 1/21. based on assigned readings. so you ll be ready to discuss them in class

1/20 idea. We ll spend an extra hour on 1/21. based on assigned readings. so you ll be ready to discuss them in class If we cancel class 1/20 idea We ll spend an extra hour on 1/21 I ll give you a brief writing problem for 1/21 based on assigned readings Jot down your thoughts based on your reading so you ll be ready

More information

- «Crede Experto:,,,». 2 (09) (http://ce.if-mstuca.ru) '36

- «Crede Experto:,,,». 2 (09) (http://ce.if-mstuca.ru) '36 - «Crede Experto:,,,». 2 (09). 2016 (http://ce.if-mstuca.ru) 811.512.122'36 Ш163.24-2 505.. е е ы, Қ х Ц Ь ғ ғ ғ,,, ғ ғ ғ, ғ ғ,,, ғ че ые :,,,, -, ғ ғ ғ, 2016 D. A. Alkebaeva Almaty, Kazakhstan NOUTIONS

More information

Hans-Ulrich Block, Hans Haugeneder Siemens AG, MOnchen ZT ZTI INF W. Germany. (2) [S' [NP who][s does he try to find [NP e]]s IS' $=~

Hans-Ulrich Block, Hans Haugeneder Siemens AG, MOnchen ZT ZTI INF W. Germany. (2) [S' [NP who][s does he try to find [NP e]]s IS' $=~ The Treatment of Movement-Rules in a LFG-Parser Hans-Ulrich Block, Hans Haugeneder Siemens AG, MOnchen ZT ZT NF W. Germany n this paper we propose a way of how to treat longdistance movement phenomena

More information

The Pennsylvania State University. The Graduate School. College of the Liberal Arts THE TEACHABILITY HYPOTHESIS AND CONCEPT-BASED INSTRUCTION

The Pennsylvania State University. The Graduate School. College of the Liberal Arts THE TEACHABILITY HYPOTHESIS AND CONCEPT-BASED INSTRUCTION The Pennsylvania State University The Graduate School College of the Liberal Arts THE TEACHABILITY HYPOTHESIS AND CONCEPT-BASED INSTRUCTION TOPICALIZATION IN CHINESE AS A SECOND LANGUAGE A Dissertation

More information

Hindi-Urdu Phrase Structure Annotation

Hindi-Urdu Phrase Structure Annotation Hindi-Urdu Phrase Structure Annotation Rajesh Bhatt and Owen Rambow January 12, 2009 1 Design Principle: Minimal Commitments Binary Branching Representations. Mostly lexical projections (P,, AP, AdvP)

More information

A Grammar for Battle Management Language

A Grammar for Battle Management Language Bastian Haarmann 1 Dr. Ulrich Schade 1 Dr. Michael R. Hieb 2 1 Fraunhofer Institute for Communication, Information Processing and Ergonomics 2 George Mason University bastian.haarmann@fkie.fraunhofer.de

More information

BULATS A2 WORDLIST 2

BULATS A2 WORDLIST 2 BULATS A2 WORDLIST 2 INTRODUCTION TO THE BULATS A2 WORDLIST 2 The BULATS A2 WORDLIST 21 is a list of approximately 750 words to help candidates aiming at an A2 pass in the Cambridge BULATS exam. It is

More information

The Structure of Multiple Complements to V

The Structure of Multiple Complements to V The Structure of Multiple Complements to Mitsuaki YONEYAMA 1. Introduction I have recently been concerned with the syntactic and semantic behavior of two s in English. In this paper, I will examine the

More information

A Computational Evaluation of Case-Assignment Algorithms

A Computational Evaluation of Case-Assignment Algorithms A Computational Evaluation of Case-Assignment Algorithms Miles Calabresi Advisors: Bob Frank and Jim Wood Submitted to the faculty of the Department of Linguistics in partial fulfillment of the requirements

More information

Phenomena of gender attraction in Polish *

Phenomena of gender attraction in Polish * Chiara Finocchiaro and Anna Cielicka Phenomena of gender attraction in Polish * 1. Introduction The selection and use of grammatical features - such as gender and number - in producing sentences involve

More information

Objectives. Chapter 2: The Representation of Knowledge. Expert Systems: Principles and Programming, Fourth Edition

Objectives. Chapter 2: The Representation of Knowledge. Expert Systems: Principles and Programming, Fourth Edition Chapter 2: The Representation of Knowledge Expert Systems: Principles and Programming, Fourth Edition Objectives Introduce the study of logic Learn the difference between formal logic and informal logic

More information

IN THIS UNIT YOU LEARN HOW TO: SPEAKING 1 Work in pairs. Discuss the questions. 2 Work with a new partner. Discuss the questions.

IN THIS UNIT YOU LEARN HOW TO: SPEAKING 1 Work in pairs. Discuss the questions. 2 Work with a new partner. Discuss the questions. 6 1 IN THIS UNIT YOU LEARN HOW TO: ask and answer common questions about jobs talk about what you re doing at work at the moment talk about arrangements and appointments recognise and use collocations

More information

PowerTeacher Gradebook User Guide PowerSchool Student Information System

PowerTeacher Gradebook User Guide PowerSchool Student Information System PowerSchool Student Information System Document Properties Copyright Owner Copyright 2007 Pearson Education, Inc. or its affiliates. All rights reserved. This document is the property of Pearson Education,

More information

Derivational and Inflectional Morphemes in Pak-Pak Language

Derivational and Inflectional Morphemes in Pak-Pak Language Derivational and Inflectional Morphemes in Pak-Pak Language Agustina Situmorang and Tima Mariany Arifin ABSTRACT The objectives of this study are to find out the derivational and inflectional morphemes

More information

Enhancing Unlexicalized Parsing Performance using a Wide Coverage Lexicon, Fuzzy Tag-set Mapping, and EM-HMM-based Lexical Probabilities

Enhancing Unlexicalized Parsing Performance using a Wide Coverage Lexicon, Fuzzy Tag-set Mapping, and EM-HMM-based Lexical Probabilities Enhancing Unlexicalized Parsing Performance using a Wide Coverage Lexicon, Fuzzy Tag-set Mapping, and EM-HMM-based Lexical Probabilities Yoav Goldberg Reut Tsarfaty Meni Adler Michael Elhadad Ben Gurion

More information

Derivational: Inflectional: In a fit of rage the soldiers attacked them both that week, but lost the fight.

Derivational: Inflectional: In a fit of rage the soldiers attacked them both that week, but lost the fight. Final Exam (120 points) Click on the yellow balloons below to see the answers I. Short Answer (32pts) 1. (6) The sentence The kinder teachers made sure that the students comprehended the testable material

More information

Which verb classes and why? Research questions: Semantic Basis Hypothesis (SBH) What verb classes? Why the truth of the SBH matters

Which verb classes and why? Research questions: Semantic Basis Hypothesis (SBH) What verb classes? Why the truth of the SBH matters Which verb classes and why? ean-pierre Koenig, Gail Mauner, Anthony Davis, and reton ienvenue University at uffalo and Streamsage, Inc. Research questions: Participant roles play a role in the syntactic

More information

An Empirical and Computational Test of Linguistic Relativity

An Empirical and Computational Test of Linguistic Relativity An Empirical and Computational Test of Linguistic Relativity Kathleen M. Eberhard* (eberhard.1@nd.edu) Matthias Scheutz** (mscheutz@cse.nd.edu) Michael Heilman** (mheilman@nd.edu) *Department of Psychology,

More information

Update on Soar-based language processing

Update on Soar-based language processing Update on Soar-based language processing Deryle Lonsdale (and the rest of the BYU NL-Soar Research Group) BYU Linguistics lonz@byu.edu Soar 2006 1 NL-Soar Soar 2006 2 NL-Soar developments Discourse/robotic

More information

Developing Grammar in Context

Developing Grammar in Context Developing Grammar in Context intermediate with answers Mark Nettle and Diana Hopkins PUBLISHED BY THE PRESS SYNDICATE OF THE UNIVERSITY OF CAMBRIDGE The Pitt Building, Trumpington Street, Cambridge, United

More information

Improved Effects of Word-Retrieval Treatments Subsequent to Addition of the Orthographic Form

Improved Effects of Word-Retrieval Treatments Subsequent to Addition of the Orthographic Form Orthographic Form 1 Improved Effects of Word-Retrieval Treatments Subsequent to Addition of the Orthographic Form The development and testing of word-retrieval treatments for aphasia has generally focused

More information

Semantic Inference at the Lexical-Syntactic Level for Textual Entailment Recognition

Semantic Inference at the Lexical-Syntactic Level for Textual Entailment Recognition Semantic Inference at the Lexical-Syntactic Level for Textual Entailment Recognition Roy Bar-Haim,Ido Dagan, Iddo Greental, Idan Szpektor and Moshe Friedman Computer Science Department, Bar-Ilan University,

More information

A Constructive View of GPSG. How to Make It Work

A Constructive View of GPSG. How to Make It Work A Constructive View of GPSG or How to Make It Work Stephan BUSEMANN Christa HAUENSCHILD Technical University of Berlin Institute for Software and Theoretical Computer Science Project Group KIT Sekr. FR

More information

On Labeling: Principle C and Head Movement

On Labeling: Principle C and Head Movement Syntax 2010 DOI: 10.1111/j.1467-9612.2010.00140.x On Labeling: Principle C and Head Movement Carlo Cecchetto and Caterina Donati Abstract. In this paper, we critically reexamine the two algorithms that

More information

Notes on The Sciences of the Artificial Adapted from a shorter document written for course (Deciding What to Design) 1

Notes on The Sciences of the Artificial Adapted from a shorter document written for course (Deciding What to Design) 1 Notes on The Sciences of the Artificial Adapted from a shorter document written for course 17-652 (Deciding What to Design) 1 Ali Almossawi December 29, 2005 1 Introduction The Sciences of the Artificial

More information

Comparison of Linguistic Results: Literate structures in written texts first graders Germany / Turkey. Ulrich Mehlem Yazgül Şimşek

Comparison of Linguistic Results: Literate structures in written texts first graders Germany / Turkey. Ulrich Mehlem Yazgül Şimşek Comparison of Linguistic Results: Literate structures in written texts first graders Germany / Turkey Ulrich Mehlem Yazgül Şimşek 1 Outline 1. Nominal Phrases as indicators of a literate text structure

More information

Frequency and pragmatically unmarked word order *

Frequency and pragmatically unmarked word order * Frequency and pragmatically unmarked word order * Matthew S. Dryer SUNY at Buffalo 1. Introduction Discussions of word order in languages with flexible word order in which different word orders are grammatical

More information

In Udmurt (Uralic, Russia) possessors bear genitive case except in accusative DPs where they receive ablative case.

In Udmurt (Uralic, Russia) possessors bear genitive case except in accusative DPs where they receive ablative case. Sören E. Worbs The University of Leipzig Modul 04-046-2015 soeren.e.worbs@gmail.de November 22, 2016 Case stacking below the surface: On the possessor case alternation in Udmurt (Assmann et al. 2014) 1

More information

Chapter 3: Semi-lexical categories. nor truly functional. As Corver and van Riemsdijk rightly point out, There is more

Chapter 3: Semi-lexical categories. nor truly functional. As Corver and van Riemsdijk rightly point out, There is more Chapter 3: Semi-lexical categories 0 Introduction While lexical and functional categories are central to current approaches to syntax, it has been noticed that not all categories fit perfectly into this

More information

Structure-Preserving Extraction without Traces

Structure-Preserving Extraction without Traces Empirical Issues in Syntax and Semantics 5 O. Bonami & P. Cabredo Hofherr (eds.) 2004, pp. 27 44 http://www.cssp.cnrs.fr/eiss5 Structure-Preserving Extraction without Traces Wesley Davidson 1 Introduction

More information

CAS LX 522 Syntax I. Long-distance wh-movement. Long distance wh-movement. Islands. Islands. Locality. NP Sea. NP Sea

CAS LX 522 Syntax I. Long-distance wh-movement. Long distance wh-movement. Islands. Islands. Locality. NP Sea. NP Sea 19 CAS LX 522 Syntax I wh-movement and locality (9.1-9.3) Long-distance wh-movement What did Hurley say [ CP he was writing ]? This is a question: The highest C has a [Q] (=[clause-type:q]) feature and

More information

AN INTRODUCTION (2 ND ED.) (LONDON, BLOOMSBURY ACADEMIC PP. VI, 282)

AN INTRODUCTION (2 ND ED.) (LONDON, BLOOMSBURY ACADEMIC PP. VI, 282) B. PALTRIDGE, DISCOURSE ANALYSIS: AN INTRODUCTION (2 ND ED.) (LONDON, BLOOMSBURY ACADEMIC. 2012. PP. VI, 282) Review by Glenda Shopen _ This book is a revised edition of the author s 2006 introductory

More information

Accurate Unlexicalized Parsing for Modern Hebrew

Accurate Unlexicalized Parsing for Modern Hebrew Accurate Unlexicalized Parsing for Modern Hebrew Reut Tsarfaty and Khalil Sima an Institute for Logic, Language and Computation, University of Amsterdam Plantage Muidergracht 24, 1018TV Amsterdam, The

More information

Modeling Attachment Decisions with a Probabilistic Parser: The Case of Head Final Structures

Modeling Attachment Decisions with a Probabilistic Parser: The Case of Head Final Structures Modeling Attachment Decisions with a Probabilistic Parser: The Case of Head Final Structures Ulrike Baldewein (ulrike@coli.uni-sb.de) Computational Psycholinguistics, Saarland University D-66041 Saarbrücken,

More information

California Department of Education English Language Development Standards for Grade 8

California Department of Education English Language Development Standards for Grade 8 Section 1: Goal, Critical Principles, and Overview Goal: English learners read, analyze, interpret, and create a variety of literary and informational text types. They develop an understanding of how language

More information

Susanne J. Jekat

Susanne J. Jekat IUED: Institute for Translation and Interpreting Respeaking: Loss, Addition and Change of Information during the Transfer Process Susanne J. Jekat susanne.jekat@zhaw.ch This work was funded by Swiss TxT

More information

A relational approach to translation

A relational approach to translation A relational approach to translation Rémi Zajac Project POLYGLOSS* University of Stuttgart IMS-CL /IfI-AIS, KeplerstraBe 17 7000 Stuttgart 1, West-Germany zajac@is.informatik.uni-stuttgart.dbp.de Abstract.

More information

Project in the framework of the AIM-WEST project Annotation of MWEs for translation

Project in the framework of the AIM-WEST project Annotation of MWEs for translation Project in the framework of the AIM-WEST project Annotation of MWEs for translation 1 Agnès Tutin LIDILEM/LIG Université Grenoble Alpes 30 october 2014 Outline 2 Why annotate MWEs in corpora? A first experiment

More information

The Interface between Phrasal and Functional Constraints

The Interface between Phrasal and Functional Constraints The Interface between Phrasal and Functional Constraints John T. Maxwell III* Xerox Palo Alto Research Center Ronald M. Kaplan t Xerox Palo Alto Research Center Many modern grammatical formalisms divide

More information

More Morphology. Problem Set #1 is up: it s due next Thursday (1/19) fieldwork component: Figure out how negation is expressed in your language.

More Morphology. Problem Set #1 is up: it s due next Thursday (1/19) fieldwork component: Figure out how negation is expressed in your language. More Morphology Problem Set #1 is up: it s due next Thursday (1/19) fieldwork component: Figure out how negation is expressed in your language. Martian fieldwork notes Image of martian removed for copyright

More information