Modular Proof of Strong Normalization for the Calculus of Constructions. - Herman Geuvers; Mark-Jan Nederhof (J. Funct. Program., 1991)

Generalized Left-Corner Parsing. - Mark-Jan Nederhof (EACL, 1993)

A New Top-Down Parsing Algorithm for Left-Recursive DCGs. - Mark-Jan Nederhof (PLILP, 1993)

Partial Evaluation Grammars. - Mark-Jan Nederhof; Janos J. Sarbo (Comput. Lang., 1993)

An Optimal Tabular Parsing Algorithm. - Mark-Jan Nederhof (ACL, 1994)

An Extended Theory of Head-Driven Parsing. - Mark-Jan Nederhof; Giorgio Satta (ACL, 1994)

Reversible Pushdown Automata and Bidirectional Parsing. - Mark-Jan Nederhof (Developments in Language Theory, 1995)

Efficient Tabular LR Parsing. - Mark-Jan Nederhof; Giorgio Satta (ACL, 1996)

Linear-Time Suffix Parsing for Deterministic Languages. - Mark-Jan Nederhof; Eberhard Bertsch (J. ACM, 1996)

Efficient generation of random sentences. - Mark-Jan Nederhof (Nat. Lang. Eng., 1996)

An innovative finite state concept for recognition and parsing of context-free languages. - Mark-Jan Nederhof; Eberhard Bertsch (Nat. Lang. Eng., 1996)

A Variant of Earley Parsing. - Mark-Jan Nederhof; Giorgio Satta (AI*IA, 1997)

Grammatical analysis in the OVIS spoken-dialogue system. - Mark-Jan Nederhof; Gosse Bouma; Rob Koeling; Gertjan van Noord (Real Applications@ACL/EACL, 1997)

Regular Approximations of CFLs: A Grammatical View. - Mark-Jan Nederhof (IWPT, 1997)

An Alternative LR Algorithm for TAGs. - Mark-Jan Nederhof (COLING-ACL, 1998)

Prefix Probabilities from Stochastic Tree Adjoining Grammars. - Mark-Jan Nederhof; Anoop Sarkar; Giorgio Satta (COLING-ACL, 1998)

Prefix probabilities for linear indexed grammars. - Mark-Jan Nederhof; Anoop Sarkar; Giorgio Satta (TAG+, 1998)

Linear Indexed Automata and Tabulation of TAG Parsing. - Mark-Jan Nederhof (TAPD, 1998)

The Computational Complexity of the Correct-Prefix Property for TAGs. - Mark-Jan Nederhof (Comput. Linguistics, 1999)

Robust grammatical analysis for spoken dialogue systems. - Gertjan van Noord; Gosse Bouma; Rob Koeling; Mark-Jan Nederhof (Nat. Lang. Eng., 1999)

Regular Closure of Deterministic Languages. - Eberhard Bertsch; Mark-Jan Nederhof (SIAM J. Comput., 1999)

On Failure of the Pruning Technique in "Error Repair in Shift-Reduce Parsers". - Eberhard Bertsch; Mark-Jan Nederhof (ACM Trans. Program. Lang. Syst., 1999)

Left-To-Right Parsing and Bilexical Context-Free Grammars. - Mark-Jan Nederhof; Giorgio Satta (ANLP, 2000)

Preprocessing for Unification Parsing of Spoken Language. - Mark-Jan Nederhof (Natural Language Processing, 2000)

Practical Experiments with Regular Approximation of Context-free Languages. - Mark-Jan Nederhof (Comput. Linguistics, 2000)

Tabulation of Automata for Tree-Adjoining Languages. - Miguel A. Alonso 001; Mark-Jan Nederhof; Éric Villemonte de la Clergerie (Grammars, 2000)

Approximating Context-Free by Rational Transduction for Example-Based MT. - Mark-Jan Nederhof (DDMMT@ACL, 2001)

On the Complexity of Some Extensions of RCG Parsing. - Eberhard Bertsch; Mark-Jan Nederhof (IWPT, 2001)

Size/lookahead tradeoff for LL(k)-grammars. - Eberhard Bertsch; Mark-Jan Nederhof (Inf. Process. Lett., 2001)

Parsing non-recursive CFGs. - Mark-Jan Nederhof; Giorgio Satta (ACL, 2002)

Probabilistic Parsing as Intersection. - Mark-Jan Nederhof; Giorgio Satta (IWPT, 2003)

Partially Ordered Multiset Context-free Grammars and Free-word-order Parsing. - Mark-Jan Nederhof; Giorgio Satta; Stuart M. Shieber (IWPT, 2003)

Weighted Deductive Parsing and Knuth's Algorithm. - Mark-Jan Nederhof (Comput. Linguistics, 2003)

An Alternative Method of Training Probabilistic LR Parsers. - Mark-Jan Nederhof; Giorgio Satta (ACL, 2004)

Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata. - Mark-Jan Nederhof; Giorgio Satta (COLING, 2004)

Tabular Parsing - Mark-Jan Nederhof; Giorgio Satta (CoRR, 2004)

The language intersection problem for non-recursive context-free grammars. - Mark-Jan Nederhof; Giorgio Satta (Inf. Comput., 2004)

Fast parallel recognition of LR language suffixes. - Eberhard Bertsch; Mark-Jan Nederhof (Inf. Process. Lett., 2004)

IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing. - Mark-Jan Nederhof; Giorgio Satta (J. Artif. Intell. Res., 2004)

Parsing Partially Bracketed Input. - Martijn Wieling 001; Mark-Jan Nederhof; Gertjan van Noord (CLIN, 2005)

