• Refine your search:
  • 
    Keyword:
    
    • Phonetics and Phonology (3)
    • Computational Linguistics (2)
    • 2008 (1)
    • Festschrift (1)
    • GSC (1)
    • Morphology (1)
    • Near Eastern Languages and Societies (1)
    • computational phonology (1)
    • descriptive complexity (1)
    • formal language theory (1)
    •   more
  • 
    Creator / Publisher:
    
    • Bakovic, Eric (3)
    • Mai, Anna (2)
    • Goldrick, Matt (1)
    • Ito, Junko (1)
    • McCarthy, John J (1)
    • McCollum, Adam (1)
    • Meinhardt, Eric (1)
  • 
    Year
  • 
    Medium:
    
    • Online (3)
  • 
    Type
  • 
    BLLDB-Access:
    • free (3)
    • subject to license (0)

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 – 3 of 3 1 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 2 Phonological opacity as local optimization in Gradient Symbolic Computation Mai, Anna; Bakovic, Eric; Goldrick, Matt In: Proceedings of the Society for Computation in Linguistics (2018) BASE Show details 3 Front matter and Preface Bakovic, Eric; Ito, Junko; McCarthy, John J In: John J. McCarthy (2006) BASE Show 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 3 Linguistik-Repository 0 IDS Publikationsserver 0 Online dissertations 0 Language Description Heritage 0