Mark-Jan Nederhof

According to our database, Mark-Jan Nederhof authored at least 79 papers between 1991 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Collaborative Annotation and Computational Analysis of Hieratic.

Julius Tabin, Mark-Jan Nederhof, Christian Casey

Proceedings of the Document Analysis and Recognition - ICDAR 2023 Workshops, 2023

2021

A derivational model of discontinuous parsing.

Mark-Jan Nederhof, Anssi Yli-Jyrä

Inf. Comput., 2021

Automatic Classification of Human Translation and Machine Translation: A Study from the Perspective of Lexical Diversity.

Yingxue Fu, Mark-Jan Nederhof

CoRR, 2021

Calculating the optimal step of arc-eager parsing for non-projective trees.

Mark-Jan Nederhof

Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume, 2021

Natural language parsing.

Mark-Jan Nederhof, Giorgio Satta

Proceedings of the Handbook of Automata Theory., 2021

2019

Calculating the Optimal Step in Shift-Reduce Dependency Parsing: From Cubic to Linear Time.

Mark-Jan Nederhof

Trans. Assoc. Comput. Linguistics, 2019

Regular transductions with MCFG input syntax.

Mark-Jan Nederhof, Heiko Vogler

Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing, 2019

2017

A probabilistic model of Ancient Egyptian writing.

Mark-Jan Nederhof, Fahrurrozi Rahman

J. Lang. Model., 2017

Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures.

Kilian Gebhardt, Mark-Jan Nederhof, Heiko Vogler

Comput. Linguistics, 2017

2016

Parsing and finite-state technologies, introduction to the special issue.

Mark-Jan Nederhof, Khalil Sima'an

J. Lang. Model., 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

A short proof that O₂ is an MCFL.

Mark-Jan Nederhof

CoRR, 2016

DTED: Evaluation of Machine Translation Structure Using Dependency Parsing and Tree Edit Distance.

Martin McCaffery, Mark-Jan Nederhof

Proceedings of the First Conference on Machine Translation, 2016

A short proof that O_2 is an MCFL.

Mark-Jan Nederhof

Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics, 2016

2015

Count-based State Merging for Probabilistic Regular Tree Grammars.

Toni Dietze, Mark-Jan Nederhof

Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing, 2015

2014

Prefix probabilities for linear context-free rewriting systems.

Mark-Jan Nederhof, Giorgio Satta

J. Log. Comput., 2014

Tree parsing for tree-adjoining machine translation.

Matthias Büchse, Heiko Vogler, Mark-Jan Nederhof

J. Log. Comput., 2014

On the Computation of Distances for Probabilistic Context-Free Grammars.

Colin de la Higuera, James Scicluna, Mark-Jan Nederhof

CoRR, 2014

Deterministic Parsing using PCFGs.

Mark-Jan Nederhof, Martin McCaffery

Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics, 2014

Hybrid Grammars for Discontinuous Parsing.

Mark-Jan Nederhof, Heiko Vogler

Proceedings of the COLING 2014, 2014

2013

On LR Parsing with Selective Delays.

Eberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz

Proceedings of the Compiler Construction - 22nd International Conference, 2013

2012

Synchronous Context-Free Tree Grammars.

Mark-Jan Nederhof, Heiko Vogler

Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms, 2012

2011

Splittability of Bilexical Context-Free Grammars is Undecidable.

Mark-Jan Nederhof, Giorgio Satta

Comput. Linguistics, 2011

Parsing of Partially Bracketed Structures for Parse Selection.

Mark-Jan Nederhof, Ricardo Sánchez-Sáez

Proceedings of the 12th International Conference on Parsing Technologies, 2011

Tree Parsing with Synchronous Tree-Adjoining Grammars.

Matthias Büchse, Mark-Jan Nederhof, Heiko Vogler

Proceedings of the 12th International Conference on Parsing Technologies, 2011

Intersection for Weighted Formalisms.

Mark-Jan Nederhof

Proceedings of the Finite-State Methods and Natural Language Processing, 2011

