Syntactic codes and grammar refinement | Zendy

Marcus Kracht | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Syntactic codes and grammar refinement

Author(s) -

Marcus Kracht

Publication year - 1995

Publication title -

journal of logic language and information

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.252

H-Index - 30

eISSN - 1572-9583

pISSN - 0925-8531

DOI - 10.1007/bf01048404

Subject(s) - grammar , computer science , constraint (computer aided design) , rule based machine translation , tree adjoining grammar , natural language processing , coding (social sciences) , parsing , artificial intelligence , generative grammar , fragment (logic) , l attributed grammar , context free grammar , linguistics , programming language , theoretical computer science , mathematics , philosophy , statistics , geometry

We call syntactic coding a technique which converts syntactic principles or constraints on representations into grammatical rules which can be implemented in any given rule grammar. In this paper we show that any principle or constraint on output trees formalizable in a certain fragment of dynamic logic over trees can be coded in this sense. This allows to reduce in a mechan- ical fashion most of the current theories of government and binding into gpsg-style grammars. This will be exemplified with Rizzi's Relativized Minimality.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research