Collaborative Annotation and Computational Analysis of Hieratic.

Mark-Jan Nederhof Julius Tabin Mark-Jan Nederhof Christian Casey Collaborative Annotation and Computational Analysis of Hieratic. 267-283 2023 ICDAR Workshops (1) https://doi.org/10.1007/978-3-031-41498-5_19 conf/icdar/2023w-1 db/conf/icdar/icdar2023w-1.html#TabinNC23

Mark-Jan Nederhof Anssi Yli-Jyrä A derivational model of discontinuous parsing. 104619 2021 279 Inf. Comput. https://doi.org/10.1016/j.ic.2020.104619 db/journals/iandc/iandc279.html#NederhofY21

Mark-Jan Nederhof Calculating the optimal step of arc-eager parsing for non-projective trees. 2273-2283 2021 EACL https://doi.org/10.18653/v1/2021.eacl-main.193 https://aclanthology.org/2021.eacl-main.193/ conf/eacl/2021 db/conf/eacl/eacl2021.html#Nederhof21 Mark-Jan Nederhof Giorgio Satta Natural language parsing. 1383-1413 2021 Handbook of Automata Theory (II.) https://doi.org/10.4171/Automata-2/15 books/ems/21/P2021 db/books/collections/P2021.html#NederhofS21

Yingxue Fu 0001 Mark-Jan Nederhof Automatic Classification of Human Translation and Machine Translation: A Study from the Perspective of Lexical Diversity. 2021 abs/2105.04616 CoRR https://arxiv.org/abs/2105.04616 db/journals/corr/corr2105.html#abs-2105-04616

Mark-Jan Nederhof Calculating the Optimal Step in Shift-Reduce Dependency Parsing: From Cubic to Linear Time. 283-296 2019 7 Trans. Assoc. Comput. Linguistics https://doi.org/10.1162/tacl_a_00268 https://www.wikidata.org/entity/Q127755216 db/journals/tacl/tacl7.html#Nederhof19

Mark-Jan Nederhof Heiko Vogler Regular transductions with MCFG input syntax. 56-64 2019 FSMNLP https://aclanthology.org/W19-3109/ https://doi.org/10.18653/v1/W19-3109 conf/fsmnlp/2019 db/conf/fsmnlp/fsmnlp2019.html#NederhofV19

Kilian Gebhardt Mark-Jan Nederhof Heiko Vogler Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures. 465-520 2017 43 Comput. Linguistics 3 https://doi.org/10.1162/COLI_a_00291 db/journals/coling/coling43.html#GebhardtNV17

Mark-Jan Nederhof Fahrurrozi Rahman A probabilistic model of Ancient Egyptian writing. 131-163 2017 5 J. Lang. Model. 1 https://doi.org/10.15398/jlm.v5i1.150 db/journals/jlm/jlm5.html#NederhofR17

Mark-Jan Nederhof Anssi Yli-Jyrä A Derivational Model of Discontinuous Parsing. 299-310 2017 LATA https://doi.org/10.1007/978-3-319-53733-7_22 conf/lata/2017 db/conf/lata/lata2017.html#NederhofY17

Mark-Jan Nederhof Markus Teichmann Heiko Vogler Non-Self-Embedding Linear Context-Free Tree Grammars Generate Regular Tree Languages. 203-246 2016 21 J. Autom. Lang. Comb. 3 db/journals/jalc/jalc21.html#NederhofTV16 https://doi.org/10.25596/jalc-2016-203

Mark-Jan Nederhof Khalil Sima'an Parsing and finite-state technologies, introduction to the special issue. 1-2 2016 4 J. Lang. Model. 1 https://doi.org/10.15398/jlm.v4i1.137 db/journals/jlm/jlm4.html#NederhofS16

