ACL RD-TEC 1.0 Summarization of P99-1059

Paper Title:
EFFICIENT PARSING FOR BILEXICAL CONTEXT-FREE GRAMMARS AND HEAD AUTOMATON GRAMMARS

Authors: Jason Eisner and Giorgio Satta

Other assigned terms:

  • affixation
  • ambiguity
  • approach
  • automata
  • binary relation
  • case
  • categorial grammar
  • chomsky normal form
  • community
  • context-free grammar
  • context-free grammars
  • data structure
  • dependency relationship
  • derivation
  • derivation tree
  • derivations
  • distribution
  • finite set
  • formal language
  • formalism
  • formalisms
  • grammar
  • grammar formalism
  • grammar formalisms
  • grammars
  • grapheme
  • head automaton grammar
  • implementation
  • inference rules
  • input string
  • lexical head
  • lexicalized grammar
  • linguistics
  • mapping
  • maps
  • markov chain
  • mechanisms
  • method
  • morpheme
  • natural language
  • natural-language
  • nonterminal
  • nonterminals
  • normal form
  • pairs of words
  • parse
  • parse table
  • parse tree
  • parsing accuracy
  • parsing problem
  • probabilities
  • probability
  • probability distribution
  • reflexive and transitive closure
  • relation
  • rewrite rules
  • runtime
  • selectional restrictions
  • senses of a word
  • sentence
  • subcategorization frames
  • substring
  • symbol
  • symbols
  • technique
  • technology
  • term
  • terms
  • time complexity
  • transition probabilities
  • transitive closure
  • tree
  • tree adjoining grammars
  • typographical errors
  • vocabulary
  • word
  • word senses
  • word type
  • words

Extracted Section Types:


This page last edited on 10 May 2017.

*** ***