Three Equivalent Codes for Autosegmental Representations

Anssi Yli-Jyrä

Three Equivalent Codes for Autosegmental Representations

Språkteknologi

Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review

Sammanfattning

A string encoding for a subclass of bipartite graphs enables graph rewriting used in autosegmental descriptions of tone phonology via existing and highly optimized finite- state transducer toolkits (Yli-Jyrä 2013). The current work offers a rigorous treatment of this code-theoretic approach, generalizing the methodology to all bipartite graphs having no crossing edges and un- ordered nodes. We present three bijectively related codes each of which exhibit unique characteristics while preserving the freedom to violate or express the OCP constraint. The codes are infinite, finite-state representable and optimal (efficiently computable, invertible, locally iconic, compositional) in the sense of Kornai (1995). They extend the encoding approach with visualisation, generality and flexibility and they make encoded graphs a strong candidate when the formal semantics of autosegmental phonology or non-crossing alignment relations are implemented within the con- fines of regular grammar.

Bidragets översatta titel	Kolme ekvivalenttia koodia autosegmentaalisille esitysmuodoille
Originalspråk	engelska
Titel på värdpublikation	Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing 2015 : FSMNLP 2015 Düsseldorf
Redaktörer	Thomas Hanneforth, Christian Wurm
Antal sidor	9
Volym	12
Utgivningsort	Stroudsburg
Förlag	The Association for Computational Linguistics
Utgivningsdatum	22 juni 2015
ISBN (elektroniskt)	978-1-950737-97-0
Status	Publicerad - 22 juni 2015
MoE-publikationstyp	A4 Artikel i en konferenspublikation
Evenemang	International Conference on Finite-State Methods and Natural Language Processing - Düsselsdorf, Tyskland Varaktighet: 22 juni 2015 → 24 juni 2015 Konferensnummer: 12 (FSMNLP)

Vetenskapsgrenar

6121 Språkvetenskaper
213 El-, automations- och telekommunikationsteknik, elektronik
111 Matematik
113 Data- och informationsvetenskap

Åtkomst av dokument

Three equivalent codes for autosegmental representation.Slutlig publicerad version, 211 KB

https://aclweb.org/anthology/W/W15/W15-4812.pdf

ADEQSYNTAX: Käytettävä äärellistilainen malli adekvaatille kieliopilliselle kompleksisuudelle
Yli-Jyrä, A.
Suomen tietokirjailijat
01/09/2013 → 30/04/2019
Projekt: Forskningsprojekt
ADEQSYNTAX-TRIAL2: Full Finite-State Syntax: Capturing Ambiguity and Crossing Dependencies with Minimal Descriptive Complexity
Yli-Jyrä, A.
17/10/2012 → 31/08/2013
Projekt: Forskningsprojekt
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
Projekt: Forskningsutvärdering 2011

CLARIN - Finländska språkresurser i gemensamt bruk
Krister Linden (Chef)
Avdelningen för digital humaniora
Utrustning/facilitet: Utrustning

Citera det här

@inproceedings{e2106e001c724383add59c3175a64819,

title = "Three Equivalent Codes for Autosegmental Representations",

abstract = "A string encoding for a subclass of bipartite graphs enables graph rewriting used in autosegmental descriptions of tone phonology via existing and highly optimized finite- state transducer toolkits (Yli-Jyr{\"a} 2013). The current work offers a rigorous treatment of this code-theoretic approach, generalizing the methodology to all bipartite graphs having no crossing edges and un- ordered nodes. We present three bijectively related codes each of which exhibit unique characteristics while preserving the freedom to violate or express the OCP constraint. The codes are infinite, finite-state representable and optimal (efficiently computable, invertible, locally iconic, compositional) in the sense of Kornai (1995). They extend the encoding approach with visualisation, generality and flexibility and they make encoded graphs a strong candidate when the formal semantics of autosegmental phonology or non-crossing alignment relations are implemented within the con- fines of regular grammar.",

keywords = "6121 Languages, fonologia, autosegmentaalinen fonologia, autosegmentit, laskennallinen fonologia, phonology, autosegmental phonology, autosegments, computational phonology, 213 Electronic, automation and communications engineering, electronics, koodit, purkaminen, koodausteoria, codes, decoding, coding theory, 111 Mathematics, graafien dekompositio, graph decomposition, 113 Computer and information sciences, {\"a}{\"a}relliset transduktorit, {\"a}{\"a}rellistilaiset transduktorit, s{\"a}{\"a}nn{\"o}lliset lausekkeet, s{\"a}{\"a}nn{\"o}lliset kielet, finite-state transducers, regular expressions, s{\"a}{\"a}nn{\"o}lliset kielet",

author = "Anssi Yli-Jyr{\"a}",

note = "Otsikossa esiintyv{\"a} {"}autosegmentaalinen esitysmuoto{"} viittaa fonologiseen esitysmuotoon, joka erottelee fonologiset piirteet kahdelle tai useammalle lineaariselle aikalinjalle. Vaikka sellainen erottelu on ideoitu fonologiassa, sill{\"a} on sovelluksia my{\"o}s k{\"a}{\"a}nn{\"o}sten lineaarisessa kohdistamisessa ja {\"a}{\"a}rellistilaisessa syntaksissa, jota projektini tutkii. Tutkin vastaavia esitysmuotoja dependenssij{\"a}sent{\"a}misen yhteydess{\"a}, jossa tavoittelen enemm{\"a}n Linear Unit Grammar (Mauranen 2012) -l{\"a}hestymistapaa kuin syv{\"a}{\"a} syntaksipuuta. Proceeding volume: 12; International Conference on Finite-State Methods and Natural Language Processing ; Conference date: 22-06-2015 Through 24-06-2015",

year = "2015",

month = jun,

day = "22",

language = "English",

volume = "12",

editor = "Thomas Hanneforth and Christian Wurm",

booktitle = "Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing 2015",

publisher = "The Association for Computational Linguistics",

address = "United States",

}

