Simpler TAG semantics through synchronization

Size: px
Start display at page:

Download "Simpler TAG semantics through synchronization"

Transcription

1 impler TAG semanics hrough snchronizaion The Harvard communi has made his aricle openl available. Please share how his access benefis ou. Your sor maers. Ciaion Published Version Accessed Ciable Link Terms of Use Rebecca Nesson and uar M. hieber. impler TAG semanics hrough snchronizaion. In Proceedings of he h Conference on Formal Grammar, Malaga, pain, 9-0 Jul 006. hp://cslipublicaions.sanford.edu/fg/006/nesson.pdf Februar 9, 08 :4:59 AM ET hp://nrs.harvard.edu/urn-:hul.insrepos:5595 This aricle was downloaded from Harvard Universi's DAH reposior, and is made available under he erms and condiions applicable o Oher Posed Maerial, as se forh a hp://nrs.harvard.edu/urn-:hul.insrepos:dash.curren.erms-ofuse#laa (Aricle begins on nex page)

2 Rebecca Nesson and uar M. hieber impler TAG emanics hrough nchronizaion. In Proceedings of he h Conference on Formal Grammar, Malaga, pain, 9 0 Jul. FG 006: The h conference on Formal Grammar Malaga, pain Jul 9-0, 006 Organizing Commiee: Paola Monachesi Gerald Penn Giorgio aa hul Winner CENTER FOR THE TUDY OF LANGUAGE AND INFORMATION

3

4 Conens impler TAG emanics hrough nchronizaion Rebecca Nesson and uar hieber iii

5

6 impler TAG emanics hrough nchronizaion Rebecca Nesson and uar hieber Kewords nchronous Tree-Adjoining Grammar, TAG semanics, quanifier scope, long-disance WH-movemen, raising verbs, aiude verbs, adverbs, relaive clauses, preposiional phrases. Absrac In recen ears Laura Kallmeer, Maribel Romero, and heir collaboraors have led research on TAG semanics hrough a series of papers refining a ssem of TAG semanics compuaion. Kallmeer and Romero bring ogeher he lessons of hese aemps wih a se of desirable properies ha such a ssem should have. Firs, compuaion of he semanics of a senence should rel onl on he relaionships expressed in he TAG derivaion ree. econd, he generaed semanics should compacl represen all valid inerpreaions of he inpu senence, in paricular wih respec o quanifier scope. Third, he formalism should no, if possible, increase he expressivi of he TAG formalism. We revive he proposal of using snchronous TAG (TAG) o simulaneousl generae snacic and semanic represenaions for an inpu senence. Alhough TAG mees he hree requiremens above, no serious aemp had previousl been made o deermine wheher i can model he semanic consrucions ha have proved difficul for oher approaches. In his paper we begin exploraion of his quesion b proposing TAG analses of man of he hard cases ha have spurred he research in his area. We reframe he TAG semanics problem in he conex of he TAG formalism and in he process presen a simple, inuiive base for furher exploraion of TAG semanics. We provide analses ha demonsrae how TAG can handle quanifier scope, long-disance WH-movemen, ineracion of raising verbs and adverbs, aiude verbs and quanifiers, relaive clauses, and quanifiers wihin preposiional phrases. FG-006. Organizing Commiee:, Paola Monachesi, Gerald Penn, Giorgio aa, hul Winner. Coprigh c 006, CLI Publicaions.

7 / Rebecca Nesson and uar hieber. Inroducion In recen ears Laura Kallmeer, Maribel Romero, and heir collaboraors have led research on TAG semanics hrough a series of papers refining a ssem of TAG semanics compuaion using evolving echniques including enriched derivaion ree srucure (Kallmeer, 00a,b), flexible composiion of feaure-based TAG wih a semanic represenaion associaed wih each elemenar ree (Kallmeer and Joshi, 00, Joshi e al., 00, Kallmeer, 00), semanic feaures in a more expressive exension of feaure-based TAG (Garden and Kallmeer, 00), and, mos recenl, semanic feaures on he derivaion ree iself (Kallmeer and Romero, 004, Romero e al., 004). Kallmeer and Romero (004) bring ogeher he lessons of hese aemps wih a se of desirable properies ha such a ssem should have. Firs, compuaion of he semanics of a senence should rel onl on he relaionships expressed in he TAG derivaion ree. Because TAG elemenar rees represen minimal semanic unis, he onl informaion necessar for semanic compuaion should be he informaion encoded in he derivaion ree: which elemenar rees have combined and he address a which he combining operaion ook place. econd, he generaed semanics should compacl represen all valid inerpreaions of he inpu senence, in paricular wih respec o quanifier scope. Third, he formalism should no, if possible, increase he expressivi of he TAG formalism. We revive he proposal of using snchronous TAG (TAG) o simulaneousl generae snacic and semanic represenaions for an inpu senence (hieber and chabes, 990). Alhough TAG mees he hree requiremens above, no serious aemp had previousl been made o deermine wheher i can model he semanic consrucions ha have proved difficul for oher approaches. In his paper we begin exploraion of his quesion b proposing TAG analses of man of he hard cases ha have spurred he research in his area. We reframe he TAG semanics problem in he conex of he TAG formalism and in he process presen a simple, inuiive base for furher exploraion of TAG semanics. Afer reviewing TAG in ecion., we provide analses in ecions.. hrough..4 for senences ha exemplif several hard cases for TAG semanics ha have been raised b Kallmeer and ohers in recen papers: quanifier scope (as exemplified b senences () and (5), presened below along wih he desired semanic inerpreaions), longdisance WH-movemen (), ineracion of raising verbs and adverbs, aiude verbs and quanifiers (,4,5), relaive clauses (6), and quan-

8 impler TAG emanics hrough nchronizaion / ifiers wihin preposiional phrases (7) (Kallmeer and Romero, 004, Romero e al., 004, Joshi e al., 00, Kallmeer, 00, Kallmeer and Joshi, 00). () Everone someone. ever(x, person(x), some(z, person(z), like(x, z))) some(z, person(z), ever(x, person(x), like(x, z))) () Who does Bill hink Paul said John? who(, hink(bill, sa(paul, like(john, )))) () Bill hinks John apparenl Mar. hink(bill, apparenl(like(john, mar))) (4) John someimes everone. ever(x, person(x), someimes(like(john, x))) someimes(ever(x, person(x), like(john, x))) (5) Bill hinks everone someone. hink(bill, ever(x, person(x), some(z, person(z), (x, z)))) hink(bill, some(z, person(z), ever(x, person(x), (x, z)))) (6) A problem whose soluion is difficul sumped Bill. a(x, and( problem(x), he(, and(soluion(), poss(x, )), isdifficul())), sumped(bill, x)) (7) Two poliicians sp on someone from ever ci. wo(x, poliician(x), ever(z, ci(z), some(, person() f rom(z, ), spon(x, )))) ever(z, ci(z), some(, person() f rom(z, ), wo(x, polician(x), spon(x, )))) wo(x, poliician(x), some(, ever(z, ci(z), person() f rom(z, )) spon(x, ))) some(, ever(z, ci(z), person() f rom(z, )) wo(x, poliician(x), spon(x, ))). Inroducion o nchronous TAG A ree-adjoining grammar (TAG) consiss of a se of elemenar ree srucures and wo operaions, subsiuion and adjuncion, used We noae curried wo-place relaions P(x)() as P(, x) for readabili.

