Temat: formal language theory - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Modelling a subregular bias in phonological learning with Recurrent Neural Networks
Autorzy:: Prickett, Brandon
Powiązania:: https://bibliotekanauki.pl/articles/2061408.pdf
Data publikacji:: 2021
Wydawca:: Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:: neural networks
learning bias
formal language theory
phonology
Opis:: A number of experiments have demonstrated what seems to be a bias in human phonological learning for patterns that are simpler according to Formal Language Theory (Finley and Badecker 2008; Lai 2015; Avcu 2018). This paper demonstrates that a sequence-to-sequence neural network (Sutskever et al. 2014), which has no such restriction explicitly built into its architecture, can successfully capture this bias. These results suggest that a bias for patterns that are simpler according to Formal Language Theory may not need to be explicitly incorporated into models of phonological learning.
Źródło:: Journal of Language Modelling; 2021, 9, 1; 67--96
2299-856X
2299-8470
Pojawia się w:: Journal of Language Modelling
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 2.

Tytuł:: Typology emerges from simplicity in representations and learning
Autorzy:: Lambert, Dakotah
Rawski, Jonathan
Heinz, Jeffrey
Powiązania:: https://bibliotekanauki.pl/articles/2061410.pdf
Data publikacji:: 2021
Wydawca:: Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:: model theory
subregularity
grammatical inference
formal language theory
phonology
learning
complexity
Opis:: We derive well-understood and well-studied subregular classes of formal languages purely from the computational perspective of algorithmic learning problems. We parameterise the learning problem along dimensions of representation and inference strategy. Of special interest are those classes of languages whose learning algorithms are necessarily not prohibitively expensive in space and time, since learners are often exposed to adverse conditions and sparse data. Learned natural language patterns are expected to be most like the patterns in these classes, an expectation supported by previous typological and linguistic research in phonology. A second result is that the learning algorithms presented here are completely agnostic to choice of linguistic representation. In the case of the subregular classes, the results fall out from traditional model-theoretic treatments of words and strings. The same learning algorithms, however, can be applied to model-theoretic treatments of other linguistic representations such as syntactic trees or autosegmental graphs, which opens a useful direction for future research.
Źródło:: Journal of Language Modelling; 2021, 9, 1; 151--194
2299-856X
2299-8470
Pojawia się w:: Journal of Language Modelling
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Skocz do pozycji: 3.

Tytuł:: Type Theories and Lexical Networks : using Serious Games as the basis for Multi-Sorted Typed Systems
Autorzy:: Chatzikyriakidis, S.
Lafourcade, M.
Ramadier, L.
Zarrouk, M.
Powiązania:: https://bibliotekanauki.pl/articles/103833.pdf
Data publikacji:: 2017
Wydawca:: Polska Akademia Nauk. Instytut Podstaw Informatyki PAN
Tematy:: lexical networks
JeuxDeMots
type theory
type ontologies
formal semantics
natural language inference
Opis:: In this paper, we show how a rich lexico-semantic network which Has been built using serious games, JeuxDeMots, can help us in grounding our semantic ontologies in doing formal semantics using rich or modern type theories (type theories within the tradition of Martin Löf). We discuss the issue of base types, adjectival and verbal types, hyperonymy/hyponymy relations as well as more advanced issues like homophony and polysemy. We show how one can take advantage of this wealth of lexical semantics in a formal compositional semantics framework. We argue that this is a way to sidestep the problem of deciding what the type ontology should look like once a move to a many sorted type system has been made. Furthermore, we show how this kind of information can be extracted from a lexico-semantic Network like JeuxDeMots and inserted into a proof-assistant like Coq in order to perform reasoning tasks.
Źródło:: Journal of Language Modelling; 2017, 5, 2; 229-272
2299-856X
2299-8470
Pojawia się w:: Journal of Language Modelling
Dostawca treści:: Biblioteka Nauki

Artykuł

Zmień widok

na półce

Informacja

Wyszukujesz frazę "formal language theory" wg kryterium: Temat

Źródło danych

Dostawca treści

Kolekcja

Rok wydania

Wydawca

Temat

Autor

Typ dokumentu

Język