default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark-Jan Nederhof
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c47]Julius Tabin
, Mark-Jan Nederhof, Christian Casey:
Collaborative Annotation and Computational Analysis of Hieratic. ICDAR Workshops (1) 2023: 267-283- 2021
- [j31]Mark-Jan Nederhof, Anssi Yli-Jyrä:
A derivational model of discontinuous parsing. Inf. Comput. 279: 104619 (2021) - [c46]Mark-Jan Nederhof:
Calculating the optimal step of arc-eager parsing for non-projective trees. EACL 2021: 2273-2283 - [p2]Mark-Jan Nederhof, Giorgio Satta:
Natural language parsing. Handbook of Automata Theory (II.) 2021: 1383-1413 - [i14]Yingxue Fu, Mark-Jan Nederhof:
Automatic Classification of Human Translation and Machine Translation: A Study from the Perspective of Lexical Diversity. CoRR abs/2105.04616 (2021)
2010 – 2019
- 2019
- [j30]Mark-Jan Nederhof:
Calculating the Optimal Step in Shift-Reduce Dependency Parsing: From Cubic to Linear Time. Trans. Assoc. Comput. Linguistics 7: 283-296 (2019) - [c45]Mark-Jan Nederhof, Heiko Vogler:
Regular transductions with MCFG input syntax. FSMNLP 2019: 56-64 - 2017
- [j29]Kilian Gebhardt, Mark-Jan Nederhof, Heiko Vogler:
Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures. Comput. Linguistics 43(3): 465-520 (2017) - [j28]Mark-Jan Nederhof, Fahrurrozi Rahman:
A probabilistic model of Ancient Egyptian writing. J. Lang. Model. 5(1): 131-163 (2017) - [c44]Mark-Jan Nederhof, Anssi Yli-Jyrä:
A Derivational Model of Discontinuous Parsing. LATA 2017: 299-310 - 2016
- [j27]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): 203-246 (2016) - [j26]Mark-Jan Nederhof, Khalil Sima'an:
Parsing and finite-state technologies, introduction to the special issue. J. Lang. Model. 4(1): 1-2 (2016) - [c43]Mark-Jan Nederhof:
A short proof that O_2 is an MCFL. ACL (1) 2016 - [c42]Martin McCaffery, Mark-Jan Nederhof:
DTED: Evaluation of Machine Translation Structure Using Dependency Parsing and Tree Edit Distance. WMT 2016: 491-498 - [i13]Mark-Jan Nederhof:
A short proof that O2 is an MCFL. CoRR abs/1603.03610 (2016) - 2015
- [c41]Toni Dietze, Mark-Jan Nederhof:
Count-based State Merging for Probabilistic Regular Tree Grammars. FSMNLP 2015 - [c40]Mark-Jan Nederhof, Fahrurrozi Rahman:
A Probabilistic Model of Ancient Egyptian Writing. FSMNLP 2015 - 2014
- [j25]Mark-Jan Nederhof, Giorgio Satta:
Prefix probabilities for linear context-free rewriting systems. J. Log. Comput. 24(2): 331-350 (2014) - [j24]Matthias Büchse, Heiko Vogler, Mark-Jan Nederhof:
Tree parsing for tree-adjoining machine translation. J. Log. Comput. 24(2): 351-373 (2014) - [c39]Mark-Jan Nederhof, Heiko Vogler:
Hybrid Grammars for Discontinuous Parsing. COLING 2014: 1370-1381 - [c38]Mark-Jan Nederhof, Martin McCaffery:
Deterministic Parsing using PCFGs. EACL 2014: 338-347 - [i12]Colin de la Higuera, James Scicluna, Mark-Jan Nederhof:
On the Computation of Distances for Probabilistic Context-Free Grammars. CoRR abs/1407.1513 (2014) - 2013
- [c37]Eberhard Bertsch, Mark-Jan Nederhof, Sylvain Schmitz:
On LR Parsing with Selective Delays. CC 2013: 244-263 - [e3]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. Lecture Notes in Computer Science 8036, Springer 2013, ISBN 978-3-642-39997-8 [contents] - [e2]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. The Association for Computer Linguistics 2013 [contents] - 2012
- [c36]Mark-Jan Nederhof, Heiko Vogler:
Synchronous Context-Free Tree Grammars. TAG 2012: 55-63 - [e1]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. Lecture Notes in Computer Science 7395, Springer 2012, ISBN 978-3-642-32023-1 [contents] - 2011
- [j23]Mark-Jan Nederhof, Giorgio Satta:
Splittability of Bilexical Context-Free Grammars is Undecidable. Comput. Linguistics 37(4): 867-879 (2011) - [c35]Mark-Jan Nederhof, Giorgio Satta:
Prefix Probability for Probabilistic Synchronous Context-Free Grammars. ACL 2011: 460-469 - [c34]Mark-Jan Nederhof, Giorgio Satta:
Computation of Infix Probabilities for Probabilistic Context-Free Grammars. EMNLP 2011: 1213-1221 - [c33]Mark-Jan Nederhof:
Intersection for Weighted Formalisms. FSMNLP 2011: 1-2 - [c32]Matthias Büchse, Mark-Jan Nederhof, Heiko Vogler:
Tree Parsing with Synchronous Tree-Adjoining Grammars. IWPT 2011: 14-25 - [c31]Mark-Jan Nederhof, Giorgio Satta:
Prefix Probabilities for Linear Context-Free Rewriting Systems. IWPT 2011: 151-162 - [c30]Mark-Jan Nederhof, Ricardo Sánchez-Sáez:
Parsing of Partially Bracketed Structures for Parse Selection. IWPT 2011: 231-240 - [i11]Mark-Jan Nederhof, Giorgio Satta:
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing. CoRR abs/1107.0026 (2011) - 2010
- [c29]Mark-Jan Nederhof:
Transforming Lexica as Trees. ATANLP@ACL 2010 2010: 37-45
2000 – 2009
- 2009
- [j22]Mark-Jan Nederhof:
Automatic Creation of Interlinear Text for Philological Purposes. Trait. Autom. des Langues 50(2): 237-255 (2009) - [c28]Mark-Jan Nederhof:
Weighted parsing of trees. IWPT 2009: 13-24 - 2008
- [j21]Mark-Jan Nederhof, Giorgio Satta:
Computation of distances for regular and context-free probabilistic languages. Theor. Comput. Sci. 395(2-3): 235-254 (2008) - [p1]Mark-Jan Nederhof, Giorgio Satta:
Probabilistic Parsing. New Developments in Formal Languages and Applications 2008: 229-258 - 2007
- [j20]Eberhard Bertsch, Mark-Jan Nederhof:
Some observations on LR-like parsing with delayed reduction. Inf. Process. Lett. 104(6): 195-199 (2007) - 2006
- [j19]Mark-Jan Nederhof, Giorgio Satta:
Probabilistic parsing strategies. J. ACM 53(3): 406-436 (2006) - [c27]Marc Kemps-Snijders, Mark-Jan Nederhof, Peter Wittenburg:
LEXUS, a web-based tool for manipulating lexical resources lexicon. LREC 2006: 1862-1865 - [c26]Mark-Jan Nederhof, Giorgio Satta:
Estimation of Consistent Probabilistic Context-free Grammars. HLT-NAACL 2006 - 2005
- [j18]Mark-Jan Nederhof:
A General Technique to Train Language Models on Language Models. Comput. Linguistics 31(2): 173-185 (2005) - [j17]Eberhard Bertsch, Mark-Jan Nederhof:
Gap Parsing with LL(1) Grammars. Grammars 8: 1-16 (2005) - [c25]Martijn Wieling, Mark-Jan Nederhof, Gertjan van Noord:
Parsing Partially Bracketed Input. CLIN 2005 - 2004
- [j16]Mark-Jan Nederhof, Giorgio Satta:
The language intersection problem for non-recursive context-free grammars. Inf. Comput. 192(2): 172-184 (2004) - [j15]Eberhard Bertsch, Mark-Jan Nederhof:
Fast parallel recognition of LR language suffixes. Inf. Process. Lett. 92(5): 225-229 (2004) - [j14]Mark-Jan Nederhof, Giorgio Satta:
IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing. J. Artif. Intell. Res. 21: 287-317 (2004) - [c24]Mark-Jan Nederhof, Giorgio Satta:
Probabilistic Parsing Strategies. ACL 2004: 542-549 - [c23]Mark-Jan Nederhof, Giorgio Satta:
An Alternative Method of Training Probabilistic LR Parsers. ACL 2004: 550-557 - [c22]Mark-Jan Nederhof, Giorgio Satta:
Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata. COLING 2004 - [i10]Mark-Jan Nederhof, Giorgio Satta:
Tabular Parsing. CoRR cs.CL/0404009 (2004) - 2003
- [j13]Mark-Jan Nederhof:
Weighted Deductive Parsing and Knuth's Algorithm. Comput. Linguistics 29(1): 135-143 (2003) - [c21]Mark-Jan Nederhof, Giorgio Satta:
Probabilistic Parsing as Intersection. IWPT 2003: 137-148 - [c20]Mark-Jan Nederhof, Giorgio Satta, Stuart M. Shieber:
Partially Ordered Multiset Context-free Grammars and Free-word-order Parsing. IWPT 2003: 171-182 - 2002
- [c19]Mark-Jan Nederhof, Giorgio Satta:
Parsing non-recursive CFGs. ACL 2002: 112-119 - [c18]Mark-Jan Nederhof, Giorgio Satta:
Probabilistic Parsing Strategies. DCFS 2002: 216-230 - [i9]Mark-Jan Nederhof, Giorgio Satta:
Probabilistic Parsing Strategies. CoRR cs.CL/0211017 (2002) - 2001
- [j12]Eberhard Bertsch, Mark-Jan Nederhof:
Size/lookahead tradeoff for LL(k)-grammars. Inf. Process. Lett. 80(3): 125-129 (2001) - [c17]Mark-Jan Nederhof:
Approximating Context-Free by Rational Transduction for Example-Based MT. DDMMT@ACL 2001 - [c16]Eberhard Bertsch, Mark-Jan Nederhof:
On the Complexity of Some Extensions of RCG Parsing. IWPT 2001 - 2000
- [j11]Mark-Jan Nederhof:
Practical Experiments with Regular Approximation of Context-free Languages. Comput. Linguistics 26(1): 17-44 (2000) - [j10]Miguel A. Alonso, Mark-Jan Nederhof, Éric Villemonte de la Clergerie:
Tabulation of Automata for Tree-Adjoining Languages. Grammars 3(2/3): 89-110 (2000) - [c15]Mark-Jan Nederhof, Giorgio Satta:
Left-To-Right Parsing and Bilexical Context-Free Grammars. ANLP 2000: 272-279 - [c14]Mark-Jan Nederhof:
Preprocessing for Unification Parsing of Spoken Language. Natural Language Processing 2000: 118-129
1990 – 1999
- 1999
- [j9]Mark-Jan Nederhof:
The Computational Complexity of the Correct-Prefix Property for TAGs. Comput. Linguistics 25(3): 345-360 (1999) - [j8]Gertjan van Noord, Gosse Bouma, Rob Koeling, Mark-Jan Nederhof:
Robust grammatical analysis for spoken dialogue systems. Nat. Lang. Eng. 5(1): 45-93 (1999) - [j7]Eberhard Bertsch, Mark-Jan Nederhof:
Regular Closure of Deterministic Languages. SIAM J. Comput. 29(1): 81-102 (1999) - [j6]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): 1-10 (1999) - [i8]Gertjan van Noord, Gosse Bouma, Rob Koeling, Mark-Jan Nederhof:
Robust Grammatical Analysis for Spoken Dialogue Systems. CoRR cs.CL/9906026 (1999) - [i7]Mark-Jan Nederhof:
Practical experiments with regular approximation of context-free languages. CoRR cs.CL/9910022 (1999) - 1998
- [c13]Mark-Jan Nederhof:
An Alternative LR Algorithm for TAGs. COLING-ACL 1998: 946-952 - [c12]Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta:
Prefix Probabilities from Stochastic Tree Adjoining Grammars. COLING-ACL 1998: 953-959 - [c11]Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta:
Prefix probabilities for linear indexed grammars. TAG+ 1998: 116-119 - [c10]Mark-Jan Nederhof:
Linear Indexed Automata and Tabulation of TAG Parsing. TAPD 1998: 1-9 - [i6]Mark-Jan Nederhof, Giorgio Satta:
A Variant of Earley Parsing. CoRR cmp-lg/9808017 (1998) - [i5]Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta:
Prefix Probabilities from Stochastic Tree Adjoining Grammars. CoRR cs.CL/9809026 (1998) - 1997
- [c9]Mark-Jan Nederhof, Giorgio Satta:
A Variant of Earley Parsing. AI*IA 1997: 84-95 - [c8]Mark-Jan Nederhof, Gosse Bouma, Rob Koeling, Gertjan van Noord:
Grammatical analysis in the OVIS spoken-dialogue system. Real Applications@ACL/EACL 1997 - [c7]Mark-Jan Nederhof:
Regular Approximations of CFLs: A Grammatical View. IWPT 1997: 159-170 - [i4]Mark-Jan Nederhof, Gosse Bouma, Rob Koeling, Gertjan van Noord:
Grammatical analysis in the OVIS spoken-dialogue system. CoRR cmp-lg/9705003 (1997) - 1996
- [j5]Mark-Jan Nederhof, Eberhard Bertsch:
Linear-Time Suffix Parsing for Deterministic Languages. J. ACM 43(3): 524-554 (1996) - [j4]Mark-Jan Nederhof:
Efficient generation of random sentences. Nat. Lang. Eng. 2(1): 1-13 (1996) - [j3]Mark-Jan Nederhof, Eberhard Bertsch:
An innovative finite state concept for recognition and parsing of context-free languages. Nat. Lang. Eng. 2(4): 381-382 (1996) - [c6]Mark-Jan Nederhof, Giorgio Satta:
Efficient Tabular LR Parsing. ACL 1996: 239-247 - [i3]Mark-Jan Nederhof, Giorgio Satta:
Efficient Tabular LR Parsing. CoRR cmp-lg/9605018 (1996) - 1995
- [c5]Mark-Jan Nederhof:
Reversible Pushdown Automata and Bidirectional Parsing. Developments in Language Theory 1995: 472-481 - 1994
- [c4]Mark-Jan Nederhof:
An Optimal Tabular Parsing Algorithm. ACL 1994: 117-124 - [c3]Mark-Jan Nederhof, Giorgio Satta:
An Extended Theory of Head-Driven Parsing. ACL 1994: 210-217 - [i2]Mark-Jan Nederhof:
An Optimal Tabular Parsing Algorithm. CoRR abs/cmp-lg/9405025 (1994) - [i1]Mark-Jan Nederhof, Giorgio Satta:
An Extended Theory of Head-Driven Parsing. CoRR abs/cmp-lg/9405026 (1994) - 1993
- [j2]Mark-Jan Nederhof, Janos J. Sarbo:
Partial Evaluation Grammars. Comput. Lang. 18(2): 137-151 (1993) - [c2]Mark-Jan Nederhof:
Generalized Left-Corner Parsing. EACL 1993: 305-314 - [c1]Mark-Jan Nederhof:
A New Top-Down Parsing Algorithm for Left-Recursive DCGs. PLILP 1993: 108-122 - 1991
- [j1]Herman Geuvers, Mark-Jan Nederhof:
Modular Proof of Strong Normalization for the Calculus of Constructions. J. Funct. Program. 1(2): 155-189 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-20 20:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
