Home
Catalogue search
Refine your search:
Keyword:
Linguistics (2)
Cognitive Sciences (1)
Computational Linguistics (1)
Languages & Linguistics (1)
Phonetics and Phonology (1)
computational phonology (1)
computational psycholinguistics (1)
descriptive complexity (1)
formal language theory (1)
language change (1)
more
Creator / Publisher
Year:
2021 (2)
2020 (3)
Medium
Type
BLLDB-Access
Search in the Catalogues and Directories
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
AND
OR
AND NOT
All fields
Title
Creator / Publisher
Keyword
Year
Sort by
creator [A → Z]
'
creator [Z → A]
'
publishing year ↑ (asc)
'
publishing year ↓ (desc)
'
title [A → Z]
'
title [Z → A]
'
Simple Search
Hits 1 – 5 of 5
1
On the proper treatment of weak determinism: Subsequentiality and simultaneous application in phonological maps
Meinhardt, Eric
;
Mai, Anna
;
Baković, Eric
. - : eScholarship, University of California, 2021
BASE
Show details
2
Functional pressures and linguistic typology
Meinhardt, Eric
. - : eScholarship, University of California, 2021
BASE
Show details
3
Unbounded circumambient patterns in segmental phonology
McCollum, Adam G
;
Bakovic, Eric
;
Mai, Anna
...
In: PHONOLOGY, vol 37, iss 2 (2020)
BASE
Show details
4
Speakers Enhance Contextually Confusable Words
Meinhardt, Eric
;
Bakovic, Eric
;
Bergen, Leon
. - : eScholarship, University of California, 2020
BASE
Show details
5
Questioning to Resolve Transduction Problems
Meinhardt, Eric
;
Mai, Anna
;
Bakovic, Eric
;
McCollum, Adam
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
Mobile view
All
Catalogues
UB Frankfurt Linguistik
0
IDS Mannheim
0
OLC Linguistik
0
UB Frankfurt Retrokatalog
0
DNB Subject Category Language
0
Institut für Empirische Sprachwissenschaft
0
Leibniz-Centre General Linguistics (ZAS)
0
Bibliographies
BLLDB
0
BDSL
0
IDS Bibliografie zur deutschen Grammatik
0
IDS Bibliografie zur Gesprächsforschung
0
IDS Konnektoren im Deutschen
0
IDS Präpositionen im Deutschen
0
IDS OBELEX meta
0
MPI-SHH Linguistics Collection
0
MPI for Psycholinguistics
0
Linked Open Data catalogues
Annohub
0
Online resources
Link directory
0
Journal directory
0
Database directory
0
Dictionary directory
0
Open access documents
BASE
5
Linguistik-Repository
0
IDS Publikationsserver
0
Online dissertations
0
Language Description Heritage
0
© 2013 - 2024 Lin|gu|is|tik
|
Imprint
|
Privacy Policy
|
Datenschutzeinstellungen ändern