Computer Science @ University of St Andrews

University of St Andrews crest

Dr Mark-Jan Nederhof

Dr Mark-Jan Nederhof

Position: Lecturer

Research profile

Email (@st-andrews.ac.uk): mn31

Office: JC0.06 - Jack Cole Building, North Haugh

Phone: +44 (0)1334 46 1638

Home page: https://mjn.host.cs.st-andrews.ac.uk

Recent Publications

Hybrid grammars for parsing of discontinuous phrase structures and non-projective dependency structures

A probabilistic model of Ancient Egyptian writing

A derivational model of discontinuous parsing

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-9 March. DOI: 10.1007/978-3-319-53733-7_22

Transition-based dependency parsing as latent-variable constituent parsing

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, 54th Annual meeting of the Association for Computational Linguistics, Berlin, Germany, 7-12 August.

A short proof that O2 is an MCFL

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-12 August.

Non-self-embedding linear context-free tree grammars generate regular tree languages

Count-based state merging for probabilistic regular tree grammars

Dietze, T & Nederhof, MJ 2015, Count-based state merging for probabilistic regular tree grammars. in Proceedings of the 12th International Conference on Finite State Methods and Natural Language Processing. Association for Computational Linguistics, Duesseldorf, Germany, The 12th International Conference on Finite-State Methods and Natural Language Processing, Düsseldorf, Germany, 22-24 June.

A probabilistic model of Ancient Egyptian writing

Nederhof, MJ & Rahman, F 2015, A probabilistic model of Ancient Egyptian writing. in Proceedings of the 12th International Conference on Finite State Methods and Natural Language Processing. Association for Computational Linguistics, Duesseldorf, Germany, The 12th International Conference on Finite-State Methods and Natural Language Processing, Düsseldorf, Germany, 22-24 June.

Hybrid Grammars for Discontinuous Parsing

Nederhof, MJ & Vogler, H 2014, Hybrid Grammars for Discontinuous Parsing. in 25th International Conference on Computational Linguistics. Association for Computational Linguistics, Dublin, Ireland, pp. 1370-1381.

Deterministic Parsing using PCFGs

Nederhof, MJ & McCaffery, M 2014, Deterministic Parsing using PCFGs. in 14th Conference of the European Chapter of the Association for Computational Linguistics. Association for Computational Linguistics, Gothenburg, Sweden, pp. 338-347.