NLPExplorer
Papers
Venues
Authors
Authors Timeline
Field of Study
URLs
ACL N-gram Stats
TweeNLP
API
Team
Mark Jan Nederhof
Number of Papers:- 50
Number of Citations:- 92
First ACL Paper:- 1993
Latest ACL Paper:- 2021
Venues:-
WS
HLT
NAACL
CL
LREC
TAG+
WMT
StatFSM
TACL
EMNLP
IWPT
ANLP
FSMNLP
ACL
EACL
COLING
Co-Authors:-
Anoop Sarkar
Eberhard Bertsch
Fahrurrozi Rahman
Gertjan Van Noord
Giorgio Satta
Similar Authors:-
Lorin Wilde
Eva Schmidt
Ming Tat Ko
Florin Haque
N J Belkin
2021
2019
2017
2016
2015
2014
2013
2012
2011
2010
2009
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1994
1993
Calculating the optimal step of arc-eager parsing for non-projective trees
EACL
Mark-Jan Nederhof |
Calculating the Optimal Step in Shift-Reduce Dependency Parsing: From Cubic to Linear Time
TACL
Mark-Jan Nederhof |
Regular transductions with MCFG input syntax
WS
Mark-Jan Nederhof |
Heiko Vogler |
Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures
CL
Kilian Gebhardt |
Mark-Jan Nederhof |
Heiko Vogler |
A short proof that O_2 is an MCFL
ACL
Mark-Jan Nederhof |
DTED: Evaluation of Machine Translation Structure Using Dependency Parsing and Tree Edit Distance
WMT
WS
Martin McCaffery |
Mark-Jan Nederhof |
Transition-based dependency parsing as latent-variable constituent parsing
StatFSM
WS
Mark-Jan Nederhof |
Count-based State Merging for Probabilistic Regular Tree Grammars
FSMNLP
WS
Toni Dietze |
Mark-Jan Nederhof |
A Probabilistic Model of Ancient Egyptian Writing
FSMNLP
WS
Mark-Jan Nederhof |
Fahrurrozi Rahman |
Hybrid Grammars for Discontinuous Parsing
COLING
Mark-Jan Nederhof |
Heiko Vogler |
Deterministic Parsing using PCFGs
EACL
Mark-Jan Nederhof |
Martin McCaffery |
Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing
FSMNLP
WS
Mark-Jan Nederhof |
Synchronous Context-Free Tree Grammars
TAG+
WS
Mark-Jan Nederhof |
Heiko Vogler |
Computation of Infix Probabilities for Probabilistic Context-Free Grammars
EMNLP
Mark-Jan Nederhof |
Giorgio Satta |
Splittability of Bilexical Context-Free Grammars is Undecidable
CL
Mark-Jan Nederhof |
Giorgio Satta |
Prefix Probability for Probabilistic Synchronous Context-Free Grammars
ACL
Mark-Jan Nederhof |
Giorgio Satta |
Tree Parsing with Synchronous Tree-Adjoining Grammars
IWPT
WS
Matthias Büchse |
Mark-Jan Nederhof |
Heiko Vogler |
Prefix Probabilities for Linear Context-Free Rewriting Systems
IWPT
WS
Mark-Jan Nederhof |
Giorgio Satta |
Parsing of Partially Bracketed Structures for Parse Selection
IWPT
WS
Mark-Jan Nederhof |
Ricardo Sánchez-Sáez |
Intersection for Weighted Formalisms
FSMNLP
WS
Mark-Jan Nederhof |
Transforming Lexica as Trees
WS
Mark-Jan Nederhof |
Weighted parsing of trees
IWPT
WS
Mark-Jan Nederhof |
LEXUS, a web-based tool for manipulating lexical resources lexicon
LREC
Marc Kemps-Snijders |
Mark-Jan Nederhof |
Peter Wittenburg |
Estimation of Consistent Probabilistic Context-free Grammars
HLT
NAACL
Mark-Jan Nederhof |
Giorgio Satta |
A General Technique to Train Language Models on Language Models
CL
Mark-Jan Nederhof |
Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata
COLING
Mark-Jan Nederhof |
Giorgio Satta |
Probabilistic Parsing Strategies
ACL
Mark-Jan Nederhof |
Giorgio Satta |
An Alternative Method of Training Probabilistic LR Parsers
ACL
Mark-Jan Nederhof |
Giorgio Satta |
Squibs and Discussions: Weighted Deductive Parsing and Knuth’s Algorithm
CL
Mark-Jan Nederhof |
Probabilistic Parsing as Intersection
WS
Mark-Jan Nederhof |
Giorgio Satta |
Partially Ordered Multiset Context-free Grammars and Free-word-order Parsing
WS
Mark-Jan Nederhof |
Giorgio Satta |
Stuart Shieber |
Parsing non-recursive CFGs
ACL
Mark-Jan Nederhof |
Giorgio Satta |
Approximating Context-Free by Rational Transduction for Example-Based MT
WS
Mark-Jan Nederhof |
On the Complexity of Some Extensions of RCG Parsing
WS
Eberhard Bertsch |
Mark-Jan Nederhof |
Left-To-Right Parsing and Bilexical Context-Free Grammars
ANLP
NAACL
Mark-Jan Nederhof |
Giorgio Satta |
Practical Experiments with Regular Approximation of Context-Free Languages
CL
Mark-Jan Nederhof |
The Computational Complexity of the Correct-Prefix Property for TAGs
CL
Mark-Jan Nederhof |
An alternative LR algorithm for TAGs
COLING
Mark-Jan Nederhof |
Prefix Probabilities from Stochastic Tree Adjoining Grammars
COLING
Mark-Jan Nederhof |
Anoop Sarkar |
Giorgio Satta |
An Alternative LR Algorithm for TAGs
ACL
COLING
Mark-Jan Nederhof |
Prefix Probabilities from Stochastic Free Adjoining Grammars
ACL
COLING
Mark-Jan Nederhof |
Anoop Sarkar |
Giorgio Satta |
Prefix probabilities for linear indexed grammars
TAG+
WS
Mark-Jan Nederhof |
Anoop Sarkar |
Giorgio Satta |
Context-Free Parsing through Regular Approximation
FSMNLP
WS
Mark-Jan Nederhof |
Grammatical analysis in the OVIS spoken-dialogue system
WS
Mark-Jan Nederhof |
Gosse Bouma |
Rob Koeling |
Gertjan van Noord |
Regular Approximations of CFLs: A Grammatical View
IWPT
WS
Mark-Jan Nederhof |
Efficient Tabular L R Parsing
ACL
Mark-Jan Nederhof |
Giorgio Satta |
AN OPTIMAL TABULAR PARSING ALGORITHM
ACL
Mark-Jan Nederhof |
AN EXTENDED THEORY OF HEAD-DRIVEN PARSING
ACL
Mark-Jan Nederhof |
Giorgio Satta |
Generalized Left-Corner Parsing
EACL
Mark-Jan Nederhof |
Increasing the Applicability of LR Parsing
IWPT
WS
Mark-Jan Nederhof |
Janos J. Sarbo |
Linguistic
Task
Approach
Language
.