Computation of Infix Probabilities for Probabilistic Context-Free Grammars.

Mark-Jan Nederhof, Giorgio Satta

Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, 2011

Prefix Probability for Probabilistic Synchronous Context-Free Grammars.

Mark-Jan Nederhof, Giorgio Satta

Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, 2011

2010

Transforming Lexica as Trees.

Mark-Jan Nederhof

Proceedings of the Workshop on Applications of Tree Automata in Natural Language Processing, 2010

2009

Automatic Creation of Interlinear Text for Philological Purposes.

Mark-Jan Nederhof

Trait. Autom. des Langues, 2009

Weighted parsing of trees.

Mark-Jan Nederhof

Proceedings of the 11th International Workshop on Parsing Technologies (IWPT-2009), 2009

2008

Probabilistic Parsing.

Mark-Jan Nederhof, Giorgio Satta

Proceedings of the New Developments in Formal Languages and Applications, 2008

Computation of distances for regular and context-free probabilistic languages.

Mark-Jan Nederhof, Giorgio Satta

Theor. Comput. Sci., 2008

2007

Some observations on LR-like parsing with delayed reduction.

Eberhard Bertsch, Mark-Jan Nederhof

Inf. Process. Lett., 2007

2006

Probabilistic parsing strategies.

Mark-Jan Nederhof, Giorgio Satta

J. ACM, 2006

Estimation of Consistent Probabilistic Context-free Grammars.

Mark-Jan Nederhof, Giorgio Satta

Proceedings of the Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, 2006

LEXUS, a web-based tool for manipulating lexical resources lexicon.

Marc Kemps-Snijders, Mark-Jan Nederhof, Peter Wittenburg

Proceedings of the Fifth International Conference on Language Resources and Evaluation, 2006

2005

Gap Parsing with LL(1) Grammars.

Eberhard Bertsch, Mark-Jan Nederhof

Grammars, 2005

A General Technique to Train Language Models on Language Models.

Mark-Jan Nederhof

Comput. Linguistics, 2005

Parsing Partially Bracketed Input.

Martijn Wieling, Mark-Jan Nederhof, Gertjan van Noord

Proceedings of the Computational Linguistics in the Netherlands 2005, 2005

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

Fast parallel recognition of LR language suffixes.

Eberhard Bertsch, Mark-Jan Nederhof

Inf. Process. Lett., 2004

The language intersection problem for non-recursive context-free grammars.

Mark-Jan Nederhof, Giorgio Satta

Inf. Comput., 2004

Tabular Parsing

Mark-Jan Nederhof, Giorgio Satta

CoRR, 2004

Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata.

Mark-Jan Nederhof, Giorgio Satta

Proceedings of the COLING 2004, 2004

An Alternative Method of Training Probabilistic LR Parsers.

Mark-Jan Nederhof, Giorgio Satta

Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics, 2004

2003

Weighted Deductive Parsing and Knuth's Algorithm.

Mark-Jan Nederhof

Comput. Linguistics, 2003

Partially Ordered Multiset Context-free Grammars and Free-word-order Parsing.

Mark-Jan Nederhof, Giorgio Satta, Stuart M. Shieber

Proceedings of the Eighth International Conference on Parsing Technologies, 2003

Probabilistic Parsing as Intersection.

Mark-Jan Nederhof, Giorgio Satta

Proceedings of the Eighth International Conference on Parsing Technologies, 2003

2002

Parsing non-recursive CFGs.

Mark-Jan Nederhof, Giorgio Satta

Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics, 2002

2001

Size/lookahead tradeoff for LL(k)-grammars.

Eberhard Bertsch, Mark-Jan Nederhof

Inf. Process. Lett., 2001

On the Complexity of Some Extensions of RCG Parsing.

Eberhard Bertsch, Mark-Jan Nederhof

Proceedings of the Seventh International Workshop on Parsing Technologies (IWPT-2001), 2001

Approximating Context-Free by Rational Transduction for Example-Based MT.

Mark-Jan Nederhof

Proceedings of the ACL Workshop on Data-Driven Methods in Machine Translation, 2001

