Parsing English with a Link Grammar

Parsing English with a Link Grammar (1991)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Daniel D. Sleator , Davy Temperley

Citations:

313 - 2 self

Versions

Version History

Metadata Version 2

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Parsing English with a Link Grammar	user correction - Legacy Corrections
AUTHOR NAME	Daniel D. Sleator	user correction - Legacy Corrections
AUTHOR AFFIL	School of Computer Science; Carnegie Mellon University	user correction - Legacy Corrections
AUTHOR ADDR	Pittsburgh, PA 15213	user correction - Legacy Corrections
AUTHOR NAME	Davy Temperley	user correction - Legacy Corrections
AUTHOR AFFIL	School of Computer Science; Carnegie Mellon University	user correction - Legacy Corrections
AUTHOR ADDR	Pittsburgh, PA 15213	user correction - Legacy Corrections
ABSTRACT	We define a new formal grammatical system called a link grammar . A sequence of words is in the language of a link grammar if there is a way to draw links between words in such a way that (1) the local requirements of each word are satisfied, (2) the links do not cross, and (3) the words form a connected graph. We have encoded English grammar into such a system, and written a program (based on new algorithms) for efficiently parsing with a link grammar. The formalism is lexical and makes no explicit use of constituents and categories. The breadth of English phenomena that our system handles is quite large. A number of sophisticated and new techniques were used to allow efficient parsing of this very complex grammar. Our program is written in C, and the entire system may be obtained via anonymous ftp. Several other researchers have begun to use link grammars in their own research. 1 Introduction Most sentences of most natural languages have the property that if arcs are drawn connecti...	user correction - Legacy Corrections
YEAR	1991	user correction - Legacy Corrections
CITATIONS	15 found	ParsCit 1.0