9 4 / Rebecca Nesson and uar hieber NP V P = NP V P NP V NP John V NP John V P NP V P = Adv V P V NP NP V P Adv V P apparenl apparenl V NP FIGURE Example TAG subsiuion and adjucion operaions. o combine hese srucures. The elemenar rees can be of arbirar deph. Each inernal node is labeled wih a nonerminal smbol. Fronier nodes ma be labeled wih eiher erminal smbols or nonerminal smbols and one of he diacriics or. Use of he diacriic on a fronier node indicaes ha i is a subsiuion node. The subsiuion operaion occurs when an elemenar ree rooed in he nonerminal smbol A is subsiued for a subsiuion node labeled wih he nonerminal smbol A. Auxiliar rees are elemenar rees in which he roo and a fronier node, called he foo node and disinguished b he diacriic, are labeled wih he same nonerminal. The adjuncion operaion involves splicing an auxiliar ree wih roo and designaed foo node labeled wih a nonerminal A a a node in an elemenar ree also labeled wih nonerminal A. Examples of he subsiuion and adjuncion operaions on sample elemenar rees are shown in Figure. nchronous TAG (TAG) exends TAG b aking he elemenar srucures o be pairs of TAG rees wih links beween paricular nodes in hose rees. An TAG is a se of riples, L, R, where L and R are elemenar TAG rees and is a linking relaion beween nodes in L and nodes in R (hieber, 994, hieber and chabes, 990). Derivaion proceeds as in TAG excep ha all operaions mus be paired. Tha is, a ree can onl be subsiued or adjoined a a node if is pair is simulaneousl subsiued or adjoined a a linked node. We noae he links b using boxed indices i marking linked nodes. Figure conains a sample English snax/semanics grammar frag-

10 impler TAG emanics hrough nchronizaion / 5 (a) NP e V P John john Adv V P, NP V P e, e NP e apparenl apparenl V NP 4 e 4 Mar mar (b) NP Adv V P V, V P apparenl e, NP e e john (c) john 4 mar apparenl John apparenl Mar mar FIGURE An English snax/semanics TAG fragmen (a), derived ree pair (b), and derivaion ree (c) for he senence John apparenl Mar. men ha can be used o parse he senence John apparenl Mar. The node labels we use in he semanics correspond o he semanic pes of he phrases he dominae. Variables such as x in he semanic ree in Figure are aken o be bound in he obvious wa, so ha in muliple uses of he ree he can be presumed o be renamed apar. Figure (c) shows he derivaion ree for he senence. ubsiuions are noaed wih a solid line and adjuncions are noaed wih a dashed line. Noe ha each link in he derivaion ree specifies a link number in he elemenar ree pair. The links provide he locaion of he operaions in he snax ree and in he semanics ree. These operaions mus occur a linked nodes in he arge elemenar ree pair. In his case, he noun phrases John and Mar subsiue ino a links and 4 respecivel. The word apparenl adjoins a link. The resuling semanic represenaion can be read off he derived ree b reaing he lefmos child of a node as a funcor and is siblings as is argumens. Our sample senence hus resuls in he semanic represenaion apparenl((john, mar)). This represenaion is for he sake of readabili. The labels could be replaced using an well-chosen finie se of nonerminal smbols.

11 6 / Rebecca Nesson and uar hieber N e, (a) NP ever x De N ever e, x e x NP De N some e, some e one person NP V P 4 e, e 4 ever some (b) V NP 4 e 4 person person (c) NP V P ever x some De N V NP e, x some e, De N person e, e, e person ever one some one person e x ever x e, x e, person e e x FIGURE The elemenar ree pairs (a), derivaion ree (b), and derived snacic and semanic rees (c) for he senence Everone someone. Noe ha he derivaion ree is a scope neural represenaion: depending on wheher ever or some adjoins higher, differen semanic derived rees and scope orderings are obained.. TAG Analses of he Phenomena.. Quanifier cope and Wh-Words For senence (), we would like o generae a scope-neural semanic represenaion ha allows boh he reading where some akes scope over ever and he reading where ever akes scope over some. We propose a soluion in which a derivaion ree wih muliple adjuncion nondeerminisicall deermines muliple derived rees each manifesing explici scope (chabes and hieber, 99); he derivaion ree iself is herefore he scope neural represenaion. The muli-componen quanifier approach followed b Joshi e al. (00) suggess a naural implemenaion of quanifiers in TAG. In his approach he snacic ree for quanifiers has wo pars, one ha The muli-componen approach o quanifiers in TAG was firs suggesed b hieber and chabes (990) under he rewriing definiion of TAG derivaion where he order of rewriing produced he scope ambigui. Williford (99) explored he use of muliple adjuncion o achieve scope ambigui.

12 impler TAG emanics hrough nchronizaion / 7 WH 4 NP V P V NP wh ǫ WH who who e e, 4 e e 4 NP V P V hink 5 who wh 4 john e, hinks sa e paul hinks bill FIGURE 4 elecion of elemenar rees and full derivaion ree for he senence Who does Bill hink Paul said John?. corresponds o he scope of he quanifier and aaches a he poin where he quanifier akes scope, and he oher ha conains he quanifier iself and is resricion and aaches where snacicall expeced a a noun phrase. In heir work, a single-node auxiliar ree is used for he scope par of he snax in order o ge he desired relaionship beween he quanifier and he quanified expression in feaures hreaded hrough he derivaion ree and hence in he semanics. Using TAG, we do no need he single-node auxiliar ree in he snax because we can pair he usual snacic represenaion for quanified NPs wih a muli-componen semanic represenaion ha expresses he same idea (Figure ). In order o use hese quanifiers, we change he links in he elemenar rees for verbs o allow a single link o indicae wo posiions in he semanics where a ree pair can adjoin, as shown in Figure. 4 Given his represenaion of quanifiers we ge he derivaion ree shown in Figure for senence (). 5 Noe ha he resuling derivaion ree necessaril incorporaes muliple adjuncion (chabes and hieber, 99), ha is, muliple auxiliar rees are adjoined a he same node 4 We have chosen here o add he hree-wa links in addiion o he exising links in he ree for unquanified noun phrases such as proper nouns (hough we suppress he wo-wa NP links in he figures for readabili). Anoher possibili would be o remove he wo-wa links. In his case, all noun phrases would be lifed à la Monague. Tha is, even unquanified noun phrases would have a scope par, which could be a single-node auxiliar ree. 5 We noae muli-componen inserions ha involve boh a subsiuion and an adjuncion wih a combinaion dashed and doed line.

