Suivre
Mark-Jan Nederhof
Mark-Jan Nederhof
Adresse e-mail validée de st-andrews.ac.uk
Titre
Citée par
Citée par
Année
Systems and methods for generating weighted finite-state automata representing grammars
M Mohri, MJ Nederhof
US Patent 7,181,386, 2007
1902007
Systems and methods for generating weighted finite-state automata representing grammars
M Mohri, MJ Nederhof
US Patent 7,181,386, 2007
1902007
Systems and methods for generating weighted finite-state automata representing grammars
M Mohri, MJ Nederhof
US Patent 7,181,386, 2007
1902007
Systems and methods for generating weighted finite-state automata representing grammars
M Mohri, MJ Nederhof
US Patent 7,181,386, 2007
1872007
Modular proof of strong normalization for the calculus of constructions
H Geuvers, MJ Nederhof
Journal of Functional Programming 1 (2), 155-189, 1991
1801991
Practical experiments with regular approximation of context-free languages
MJ Nederhof
Computational Linguistics 26 (1), 17-44, 2000
1262000
Robust grammatical analysis for spoken dialogue systems
G Van Noord, G Bouma, R Koeling, MJ Nederhof
Natural language engineering 5 (1), 45-93, 1999
1171999
Regular approximation of context-free grammars through transformation
M Mohri, MJ Nederhof
Robustness in language and speech technology, 153-163, 2001
982001
Weighted deductive parsing and Knuth's algorithm
MJ Nederhof
Computational Linguistics 29 (1), 135-143, 2003
912003
Regular approximation of CFLs: a grammatical view
MJ Nederhof
Advances in Probabilistic and other Parsing Technologies, 221-241, 2000
682000
Probabilistic parsing as intersection
MJ Nederhof, G Satta
Proceedings of the Eighth International Conference on Parsing Technologies …, 2003
532003
Generalized left-corner parsing
MJ Nederhof
Sixth Conference of the European Chapter of the Association for …, 1993
511993
Linguistic parsing and program transformations
MJ Nederhof
[Sl: sn], 1994
431994
Increasing the applicability of LR parsing
MJ Nederhof, JJ Sarbo
Proceedings of the Third International Workshop on Parsing Technologies, 187-202, 1993
431993
Increasing the applicability of LR parsing
MJ Nederhof, JJ Sarbo
Proceedings of the Third International Workshop on Parsing Technologies, 187-202, 1993
431993
The computational complexity of the correct-prefix property for TAGs
MJ Nederhof
Computational Linguistics 25 (3), 345-360, 1999
411999
Regular approximation of context-free grammars through transformation
M Mohri, MJ Nederhof
Robustness in language and speech technology 9, 251-261, 2000
402000
Computing partition functions of PCFGs
MJ Nederhof, G Satta
Research on Language and Computation 6 (2), 139-162, 2008
342008
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
302006
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20