Technical Reports (CIS)

Document Type

Technical Report

Date of this Version

October 1990

Comments

University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-90-82.

Abstract

We investigate the problem of describing languages compactly in different grammatical formalisms for natural languages. In particular, the problem is studied from the point of view of some newly developed natural language formalisms like linear control grammars (LCGs) and tree adjoining grammars (TAGs); these formalisms not only generate non-context-free languages that capture a wide variety of syntactic phenomena found in natural language, but also have computationally efficient polynomial time recognition algorithms. We prove that the formalisms enjoy the property of unbounded succinctness over the family of context-grammars, i.e. they are, in general, able to provide more compact representations of natural languages as compared to standard context-free grammars.

Share

COinS
 

Date Posted: 15 August 2007