13 8 / Rebecca Nesson and uar hieber ( a ) ( b ) ( c ) hinks bill 4 4 john apparenl mar john someimes ever person hinks bill 4 ever some person person FIGURE 5 Derivaion rees for (a) Bill hinks John apparenl Mar, (b) John someimes everone, and (c) Bill hinks everone someone. in an auxiliar ree. In paricular, he scope pars of boh ever and some aach a he roo of he semanic ree of. uch cases of muliple adjuncion induce ambigui; he derivaion ree represens muliple derived rees. In he case a hand, he derivaion is ambiguous as o which quanifier scopes higher han he oher. This ambigui in he derivaion ree hus models he se of valid scopings for he senence. In essence, his mehod uses muliple adjuncion o model scope-neurali. This same mehod can be used o obain he correc scope relaions for senences wih long-disance WH-movemen such as senence () using he muli-componen elemenar ree pair for who and he elemenar ree pairs for hinks (he ree pair for sas is similar) and in he WH conex given in Figure 4. Kallmeer and Romero (004) highligh his case as difficul because in he usual snacic analsis here is no link in he derivaion ree beween who and hinks or beween hinks and, bu in he desired semanics who akes scope over he hinks proposiion and he proposiion is an argumen o hinks. In our analsis, b conras, he semanics follows quie naurall from he sandard snacic analsis of he srucure of he elemenar ree in he WH conex and he elemenar ree pair for hinks given in Figure 4. The derivaion of his senence is also given in Figure 4. Noe ha i is required b he srucure of he rees ha who ake scope over hinks... The Ineracion Beween Aiude Verbs, Raising Verbs, Adverbs and Quanifiers The ineracion beween aiude verbs and raising verbs or adverbs as in senences (), (4), and (5) has been problemaic for TAG semanics (Kallmeer and Romero, 004). A successful analsis mus be flexible enough o produce he correc semanics for senence () even hough here is no link beween hinks and apparenl in he derivaion ree. I mus also be flexible enough o allow all scope orderings beween

14 impler TAG emanics hrough nchronizaion / 9 NP V P 4 V NP 4 e, e e 4 FIGURE 6 Modified ree for ha enforces a resricion on quanifiers scoping ouside of he finie clause. VP modifiers and quanifiers as in senence (4). In fac, given he elemenar rees we have alread presened and he ones for aiude verbs demonsraed b Figure 4, our analsis alread allows for scope ineracions among all hese elemens. Indeed, because he semanic componens of aiude verbs, VP modifiers, and quanifiers all adjoin a he same node in he semanic ree of he verb, our analsis allows all scope orderings among hem. This is clearl oo permissive, because i allows quanifiers o scope ou of he finie clause in which he appear and would allow a reading of senence () in which apparenl scopes over hinks. To preven quanifiers from scoping ou of he finie clause in which he appear, as in senences () and (5), we can add an addiional adjuncion sie o he semanic rees for verbs above he curren roo node. This is shown in Figure 6 in he ree pair. The link configuraion ensures ha aiude verbs (adjoining a link ) will now scope higher han all VP modifiers (adjoining a ) and quanifiers (adjoining a links and 4). VP modifiers and quanifiers will sill be able o ake all scope orderings relaive o each oher. Using he modified verb rees, TAG produces he correc semanics for senences (), (4), and (5) wih he derivaions given in Figure 5... Relaive Clauses Relaive clauses provide anoher puaivel difficul case for TAG semanics because boh he main verb and he relaive clause need access o he variable inroduced b he deerminer as in senence (6) (Kallmeer, 00). We overcome his difficul and compue he desired semanics b inroducing higher-order funcions ino he semanic rees using lambda-calculus noaion. This modificaion allows us o mainain ree-locali. The snacic analsis we use is similar o ha of Kallmeer (00) in ha i mainains he Condiion on Elemenar Tree Minimali (Frank, 99) and uses he relaive pronoun o inroduce he relaive clause. However, i reas

15 0 / Rebecca Nesson and uar hieber N e, N e, N N and e, e, N /NP se e, e, who N NP De N a a e, e N e, problem/ soluion problem/ soluion se N /NP e, λ z NP V P e, z ǫ is difficul isdifficul sumped 4 a bill problem who se soluion isdifficul FIGURE 7 Ke elemenar rees and derivaion for A problem whose soluion is difficul sumped Bill. he relaive pronoun as a noun modifier raher han a noun phrase modifier. We also posi he exisence of lifed versions of he elemenar rees for verbs in which heir argumen posiions have been absraced over. We use a higher-order conjuncion and ha relaes wo properies: λpqx.p(x) Q(x), and a higher-order se funcion ha relaes wo properies and makes use of he higher-order conjuncion: λp Qx.he(, and(p, λz.poss(x, z))(), Q()). The elemenar ree pairs and resuling derivaion ree for senence (6) are given in Figure 7. The derived ree is given in Figure 8. When reduced, he resuling semanics is a(z, λx.(problem(x) he(, soluion() poss(x, ),isdifficul())), sumped(bill, z))...4 Nesed Quanifiers and Inverse Linking Quanifiers in preposiional phrases such as in senence (7) pose anoher challenge for TAG semanics (Joshi e al., 00). Alhough a nesed quanifier ma ake scope over he quanifier wihin which i is nesed (so-called inverse linking ) no all permuaions of scope orderings of he quanifiers are available (Joshi e al., 00). In paricular, readings in which a quanifier inervenes beween a nesing quanifier and is nesed quanifier are no valid. In our example senence (7), his predics ha he readings some > wo > ever and ever > wo > some should no be valid. Joshi e al. (00) inroduce a special device allowing nesing and nesed quanifiers o form an indivisible quanifier

