Typology emerges from simplicity in representations and learning
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 langu...
Main Authors: | Dakotah Jay Lambert, Jonathan Rawski, Jeffrey Heinz |
---|---|
Format: | Article |
Language: | English |
Published: |
Institute of Computer Science, Polish Academy of Sciences
2021-08-01
|
Series: | Journal of Language Modelling |
Subjects: | |
Online Access: | https://jlm.ipipan.waw.pl/index.php/JLM/article/view/262 |
Similar Items
-
Statistical Relational Learning With Unconventional String Models
by: Mai H. Vu, et al.
Published: (2018-07-01) -
Learning Picture Languages Using Dimensional Reduction
by: David Kubon, et al.
Published: (2023-04-01) -
Exceptionality in Spanish Onset Clusters
by: Katerina A. Tetzloff
Published: (2020-05-01) -
Introduction to automata theory, languages, and computation /
by: Hopcroft, John E., 1939-, et al.
Published: (1979) -
Introduction to automata theory, languages, and computation /
by: Hopcroft, John E., 1939-, et al.
Published: (2001)