Mark-Jan Nederhof

97 papers A* 8A 3B 6C 2Journal 45Unranked 30

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