| Compiling contextual restrictions on strings into finite-state automata AM Yli-Jyrä, K Koskenniemi Proceedings of the Eindhoven FASTAR Days 2004, Proceedings. Computer Science …, 2004 | 36 | 2004 |
| Multiplanarity-a model for dependency structures in treebanks AM Yli-Jyrä TLT 2003, Proceedings of the Second Workshop on Treebanks and Linguistic …, 2003 | 36 | 2003 |
| Natural language inference with hierarchical bilstm max pooling architecture A Talman, A Yli-Jyrä, J Tiedemann arXiv preprint arXiv:1808.08762, 2018 | 25* | 2018 |
| Compiling generalized two-level rules and grammars A Yli-Jyrä, K Koskenniemi International Conference on Natural Language Processing (in Finland), 174-185, 2006 | 17 | 2006 |
| Describing syntax with star-free regular expressions A Yli-Jyrä 10th Conference of the European Chapter of the Association for Computational …, 2003 | 17 | 2003 |
| Axiomatization of restricted non-projective dependency trees through finite-state constraints that analyse crossing bracketings A Yli-Jyrä Proceedings of the Workshop on Recent Advances in Dependency Grammar, 25-32, 2004 | 15 | 2004 |
| On finite-state tonology with autosegmental representations AM Yli-Jyrä Proceedings of the 11th international conference on finite state methods and …, 2013 | 12 | 2013 |
| Transducers from parallel replace rules and modes with generalized lenient composition A Yli-Jyrä 6th international workshop, finite-state methods and natural language …, 2008 | 12 | 2008 |
| Approximating dependency grammars through intersection of star-free regular languages A Yli-Jyrä International Journal of Foundations of Computer Science 16 (03), 565-579, 2005 | 12 | 2005 |
| Inquiries into words, constraints and contexts: Festschrift in the honour of Kimmo Koskenniemi on his 60th birthday A Arppe, L Carlson, K Lindén, JO Piitulainen, M Suominen, M Vainio, ... CSLI publications, 2005 | 12* | 2005 |
| Toward a widely usable finite-state morphology workbench for less studied languages, 1: Desiderata A Yli-Jyrä Nordic Journal of African Studies, 2005 | 12 | 2005 |
| Contributions to the theory of finite-state based grammars A Yli-Jyrä Helsingin yliopisto, 2005 | 11 | 2005 |
| Regular approximations through labeled bracketing (revised version) AM Yli-Jyrä Unknown host publication, 2003 | 9 | 2003 |
| Applications of diamonded double negation A Yli-Jyrä Finite State Methods and Natural Language Processing, 6, 2008 | 8 | 2008 |
| Simplification of intermediate results during intersection of multiple weighted automata A Yli-Jyrä Weighted Automata: Theory and Applications, 46-48, 2004 | 8 | 2004 |
| On dependency analysis via contractions and weighted FSTs A Yli-Jyrä Shall We Play the Festschrift Game?, 133-158, 2012 | 6 | 2012 |
| A hierarchy of mildly context sensitive dependency grammar AM Yli-Jyrä Proceedings of Formal Grammar 2004, 2004 | 6 | 2004 |
| An efficient constraint grammar parser based on inward deterministic automata AM Yli-Jyrä Proceedings of the NODALIDA 2011 workshop constraint grammar applications, 2011 | 5 | 2011 |
| CLARIN and free open source finite-state tools K Koskenniemi, A Yli-Jyrä Proceedings of the 2009 conference on Finite-State Methods and Natural …, 2009 | 5 | 2009 |
| A new method for compiling parallel replacement rules A Yli-Jyrä, K Koskenniemi International Conference on Implementation and Application of Automata, 320-321, 2007 | 5 | 2007 |
Aarne TalmanUniversity of Helsinki, NordcloudVerified email at helsinki.fi
