Dependency parsing with dynamic Bayesian network

  • Authors:
  • Virginia Savova;Leonid Peshkin

  • Affiliations:
  • Department of Cognitive Science, Johns Hopkins University, Baltimore, MD;Department of Systems Biology, Harvard Medical School, Boston, MA

  • Venue:
  • AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Exact parsing with finite state automata is deemed in-apropriate because of the unbounded non-locality languages overwhelmingly exhibit. We propose a way to structure the parsing task in order to make it amenable to local classification methods. This allows us to build a Dynamic Bayesian Network which uncovers the syntactic dependency structure of English sentences. Experiments with the Wall Street Journal demonstrate that the model successfully learns from labeled data.