<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-2140">
  <Title>Free-ordered CUG on ChemicM Abstract; Mzmhine</Title>
  <Section position="3" start_page="0" end_page="870" type="metho">
    <SectionTitle>
2 Extended typed A-calculus
CU(\] (Categorial U,,ificAtion (l:ra,nma,r) \[8\] is a,d-
</SectionTitle>
    <Paragraph position="0"> vantageous, compared to other phrase structure gl:Amlrt~rs, tot pArMlel a:rchitex:~ure, because we can regard categories as htnctional types and we c~m represent grAinlnax rules loca.lly. This means that we do not need externAlly-given grAmmAr rules but those rules reside within each word or each. phrase. In this section, we regard categories a.s polymorphic types And consider the type cAlculus. In later sections we denote categories by I) AG (di retted acyclie grAp h) o { PA'I'R grnln m Ar \[5\].</Paragraph>
    <Section position="1" start_page="0" end_page="0" type="sub_section">
      <SectionTitle>
2.1 A-calcnlus of polylnorphic type
</SectionTitle>
      <Paragraph position="0"> We use greek \]etters, for type sehelnAS. \]!'or tyl)e constants we use or,%.., while for type vAriAbles we use (-hfl,'''- a : n' represents thAI; the object a is of type ~t. If~v AIM fl Are 1;ypes, I, hen e~-~ fl ix a type.</Paragraph>
      <Paragraph position="1"> The purpose of' type ilfference is to infer I;he type of Art object fl:om A set of objects whose types are known. We presuppose, tha.t two type w~.rial)les c~ And fl Are unified wit\[, a. ltttifier O. ~/e Ilse \[' \[el/ this set of type-known objects. The most impel (:Ant two rules Are As follows: t 1'0~ u {:c : o~01} F t : fl</Paragraph>
      <Paragraph position="3"> The rule (2) corresponds to /Lconversion of the or&lt;l in a.ry A-ca.I c ul ii S \[d 1.</Paragraph>
    </Section>
    <Section position="2" start_page="0" end_page="870" type="sub_section">
      <SectionTitle>
2.2 Extended combinators
</SectionTitle>
      <Paragraph position="0"> In this su\])section~ we. introduce two com\])inators theft enable us to change the order of ,\co nversio:u, proposed by Stee(hnan \[6\], as a kind of type chAuge \[3\]. The ordinary A-cMculus requires ~02,0~ are for 1'02 k t : cv ~ fi a, nd for \]'0:~ F s : a', rcslmctively. 0~ unifies ~ which ~tppears iu both type decla.r~tions,  a, st, ri('l, order or (:OllV(;rsioii. ilowever~ ill a. (:().(:. r ,'eni, model&gt; this kin(l ol'stri(:t ()r(ler i~; a. hi,l(Irat,(:(' a,ii (I COli i~i li~(~,iti; ('oil version s il,l'(! I'(!q u ire(I.  (}-.('(mil)hlaJ.or (;ha.nges I.he or(ler &lt;~\[ .,\ vaJ'iat)le~ .a,s I'ol lows: C(Ax;q.f(.~:, y)) :~ Ayx.f(:,:, ;q).</Paragraph>
      <Paragraph position="1"> Anol;her re(lui relnenl, for ex&lt;tiia.n&lt;~es ol' I.I\](~ or(ler o\[' ~-(;OliVersiou is 1,he \[bllowing case. ~uj)t)ose 1;haJ. wc, a.l'e re&lt; I u ire(l 1,o COlli \[)ose a.II lille Ibl lowilig ty i&gt;ed f :t7 &gt; 7 ,q : +t , ,/g H, ~ (~ \]II SI.IC\]I ~1, C,{/H('J~ W(~ IIC,(!(\[ LO (to/IC,3,L(!ll;I,((\] ,(\] ~PS11(\[ U, firM;, a, lid IAiell :\](a,) 1)ecoillOS a,l)l)li(:a,l)l(~ to .1'. Ih)wever, wil;h I;he hel I) (;\[' l, he Pollmviiig lJ (;oull)ina.1;or: :~J (A:&lt;/(~))(,\:q.:\](:,~))A;,,.f(q(~:+,)).</Paragraph>
      <Paragraph position="2"> 'l?he A-va.ria.I)le in .(,I c;i.il l)e shif'l;(~(l bey+m(I i,h(! sc.ol)e of f so thai; we t:a.il (;Oll(;a.l,(~tlal,(} f a.il(I \[\] first, a.n(I, trill,% Iia.ve a l)t!('(ml(.? alll&gt;li(:a.I)l(' :is iu Fig. I.</Paragraph>
    </Section>
    <Section position="3" start_page="870" end_page="870" type="sub_section">
      <SectionTitle>
2.3 Cost of unifi(:atioi!
</SectionTitle>
      <Paragraph position="0"> The repeal, e(I cise of C- a.nd B (:()Jliliiiia.l;(Jt',&lt;i is still l)rol)lenia.(.i(: if we consider inll)lettteulin&lt;v , it :-'&lt;s a.Ii a.cl;tla.\] s.ysl, c\[ll l)e(;a, usc: t;lie t, erlllinaLioJt o\[' I)i'(;,(;(.~ss ilig is iiol; gua.ra.ntee(l. \;Ve have uio(leJe(I t.lie i)r() (;ess of a. i)a.rl;ia.I (lecoml)osit, iou a.s ~LI\[ a.I)sl, ra.cl, ioll of a.n a.l'&lt;~llliietil; of the |ir,% or(ler l, erili. 11' this M)-M, ra.(;{iOli o(:ciir.4 ra.li(IOllily~ the \[)l'()(t(;~B ea.sily f'a.lls hil;o a, lool). In oi:(ler |,o a.vohl I, his, we a.B~ltlll(; ttie unilica.l, lon (:oM,. If a, ('otnt)cmnd l.erlii (a stll:,l;r(~(!) wer() to I)e ,:le(:onil)OSe(l Oil(re+ 1;he elenl(ml; wil.h Lhe longer (li,%a.liCe sh(lul(l I)e a.b&lt;,i4::+lx:Led fi rM,. \,Ve Ca, II roga, i'(I l, lie whole Boni,,.~llC(! Bgru(;(,tire a,b itlOrO ~fa.iil ul~.cl,\]ca,\[ i f i, he BI\[lil i)\[' 1, liese Ii ni \[ica.tJou (:ost;s is m:na, ller. We \]ntro(lu(:e I, he heuristi(: (:&lt;)st,~ \[7\], (:Ollsi(lering l, he l)a, ra.lleltsiu I)e{,ween ~ynl;a('.l, tc (:a.ses a, li&lt;l Sellia, iil,l(: rul(~s, a,,~ I'ollow~:</Paragraph>
      <Paragraph position="2"> role is y. X; i~ XOlite (;()liBta..lll, la.rger l;ha.n I (t,: &gt; I).</Paragraph>
    </Section>
  </Section>
  <Section position="4" start_page="870" end_page="871" type="metho">
    <SectionTitle>
3 Chemical Absl;ract Ma(:hin(.,
</SectionTitle>
    <Paragraph position="0"> (;l~, m, ic.I A t,,~.~racZ M.ch, inc (Ch A-\\]l, for sh(,rt) Ill\] \[.~ a, pa,ra,(I igt. ol + (:(.,n(:u rre. L ..\&lt;a,h:ttl m+. In this l)a: per, we \vi II tneti t, ion ou r I ) ri tic\] pies on it a,t;tl r:-+l la,.</Paragraph>
    <Paragraph position="1"> g.a,ge l)r~.:&lt;+ssi .(+~ wi lh r(+g+u.(n t,(+ tlm ( ',h A M .lodel.</Paragraph>
    <Paragraph position="2">  ing molecule (t;tlat which is Not yet (:onca, I;,.,na,t(,d with c,l:h+,r m(~le('ule.,&lt;+) +&gt;u otl,:' ,si(I,a+ it, (~,a,. m,.,ve i, hr,:)ugh the porou,s nlenil)ra, r\]es. Va, leuce,s for (:un-C;'Lt,(uI;-/tiOII of (;a, ch tlloleCtll(? i-tr(,, +:(+l)re,s(Hl{,(;(I I)y typ(+(I hz'n+bd, a va,ria.,bles. IJ (.le rnettil)ra.(&gt; c(m I,a, ins only one (:omp()sit;e .stru(:Lure, a,n(I il; ,,-;t;ill ha,s ,~u rpl u,(+; va,l(m(;es, we (:a,t:t rega, r(l that, whole t he m&lt;'till)ra,n(~ ha.4 t, ho,&lt;+e surplus va, l(m(;os as f,: .l l (, ,.v s .</Paragraph>
    <Paragraph position="4"> &gt;, z ?s .&lt; .,+ + I: ~ +,,.,'/.t,:.,+(:,:, .V, z) Now, w(+ wilt at)ply our .oti(:&gt;lt,4 a,h.ov,.', to t, he a,ct, u a l \[)rol)l(,lU o\[ ,4e n Ix'n (',(, &lt;t'~(+ll(',l;a,i;ioII.</Paragraph>
  </Section>
  <Section position="5" start_page="871" end_page="872" type="metho">
    <SectionTitle>
4 Example: Japanese causative
</SectionTitle>
    <Paragraph position="0"> sentence In th.e Japanese language, the causative ~nd the change of voice a.re realized by agglutinations of those auxiliary verbs at the tail of current verbs. These auxiliary verbs as well a.s ordinary verbs can dominate some cases so that these agglutinations may change the whole syntax \[9\]. Namely the scope of the operation of these auxiliary verbs is not the operated verb but the whole sentence.</Paragraph>
    <Paragraph position="1"> In order to illustrate these role changes, we show the ~dteruation of the agent of tlhe main verb in Table l with a short tip to Japanese lexicon.</Paragraph>
    <Paragraph position="2"> As an example, we will take the sentence: Kcn-wa Naomi-hi h.on-wo yom-ascru.</Paragraph>
    <Paragraph position="3"> (Ken makes Naomi read the book.) First, we give I)AG's for each lexical items in l)'ig 2. The last DAG in Fig. 2 represents that the verb 'yomu (rex(l)' requires two roles 'the re~der' and 'the object to be rend', and one optional ro\]e %he counter-agent' who hears what the reader reads. In that tigure, 'W I =' means that each word is recognized in the general world however a verb 'yomu' in trod uced a special membrane sl as a subworld of W. Each DAG means a polymorphic type of the lexical item.</Paragraph>
    <Paragraph position="4"> Assume that there is a. parser that constructs partial tree. st:ructures, as recognizing each word from the head sequentially. Then, when the first :fbur words are recognized, they can form a con&gt; plete sentence of (3).</Paragraph>
    <Paragraph position="5"> I= {read(lClo~,NIo,2,Vlo~): \[ cat 6' \]} 81 (3) Because all th.e three nouns are adequately coneateuated by 'read.', a sentential representatio:n is m.ade in the subworld of .st. in (3), Oi's a.re the records of unification, thaJ; contain the costs and the original types; they becom.e necessary when they are backtracked, and in that meaning, those bindings are transitive.</Paragraph>
    <Paragraph position="6"> Now, let us recapitulate what ihas occurred in the membrane, sl. &amp;quot;\['here were four lexical items in the set, a:nd they are duly organized to a sentence and sl becomes a singM;on.</Paragraph>
    <Paragraph position="8"> Then, the problematic final word '-aseru (causative)' arrives; its \])AG representation is as in Fig. 3. The DAG in Pig. 3 requires a sententiaJ lbrm (category ,S') as an argulnent;, and in addition, it subcategorizes an item of category N as an agent of l;he su bsentence.</Paragraph>
    <Paragraph position="9"> Now, the process becomes ~s in Pig. d. All through the process in Pig. 4, C- and Bcombinators are used repeatedly as well as ordinary type inference (l) and (2). The second men:,brane s2 requires an agent role (the variable x' of 'make). There is a record in 0t that it bit agent, so that the comparison should be marie between 01 and 04(= O(~r,j)). llowever, because both of 0t and 04 unifies nominative case and agent role, the costs are. equivalent. In such a. case, linguistic heuristics will solve the problenl. In this cas G the agent of make shouJd be the nominative of the whole sentence, and the co-agent o\[' make is (;he datiw~ of tlhe whole sentence, so that K and N are bit by newly a.):rive(I utake, t1 remains bound to rcad, because there is no A-variable of that type iu ?)ta,~e. The process is depicte.d in fig. 5.</Paragraph>
  </Section>
class="xml-element"></Paper>