Mark-Jan Nederhof A short proof that O_2 is an MCFL. 2016 ACL (1) https://doi.org/10.18653/v1/p16-1106 https://aclanthology.org/P16-1106/ conf/acl/2016-1 db/conf/acl/acl2016-1.html#Nederhof16 Martin McCaffery Mark-Jan Nederhof DTED: Evaluation of Machine Translation Structure Using Dependency Parsing and Tree Edit Distance. 491-498 2016 WMT https://doi.org/10.18653/v1/w16-2340 https://aclanthology.org/W16-2340/ conf/wmt/2016 db/conf/wmt/wmt2016.html#McCafferyN16

Mark-Jan Nederhof A short proof that O<sub>2</sub> is an MCFL. 2016 abs/1603.03610 CoRR http://arxiv.org/abs/1603.03610 db/journals/corr/corr1603.html#Nederhof16

Toni Dietze Mark-Jan Nederhof Count-based State Merging for Probabilistic Regular Tree Grammars. 2015 FSMNLP https://aclanthology.org/W15-4804/ conf/fsmnlp/2015 db/conf/fsmnlp/fsmnlp2015.html#DietzeN15 Mark-Jan Nederhof Fahrurrozi Rahman A Probabilistic Model of Ancient Egyptian Writing. 2015 FSMNLP https://aclanthology.org/W15-4810/ conf/fsmnlp/2015 db/conf/fsmnlp/fsmnlp2015.html#NederhofR15

Mark-Jan Nederhof Giorgio Satta Prefix probabilities for linear context-free rewriting systems. 331-350 2014 24 J. Log. Comput. 2 https://doi.org/10.1093/logcom/exs081 db/journals/logcom/logcom24.html#NederhofS14

Matthias Büchse Heiko Vogler Mark-Jan Nederhof Tree parsing for tree-adjoining machine translation. 351-373 2014 24 J. Log. Comput. 2 https://doi.org/10.1093/logcom/exs050 db/journals/logcom/logcom24.html#BuchseVN14

Mark-Jan Nederhof Heiko Vogler Hybrid Grammars for Discontinuous Parsing. 1370-1381 2014 COLING https://aclanthology.org/C14-1130/ conf/coling/2014 db/conf/coling/coling2014.html#NederhofV14 Mark-Jan Nederhof Martin McCaffery Deterministic Parsing using PCFGs. 338-347 2014 EACL https://doi.org/10.3115/v1/e14-1036 https://aclanthology.org/E14-1036/ conf/eacl/2014 db/conf/eacl/eacl2014.html#NederhofM14

Colin de la Higuera James Scicluna 0002 Mark-Jan Nederhof On the Computation of Distances for Probabilistic Context-Free Grammars. 2014 abs/1407.1513 CoRR http://arxiv.org/abs/1407.1513 db/journals/corr/corr1407.html#HigueraSN14

Eberhard Bertsch Mark-Jan Nederhof Sylvain Schmitz On LR Parsing with Selective Delays. 244-263 2013 CC https://doi.org/10.1007/978-3-642-37051-9_13 conf/cc/2013 db/conf/cc/cc2013.html#BertschNS13 Glyn Morrill Mark-Jan Nederhof Formal Grammar - 17th and 18th International Conferences, FG 2012, Opole, Poland, August 2012, Revised Selected Papers, FG 2013, Düsseldorf, Germany, August 2013. Proceedings 2013 Springer Lecture Notes in Computer Science 8036 https://doi.org/10.1007/978-3-642-39998-5 978-3-642-39997-8 FG db/conf/fg/fg2013.html Mark-Jan Nederhof 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 2013 The Association for Computer Linguistics https://aclanthology.org/volumes/W13-18/ https://aclanthology.org/W13-1800/ db/conf/fsmnlp/fsmnlp2013.html Mark-Jan Nederhof Heiko Vogler Synchronous Context-Free Tree Grammars. 55-63 2012 TAG https://aclanthology.org/W12-4607/ conf/tag/2012 db/conf/tag/tag2012.html#NederhofV12 Philippe de Groote Mark-Jan Nederhof Formal Grammar - 15th and 16th International Conferences, FG 2010, Copenhagen, Denmark, August 2010, FG 2011, Ljubljana, Slovenia, August 2011, Revised Selected Papers 7395 2012 Springer Lecture Notes in Computer Science https://doi.org/10.1007/978-3-642-32024-8 978-3-642-32023-1 FG db/conf/fg/fg2011.html

