Parsing and Generating English Using Commutative Transformations
This paper is about an implemented natural language interface that translates from English into semantic net relations and from semantic net relations back into English. The parser and companion generator were implemented for two reasons: (a) to enable experimental work in support of a theory...
| Main Authors: | , |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/5660 |
| _version_ | 1826204984495046656 |
|---|---|
| author | Katz, Boris Winston, Patrick H. |
| author_facet | Katz, Boris Winston, Patrick H. |
| author_sort | Katz, Boris |
| collection | MIT |
| description | This paper is about an implemented natural language interface that translates from English into semantic net relations and from semantic net relations back into English. The parser and companion generator were implemented for two reasons: (a) to enable experimental work in support of a theory of learning by analogy; (b) to demonstrate the viability of a theory of parsing and generation built on commutative transformations. The learning theory was shaped to a great degree by experiments that would have been extraordinarily tedious to perform without the English interface with which the experimental data base was prepared, revise, and revised again. Inasmuch as current work on the learning theory is moving toward a tenfold increase in data-base size, the English interface is moving from a facilitating role to an enabling one. The parsing and generation theory has two particularly important features: (a) the same grammar is used for both parsing and generation; (b) the transformations of the grammar are commutative. The language generation procedure converts a semantic network fragment into kernel frames, chooses the set of transformations that should be performed upon each frame, executes the specified transformations, combines the altered kernels into a sentence, performs a pronominalization process, and finally produces the appropriate English word string. Parsing is essentially the reverse of generation. The first step in the parsing process is splitting a given sentence into a set of kernel clauses along with a description of how those clauses hierarchically related to each other. The clauses are hierarchically related to each other. The clauses are used to produce a matrix embedded kernel frames, which in turn supply arguments to relation-creating functions. The evaluation of the relation-creating functions results in the construction of the semantic net fragments. |
| first_indexed | 2024-09-23T13:05:14Z |
| id | mit-1721.1/5660 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:05:14Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/56602019-04-10T18:27:50Z Parsing and Generating English Using Commutative Transformations Katz, Boris Winston, Patrick H. parsing generation natural language semantic networks scommutative transformations language understanding This paper is about an implemented natural language interface that translates from English into semantic net relations and from semantic net relations back into English. The parser and companion generator were implemented for two reasons: (a) to enable experimental work in support of a theory of learning by analogy; (b) to demonstrate the viability of a theory of parsing and generation built on commutative transformations. The learning theory was shaped to a great degree by experiments that would have been extraordinarily tedious to perform without the English interface with which the experimental data base was prepared, revise, and revised again. Inasmuch as current work on the learning theory is moving toward a tenfold increase in data-base size, the English interface is moving from a facilitating role to an enabling one. The parsing and generation theory has two particularly important features: (a) the same grammar is used for both parsing and generation; (b) the transformations of the grammar are commutative. The language generation procedure converts a semantic network fragment into kernel frames, chooses the set of transformations that should be performed upon each frame, executes the specified transformations, combines the altered kernels into a sentence, performs a pronominalization process, and finally produces the appropriate English word string. Parsing is essentially the reverse of generation. The first step in the parsing process is splitting a given sentence into a set of kernel clauses along with a description of how those clauses hierarchically related to each other. The clauses are hierarchically related to each other. The clauses are used to produce a matrix embedded kernel frames, which in turn supply arguments to relation-creating functions. The evaluation of the relation-creating functions results in the construction of the semantic net fragments. 2004-10-01T20:18:37Z 2004-10-01T20:18:37Z 1982-05-01 AIM-677 http://hdl.handle.net/1721.1/5660 en_US AIM-677 18 p. 6708731 bytes 988377 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | parsing generation natural language semantic networks scommutative transformations language understanding Katz, Boris Winston, Patrick H. Parsing and Generating English Using Commutative Transformations |
| title | Parsing and Generating English Using Commutative Transformations |
| title_full | Parsing and Generating English Using Commutative Transformations |
| title_fullStr | Parsing and Generating English Using Commutative Transformations |
| title_full_unstemmed | Parsing and Generating English Using Commutative Transformations |
| title_short | Parsing and Generating English Using Commutative Transformations |
| title_sort | parsing and generating english using commutative transformations |
| topic | parsing generation natural language semantic networks scommutative transformations language understanding |
| url | http://hdl.handle.net/1721.1/5660 |
| work_keys_str_mv | AT katzboris parsingandgeneratingenglishusingcommutativetransformations AT winstonpatrickh parsingandgeneratingenglishusingcommutativetransformations |