16 impler TAG emanics hrough nchronizaion / a e, e, e and e, e, sumped e problem se e, e, soluion λ z e, z isdifficul bill FIGURE 8 Derived ree for A problem whose soluion is difficul sumped Bill. se during he derivaion, which prevens oher quanifiers from inervening beween hem. In our soluion, because he nesed quanifier is inroduced hrough he preposiional phrase, which in urn modifies he noun phrase conaining he nesing quanifier, he wo quanifiers alread naurall form a se ha operaes as a uni wih respec o he res of he derivaion. 6 The elemenar ree pairs and derivaion rees for our analsis of (7) are shown in Figure 9. One noable feaure of his analsis is ha he four differen scope readings ha resul are no he produc of a single derivaion ree. The alernae scope orderings for he nesed and nesing quanifier exis because here are wo available adjuncion sies for he scope of quanifiers in he preposiional phrase o aach. This resuls in wo disinc derivaion rees. The alernae scope orderings for his quanifier se and he remaining quanifier are obained b muliple adjuncion a he roo of he verb ree. The se of valid derivaion rees for a senence hus consiues he scope neural represenaion. This se of rees ma be compacl represened, for insance as a shared fores. 7 6 We make use of ree-se-local TAG in he semanics where he ree se for ever adjoins ino he ree se for from. Alhough ree-se-local TAG is more powerful han TAG, his paricular use is benign because i canno be ieraed. More concreel, we could convenionall make he grammar ree-local b including all combinaions of preposiions wih quanifiers as elemenar rees in he grammar. 7 This analsis, like ha of Joshi e al. (00), makes several predicions abou quanifier scope ha migh be dispued. Firs, some argue ha more han four scope orderings should be available for senences like senence (7) (VanLehn, 978, Hobbs and hieber, 987). This analsis canno generae addiional scope orderings wihou breaking ree se locali. econd, he scope readings in which he nesing

17 / Rebecca Nesson and uar hieber NP De N wo/ some/ ever wo/ some/ e, ever e, e N N PP P NP from e, and e, e, from e wo spon 4 some poliicians person from ever ci FIGURE 9 Ke elemenar rees and derivaions for Two poliicians sp on someone from ever ci..4 Comparison o he Kallmeer and Romero Approach As menioned above, research on TAG semanics has been led b Laura Kallmeer, Maribel Romero, and heir collaboraors hrough a series of papers refining a ssem of TAG semanics compuaion using feaure unificaion and oher formal devices (Kallmeer and Romero, 004, Romero e al., 004, Kallmeer, 00, Kallmeer and Joshi, 00, Joshi e al., 00, Garden and Kallmeer, 00). Alhough heir approach has evolved over ime, he underling principles of using he relaionships expressed in he derivaion ree as he basis for he compuaion and generaing underspecified semanic represenaions have been consan. In is curren formulaion, he perform semanic compuaion b aaching semanic feaure srucures direcl o he nodes in he derivaion ree. When carefull chosen, hese feaures unif o produce an underspecified represenaion of he semanics of a senence ha, when furher disambiguaed, generaes he se of valid inerpreaions. In one or anoher of heir recen papers he have provided successful analses of each of he hard cases ha we have addressed here, hough some of heir analses migh have o be resaed o bring hem up o dae wih he newes formulaion of heir mehod. Our work owes much o heirs boh for he clear formulaion of he problems and he progress in formulaing analses for some of he hard cases. The primar advanage of our approach is is concepual simplici. The clear separaion of snax and semanics, he direcness of he link inerface, and he familiari of he TAG operaions used in our approach make i ver simple. The semanic-feaure-unificaion-based approach has become cleaner and easier o undersand as Kallmeer quanifier akes scope over he nesed quanifier resul in he nesed quanifier having scope over he resricion of he nesing quanifier bu no over is scope. Donke senence consrucions such as Ever man wih wo books loves hem call his predicion ino quesion.

18 impler TAG emanics hrough nchronizaion / and ohers have refined i over he ears. Noneheless, i is safe o sa ha he amoun of formal machiner including proposiional labels, separae individual and proposiional variables, semanic represenaions consising of a se of formulas and a se of scope consrains, feaures on he derived ree and he derivaion ree, each semanic feaure srucure conaining a nesed feaure srucure for each address in he elemenar snax ree, each of hese feaure srucures conaining feaures o handle binding of proposiional and individual variables, feaure unificaion, flexible composiion, and quanifier ses necessar o solve he range of problems ha we have addressed here, is qualiaivel more complex. In fac, we use no formal machiner ha had no been inroduced b 994 in he TAG lieraure. An addiional advanage of our approach is ha i does no increase he expressivi of he TAG formalism. One migh hink ha he inclusion of muliple adjuncion would lead o an increase in expressivi (Dras, 999). However, because links can onl be used once in an TAG derivaion, onl a finie number of muliple adjuncions ma occur a a single adjuncion sie. This rules ou problemaic uses of muliple adjuncion. Kallmeer and Romero mainain he semanic feaures on he derivaion ree raher han in he feaure srucures alread used in he feaure-based TAGs (FTAG) of heir snax in par because he se of semanic feaure srucures is no finie, poeniall increasing he expressivi of he FTAG formalism (Kallmeer and Romero, 004). Alhough moving he feaures o he derivaion ree avoids increasing he expressivi of he formalism used for snax when aken alone, he addiional expressivi in he feaures of he semanics could be used o block operaions in he snax hereb filering he snax o produce non-ree-adjoining languages. I remains o be seen wheher his addiional expressivi will be required for TAG semanics. Advanages and disadvanages of he differen mehods aside, in his sill nascen area of research i is desirable o have several quie differen approaches a our disposal as we explore he hard problems presened b generaing naural language semanics in he TAG framework. Our approach revives an old idea wih he aim of opening a new avenue for research ino semanics in he TAG framework..5 Conclusion We have presened he snchronous TAG formalism as a mehod for compuing semanics in he TAG framework, and have shown ha i enables simple, naural analses for all of he cases ha have exercised recen aemps a formulaing formal semanics for TAG. I saisfies