Mark-Jan Nederhof Giorgio Satta Splittability of Bilexical Context-Free Grammars is Undecidable. 867-879 2011 37 Comput. Linguistics 4 https://doi.org/10.1162/COLI_a_00079 db/journals/coling/coling37.html#NederhofS11

Mark-Jan Nederhof Giorgio Satta Prefix Probability for Probabilistic Synchronous Context-Free Grammars. 460-469 2011 ACL https://aclanthology.org/P11-1047/ conf/acl/2011 db/conf/acl/acl2011.html#NederhofS11 Mark-Jan Nederhof Giorgio Satta Computation of Infix Probabilities for Probabilistic Context-Free Grammars. 1213-1221 2011 EMNLP https://aclanthology.org/D11-1112/ conf/emnlp/2011 db/conf/emnlp/emnlp2011.html#NederhofS11 Mark-Jan Nederhof Intersection for Weighted Formalisms. 1-2 2011 FSMNLP https://aclanthology.org/W11-4401/ conf/fsmnlp/2011 db/conf/fsmnlp/fsmnlp2011.html#Nederhof11 Matthias Büchse Mark-Jan Nederhof Heiko Vogler Tree Parsing with Synchronous Tree-Adjoining Grammars. 14-25 2011 IWPT https://aclanthology.org/W11-2903/ conf/iwpt/2011 db/conf/iwpt/iwpt2011.html#BuchseNV11 Mark-Jan Nederhof Giorgio Satta Prefix Probabilities for Linear Context-Free Rewriting Systems. 151-162 2011 IWPT https://aclanthology.org/W11-2919/ conf/iwpt/2011 db/conf/iwpt/iwpt2011.html#NederhofS11 Mark-Jan Nederhof Ricardo Sánchez-Sáez Parsing of Partially Bracketed Structures for Parse Selection. 231-240 2011 IWPT https://aclanthology.org/W11-2928/ conf/iwpt/2011 db/conf/iwpt/iwpt2011.html#NederhofS11a

Mark-Jan Nederhof Giorgio Satta IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing http://arxiv.org/abs/1107.0026 2011 CoRR abs/1107.0026 db/journals/corr/corr1107.html#abs-1107-0026

Mark-Jan Nederhof Transforming Lexica as Trees. 37-45 2010 ATANLP@ACL 2010 https://aclanthology.org/W10-2505/ conf/acl/2010atanlp db/conf/acl/atanlp2010.html#Nederhof10

Mark-Jan Nederhof Automatic Creation of Interlinear Text for Philological Purposes. 237-255 2009 50 Trait. Autom. des Langues 2 http://atala.org/IMG/pdf/TAL-2009-50-2-09-Nederhof.pdf db/journals/tal/tal50.html#Nederhof09

Mark-Jan Nederhof Weighted parsing of trees. 13-24 2009 IWPT https://aclanthology.org/W09-3802/ conf/iwpt/2009 db/conf/iwpt/iwpt2009.html#Nederhof09

Mark-Jan Nederhof Giorgio Satta Computation of distances for regular and context-free probabilistic languages. 235-254 2008 395 Theor. Comput. Sci. 2-3 https://doi.org/10.1016/j.tcs.2008.01.010 db/journals/tcs/tcs395.html#NederhofS08

Mark-Jan Nederhof Giorgio Satta Probabilistic Parsing. 229-258 2008 New Developments in Formal Languages and Applications https://doi.org/10.1007/978-3-540-78291-9_7 series/sci/2008-113 db/series/sci/sci113.html#NederhofS08

Eberhard Bertsch Mark-Jan Nederhof Some observations on LR-like parsing with delayed reduction. 195-199 2007 104 Inf. Process. Lett. 6 https://doi.org/10.1016/j.ipl.2007.07.003 db/journals/ipl/ipl104.html#BertschN07