A General Technique to Train Language Models on Language Models. - Mark-Jan Nederhof (Comput. Linguistics, 2005)

Gap Parsing with LL(1) Grammars. - Eberhard Bertsch; Mark-Jan Nederhof (Grammars, 2005)

LEXUS, a web-based tool for manipulating lexical resources lexicon. - Marc Kemps-Snijders; Mark-Jan Nederhof; Peter Wittenburg (LREC, 2006)

Estimation of Consistent Probabilistic Context-free Grammars. - Mark-Jan Nederhof; Giorgio Satta (HLT-NAACL, 2006)

Probabilistic parsing strategies. - Mark-Jan Nederhof; Giorgio Satta (J. ACM, 2006)

Some observations on LR-like parsing with delayed reduction. - Eberhard Bertsch; Mark-Jan Nederhof (Inf. Process. Lett., 2007)

Computation of distances for regular and context-free probabilistic languages. - Mark-Jan Nederhof; Giorgio Satta (Theor. Comput. Sci., 2008)

Probabilistic Parsing. - Mark-Jan Nederhof; Giorgio Satta (New Developments in Formal Languages and Applications, 2008)

Weighted parsing of trees. - Mark-Jan Nederhof (IWPT, 2009)

Automatic Creation of Interlinear Text for Philological Purposes. - Mark-Jan Nederhof (Trait. Autom. des Langues, 2009)

Transforming Lexica as Trees. - Mark-Jan Nederhof (ATANLP@ACL 2010, 2010)

Prefix Probability for Probabilistic Synchronous Context-Free Grammars. - Mark-Jan Nederhof; Giorgio Satta (ACL, 2011)

Computation of Infix Probabilities for Probabilistic Context-Free Grammars. - Mark-Jan Nederhof; Giorgio Satta (EMNLP, 2011)

Intersection for Weighted Formalisms. - Mark-Jan Nederhof (FSMNLP, 2011)

Tree Parsing with Synchronous Tree-Adjoining Grammars. - Matthias Büchse; Mark-Jan Nederhof; Heiko Vogler (IWPT, 2011)

Parsing of Partially Bracketed Structures for Parse Selection. - Mark-Jan Nederhof; Ricardo Sánchez-Sáez (IWPT, 2011)

Splittability of Bilexical Context-Free Grammars is Undecidable. - Mark-Jan Nederhof; Giorgio Satta (Comput. Linguistics, 2011)

Synchronous Context-Free Tree Grammars. - Mark-Jan Nederhof; Heiko Vogler (TAG, 2012)

On LR Parsing with Selective Delays. - Eberhard Bertsch; Mark-Jan Nederhof; Sylvain Schmitz (CC, 2013)

Hybrid Grammars for Discontinuous Parsing. - Mark-Jan Nederhof; Heiko Vogler (COLING, 2014)

Deterministic Parsing using PCFGs. - Mark-Jan Nederhof; Martin McCaffery (EACL, 2014)

On the Computation of Distances for Probabilistic Context-Free Grammars. - Colin de la Higuera; James Scicluna 002; Mark-Jan Nederhof (CoRR, 2014)

Tree parsing for tree-adjoining machine translation. - Matthias Büchse; Heiko Vogler; Mark-Jan Nederhof (J. Log. Comput., 2014)

Prefix probabilities for linear context-free rewriting systems. - Mark-Jan Nederhof; Giorgio Satta (J. Log. Comput., 2014)

Count-based State Merging for Probabilistic Regular Tree Grammars. - Toni Dietze; Mark-Jan Nederhof (FSMNLP, 2015)

A short proof that O_2 is an MCFL. - Mark-Jan Nederhof (ACL (1), 2016)

DTED: Evaluation of Machine Translation Structure Using Dependency Parsing and Tree Edit Distance. - Martin McCaffery; Mark-Jan Nederhof (WMT, 2016)

A short proof that O2 is an MCFL. - Mark-Jan Nederhof (CoRR, 2016)

Non-Self-Embedding Linear Context-Free Tree Grammars Generate Regular Tree Languages. - Mark-Jan Nederhof; Markus Teichmann; Heiko Vogler (J. Autom. Lang. Comb., 2016)

Parsing and finite-state technologies, introduction to the special issue. - Mark-Jan Nederhof; Khalil Sima'an (J. Lang. Model., 2016)

Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures. - Kilian Gebhardt; Mark-Jan Nederhof; Heiko Vogler (Comput. Linguistics, 2017)

A probabilistic model of Ancient Egyptian writing. - Mark-Jan Nederhof; Fahrurrozi Rahman (J. Lang. Model., 2017)

Regular transductions with MCFG input syntax. - Mark-Jan Nederhof; Heiko Vogler (FSMNLP, 2019)

Calculating the Optimal Step in Shift-Reduce Dependency Parsing: From Cubic to Linear Time. - Mark-Jan Nederhof (Trans. Assoc. Comput. Linguistics, 2019)

Natural language parsing. - Mark-Jan Nederhof; Giorgio Satta (Handbook of Automata Theory (II.), 2021)

Calculating the optimal step of arc-eager parsing for non-projective trees. - Mark-Jan Nederhof (EACL, 2021)

Automatic Classification of Human Translation and Machine Translation: A Study from the Perspective of Lexical Diversity. - Yingxue Fu 001; Mark-Jan Nederhof (CoRR, 2021)

A derivational model of discontinuous parsing. - Mark-Jan Nederhof; Anssi Yli-Jyrä (Inf. Comput., 2021)

Collaborative Annotation and Computational Analysis of Hieratic. - Julius Tabin; Mark-Jan Nederhof; Christian Casey (ICDAR Workshops (1), 2023)