Improved morpho-phonological sequence processing with constraint satisfaction inference

Authors:
Antal van den Bosch;Sander Canisius
Affiliations:
Tilburg University, LE Tilburg, The Netherlands;Tilburg University, LE Tilburg, The Netherlands
Venue:
SIGPHON '06 Proceedings of the Eighth Meeting of the ACL Special Interest Group on Computational Phonology and Morphology
Year:
2006

Citing 5
Cited 4

Instance-Based Learning Algorithms

Machine Learning
Data-oriented methods for grapheme-to-phoneme conversion

EACL '93 Proceedings of the sixth conference on European chapter of the Association for Computational Linguistics
Memory-based morphological analysis

ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Improving sequence segmentation learning by predicting trigrams

CONLL '05 Proceedings of the Ninth Conference on Computational Natural Language Learning
An analogical learner for morphological analysis

CONLL '05 Proceedings of the Ninth Conference on Computational Natural Language Learning

Modeling letter-to-phoneme conversion as a phrase based statistical machine translation problem with minimum error rate training

SRWS '09 Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics, Companion Volume: Student Research Workshop and Doctoral Consortium
Letter-phoneme alignment: an exploration

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
An exact A* method for deciphering letter-substitution ciphers

ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Automatic rule extraction for modeling pronunciation variation

CICLing'11 Proceedings of the 12th international conference on Computational linguistics and intelligent text processing - Volume Part II

Quantified Score

Hi-index	0.02

Visualization

Abstract

In performing morpho-phonological sequence processing tasks, such as letter-phoneme conversion or morphological analysis, it is typically not enough to base the output sequence on local decisions that map local-context input windows to single output tokens. We present a global sequence-processing method that repairs inconsistent local decisions. The approach is based on local predictions of overlapping trigrams of output tokens, which open up a space of possible sequences; a data-driven constraint satisfaction inference step then searches for the optimal output sequence. We demonstrate significant improvements in terms of word accuracy on English and Dutch letter-phoneme conversion and morphological segmentation, and we provide qualitative analyses of error types prevented by the constraint satisfaction inference method.