Search
Now showing items 1-6 of 6
GPSG-Recognition is NP-Hard
(1985-03-01)
Proponents of generalized phrase structure grammar (GPSG) cite its weak context-free generative power as proof of the computational tractability of GPSG-Recognition. Since context-free languages (CFLs) can be parsed ...
Causal/Temporal Connectives: Syntax and Lexicon
(1989-09-01)
This report elucidates the linguistic representation of temporal relations among events. This involves examining sentences that contain two clauses connected by words like once, by the time, when, and before. Specifically, ...
A Three-Step Procedure for Language Generation
(1980-12-01)
This paper outlines a three-step plan for generating English text from any semantic representation by applying a set of syntactic transformations to a collection of kernel sentences. The paper focuses on describing a ...
Parsing and Generating English Using Commutative Transformations
(1982-05-01)
This paper is about an implemented natural language interface that translates from English into semantic net relations and from semantic net relations back into English. The parser and companion generator were implemented ...
Complexity of Human Language Comprehension
(1988-12-01)
The goal of this article is to reveal the computational structure of modern principle-and-parameter (Chomskian) linguistic theories: what computational problems do these informal theories pose, and what is the underlying ...
Computational Structure of GPSG Models: Revised Generalized Phrase Structure Grammar
(1989-09-01)
The primary goal of this report is to demonstrate how considerations from computational complexity theory can inform grammatical theorizing. To this end, generalized phrase structure grammar (GPSG) linguistic theory ...