19 4 / Rebecca Nesson and uar hieber each of he desideraa laid ou a he beginning of his paper. Firs, i does no require an addiional informaion oher han ha available in he derivaion ree o generae he semanics. Because he snax and semanic represenaions are buil up snchronousl, he derivaion ree se is a complee specificaion of he relaionship beween hem. Nohing oher han he se of elemenar ree pairs and he snchronous TAG operaions are required o generae a semanic represenaion. econd, he derivaion ree se provides a compac represenaion for all valid semanic inerpreaions of he given senence. Using mulipladjoined quanifiers we ake advanage of he ambigui in he inerpreaion of he derivaion ree ha is inroduced b muliple adjuncion. We ake each possible ordering of mulipl-adjoined rees o be valid. We leave open he possibili of using an addiional mehod o prefer cerain scope orders and disprefer or eliminae ohers. Third, he TAG ssem, as used, does no increase he expressivi of he TAG formalism (hieber, 994). Finall, our analsis is a sraighforward expression of a simple idea: we use TAG for boh snax and semanics and use he derivaion ree and he links beween rees in elemenar ree pairs as he inerface beween hem..6 Acknowledgemens This work was suppored in par b gran II from he Naional cience Foundaion. We wish o hank Rani Nelken and he hree anonmous reviewers for valuable commens on earlier drafs. References Dras, Mark A mea-level grammar: Redefining snchronous TAG for ranslaion and paraphrase. In Proceedings of he Thir-evenh Annual Meeing of he Associaion for Compuaional Linguisics, pages Marland, UA. Frank, Rober. 99. nacic locali and Tree Adjoining Grammar: Grammaical, acquisiion and processing perspecives. Ph.D. Thesis, Universi of Pennslvania. Garden, Claire and Laura Kallmeer. 00. emanic consrucion in feaure-based TAG. In Proceedings of he 0h Meeing of he European Chaper of he Associaion for Compuaional Linguisics. Budapes, Hungar. Hobbs, Jerr and uar M. hieber An algorihm for generaing quanifier scopings. Compuaional Linguisics (-):47 6. Joshi, Aravind K., Laura Kallmeer, and Maribel Romero. 00. Flexible composiion in LTAG: Quanifier scope and inverse linking. In I. v. d..

20 References / 5 Harr Bun and R. Morane, eds., Proceedings of he Fifh Inernaional Workshop on Compuaional emanics IWC-5, pages Tilburg. Kallmeer, Laura. 00a. Enriching he TAG derivaion ree for semanics. In. Busemann, ed., KONVEN Konferenz zur Verarbeiung naürlicher prache., pages aarbrücken. Kallmeer, Laura. 00b. Using an enriched ag derivaion srucure as basis for semanics. In Proceedings of he ixh Inernaional Workshop on Tree Adjoining Grammar and Relaed Frameworks (TAG+6), pages 7 6. Venice. Kallmeer, Laura. 00. LTAG semanics for relaive clauses. In I. v. d.. Harr Bun and R. Morane, eds., Proceedings of he Fifh Inernaional Workshop on Compuaional emanics IWC-5, pages Tilburg. Kallmeer, Laura and Aravind K. Joshi. 00. Facoring predicae argumen and scope semanics: Underspecified semanics wih LTAG. Research on Language and Compuaion : 58. Kallmeer, Laura and Maribel Romero LTAG semanics wih semanic unificaion. In Proceedings of TAG+7, pages Vancouver. Romero, Maribel, Laura Kallmeer, and Olga Babko-Malaa LTAG semanics for quesions. In Proceedings of TAG+7, pages Vancouver. chabes, Yves and uar M. hieber. 99. An alernaive concepion of ree-adjoining derivaion. Compuaional Linguisics 0():9 4. hieber, uar M Resricing he weak-generaive capaci of snchronous ree-adjoining grammars. Compuaional Inelligence 0(4):7 85. hieber, uar M. and Yves chabes nchronous ree-adjoining grammars. In Proceedings of he h Inernaional Conference on Compuaional Linguisics, vol., pages Helsinki. VanLehn, Kur Deermining he scope of English quanifiers. Tech. Rep. 48, MIT Arificial Inelligence Laboraor, Cambridge, MA. Williford, ean. 99. Applicaion of snchronous ree-adjoining grammar o quanifier scoping phenomena in English. Undergraduae Thesis, Harvard College.

1 Language universals

1 Language universals AS LX 500 Topics: Language Uniersals Fall 2010, Sepember 21 4a. Anisymmery 1 Language uniersals Subjec-erb agreemen and order Bach (1971) discusses wh-quesions across SO and SO languages, hypohesizing:...

More information

Neural Network Model of the Backpropagation Algorithm

Neural Network Model of the Backpropagation Algorithm Neural Nework Model of he Backpropagaion Algorihm Rudolf Jakša Deparmen of Cyberneics and Arificial Inelligence Technical Universiy of Košice Lená 9, 4 Košice Slovakia jaksa@neuron.uke.sk Miroslav Karák

More information

More Accurate Question Answering on Freebase

More Accurate Question Answering on Freebase More Accurae Quesion Answering on Freebase Hannah Bas, Elmar Haussmann Deparmen of Compuer Science Universiy of Freiburg 79110 Freiburg, Germany {bas, haussmann}@informaik.uni-freiburg.de ABSTRACT Real-world

More information

An Effiecient Approach for Resource Auto-Scaling in Cloud Environments

An Effiecient Approach for Resource Auto-Scaling in Cloud Environments Inernaional Journal of Elecrical and Compuer Engineering (IJECE) Vol. 6, No. 5, Ocober 2016, pp. 2415~2424 ISSN: 2088-8708, DOI: 10.11591/ijece.v6i5.10639 2415 An Effiecien Approach for Resource Auo-Scaling

More information

Fast Multi-task Learning for Query Spelling Correction

Fast Multi-task Learning for Query Spelling Correction Fas Muli-ask Learning for Query Spelling Correcion Xu Sun Dep. of Saisical Science Cornell Universiy Ihaca, NY 14853 xusun@cornell.edu Anshumali Shrivasava Dep. of Compuer Science Cornell Universiy Ihaca,

More information

MyLab & Mastering Business

MyLab & Mastering Business MyLab & Masering Business Efficacy Repor 2013 MyLab & Masering: Business Efficacy Repor 2013 Edied by Michelle D. Speckler 2013 Pearson MyAccouningLab, MyEconLab, MyFinanceLab, MyMarkeingLab, and MyOMLab

More information

Information Propagation for informing Special Population Subgroups about New Ground Transportation Services at Airports

Information Propagation for informing Special Population Subgroups about New Ground Transportation Services at Airports Downloaded from ascelibrary.org by Basil Sephanis on 07/13/16. Copyrigh ASCE. For personal use only; all righs reserved. Informaion Propagaion for informing Special Populaion Subgroups abou New Ground

More information

Channel Mapping using Bidirectional Long Short-Term Memory for Dereverberation in Hands-Free Voice Controlled Devices

