66 search results - page 7 / 14 » An Optimal Tabular Parsing Algorithm |
ACL
2010
13 years 4 months ago
2010
Hierarchical A (HA) uses of a hierarchy of coarse grammars to speed up parsing without sacrificing optimality. HA prioritizes search in refined grammars using Viterbi outside cost...
IJCNLP
2005
Springer
14 years 6 days ago
2005
Springer
Abstract. We build a class-based selection preference sub-model to incorporate external semantic knowledge from two Chinese electronic semantic dictionaries. This sub-model is comb...
ICCV
2011
IEEE
12 years 6 months ago
2011
IEEE
In this paper, we present an event parsing algorithm based on Stochastic Context Sensitive Grammar (SCSG) for understanding events, inferring the goal of agents, and predicting th...
DCC
2004
IEEE
14 years 6 months ago
2004
IEEE
In the discrete filtering problem, a data sequence over a finite alphabet is assumed to be corrupted by a discrete memoryless channel. The goal is to reconstruct the clean sequenc...
NAACL
2003
13 years 8 months ago
2003
Conditional random fields for sequence labeling offer advantages over both generative models like HMMs and classifiers applied at each sequence position. Among sequence labeling...