ACL RD-TEC 1.0 Summarization of H05-1101

Paper Title:
SOME COMPUTATIONAL COMPLEXITY RESULTS FOR SYNCHRONOUS CONTEXT-FREE GRAMMARS

Authors: Giorgio Satta and Enoch Peserico

Other assigned terms:

  • alphabet
  • annotation
  • approach
  • association for computational linguistics
  • automata
  • binary relation
  • canonical form
  • case
  • computational complexity
  • context-free grammar
  • context-free grammars
  • corpora
  • derivation
  • derivations
  • dictionary
  • distribution
  • document
  • estimation
  • exponential time
  • finite automaton
  • formal grammars
  • formalism
  • formalisms
  • generative capacity
  • grammar
  • grammars
  • ibm models
  • index
  • input string
  • inversion transduction grammars
  • language pairs
  • leftmost derivation
  • lexical material
  • linguistics
  • mapping
  • markov models
  • meaning
  • multilingual document
  • natural language
  • nonterminal
  • nonterminals
  • parallel corpora
  • parse
  • parse tree
  • parsing strategy
  • pcfg
  • permutation
  • polynomial time
  • probabilities
  • probability
  • probability distribution
  • probability distributions
  • process
  • reflexive and transitive closure
  • relation
  • reordering
  • right-hand side
  • search strategy
  • segments
  • sentence
  • source language
  • source sentence
  • substring
  • symbol
  • symbols
  • synchronous context-free grammars
  • target language
  • target languages
  • technology
  • terms
  • theorem
  • theory
  • time complexity
  • topics
  • transitive closure
  • translation model
  • translation models
  • translation pairs
  • translation problem
  • translation schemata
  • translations
  • tree
  • trees
  • word
  • words

Extracted Section Types:


This page last edited on 10 May 2017.

*** ***