Probabilistic Models for High-Order Projective Dependency Parsing
원문 초록
This paper presents generalized probabilistic models for high-order projective dependency parsing and an algorithmic framework for learning these statistical models involving dependency trees. Partition functions and marginals for high-order dependency trees can be computed efficiently, by adapting our algorithms which extend the inside-outside algorithm to higher-order cases. To show the effectiveness of our algorithms, we perform experiments on three languages---English, Chinese and Czech, using maximum conditional likelihood estimation for model training and L-BFGS for parameter estimation. Our methods achieve competitive performance for English, and outperform all previously reported dependency parsers for Chinese and Czech.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Analytic estimation of parameters of stochastic volatility diffusion models with exponential-affine characteristic function for currency option pricing
A Simple Approximate Bayesian Inference Neural Surrogate for Stochastic Petri Net Models
Robust Spatiotemporal Epidemic Modeling with Integrated Adaptive Outlier Detection
IMC-PINN-FE: A Physics-Informed Neural Network for Patient-Specific Left Ventricular Finite Element Modeling with Image Motion Consistency and Biomechanical Parameter Estimation
Adjustment for Confounding using Pre-Trained Representations
Imaging at the quantum limit with convolutional neural networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.