MarkJan Nederhof
2021
Calculating the optimal step of arceager parsing for nonprojective trees
MarkJan Nederhof
Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume
Automatic Classification of Human Translation and Machine Translation: A Study from the Perspective of Lexical Diversity
Yingxue Fu

MarkJan Nederhof
Proceedings for the First Workshop on Modelling Translation: Translatology in the Digital Age
2019
Regular transductions with MCFG input syntax
MarkJan Nederhof

Heiko Vogler
Proceedings of the 14th International Conference on FiniteState Methods and Natural Language Processing
Calculating the Optimal Step in ShiftReduce Dependency Parsing: From Cubic to Linear Time
MarkJan Nederhof
Transactions of the Association for Computational Linguistics, Volume 7
2017
Hybrid Grammars for Parsing of Discontinuous Phrase Structures and NonProjective Dependency Structures
Kilian Gebhardt

MarkJan Nederhof

Heiko Vogler
Computational Linguistics, Volume 43, Issue 3  September 2017
2016
DTED: Evaluation of Machine Translation Structure Using Dependency Parsing and Tree Edit Distance
Martin McCaffery

MarkJan Nederhof
Proceedings of the First Conference on Machine Translation: Volume 2, Shared Task Papers
Transitionbased dependency parsing as latentvariable constituent parsing
MarkJan Nederhof
Proceedings of the SIGFSM Workshop on Statistical NLP and Weighted Automata
A short proof that O_2 is an MCFL
MarkJan Nederhof
Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
2015
Countbased State Merging for Probabilistic Regular Tree Grammars
Toni Dietze

MarkJan Nederhof
Proceedings of the 12th International Conference on FiniteState Methods and Natural Language Processing 2015 (FSMNLP 2015 Düsseldorf)
A Probabilistic Model of Ancient Egyptian Writing
MarkJan Nederhof

Fahrurrozi Rahman
Proceedings of the 12th International Conference on FiniteState Methods and Natural Language Processing 2015 (FSMNLP 2015 Düsseldorf)
2014
Deterministic Parsing using PCFGs
MarkJan Nederhof

Martin McCaffery
Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics
Hybrid Grammars for Discontinuous Parsing
MarkJan Nederhof

Heiko Vogler
Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers
2013
Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing
MarkJan Nederhof
Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing
2012
Synchronous ContextFree Tree Grammars
MarkJan Nederhof

Heiko Vogler
Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+11)
2011
Computation of Infix Probabilities for Probabilistic ContextFree Grammars
MarkJan Nederhof

Giorgio Satta
Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing
Splittability of Bilexical ContextFree Grammars is Undecidable
MarkJan Nederhof

Giorgio Satta
Computational Linguistics, Volume 37, Issue 4  December 2011
Tree Parsing with Synchronous TreeAdjoining Grammars
Matthias Büchse

MarkJan Nederhof

Heiko Vogler
Proceedings of the 12th International Conference on Parsing Technologies
Prefix Probabilities for Linear ContextFree Rewriting Systems
MarkJan Nederhof

Giorgio Satta
Proceedings of the 12th International Conference on Parsing Technologies
Parsing of Partially Bracketed Structures for Parse Selection
MarkJan Nederhof

Ricardo SánchezSáez
Proceedings of the 12th International Conference on Parsing Technologies
Intersection for Weighted Formalisms
MarkJan Nederhof
Proceedings of the 9th International Workshop on Finite State Methods and Natural Language Processing
Prefix Probability for Probabilistic Synchronous ContextFree Grammars
MarkJan Nederhof

Giorgio Satta
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies
2010
Transforming Lexica as Trees
MarkJan Nederhof
Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
2009
Automatic Creation of Interlinear Text for Philological Purposes
MarkJan Nederhof
Traitement Automatique des Langues, Volume 50, Numéro 2 : Langues anciennes [Ancient Languages]
Weighted parsing of trees
MarkJan Nederhof
Proceedings of the 11th International Conference on Parsing Technologies (IWPT’09)
2006
Estimation of Consistent Probabilistic Contextfree Grammars
MarkJan Nederhof

Giorgio Satta
Proceedings of the Human Language Technology Conference of the NAACL, Main Conference
LEXUS, a webbased tool for manipulating lexical resources lexicon
Marc KempsSnijders

MarkJan Nederhof