Mark-Jan Nederhof Giorgio Satta Probabilistic parsing strategies. 406-436 2006 53 J. ACM 3 https://doi.org/10.1145/1147954.1147959 db/journals/jacm/jacm53.html#NederhofS06

Marc Kemps-Snijders Mark-Jan Nederhof Peter Wittenburg LEXUS, a web-based tool for manipulating lexical resources lexicon. 1862-1865 2006 LREC http://www.lrec-conf.org/proceedings/lrec2006/summaries/149.html conf/lrec/2006 db/conf/lrec/lrec2006.html#Kemps-SnijdersN06 Mark-Jan Nederhof Giorgio Satta Estimation of Consistent Probabilistic Context-free Grammars. 2006 conf/naacl/2006 HLT-NAACL https://aclanthology.org/N06-1044/ db/conf/naacl/naacl2006.html#NederhofS06

Mark-Jan Nederhof A General Technique to Train Language Models on Language Models. 173-185 2005 31 Comput. Linguistics 2 https://doi.org/10.1162/0891201054223986 db/journals/coling/coling31.html#Nederhof05

Eberhard Bertsch Mark-Jan Nederhof Gap Parsing with LL(1) Grammars. 1-16 2005 8 Grammars http://grammars.grlmc.com/paper_nederhof.asp db/journals/grammars/grammars8.html#BertschN05

Martijn Wieling 0001 Mark-Jan Nederhof Gertjan van Noord Parsing Partially Bracketed Input. 2005 conf/clin/2005 CLIN db/conf/clin/clin2005.html#WielingNN05

Mark-Jan Nederhof Giorgio Satta The language intersection problem for non-recursive context-free grammars. 172-184 2004 192 Inf. Comput. 2 https://doi.org/10.1016/j.ic.2004.03.004 db/journals/iandc/iandc192.html#NederhofS04

Eberhard Bertsch Mark-Jan Nederhof Fast parallel recognition of LR language suffixes. 225-229 2004 92 Inf. Process. Lett. 5 https://doi.org/10.1016/j.ipl.2004.08.010 db/journals/ipl/ipl92.html#BertschN04

Mark-Jan Nederhof Giorgio Satta IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing. 287-317 2004 21 J. Artif. Intell. Res. https://doi.org/10.1613/jair.1309 https://www.wikidata.org/entity/Q129530521 db/journals/jair/jair21.html#NederhofS04

Mark-Jan Nederhof Giorgio Satta Probabilistic Parsing Strategies. 542-549 2004 conf/acl/2004 ACL https://aclanthology.org/P04-1069/ https://doi.org/10.3115/1218955.1219024 db/conf/acl/acl2004.html#NederhofS04 Mark-Jan Nederhof Giorgio Satta An Alternative Method of Training Probabilistic LR Parsers. 550-557 2004 conf/acl/2004 ACL https://aclanthology.org/P04-1070/ https://doi.org/10.3115/1218955.1219025 db/conf/acl/acl2004.html#NederhofS04a Mark-Jan Nederhof Giorgio Satta Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata. 2004 COLING https://aclanthology.org/C04-1011/ conf/coling/2004 db/conf/coling/coling2004.html#NederhofS04

Mark-Jan Nederhof Giorgio Satta Tabular Parsing http://arxiv.org/abs/cs/0404009 2004 CoRR cs.CL/0404009 db/journals/corr/corr0404.html#cs-CL-0404009

Mark-Jan Nederhof Weighted Deductive Parsing and Knuth's Algorithm. 135-143 2003 29 Comput. Linguistics 1 db/journals/coling/coling29.html#Nederhof03 https://doi.org/10.1162/089120103321337467

