23 citations · 28 across the 5 of their papers we have counts for
6 papers
Recognizers for Graph-Encoding Languages
Anssi Yli-Jyrä
We introduce recurrent incidence automata (RIAs), a new automaton model motivated by a decomposition of certain two-stack visibly pushdown computations. The decomposition separates…
Hierarchical Bracketing Encodings for Dependency Parsing as Tagging
Ana Ezquerro, David Vilares, Anssi Yli-Jyrä +1
We present a family of encodings for sequence labeling dependency parsing, based on the concept of hierarchical bracketing. We prove that the existing 4-bit projective encoding bel…
HELFI: a Hebrew-Greek-Finnish Parallel Bible Corpus with Cross-Lingual Morpheme Alignment
Anssi Yli-Jyrä, Josi Purhonen, Matti Liljeqvist +4
Twenty-five years ago, morphologically aligned Hebrew-Finnish and Greek-Finnish bitexts (texts accompanied by a translation) were constructed manually in order to create an analyti…
Sentence Embeddings in NLI with Iterative Refinement Encoders
Aarne Talman, Anssi Yli-Jyrä, Jörg Tiedemann
Sentence-level representations are necessary for various NLP tasks. Recurrent neural networks have proven to be very effective in learning distributed representations and can be tr…
The Power of Constraint Grammars Revisited
Anssi Yli-Jyrä
Sequential Constraint Grammar (SCG) (Karlsson, 1990) and its extensions have lacked clear connections to formal language theory. The purpose of this article is to lay a foundation…
Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing
Anssi Yli-Jyrä, Carlos Gómez-Rodríguez
We present a simple encoding for unlabeled noncrossing graphs and show how its latent counterpart helps us to represent several families of directed and undirected graphs used in s…