<?xml version="1.0" standalone="yes"?>
<Paper uid="C96-1074">
  <Title>Distributedness and Non-Linearity of LOLITA's Semantic Network</Title>
  <Section position="3" start_page="0" end_page="436" type="intro">
    <SectionTitle>
2 Distributedness and
</SectionTitle>
    <Paragraph position="0"/>
    <Section position="1" start_page="0" end_page="436" type="sub_section">
      <SectionTitle>
Non-Linearity
</SectionTitle>
      <Paragraph position="0"> A synta.ctic representation will have a semantic model. The degree to whieh such a representation  is (lis|;rilmLed depends on tim proportiotl o\[' so(:--I, ions of the+ r('l)rCSCnta.tion whioh aro t)ot;tt synta.ct, icMly lcg~d a,nd give itfformal~iou which is sotmd with resl)cCl, l,o l, ho moll0\]. A not, work is said to b0 non-lhl(,.ar if ro.ading froth any node and in m~y (litdegorion givos iuformation which is sound wiLh rospeo(, t;o I,h0 model.</Paragraph>
      <Paragraph position="1"> \]n a. la.rg0 kltowl0dgc \])asdeg, t, ho ~LluotlllL o\[' i td'ortrmt;ion t, ha.L must I)(`- accossod iu ordor Lo rotricvc a. \])a.rl;icula, r t'a.cL is (:riLi(:a.I. ht a. semantic tml, work inl'ornmt,ion is noL a.c(:('ss0d diro(:l;ly a;~ in a t;M)lo, I)ul, by tra,versing iLs arcs as a gr~q)h. I{01,ri0wd t;h0rc\[br(, (:orrcsponds 1,o soa.rching for ~ l)a.rLictF lar t,ype of informu, Lion from a. known rio(It in tho uct. I&amp;quot;or inst, mmc, if' l, ho l)roblem is Lo doLormin0 ,lohn's height, l;hc origiu-no(t(; whero t;he sca, t:oh :~L~u:t;s is &amp;quot;John&amp;quot;, and l,ho l,yl)o of infornuuLiot~ is &amp;quot;hoight&amp;quot;. In such :~ modol, tho &lt;`-fliciottcy of ro/,riewL\] is d0t;ermincd by: * l;opoh)gi('al dist;an(-e Sinco the graph is l;r~&gt; v('.t's(`-(l ;u:c by ~trc~ the numt)(~r ol' ~ur(;s Llu~L must, be tl'twerso, d t,o rea(:h the rel0va, nL pie(:deg of inl'orma.Lion de, l;crmines l;h0 olIici0noy of r0triowd. \[t is 1;heroforo ilnl)org;utl, Lo cnsuro r01cwmt, informal, ion is rol)rcsc~H,0(l loca.lly.</Paragraph>
      <Paragraph position="2"> * d(:|;(',rlninism of l;he s(,,ar&lt;'h A lt,hot@t infor:thai;ion \[tta,y only I)o a low arcs a.wa,y f!rom t, hc l;hing (loscribo(l, Lhcre ma.y 1oo trt~my imths ldeg~(li ng fcom th0 l, hing, am(t o\[' equal (listml(:C.</Paragraph>
      <Paragraph position="3"> Thus tho l)Ot;onLia, l search sp;zco, l;o I:)e exl)lorcd l)0fore finding the releva,\]tt informal;ion tm~y t)e (lttil, o large_ 'l'his cml be reducc(l by making l,h(; path to t;r;tverse uniquely recogn isablo.</Paragraph>
      <Paragraph position="4"> * non-linem'ity In order to onsur0 0\[licioncy, iL is importa, nl; l;haJ, tit(,, shorLest path l)OS sil)lc will bo that, tra,vors0d whcu so~u'ching for l;ho required inf&lt;::,rma.LiOlL This ca,nnot; be a,chie+ve(l if the semantic noLwork musL b0 1;(&amp;versed in any t)r('-estalolishod order, for a mea, ning l;o lm a ssign0+d 1;o it. 'l'his al)s&lt;m(:o of l)roscril)od or&lt;let (x)rrosl)ot~ds t,o 'non&gt; li nom'i Ly'.</Paragraph>
      <Paragraph position="5"> ,,, disl;ril:)ul;e+dness Inh):rmal, ion is oxpressed as a clusto.r of uodes aatd ;u:cs in l,hc s0+mlmLic net,. l:oi: rel, rieva,1, Lhe type of Lhe chisLer must I)o id0ntitiod. The olfioicncy ol + Lhis step dcl)onds how iiflbrma(,ion is ordore(1 within ca,oh (:h\]st,er. F,a+ch clusLor ntay oxpress a, SOl)araLo pioco, of infor~na,(,iotL Alt;0rnaA, iv(,ly Sel)~u'a,t,o l)io(:os o\[ inforttta, liion Ilcla, y I)e CXl)ress0,d as a, singlo ttloro cotn\[)lox (:lusl,or. lit Lhc \[irsl, caso, Lho clusi;0r will bc sumll mid oasily rocognisal)lo, whet:oa.s in l, he second degasdeg a lot, of c\[&amp;quot; f'orL will I)c required t,o rccogniso LIto la, rgcr chlstCl:. \]&amp;quot;lllr(,hOl;\[IR)r(?, oxt;racl,ing t, hc relevant. l)ieco of informa, t, iou \[Yore a COml)/OX clusl;or ro(luiros idetttit'ying and liltdegring out irrolo-wmL itffot:ma~tion. 'l'his sl;op is uol, nocessary for sitl~l)lc (:lust;ors whi(:h only OXl)rcss Lhc r&lt;'+l (:wmt, information. 't'hus smallor (:lusl,crs cx i~r('.ssing scpm:iuCo~ pieces of in\['orlm~Lioll eu sm'c moro oflioicnL l:eLricwd. This lca(ls I,o l,lm dcll niLion of (lisl~rilmt, o(hmss as th0 dog(co I;(+ which indol)cndotH, I)ioces or infortn~Lgion arc oxprcssod as indel)('nd('nl, clusLer.'+.</Paragraph>
      <Paragraph position="6"> Full dist;ribut, odnoss ('a,n obviously bo ol) I;aine(I I)y Cxl)rossing evory i)ieoe ot' in l~)rtna-.</Paragraph>
      <Paragraph position="7"> Lion l, hat, couhl possibly I)c concoJvo(l in(lo i)on(lenLly as a. s0.1)arag0 clust;cr, l low('v0r, as SOl)&amp;ra, l,o l)iecos o1&amp;quot; itlfOrl~la, t, iOll a, rc usually used in oonjun(:l, iotl, ii, \]na,y I)e a(lwml4tg0otJs I;O ll,q.C ()Ill`- 11101'(~ (:OHII)Icx (;ItlsLor r;Ll,\]l(;r t;h~Ltl many simple onos: t, his will t'(`-duco Lhc mnlv 1)0r of clusters /,o lind, ~md tho a, tt+lOllll|; of IlCt; t;o s0m'ch. A ,~dml)lo I)ut cfl'ocl;iw~ mot, ho(I of l)Cna, lising l;he COml)leL0 Ih~tt;oning ~q)l)roach is go (;onsidol: the ratio of (list, ribul,o(htcss tio mnnl)er o\[' nodes and arcs for sLal,etn(,nts (;xl)rCssod in Lhe trot..</Paragraph>
      <Paragraph position="8"> This discussion will E)cus more specifically on l, he last, t,wo (:riLeria. All, hough a, (ltmtit, itM, ivc mcastu:o of tim criteria is ava, ilal)lo, to sitHl&gt;li fy tho (lisoussion, only l;hcir (lua,litativc do\[iuiLions will I)e used.</Paragraph>
    </Section>
  </Section>
class="xml-element"></Paper>