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: Automated tableau generation using SPOT (Syntax Prosody in Optimality Theory)
Abstract Much recent work on the syntax-prosody interface has been based in Optimality Theory. The typical analysis explicitly considers only a small number of candidates that could reasonably be expected to be optimal under some ranking, often without an explicit definition of GEN. Manually generating all the possible candidates, however, is prohibitively time-consuming for most input structures – the Too Many Candidates Problem. Existing software for OT uses regular expressions for automated generation and evaluation of candidates. However, regular expressions are too low in the Chomsky Hierarchy of language types to represent trees of arbitrary size, which are needed for syntax-prosody work. This paper presents a new computational tool for research in this area: Syntax-Prosody in Optimality Theory (SPOT). For a given input, SPOT generates all prosodic parses under certain assumptions about GEN, and evaluates them against all constraints in CON. This allows for in-depth comparison of the typological predictions made by different theories of GEN and CON at the syntax-prosody interface.  more » « less
Award ID(s):
1749368
PAR ID:
10100794
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Linguistics Vanguard
Volume:
5
Issue:
1
ISSN:
2199-174X
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, Proceedings of the Linguistic Society of America)
    null (Ed.)
    SPOT (Syntax Prosody in Optimality Theory app; http://spot.sites.ucsc.edu) automates candidate generation and evaluation for work on the syntax-prosody interface. SPOT is intended to facilitate the creation and comparison of multiple versions of an analysis, in service of refining constraint definitions and theory development. The codebase is available at https://github.com/syntax-prosody-ot. This paper briefly explains the motivation for the SPOT app, then walks through the process of creating an analysis in SPOT. We show how to create input syntactic trees, either manually or automatically; how to select a constraint set; and how to generate tableaux with candidates, constraints, and violation counts. Finally, we show how to use the output of SPOT to calculate rankings and typologies using an OT application. 
    more » « less
  2. ; (, English linguistics)
    This paper proposes to subsume Syntax-Prosody Match Theory under General Correspondence Theory, which distinguishes purely existential MAX/DEP constraints (requiring nothing but the existence of a correspondent in the output/input, which can be rather different from the input element) from IDENT and other faithfulness constraints. Exact correspondence (preservation of edges, no deletion, no insertion, uniqueness of mapping, order preservation, etc.) is enforced by Syntax-Prosody and Prosody-Syntax Alignment and by standard Faithfulness. The empirical topic is the impossibility of phrase-final enclisis in English (*I don't know where Tom's vs. Tom's here) and its proper explanation. 
    more » « less
  3. ; ; (, Proceedings of the Seventeenth SIGMORPHON Workshop on Computational Research)
    This paper investigates bounds on the generative capacity of prosodic processes, by focusing on the complexity of recursive prosody in coordination contexts in English (Wagner, 2010). Although all phonological processes and most prosodic processes are computationally regular string languages, we show that recursive prosody is not. The output string language is instead parallel multiple context-free (Seki et al., 1991). We evaluate the complexity of the pattern over strings, and then move on to a characterization over trees that requires the expressivity of multi bottom-up tree transducers. In doing so, we provide a foundation for future mathematically grounded investigations of the syntax-prosody interface. 
    more » « less
  4. ; (, Proceedings of the Annual Meetings on Phonology)
    null (Ed.)
    Analyses of Irish phonological phrasing (Elfner 2012 et seq.) have been influential in shaping Match Theory (Selkirk 2011), an OT approach to mapping syntactic to prosodic structure. We solve two constraint ranking paradoxes concerning the relative ranking of Match and StrongStart. Irish data indicate that while XPs with silent heads can fail to map to phonological phrases in certain circumstances, overtly headed XPs cannot. They also indicate that rebracketing due to the constraint StrongStart occurs only sentence-initially, contrary to predictions. We account for these puzzles by invoking Van Handel's (2019) Match constraint which sees only XPs with overt heads, and by positing a new version of StrongStart which only applies to material at the left edge of the intonational phrase. Our analysis is developed using the Syntax-Prosody in Optimality Theory application (SPOT) and OTWorkplace. 
    more » « less
  5. ; (, Proceedings of the 2018 26th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering)
    Developers report testing their regular expressions less than the rest of their code. In this work, we explore how thoroughly tested regular expressions are by examining open source projects. Using standard metrics of coverage, such as line and branch cov- erage, gives an incomplete picture of the test coverage of regular expressions. We adopt graph-based coverage metrics for the DFA representation of regular expressions, providing fine-grained test coverage metrics. Using over 15,000 tested regular expressions in 1,225 Java projects on GitHub, we measure node, edge, and edge-pair coverage. Our results show that only 17% of the regular expressions in the repositories are tested at all. For those that are tested, the median number of test inputs is two. For nearly 42% of the tested regular expressions, only one test input is used. Average node and edge coverage levels on the DFAs for tested regular expressions are 59% and 29%, respectively. Due to the lack of testing of regular expressions, we explore whether a string generation tool for reg- ular expressions, Rex, achieves high coverage levels. With some exceptions, we found that tools such as Rex can be used to write test inputs with similar coverage to the developer tests. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email