Mark-Jan Nederhof Giorgio Satta Probabilistic Parsing as Intersection. 137-148 2003 IWPT https://aclanthology.org/W03-3016/ conf/iwpt/2003 db/conf/iwpt/iwpt2003.html#NederhofS03 Mark-Jan Nederhof Giorgio Satta Stuart M. Shieber Partially Ordered Multiset Context-free Grammars and Free-word-order Parsing. 171-182 2003 IWPT https://aclanthology.org/W03-3020/ conf/iwpt/2003 db/conf/iwpt/iwpt2003.html#NederhofSS03 Mark-Jan Nederhof Giorgio Satta Parsing non-recursive CFGs. 112-119 2002 conf/acl/2002 ACL https://aclanthology.org/P02-1015/ https://doi.org/10.3115/1073083.1073104 https://www.wikidata.org/entity/Q56060238 db/conf/acl/acl2002.html#NederhofS02 Mark-Jan Nederhof Giorgio Satta Probabilistic Parsing Strategies. 216-230 2002 DCFS conf/dcfs/2002 db/conf/dcfs/dcfs2002.html#NederhofS02

Mark-Jan Nederhof Giorgio Satta Probabilistic Parsing Strategies http://arxiv.org/abs/cs/0211017 2002 CoRR cs.CL/0211017 db/journals/corr/corr0211.html#cs-CL-0211017

Eberhard Bertsch Mark-Jan Nederhof Size/lookahead tradeoff for LL(k)-grammars. 125-129 2001 80 Inf. Process. Lett. 3 db/journals/ipl/ipl80.html#BertschN01 https://doi.org/10.1016/S0020-0190(01)00156-9

Mark-Jan Nederhof Approximating Context-Free by Rational Transduction for Example-Based MT. 2001 DDMMT@ACL https://aclanthology.org/W01-1404/ conf/acl/2001ddmmt db/conf/acl/ddmmt2001.html#Nederhof01 Eberhard Bertsch Mark-Jan Nederhof On the Complexity of Some Extensions of RCG Parsing. 2001 conf/iwpt/2001 IWPT db/conf/iwpt/iwpt2001.html#BertschN01

Mark-Jan Nederhof Practical Experiments with Regular Approximation of Context-free Languages. 17-44 2000 26 Comput. Linguistics 1 db/journals/coling/coling26.html#Nederhof00 https://doi.org/10.1162/089120100561610

Miguel A. Alonso 0001 Mark-Jan Nederhof Éric Villemonte de la Clergerie Tabulation of Automata for Tree-Adjoining Languages. 89-110 2000 3 Grammars 2/3 db/journals/grammars/grammars3.html#PardoNC00 https://doi.org/10.1023/A:1009967013686

Mark-Jan Nederhof Giorgio Satta Left-To-Right Parsing and Bilexical Context-Free Grammars. 272-279 2000 conf/anlp/2000 ANLP https://aclanthology.org/A00-2036/ db/conf/anlp/anlp2000.html#NederhofS00 Mark-Jan Nederhof Preprocessing for Unification Parsing of Spoken Language. 118-129 2000 conf/nlp/2000 Natural Language Processing https://doi.org/10.1007/3-540-45154-4_11 db/conf/nlp/nlp2000.html#Nederhof00

Mark-Jan Nederhof The Computational Complexity of the Correct-Prefix Property for TAGs. 345-360 1999 25 Comput. Linguistics 3 db/journals/coling/coling25.html#Nederhof99

Gertjan van Noord Gosse Bouma Rob Koeling Mark-Jan Nederhof Robust grammatical analysis for spoken dialogue systems. 45-93 1999 5 Nat. Lang. Eng. 1 https://doi.org/10.1017/s1351324999002156 https://www.wikidata.org/entity/Q128010599 db/journals/nle/nle5.html#NoordBKN99

Eberhard Bertsch Mark-Jan Nederhof Regular Closure of Deterministic Languages. 81-102 1999 29 SIAM J. Comput. 1 db/journals/siamcomp/siamcomp29.html#BertschN99 https://doi.org/10.1137/S009753979528682X

Eberhard Bertsch Mark-Jan Nederhof On Failure of the Pruning Technique in "Error Repair in Shift-Reduce Parsers". 1-10 1999 21 ACM Trans. Program. Lang. Syst. 1 https://doi.org/10.1145/314602.314603 db/journals/toplas/toplas21.html#BertschN99