2000

Tabulation of Automata for Tree-Adjoining Languages.

Miguel A. Alonso, Mark-Jan Nederhof, Éric Villemonte de la Clergerie

Grammars, 2000

Practical Experiments with Regular Approximation of Context-free Languages.

Mark-Jan Nederhof

Comput. Linguistics, 2000

Preprocessing for Unification Parsing of Spoken Language.

Mark-Jan Nederhof

Proceedings of the Natural Language Processing, 2000

Left-To-Right Parsing and Bilexical Context-Free Grammars.

Mark-Jan Nederhof, Giorgio Satta

Proceedings of the 6th Applied Natural Language Processing Conference, 2000

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

Regular Closure of Deterministic Languages.

Eberhard Bertsch, Mark-Jan Nederhof

SIAM J. Comput., 1999

Robust grammatical analysis for spoken dialogue systems.

Gertjan van Noord, Gosse Bouma, Rob Koeling, Mark-Jan Nederhof

Nat. Lang. Eng., 1999

The Computational Complexity of the Correct-Prefix Property for TAGs.

Mark-Jan Nederhof

Comput. Linguistics, 1999

1998

Linear Indexed Automata and Tabulation of TAG Parsing.

Mark-Jan Nederhof

Proceedings of the 1st Workshop on Tabulation in Parsing and Deduction, 1998

Prefix probabilities for linear indexed grammars.

Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta

Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks, 1998

Prefix Probabilities from Stochastic Tree Adjoining Grammars.

Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta

Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, 1998

An Alternative LR Algorithm for TAGs.

Mark-Jan Nederhof

Proceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, 1998

1997

Regular Approximations of CFLs: A Grammatical View.

Mark-Jan Nederhof

Proceedings of the International Workshop on Parsing Technologies, 1997

Grammatical analysis in the OVIS spoken-dialogue system.

Mark-Jan Nederhof, Gosse Bouma, Rob Koeling, Gertjan van Noord

Proceedings of the Interactive Spoken Dialog Systems: Bringing Speech and NLP Together in Real Applications@ACL/EACL 1997, 1997

A Variant of Earley Parsing.

Mark-Jan Nederhof, Giorgio Satta

Proceedings of the AI*IA 97: Advances in Artificial Intelligence, 1997

1996

An innovative finite state concept for recognition and parsing of context-free languages.

Mark-Jan Nederhof, Eberhard Bertsch

Nat. Lang. Eng., 1996

Efficient generation of random sentences.

Mark-Jan Nederhof

Nat. Lang. Eng., 1996

Linear-Time Suffix Parsing for Deterministic Languages.

Mark-Jan Nederhof, Eberhard Bertsch

J. ACM, 1996

Efficient Tabular LR Parsing.

Mark-Jan Nederhof, Giorgio Satta

Proceedings of the 34th Annual Meeting of the Association for Computational Linguistics, 1996

1995

Reversible Pushdown Automata and Bidirectional Parsing.

Mark-Jan Nederhof

Proceedings of the Developments in Language Theory II, 1995

1994

An Extended Theory of Head-Driven Parsing.

Mark-Jan Nederhof, Giorgio Satta

Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics, 1994

An Optimal Tabular Parsing Algorithm.

Mark-Jan Nederhof

Proceedings of the 32nd Annual Meeting of the Association for Computational Linguistics, 1994

1993

Partial Evaluation Grammars.

Mark-Jan Nederhof, Janos J. Sarbo

Comput. Lang., 1993

A New Top-Down Parsing Algorithm for Left-Recursive DCGs.

Mark-Jan Nederhof

Proceedings of the Programming Language Implementation and Logic Programming, 1993

Generalized Left-Corner Parsing.

Mark-Jan Nederhof

Proceedings of the Sixth Conference of the European Chapter of the Association for Computational Linguistics, 1993

1991

Modular Proof of Strong Normalization for the Calculus of Constructions.

Herman Geuvers, Mark-Jan Nederhof

J. Funct. Program., 1991