skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: An IBSP Description of Sanskrit /n/-Retroflexion
Graf and Mayer (2018) analyze the process of Sanskrit /n/-retroflexion (nati) from a subregular perspective. They show that nati, which might be the most complex phenomenon in segmental phonology, belongs to the class of input-output tier-based strictly local languages (IO-TSL). However, the generative capacity and linguistic relevance of IO-TSL is still largely unclear compared to other recent classes like the interval-based strictly piecewise languages (IBSP; Graf, 2017, 2018). This paper shows that IBSP has a much harder time capturing nati than IO-TSL, due to two major shortcomings: namely, the requirement of an upper bound on relevant segments, and a lack of descriptive succinctness.  more » « less
Award ID(s):
1845344
PAR ID:
10140838
Author(s) / Creator(s):
Date Published:
Journal Name:
Proceedings of the Society for Computation in Linguistics
Volume:
3
Page Range / eLocation ID:
160-169
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. (, Proceedings of the Society for Computation in Linguistics)
    Extending prior work in Graf (2018, 2020, 2022c), I show that movement is tier-based strictly local (TSL) even if one analyzes it as a transformation, i.e. a tree transduction from derivation trees to output trees. I define input strictly local (ISL) tree-to-tree transductions with (lexical) TSL tests as a tier-based extension of ISL tree-to-tree transductions. TSL tests allow us to attach each mover to all its landing sites. In general, this class of transductions fails to attach each mover to its final landing site to the exclusion of all its intermediate landing sites, which is crucial for producing output trees with the correct string yield. The problem is avoided, though, if syntax enforces a variant of the Ban on Improper Movement. Subregular complexity thus provides a novel motivation for core restrictions on movement while also shedding new light on the choice between copies and traces in syntax. 
    more » « less
  2. (, Journal of Language Modelling)
    This paper presents a subregular analysis of syntactic agreement patterns modeled using command strings over Minimalist Grammar (MG) dependency trees (Graf and Shafiei 2019), incorporating a novel MG treatment of agreement. Phenomena of interest include relativized minimality and its exceptions, direction of feature transmission, and configurations involving chains of agreeing elements. Such patterns are shown to fall within the class of tier-based strictly 2-local (TSL-2) languages, which has previously been argued to subsume the majority of long-distance syntactic phenomena, as well as those in phonology and morphology (Graf 2022a). This characterization places a tight upper bound on the range of configurations that are predicted to occur while providing parameters for variation which closely match the observed typology. 
    more » « less
  3. (, Proceedings of the Society for Computation in Linguistics)
    Many long-distance linguistic dependencies across domains can be modeled as tier-based strictly local (TSL) patterns (Graf 2022a). Such patterns are in principle efficiently learnable, but known algorithms require unrealistic conditions. Heuser et al. (2024) present an algorithm for learning syntactic islands which involves memorizing local bigrams along attested paths; no tiers are involved. I propose a method for inferring tier membership which augments the latter algorithm to produce a TSL grammar, and show that this model also derives a version of the Height-Locality Connection (Keine 2019). 
    more » « less
  4. ; (, FG 2019)
    The subregular approach has revealed that the phonological surface patterns found in natural language are much simpler than previously assumed. Most patterns belong to the subregular class of tier-based strictly local languages (TSL), which characterizes them as the combination of a strictly local dependency with a tier-projection mechanism that masks out irrelevant segments. Some non-TSL patterns have been pointed out in the literature, though. We show that these outliers can be captured by rendering the tier projection mechanism sensitive to the surrounding structure. We focus on a specific instance of these structure-sensitive TSL languages: input-local TSL (ITSL), in which the tier projection may distinguish between identical segments that occur in different local contexts in the input string. This generalization of TSL establishes a tight link between tier-based language classes and ISL transductions, and is motivated by several natural language phenomena. 
    more » « less
  5. (, Proceedings of the Society for Computation in Linguistics)
    Recent work in subregular syntax has revealed deep parallels among syntactic phenomena, many of which fall under the computational class TSL (Graf, 2018, 2022). Vu et al. (2019) argue that case dependencies are yet another member of this class. But their analysis focuses mainly on English, which is famously case-poor. In this paper I present a TSL analysis of Japanese, which features a much wider range of case-marking patterns, adding support to the claim that case dependencies, and by extension syntactic dependencies, are TSL. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email