Computer Science – Computation and Language
Scientific paper
2007-03-27
In proceedings of American Association for Artificial Intelligence AAAI 2005
Computer Science
Computation and Language
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.
Peshkin Leonid
Savova Virginia
No associations
LandOfFree
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.
Profile ID: LFWR-SCP-O-272417