Yli-Jyrä, A 2015, Three Equivalent Codes for Autosegmental Representations. i T Hanneforth & C Wurm (red), Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing 2015: FSMNLP 2015 Düsseldorf. vol. 12, The Association for Computational Linguistics, Stroudsburg, International Conference on Finite-State Methods and Natural Language Processing, Düsselsdorf, Tyskland, 22/06/2015. <https://aclweb.org/anthology/W/W15/W15-4812.pdf>

Three Equivalent Codes for Autosegmental Representations. / Yli-Jyrä, Anssi.

Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing 2015: FSMNLP 2015 Düsseldorf. red. / Thomas Hanneforth; Christian Wurm. Vol. 12 Stroudsburg : The Association for Computational Linguistics, 2015.

Forskningsoutput: Kapitel i bok/rapport/konferenshandling › Konferensbidrag › Vetenskaplig › Peer review

TY - GEN

T1 - Three Equivalent Codes for Autosegmental Representations

AU - Yli-Jyrä, Anssi

N1 - Conference code: 12 (FSMNLP)

PY - 2015/6/22

Y1 - 2015/6/22

N2 - A string encoding for a subclass of bipartite graphs enables graph rewriting used in autosegmental descriptions of tone phonology via existing and highly optimized finite- state transducer toolkits (Yli-Jyrä 2013). The current work offers a rigorous treatment of this code-theoretic approach, generalizing the methodology to all bipartite graphs having no crossing edges and un- ordered nodes. We present three bijectively related codes each of which exhibit unique characteristics while preserving the freedom to violate or express the OCP constraint. The codes are infinite, finite-state representable and optimal (efficiently computable, invertible, locally iconic, compositional) in the sense of Kornai (1995). They extend the encoding approach with visualisation, generality and flexibility and they make encoded graphs a strong candidate when the formal semantics of autosegmental phonology or non-crossing alignment relations are implemented within the con- fines of regular grammar.

AB - A string encoding for a subclass of bipartite graphs enables graph rewriting used in autosegmental descriptions of tone phonology via existing and highly optimized finite- state transducer toolkits (Yli-Jyrä 2013). The current work offers a rigorous treatment of this code-theoretic approach, generalizing the methodology to all bipartite graphs having no crossing edges and un- ordered nodes. We present three bijectively related codes each of which exhibit unique characteristics while preserving the freedom to violate or express the OCP constraint. The codes are infinite, finite-state representable and optimal (efficiently computable, invertible, locally iconic, compositional) in the sense of Kornai (1995). They extend the encoding approach with visualisation, generality and flexibility and they make encoded graphs a strong candidate when the formal semantics of autosegmental phonology or non-crossing alignment relations are implemented within the con- fines of regular grammar.

KW - 6121 Languages

KW - fonologia

KW - autosegmentaalinen fonologia

KW - autosegmentit

KW - laskennallinen fonologia

KW - phonology

KW - autosegmental phonology

KW - autosegments

KW - computational phonology

KW - 213 Electronic, automation and communications engineering, electronics

KW - koodit

KW - purkaminen

KW - koodausteoria

KW - codes

KW - decoding

KW - coding theory

KW - 111 Mathematics

KW - graafien dekompositio

KW - graph decomposition

KW - 113 Computer and information sciences

KW - äärelliset transduktorit

KW - äärellistilaiset transduktorit

KW - säännölliset lausekkeet

KW - säännölliset kielet

KW - finite-state transducers

KW - regular expressions

KW - säännölliset kielet

M3 - Conference contribution

VL - 12

BT - Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing 2015

A2 - Hanneforth, Thomas

A2 - Wurm, Christian

PB - The Association for Computational Linguistics

CY - Stroudsburg

T2 - International Conference on Finite-State Methods and Natural Language Processing

Y2 - 22 June 2015 through 24 June 2015

ER -

Three Equivalent Codes for Autosegmental Representations

Sammanfattning

Vetenskapsgrenar

Åtkomst av dokument

Projekt

ADEQSYNTAX: Käytettävä äärellistilainen malli adekvaatille kieliopilliselle kompleksisuudelle

ADEQSYNTAX-TRIAL2: Full Finite-State Syntax: Capturing Ambiguity and Crossing Dependencies with Minimal Descriptive Complexity

Building and use of language technology (BAULT)

Utrustning

CLARIN - Finländska språkresurser i gemensamt bruk

Citera det här