Channel Mapping using Bidirectional Long Short-Term Memory for Dereverberation in Hands-Free Voice Controlled Devices Z. Zhang e al.: Channel Mapping using Bidirecional Long Shor-Term Memory for Dereverberaion in Hands-Free Voice Conrolled Devices 525 Channel Mapping using Bidirecional Long Shor-Term Memory for Dereverberaion

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

"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

LTAG-spinal and the Treebank

LTAG-spinal and the Treebank LTAG-spinal and the Treebank a new resource for incremental, dependency and semantic parsing Libin Shen (lshen@bbn.com) BBN Technologies, 10 Moulton Street, Cambridge, MA 02138, USA Lucas Champollion (champoll@ling.upenn.edu)

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

The Discourse Anaphoric Properties of Connectives

The Discourse Anaphoric Properties of Connectives The Discourse Anaphoric Properties of Connectives Cassandre Creswell, Kate Forbes, Eleni Miltsakaki, Rashmi Prasad, Aravind Joshi Λ, Bonnie Webber y Λ University of Pennsylvania 3401 Walnut Street Philadelphia,

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

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

Loughton School s curriculum evening. 28 th February 2017

Loughton School s curriculum evening. 28 th February 2017 Loughton School s curriculum evening 28 th February 2017 Aims of this session Share our approach to teaching writing, reading, SPaG and maths. Share resources, ideas and strategies to support children's

More information

A Version Space Approach to Learning Context-free Grammars

A Version Space Approach to Learning Context-free Grammars Machine Learning 2: 39~74, 1987 1987 Kluwer Academic Publishers, Boston - Manufactured in The Netherlands A Version Space Approach to Learning Context-free Grammars KURT VANLEHN (VANLEHN@A.PSY.CMU.EDU)

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

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

Compositional Semantics

Compositional Semantics Compositional Semantics CMSC 723 / LING 723 / INST 725 MARINE CARPUAT marine@cs.umd.edu Words, bag of words Sequences Trees Meaning Representing Meaning An important goal of NLP/AI: convert natural language

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

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

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

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

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

Towards a MWE-driven A* parsing with LTAGs [WG2,WG3]

Towards a MWE-driven A* parsing with LTAGs [WG2,WG3] Towards a MWE-driven A* parsing with LTAGs [WG2,WG3] Jakub Waszczuk, Agata Savary To cite this version: Jakub Waszczuk, Agata Savary. Towards a MWE-driven A* parsing with LTAGs [WG2,WG3]. PARSEME 6th general

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

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

arxiv:cmp-lg/ v1 16 Aug 1996

arxiv:cmp-lg/ v1 16 Aug 1996 Punctuation in Quoted Speech arxiv:cmp-lg/9608011v1 16 Aug 1996 Christine Doran Department of Linguistics University of Pennsylvania Philadelphia, PA 19103 cdoran@linc.cis.upenn.edu Quoted speech is often

More information

The College Board Redesigned SAT Grade 12

The College Board Redesigned SAT Grade 12 A Correlation of, 2017 To the Redesigned SAT Introduction This document demonstrates how myperspectives English Language Arts meets the Reading, Writing and Language and Essay Domains of Redesigned SAT.

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

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

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

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

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

Welcome to the Purdue OWL. Where do I begin? General Strategies. Personalizing Proofreading

