6 citations · 6 across the 3 of their papers we have counts for
Showing cs.FLShow all
2 papers · 1 filter
cs.FL2018
The problem with probabilistic DAG automata for semantic graphs
Ieva Vasiljeva, Sorcha Gilroy, Adam Lopez
Semantic representations in the form of directed acyclic graphs (DAGs) have been introduced in recent years, and to model them, we need probabilistic models of DAGs. One model that…
cs.FL2017★ 6 cited
Recurrent Neural Networks as Weighted Language Recognizers
Yining Chen, Sorcha Gilroy, Andreas Maletti +2
We investigate the computational complexity of various problems for simple recurrent neural networks (RNNs) as formal models for recognizing weighted languages. We focus on the sin…