Optimal Kornai-Karttunen Codes for Restricted Autosegmental Representations

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKapitelVetenskapligPeer review


Any finite-state implementation for autosegmental grammars requires, among other things, a way to encode its phonological representations during the transductions. In this article, I argue that Kornai and Karttunen’s triple alphabet in Kornai (1995) can be modified and used to define a regular set of code words in such a way that the encoding function is compositional and invertible. This would contradict the negative result of Wiebe (1992) unless floating was treated outside the encoding as latent variation. This out-of-the-box manoeuvre suggests that the linear encoding (Kornai, 1995, Yli-Jyrä 2013) and the model-theoretic approach (Bird and Klein, 1990, Jardine, 2013) can and perhaps should be combined to tackle the implementation challenge.
Titel på värdpublikationTokens of Meaning : Papers in Honor of Lauri Karttunen
RedaktörerCleo Condoravdi, Tracy Holloway King
FörlagCenter for the Study of Language and Information (CSLI)
ISBN (tryckt)978-1-68400-048-7
ISBN (elektroniskt)978-1-68400-051-7
StatusPublicerad - 2019
MoE-publikationstypA3 Del av bok eller annan forskningsbok

Bibliografisk information

The author has received funding as Research Fellow from the Academy of Finland (dec. No 270354 - A Usable Finite-State Model for Adequate Syntactic Complexity), as Clare Hall Fellow from the University of Helsinki (dec. RP 137/2013). As the response to the reviews.

The article was heavily revised during the author’s 2017 visit to the USA under the mobility funding of the Faculty of Arts of the University of Helsinki (Dean’s dec. N1/2017). The author is deeply grateful for the patience of the editors, especially Cleo Condoravdi at CSLI. The title of the original version was ”Some Transition Systems and Codes for Bistrings”.


  • 113 Data- och informationsvetenskap
  • 6121 Språkvetenskaper

Citera det här