Welcome to the Purdue OWL. Where do I begin? General Strategies. Personalizing Proofreading Welcome to the Purdue OWL This page is brought to you by the OWL at Purdue (http://owl.english.purdue.edu/). When printing this page, you must include the entire legal notice at bottom. Where do I begin?

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

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

RANKING AND UNRANKING LEFT SZILARD LANGUAGES. Erkki Mäkinen DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A ER E P S I M S

RANKING AND UNRANKING LEFT SZILARD LANGUAGES. Erkki Mäkinen DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A ER E P S I M S N S ER E P S I M TA S UN A I S I T VER RANKING AND UNRANKING LEFT SZILARD LANGUAGES Erkki Mäkinen DEPARTMENT OF COMPUTER SCIENCE UNIVERSITY OF TAMPERE REPORT A-1997-2 UNIVERSITY OF TAMPERE DEPARTMENT OF

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

BANGLA TO ENGLISH TEXT CONVERSION USING OPENNLP TOOLS

BANGLA TO ENGLISH TEXT CONVERSION USING OPENNLP TOOLS Daffodil International University Institutional Repository DIU Journal of Science and Technology Volume 8, Issue 1, January 2013 2013-01 BANGLA TO ENGLISH TEXT CONVERSION USING OPENNLP TOOLS Uddin, Sk.

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

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

What Can Neural Networks Teach us about Language? Graham Neubig a2-dlearn 11/18/2017

What Can Neural Networks Teach us about Language? Graham Neubig a2-dlearn 11/18/2017 What Can Neural Networks Teach us about Language? Graham Neubig a2-dlearn 11/18/2017 Supervised Training of Neural Networks for Language Training Data Training Model this is an example the cat went to

More information

Semi-supervised methods of text processing, and an application to medical concept extraction. Yacine Jernite Text-as-Data series September 17.

Semi-supervised methods of text processing, and an application to medical concept extraction. Yacine Jernite Text-as-Data series September 17. Semi-supervised methods of text processing, and an application to medical concept extraction Yacine Jernite Text-as-Data series September 17. 2015 What do we want from text? 1. Extract information 2. Link

More information

Direct and Indirect Passives in East Asian. C.-T. James Huang Harvard University

Direct and Indirect Passives in East Asian. C.-T. James Huang Harvard University Direct and Indirect Passives in East Asian C.-T. James Huang Harvard University 8.20-22.2002 I. Direct and Indirect Passives (1) Direct (as in 2a) Passive Inclusive (as in 2b) Indirect Exclusive (Adversative,

More information

Using dialogue context to improve parsing performance in dialogue systems

Using dialogue context to improve parsing performance in dialogue systems Using dialogue context to improve parsing performance in dialogue systems Ivan Meza-Ruiz and Oliver Lemon School of Informatics, Edinburgh University 2 Buccleuch Place, Edinburgh I.V.Meza-Ruiz@sms.ed.ac.uk,

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

ACTIVITY: Comparing Combination Locks

ACTIVITY: Comparing Combination Locks 5.4 Compound Events outcomes of one or more events? ow can you find the number of possible ACIVIY: Comparing Combination Locks Work with a partner. You are buying a combination lock. You have three choices.

More information

Impact of Controlled Language on Translation Quality and Post-editing in a Statistical Machine Translation Environment

Impact of Controlled Language on Translation Quality and Post-editing in a Statistical Machine Translation Environment Impact of Controlled Language on Translation Quality and Post-editing in a Statistical Machine Translation Environment Takako Aikawa, Lee Schwartz, Ronit King Mo Corston-Oliver Carmen Lozano Microsoft

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

Using a Native Language Reference Grammar as a Language Learning Tool

Using a Native Language Reference Grammar as a Language Learning Tool Using a Native Language Reference Grammar as a Language Learning Tool Stacey I. Oberly University of Arizona & American Indian Language Development Institute Introduction This article is a case study in

More information

Writing a composition

Writing a composition A good composition has three elements: Writing a composition an introduction: A topic sentence which contains the main idea of the paragraph. a body : Supporting sentences that develop the main idea. a

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

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

Analysis of Probabilistic Parsing in NLP

Analysis of Probabilistic Parsing in NLP Analysis of Probabilistic Parsing in NLP Krishna Karoo, Dr.Girish Katkar Research Scholar, Department of Electronics & Computer Science, R.T.M. Nagpur University, Nagpur, India Head of Department, Department

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

SOME MINIMAL NOTES ON MINIMALISM *

SOME MINIMAL NOTES ON MINIMALISM * In Linguistic Society of Hong Kong Newsletter 36, 7-10. (2000) SOME MINIMAL NOTES ON MINIMALISM * Sze-Wing Tang The Hong Kong Polytechnic University 1 Introduction Based on the framework outlined in chapter

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

Chinese Language Parsing with Maximum-Entropy-Inspired Parser

Chinese Language Parsing with Maximum-Entropy-Inspired Parser Chinese Language Parsing with Maximum-Entropy-Inspired Parser Heng Lian Brown University Abstract The Chinese language has many special characteristics that make parsing difficult. The performance of state-of-the-art

More information

Advanced Grammar in Use

Advanced Grammar in Use Advanced Grammar in Use A self-study reference and practice book for advanced learners of English Third Edition with answers and CD-ROM cambridge university press cambridge, new york, melbourne, madrid,

More information

CAAP. Content Analysis Report. Sample College. Institution Code: 9011 Institution Type: 4-Year Subgroup: none Test Date: Spring 2011

CAAP. Content Analysis Report. Sample College. Institution Code: 9011 Institution Type: 4-Year Subgroup: none Test Date: Spring 2011 CAAP Content Analysis Report Institution Code: 911 Institution Type: 4-Year Normative Group: 4-year Colleges Introduction This report provides information intended to help postsecondary institutions better

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

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

Cross Language Information Retrieval

Cross Language Information Retrieval Cross Language Information Retrieval RAFFAELLA BERNARDI UNIVERSITÀ DEGLI STUDI DI TRENTO P.ZZA VENEZIA, ROOM: 2.05, E-MAIL: BERNARDI@DISI.UNITN.IT Contents 1 Acknowledgment.............................................

More information

Role of Pausing in Text-to-Speech Synthesis for Simultaneous Interpretation

Role of Pausing in Text-to-Speech Synthesis for Simultaneous Interpretation Role of Pausing in Text-to-Speech Synthesis for Simultaneous Interpretation Vivek Kumar Rangarajan Sridhar, John Chen, Srinivas Bangalore, Alistair Conkie AT&T abs - Research 180 Park Avenue, Florham Park,

More information

Pre-Processing MRSes

Pre-Processing MRSes Pre-Processing MRSes Tore Bruland Norwegian University of Science and Technology Department of Computer and Information Science torebrul@idi.ntnu.no Abstract We are in the process of creating a pipeline

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

Prediction of Maximal Projection for Semantic Role Labeling

Prediction of Maximal Projection for Semantic Role Labeling Prediction of Maximal Projection for Semantic Role Labeling Weiwei Sun, Zhifang Sui Institute of Computational Linguistics Peking University Beijing, 100871, China {ws, szf}@pku.edu.cn Haifeng Wang Toshiba

More information

Introduction to CRC Cards

Introduction to CRC Cards Softstar Research, Inc Methodologies and Practices White Paper Introduction to CRC Cards By David M Rubin Revision: January 1998 Table of Contents TABLE OF CONTENTS 2 INTRODUCTION3 CLASS4 RESPONSIBILITY

More information

SINGLE DOCUMENT AUTOMATIC TEXT SUMMARIZATION USING TERM FREQUENCY-INVERSE DOCUMENT FREQUENCY (TF-IDF)

SINGLE DOCUMENT AUTOMATIC TEXT SUMMARIZATION USING TERM FREQUENCY-INVERSE DOCUMENT FREQUENCY (TF-IDF) SINGLE DOCUMENT AUTOMATIC TEXT SUMMARIZATION USING TERM FREQUENCY-INVERSE DOCUMENT FREQUENCY (TF-IDF) Hans Christian 1 ; Mikhael Pramodana Agus 2 ; Derwin Suhartono 3 1,2,3 Computer Science Department,

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

Beyond the Pipeline: Discrete Optimization in NLP

Beyond the Pipeline: Discrete Optimization in NLP Beyond the Pipeline: Discrete Optimization in NLP Tomasz Marciniak and Michael Strube EML Research ggmbh Schloss-Wolfsbrunnenweg 33 69118 Heidelberg, Germany http://www.eml-research.de/nlp Abstract We

More information

- Period - Semicolon - Comma + FANBOYS - Question mark - Exclamation mark

- Period - Semicolon - Comma + FANBOYS - Question mark - Exclamation mark Punctuation 40 pts - Period - Semicolon - Comma + FANBOYS - Question mark - Exclamation mark For STOP punctuation, BOTH ideas have to be COMPLETE Vertical Line Test - Use when you see STOP punctuation

More information

Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank

Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank Parsing with Treebank Grammars: Empirical Bounds, Theoretical Models, and the Structure of the Penn Treebank Dan Klein and Christopher D. Manning Computer Science Department Stanford University Stanford,

More information

Informatics 2A: Language Complexity and the. Inf2A: Chomsky Hierarchy

Informatics 2A: Language Complexity and the. Inf2A: Chomsky Hierarchy Informatics 2A: Language Complexity and the Chomsky Hierarchy September 28, 2010 Starter 1 Is there a finite state machine that recognises all those strings s from the alphabet {a, b} where the difference

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

The Internet as a Normative Corpus: Grammar Checking with a Search Engine

The Internet as a Normative Corpus: Grammar Checking with a Search Engine The Internet as a Normative Corpus: Grammar Checking with a Search Engine Jonas Sjöbergh KTH Nada SE-100 44 Stockholm, Sweden jsh@nada.kth.se Abstract In this paper some methods using the Internet as a

More information

A Framework for Customizable Generation of Hypertext Presentations

A Framework for Customizable Generation of Hypertext Presentations A Framework for Customizable Generation of Hypertext Presentations Benoit Lavoie and Owen Rambow CoGenTex, Inc. 840 Hanshaw Road, Ithaca, NY 14850, USA benoit, owen~cogentex, com Abstract In this paper,

More information

Words come in categories

Words come in categories Nouns Words come in categories D: A grammatical category is a class of expressions which share a common set of grammatical properties (a.k.a. word class or part of speech). Words come in categories Open

More information

Linguistic Variation across Sports Category of Press Reportage from British Newspapers: a Diachronic Multidimensional Analysis

Linguistic Variation across Sports Category of Press Reportage from British Newspapers: a Diachronic Multidimensional Analysis International Journal of Arts Humanities and Social Sciences (IJAHSS) Volume 1 Issue 1 ǁ August 216. www.ijahss.com Linguistic Variation across Sports Category of Press Reportage from British Newspapers:

More information

Intension, Attitude, and Tense Annotation in a High-Fidelity Semantic Representation

Intension, Attitude, and Tense Annotation in a High-Fidelity Semantic Representation Intension, Attitude, and Tense Annotation in a High-Fidelity Semantic Representation Gene Kim and Lenhart Schubert Presented by: Gene Kim April 2017 Project Overview Project: Annotate a large, topically

More information

Windows 7 home premium free download 32 bit with key. The adverb always follows the verb. Need even more information..

Windows 7 home premium free download 32 bit with key. The adverb always follows the verb. Need even more information.. Windows 7 home premium free download 32 bit with key. The adverb always follows the verb. Need even more information.. Windows 7 home premium free download 32 bit with key >>>CLICK HERE

More information

TEAM NEWSLETTER. Welton Primar y School SENIOR LEADERSHIP TEAM. School Improvement

TEAM NEWSLETTER. Welton Primar y School SENIOR LEADERSHIP TEAM. School Improvement Welton Primar y School February 2016 SENIOR LEADERSHIP TEAM NEWSLETTER SENIOR LEADERSHIP TEAM Nikki Pidgeon Head Teacher Sarah Millar Lead for Behaviour, SEAL and PE Laura Leitch Specialist Leader in Education,

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

Campus Academic Resource Program An Object of a Preposition: A Prepositional Phrase: noun adjective

Campus Academic Resource Program  An Object of a Preposition: A Prepositional Phrase: noun adjective This handout will: Explain what prepositions are and how to use them List some of the most common prepositions Define important concepts related to prepositions with examples Clarify preposition rules

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

Adapting Stochastic Output for Rule-Based Semantics

Adapting Stochastic Output for Rule-Based Semantics Adapting Stochastic Output for Rule-Based Semantics Wissenschaftliche Arbeit zur Erlangung des Grades eines Diplom-Handelslehrers im Fachbereich Wirtschaftswissenschaften der Universität Konstanz Februar

More information

The Strong Minimalist Thesis and Bounded Optimality

The Strong Minimalist Thesis and Bounded Optimality The Strong Minimalist Thesis and Bounded Optimality DRAFT-IN-PROGRESS; SEND COMMENTS TO RICKL@UMICH.EDU Richard L. Lewis Department of Psychology University of Michigan 27 March 2010 1 Purpose of this

More information

Focusing bound pronouns

Focusing bound pronouns Natural Language Semantics manuscript No. (will be inserted by the editor) Focusing bound pronouns Clemens Mayr Received: date / Accepted: date Abstract The presence of contrastive focus on pronouns interpreted

More information

Visual CP Representation of Knowledge

Visual CP Representation of Knowledge Visual CP Representation of Knowledge Heather D. Pfeiffer and Roger T. Hartley Department of Computer Science New Mexico State University Las Cruces, NM 88003-8001, USA email: hdp@cs.nmsu.edu and rth@cs.nmsu.edu

More information

What the National Curriculum requires in reading at Y5 and Y6

What the National Curriculum requires in reading at Y5 and Y6 What the National Curriculum requires in reading at Y5 and Y6 Word reading apply their growing knowledge of root words, prefixes and suffixes (morphology and etymology), as listed in Appendix 1 of the

More information

Copyright 2002 by the McGraw-Hill Companies, Inc.

Copyright 2002 by the McGraw-Hill Companies, Inc. A group of words must pass three tests in order to be called a sentence: It must contain a subject, which tells you who or what the sentence is about Gabriella lives in Manhattan. It must contain a predicate,

More information

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission.

Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. Reconstruction and the Structure of VP: Some Theoretical Consequences Author(s): C.-T. James Huang Source: Linguistic Inquiry, Vol. 24, No. 1 (Winter, 1993), pp. 103-138 Published by: The MIT Press Stable

More information

Character Stream Parsing of Mixed-lingual Text

Character Stream Parsing of Mixed-lingual Text Character Stream Parsing of Mixed-lingual Text Harald Romsdorfer and Beat Pfister Speech Processing Group Computer Engineering and Networks Laboratory ETH Zurich {romsdorfer,pfister}@tik.ee.ethz.ch Abstract

More information

ELD CELDT 5 EDGE Level C Curriculum Guide LANGUAGE DEVELOPMENT VOCABULARY COMMON WRITING PROJECT. ToolKit

ELD CELDT 5 EDGE Level C Curriculum Guide LANGUAGE DEVELOPMENT VOCABULARY COMMON WRITING PROJECT. ToolKit Unit 1 Language Development Express Ideas and Opinions Ask for and Give Information Engage in Discussion ELD CELDT 5 EDGE Level C Curriculum Guide 20132014 Sentences Reflective Essay August 12 th September

More information

Korean ECM Constructions and Cyclic Linearization

Korean ECM Constructions and Cyclic Linearization Korean ECM Constructions and Cyclic Linearization DONGWOO PARK University of Maryland, College Park 1 Introduction One of the peculiar properties of the Korean Exceptional Case Marking (ECM) constructions

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

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

Achim Stein: Diachronic Corpora Aston Corpus Summer School 2011

Achim Stein: Diachronic Corpora Aston Corpus Summer School 2011 Achim Stein: Diachronic Corpora Aston Corpus Summer School 2011 Achim Stein achim.stein@ling.uni-stuttgart.de Institut für Linguistik/Romanistik Universität Stuttgart 2nd of August, 2011 1 Installation

More information