Gertjan van Noord Gosse Bouma Rob Koeling Mark-Jan Nederhof Robust Grammatical Analysis for Spoken Dialogue Systems https://arxiv.org/abs/cs/9906026 1999 CoRR cs.CL/9906026 db/journals/corr/corr9906.html#cs-CL-9906026

Mark-Jan Nederhof Practical experiments with regular approximation of context-free languages https://arxiv.org/abs/cs/9910022 1999 CoRR cs.CL/9910022 db/journals/corr/corr9910.html#cs-CL-9910022

Mark-Jan Nederhof An Alternative LR Algorithm for TAGs. 946-952 1998 conf/acl/1998 COLING-ACL db/conf/acl/acl98.html#Nederhof98 https://aclanthology.org/P98-2156/ https://doi.org/10.3115/980691.980725 Mark-Jan Nederhof Anoop Sarkar Giorgio Satta Prefix Probabilities from Stochastic Tree Adjoining Grammars. 953-959 1998 conf/acl/1998 COLING-ACL db/conf/acl/acl98.html#NederhofSS98 https://aclanthology.org/P98-2157/ https://doi.org/10.3115/980691.980726 Mark-Jan Nederhof Anoop Sarkar Giorgio Satta Prefix probabilities for linear indexed grammars. 116-119 1998 TAG+ https://aclanthology.org/W98-0130/ conf/tag/1998 db/conf/tag/tag1998.html#NederhofSS98 Mark-Jan Nederhof Linear Indexed Automata and Tabulation of TAG Parsing. 1-9 1998 conf/tapd/1998 TAPD ftp://ftp.inria.fr/INRIA/Projects/Atoll/TAPD98/nederhof.ps.gz db/conf/tapd/tapd98.html#Nederhof98

Mark-Jan Nederhof Giorgio Satta A Variant of Earley Parsing http://arxiv.org/abs/cmp-lg/9808017 1998 CoRR cmp-lg/9808017 db/journals/corr/corr9808.html#cmp-lg-9808017

Mark-Jan Nederhof Anoop Sarkar Giorgio Satta Prefix Probabilities from Stochastic Tree Adjoining Grammars https://arxiv.org/abs/cs/9809026 1998 CoRR cs.CL/9809026 db/journals/corr/corr9809.html#cs-CL-9809026

Mark-Jan Nederhof Giorgio Satta A Variant of Earley Parsing. 84-95 1997 conf/aiia/1997 AI*IA db/conf/aiia/aiia1997.html#NederhofS97 https://doi.org/10.1007/3-540-63576-9_98 Mark-Jan Nederhof Gosse Bouma Rob Koeling Gertjan van Noord Grammatical analysis in the OVIS spoken-dialogue system. 1997 Real Applications@ACL/EACL https://aclanthology.org/W97-0614/ conf/eacl/1997ra db/conf/eacl/realapplications1997.html#NederhofBKN97 Mark-Jan Nederhof Regular Approximations of CFLs: A Grammatical View. 159-170 1997 IWPT https://aclanthology.org/1997.iwpt-1.19/ conf/iwpt/1997 db/conf/iwpt/iwpt1997.html#Nederhof97

Mark-Jan Nederhof Gosse Bouma Rob Koeling Gertjan van Noord Grammatical analysis in the OVIS spoken-dialogue system http://arxiv.org/abs/cmp-lg/9705003 1997 CoRR cmp-lg/9705003 db/journals/corr/corr9705.html#cmp-lg-9705003

Mark-Jan Nederhof Eberhard Bertsch Linear-Time Suffix Parsing for Deterministic Languages. 524-554 1996 43 J. ACM 3 db/journals/jacm/jacm43.html#NederhofB96 https://doi.org/10.1145/233551.233555

Mark-Jan Nederhof Efficient generation of random sentences. 1-13 1996 2 Nat. Lang. Eng. 1 http://journals.cambridge.org/action/displayAbstract?aid=48283 db/journals/nle/nle2.html#Nederhof96

