Edinburgh Research Explorer

Local String Transduction as Sequence Labeling

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Related Edinburgh Organisations

Open Access permissions



  • Download as Adobe PDF

    Accepted author manuscript, 176 KB, PDF document

    Licence: Creative Commons: Attribution (CC-BY)

Original languageEnglish
Title of host publication27th International Conference on Computational Linguistics (COLING 2018)
Place of PublicationSanta Fe, New-Mexico, USA
Number of pages12
Publication statusPublished - 2018
Event27th International Conference on Computational Linguistics - Sante Fe, United States
Duration: 20 Aug 201825 Aug 2018


Conference27th International Conference on Computational Linguistics
Abbreviated titleCOLING 2018
CountryUnited States
CitySante Fe
Internet address


We show that the general problem of string transduction can be reduced to the problem of sequence labeling. While character deletions and insertions are allowed in string transduction, they do not exist in sequence labeling. We show how to overcome this difference. Our approach can be used with any sequence labeling algorithm and it works best for problems in which string transduction imposes a strong notion of locality (no long range dependencies). We experiment with spelling correction for social media, OCR correction, and morphological inflection, and we see that it behaves better than seq2seq models and yields state-of-the-art results in several cases.


27th International Conference on Computational Linguistics


Sante Fe, United States

Event: Conference

ID: 70051468