ACL RD-TEC 1.0 Summarization of P94-1022

Paper Title:
CAPTURING CFLS WITH TREE ADJOINING GRAMMARS

Other assigned terms:

  • adjunction
  • alphabet
  • anchor
  • approach
  • automata
  • auxiliary tree
  • case
  • concept
  • context-free grammars
  • context-free language
  • context-free languages
  • cubic time
  • derivation
  • derivation trees
  • derivations
  • elementary tree
  • empty string
  • fact
  • finite alphabet
  • finite set
  • formalism
  • grammar
  • grammar formalism
  • grammars
  • hypothesis
  • induction hypothesis
  • input string
  • leaf
  • lemma
  • lexical item
  • lexicalized grammar
  • lexicon
  • linguistic
  • linguistic structures
  • ltag grammar
  • ltags
  • mechanisms
  • method
  • normal form
  • procedure
  • process
  • projection
  • proposition
  • segments
  • substitution grammar
  • subtree
  • subtrees
  • symbol
  • symbols
  • syntactic structure
  • tag formalism
  • tags
  • terminals
  • theories
  • tree
  • tree adjoining grammars
  • tree automata
  • tree automaton
  • tree substitution grammar
  • trees
  • vertex

Extracted Section Types:


This page last edited on 10 May 2017.

*** ***