Aniello De Santo

Also published as: Aniello De Santo


2024

pdf bib
Online Learning of ITSL Grammars
Jacob K. Johnson | Aniello De Santo
Proceedings of the Society for Computation in Linguistics 2024

2023

pdf bib
Finite-State Text Processing
Aniello De Santo
Computational Linguistics, Volume 49, Issue 1 - March 2023

pdf bib
Extending Finite-state Models of Reduplication to Tone in Thai
Casey D. Miller | Aniello De Santo
Proceedings of the Society for Computation in Linguistics 2023

pdf bib
An MG Parsing View into the Processing of Subject and Object Relative Clauses in Basque
Matteo Fiorini | Jillian Chang | Aniello De Santo
Proceedings of the Society for Computation in Linguistics 2023

2022

pdf bib
Logical Transductions for the Typology of Ditransitive Prosody
Mai Ha Vu | Aniello De Santo | Hossep Dolatian
Proceedings of the 19th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology

Given the empirical landscape of possible prosodic parses, this paper examines the computations required to formalize the mapping from syntactic structure to prosodic structure. In particular, we use logical tree transductions to define the prosodic mapping of ditransitive verb phrases in SVO languages, building off of the typology described in Kalivoda (2018). Explicit formalization of syntax-prosody mapping revealed a number of unanswered questions relating to the fine details of theoretical assumptions behind prosodic mapping.

pdf bib
Evaluating Structural Economy Claims in Relative Clause Attachment
Aniello De Santo | So Young Lee
Proceedings of the Society for Computation in Linguistics 2022

2021

pdf bib
Recursive prosody is not finite-state
Hossep Dolatian | Aniello De Santo | Thomas Graf
Proceedings of the 18th SIGMORPHON Workshop on Computational Research in Phonetics, Phonology, and Morphology

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.

pdf bib
A Minimalist Approach to Facilitatory Effects in Stacked Relative Clauses
Aniello De Santo
Proceedings of the Society for Computation in Linguistics 2021

pdf bib
Learning Interactions of Local and Non-Local Phonotactic Constraints from Positive Input
Aniello De Santo | Alëna Aksënova
Proceedings of the Society for Computation in Linguistics 2021

2020

pdf bib
MG Parsing as a Model of Gradient Acceptability in Syntactic Islands
Aniello De Santo
Proceedings of the Society for Computation in Linguistics 2020

2019

pdf bib
Testing a Minimalist Grammar Parser on Italian Relative Clause Asymmetries
Aniello De Santo
Proceedings of the Workshop on Cognitive Modeling and Computational Linguistics

Stabler’s (2013) top-down parser for Minimalist grammars has been used to account for off-line processing preferences across a variety of seemingly unrelated phenomena cross-linguistically, via complexity metrics measuring “memory burden”. This paper extends the empirical coverage of the model by looking at the processing asymmetries of Italian relative clauses, as I discuss the relevance of these constructions in evaluating plausible structure-driven models of processing difficulty.

pdf bib
Sensing Tree Automata as a Model of Syntactic Dependencies
Thomas Graf | Aniello De Santo
Proceedings of the 16th Meeting on the Mathematics of Language

2016

pdf bib
An Alternate View on Strong Lexicalization in TAG
Aniello De Santo | Alëna Aksënova | Thomas Graf
Proceedings of the 12th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+12)