| { |
| "paper_id": "C80-1013", |
| "header": { |
| "generated_with": "S2ORC 1.0.0", |
| "date_generated": "2023-01-19T13:05:29.527155Z" |
| }, |
| "title": "HIERARCHICAL MEANING REPRESENTATION AND ANALYSIS OF NATURAL LANGUAGE DOCUMENTS", |
| "authors": [ |
| { |
| "first": "Toyo-Aki", |
| "middle": [], |
| "last": "Nishida", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Kyoto University Yoshida-honmachi", |
| "location": { |
| "addrLine": "Sakyo-ku", |
| "postCode": "606", |
| "settlement": "Kyoto", |
| "country": "Japan" |
| } |
| }, |
| "email": "" |
| }, |
| { |
| "first": "Shuji", |
| "middle": [], |
| "last": "Doshita", |
| "suffix": "", |
| "affiliation": { |
| "laboratory": "", |
| "institution": "Kyoto University Yoshida-honmachi", |
| "location": { |
| "addrLine": "Sakyo-ku", |
| "postCode": "606", |
| "settlement": "Kyoto", |
| "country": "Japan" |
| } |
| }, |
| "email": "" |
| } |
| ], |
| "year": "", |
| "venue": null, |
| "identifiers": {}, |
| "abstract": "This paper attempts to systematize natural language analysis process by (I) use of a partitioned semantic network formalism as the meaning representation and (2) stepwise translation based on Montague Grammar. The meaning representation is obtained in two steps. The first step translates natural language into logical expression. The second step interprets logical expression to generate network structure. We have implemented set of programs which performs the stepwise translation. Experiments are in progress for machine translation and question answering.", |
| "pdf_parse": { |
| "paper_id": "C80-1013", |
| "_pdf_hash": "", |
| "abstract": [ |
| { |
| "text": "This paper attempts to systematize natural language analysis process by (I) use of a partitioned semantic network formalism as the meaning representation and (2) stepwise translation based on Montague Grammar. The meaning representation is obtained in two steps. The first step translates natural language into logical expression. The second step interprets logical expression to generate network structure. We have implemented set of programs which performs the stepwise translation. Experiments are in progress for machine translation and question answering.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Abstract", |
| "sec_num": null |
| } |
| ], |
| "body_text": [ |
| { |
| "text": "Conventional AI systems dealing with natural languages paid much efforts on the problem, how to translate natural language input into the internal knowledge structure such as micro PLANNER statements [14] , semantic networks [6] , frames [l] , etc. Most of these systems directly translate input sentences into task oriented internal structure.", |
| "cite_spans": [ |
| { |
| "start": 200, |
| "end": 204, |
| "text": "[14]", |
| "ref_id": "BIBREF13" |
| }, |
| { |
| "start": 225, |
| "end": 228, |
| "text": "[6]", |
| "ref_id": "BIBREF5" |
| }, |
| { |
| "start": 238, |
| "end": 241, |
| "text": "[l]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "i. Introduction", |
| "sec_num": null |
| }, |
| { |
| "text": "The architecture of these systems will be much simplified if systematic meaning representation and analysis method based on a formal theory is incorpolated.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "i. Introduction", |
| "sec_num": null |
| }, |
| { |
| "text": "This paper proposes a stepwise translation system based on Montague Grammar (MG for short) [3] . Partitioned semantic network [6] is employed as a meaning representatin. Input sentence is firstly translated into logical expression and then semantic network is generated by interpreting it. Semantic network is the output of the natural language analyzer. This will be further compiled into task oriented representations to be used by a task oriented problem solver. This paper concentrates on the natural language analyzer. The following is a summary of our approach: We have developed natural language analyzers for English and Japanese respectively. This paper describes the one for English. The experiments are in progress with these systems. The applicability of the proposed approach is discussed briefly.", |
| "cite_spans": [ |
| { |
| "start": 91, |
| "end": 94, |
| "text": "[3]", |
| "ref_id": "BIBREF2" |
| }, |
| { |
| "start": 126, |
| "end": 129, |
| "text": "[6]", |
| "ref_id": "BIBREF5" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "i. Introduction", |
| "sec_num": null |
| }, |
| { |
| "text": "NATURAL", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "i. Introduction", |
| "sec_num": null |
| }, |
| { |
| "text": "This section gives the readers an overview of the system by illustrating an example. Before illustration we shall present the formalisms of LE and PSN.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Overview of the approach", |
| "sec_num": "2." |
| }, |
| { |
| "text": "The notion of LE is based on Cresswell's %-categorial language [2] . The following is the syntax of LE:", |
| "cite_spans": [ |
| { |
| "start": 63, |
| "end": 66, |
| "text": "[2]", |
| "ref_id": "BIBREF1" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LE --lo$ical expression", |
| "sec_num": null |
| }, |
| { |
| "text": "the set of syntactic categories (Syn): two basic categories are used, i.e., 0 of sentence and 1 of name.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LE --lo$ical expression", |
| "sec_num": null |
| }, |
| { |
| "text": "Given categories T,O~, ... ,O,, then <T,Ol, ... ,On> is the category of a mapping that makes an expression of category T out of expressions of category ol, ... ,~, respectively. -the set of symbols (F): F = #~y~FO, where Fo is a finite set of symbols, and if Ol#o 2 then FO,~F~=~.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LE --lo$ical expression", |
| "sec_num": null |
| }, |
| { |
| "text": "the set of variables (X): X= ~5~Xo, where Xo is a set of variables such that if ~i#o~ then X~znXa~=~ , and that intersection of F and X is empty.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LE --lo$ical expression", |
| "sec_num": null |
| }, |
| { |
| "text": "the set of expressions (E): E = ~ ~E~, where E~ fills the following properties: The linear notation can be further interpreted by meta language [8] , however this is beyond the scope of this paper. Fig. 1 illustrates PSN structures together with linear notations.", |
| "cite_spans": [ |
| { |
| "start": 144, |
| "end": 147, |
| "text": "[8]", |
| "ref_id": "BIBREF7" |
| } |
| ], |
| "ref_spans": [ |
| { |
| "start": 198, |
| "end": 204, |
| "text": "Fig. 1", |
| "ref_id": null |
| } |
| ], |
| "eq_spans": [], |
| "section": "LE --lo$ical expression", |
| "sec_num": null |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "(i) Xo GEo,", |
| "eq_num": "(ii)" |
| } |
| ], |
| "section": "LE --lo$ical expression", |
| "sec_num": null |
| }, |
| { |
| "text": "OR(P,Q) The syntax analysis and semantic composition are done in parallel. If one of them detects anomaly, the application of the rule is aborted. Fig. 3 illustrates the result of the syntax analysis and semantic composition for our example.", |
| "cite_spans": [], |
| "ref_spans": [ |
| { |
| "start": 147, |
| "end": 153, |
| "text": "Fig. 3", |
| "ref_id": "FIGREF1" |
| } |
| ], |
| "eq_spans": [], |
| "section": "AND(P,Q)", |
| "sec_num": null |
| }, |
| { |
| "text": "NOT(P) V?X.P(?X) (a) (b) (c) (d) ANY j I 3?X.P(?X) V", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "AND(P,Q)", |
| "sec_num": null |
| }, |
| { |
| "text": "The syntax tree shows the phrase structure of the sentence.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "AND(P,Q)", |
| "sec_num": null |
| }, |
| { |
| "text": "The semantic tree shows the history of semantic composition. The root node of the semantic tree is the LE (in LISP notation) obtained from the sentence.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "AND(P,Q)", |
| "sec_num": null |
| }, |
| { |
| "text": "Extracted LE is evaluated generation procedure as follows: by a network (i) ", |
| "cite_spans": [ |
| { |
| "start": 72, |
| "end": 75, |
| "text": "(i)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(STEP 3) Interpretatign of LE", |
| "sec_num": null |
| }, |
| { |
| "text": "A fragment of a universal quantification is generated.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "interpretin$ (EVERY MAN)", |
| "sec_num": null |
| }, |
| { |
| "text": "An intensional node is generated.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(2) intepretin$ (A WOMAN)", |
| "sec_num": null |
| }, |
| { |
| "text": "Jante~c\u00b0n~se~INDEFA WOMA \" ~' -N", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "MA,", |
| "sec_num": null |
| }, |
| { |
| "text": "(3) interpretatin$ LOVE A relational node for the two place predicate LOVE is generated.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "MA,", |
| "sec_num": null |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "I \"7-\u00e3 / \\.o .[ WOMAN]I NDEF~,-?Y~' , :!]", |
| "eq_num": "(4)" |
| } |
| ], |
| "section": "MA,", |
| "sec_num": null |
| }, |
| { |
| "text": "to replace the OBJECT slot of LOVE by its extensi0n Since the verb \"love\" is an extensional verb, the OBJECT slot is extensioned, i.e., is replaced by an existentially quantified variable.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "MA,", |
| "sec_num": null |
| }, |
| { |
| "text": "In our system new individual node is generated in the sense of Skolem constant. We treat scope ambiguity at this time; if this Skolemization is to be done in a local world, scope ambiguity is announced.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "MA,", |
| "sec_num": null |
| }, |
| { |
| "text": "In this case three ambiguities are detected as for where the Skolemized node is placed, i.e., (i) ", |
| "cite_spans": [ |
| { |
| "start": 94, |
| "end": 97, |
| "text": "(i)", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "MA,", |
| "sec_num": null |
| }, |
| { |
| "text": "H?Y.V?X[MAN(?X) --~ LOVE(?X,?Y)].", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "MA,", |
| "sec_num": null |
| }, |
| { |
| "text": "Since the reading (i) and (ii) are logically equivalent, there are essentially two ambiguities. If the reading (i) is selected, the final network structure is:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "MA,", |
| "sec_num": null |
| }, |
| { |
| "text": "' IMP IES ANY ~ m~-k_~.~.~.~J LOVE WOMAN [-\"-i,?X ,, -------- '", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "MA,", |
| "sec_num": null |
| }, |
| { |
| "text": "Comments on scope ambiguity One of the interesting feature of MG is the treatment of scope ambiguity of quantification. In MG, scope ambiguities are captured as ambiguities of semantic composition. However, considering the following two points:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "MA,", |
| "sec_num": null |
| }, |
| { |
| "text": "-how to filter out redundancies; sometimes this redundancy is reduced in the interpretation process, -the resulting parsing inaccurate readings, sometimes involves it is plausible to treat scope ambiguities in the interpretation process as shown in the above example.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "MA,", |
| "sec_num": null |
| }, |
| { |
| "text": "This section treats the translation mapping T. Firstly, we show how we associate LE with each phrase of English.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of translation mapping (T)", |
| "sec_num": "3." |
| }, |
| { |
| "text": "Then we describe the rule based parser. (3) Noun phrase A noun phrase maps a one-place predicate into a sentence, that is, in category <0,<0,i>>. The constituents of a noun phrase are: The LE for a preposition is in category <<0,0>,i>, that is, makes an adverb out of a name. The LE for an adjective prepositional phrase is constructed using a special symbol *ape E<<<<0,1>,<O,i>>,i>,<<0,0>,i>>.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of translation mapping (T)", |
| "sec_num": "3." |
| }, |
| { |
| "text": "-determiner (DET) in E<<O,<0,1>>,<0,1>> - number (NBR) in E<<0,1>,<0,1>> -adjective (ADJ) in E<<0,i>,<O,i>> - head noun (NOUN) in E<0,1> - plural morpheme (+S) in E<<0,1>,<O,I>> -post modifier (Q) in E<<0,1>,<0,1>>", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of translation mapping (T)", |
| "sec_num": "3." |
| }, |
| { |
| "text": "Roughly speaking *ap converts an preposition into \"an adjective preposition\" which makes an adjective phrase out of a name. See the following example:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of translation mapping (T)", |
| "sec_num": "3." |
| }, |
| { |
| "text": "..... \u00a3 E<<0, i>, <0,i>> Ip< n 1~[~yl[(theisystem)) ~'~- ~ (tx, [ ((*ap (of)) (x)) (p (y)) ]) ] ]", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of translation mapping (T)", |
| "sec_num": "3." |
| }, |
| { |
| "text": "*ap (of) the (system) of the system (5) Noun clause A noun clause is constructed from a key word (e.g., \"that\", \"whether\", etc) and a complement sentence.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of translation mapping (T)", |
| "sec_num": "3." |
| }, |
| { |
| "text": "The LE for the keyword maps a sentence into a noun phrase, that is, in category <<0,<0,1>>,0>. See the following example:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of translation mapping (T)", |
| "sec_num": "3." |
| }, |
| { |
| "text": "whether(it(Ix_[(the(input)) _<^ <^ _>> x,y)])])) e~ U, U,l / t(XXl[(the(Inp~[accept(x,Y)])])", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of translation mapping (T)", |
| "sec_num": "3." |
| }, |
| { |
| "text": "whether it accept the input (WHETHER) (SENTENCE) The <sem> section is a semantic composition program which will construct LE for the node from decendant nodes. In implementing programs, the use of semantic markers is effective. A semantic marker conveys some auxiliary information approximately describing semantic constraints. The LE and semantic markers for a node are packed into a data structure, called a word frame D and manipulated by <sem> section programs.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of translation mapping (T)", |
| "sec_num": "3." |
| }, |
| { |
| "text": "The <score> section determines the priority of the rule.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of translation mapping (T)", |
| "sec_num": "3." |
| }, |
| { |
| "text": "A rule with the highest priority will be tried first.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of translation mapping (T)", |
| "sec_num": "3." |
| }, |
| { |
| "text": "The grammar system has a feature that allows a user to write elimination rules directly. For example, the following is a rule for a relative clause:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of translation mapping (T)", |
| "sec_num": "3." |
| }, |
| { |
| "text": "This means that a relative clause is a clause wlth Just one NP eliminated.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "NP -~NP+(CLAUSE-NP)", |
| "sec_num": null |
| }, |
| { |
| "text": "The semantic coupling of the antecedent and the eliminated noun phrase is described in the <sem> section of the rule. Now we shall go into the detail of the parser, called EASY (for the English Analysis SYstem). For example, if we compile the example grammar given in section 2, the following structure (called an expectation path) is generated for the nonterminal DET:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "NP -~NP+(CLAUSE-NP)", |
| "sec_num": null |
| }, |
| { |
| "text": "EQUATION", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [ |
| { |
| "start": 0, |
| "end": 8, |
| "text": "EQUATION", |
| "ref_id": "EQREF", |
| "raw_str": "DET ~ NG ~ SENTENCE (NOUN)", |
| "eq_num": "(VP)" |
| } |
| ], |
| "section": "NP -~NP+(CLAUSE-NP)", |
| "sec_num": null |
| }, |
| { |
| "text": "This reads that a DET will grow up to be an NG if a NOUN follows it, and the NG will, in turn, grow up to be a SENTENCE if a VP follows it. The rule interpreter analyzes input sentence with this compiled rules and a dictionary. EASY is a top-down parser and reads input sentences from the left to the right. EASY starts parsing by expecting the node SENTENCE.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "NP -~NP+(CLAUSE-NP)", |
| "sec_num": null |
| }, |
| { |
| "text": "The main loop of the rule interpreter is:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "NP -~NP+(CLAUSE-NP)", |
| "sec_num": null |
| }, |
| { |
| "text": "test if the current word has an expectation path to the expected node, -if the path is found, select the path with the highest priority and save other paths, -if no path is found, try the following two rules: (i) try a left recursive rule since this type of rule is not compiled in the pre-compile phase, and (~) test if the expected node is eliminated via antecedent elimination rule, -if both of them fail, memorize the failure and backtrack.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "NP -~NP+(CLAUSE-NP)", |
| "sec_num": null |
| }, |
| { |
| "text": "The interpretation mapping I generates a partitioned network structure as a denotation of the meaning of a sentence. We don't use the truth-conditional formalism.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of interpretation mapping ~I)", |
| "sec_num": "4." |
| }, |
| { |
| "text": "If complete knowledge about the world is givens a computer program can simulate the model to compute the truth value as in [4] or [7] . However in the actual situation of natural language understanding process, complete knowlegde cannot be given, but only partial knowledge is available.", |
| "cite_spans": [ |
| { |
| "start": 123, |
| "end": 126, |
| "text": "[4]", |
| "ref_id": "BIBREF3" |
| }, |
| { |
| "start": 130, |
| "end": 133, |
| "text": "[7]", |
| "ref_id": "BIBREF6" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of interpretation mapping ~I)", |
| "sec_num": "4." |
| }, |
| { |
| "text": "Accordingly, it is plausible that new knowledge is acquired from a given sentence in the context of old knowledge structure. For this purpose, Montague's truth conditional approach is indirect and more direct a programming language.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of interpretation mapping ~I)", |
| "sec_num": "4." |
| }, |
| { |
| "text": "In what follows we try a direct approach. The style of generating networks resembles Scott-Strachey's semantic function [13] which generates a denotation from a statement of programming language.", |
| "cite_spans": [ |
| { |
| "start": 120, |
| "end": 124, |
| "text": "[13]", |
| "ref_id": "BIBREF12" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of interpretation mapping ~I)", |
| "sec_num": "4." |
| }, |
| { |
| "text": "In order to generate network structure, we use a system which consists of a supervisor function GEN plus dictionary, The arguments of the supervisor are:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of interpretation mapping ~I)", |
| "sec_num": "4." |
| }, |
| { |
| "text": "(LE, space#, environment, message).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Implementation of interpretation mapping ~I)", |
| "sec_num": "4." |
| }, |
| { |
| "text": "The space# specifies the space in which LE is interpreted. The environment specifies the denotation of each variable by a llst of variable-denotation pairs. The message is used for communication between network generating word specialists.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LE is a logical expression.", |
| "sec_num": null |
| }, |
| { |
| "text": "A dictionary entity for each lexicon of LE contains a case pattern or an embedded word specialist program.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "LE is a logical expression.", |
| "sec_num": null |
| }, |
| { |
| "text": "In what follows we use linear notation of PSN beacuse of the space limitation, and we refer to the LE for each category simply by the category name.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Interpretation of the LE for each category", |
| "sec_num": null |
| }, |
| { |
| "text": "The meaning of a simpie sentence is governed by the meaning of the verb. A dictionary entity for a verb includes a case pattern for the verb. According to the verb type, the case pattern looks like: where, the first element of a case slot is a case label which is used only for distinguishing the slot, and the second element of a case slot indicates extensionality of the slot.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "If the slot indicates extensionality, the filler will be replaced by its extension. This manipulation will be treated later in this section.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "(2) Interpretation of a noun phrase Most significant noun phrase may be in the form, DET+NOUN.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "The formula is interpreted as follows: where p* means the denotation of p.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "Personal pronouns is interpreted as follows:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "I: the SPEAKER attribute, you: the HEARER attribute, he: paraphrased as the male, she: paraphrased as the female.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "Proper name is interpreted as follows:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "proper-name: DEF[?X; NAME('proper-name,?X)].", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "(3) Interpretation of an adjective An adjective maps a noun into another noun. Here we treat those that plays this role.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "Interpretation of plural is:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "*pl(noun): (4) Interpretation of a postmodification A relative clause (in restrictive use) maps the head noun into a modified noun, as follows:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "I?X[", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "(which(sentence))(noun).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "A distinguished symbol 'which' announces the occurence of a relative clause and sends the denotation of the antecedent as a message. The argument of 'which' is a sentence including the eliminated noun phrase '#ante' which will receive the message and substitute the denotation.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "See the following example: An adjective prepositional phrase also modifies a noun.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "An attributive noun or a de-verbal noun is treated as a noun which is a one-place predicate in LE, but which takes two or more arguments in PSN level. Adjective prepositional phrases supply these arguments to the head noun. For example, interpreting the LE: Thus in the interpretation process, the message communications between specialists play a significant role.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(i) Interpretation of a sentence", |
| "sec_num": null |
| }, |
| { |
| "text": "A space is used to denote the interpretation of a noun clause.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(5) Interpretation of a noun clause", |
| "sec_num": null |
| }, |
| { |
| "text": "A noun clause is interpreted as follows: I fun(sentence)~DEF[?X; fun*(?X,ml)],", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(5) Interpretation of a noun clause", |
| "sec_num": null |
| }, |
| { |
| "text": "where T(~l,sentence*),", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(5) Interpretation of a noun clause", |
| "sec_num": null |
| }, |
| { |
| "text": "where 'fun' stands for a symbol such as 'that', 'whether' ... etc. that maps a sentence into a noun clause. Fun* is an appropriate PSN predicate.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(5) Interpretation of a noun clause", |
| "sec_num": null |
| }, |
| { |
| "text": "T(~,p) is a meta predicate that means the object formula p is true in the possible world (or space) denoted by ~. For example, interpreting the LE: where, *psubJ sends as a message the denotation of the deep subject, and *en receives the message to supply the OBJECT slot of the internal verb ACCEPT. Since the OBJECT slot of the predicate POSSESS indicates extensionality, this becomes AND (POSSESS (\"I\", C), BOOK(C) ),", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(5) Interpretation of a noun clause", |
| "sec_num": null |
| }, |
| { |
| "text": "where C is a Skolem constant.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(5) Interpretation of a noun clause", |
| "sec_num": null |
| }, |
| { |
| "text": "For DEF type structure, since the denotation refers some uniquely determined object, a referent search program is activated. The program searches local contextual memory by matching each candidate against the given intensional PSN structure. The pattern matching operation in PSN corresponds to deduction on meta language, that is, the deflntion of match is:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(5) Interpretation of a noun clause", |
| "sec_num": null |
| }, |
| { |
| "text": "PSN. matches PSN^ if~ meta(PSNl) ~mplies meta(PSN2)", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(5) Interpretation of a noun clause", |
| "sec_num": null |
| }, |
| { |
| "text": "In order to find the referent, various kinds of knowledge will be needed [5] . However, this topic is beyond the scope of this paper.", |
| "cite_spans": [ |
| { |
| "start": 73, |
| "end": 76, |
| "text": "[5]", |
| "ref_id": "BIBREF4" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(5) Interpretation of a noun clause", |
| "sec_num": null |
| }, |
| { |
| "text": "The intensional PSN structure is replaced by a PSN structure found. For example, consider the following two sentences:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(5) Interpretation of a noun clause", |
| "sec_num": null |
| }, |
| { |
| "text": "This paper describes a system .... After the referent search procedure, the structure becomes: ANALYZE(B,programs*).", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(5) Interpretation of a noun clause", |
| "sec_num": null |
| }, |
| { |
| "text": "Since the denotation DEF[?X; SYSTEM(?X)] matches the node B (for, SYSTEM(B) holds), it is replaced by the node B.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "(5) Interpretation of a noun clause", |
| "sec_num": null |
| }, |
| { |
| "text": "All the mechanisms presented so far has been implemented as LISP programs and are working on the personal LISP system in our laboratory. Now experiments and improvements are in progress.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "5." |
| }, |
| { |
| "text": "As stated in the first section, advantages of our method can be shown if it is applied to wide applications.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "5." |
| }, |
| { |
| "text": "Experiments are in progress as for machine translation and question answering.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "5." |
| }, |
| { |
| "text": "Machine translation [12] As the first step to the machine translation, we are implementing a program which generates Japanese from the LE obtained by analyzing English. Another application is to answer questions about the integrated network structure.", |
| "cite_spans": [ |
| { |
| "start": 20, |
| "end": 24, |
| "text": "[12]", |
| "ref_id": "BIBREF11" |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "5." |
| }, |
| { |
| "text": "In order to make conversation with a user, the input sentence should be further evaluated. For example, for user's question actual question/answering process must be invoked. Thus a pattern directed procedure is used. This approach investigates meaning representation and deduction.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "5." |
| }, |
| { |
| "text": "Extension to other languages [ii] The meaning representation is, in principle, independent of which language is used. To show this, we must analyze more than one languages. Although in this paper, the object language is English, we have implemented a Japanese parser and are in the course of implementation of Japanese to English machine translation program.", |
| "cite_spans": [ |
| { |
| "start": 29, |
| "end": 33, |
| "text": "[ii]", |
| "ref_id": null |
| } |
| ], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Discussion", |
| "sec_num": "5." |
| }, |
| { |
| "text": "The important problems to be solved are:", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Further work", |
| "sec_num": null |
| }, |
| { |
| "text": "-the problem of discourse, especially, how to treat focus attention or ellipsis in our formalism, -the semantics of PSN; the semantics of PSN may be defined either by associating each network structure with a logic-oriented meta language or by defining inference rules on PSN explicitly; the semantics must explicate implications and synonyms among PSN structures; furthermore the semantics must be extended to treat the concepts such as action or event, -accommodation of transformational aspects; it seems that the transformational theory further decomposes the translation mapping T; the introduction of transformational aspect will increase the feasibility of the system.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Further work", |
| "sec_num": null |
| }, |
| { |
| "text": "We have shown a logico-linguistic approach to the analysis of natural language by computer. AI techniques are combined with Montague-type grammar. The main features of the approach are shown for the fundamental subset of English. The promising applications may be semantic based machine translation and deductive question answering on natural language.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Conclusion", |
| "sec_num": "6." |
| } |
| ], |
| "back_matter": [ |
| { |
| "text": "We would like to thank the other members of Prof. Doshita's laboratory, and in particular, Mr. Masaki KIYONO both for his participations of numerous discussions and for his assistance.", |
| "cite_spans": [], |
| "ref_spans": [], |
| "eq_spans": [], |
| "section": "Acknowledsements", |
| "sec_num": null |
| } |
| ], |
| "bib_entries": { |
| "BIBREF0": { |
| "ref_id": "b0", |
| "title": "An overview of KRL, A knowledge representation language", |
| "authors": [ |
| { |
| "first": "D", |
| "middle": [ |
| "G" |
| ], |
| "last": "Bobrow", |
| "suffix": "" |
| }, |
| { |
| "first": "T", |
| "middle": [], |
| "last": "Winograd", |
| "suffix": "" |
| } |
| ], |
| "year": 1976, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "D. G. Bobrow and T. Winograd, An overview of KRL, A knowledge representation language, CSL-76-4, Xerox, Palo Alto Reseasrch Center, 1976.", |
| "links": null |
| }, |
| "BIBREF1": { |
| "ref_id": "b1", |
| "title": "Logics and languages", |
| "authors": [ |
| { |
| "first": "M", |
| "middle": [ |
| "J" |
| ], |
| "last": "Cresswell", |
| "suffix": "" |
| } |
| ], |
| "year": 1973, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "M. J. Cresswell, Logics and languages, Methuen & Co. LTd, 1973. (translated into Japanese by Ishimoto and Ikeya, Kinokuniya, 1978).", |
| "links": null |
| }, |
| "BIBREF2": { |
| "ref_id": "b2", |
| "title": "A guide to Montague's PTQ, Indiana University Linguistic Club", |
| "authors": [ |
| { |
| "first": "D", |
| "middle": [ |
| "R" |
| ], |
| "last": "Dowty", |
| "suffix": "" |
| } |
| ], |
| "year": 1978, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "D. R. Dowty, A guide to Montague's PTQ, Indiana University Linguistic Club, 1978.", |
| "links": null |
| }, |
| "BIBREF3": { |
| "ref_id": "b3", |
| "title": "Evaluating English sentences with a logical model, Information Abstracts of COLING 78", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [], |
| "last": "Friedman", |
| "suffix": "" |
| }, |
| { |
| "first": "D", |
| "middle": [ |
| "B" |
| ], |
| "last": "Moran", |
| "suffix": "" |
| }, |
| { |
| "first": "D", |
| "middle": [ |
| "S" |
| ], |
| "last": "Warren", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "J. Friedman, D. B., Moran and D. S. Warren, Evaluating English sentences with a logical model, Information Abstracts of COLING 78, University of Bergen, Norway.", |
| "links": null |
| }, |
| "BIBREF4": { |
| "ref_id": "b4", |
| "title": "The representation and use of focus in a system for understanding dialogs", |
| "authors": [ |
| { |
| "first": "B", |
| "middle": [ |
| "J" |
| ], |
| "last": "Grosz", |
| "suffix": "" |
| } |
| ], |
| "year": 1977, |
| "venue": "Proc. IJCAI-77", |
| "volume": "", |
| "issue": "", |
| "pages": "67--76", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "B. J. Grosz, The representation and use of focus in a system for understanding dialogs, in Proc. IJCAI-77, 1977, 67-76.", |
| "links": null |
| }, |
| "BIBREF5": { |
| "ref_id": "b5", |
| "title": "A network-based knowledge representation and its natural deduction system", |
| "authors": [ |
| { |
| "first": "R", |
| "middle": [], |
| "last": "Fikes", |
| "suffix": "" |
| }, |
| { |
| "first": "G", |
| "middle": [], |
| "last": "Hendrix", |
| "suffix": "" |
| } |
| ], |
| "year": 1977, |
| "venue": "Proc. IJCAI-77", |
| "volume": "", |
| "issue": "", |
| "pages": "235--246", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "R. Fikes and G. Hendrix, A network-based knowledge representation and its natural deduction system, in Proc. IJCAI-77, 1977, 235-246.", |
| "links": null |
| }, |
| "BIBREF6": { |
| "ref_id": "b6", |
| "title": "Making computational sense of Montague's intensional logic", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [ |
| "R" |
| ], |
| "last": "Hobbs", |
| "suffix": "" |
| } |
| ], |
| "year": 1978, |
| "venue": "AI", |
| "volume": "9", |
| "issue": "", |
| "pages": "287--306", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "J. R. Hobbs, Making computational sense of Montague's intensional logic, AI 9(1978), 287-306.", |
| "links": null |
| }, |
| "BIBREF7": { |
| "ref_id": "b7", |
| "title": "Reasoning about knowledge and action", |
| "authors": [ |
| { |
| "first": "R", |
| "middle": [ |
| "C" |
| ], |
| "last": "Moore", |
| "suffix": "" |
| } |
| ], |
| "year": 1977, |
| "venue": "Proc. IJCAI-77", |
| "volume": "", |
| "issue": "", |
| "pages": "223--227", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "R. C. Moore, Reasoning about knowledge and action, in Proc. IJCAI-77, 1977, 223-227.", |
| "links": null |
| }, |
| "BIBREF8": { |
| "ref_id": "b8", |
| "title": "The framework of knowledge representation and its retrieval in LGS --the literature guide system", |
| "authors": [ |
| { |
| "first": "T", |
| "middle": [], |
| "last": "Nishida", |
| "suffix": "" |
| }, |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Doshita", |
| "suffix": "" |
| } |
| ], |
| "year": 1977, |
| "venue": "Proc. IJCAI-79", |
| "volume": "", |
| "issue": "", |
| "pages": "662--664", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "T. Nishida and S. Doshita, The framework of knowledge representation and its retrieval in LGS --the literature guide system, in Proc. IJCAI-79, 1977, 662-664.", |
| "links": null |
| }, |
| "BIBREF9": { |
| "ref_id": "b9", |
| "title": "A knowledge-based literature guide system --A new approach to document retrieval", |
| "authors": [ |
| { |
| "first": "T", |
| "middle": [], |
| "last": "Nishida", |
| "suffix": "" |
| }, |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Doshita", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "IFIP", |
| "volume": "80", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "T. Nishida and S. Doshita, A knowledge-based literature guide system --A new approach to document retrieval, IFIP 80 (to appear).", |
| "links": null |
| }, |
| "BIBREF10": { |
| "ref_id": "b10", |
| "title": "Analysis of predicates of Japanese and the generation of English", |
| "authors": [ |
| { |
| "first": "T", |
| "middle": [], |
| "last": "Nishida", |
| "suffix": "" |
| }, |
| { |
| "first": "Y", |
| "middle": [], |
| "last": "Sakakibara", |
| "suffix": "" |
| }, |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Doshita", |
| "suffix": "" |
| } |
| ], |
| "year": 1980, |
| "venue": "National Conventional Record of IPS Japan", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "T. Nishida, Y. Sakakibara and S. Doshita, Analysis of predicates of Japanese and the generation of English, National Conventional Record of IPS Japan, 1980, (in Japanese).", |
| "links": null |
| }, |
| "BIBREF11": { |
| "ref_id": "b11", |
| "title": "English-Japanese translation based on semantic analysis", |
| "authors": [ |
| { |
| "first": "T", |
| "middle": [], |
| "last": "Nishida", |
| "suffix": "" |
| }, |
| { |
| "first": "M", |
| "middle": [], |
| "last": "Kiyono", |
| "suffix": "" |
| }, |
| { |
| "first": "T", |
| "middle": [], |
| "last": "Yamanaka", |
| "suffix": "" |
| }, |
| { |
| "first": "S", |
| "middle": [], |
| "last": "Doshita", |
| "suffix": "" |
| } |
| ], |
| "year": null, |
| "venue": "National Conventional Record of IPS Japan", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "T. Nishida, M. Kiyono, T. Yamanaka and S. Doshita, English-Japanese translation based on semantic analysis, National Conventional Record of IPS Japan, (in Japanese).", |
| "links": null |
| }, |
| "BIBREF12": { |
| "ref_id": "b12", |
| "title": "Denotational semantics: The Scott-Strachey approach to programming language theory", |
| "authors": [ |
| { |
| "first": "J", |
| "middle": [ |
| "E" |
| ], |
| "last": "Stoy", |
| "suffix": "" |
| } |
| ], |
| "year": 1977, |
| "venue": "", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "J. E. Stoy, Denotational semantics: The Scott-Strachey approach to programming language theory, The MIT press, 1977.", |
| "links": null |
| }, |
| "BIBREF13": { |
| "ref_id": "b13", |
| "title": "Understanding natural language", |
| "authors": [ |
| { |
| "first": "T", |
| "middle": [], |
| "last": "Winograd", |
| "suffix": "" |
| } |
| ], |
| "year": 1972, |
| "venue": "Sangyo-tosho", |
| "volume": "", |
| "issue": "", |
| "pages": "", |
| "other_ids": {}, |
| "num": null, |
| "urls": [], |
| "raw_text": "T. Winograd, Understanding natural language, Academic Press 1972. (translated into Japanese by Fuchi, Tamura and Shirai, Sangyo-tosho, 1976).", |
| "links": null |
| } |
| }, |
| "ref_entries": { |
| "FIGREF0": { |
| "text": "LANGUAGE ANALYZER & LE .&. PSN ---. task oriented representations where NL: natural language, LE: logical expression, PSN: partitioned semantic network, T: translation mapping, I: interpretation mapping.", |
| "uris": null, |
| "num": null, |
| "type_str": "figure" |
| }, |
| "FIGREF1": { |
| "text": "Syntax analysis and generation of LE for the sentence, \"Every man loves a woman.\" Sometimes linear notations are used instead of PSN structure.", |
| "uris": null, |
| "num": null, |
| "type_str": "figure" |
| }, |
| "FIGREF2": { |
| "text": "Verb phrase Basic part of a verb phrase is composed of either an intransitive verb or a transitive verb plus an object. For example, The LE for a phrase \"have a book\" is obtained as follows: Ix 1[ (a(book)) (ly l[possess(x,y) ]) ] e E<0,1> possess ~ E<O,i,i> a(book) e E<0,<0,1>>", |
| "uris": null, |
| "num": null, |
| "type_str": "figure" |
| }, |
| "FIGREF3": { |
| "text": "example) \"the two efficient algorithms\" the(two(*pl(efficient(algorithm)))) E E<O,<0,1>> the~two (*el (~ef ficient (algorithm))) ~o *m~ifef: [cie~nt(~l ith \" efficient(algorithm) *pl I I the two efficient algorithm +s (DET)(NBR) (ADJ) (NOUN) (+S) (4) Postmodifier (i) Relative clause A relative clause is composed of the symbol 'which' and a sentence. 'Which' makes a postmodifier of a noun out of the sentence. A special symbol #ante (in E<O,<0,1>>) is supplied for the eliminated antecedent in the relative clause. See the following example: g E<<0,1>,<0,1>> which (#ante (Ix, [ (a (input)) (ly I [accept (x, y) ] ) ] ) ) which #ante (/Ix I [ (~nput)) (ly I [accept (x, y) ] ) ] ) / (a (input)) (lye [accept (x,y) ] ) ] #an[e xXlC /'''-accept a (input) which qb accept(s) a put (ii) Adjective prepositional phrase", |
| "uris": null, |
| "num": null, |
| "type_str": "figure" |
| }, |
| "FIGREF4": { |
| "text": "intransitive verb: ((SUBJ, EXT, ... )), extensional transitive verb: ((ACTOR, EXT, ... ) (OBJ, EXT, ... )), intensional transitive verb: ((ACTOR, EXT, ... ) (OBJ, INT .... )),", |
| "uris": null, |
| "num": null, |
| "type_str": "figure" |
| }, |
| "FIGREF5": { |
| "text": "(a/an)+noun: %?P[?P(INDEF[?X; noun*(?X)])], the+noun: I?P[?P(DEF[?X; noun*(?X)])], every+noun: %?P[ANY[?X; noun*(?X)-~?P(?X)]], no+noun: %?P[ANY[?X;noun*(?X)~~?P(?X)]],", |
| "uris": null, |
| "num": null, |
| "type_str": "figure" |
| }, |
| "FIGREF6": { |
| "text": "the((which(l(%x[#ante(ly[attack(x,y)])]))) (problem)) \"the problem which I attack\" Interpreting the formula is: DEF[?X; GEN ~(which(l(lx[#ante(ly[attack(x,y)])])) (problem))(z); space#; z:?X; NILE ] = DEF[?X; GEN ~and(problem(z), l(%x[#ante(%y[attack(x,y)])])); space#; z:?X; #ante:?X~ ] = DEF[?X; AND(PROBLEM(?X),ATTACK(\"I\",?X))].", |
| "uris": null, |
| "num": null, |
| "type_str": "figure" |
| }, |
| "FIGREF7": { |
| "text": "the(ly [(the(car))(lx[(((*ap(of))(x))(color))(y)])]), \"the color of the car\", results in: DEF[?Y; GEN ~(((*ap(of))(x))(color))(y); space#; x:DEF[?X; CAR(?X)], y:?Y; NIL~ ] = DEF[?Y; GEN~color(y); space#; y:?Y; *ap:of:DEF[?X; CAR(?X)]~ ] = DEF[?Y; COLOR(DEF[?X; CAR(?X)]; ?Y)].", |
| "uris": null, |
| "num": null, |
| "type_str": "figure" |
| }, |
| "FIGREF8": { |
| "text": "why(not((the(program))(lx[work(x)]))), \"why the program does not work\" results in: DEF[?X; REASON(?X,m2)], where T(~2,NOT(WORK(the-program*))). In this case, fun=why and fun*=REASON. The resuting denotation roughly reads \"the reason of the situation m2 and in ~2 the object referred to by the expression the(program) does not work.\" Interpretation of other features -Possessive form is treated as a compound determiner. See the following example: fRO I$ (the(programmer)) -v,~-(%x[((*poss(x))(idea))(z)])], \"the programmer's idea\". The resulting denotation is: DEF[?X; AND(IDEA(?X), POSSESS(DEF[?Y; PROGRAMMER(?Y)]; ?X)] -Interpretation of a passive including the deep subject. For example, (the(sentence)) (ly[(the(automaton)) (lx[(*psubj(x))((*en(accept))(y))])]), \"the sentence is accepted by the automaton\", is interpreted as follows: ACCEPT(DEF[?X; AUTOMATON(?X)], DEF[?Y; SENTENCE(?Y)]),", |
| "uris": null, |
| "num": null, |
| "type_str": "figure" |
| }, |
| "FIGREF9": { |
| "text": "(Ix [ (a(book)) (~y [possess (x,y) ]) ]), \"I have a book.\" The intermediate PSN structure is: POSSESS(\"I\",INDEF[?X; BOOK(?X)]).", |
| "uris": null, |
| "num": null, |
| "type_str": "figure" |
| }, |
| "FIGREF10": { |
| "text": "of the sentence (i), the local memory contains: DESCRIBE(A,B)&PAPER(A)&SYSTEM(B). For the sentence (2), the intermediate structure is: ANALYZE(DEF[?X; SYSTEM(?X)],programs*).", |
| "uris": null, |
| "num": null, |
| "type_str": "figure" |
| } |
| } |
| } |
| } |
