menu
{ "item_title" : "A Descriptive Approach to Language-Theoretic Complexity", "item_author" : [" James Rogers "], "item_description" : "Early formal specifications of natural language syntax were quite closely connected to the notion of abstract machines for computing them. More recently, this approach has been superseded by one in which languages are specified in terms of systems of constraints on the structure of their sentences. This has made complexity results difficult to obtain. This book introduces a way of obtaining such results. It presents a natural and quite general means of expressing constraints on the structure of trees and shows that the languages that can be specified by systems of such constraints are exactly those computable by a particular standard class of abstract machines. Thus the difficulty of processing a construction can be reduced to the difficulty of expressing the constraints that specify it.", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/1/57/586/137/1575861372_b.jpg", "price_data" : { "retail_price" : "59.95", "online_price" : "59.95", "our_price" : "59.95", "club_price" : "59.95", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
A Descriptive Approach to Language-Theoretic Complexity|James Rogers

A Descriptive Approach to Language-Theoretic Complexity

local_shippingShip to Me
On Order. Usually ships in 2-4 weeks
FREE Shipping for Club Members help

Overview

Early formal specifications of natural language syntax were quite closely connected to the notion of abstract machines for computing them. More recently, this approach has been superseded by one in which languages are specified in terms of systems of constraints on the structure of their sentences. This has made complexity results difficult to obtain. This book introduces a way of obtaining such results. It presents a natural and quite general means of expressing constraints on the structure of trees and shows that the languages that can be specified by systems of such constraints are exactly those computable by a particular standard class of abstract machines. Thus the difficulty of processing a construction can be reduced to the difficulty of expressing the constraints that specify it.

This item is Non-Returnable

Details

  • ISBN-13: 9781575861371
  • ISBN-10: 1575861372
  • Publisher: Center for the Study of Language and Informat
  • Publish Date: January 1999
  • Page Count: 216

Related Categories

You May Also Like...

    1

BAM Customer Reviews