Optimal Kornai-Karttunen Codes for Restricted Autosegmental Representations

Anssi Mikael Yli-Jyrä

Optimal Kornai-Karttunen Codes for Restricted Autosegmental Representations

Kieliteknologia

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussa › Kirjan luku tai artikkeli › Tieteellinen › vertaisarvioitu

Abstrakti

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.

Alkuperäiskieli	englanti
Otsikko	Tokens of Meaning : Papers in Honor of Lauri Karttunen
Toimittajat	Cleo Condoravdi, Tracy Holloway King
Julkaisupaikka	Stanford
Kustantaja	Center for the Study of Language and Information (CSLI)
Julkaisupäivä	2019
ISBN (painettu)	978-1-68400-048-7
ISBN (elektroninen)	978-1-68400-051-7
Tila	Julkaistu - 2019
OKM-julkaisutyyppi	A3 Kirjan tai muun kokoomateoksen osa

Lisätietoja

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

Tieteenalat

113 Tietojenkäsittely- ja informaatiotieteet
6121 Kielitieteet

Muut tiedostot ja linkit

Lauri Karttunen has done groundbreaking work in theoretical and computational linguistics. The papers in this volume present new, state-of-the-art work building on his numerous contributions. The first part includes papers on formal semantics, the focus of Karttunen's early career to which he has returned in recent years. The second part provides a natural extension of his semantic work: the formal analysis of meaning and reasoning and the integration of the lexical and ontological components to enable reasoning by computational systems. The third part focuses on syntactic analyses, including the structure of non-finite clauses and sentence embedding predicates and factivity. The final part of the volume deals with finite state methods and grammars, reflecting Karttunen's extensive contributions to finite state theory and technology and its application to natural language.

3 Päättynyt

ADEQSYNTAX: A Usable Finite-State Model for Adequate Syntactic Complexity
Yli-Jyrä, A.
Suomen tietokirjailijat
01/09/2013 → 30/04/2019
Projekti: Tutkimusprojekti
LT4AFRICA: YK:n vuosituhatjulistus ja Afrikan kieliteknologia. Tiekartta bantukielten resurssien kehittämiseksi.
Yli-Jyrä, A., Killian, D., Valkama, M. & Hurskainen, A.
Suomen Akatemia
01/01/2010 → 31/12/2010
Projekti: Tutkimusprojekti
Building and use of language technology (BAULT)
Koskenniemi, K., Arppe, A., Carlson, L., Gurin, G., Hulden, M., Hurskainen, A., Huttunen, S., Jalava, L., Karlsson, F., Koponen, M., Kopotev, M., Lammi, A., Linden, K., Lindström, J., Mankila, A., Mustajoki, A. S., Nevalainen, T., Niemi, J., Nikunlassi, A., Nyrkkö, S., Parpola, A., Parpola, S., Piitulainen, J., Pirinen, T., Laitinen, H., Silfverberg, M., Vainio, M., Voutilainen, A., Yangarber, R., Yli-Jyrä, A., Leino, J. & Grünthal, R.
01/01/2005 → 31/12/2016
Projekti: Tutkimuksen arviointi 2011

Siteeraa tätä

@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{\textquoteright}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{\textquoteright}s 2017 visit to the USA under the mobility funding of the Faculty of Arts of the University of Helsinki (Dean{\textquoteright}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",

}

Optimal Kornai-Karttunen Codes for Restricted Autosegmental Representations. / Yli-Jyrä, Anssi Mikael.
Tokens of Meaning: Papers in Honor of Lauri Karttunen. toim. / Cleo Condoravdi; Tracy Holloway King. Stanford: Center for the Study of Language and Information (CSLI), 2019.

Tutkimustuotos: Artikkeli kirjassa/raportissa/konferenssijulkaisussa › Kirjan luku tai artikkeli › Tieteellinen › vertaisarvioitu

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

UR - https://press.uchicago.edu/ucp/books/book/distributed/T/bo45997447.html

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 -

Optimal Kornai-Karttunen Codes for Restricted Autosegmental Representations

Abstrakti

Lisätietoja

Tieteenalat

Muut tiedostot ja linkit

Projektit

ADEQSYNTAX: A Usable Finite-State Model for Adequate Syntactic Complexity

LT4AFRICA: YK:n vuosituhatjulistus ja Afrikan kieliteknologia. Tiekartta bantukielten resurssien kehittämiseksi.

Building and use of language technology (BAULT)

Siteeraa tätä