Optimal Kornai-Karttunen Codes for Restricted Autosegmental Representations

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKapitelVetenskapligPeer review

Sammanfattning

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.
Originalspråkengelska
Titel på gästpublikationTokens of Meaning : Papers in Honor of Lauri Karttunen
RedaktörerCleo Condoravdi, Tracy Holloway King
UtgivningsortStanford
FörlagCenter for the Study of Language and Information (CSLI)
Utgivningsdatum2019
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”.

Vetenskapsgrenar

  • 113 Data- och informationsvetenskap
  • 6121 Språkvetenskaper

Citera det här

Yli-Jyrä, A. M. (2019). Optimal Kornai-Karttunen Codes for Restricted Autosegmental Representations. I C. Condoravdi, & T. Holloway King (Red.), Tokens of Meaning: Papers in Honor of Lauri Karttunen Stanford: Center for the Study of Language and Information (CSLI).
Yli-Jyrä, Anssi Mikael. / Optimal Kornai-Karttunen Codes for Restricted Autosegmental Representations. Tokens of Meaning: Papers in Honor of Lauri Karttunen. redaktör / Cleo Condoravdi ; Tracy Holloway King. Stanford : Center for the Study of Language and Information (CSLI), 2019.
@inbook{127f760e8d4c4eaaa7658b5d3b112274,
title = "Optimal Kornai-Karttunen Codes for Restricted Autosegmental Representations",
abstract = "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{\"a} 2013) and the model-theoretic approach (Bird and Klein, 1990, Jardine, 2013) can and perhaps should be combined to tackle the implementation challenge.",
keywords = "113 Computer and information sciences, codes, automata, compositionality, invertibility, 6121 Languages, autosegmental phonology, autosegmental representations, finite-state phonology, finite automata",
author = "Yli-Jyr{\"a}, {Anssi Mikael}",
note = "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”.",
year = "2019",
language = "English",
isbn = "978-1-68400-048-7",
editor = "Cleo Condoravdi and {Holloway King}, Tracy",
booktitle = "Tokens of Meaning",
publisher = "Center for the Study of Language and Information (CSLI)",
address = "United States",

}

Yli-Jyrä, AM 2019, Optimal Kornai-Karttunen Codes for Restricted Autosegmental Representations. i C Condoravdi & T Holloway King (red), Tokens of Meaning: Papers in Honor of Lauri Karttunen. Center for the Study of Language and Information (CSLI), Stanford.

Optimal Kornai-Karttunen Codes for Restricted Autosegmental Representations. / Yli-Jyrä, Anssi Mikael.

Tokens of Meaning: Papers in Honor of Lauri Karttunen. red. / Cleo Condoravdi; Tracy Holloway King. Stanford : Center for the Study of Language and Information (CSLI), 2019.

Forskningsoutput: Kapitel i bok/rapport/konferenshandlingKapitelVetenskapligPeer review

TY - CHAP

T1 - Optimal Kornai-Karttunen Codes for Restricted Autosegmental Representations

AU - Yli-Jyrä, Anssi Mikael

N1 - 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”.

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

KW - 113 Computer and information sciences

KW - codes

KW - automata

KW - compositionality

KW - invertibility

KW - 6121 Languages

KW - autosegmental phonology

KW - autosegmental representations

KW - finite-state phonology

KW - finite automata

M3 - Chapter

SN - 978-1-68400-048-7

BT - Tokens of Meaning

A2 - Condoravdi, Cleo

A2 - Holloway King, Tracy

PB - Center for the Study of Language and Information (CSLI)

CY - Stanford

ER -

Yli-Jyrä AM. Optimal Kornai-Karttunen Codes for Restricted Autosegmental Representations. I Condoravdi C, Holloway King T, redaktörer, Tokens of Meaning: Papers in Honor of Lauri Karttunen. Stanford: Center for the Study of Language and Information (CSLI). 2019