Dr Mark-Jan Nederhof
Dr Mark-Jan Nederhof
Lecturer - School of Computer Science
Email: mn31@st-andrews.ac.uk
Office: JC0.06
Phone: +44 (0)1334 461638
Dr. Mark-Jan has been a Lecturer in Computer Science at the University of St Andrews since November 2006. His research interests pertain to mathematical models of the syntax of natural languages, as well as of programming languages. He is also interested in computer processing of Ancient Egyptian, with an emphasis on the hieroglyphic writing system. He will be chairing the FSMNLP 2013 conference in St Andrews. He currently supervises one PhD student Vinodh Rajan. For more information visit his full website.
Recent Publications
- Nederhof, MJ 2021, Calculating the optimal step of arc-eager parsing for non-projective trees. in Proceedings of the 16th Conference of the European Chapter of the Association of Computational Linguistics (EACL 2021). Association for Computational Linguistics, pp. 2273–2283, 16th Conference of the European Chapter of the ACL, Kyiv, Ukraine, 19/04/21. <https://www.aclweb.org/anthology/2021.eacl-main.193>
- Nederhof, M-J & Yli-Jyrä, A 2020, 'A derivational model of discontinuous parsing', Information and Computation, vol. In press, 104619. https://doi.org/10.1016/j.ic.2020.104619
- Nederhof, MJ & Vogler, H 2019, Regular transductions with MCFG input syntax. in A Maletti & H Vogler (eds), Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing. Association for Computational Linguistics, Dresden, pp. 56-64, 14th International Conference on Finite-State Methods and Natural Language Processing, Dresden, Germany, 23/09/19. <https://www.aclweb.org/anthology/W19-3109/>
- Nederhof, MJ & Yli-Jyra, A 2017, A derivational model of discontinuous parsing. in F Drewes, C Martin-Vide & B Truthe (eds), Language and Automata Theory and Applications: 11th International Conference, LATA 2017, Umeå, Sweden, March 6-9, 2017, Proceedings. Lecture Notes in Computer Science (Theoretical Computer Science and General Issues), vol. 10168, Springer, Cham, pp. 299-310, 11th International Conference on Language and Automata Theory and Applications, Umeå, Sweden, 6/03/17. https://doi.org/10.1007/978-3-319-53733-7_22
- Nederhof, MJ & Rahman, F 2017, 'A probabilistic model of Ancient Egyptian writing', Journal of Language Modelling, vol. 5, no. 1, pp. 131-163. https://doi.org/10.15398/jlm.v5i1.150
- Gebhardt, K, Nederhof, MJ & Vogler, H 2017, 'Hybrid grammars for parsing of discontinuous phrase structures and non-projective dependency structures', Computational Linguistics, vol. 43, no. 3, pp. 465-520. https://doi.org/10.1162/COLI_a_00291
- Nederhof, MJ 2016, A short proof that O2 is an MCFL. in 54th Annual meeting of the Association for Computational Linguistics: Proceedings of the Conference. Association for Computational Linguistics, Berlin, 54th Annual meeting of the Association for Computational Linguistics, Berlin, Germany, 7/08/16.
- Nederhof, MJ, Teichmann, M & Vogler, H 2016, 'Non-self-embedding linear context-free tree grammars generate regular tree languages', Journal of Automata, Languages Combinatorics, vol. 21, no. 3, pp. 203-246. https://doi.org/10.25596/jalc-2016-203
- Nederhof, MJ 2016, Transition-based dependency parsing as latent-variable constituent parsing. in Proceedings of the SIGFSM Workshop on Statistical NLP and Weighted Automata. Association for Computational Linguistics, Berlin, pp. 21-31, 54th Annual meeting of the Association for Computational Linguistics, Berlin, Germany, 7/08/16.