| { | |
| "paper_id": "C90-1012", | |
| "header": { | |
| "generated_with": "S2ORC 1.0.0", | |
| "date_generated": "2023-01-19T12:37:19.259143Z" | |
| }, | |
| "title": "The Generalized LR Parser/Compiler V8-4: A Software Package for Practical NL Projects", | |
| "authors": [ | |
| { | |
| "first": "Hideto", | |
| "middle": [], | |
| "last": "Kagamida", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Kevin", | |
| "middle": [], | |
| "last": "Knight", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Hiroyuki", | |
| "middle": [], | |
| "last": "Musha", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Kazuhiro", | |
| "middle": [], | |
| "last": "Toyoshima", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Steve", | |
| "middle": [], | |
| "last": "Morrisson", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Eric", | |
| "middle": [], | |
| "last": "Nyberg", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Hiroakl", | |
| "middle": [], | |
| "last": "Saito", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Hideto", | |
| "middle": [], | |
| "last": "Tomabechi", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Donna", | |
| "middle": [], | |
| "last": "Gates", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Lori", | |
| "middle": [], | |
| "last": "Levin", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Toru", | |
| "middle": [], | |
| "last": "Matsuda", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Teruko", | |
| "middle": [], | |
| "last": "Mitamura", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Ralph", | |
| "middle": [], | |
| "last": "Brown", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Jaime", | |
| "middle": [], | |
| "last": "Carbonell", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Mari~n", | |
| "middle": [], | |
| "last": "Kee", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Sergei", | |
| "middle": [], | |
| "last": "Nirenburg", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Koichi", | |
| "middle": [], | |
| "last": "Takeda", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| }, | |
| { | |
| "first": "Masaru", | |
| "middle": [], | |
| "last": "Tomita", | |
| "suffix": "", | |
| "affiliation": {}, | |
| "email": "" | |
| } | |
| ], | |
| "year": "", | |
| "venue": null, | |
| "identifiers": {}, | |
| "abstract": "This paperldescribes a software package designed for practical projects which involve natural language parsing. ]he Generalized LR Parser/Compiler V8-4 is based on Tomita's Generalized LR Parsing Algorithm [7, 6], augmented by pseudo/full unification modules. While the parser/compiler is not a commercial product, it has been thoroughly tested and heavily used by many projects inside and outside CMU last three years. It is publicly available with some restrictions for profit-making industries 2. It is written entirely in CommonLisp, and no system-dependent functions, such as window graphics, are used for the sake of portabili.ty. Thus, it should run on any systems that run CommonLisp in principle 3, including IBM RT/PC, Mac II, Symbolics and HP Bobcats. Each rule consists of a context-free phrase structure description and a cluster of pseudo equations as in figure 1-1. The non-terminals in the phrase structure part of the rule are referenced in the equations as x0... xn, where x0 is the non-terminal 1Many members of CMU Center for Machine Translation have made contributions to the development of the system.", | |
| "pdf_parse": { | |
| "paper_id": "C90-1012", | |
| "_pdf_hash": "", | |
| "abstract": [ | |
| { | |
| "text": "This paperldescribes a software package designed for practical projects which involve natural language parsing. ]he Generalized LR Parser/Compiler V8-4 is based on Tomita's Generalized LR Parsing Algorithm [7, 6], augmented by pseudo/full unification modules. While the parser/compiler is not a commercial product, it has been thoroughly tested and heavily used by many projects inside and outside CMU last three years. It is publicly available with some restrictions for profit-making industries 2. It is written entirely in CommonLisp, and no system-dependent functions, such as window graphics, are used for the sake of portabili.ty. Thus, it should run on any systems that run CommonLisp in principle 3, including IBM RT/PC, Mac II, Symbolics and HP Bobcats. Each rule consists of a context-free phrase structure description and a cluster of pseudo equations as in figure 1-1. The non-terminals in the phrase structure part of the rule are referenced in the equations as x0... xn, where x0 is the non-terminal 1Many members of CMU Center for Machine Translation have made contributions to the development of the system.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Abstract", | |
| "sec_num": null | |
| } | |
| ], | |
| "body_text": [ | |
| { | |
| "text": "to construct a f-structure. In the example, the first equation in the example states that the case of <NP> must be nominative, and the second equation states that the form of <VP> must be finite. Then one of the following two must be true: (1) the time of <VP> is present and agreements of <NP> and <VP> agree, OR (2) the time of <VP> is past.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "If all of the conditions hold, let the f-structure of <DEC> be that of <VP>, create a slot called \"subj\" and put the fstructure of <NP> there, and create a slot called \"passive\" and put \"-\" there. Pseudo equations are described in detail in section 3.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Grammar compilation is the key to this efficient parsing system. A grammar written in the correct format is to be compiled before being used to parse sentences. The context-free phrase structure rules are compiled into an Augmented LR Parsing Table, and the equations are compiled into CommonLisp functions. The runtime parser then does the shiftreduce parsing guided by the parsing table, and each time a grammar rule is applied, its CommonLisp function compiled from equations is evaluated.", | |
| "cite_spans": [], | |
| "ref_spans": [ | |
| { | |
| "start": 243, | |
| "end": 249, | |
| "text": "Table,", | |
| "ref_id": null | |
| } | |
| ], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "In the subsequence sections, Generalized LR Parser/Compiler described.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "features of the v8-4 are briefly ", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Get a value from path2, and assign the value to path 1. If path1 i.,{ already defined, the old value is simply overwritten.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "path I <= path2", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Evaluate lisp-function-call, and assign the returned value to path. If path1 is already defined, the old value is simply overwritten, lisp-function-call can be an arbitrary lisp code, as long as all functions called in lisp-function-call are defined. A path can be used as a special function that returns a value of the slot.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "path <= lisp-function-call", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "Get a value from path2, assign the value to path I, and remove the value of path2 (assign nil to path2). If a value already exists in path1, then the new value is unified with the old value. If the unification fails, then this equation fails.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Removal Assignment, == path I == path2", | |
| "sec_num": "3.3." | |
| }, | |
| { | |
| "text": "Get a value from path2, and assign the value to path 1. If a value already exists in path1, the new value is appended to the old value. The resulting value of path1 is a multiple value. ", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Append Multiple Value, > path I > path2", | |
| "sec_num": "3.4." | |
| }, | |
| { | |
| "text": "The pseudo equations described in the previous section are different from what functional grammarians call \"unification\". The user can, however, select \"full (standard) unification mode\" by setting the global variable *UNIFICATION-NODE* from PSEUDO to FULL.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Standard Unification Mode", | |
| "sec_num": "4." | |
| }, | |
| { | |
| "text": "In the full unification mode, equations are interpreted as standard equations in a standard functional unification grammar [5] , although some of the features such as user-defined function calls cannot be used.", | |
| "cite_spans": [ | |
| { | |
| "start": 123, | |
| "end": 126, | |
| "text": "[5]", | |
| "ref_id": "BIBREF4" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Standard Unification Mode", | |
| "sec_num": "4." | |
| }, | |
| { | |
| "text": "However, most users of the parser/compiler find it more convenient to use PSEUDO unification than FULL unification, bot only because it is more efficient, but also because it has more practical features including user-defined function calls and user-defined special values. Those practical features are crucial to handle low-level non-linguistic phenomena such as time and date expressions [8] and/or to incorporate semantic and pragmatic processing of the user's choice. More discussions on PSEUDO and FULL unifications can be found in [10] .", | |
| "cite_spans": [ | |
| { | |
| "start": 537, | |
| "end": 541, | |
| "text": "[10]", | |
| "ref_id": "BIBREF7" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Standard Unification Mode", | |
| "sec_num": "4." | |
| }, | |
| { | |
| "text": "The user has a choice to make his grammar \"character basis\" or standard \"word basis\". When \"character basis mode\" is chosen, terminal symbols in the grammar are characters, not words. There are at least two possible reasons to make it character basis:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Character Basis Parsing", | |
| "sec_num": "5.1." | |
| }, | |
| { | |
| "text": "1. Some languages, such as Japanese, do not have a space between words. If a grammar is written in character basis, the user does not have to worry about word segmentation of unsegmented sentences.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Character Basis Parsing", | |
| "sec_num": "5.1." | |
| }, | |
| { | |
| "text": "2. Some languages have much more complex morphology than English. With the character basis mode, the user can write morphological rules in the very same formalism as syntactic rules.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Character Basis Parsing", | |
| "sec_num": "5.1." | |
| }, | |
| { | |
| "text": "In pseudo unification mode, the user can use a wild card character \"%\" in his grammar to match any character (if character basis) or any word (if word basis). This feature is especially useful to handle proper nouns and/or unknown words.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Wild Card Character", | |
| "sec_num": "5.2." | |
| }, | |
| { | |
| "text": "The Generalized LR Parser/Compiler V8-4 includes some debugging functions. They include:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Grammar Debugging Tools", | |
| "sec_num": "5.3." | |
| }, | |
| { | |
| "text": "\u2022 dmode ---debugging mode; to show a trace of rule applications by the parser'.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Grammar Debugging Tools", | |
| "sec_num": "5.3." | |
| }, | |
| { | |
| "text": "\u2022 trace ---to trace a particular rule.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Grammar Debugging Tools", | |
| "sec_num": "5.3." | |
| }, | |
| { | |
| "text": "\u2022 disp-trees, disp-nodes, etc. --to display parlial trees or values of nodes in a tree. All of the debugging tools do not use any fancy graphic interface for the sake of system portability.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Grammar Debugging Tools", | |
| "sec_num": "5.3." | |
| }, | |
| { | |
| "text": "The Generalized LR Parser/Compiler V8-4. includes another parser based on chart parsing which can parse a sentence without ever compiling a grammar:", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Interpretive Parser", | |
| "sec_num": "5.4." | |
| }, | |
| { | |
| "text": "; to load a grammar (i-loadgra grammar-file-name)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Interpretive Parser", | |
| "sec_num": "5.4." | |
| }, | |
| { | |
| "text": "; to run the interpretive parser (i-p sentence)", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Interpretive Parser", | |
| "sec_num": "5.4." | |
| }, | |
| { | |
| "text": "While its run time speed is significantly slower than that of the GLR parser, many users find it useful for debugging because grammar does not need to be compiled each time a small change is made.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Interpretive Parser", | |
| "sec_num": "5.4." | |
| }, | |
| { | |
| "text": "The user can define and use macros in a grammar. This is especially useful In case there are many similar rules in the grammar. A macro can be defined in the same way as CommonLisp macros. Those macros are expanded before the grammar is compiled.", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Grammar Macros", | |
| "sec_num": "5.5." | |
| }, | |
| { | |
| "text": "LR Parser/Compiler have been highlighted. More detailed descriptions can be found in its user's manual [9] . Unlike most other available software [1, 2, 4] , the Generalized LR Parser/Compiler v8-4 is designed specifically to be used in practical natural language systems, sacrificing perhaps some of the linguistic and theoretical elegancy.", | |
| "cite_spans": [ | |
| { | |
| "start": 103, | |
| "end": 106, | |
| "text": "[9]", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 146, | |
| "end": 149, | |
| "text": "[1,", | |
| "ref_id": "BIBREF0" | |
| }, | |
| { | |
| "start": 150, | |
| "end": 152, | |
| "text": "2,", | |
| "ref_id": null | |
| }, | |
| { | |
| "start": 153, | |
| "end": 155, | |
| "text": "4]", | |
| "ref_id": null | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Some of the important features of the Generalized", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "The system has been thoroughly tested and heavily used by many users in many projects inside and outside CMU last three years. Center for Machine Translation of CMU has [8] developed rather extensive grammars for English and Japanese for their translation projects, and some experimental grammars for French, Spanish, Turkish and Chinese. We also find the system very suitable to", | |
| "cite_spans": [], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Some of the important features of the Generalized", | |
| "sec_num": null | |
| }, | |
| { | |
| "text": "[9] write and parse task-dependent semantic grammars. Finally, a project is going on at CMU to integrate the parser/compiler with a speech recognition system (SPHINX [3] ).", | |
| "cite_spans": [ | |
| { | |
| "start": 166, | |
| "end": 169, | |
| "text": "[3]", | |
| "ref_id": "BIBREF2" | |
| } | |
| ], | |
| "ref_spans": [], | |
| "eq_spans": [], | |
| "section": "Some of the important features of the Generalized", | |
| "sec_num": null | |
| } | |
| ], | |
| "back_matter": [], | |
| "bib_entries": { | |
| "BIBREF0": { | |
| "ref_id": "b0", | |
| "title": "A Development Environment for Unification-Based Grammars", | |
| "authors": [ | |
| { | |
| "first": "L", | |
| "middle": [], | |
| "last": "Karttunen", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "", | |
| "middle": [], | |
| "last": "D-Path", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1986, | |
| "venue": "12th International Conference on Computational Linguistics", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Karttunen, L. D-PATH: A Development Environment for Unification-Based Grammars. In 12th International Conference on Computational Linguistics. Bonn, 1986.", | |
| "links": null | |
| }, | |
| "BIBREF2": { | |
| "ref_id": "b2", | |
| "title": "Large-Vocabulary Speaker-Independent Continuous Speech Recognition", | |
| "authors": [ | |
| { | |
| "first": "K", | |
| "middle": [ | |
| "F" | |
| ], | |
| "last": "Lee", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "H", | |
| "middle": [ | |
| "W" | |
| ], | |
| "last": "Hon", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1988, | |
| "venue": "Proceedings of IEEE Int'l Conf. on Acoustics, Speech and Signal Processing", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Lee, K. F. and Hon, H. W. Large-Vocabulary Speaker-Independent Continuous Speech Recognition. Proceedings of IEEE Int'l Conf. on Acoustics, Speech and Signal Processing, 1988.", | |
| "links": null | |
| }, | |
| "BIBREF3": { | |
| "ref_id": "b3", | |
| "title": "The Design of a Computer Language for Linguistic Information", | |
| "authors": [ | |
| { | |
| "first": "S", | |
| "middle": [ | |
| "M" | |
| ], | |
| "last": "Shieber", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1984, | |
| "venue": "lOth International Conference on Computational Linguistics", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "362--366", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Shieber, S. M. The Design of a Computer Language for Linguistic Information. In lOth International Conference on Computational Linguistics, pages 362-366. Stanford, July, 1984.", | |
| "links": null | |
| }, | |
| "BIBREF4": { | |
| "ref_id": "b4", | |
| "title": "CSLI Lecture Notes: An Introduction to Unification Approaches to Grammar. Center for the Study of Language and Information", | |
| "authors": [ | |
| { | |
| "first": "S", | |
| "middle": [ | |
| "M" | |
| ], | |
| "last": "Shieber", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1986, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Shieber, S. M. CSLI Lecture Notes: An Introduction to Unification Approaches to Grammar. Center for the Study of Language and Information, 1986.", | |
| "links": null | |
| }, | |
| "BIBREF5": { | |
| "ref_id": "b5", | |
| "title": "Efficient Parsing for Natural Language", | |
| "authors": [ | |
| { | |
| "first": "M", | |
| "middle": [], | |
| "last": "Tomita", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1985, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Tomita, M. Efficient Parsing for Natural Language. Kluwer Academic Publishers, Boston, MA, 1985.", | |
| "links": null | |
| }, | |
| "BIBREF6": { | |
| "ref_id": "b6", | |
| "title": "An Efficient Augmented-Context-Free Parsing Algorithm", | |
| "authors": [ | |
| { | |
| "first": "M", | |
| "middle": [], | |
| "last": "Tomita", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1987, | |
| "venue": "Computational Linguistics", | |
| "volume": "13", | |
| "issue": "1-2", | |
| "pages": "31--46", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Tomita, M. An Efficient Augmented-Context-Free Parsing Algorithm. Computational Linguistics 13(1-2):31-46, January=June, 1987.", | |
| "links": null | |
| }, | |
| "BIBREF7": { | |
| "ref_id": "b7", | |
| "title": "Linguistic Sentences and Real Sentences", | |
| "authors": [ | |
| { | |
| "first": "M", | |
| "middle": [], | |
| "last": "Tomita", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1988, | |
| "venue": "12th International Conference on Computational Linguistics", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Tomita, M. Linguistic Sentences and Real Sentences. 12th International Conference on Computational Linguistics, 1988.", | |
| "links": null | |
| }, | |
| "BIBREF8": { | |
| "ref_id": "b8", | |
| "title": "The Generalized LR Parser~Compiler: User's Guide", | |
| "authors": [ | |
| { | |
| "first": "M", | |
| "middle": [], | |
| "last": "Tomita", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "T", | |
| "middle": [], | |
| "last": "Mitamura", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "M", | |
| "middle": [], | |
| "last": "Kee", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": null, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Tomita, M., Mitamura, T. and Kee, M. The Generalized LR Parser~Compiler: User's Guide.", | |
| "links": null | |
| }, | |
| "BIBREF9": { | |
| "ref_id": "b9", | |
| "title": "Pseudo Unification and Full Unification", | |
| "authors": [ | |
| { | |
| "first": "M", | |
| "middle": [], | |
| "last": "Tomita", | |
| "suffix": "" | |
| }, | |
| { | |
| "first": "K", | |
| "middle": [], | |
| "last": "Knight", | |
| "suffix": "" | |
| } | |
| ], | |
| "year": 1988, | |
| "venue": "", | |
| "volume": "", | |
| "issue": "", | |
| "pages": "", | |
| "other_ids": {}, | |
| "num": null, | |
| "urls": [], | |
| "raw_text": "Tomita, M. and Knight, K. Pseudo Unification and Full Unification. Technical Report unpublished, Center for Machine Translation, Carnegie-Mellon University, 1988.", | |
| "links": null | |
| } | |
| }, | |
| "ref_entries": { | |
| "FIGREF0": { | |
| "type_str": "figure", | |
| "uris": null, | |
| "num": null, | |
| "text": "x2 :time) = present) ((xl agr) = (x2 agr))) (((x2 :time = past))) (x0 = x2) ((x0 subj) = xl) ((x0 passive) = -))) Figure 1-1 : A Grammar Rule for Parsing in the left hand side (here, <DEC>) and xn is the n-th non-terminal in the right hand side (here, xl represents <NP> and x2 represents <vP>). The pseudo equations are used to check certain attribute values, such as verb form and person agreement, and" | |
| }, | |
| "FIGREF1": { | |
| "type_str": "figure", | |
| "uris": null, | |
| "num": null, | |
| "text": "3.15. Negative Value, *NOT* (*NOT* valval...) Unification of two negative values is set union. For example, (unify ' (*NOT* a b c d) \" (*NOT* b d e f)) is (*NOT* a b c d e f). 3.16. Multiple Values, *MULTIPLE* (*MULTIPLE* valval...) Unification of two multiple values is append. When unified with a value, each element is unified with a value. For example, (unify ' (*MULTIPLE* a b c d b d e f) \"d) is (*MULTIPLE* d d)." | |
| }, | |
| "TABREF0": { | |
| "html": null, | |
| "type_str": "table", | |
| "num": null, | |
| "text": "Get a value from path, unify it with val, and assign the unified value back to path. If the unification fails, this equation fails. If the value of path is undefined, this equation behaves like a simple assignment. If path val to the slot path. If path1 is already defined, the old value is simply overwritten.", | |
| "content": "<table><tr><td>There are three top-level functions:</td></tr><tr><td>; to compile a grammar</td></tr><tr><td>(compgra grammar-file-name)</td></tr><tr><td>; to load a compiled grammar</td></tr><tr><td>(loadgra grammar-file-name)</td></tr><tr><td>; to parse a sentence string</td></tr><tr><td>(p sentence)</td></tr><tr><td>3. Pseudo Equations</td></tr><tr><td>This section describes pseudo equations for the</td></tr><tr><td>Generalized LR Parser/Compiler V8-4.</td></tr><tr><td>3.1. Pseudo Unification, =</td></tr><tr><td>path = val</td></tr><tr><td>has a value, then this equation behaves like a test</td></tr><tr><td>statement.</td></tr><tr><td>path I = path2</td></tr><tr><td>Get values from path1 and path2, unify them, and</td></tr><tr><td>assign the unified Assign</td></tr></table>" | |
| }, | |
| "TABREF1": { | |
| "html": null, | |
| "type_str": "table", | |
| "num": null, | |
| "text": "The value of path2 should be a multiple value. The first element of the multiple value is popped off, and assign the value to path1. If path1 already has a value, unify the new value with the old value. If path2 is undefined, this equation fails. Check if the value of path is defined. If undefined, then this equation fails. If defined, do nothing. 3.7. Constraint Equations, =c path =c val This equation is the same as an equation path = val except if path is not already defined, it fails. 3.8. Removing Values, *REMOVE* path = * REMOVE* This equation removes the value in path, and the path becomes undefined. All lists of equations are evaluated disjunctively. This is an inclusive OR, as oppose to exclusive OR; Even if one of the lists of equations is evaluated successfully, the rest of lists will be also evaluated anyway. The *INTERPRET* statement first gets a value from path. The value of path must be a valid list of ]he lisp.function-call is evaluated, and if the function returns nil, it falls. If the function returns a non-nil value, do nothing. A path can be used as special function that returns a value of the slot.", | |
| "content": "<table><tr><td/><td colspan=\"4\">3.13. Recurslve Evaluation of Equations,</td></tr><tr><td/><td colspan=\"3\">*INTERPRET*</td></tr><tr><td/><td colspan=\"2\">(*INTERPRET</td><td>path)</td></tr><tr><td/><td>equations.</td><td colspan=\"3\">Those equations are then recursively</td></tr><tr><td/><td colspan=\"4\">evaluated. This *INTERPRET* statement resembles</td></tr><tr><td/><td colspan=\"3\">the \"eval\" function in Lisp.</td></tr><tr><td>3.9. Disjunctive Equations, *OR*</td><td/><td/><td/></tr><tr><td>(*OR* list-of-equations list-of-equations .... )</td><td colspan=\"3\">3.14. Disjunctive Value, *OR* (*OR* valval...)</td></tr><tr><td/><td colspan=\"4\">Unification of two disjunctive values is set interaction.</td></tr><tr><td/><td colspan=\"2\">For example, (unify</td><td>' (*OR*</td><td>a b c d)</td><td>' (*OR*</td></tr><tr><td/><td colspan=\"3\">b d e f))is (*OR* b d).</td></tr><tr><td>3.1 1. Case Statement, *CASE*</td><td/><td/><td/></tr><tr><td>(*CASE* path</td><td/><td/><td/></tr><tr><td>(key1 equation1-1 equation1-2 ...)</td><td/><td/><td/></tr><tr><td>( Key2 equation2-1 ... )</td><td/><td/><td/></tr><tr><td>( Key3 equation3-1) .... )</td><td/><td/><td/></tr><tr><td>rest of</td><td/><td/><td/></tr><tr><td>equations are evaluated.</td><td/><td/><td/></tr><tr><td>3.12. Test with an User-defined LISP Function, *TEST*</td><td colspan=\"4\">3.6. *DEFINED* and *UNDEFINED* path= *DEFINED*</td></tr><tr><td>(*TEST* lisp-function-carl)</td><td/><td/><td/></tr></table>" | |
| }, | |
| "TABREF2": { | |
| "html": null, | |
| "type_str": "table", | |
| "num": null, | |
| "text": "", | |
| "content": "<table><tr><td colspan=\"2\">* user-defined*</td><td/><td/><td/></tr><tr><td colspan=\"5\">The user can define his own special values. An</td></tr><tr><td>unification</td><td>function</td><td>with</td><td>the</td><td>name</td></tr><tr><td colspan=\"5\">UNIFY*user-defined* must be defined. The function</td></tr><tr><td colspan=\"5\">should take two arguments, and returns a new value</td></tr><tr><td colspan=\"3\">or *FAIL* if the unification fails.</td><td/><td/></tr></table>" | |
| } | |
| } | |
| } | |
| } |