STRING ADJUNCT GRAMMARS.

Abstract

A new style of formal grammars called String Adjunct Grammars(AG) is introduced. Briefly an AG consists of a finite alphabet, a finite set of strings on this alphabet and a finite set of adjunction rules which state how certain adjunct strings are adjoined to certain host strings. The corresponding language called a String Adjunct Language (AL) is then defined as the set of all strings derived from a certain specified subset of the given set of finite strings. The rules in an AG have a considerably different formal character as compared to the rewrite rule in a general phrase structure grammar(PSG). The language hierarchies of AG's and PSG's cut across in many interesting ways. (Author)

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1969
Accession Number
AD0697148

Entities

People

  • A. K. Joshi
  • H. Yamada
  • S. R. Kosaraju

Organizations

  • University of Pennsylvania

Tags

DTIC Thesaurus Topics

  • Alphabets
  • Finite Alphabet
  • Grammars
  • Hierarchies
  • Language
  • Linguistics
  • Nomenclature
  • Personality
  • Phrase Structure Grammars
  • Words (Language)

Readers

  • Computational Linguistics
  • Graph Algorithms and Convex Optimization.
  • Materials Science and Engineering.