Name: Two-Step Approaches to Natural Language Formalism (Studies in Generative Grammar) (Studies in Generative Grammar [Sgg]) (en Inglés)
SKU: 3214565
Price: 1791.92 MXN
Availability: InStock
Author: Frank Morawietz
ISBN: 9783110178210

portada Two-Step Approaches to Natural Language Formalism (Studies in Generative Grammar) (Studies in Generative Grammar [Sgg]) (en Inglés)

Two-Step Approaches to Natural Language Formalism (Studies in Generative Grammar) (Studies in Generative Grammar [Sgg]) (en Inglés)

Formato

Libro Físico

Editorial

De Gruyter Mouton

Autor

Frank Morawietz

Año

2003

Idioma

Inglés

N° páginas

264

Encuadernación

Tapa Dura

Peso

1.15

ISBN

9783110178210

ISBN13

9783110178210

N° edición

2013

Categorías

Aprendizaje de idiomas: gramática, vocabulario y pronunciación

Two-Step Approaches to Natural Language Formalism (Studies in Generative Grammar) (Studies in Generative Grammar [Sgg]) (en Inglés)

Frank Morawietz (Autor) · De Gruyter Mouton · Tapa Dura

Libro Nuevo Importado

Envío: 23 a 28 días háb.

$ 3,583.83$ 1,791.92

-50%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 50 unidades

$ 1,791.92

¡Envío Gratis! Llega entre el 05 Oct y el 13 Oct a CUAUHTÉMOC, Ciudad de México. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Two-Step Approaches to Natural Language Formalism (Studies in Generative Grammar) (Studies in Generative Grammar [Sgg]) (en Inglés)"

This book presents a unified formal approach to various contemporary linguistic formalisms such as Government & Binding, Minimalism or Tree Adjoining Grammar. Through a careful introduction of mathematical techniques from logic, automata theory and universal algebra, the book aims at graduate students and researchers who want to learn more about tightly constrained logical approaches to natural language syntax. Therefore it features a complete and well illustrated introduction to the connection between declarative approaches formalized in monadic second-order logic (MSO) and generative ones formalized in various forms of automata as well as of tree grammars. Since MSO logic (on trees) yields only context-free languages, and at least the last two of the formalisms mentioned above clearly belong to the class of mildly context-sensitive formalisms, it becomes necessary to deal with the problem of the descriptive complexity of the formalisms involved in another way. The proposed genuinely new two-step approach overcomes this limitation of MSO logic while still retaining the desired tightly controlled formal properties.