Sciweavers

3630 search results - page 14 / 726
» How to Compare Treebanks
Sort
View
NIPS
2007
14 years 11 months ago
Discriminative Log-Linear Grammars with Latent Variables
We demonstrate that log-linear grammars with latent variables can be practically trained using discriminative methods. Central to efficient discriminative training is a hierarchi...
Slav Petrov, Dan Klein
TSD
2007
Springer
15 years 3 months ago
Accurate Unlexicalized Parsing for Modern Hebrew
Many state-of-the-art statistical parsers for English can be viewed as Probabilistic Context-Free Grammars (PCFGs) acquired from treebanks consisting of phrase-structure trees enri...
Reut Tsarfaty, Khalil Sima'an
LREC
2008
180views Education» more  LREC 2008»
14 years 11 months ago
Do we Still Need Gold Standards for Evaluation?
The availability of a huge mass of textual data in electronic format has increased the need for fast and accurate techniques for textual data processing. Machine learning and stat...
Thierry Poibeau, Cédric Messiant
CVPR
2000
IEEE
15 years 11 months ago
Learning in Gibbsian Fields: How Accurate and How Fast Can It Be?
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
Song Chun Zhu, Xiuwen Liu
COLING
2010
14 years 4 months ago
A comparison of unsupervised methods for Part-of-Speech Tagging in Chinese
We conduct a series of Part-of-Speech (POS) Tagging experiments using Expectation Maximization (EM), Variational Bayes (VB) and Gibbs Sampling (GS) against the Chinese Penn Treeba...
Alex Cheng, Fei Xia, Jianfeng Gao