Sciweavers

182 search results - page 32 / 37
» Context-Free Valence Grammars - Revisited
Sort
View
ACL
2006
13 years 9 months ago
Exact Decoding for Jointly Labeling and Chunking Sequences
There are two decoding algorithms essential to the area of natural language processing. One is the Viterbi algorithm for linear-chain models, such as HMMs or CRFs. The other is th...
Nobuyuki Shimizu, Andrew R. Haas
ICVGIP
2004
13 years 9 months ago
Robust Segmentation of Unconstrained Online Handwritten Documents
A segmentation algorithm, which can detect different regions of a handwritten document such as text lines, tables and sketches will be extremely useful in a variety of application...
Anoop M. Namboodiri, Anil K. Jain
TCS
2008
13 years 7 months ago
Computation of distances for regular and context-free probabilistic languages
Several mathematical distances between probabilistic languages have been investigated in the literature, motivated by applications in language modeling, computational biology, syn...
Mark-Jan Nederhof, Giorgio Satta
EMNLP
2009
13 years 5 months ago
Better Synchronous Binarization for Machine Translation
Binarization of Synchronous Context Free Grammars (SCFG) is essential for achieving polynomial time complexity of decoding for SCFG parsing based machine translation systems. In t...
Tong Xiao, Mu Li, Dongdong Zhang, Jingbo Zhu, Ming...
ACL
2011
12 years 11 months ago
Language of Vandalism: Improving Wikipedia Vandalism Detection via Stylometric Analysis
Community-based knowledge forums, such as Wikipedia, are susceptible to vandalism, i.e., ill-intentioned contributions that are detrimental to the quality of collective intelligen...
Manoj Harpalani, Michael Hart, Sandesh Signh, Rob ...