Mark-Jan Nederhof
Mark-Jan Nederhof
Verified email at st-andrews.ac.uk
Title
Cited by
Cited by
Year
Algorithms and theory of computation handbook, volume 2: special topics and techniques
MJ Atallah, M Blanton
CRC press, 2009
807*2009
Modular proof of strong normalization for the calculus of constructions
H Geuvers, MJ Nederhof
Journal of Functional Programming 1 (2), 155-189, 1991
1721991
Systems and methods for generating weighted finite-state automata representing grammars
M Mohri, MJ Nederhof
US Patent 7,181,386, 2007
1552007
Systems and methods for generating weighted finite-state automata representing grammars
M Mohri, MJ Nederhof
US Patent 7,181,386, 2007
1552007
Systems and methods for generating weighted finite-state automata representing grammars
M Mohri, MJ Nederhof
US Patent 7,181,386, 2007
1552007
Systems and methods for generating weighted finite-state automata representing grammars
M Mohri, MJ Nederhof
US Patent 7,181,386, 2007
1522007
Practical experiments with regular approximation of context-free languages
MJ Nederhof
Computational Linguistics 26 (1), 17-44, 2000
1252000
Robust grammatical analysis for spoken dialogue systems
G Van Noord, G Bouma, R Koeling, MJ Nederhof
Natural language engineering 5 (1), 45-93, 1999
1121999
Regular approximation of context-free grammars through transformation
M Mohri, MJ Nederhof
Robustness in language and speech technology, 153-163, 2001
942001
Weighted deductive parsing and Knuth's algorithm
MJ Nederhof
Computational Linguistics 29 (1), 135-143, 2003
792003
Regular approximation of CFLs: a grammatical view
MJ Nederhof
Advances in Probabilistic and other Parsing Technologies, 221-241, 2000
662000
Generalized left-corner parsing
MJ Nederhof
Proceedings of the sixth conference on European chapter of the Association …, 1993
511993
Probabilistic parsing as intersection
MJ Nederhof, G Satta
Proceedings of the Eighth International Conference on Parsing Technologies …, 2003
492003
Linguistic parsing and program transformations
MJ Nederhof
[Sl: sn], 1994
421994
Increasing the applicability of LR parsing
MJ Nederhof, JJ Sarbo
Katholieke Universiteit Nijmegen, Department of Informatics, Faculty of …, 1993
411993
Increasing the applicability of LR parsing
MJ Nederhof, JJ Sarbo
Katholieke Universiteit Nijmegen, Department of Informatics, Faculty of …, 1993
411993
The computational complexity of the correct-prefix property for TAGs
MJ Nederhof
Computational Linguistics 25 (3), 345-360, 1999
391999
Regular approximation of context-free grammars through transformation
M Mohri, MJ Nederhof
Robustness in language and speech technology 9, 251-261, 2000
362000
Solving the correct-prefix property for TAGs
MJ Nederhof
Proc. of MOL-5, 124-130, 1997
331997
LEXUS, a web-based tool for manipulating lexical resources
M Kemps-Snijders, MJ Nederhof, P Wittenburg
5th International Conference on Language Resources and Evaluation (LREC 2006 …, 2006
312006
The system can't perform the operation now. Try again later.
Articles 1–20