Peter Wittenburg
Proceedings of the Fifth International Conference on Language Resources and Evaluation (LREC’06)
2005
A General Technique to Train Language Models on Language Models
MarkJan Nederhof
Computational Linguistics, Volume 31, Number 2, June 2005
2004
Probabilistic Parsing Strategies
MarkJan Nederhof

Giorgio Satta
Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL04)
An Alternative Method of Training Probabilistic LR Parsers
MarkJan Nederhof

Giorgio Satta
Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL04)
KullbackLeibler Distance between Probabilistic ContextFree Grammars and Probabilistic Finite Automata
MarkJan Nederhof

Giorgio Satta
COLING 2004: Proceedings of the 20th International Conference on Computational Linguistics
2003
Squibs and Discussions: Weighted Deductive Parsing and Knuth’s Algorithm
MarkJan Nederhof
Computational Linguistics, Volume 29, Number 1, March 2003
Probabilistic Parsing as Intersection
MarkJan Nederhof

Giorgio Satta
Proceedings of the Eighth International Conference on Parsing Technologies
Partially Ordered Multiset Contextfree Grammars and Freewordorder Parsing
MarkJan Nederhof

Giorgio Satta

Stuart Shieber
Proceedings of the Eighth International Conference on Parsing Technologies
2002
Parsing nonrecursive CFGs
MarkJan Nederhof

Giorgio Satta
Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics
2001
Approximating ContextFree by Rational Transduction for ExampleBased MT
MarkJan Nederhof
Proceedings of the ACL 2001 Workshop on DataDriven Methods in Machine Translation
On the Complexity of Some Extensions of RCG Parsing
Eberhard Bertsch

MarkJan Nederhof
Proceedings of the Seventh International Workshop on Parsing Technologies
2000
Practical Experiments with Regular Approximation of ContextFree Languages
MarkJan Nederhof
Computational Linguistics, Volume 26, Number 1, March 2000
LeftToRight Parsing and Bilexical ContextFree Grammars
MarkJan Nederhof

Giorgio Satta
1st Meeting of the North American Chapter of the Association for Computational Linguistics
1999
The Computational Complexity of the CorrectPrefix Property for TAGs
MarkJan Nederhof
Computational Linguistics, Volume 25, Number 3, September 1999
1998
An Alternative LR Algorithm for TAGs
MarkJan Nederhof
36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Volume 2
Prefix Probabilities from Stochastic Free Adjoining Grammars
MarkJan Nederhof

Anoop Sarkar

Giorgio Satta
36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Volume 2
Prefix probabilities for linear indexed grammars
MarkJan Nederhof

Anoop Sarkar

Giorgio Satta
Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4)
ContextFree Parsing through Regular Approximation
MarkJan Nederhof
Finite State Methods in Natural Language Processing
An alternative LR algorithm for TAGs
MarkJan Nederhof
COLING 1998 Volume 2: The 17th International Conference on Computational Linguistics
Prefix Probabilities from Stochastic Tree Adjoining Grammars
MarkJan Nederhof

Anoop Sarkar

Giorgio Satta
COLING 1998 Volume 2: The 17th International Conference on Computational Linguistics
1997
Grammatical analysis in the OVIS spokendialogue system
MarkJan Nederhof

Gosse Bouma

Rob Koeling

Gertjan van Noord
Interactive Spoken Dialog Systems: Bringing Speech and NLP Together in Real Applications
Regular Approximations of CFLs: A Grammatical View
MarkJan Nederhof
Proceedings of the Fifth International Workshop on Parsing Technologies
1996
Efficient Tabular LR Parsing
MarkJan Nederhof

Giorgio Satta
34th Annual Meeting of the Association for Computational Linguistics
1994
An Optimal Tabular Parsing Algorithm
MarkJan Nederhof
32nd Annual Meeting of the Association for Computational Linguistics
An Extended Theory of HeadDriven Parsing
MarkJan Nederhof

Giorgio Satta
32nd Annual Meeting of the Association for Computational Linguistics
1993
Generalized LeftCorner Parsing
MarkJan Nederhof
Sixth Conference of the European Chapter of the Association for Computational Linguistics
Increasing the Applicability of LR Parsing
MarkJan Nederhof

Janos J. Sarbo
Proceedings of the Third International Workshop on Parsing Technologies
Coauthors
 Giorgio Satta 17
 Heiko Vogler 5
 Anoop Sarkar 3
 Martin McCaffery 2
 Toni Dietze 1
 show all...