Transition-Based Coding and Formal Language Theory for Ordered Digraphs

no code implementations • WS 2019 • Anssi Yli-Jyr{\"a}

Transition-based parsing of natural language uses transition systems to build directed annotation graphs (digraphs) for sentences.

Bounded-Depth High-Coverage Search Space for Noncrossing Parses

1 code implementation • WS 2017 • Anssi Yli-Jyr{\"a}

Dependency Parsing Vocal Bursts Intensity Prediction

Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing

1 code implementation • ACL 2017 • Anssi Yli-Jyr{\"a}, Carlos G{\'o}mez-Rodr{\'\i}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 syntactic and semantic parsing of natural language as context-free languages.

Dependency Parsing Semantic Parsing

Three Equivalent Codes for Autosegmental Representations

no code implementations • WS 2015 • Anssi Yli-Jyr{\"a}

Machine Translation

The mathematics of language learning

no code implementations • ACL 2013 • Andr{\'a}s Kornai, Gerald Penn, James Rogers, Anssi Yli-Jyr{\"a}

Natural Language Inference Optical Character Recognition (OCR) +1

On Finite-State Tonology with Autosegmental Representations

no code implementations • WS 2013 • Anssi Yli-Jyr{\"a}

Refining the Design of a Contracting Finite-State Dependency Parser

no code implementations • WS 2012 • Anssi Yli-Jyr{\"a}, Jussi Piitulainen, Atro Voutilainen

Dependency Parsing

Implementation of Replace Rules Using Preference Operator

no code implementations • WS 2012 • Senka Drobac, Miikka Silfverberg, Anssi Yli-Jyr{\"a}