| { | |
| "paper_id": "C82-1044", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T13:13:18.616010Z" | |
| }, | |
| "title": "AN ENGLISH-JAPANESE MACHINE TRANSLATION SYSTEM BASED ON FORMAL SEMANTICS OF NATURAL LANGUAGE", | |
| "authors": [ | |
| { | |
| "first": "Toyo-Aki", | |
| "middle": [], | |
| "last": "Nishida", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Kyoto University", | |
| "location": { | |
| "addrLine": "8akyo-ku", | |
| "postCode": "606", | |
| "settlement": "Kyoto", | |
| "country": "JAPAN" | |
| } | |
| }, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Shuji", | |
| "middle": [], | |
| "last": "Doshita", | |
| "suffix": "", | |
| "affiliation": { | |
| "laboratory": "", | |
| "institution": "Kyoto University", | |
| "location": { | |
| "addrLine": "8akyo-ku", | |
| "postCode": "606", | |
| "settlement": "Kyoto", | |
| "country": "JAPAN" | |
| } | |
| }, | |
| "email": "" | |
| } | |
| ], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "Tbls paper proposes a new model of machine translation. In this model, the lambda formula obtained from the syntactic and Semantic analysis of a source language sentence is viewed as a target language generating function and the target language sentence is obtained as a result of evaluating the formula by functional application or ~-calculus. This model provides a systematic and powerful way of incorporating human knowledge on the languages. A prototype is constructed on the LISP system. The performance was tested for four sample texts taken from existing technical reports and computer manuals.", | |
| "pdf_parse": { | |
| "paper_id": "C82-1044", | |
| "_pdf_hash": "", | |
| "abstract": [ | |
| { | |
| "text": "Tbls paper proposes a new model of machine translation. In this model, the lambda formula obtained from the syntactic and Semantic analysis of a source language sentence is viewed as a target language generating function and the target language sentence is obtained as a result of evaluating the formula by functional application or ~-calculus. This model provides a systematic and powerful way of incorporating human knowledge on the languages. A prototype is constructed on the LISP system. The performance was tested for four sample texts taken from existing technical reports and computer manuals.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Abstract", | |
| "sec_num": null | |
| } | |
| ], | |
| "body_text": [ | |
| { | |
| "text": "This paper proposes a functional model of machine translation and describes its applcation to English-Japanese machine translation. In this model, we aimed to achieve:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTRODUCTION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "-systematization of translation process, -lexicon based autonomous framework, and -a translation model based on semantic interpretation.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTRODUCTION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Intermediate representation of this model is EFR (English-oriented Formal Repre~entatlon) and CPS (Conceptual Phrase Structure).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERMEDIATE REPRESENTATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "EFR is a logical language based on Cresswell's lambda eategorial language (Cresswell (1973) ), which can be considered to be a notationally simplified version of Montague Grammar (Montague (1974) , Dowry (1981) ). From an engineering point of view, EFR can be regarded as an artiflcial language in which each expression is unambiguous. So, there may be the cases in which more than one EFR expression can be associated with a given sentence. In such cases, ambiguities are resolved using inference, knowledge, or by human assistance.", | |
| "cite_spans": [ | |
| { | |
| "start": 74, | |
| "end": 91, | |
| "text": "(Cresswell (1973)", | |
| "ref_id": "BIBREF0" | |
| }, | |
| { | |
| "start": 179, | |
| "end": 195, | |
| "text": "(Montague (1974)", | |
| "ref_id": "BIBREF4" | |
| }, | |
| { | |
| "start": 198, | |
| "end": 210, | |
| "text": "Dowry (1981)", | |
| "ref_id": "BIBREF3" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERMEDIATE REPRESENTATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "CPS is an extended phrase structure in that (I) CPS is a more general element including syntactic knowledge on the concept, so (2) CPS is implemented as a framo and (3) CPS is not only a data structure which is an object under operation but also a function which can operate on other CPS's.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERMEDIATE REPRESENTATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A CPS formula is a functional notation (lambda formula) of the operation sequence on CPS's. A CPS formula is evaluated to be a CPS or a functional value.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERMEDIATE REPRESENTATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The evaluation process is defined by a (pure) LISP like interpreter.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERMEDIATE REPRESENTATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Engllsh sentence analysis is done using~wo layered rules, pattern directed augmented context free rules (AUGCF rules) and production type procedural rules. AUGCF rule is a descriptive rule. Context free rule is extended in several points, (1) attached function for checking syntactic details and semantic acceptability, (2) Although lots of syntactic phenomena can be easily formelized with AUGCF rules, the computer cannot efficiently analyze input sentences only with them. One reason is that the computer nmst examine which rules are applicable in a given situation and determine which one is plausible. Such processings make the computer very much slow and inefficient.", | |
| "cite_spans": [ | |
| { | |
| "start": 320, | |
| "end": 323, | |
| "text": "(2)", | |
| "ref_id": "BIBREF1" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "SOURCE LANGUAGE ANALYSIS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Another reason is that some kind of heuristic knowledge, which is sometimes referred to as knowledge on control (Davis (1980)), cannot be effectively incorporated into the AUGCF rules.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "SOURCE LANGUAGE ANALYSIS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The knowledge on control provides heuristics on when and how to use each rule. Condition -> actio~ formalism (production rule formalism) is considered to be suitable to write such level of knowledge.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "SOURCE LANGUAGE ANALYSIS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Our second level rule is obtained by attaching control informetion to each AUGCF rule and transforming the rule format. The type of procedural rules are: E-rule, U-rule, B-rule, and L-rule.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "SOURCE LANGUAGE ANALYSIS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "-E-rule (expansion rule) is invoked when a goal is expected. E-rule specifies subgoal decomposition of the given goal. -U-rule (up-ped rule) is invoked when a parse tree node is generated. This rule further specifies additional goals and if all of them succeed, a new node will be constructed. This rule is used mainly for left recurslve type AUGCF rules.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "SOURCE LANGUAGE ANALYSIS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "-B-rule (Bottom-up rule) is referred to by a bottom-up parser incorporated in the rule interpreter. -L-rule (Lexicon rule) is embedded in a dictionary and invoked when a key word is encountered in the given text.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "SOURCE LANGUAGE ANALYSIS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The rules RI and R2 are rewritten into procedural type rules as follows: Where RI', for example, says that: given a goal S then expand it into subgoals NP and VP; if both of them succeed then reduce them into an S node; at that time, a function subjvp checks subject-verb agreement; +10 is the score for S; *seml(*sem 2) is a p~ttern of the EFR expression for the S node, where *sem 1 denotes the EFR expression for its first son (NP), etc. If some anomaly is detected by those functional attachments, the application of the rule is rejected (functional augmentation of CF rule).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "SOURCE LANGUAGE ANALYSIS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "goal=S \"~{T -*", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "SOURCE LANGUAGE ANALYSIS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A notion of a frame is employed in order to implement feature semantics. A frame is an extended property list in which syntactic and semantic features are described.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "SOURCE LANGUAGE ANALYSIS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "By passing and checking consistency among such features, (mainly semantic) constraints are implemented.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "SOURCE LANGUAGE ANALYSIS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "In practice, the knowledge incorporated in a system can never be total and complete, so human being ~hould help computer analyze input sentences. The human halp is limited to resolving ambiguities.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "SOURCE LANGUAGE ANALYSIS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "In order to make the human diagnosis efficient, some diagnostic facilities are implemented.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "SOURCE LANGUAGE ANALYSIS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "It is also important to construct and manage dictionaries. Dictionary manager is implemented to make human modification of dictionary flexible by use of pattern directed dictionary editing commands.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "SOURCE LANGUAGE ANALYSIS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The interpretation of an EFR expression can be defined in the conceptual level. For example, given an EFR expression:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "a(%y[a*(communication))(~x[(((*ap(for)(x))(facility))(y)])]),", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "which corresponds to a noun phrase \"a facility for communication\".", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A detailed description of the conceptual interpretation in our conceptual model (Nishida (1980) ) is given below. which becomes \"for the sake of (a) communication\" from (2). (4) the adjective concept obtained in (3) is applied as a function to the interpretation of \"facility\" (i.e., a noun concept \"facility\"). Thus we obtain a complex noun concept \"system for the sake of (a) facility\" for ((*ap(for))(x))(facility). (5) the application of a noun concept p to an individual concept q yields a sentence concept: \"q is a p.\" This interpretation rule is used for the fragment: (((*ap(for))(x))(facility))(y). The result is a sentence concept: \"something (y) is a facility for the sake of (a) communication.\" (6) Finally the interpretation of a given EFR expression results in a noun phrase concept: \"something y: such that y is a facility for the sake of (a) communication.\" This noun phrase concept is a higher order concept which gives a name to an individual: \"a facility for the sake of (a) co~m~unication.\" This higher order concept will be reduced if it is applied to a one place predicate (roughly speaking, a property like \"being constructed\", \"being an x such that the paper is concerned with", | |
| "cite_spans": [ | |
| { | |
| "start": 80, | |
| "end": 95, | |
| "text": "(Nishida (1980)", | |
| "ref_id": "BIBREF5" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "x\", etc.).", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The above process of interpretation is stepwise and includes no \"gap\" nor \"skip\". Such property is crucially important i n constructing large and complex systems including machine translation systems. This process can be simulated in the \"linguistic\" domain; our idea of target language generation is this:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "each conceptual element is accompanied with a target language phrase structure which gives the name of the concept. -each semantic interpretation of a complex structure is accompanied with a syntactic operation of creating new phrase structure from those for function part and argument part conceptual elements. Thus, a functional application corresponds to a primitive syntactic operation of Japanese language.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "CPS is defined to be a structure which conveys not only conceptual information on a concept but also syntactic infbrmation about the concept. All those information is structured as a frame.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The descendant slot of a CPS is either a terminal value (lexicon frame) or a list of CPS's.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Thus CPS can be linked as a tree structure.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A CPS corresponding to a noun phrase: \"the typewriter\" looks like:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "[NP [DET 'the' with Q=DEFINITE] r 'typewriter' with CLASS=PHYSOBJ ] with NBR=SGL ]. LNOUN ......", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A CPS works both as a data and as a function; it is sometimes applied to other CPS's to result in another CPS or functional value, or it sometimes is a data structure under some operation. Thus CPS is a higher order object. The semantics can be modeled in the notion of a categorial grammar.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A CPS of an adjective concept, for example, meps a CPS of a noun concept into another (compound) CPS of a modified noun.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "This principle can he written as: ADJ=NOUN/NOUN.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "On the other hand, the adjective CPS can be modified by an adverbial CPS.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Thus ADV=ADJ/ADJ. In practice, our system involves one step called the REFORM step after the CPS evaluation process. This step is needed mainly because, (I) some direct output is not readable; the content can be understood without ambiguity, but i\u00a3 is much redundant or not commonly used, or much mere worse (2) the output is semantically wrong. Such cases arises where the EFR expression extracted from the source language is not well defined to the language expression in question. This case occurs when the system designer commits misconception or fails to correctly capture the phenomenon. In principle, the second case is obviously bad but no theory has ever succeeded in medelling all phenomena in natural language.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "So in practice, the second case is unavoidable.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The REFORM process uses heuristic rules to 'reform' those CPS structure into reasonable one.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Pattern directed transformation rules are used. Those rules are applied until no rule is applicable to the given CPS structure.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "INTERPRETATION OF EFR AND TARGET LANGUAGE GENERATION", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "A prototype of the system has been constructed on a personal LISP system (Voshita (1978)), which is developed on a minicomputer with LISP-oriented storage subsystem. As to the analysis module, sixth version is in use; as to the generation module, first version is in use. About two years since the last COLING conference at Tokyo were mainly devoted to the development.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "EXPERIMENTS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "At the first stage of experiment, sample sentences were tested for several sentence patterns. At the second stage, our purpose was to extend the system for practical test; to translate existing texts even if introducing human assists to some (reasonable) extent. Four sample texts (totally 40 sentences) selected from existing technical reports and computer menuals. Each of the s ~le texts orresponds to one section or a short chapter in the material. All s ences of each sample texts have been successfully translated into Japanese. No pre-editing is done except for three minor modifications to the original text (e.g., \"16-or 32-bit\" => \"16-bit or 32-bit\"). Human assist is limited to resolving ambiguities in the analysis phase. One example is shown in Fig.2 .", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 758, | |
| "end": 763, | |
| "text": "Fig.2", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "EXPERIMENTS", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "This paper proposes a new approach to machine translation based on a functional semantics of natural langauge. The effectiveness of this approach is tested by experi~nts for short chapters and an abstract taken from existing technical reports and computer menuals.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "CONCLUSION", | |
| "sec_num": null | |
| } | |
| ], | |
| "back_matter": [ | |
| { | |
| "text": "This research was partially supported by Grant-in-Aid for Scientific Research. The authors want to thank Mr. Kiyoshi Agusa and Mr. Shigeo Sugimoto for providing conveniences of editing and printing this material.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "ACKNOWLEGDEMENT", | |
| "sec_num": null | |
| } | |
| ], | |
| "bib_entries": { | |
| "BIBREF0": { | |
| "ref_id": "b0", | |
| "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": "Cresswell, M.J., Logics and Languages, (Methuen, 1973).", | |
| "links": null | |
| }, | |
| "BIBREF1": { | |
| "ref_id": "b1", | |
| "title": "Meta-rules: reasoning about control", | |
| "authors": [ | |
| { | |
| "first": "R", | |
| "middle": [], | |
| "last": "Davis", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1980, | |
| "venue": "AI", | |
| "volume": "15", | |
| "issue": "", | |
| "pages": "179--222", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Davis, R., Meta-rules: reasoning about control, AI 15 (1980), 179-222.", | |
| "links": null | |
| }, | |
| "BIBREF2": { | |
| "ref_id": "b2", | |
| "title": "j Implementation of LISP system using direct accessible bulk memory", | |
| "authors": [ | |
| { | |
| "first": "S", | |
| "middle": [], | |
| "last": "Dosbita~", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "K", | |
| "middle": [], | |
| "last": "Hiramatsu", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "K", | |
| "middle": [], | |
| "last": "Kakui", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1978, | |
| "venue": "Trans. of IECE of Japan", | |
| "volume": "", | |
| "issue": "5", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Dosbita~ S., Hiramatsu, K.j and Kakui, K.j Implementation of LISP system using direct accessible bulk memory, in: Trans. of IECE of Japan, vol. J61-D, no. 5, (1978), (in Japanese).", | |
| "links": null | |
| }, | |
| "BIBREF3": { | |
| "ref_id": "b3", | |
| "title": "Introduction to Montague Semantics", | |
| "authors": [ | |
| { | |
| "first": "D", | |
| "middle": [], | |
| "last": "Dowry", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "R", | |
| "middle": [], | |
| "last": "Wall", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "J", | |
| "middle": [ | |
| "R" | |
| ], | |
| "last": "Peters", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1981, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Dowry, D., Wall, R., and Peters, JR., Introduction to Montague Semantics, (Reidel, 1981).", | |
| "links": null | |
| }, | |
| "BIBREF4": { | |
| "ref_id": "b4", | |
| "title": "Proper treatment of quantification in ordinary English", | |
| "authors": [ | |
| { | |
| "first": "R", | |
| "middle": [], | |
| "last": "Montague", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1974, | |
| "venue": "Formal Philosophy", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Montague, R., Proper treatment of quantification in ordinary English, in: Thomason (ed.), Formal Philosophy, (Yale University, 1974).", | |
| "links": null | |
| }, | |
| "BIBREF5": { | |
| "ref_id": "b5", | |
| "title": "Hierarchical meaning representation and analysis of natural language documents", | |
| "authors": [ | |
| { | |
| "first": "T", | |
| "middle": [], | |
| "last": "Nishida", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "S", | |
| "middle": [], | |
| "last": "Doshita", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1980, | |
| "venue": "Proc. COLING", | |
| "volume": "80", | |
| "issue": "", | |
| "pages": "85--92", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Nishida, T. and Doshita, S., Hierarchical meaning representation and analysis of natural language documents, in: Proc. COLING 80, (1980), 85-92.", | |
| "links": null | |
| }, | |
| "BIBREF6": { | |
| "ref_id": "b6", | |
| "title": "ETHERNET IS A BRANCHING BROmDCAST COMMUNICATION SYSTEM FOR CARRYING (1) DIBITAL DgTI:I PACKETS RMOH6 LOCALLY DISTRIBUTED COMPUTIHG STATIONS", | |
| "authors": [], | |
| "year": null, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "ETHERNET IS A BRANCHING BROmDCAST COMMUNICATION SYSTEM FOR CARRYING (1) DIBITAL DgTI:I PACKETS RMOH6 LOCALLY DISTRIBUTED COMPUTIHG STATIONS /", | |
| "links": null | |
| } | |
| }, | |
| "ref_entries": { | |
| "FIGREF0": { | |
| "type_str": "figure", | |
| "num": null, | |
| "text": "(I) conceptual interpretation of a(~y[ ... ]) associates a conceptual element \"something\" (individual concept) with the variable y. (2) conceptual interpretation of a*(communication)(~x[ ... ]) associates a conceptual element \"(a) communication\" with the variable x. (3) (*ap(for))(x) is interpreted as an adjective concept \"for the sake of x\",", | |
| "uris": null | |
| }, | |
| "FIGREF1": { | |
| "type_str": "figure", | |
| "num": null, | |
| "text": "transforming one phrase by use of the information from another phrase.a (Ay [ (a* (communicatlon)) (a) eonTnuni~on/ / [ NOUN[ NOUN-MODF\" (aS ~5) ~ ~0 ~D] [ NOUN ~ ]] / f,,~ty .,'o. c,,) .o.,r~o,, j/ [S[NPaS~Gcr~:)][Np (aS ~) ~6Dtc~\u00a9-~][PRED\"O~ ]] something is a faci~ con~nication [Np(~ ~) (~S) ~D/C~O~D~ ] (some) facility for (a) communication Fig.l. Outline of a sample generation from an EFR expression.", | |
| "uris": null | |
| }, | |
| "FIGREF2": { | |
| "type_str": "figure", | |
| "num": null, | |
| "text": "an outline of target language generation process for a phrase \"a facility for communication\". (CPS formula is onmited there.)", | |
| "uris": null | |
| } | |
| } | |
| } | |
| } |