ACL RD-TEC 1.0 Summarization of P86-1006

Paper Title:
COMPUTATIONAL COMPLEXITY OF CURRENT GPSG THEORY

Other assigned terms:

  • ambiguity
  • automata
  • binary tree
  • case
  • closure restriction
  • co-occurrence
  • computational complexity
  • context-free grammar
  • context-free languages
  • derivation
  • design and implementation
  • empty string
  • exponential time
  • fact
  • feature
  • feature convention
  • feature set
  • formal language
  • formalism
  • formalisms
  • grammar
  • grammars
  • grammatical formalism
  • id rules
  • implementation
  • input string
  • intractability
  • labeling
  • leaf
  • lexical entries
  • linguistic
  • linguistic competence
  • linguistic theory
  • linguistics
  • mapping
  • meaning
  • metarules
  • methodology
  • natural language
  • nouns
  • parsing problem
  • phrase
  • phrase structure
  • phrase structure grammar
  • phrase structure trees
  • polynomial time
  • predicates
  • process
  • quantifier
  • query
  • relation
  • right-hand side
  • salesman problem
  • subtree
  • subtrees
  • symbol
  • symbols
  • syntactic categories
  • syntactic category
  • syntactic features
  • syntactic information
  • terms
  • theorem
  • theory
  • tree
  • tree adjoining grammars
  • trees
  • turing machine
  • unbounded dependency
  • understanding

Extracted Section Types:


This page last edited on 10 May 2017.

*** ***