Dependency Parsing with Dynamic Bayesian Network

Computer Science – Computation and Language

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

6 pages

Scientific paper

Exact parsing with finite state automata is deemed inappropriate 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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Dependency Parsing with Dynamic Bayesian Network does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dependency Parsing with Dynamic Bayesian Network, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dependency Parsing with Dynamic Bayesian Network will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-272417

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.