Mark-Jan Nederhof Eberhard Bertsch An innovative finite state concept for recognition and parsing of context-free languages. 381-382 1996 2 Nat. Lang. Eng. 4 https://doi.org/10.1017/S1351324997001666 db/journals/nle/nle2.html#NederhofB96

Mark-Jan Nederhof Giorgio Satta Efficient Tabular LR Parsing. 239-247 1996 conf/acl/1996 ACL db/conf/acl/acl96.html#NederhofS96 https://aclanthology.org/P96-1032/ https://doi.org/10.3115/981863.981895

Mark-Jan Nederhof Giorgio Satta Efficient Tabular LR Parsing http://arxiv.org/abs/cmp-lg/9605018 1996 CoRR cmp-lg/9605018 db/journals/corr/corr9605.html#cmp-lg-9605018

Mark-Jan Nederhof Reversible Pushdown Automata and Bidirectional Parsing. 472-481 1995 conf/dlt/1995 Developments in Language Theory db/conf/dlt/dlt1995.html#Nederhof95 Mark-Jan Nederhof An Optimal Tabular Parsing Algorithm. 117-124 1994 conf/acl/1994 ACL db/conf/acl/acl94.html#Nederhof94 https://aclanthology.org/P94-1017/ https://doi.org/10.3115/981732.981749 Mark-Jan Nederhof Giorgio Satta An Extended Theory of Head-Driven Parsing. 210-217 1994 conf/acl/1994 ACL db/conf/acl/acl94.html#NederhofS94 https://aclanthology.org/P94-1029/ https://doi.org/10.3115/981732.981761

Mark-Jan Nederhof An Optimal Tabular Parsing Algorithm. 1994 abs/cmp-lg/9405025 CoRR http://arxiv.org/abs/cmp-lg/9405025 db/journals/corr/corr9405.html#Nederhof94

Mark-Jan Nederhof Giorgio Satta An Extended Theory of Head-Driven Parsing. 1994 abs/cmp-lg/9405026 CoRR http://arxiv.org/abs/cmp-lg/9405026 db/journals/corr/corr9405.html#NederhofS94

Mark-Jan Nederhof Janos J. Sarbo Partial Evaluation Grammars. 137-151 1993 18 Comput. Lang. 2 db/journals/cl/cl18.html#NederhofS93 https://doi.org/10.1016/0096-0551(93)90016-T

Mark-Jan Nederhof Generalized Left-Corner Parsing. 305-314 1993 conf/eacl/1993 EACL https://aclanthology.org/E93-1036/ db/conf/eacl/eacl1993.html#Nederhof93 Mark-Jan Nederhof A New Top-Down Parsing Algorithm for Left-Recursive DCGs. 108-122 1993 conf/plilp/1993 PLILP db/conf/plilp/plilp93.html#Nederhof93 https://doi.org/10.1007/3-540-57186-8_74

Herman Geuvers Mark-Jan Nederhof Modular Proof of Strong Normalization for the Calculus of Constructions. 155-189 1991 1 J. Funct. Program. 2 db/journals/jfp/jfp1.html#GeuversN91 https://doi.org/10.1017/s0956796800020037 https://www.wikidata.org/entity/Q127845385

Miguel A. Alonso 0001 Eberhard Bertsch Gosse Bouma Matthias Büchse Christian Casey Éric Villemonte de la Clergerie Toni Dietze Yingxue Fu 0001 Kilian Gebhardt Herman Geuvers Philippe de Groote Colin de la Higuera Marc Kemps-Snijders Rob Koeling Martin McCaffery Glyn Morrill Gertjan van Noord Fahrurrozi Rahman Ricardo Sánchez-Sáez Janos J. Sarbo Anoop Sarkar Giorgio Satta Sylvain Schmitz James Scicluna 0002 Stuart M. Shieber Khalil Sima'an Julius Tabin Markus Teichmann Heiko Vogler Martijn Wieling 0001 Peter Wittenburg Anssi Yli-Jyrä