Open access publication of this volume supported by National Research, Development and Innovation Office grant NKFIH #120145 `Deep Learning of Morphological Structure'.Giving birth to Finite State Phonology is classically attributed to Johnson (1972), and Kaplan and Kay (1994). However, there is an ear- lier discovery that was very close to this achievement. In 1965, Hennie presented a very general sufficient condition for regularity of Turing machines. Although this discovery happened chronologically before Generative Phonology (Chomsky and Halle, 1968), it is a mystery why its relevance has not been realized until recently (Yli-Jyrä, 2017). The antique work of Hennie provides enough generality to advance even today’s frontier of finite-st...
We propose DFSM's as an extension of finite state machines, explore some of their properties, a...
This paper presents a method for learning phonological rules from sample pairs of underlying and sur...
this paper we present a finite-state model of phonology in which automata are the descriptions and t...
Giving birth to Finite State Phonology is classically attributed to Johnson (1972), and Kaplan and K...
We describe the use of finite state automata for the description of natural languages. We demonstrat...
Autosegmental Phonology is studied in the framework of Formal Language Theory, which classifies the ...
This dissertation is concerned with finite state machine-based technology for modeling natural langu...
Autosegmental Phonology is studied in the framework of Formal Language Theory, which classifies the ...
This dissertation is a theoretical study of finite-state based grammars used in natural language pro...
A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequen...
this paper we report on some ongoing research that is directed at solving these two problems in the ...
This paper presents a method for learning phonological rules from sample pairs of under-lying and su...
Rcccnt mathcmatical and algorithmic rcsults in thc field of fmite-state tcchnology, as well as thc i...
Standard Optimality-Theoretic grammars contain only the information necessary to transform inputs in...
This paper presents a set of mathematical and computational tools for manipulating and rea-soning ab...
We propose DFSM's as an extension of finite state machines, explore some of their properties, a...
This paper presents a method for learning phonological rules from sample pairs of underlying and sur...
this paper we present a finite-state model of phonology in which automata are the descriptions and t...
Giving birth to Finite State Phonology is classically attributed to Johnson (1972), and Kaplan and K...
We describe the use of finite state automata for the description of natural languages. We demonstrat...
Autosegmental Phonology is studied in the framework of Formal Language Theory, which classifies the ...
This dissertation is concerned with finite state machine-based technology for modeling natural langu...
Autosegmental Phonology is studied in the framework of Formal Language Theory, which classifies the ...
This dissertation is a theoretical study of finite-state based grammars used in natural language pro...
A grammar can be regarded as a device that enumerates the sentences of a language. We study a sequen...
this paper we report on some ongoing research that is directed at solving these two problems in the ...
This paper presents a method for learning phonological rules from sample pairs of under-lying and su...
Rcccnt mathcmatical and algorithmic rcsults in thc field of fmite-state tcchnology, as well as thc i...
Standard Optimality-Theoretic grammars contain only the information necessary to transform inputs in...
This paper presents a set of mathematical and computational tools for manipulating and rea-soning ab...
We propose DFSM's as an extension of finite state machines, explore some of their properties, a...
This paper presents a method for learning phonological rules from sample pairs of underlying and sur...
this paper we present a finite-state model of phonology in which automata are the descriptions and t...