Popular Co-Authors

Giorgio Satta (15)

Anoop Sarkar (3)

Heiko Vogler (3)

Martin McCaffery (2)

Toni Dietze (1)

Gosse Bouma (1)

Rob Koeling (1)

Gertjan van Noord (1)

Fahrurrozi Rahman (1)

Matthias Büchse (1)

Venues

WS (16)

ACL (10)

COLING (6)

FSMNLP (5)

CL (5)

IWPT (4)

NAACL (2)

EACL (2)

2016

Pdf Export Search A short proof that O_2 is an MCFL
[P16-1106]: Mark-Jan Nederhof

Pdf Export Search DTED: Evaluation of Machine Translation Structure Using Dependency Parsing and Tree Edit Distance
[W16-2340]: Martin McCaffery | Mark-Jan Nederhof

Pdf Export Search Transition-based dependency parsing as latent-variable constituent parsing
[W16-2403]: Mark-Jan Nederhof

2015

Pdf Export Search Count-based State Merging for Probabilistic Regular Tree Grammars
[W15-4804]: Toni Dietze | Mark-Jan Nederhof

Pdf Export Search A Probabilistic Model of Ancient Egyptian Writing
[W15-4810]: Mark-Jan Nederhof | Fahrurrozi Rahman

2014

Pdf Export Search Hybrid Grammars for Discontinuous Parsing
[C14-1130]: Mark-Jan Nederhof | Heiko Vogler

Pdf Export Search Deterministic Parsing using PCFGs
[E14-1036]: Mark-Jan Nederhof | Martin McCaffery

2013

Pdf Export Search Proceedings of the 11th International Conference on Finite State Methods and Natural Language Processing
[W13-1800]: Mark-Jan Nederhof

2012

Pdf Export Search Synchronous Context-Free Tree Grammars
[W12-4607]: Mark-Jan Nederhof | Heiko Vogler

2011

Pdf Export Search Computation of Infix Probabilities for Probabilistic Context-Free Grammars
[D11-1112]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search Prefix Probability for Probabilistic Synchronous Context-Free Grammars
[P11-1047]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search Splittability of Bilexical Context-Free Grammars is Undecidable
[J11-4009]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search Tree Parsing with Synchronous Tree-Adjoining Grammars
[W11-2903]: Matthias Büchse | Mark-Jan Nederhof | Heiko Vogler

Pdf Export Search Prefix Probabilities for Linear Context-Free Rewriting Systems
[W11-2919]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search Parsing of Partially Bracketed Structures for Parse Selection
[W11-2928]: Mark-Jan Nederhof | Ricardo Sánchez-Sáez

Pdf Export Search Intersection for Weighted Formalisms
[W11-4401]: Mark-Jan Nederhof

2010

Pdf Export Search Transforming Lexica as Trees
[W10-2505]: Mark-Jan Nederhof

2009

Pdf Export Search Weighted parsing of trees
[W09-3802]: Mark-Jan Nederhof

2006

Pdf Export Search Estimation of Consistent Probabilistic Context-free Grammars
[N06-1044]: Mark-Jan Nederhof | Giorgio Satta

2005

Pdf Export Search A General Technique to Train Language Models on Language Models
[J05-2002]: Mark-Jan Nederhof

2004

Pdf Export Search Kullback-Leibler Distance between Probabilistic Context-Free Grammars and Probabilistic Finite Automata
[C04-1011]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search Probabilistic Parsing Strategies
[P04-1069]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search An Alternative Method of Training Probabilistic LR Parsers
[P04-1070]: Mark-Jan Nederhof | Giorgio Satta

2003

Pdf Export Search Squibs and Discussions: Weighted Deductive Parsing and Knuth's Algorithm
[J03-1006]: Mark-Jan Nederhof

2002

Pdf Export Search Parsing non-recursive CFGs
[P02-1015]: Mark-Jan Nederhof | Giorgio Satta

2001

Pdf Export Search Approximating Context-Free by Rational Transduction for Example-Based MT
[W01-1404]: Mark-Jan Nederhof

2000

Pdf Export Search Left-To-Right Parsing and Bilexical Context-Free Grammars
[A00-2036]: Mark-Jan Nederhof | Giorgio Satta

Pdf Export Search Practical Experiments with Regular Approximation of Context-Free Languages
[J00-1003]: Mark-Jan Nederhof

1999

Pdf Export Search The Computational Complexity of the Correct-Prefix Property for TAGs
[J99-3002]: Mark-Jan Nederhof

1998

Pdf Export Search An alternative LR algorithm for TAGs
[C98-2151]: Mark-Jan Nederhof

Pdf Export Search Prefix Probabilities from Stochastic Tree Adjoining Grammars
[C98-2152]: Mark-Jan Nederhof | Anoop Sarkar | Giorgio Satta

Pdf Export Search An Alternative LR Algorithm for TAGs
[P98-2156]: Mark-Jan Nederhof

Pdf Export Search Prefix Probabilities from Stochastic Free Adjoining Grammars
[P98-2157]: Mark-Jan Nederhof | Anoop Sarkar | Giorgio Satta

Pdf Export Search Prefix probabilities for linear indexed grammars
[W98-0130]: Mark-Jan Nederhof | Anoop Sarkar | Giorgio Satta

Pdf Export Search Context-Free Parsing through Regular Approximation
[W98-1302]: Mark-Jan Nederhof

1997

Pdf Export Search Grammatical analysis in the OVIS spoken-dialogue system
[W97-0614]: Mark-Jan Nederhof | Gosse Bouma | Rob Koeling | Gertjan van Noord

1996

Pdf Export Search Efficient Tabular L R Parsing
[P96-1032]: Mark-Jan Nederhof | Giorgio Satta

1994

Pdf Export Search AN OPTIMAL TABULAR PARSING ALGORITHM
[P94-1017]: Mark-Jan Nederhof

Pdf Export Search AN EXTENDED THEORY OF HEAD-DRIVEN PARSING
[P94-1029]: Mark-Jan Nederhof | Giorgio Satta

1993

Pdf Export Search Generalized Left-Corner Parsing
[E93-1036]: Mark-Jan Nederhof