This paper compares several translation representations for a synchronous context-free grammar parse including CFGs/hypergraphs, finite-state automata (FSA), and pushdown automat...
Gonzalo Iglesias, Cyril Allauzen, William Byrne, A...
Log-linear parsing models are often trained by optimizing likelihood, but we would prefer to optimise for a task-specific metric like Fmeasure. Softmax-margin is a convex objecti...
Large corporations increasingly utilize business process models for documenting and redesigning their operations. The extent of such modeling initiatives with several hundred mode...
Stanford dependencies are widely used in natural language processing as a semanticallyoriented representation, commonly generated either by (i) converting the output of a constitu...
Studying the relationship between natural language and affective information as well as assessing the underpinned affective qualities of natural language are becoming crucial for ...
Shaikh Mostafa Al Masum, Helmut Prendinger, Mitsur...