| 书目名称 | The Formal Complexity of Natural Language | | 编辑 | Walter J. Savitch,Emmon Bach,Gila Safran-Naveh | | 视频video | | | 丛书名称 | Studies in Linguistics and Philosophy | | 图书封面 |  | | 描述 | Ever since Chomsky laid the framework for a mathematically formal theory of syntax, two classes of formal models have held wide appeal. The finite state model offered simplicity. At the opposite extreme numerous very powerful models, most notable transformational grammar, offered generality. As soon as this mathematical framework was laid, devastating arguments were given by Chomsky and others indicating that the finite state model was woefully inadequate for the syntax of natural language. In response, the completely general transformational grammar model was advanced as a suitable vehicle for capturing the description of natural language syntax. While transformational grammar seems likely to be adequate to the task, many researchers have advanced the argument that it is "too adequate. " A now classic result of Peters and Ritchie shows that the model of transformational grammar given in Chomsky‘s Aspects [IJ is powerful indeed. So powerful as to allow it to describe any recursively enumerable set. In other words it can describe the syntax of any language that is describable by any algorithmic process whatsoever. This situation led many researchers to reasses the claim that natural | | 出版日期 | Book 1987 | | 关键词 | Prolog; Syntax; complexity; formal logic; grammar; linguistics; natural language | | 版次 | 1 | | doi | https://doi.org/10.1007/978-94-009-3401-6 | | isbn_softcover | 978-1-55608-047-0 | | isbn_ebook | 978-94-009-3401-6Series ISSN 0924-4662 Series E-ISSN 2215-034X | | issn_series | 0924-4662 | | copyright | D. Reidel Publishing Company, Dordrecht, Holland 1987 |
The information of publication is updating
|
|
发表于 2025-3-21 20:07:53
