October 1991 | Daniel D. K. Sleator * Davy Temperley †
The paper introduces a formal grammatical system called *link grammar* and demonstrates how English grammar can be encoded within this system. The authors present algorithms for efficient parsing using link grammars and discuss the practical and linguistic significance of their approach. They have developed a program for general link parsing and created a link grammar for English, which captures a wide range of English phenomena and is computationally efficient. The program, written in C, is available online. The paper also explores the limitations and challenges of the system, particularly in handling complex linguistic phenomena such as coordination and non-referential uses of pronouns. Despite these limitations, the authors argue that the link grammar system offers a promising approach for natural language processing.The paper introduces a formal grammatical system called *link grammar* and demonstrates how English grammar can be encoded within this system. The authors present algorithms for efficient parsing using link grammars and discuss the practical and linguistic significance of their approach. They have developed a program for general link parsing and created a link grammar for English, which captures a wide range of English phenomena and is computationally efficient. The program, written in C, is available online. The paper also explores the limitations and challenges of the system, particularly in handling complex linguistic phenomena such as coordination and non-referential uses of pronouns. Despite these limitations, the authors argue that the link grammar system offers a promising approach for natural language processing.