This book investigates the formal properties and computational applications of tree adjoining grammars (TAGs). It explores the theoretical underpinnings of TAGs, a class of grammar formalisms that have proven effective in capturing the syntactic and semantic complexities of natural language. The work presents a detailed analysis of TAGs, including their generative capacity, parsing algorithms, and their relationship to other formalisms like context-free grammars.

This work is recognized as a foundational text in the study of Tree Adjoining Grammars, offering a comprehensive theoretical treatment. Its detailed exploration of formal properties and computational aspects makes it a valuable resource for researchers and students in theoretical computer science and linguistics. The book is likely to be appreciated for its rigorous approach and its contribution to understanding advanced grammar formalisms.