Papers with HMM
A k-Nearest Neighbor Approach towards Multi-level Sequence Labeling (N19-2)
Copied to clipboard
| Challenge: | Existing methods for complex dialog management require limited training data. |
| Approach: | They propose a method for intent recognition for complex dialog management in low resource situations . they use windowed word n-grams, POS tag n grams and pre-trained word embeddings as features . |
| Outcome: | The proposed method performs better with less than 1% of the data size than existing methods but requires considerably more data. |
Neural Hidden Markov Model for Machine Translation (P18-2)
Copied to clipboard
| Challenge: | Attention-based neural machine translation models selectively focus on specific source positions to produce a translation. |
| Approach: | They propose to replace the attention component with a neural hidden Markov model that selectively focuss on specific source positions to produce a translation. |
| Outcome: | The proposed model performs better than the state-of-the-art attention-based models on the GermanEnglish and ChineseEnglish translation tasks. |
Scaling Hidden Markov Language Models (2020.emnlp-main)
Copied to clipboard
| Challenge: | Hidden Markov models are a fundamental tool for sequence modeling that separates the hidden state from the emission structure. |
| Approach: | They propose methods for scaling hidden Markov models to massive state spaces while maintaining efficient exact inference and effective regularization. |
| Outcome: | The proposed methods are much more accurate than previous HMMs and n-gram-based methods, making progress towards the performance of state-of-the-art NN models. |
Bridging Pre-trained Language Models and Hand-crafted Features for Unsupervised POS Tagging (2022.findings-acl)
Copied to clipboard
| Challenge: | Large-scale pre-trained language models (PLMs) have made extraordinary progress in most NLP tasks, but they fail to achieve state-of-the-art (SOTA) performance. |
| Approach: | They propose a Guassian HMM variant for unsupervised POS tagging that incorporates contexualized word representations into the decoder. |
| Outcome: | The proposed model outperforms state-of-the-art models on Penn Treebank and multilingual Universal Dependencies treebank v2.0. |
Can Rumour Stance Alone Predict Veracity? (C18-1)
Copied to clipboard
| Challenge: | Existing studies of automatic veracity classification of social media rumours have not explored the effectiveness of crowd stance to determine veracity. |
| Approach: | They propose to use stance as an additional feature to those commonly used in earlier studies to model the veracity of a rumour using Hidden Markov Models and collective stance information to model a social media rumor. |
| Outcome: | The proposed models outperform those using crowd stance and tweets’ times as the only features for modelling true and false rumours. |
Low-resource Post Processing of Noisy OCR Output for Historical Corpus Digitisation (L18-1)
Copied to clipboard
| Challenge: | 7.6% of the words in the original OCR text contain an error; fully manual correction would take thousands of hours due to the size of the corpus. |
| Approach: | They propose a post-processing system to efficiently correct OCR errors in a 2.7 million word Faroese corpus. |
| Outcome: | The proposed method reduces the word error rate to 1.3% with around 65 hours of human annotator work. |
Non-Autoregressive Machine Translation as Constrained HMM (2024.findings-acl)
Copied to clipboard
| Challenge: | Autoregressive (AR) models have some drawbacks due to slow inference speed and label bias due to local normalization. |
| Approach: | They propose to use a left-to-right Hidden Markov Model (HMM) to control label bias in non-autoregressive translation (NAT) They propose a bi-directional HMM, which can regularize each other's biases via shared parameters. |
| Outcome: | The proposed models can achieve comparable performance to autoregressive Transformers using various decoding methods. |
Corpus-Dependent Subcharacter Encoding via HMM-Guided Code Assignment (2026.acl-long)
Copied to clipboard
| Challenge: | Latom is a corpus-dependent alternative to byte encoding that learns fixed-length atomic codes from text. |
| Approach: | They propose a corpus-dependent alternative to byte encoding that learns fixed-length atomic codes from text. |
| Outcome: | The proposed framework improves text classification accuracy and reduces decoding errors. |