ACL RD-TEC 1.0 Summarization of P85-1011

Paper Title:
SOME COMPUTATIONAL PROPERTIES OF TREE ADJOINING GRAMMERS

Authors: K. Vijay-Shankar and Aravind K. Jushi

Other assigned terms:

  • approach
  • array
  • auxiliary tree
  • case
  • computational linguists
  • computational tractability
  • context-free grammar
  • context-free language
  • context-free languages
  • derivations
  • elementary tree
  • grammar
  • grammars
  • grammatical system
  • hypothesis
  • induction hypothesis
  • linguistic
  • linguistic context
  • linguists
  • local constraints
  • names
  • non-terminal symbol
  • parse
  • phrase
  • phrase structure
  • phrase structure grammars
  • polynomial time
  • process
  • relation
  • root node
  • sentence
  • sub-tree
  • subtree
  • subtrees
  • symbol
  • symbols
  • tags
  • technique
  • terminals
  • terms
  • theorem
  • time complexity
  • topics
  • transitive closure
  • tree
  • tree adjoining grammar
  • tree adjoining grammars
  • tree automaton
  • tree structure
  • trees

Extracted Section Types:


This page last edited on 10 May 2017.

*** ***