Mark-Jan Nederhof

Publication Activity (10 Years)

Years Active: 1991-2023
Publications (10 Years): 14

Top Topics

Probabilistic Context Free Grammars

Machine Translation

Dependency Parsing

Top Venues

J. Lang. Model.

Publications

Julius Tabin, Mark-Jan Nederhof, Christian Casey
Collaborative Annotation and Computational Analysis of Hieratic. ICDAR Workshops (1) (2023)
Mark-Jan Nederhof, Anssi Yli-Jyrä
A derivational model of discontinuous parsing. Inf. Comput. 279 (2021)
Mark-Jan Nederhof
Calculating the optimal step of arc-eager parsing for non-projective trees. EACL (2021)
Yingxue Fu, Mark-Jan Nederhof
Automatic Classification of Human Translation and Machine Translation: A Study from the Perspective of Lexical Diversity. CoRR (2021)
Mark-Jan Nederhof, Heiko Vogler
Regular transductions with MCFG input syntax. FSMNLP (2019)
Mark-Jan Nederhof
Calculating the Optimal Step in Shift-Reduce Dependency Parsing: From Cubic to Linear Time. Trans. Assoc. Comput. Linguistics 7 (2019)
Kilian Gebhardt, Mark-Jan Nederhof, Heiko Vogler
Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures. Comput. Linguistics 43 (3) (2017)
Mark-Jan Nederhof, Fahrurrozi Rahman
A probabilistic model of Ancient Egyptian writing. J. Lang. Model. 5 (1) (2017)
Mark-Jan Nederhof, Anssi Yli-Jyrä
A Derivational Model of Discontinuous Parsing. LATA (2017)
Mark-Jan Nederhof
A short proof that O_2 is an MCFL. ACL (1) (2016)
Martin McCaffery, Mark-Jan Nederhof
DTED: Evaluation of Machine Translation Structure Using Dependency Parsing and Tree Edit Distance. WMT (2016)
Mark-Jan Nederhof, Khalil Sima'an
Parsing and finite-state technologies, introduction to the special issue. J. Lang. Model. 4 (1) (2016)
Mark-Jan Nederhof
is an MCFL. CoRR (2016)
Mark-Jan Nederhof, Markus Teichmann, Heiko Vogler
Non-Self-Embedding Linear Context-Free Tree Grammars Generate Regular Tree Languages. J. Autom. Lang. Comb. 21 (3) (2016)
Toni Dietze, Mark-Jan Nederhof
Count-based State Merging for Probabilistic Regular Tree Grammars. FSMNLP (2015)
Mark-Jan Nederhof, Fahrurrozi Rahman
A Probabilistic Model of Ancient Egyptian Writing. FSMNLP (2015)
Colin de la Higuera, James Scicluna, Mark-Jan Nederhof
On the Computation of Distances for Probabilistic Context-Free Grammars. CoRR (2014)
Mark-Jan Nederhof, Heiko Vogler
Hybrid Grammars for Discontinuous Parsing. COLING (2014)
Mark-Jan Nederhof, Martin McCaffery
Deterministic Parsing using PCFGs. EACL (2014)
Mark-Jan Nederhof, Giorgio Satta
Prefix probabilities for linear context-free rewriting systems. J. Log. Comput. 24 (2) (2014)
Matthias Büchse, Heiko Vogler, Mark-Jan Nederhof
Tree parsing for tree-adjoining machine translation. J. Log. Comput. 24 (2) (2014)
Eberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz
On LR Parsing with Selective Delays. CC (2013)
Mark-Jan Nederhof, Heiko Vogler
Synchronous Context-Free Tree Grammars. TAG (2012)
Mark-Jan Nederhof, Giorgio Satta
Splittability of Bilexical Context-Free Grammars is Undecidable. Comput. Linguistics 37 (4) (2011)
Mark-Jan Nederhof, Giorgio Satta
Prefix Probability for Probabilistic Synchronous Context-Free Grammars. ACL (2011)
Mark-Jan Nederhof, Ricardo Sánchez-Sáez
Parsing of Partially Bracketed Structures for Parse Selection. IWPT (2011)
Mark-Jan Nederhof, Giorgio Satta
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing CoRR (2011)
Mark-Jan Nederhof, Giorgio Satta
Prefix Probabilities for Linear Context-Free Rewriting Systems. IWPT (2011)
Matthias Büchse, Mark-Jan Nederhof, Heiko Vogler
Tree Parsing with Synchronous Tree-Adjoining Grammars. IWPT (2011)
Mark-Jan Nederhof, Giorgio Satta
Computation of Infix Probabilities for Probabilistic Context-Free Grammars. EMNLP (2011)
Mark-Jan Nederhof
Intersection for Weighted Formalisms. FSMNLP (2011)
Mark-Jan Nederhof
Transforming Lexica as Trees. ATANLP@ACL 2010 (2010)
Mark-Jan Nederhof
Weighted parsing of trees. IWPT (2009)
Mark-Jan Nederhof
Automatic Creation of Interlinear Text for Philological Purposes. Trait. Autom. des Langues 50 (2) (2009)
Mark-Jan Nederhof, Giorgio Satta
Computation of distances for regular and context-free probabilistic languages. Theor. Comput. Sci. 395 (2-3) (2008)
Eberhard Bertsch, Mark-Jan Nederhof
Some observations on LR-like parsing with delayed reduction. Inf. Process. Lett. 104 (6) (2007)
Marc Kemps-Snijders, Mark-Jan Nederhof, Peter Wittenburg
LEXUS, a web-based tool for manipulating lexical resources lexicon. LREC (2006)
Mark-Jan Nederhof, Giorgio Satta
Probabilistic parsing strategies. J. ACM 53 (3) (2006)
Mark-Jan Nederhof, Giorgio Satta
Estimation of Consistent Probabilistic Context-free Grammars. HLT-NAACL (2006)
Martijn Wieling, Mark-Jan Nederhof, Gertjan van Noord
Parsing Partially Bracketed Input. CLIN (2005)
Mark-Jan Nederhof
A General Technique to Train Language Models on Language Models. Comput. Linguistics 31 (2) (2005)
Eberhard Bertsch, Mark-Jan Nederhof
Gap Parsing with LL(1) Grammars. Grammars 8 (2005)
Mark-Jan Nederhof, Giorgio Satta
Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata. COLING (2004)
Mark-Jan Nederhof, Giorgio Satta
An Alternative Method of Training Probabilistic LR Parsers. ACL (2004)
Mark-Jan Nederhof, Giorgio Satta
Probabilistic Parsing Strategies. ACL (2004)
Mark-Jan Nederhof, Giorgio Satta
The language intersection problem for non-recursive context-free grammars. Inf. Comput. 192 (2) (2004)
Eberhard Bertsch, Mark-Jan Nederhof
Fast parallel recognition of LR language suffixes. Inf. Process. Lett. 92 (5) (2004)
Mark-Jan Nederhof, Giorgio Satta
Tabular Parsing CoRR (2004)
Mark-Jan Nederhof, Giorgio Satta
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing. J. Artif. Intell. Res. 21 (2004)
Mark-Jan Nederhof, Giorgio Satta
Probabilistic Parsing as Intersection. IWPT (2003)
Mark-Jan Nederhof, Giorgio Satta, Stuart M. Shieber
Partially Ordered Multiset Context-free Grammars and Free-word-order Parsing. IWPT (2003)
Mark-Jan Nederhof
Weighted Deductive Parsing and Knuth's Algorithm. Comput. Linguistics 29 (1) (2003)
Mark-Jan Nederhof, Giorgio Satta
Parsing non-recursive CFGs. ACL (2002)
Mark-Jan Nederhof, Giorgio Satta
Probabilistic Parsing Strategies CoRR (2002)
Mark-Jan Nederhof, Giorgio Satta
Probabilistic Parsing Strategies. DCFS (2002)
Mark-Jan Nederhof
Approximating Context-Free by Rational Transduction for Example-Based MT. DDMMT@ACL (2001)
Eberhard Bertsch, Mark-Jan Nederhof
Size/lookahead tradeoff for LL(k)-grammars. Inf. Process. Lett. 80 (3) (2001)
Eberhard Bertsch, Mark-Jan Nederhof
On the Complexity of Some Extensions of RCG Parsing. IWPT (2001)
Mark-Jan Nederhof, Giorgio Satta
Left-To-Right Parsing and Bilexical Context-Free Grammars. ANLP (2000)
Miguel A. Alonso, Mark-Jan Nederhof, Éric Villemonte de la Clergerie
Tabulation of Automata for Tree-Adjoining Languages. Grammars 3 (2/3) (2000)
Mark-Jan Nederhof
Preprocessing for Unification Parsing of Spoken Language. Natural Language Processing (2000)
Mark-Jan Nederhof
Practical Experiments with Regular Approximation of Context-free Languages. Comput. Linguistics 26 (1) (2000)
Mark-Jan Nederhof
The Computational Complexity of the Correct-Prefix Property for TAGs. Comput. Linguistics 25 (3) (1999)
Eberhard Bertsch, Mark-Jan Nederhof
Regular Closure of Deterministic Languages. SIAM J. Comput. 29 (1) (1999)
Mark-Jan Nederhof
Practical experiments with regular approximation of context-free languages CoRR (1999)
Gertjan van Noord, Gosse Bouma, Rob Koeling, Mark-Jan Nederhof
Robust grammatical analysis for spoken dialogue systems. Nat. Lang. Eng. 5 (1) (1999)
Gertjan van Noord, Gosse Bouma, Rob Koeling, Mark-Jan Nederhof
Robust Grammatical Analysis for Spoken Dialogue Systems CoRR (1999)
Eberhard Bertsch, Mark-Jan Nederhof
On Failure of the Pruning Technique in "Error Repair in Shift-Reduce Parsers". ACM Trans. Program. Lang. Syst. 21 (1) (1999)
Mark-Jan Nederhof
An Alternative LR Algorithm for TAGs. COLING-ACL (1998)
Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
Prefix Probabilities from Stochastic Tree Adjoining Grammars. COLING-ACL (1998)
Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
Prefix Probabilities from Stochastic Tree Adjoining Grammars CoRR (1998)
Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
Prefix probabilities for linear indexed grammars. TAG+ (1998)
Mark-Jan Nederhof, Giorgio Satta
A Variant of Earley Parsing CoRR (1998)
Mark-Jan Nederhof
Linear Indexed Automata and Tabulation of TAG Parsing. TAPD (1998)
Mark-Jan Nederhof
Regular Approximations of CFLs: A Grammatical View. IWPT (1997)
Mark-Jan Nederhof, Gosse Bouma, Rob Koeling, Gertjan van Noord
Grammatical analysis in the OVIS spoken-dialogue system CoRR (1997)
Mark-Jan Nederhof, Giorgio Satta
A Variant of Earley Parsing. AI*IA (1997)
Mark-Jan Nederhof, Gosse Bouma, Rob Koeling, Gertjan van Noord
Grammatical analysis in the OVIS spoken-dialogue system. Real Applications@ACL/EACL (1997)
Mark-Jan Nederhof, Giorgio Satta
Efficient Tabular LR Parsing. ACL (1996)
Mark-Jan Nederhof, Giorgio Satta
Efficient Tabular LR Parsing CoRR (1996)
Mark-Jan Nederhof
Efficient generation of random sentences. Nat. Lang. Eng. 2 (1) (1996)
Mark-Jan Nederhof, Eberhard Bertsch
Linear-Time Suffix Parsing for Deterministic Languages. J. ACM 43 (3) (1996)
Mark-Jan Nederhof, Eberhard Bertsch
An innovative finite state concept for recognition and parsing of context-free languages. Nat. Lang. Eng. 2 (4) (1996)
Mark-Jan Nederhof
Reversible Pushdown Automata and Bidirectional Parsing. Developments in Language Theory (1995)
Mark-Jan Nederhof, Giorgio Satta
An Extended Theory of Head-Driven Parsing. CoRR (1994)
Mark-Jan Nederhof
An Optimal Tabular Parsing Algorithm. ACL (1994)
Mark-Jan Nederhof, Giorgio Satta
An Extended Theory of Head-Driven Parsing. ACL (1994)
Mark-Jan Nederhof
An Optimal Tabular Parsing Algorithm. CoRR (1994)
Mark-Jan Nederhof
Generalized Left-Corner Parsing. EACL (1993)
Mark-Jan Nederhof, Janos J. Sarbo
Partial Evaluation Grammars. Comput. Lang. 18 (2) (1993)
Mark-Jan Nederhof
A New Top-Down Parsing Algorithm for Left-Recursive DCGs. PLILP (1993)
Herman Geuvers, Mark-Jan Nederhof
Modular Proof of Strong Normalization for the Calculus of Constructions. J. Funct. Program. 1 (2) (1991)