Efficient Higher-Order CRFs for Morphological Tagging

Learning the Structure of Variable-Order CRFs: a finite-state perspective

The computational complexity of linear-chain Conditional Random Fields (CRFs) makes it difficult to deal with very large label sets and long range dependencies. Such situations are not rare and arise when dealing with mo…

2-Slave Dual Decomposition for Generalized Higher Order CRFs

We show that the decoding problem in generalized Higher Order Conditional Random Fields (CRFs) can be decomposed into two parts: one is a tree labeling problem that can be solved in linear time using dynamic programming;…

Speed-Accuracy Tradeoffs in Tagging with Variable-Order CRFs and Structured Sparsity

Leveraging Sub Label Dependencies in Code Mixed Indian Languages for Part-Of-Speech Tagging using Conditional Random Fields.

Code-mixed text sequences often lead to challenges in the task of correct identification of Part-Of-Speech tags. However, lexical dependencies created while alternating between multiple languages can be leveraged to impr…

Using a Small Lexicon with CRFs Confidence Measure to Improve POS Tagging Accuracy

Like most of the languages which have only recently started being investigated for the Natural Language Processing (NLP) tasks, Amazigh lacks annotated corpora and tools and still suffers from the scarcity of linguistic …