Anssi Yli-Jyrä

Orcid: 0000-0003-0731-2114

According to our database1, Anssi Yli-Jyrä authored at least 29 papers between 2003 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Integrating Competencies into Preventive Maintenance Scheduling with Answer Set Optimization.
Proceedings of the Foundations of Information and Knowledge Systems, 2024

2023
Pruning Redundancy in Answer Set Optimization Applied to Preventive Maintenance Scheduling.
Proceedings of the Practical Aspects of Declarative Languages, 2023

2022
Applying Answer Set Optimization to Preventive Maintenance Scheduling for Rotating Machinery.
Proceedings of the Rules and Reasoning, 2022

2021
A derivational model of discontinuous parsing.
Inf. Comput., 2021

2020
HELFI: a Hebrew-Greek-Finnish Parallel Bible Corpus with Cross-Lingual Morpheme Alignment.
Proceedings of The 12th Language Resources and Evaluation Conference, 2020

2019
Sentence embeddings in NLI with iterative refinement encoders.
Nat. Lang. Eng., 2019

How to embed noncrossing trees in Universal Dependencies treebanks in a low-complexity regular language.
J. Lang. Model., 2019

Transition-Based Coding and Formal Language Theory for Ordered Digraphs.
Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, 2019

2018
Natural Language Inference with Hierarchical BiLSTM Max Pooling Architecture.
CoRR, 2018

2017
The Power of Constraint Grammars Revisited.
CoRR, 2017

Bounded-Depth High-Coverage Search Space for Noncrossing Parses.
Proceedings of the 13th International Conference on Finite State Methods and Natural Language Processing, 2017

Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing.
Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics, 2017

2015
Three Equivalent Codes for Autosegmental Representations.
Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing, 2015

2013
On Finite-State Tonology with Autosegmental Representations.
Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing, 2013

The mathematics of language learning.
Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics, 2013

2012
Refining the Design of a Contracting Finite-State Dependency Parser.
Proceedings of the 10th International Workshop on Finite State Methods and Natural Language Processing, 2012

Implementation of Replace Rules Using Preference Operator.
Proceedings of the 10th International Workshop on Finite State Methods and Natural Language Processing, 2012

On Dependency Analysis via Contractions and Weighted FSTs.
Proceedings of the Shall We Play the Festschrift Game?, 2012

2011
Finite-state methods and models in natural language processing.
Nat. Lang. Eng., 2011

Explorations on Positionwise Flag Diacritics in Finite-State Morphology.
Proceedings of the 18th Nordic Conference of Computational Linguistics, 2011

Compiling Simple Context Restrictions with Nondeterministic Automata.
Proceedings of the Finite-State Methods and Natural Language Processing, 2011

2009
An Efficient Double Complementation Algorithm for Superposition-Based Finite-State Morphology.
Proceedings of the 17th Nordic Conference of Computational Linguistics, 2009

2008
CLARIN and Free Open Source Finite-State Tools.
Proceedings of the Finite-State Methods and Natural Language Processing, 2008

2007
A New Method for Compiling Parallel Replacement Rules.
Proceedings of the Implementation and Application of Automata, 2007

2006
Compiling Generalized Two-Level Rules and Grammars.
Proceedings of the Advances in Natural Language Processing, 2006

2005
Approximating dependency grammars through intersection of star-free regular languages.
Int. J. Found. Comput. Sci., 2005

Pivotal Synchronization Languages: A Framework for Alignments.
Proceedings of the Finite-State Methods and Natural Language Processing, 2005

2004
Approximating Dependency Grammars Through Intersection of Regular Languages.
Proceedings of the Implementation and Application of Automata, 2004

2003
Describing Syntax with Star-Free Regular Expressions.
Proceedings of the EACL 2003, 2003


  Loading...