DE eng

Search in the Catalogues and Directories

Hits 1 – 1 of 1

1
Questioning to Resolve Transduction Problems
In: Proceedings of the Society for Computation in Linguistics (2020)
Abstract: Elgot & Mezei (1965) show that non-deterministic regular functions (NDRFs) 𝚽 are compositions ρ ⚬ λ of two contradirectional subsequential functions (SSQs), where λ is unbounded lookahead for ρ. Such decompositions facilitate the identification of processes that require supra-SSQ expressivity. We use concepts adapted from decision theory to outline a set of necessary and sufficient properties for a composition ρ ⚬ λ to define a non-SSQ NDRF 𝚽. These conditions define a set of functions between the IF-WDRFs (McCollum et al. 2018, Hao & Andersson 2019) and proper NDRFs, organized in terms of a precise notion of the degree of lookahead that λ provides for ρ.
Keyword: Computational Linguistics; computational phonology; descriptive complexity; formal language theory; Phonetics and Phonology
URL: https://scholarworks.umass.edu/scil/vol3/iss1/48
https://scholarworks.umass.edu/cgi/viewcontent.cgi?article=1151&context=scil
BASE
Hide details

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
1
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern