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 ...
Read More
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 languages are included in the class of transformational grammar languages. The conclu- sion that many reached is that the claim is void of content, since, in their view, it says little more than that natural language syntax is doable algo- rithmically and, in the framework of modern linguistics, psychology or neuroscience, that is axiomatic.
Read Less
Add this copy of The Formal Complexity of Natural Language (Studies in to cart. $68.72, good condition, Sold by Books On The Run rated 4.0 out of 5 stars, ships from Ocala, FL, UNITED STATES, published 1987 by Springer.
Add this copy of The Formal Complexity of Natural Language (Studies in to cart. $93.26, good condition, Sold by Phatpocket Limited rated 4.0 out of 5 stars, ships from Waltham Abbey, ESSEX, UNITED KINGDOM, published 1987 by Springer.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Ships from UK in 48 hours or less (usually same day). Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. May contain underlining and/or highlighting. 100% money back guarantee. We are a world class secondhand bookstore based in Hertfordshire, United Kingdom and specialize in high quality textbooks across an enormous variety of subjects. We aim to provide a vast range of textbooks, rare and collectible books at a great price. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. We provide a 100% money back guarantee and are dedicated to providing our customers with the highest standards of service in the bookselling industry.
Add this copy of The Formal Complexity of Natural Language (Studies in to cart. $151.93, new condition, Sold by GridFreed rated 4.0 out of 5 stars, ships from North Las Vegas, NV, UNITED STATES, published 1987 by Springer.
Add this copy of The Formal Complexity of Natural Language to cart. $159.69, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 1987 by Springer.
Add this copy of The Formal Complexity of Natural Language to cart. $159.69, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 1987 by Springer.
