Dr Mark-Jan Nederhof
Lecturer
Research profileEmail: mn31@st-andrews.ac.uk
Room: 0.06 - Jack Cole Building, North Haugh
Direct phone: +44 (0)1334 461638
Home page: http://mjn.host.cs.st-andrews.ac.uk
Recent Publications
Splittability of bilexical context-free grammars is undecidable
Nederhof, MJ
& Satta, G 2011, '
Splittability of bilexical context-free grammars is undecidable
'
Computational Linguistics
, vol 37, no. 4, pp. 867-879.
Tree parsing with synchronous tree-adjoining grammars
B¨uchse, M
, Nederhof, MJ
& Vogler, H 2011, '
Tree parsing with synchronous tree-adjoining grammars
'. in
Proceedings of the 12th International Conference on Parsing Technologies (IWPT 2011).
Association for Computational Linguistics, Stroudsburg, PA, pp. 14-25, 12th International Conference on Parsing Technologies, Dublin, Ireland, 5-7 October.
Prefix probabilities for linear context-free rewriting systems
Nederhof, MJ
& Satta, G 2011, '
Prefix probabilities for linear context-free rewriting systems
'. in
Proceedings of the 12th International Conference on Parsing Technologies (IWPT 2011).
Association for Computational Linguistics, Stroudsburg, PA, pp. 151â162, 12th International Conference on Parsing Technologies, Dublin, Ireland, 5-7 October.
Parsing of partially bracketed structures for parse selection
Nederhof, MJ
& S´anchez-S´aez, R 2011, '
Parsing of partially bracketed structures for parse selection
'. in
Proceedings of the 12th International Conference on Parsing Technologies (IWPT 2011).
Association for Computational Linguistics, Stroudsburg, PA, pp. 231â240, 12th International Conference on Parsing Technologies, Dublin, Ireland, 5-7 October.
Computation of infix probabilities for probabilistic context-free grammars
Nederhof, MJ
& Satta, G 2011, '
Computation of infix probabilities for probabilistic context-free grammars
'. in
Proceedings of the ACL Conference on Empirical Methods in Natural Language Processing (EMNLP 2011).
Association for Computational Linguistics, Stroudsburg, PA, pp. 1213-1221, 2011 Conference on Empirical Methods on Natural Language Processing, Edinburgh, United Kingdom, 27-29 July.
Prefix Probability for Probabilistic Synchronous Context-Free Grammars
Nederhof, MJ
& Satta, G 2011, '
Prefix Probability for Probabilistic Synchronous Context-Free Grammars
'. in D Lin, Y Matsumoto & R Mihalcea (eds),
The 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Proceedings of the Conference, 19-24 June, 2011, Portland, Oregon, USA.
Association for Computational Linguistics, pp. 460â469, 49th Annual Meeting of the Association for Computational Linguistics, Portland, Oregon, United States, 19-24 June.
Transforming lexica as trees
Nederhof, MJ
2010, '
Transforming lexica as trees
'. in
Workshop on Applications of Tree Automata in Natural Language Processing: Proceedings of a meeting held 16 July 2010, Uppsala, Sweden. Held at ACL 2010.
Curran Associates, Inc., Sweden, pp. 37-45.
Algorithmic aspects of natural language processing
Nederhof, MJ
& Satta, G 2010, '
Algorithmic aspects of natural language processing
'. in M Atallah & M Blanton (eds),
Algorithms and Theory of Computation Handbook: Special Topics and Techniques.
2nd edn, vol. 2, Applied algorithms and data structures, CRC Press, pp. Chapter 23.
Automatic alignment of hieroglyphs and transliteration
Nederhof, MJ
2009, '
Automatic alignment of hieroglyphs and transliteration
'. in N Strudwick (ed.),
Information Technology and Egyptology in 2008: Proceedings of the meeting of the Computer Working Group of the International Association of Egyptologists.
Bible in Technology, no. 2, Gorgias Press, pp. 71-92.
Weighted parsing of trees
Nederhof, MJ
2009, '
Weighted parsing of trees
' Paper presented at 11th International Conference on Parsing Technologies, Paris, France,
7/10/09
-
9/10/09
, pp. 13-24.


Follow us: