Results 1 to 10 of about 67,946 (121)

How word semantics and phonology affect handwriting of Alzheimer's patients: a machine learning based analysis [PDF]

Computers in Biology and Medicine 169 (2024) 107891, 2023
Using kinematic properties of handwriting to support the diagnosis of neurodegenerative disease is a real challenge: non-invasive detection techniques combined with machine learning approaches promise big steps forward in this research field. In literature, the tasks proposed focused on different cognitive skills to elicitate handwriting movements.
arxiv   +1 more source

Differentiable Generative Phonology [PDF]

arXiv, 2021
The goal of generative phonology, as formulated by Chomsky and Halle (1968), is to specify a formal system that explains the set of attested phonological strings in a language. Traditionally, a collection of rules (or constraints, in the case of optimality theory) and underlying forms (UF) are posited to work in tandem to generate phonological strings.
arxiv  

Speech vocoding for laboratory phonology [PDF]

Computer Speech & Language, Volume 42, March 2017, Pages 100-121, 2016
Using phonological speech vocoding, we propose a platform for exploring relations between phonology and speech processing, and in broader terms, for exploring relations between the abstract and physical structures of a speech signal. Our goal is to make a step towards bridging phonology and speech processing and to contribute to the program of ...
arxiv   +1 more source

Sample-efficient Linguistic Generalizations through Program Synthesis: Experiments with Phonology Problems [PDF]

arXiv, 2021
Neural models excel at extracting statistical patterns from large amounts of data, but struggle to learn patterns or reason about language from only a few examples. In this paper, we ask: Can we learn explicit rules that generalize well from only a few examples? We explore this question using program synthesis.
arxiv  

A Czech Morphological Lexicon [PDF]

Proceedings of the Third Meeting of the ACL Special Interest Group in Computational Phonology, pp. 41-47, Madrid, July 1997. ACL, 1997
In this paper, a treatment of Czech phonological rules in two-level morphology approach is described. First the possible phonological alternations in Czech are listed and then their treatment in a practical application of a Czech morphological lexicon.
arxiv  

Parsing Using Linearly Ordered Phonological Rules [PDF]

arXiv, 1994
A generate and test algorithm is described which parses a surface form into one or more lexical entries using linearly ordered phonological rules. This algorithm avoids the exponential expansion of search space which a naive parsing algorithm would face by encoding into the form being parsed the ambiguities which arise during parsing. The algorithm has
arxiv  

Unsupervised Discovery of Phonological Categories through Supervised Learning of Morphological Rules [PDF]

Proceedings COLING 1996, Copenhagen, 1996
We describe a case study in the application of {\em symbolic machine learning} techniques for the discovery of linguistic rules and categories. A supervised rule induction algorithm is used to learn to predict the correct diminutive suffix given the phonological representation of Dutch nouns.
arxiv  

A Finite State and Rule-based Akshara to Prosodeme (A2P) Converter in Hindi [PDF]

arXiv, 2017
This article describes a software module called Akshara to Prosodeme (A2P) converter in Hindi. It converts an input grapheme into prosedeme (sequence of phonemes with the specification of syllable boundaries and prosodic labels). The software is based on two proposed finite state machines\textemdash one for the syllabification and another for the ...
arxiv  

Measuring the Functional Load of Phonological Contrasts [PDF]

arXiv, 2003
Frequency counts are a measure of how much use a language makes of a linguistic unit, such as a phoneme or word. However, what is often important is not the units themselves, but the contrasts between them. A measure is therefore needed for how much use a language makes of a contrast, i.e. the functional load (FL) of the contrast.
arxiv  

An Efficient Compiler for Weighted Rewrite Rules [PDF]

34th Annual Meeting of the ACL, 1996
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, such rewrite rules can be represented as finite-state transducers (FSTs). We describe a new algorithm for compiling rewrite rules into FSTs.
arxiv