derrierloisirs.fr
» » The Formal Complexity of Natural Language (Studies in Linguistics and Philosophy)

Download The Formal Complexity of Natural Language (Studies in Linguistics and Philosophy) ePub

by W.J. Savitch,E. Bach,W.E. Marsh,Gila Safran-Naveh

Download The Formal Complexity of Natural Language (Studies in Linguistics and Philosophy) ePub
  • ISBN 1556080468
  • ISBN13 978-1556080463
  • Language English
  • Author W.J. Savitch,E. Bach,W.E. Marsh,Gila Safran-Naveh
  • Publisher Springer; 1987 edition (October 31, 1987)
  • Pages 452
  • Formats azw docx mbr lrf
  • Category Technology
  • Subcategory Computer Science
  • Size ePub 1534 kb
  • Size Fb2 1939 kb
  • Rating: 4.8
  • Votes: 521

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.

A. Manaster-Ramer in Computational Linguistics, 14:4 (December 1988). Series: Studies in Linguistics and Philosophy (Book 33).

They have also done much to foster the dissemination and the comprehension of formal complexity results in liguistics and to encourage accuracy and lucidity in the formulation, presentation, and interpretation of such results. A.

Studies in Linguistics and Philosophy. Bibliographic Information. They have also done much to foster the dissemination and the comprehension of formal complexity results in liguistics and to encourage accuracy and lucidity in the formulation, presentation, and interpretation of such results.

Savitch; E. Bach; .

Walter J. Savitch, E. Bach, W. E. Marsh. 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.

by Ana Deumert, Stephanie Durrleman-Tame.

by Ana Deumert, Stephanie Durrleman-Tame by Melanie Jordt, Thomas Girr, Ines-Karina Weiland by Luo Liming, Qin Yaowu, Lu Zhenyu, Chen Fulong.

Linguistics and Philosophy 4(4):471-504

Linguistics and Philosophy 4(4):471-504. df file ). Geoffrey K. Pullum.

To provide some details, Cleopatra's parsing is "lex-ically driven" in that "each word in the input sentence invokes procedures that direct the parsing process". Samad observes that "we can invoke any arbitrary function when evaluating a constraint". This aside, the introductory passages are on the whole quite informative and accurate.

Similar books and articles. Ian Pratt-Hartmann & Allan Third - 2006 - Notre Dame Journal of Formal Logic 47 (2):151-177. Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250. Presenting the Formal Theory of Hierarchical Complexity. Michael Lamport Commons & Alexander Pekker - 2008 - World Futures 64 (5-7):375 – 382. Computational Semantics with Functional Programming.

Related to The Formal Complexity of Natural Language (Studies in Linguistics and Philosophy)