Name
Papers
Collaborators
MARK-JAN NEDERHOF
72
81
Citations 
PageRank 
Referers 
387
53.30
505
Referees 
References 
688
811
Search Limit
100688
Title
Citations
PageRank
Year
A derivational model of discontinuous parsing00.342021
Regular transductions with MCFG input syntax.00.342019
Calculating the Optimal Step in Shift-Reduce Dependency Parsing: From Cubic to Linear Time.00.342019
A Derivational Model of Discontinuous Parsing.10.352017
Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures.00.342017
A Probabilistic Model of Ancient Egyptian Writing.00.342017
Non-Self-Embedding Linear Context-Free Tree Grammars Generate Regular Tree Languages.00.342016
A Short Proof That O-2 Is An Mcfl00.342016
Parsing and finite-state technologies, introduction to the special issue.00.342016
DTED: Evaluation of Machine Translation Structure Using Dependency Parsing and Tree Edit Distance.20.392016
A short proof that O_2 is an MCFL.00.342016
Count-based State Merging for Probabilistic Regular Tree Grammars.00.342015
Tree parsing for tree-adjoining machine translation.20.372014
Prefix probabilities for linear context-free rewriting systems10.372014
Deterministic Parsing using PCFGs.10.362014
On LR parsing with selective delays00.342013
Synchronous Context-Free Tree Grammars.00.342012
Formal Grammar - 15th and 16th International Conferences, FG 2010, Copenhagen, Denmark, August 2010, FG 2011, Ljubljana, Slovenia, August 2011, Revised Selected Papers191.502012
IDL-expressions: a formalism for representing and parsing finite languages in natural language processing90.732011
Computation of infix probabilities for probabilistic context-free grammars30.412011
Prefix probability for probabilistic synchronous context-free grammars30.412011
Splittability of bilexical context-free grammars is undecidable00.342011
Intersection for weighted formalisms00.342011
Parsing of partially bracketed structures for parse selection00.342011
Tree parsing with synchronous tree-adjoining grammars30.372011
Transforming lexica as trees00.342010
Weighted parsing of trees40.412009
Automatic Creation Of Interlinear Text For Philological Purposes00.342009
Computation of distances for regular and context-free probabilistic languages90.632008
LEXUS, a web-based tool for manipulating lexical resources lexicon.00.342006
Estimation of consistent probabilistic context-free grammars60.502006
Gap Parsing with LL(1) Grammars20.362005
Parsing Partially Bracketed Input20.482005
A General Technique to Train Language Models on Language Models110.832005
Fast parallel recognition of LR language suffixes00.342004
An alternative method of training probabilistic LR parsers30.392004
The language intersection problem for non-recursive context-free grammars80.682004
Kullback-Leibler distance between probabilistic context-free grammars and probabilistic finite automata70.552004
Tabular Parsing10.362004
Effective dimensions of hierarchical latent class models70.652004
Weighted deductive parsing and Knuth's algorithm361.902003
PARTIALLY ORDERED MULTISET CONTEXT-FREE GRAMMARS AND FREE-WORD-ORDER PARSING30.452003
Parsing non-recursive CFGs20.532002
Probabilistic parsing strategies60.532002
Size/lookahead tradeoff for LL(k)-grammars60.622001
On the Complexity of Some Extensions of RCG Parsing131.092001
Approximating context-free by rational transduction for example-based MT00.342001
Left-to-right parsing and bilexical context-free grammars10.362000
Preprocessing for Unification Parsing of Spoken Language00.342000
Practical experiments with regular approximation of context-free languages443.762000
  • 1
  • 2