File Information
File: 05-lr/acl_arc_1_sum/cleansed_text/xml_by_section/metho/86/c86-1120_metho.xml
Size: 2,500 bytes
Last Modified: 2025-10-06 14:11:57
<?xml version="1.0" standalone="yes"?> <Paper uid="C86-1120"> <Title>Japanese Honorifics and Situation Semantics</Title> <Section position="4" start_page="509" end_page="509" type="metho"> <SectionTitle> 4. System Configuration </SectionTitle> <Paragraph position="0"> Our experimental system written in C1L runs on the DEC 2060 and utilizes Prolog as the basic programming environment, which enables us to use CIL. C1L is now compiled and runs very fast on DEC 2060. Next, we want to run this I)CG parser on the Bottom Up Parser \[Matsumoto 1983\], \[Matsumoto,Kiyono,1984\].</Paragraph> </Section> <Section position="5" start_page="509" end_page="509" type="metho"> <SectionTitle> 5. Some Other Examples </SectionTitle> <Paragraph position="0"> \[n tiffs section, we give some examples which have no relation to context switching.</Paragraph> <Paragraph position="1"> 1) Sentence without honorific expression.</Paragraph> <Paragraph position="2"> A sentence without honorifics is parsed. Those are resource situations fro&quot; this type of sentence.</Paragraph> <Paragraph position="4"> has:=\[ 1626, 34221 3885\] \[__1624= anchor: = 1626, relation: -- honor, spec: = equi agentl: = s, agent2: = taro 3420:: anchor: = 3422, relation: = bonor,spec: = equi agentl: = s,agent2: = hanako \] l 2) Sentence with illegal honorific expression The following is an sentence with conflict between honorific word expressions. |taro\] is a word witbour honorifics but \[o,ai,nasat\] are words with honorifics fi'om the speaker to Taro. In a simple sentence, there should not he conflict between honorific relations. If there is, then the hearer R gets information that the speaker S has some trouble with honorific word expression.</Paragraph> <Paragraph position="5"> \[?- parse(l)S,RS,CS,\[taro,ga,hanako,ni,o,ai,nasat,ta\],\[\]).</Paragraph> <Paragraph position="7"> 5688:: anchor: = 5690,relation: = rs,agent: =r, has:=\[ 5812\[ 5620\] \[ 5810::anchor: = 5812,relation: = illegal,argl: = bonor,arg2: = s\]</Paragraph> </Section> <Section position="6" start_page="509" end_page="509" type="metho"> <SectionTitle> 3) Complex case </SectionTitle> <Paragraph position="0"> This example sentence contains ninny honorific expressions. Tim system analyzes these expressions to find some honorific event type in the speaker's mind.</Paragraph> <Paragraph position="1"> I?-parse(DS,RS,CS,\[taro,sama,ga,hana ~o,ni,o,ai,nasai,masita\],\[I).</Paragraph> <Paragraph position="3"/> </Section> class="xml-element"></Paper>