The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Mark-Jan Nederhof: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mark-Jan Nederhof
    An Optimal Tabular Parsing Algorithm. [Citation Graph (0, 0)][DBLP]
    ACL, 1994, pp:117-124 [Conf]
  2. Mark-Jan Nederhof
    An Alternative LR Algorithm for TAGs. [Citation Graph (0, 0)][DBLP]
    COLING-ACL, 1998, pp:946-952 [Conf]
  3. Mark-Jan Nederhof, Giorgio Satta
    Parsing non-recursive CFGs. [Citation Graph (0, 0)][DBLP]
    ACL, 2002, pp:112-119 [Conf]
  4. Mark-Jan Nederhof, Giorgio Satta
    Probabilistic Parsing Strategies. [Citation Graph (0, 0)][DBLP]
    ACL, 2004, pp:542-549 [Conf]
  5. Mark-Jan Nederhof, Giorgio Satta
    An Alternative Method of Training Probabilistic LR Parsers. [Citation Graph (0, 0)][DBLP]
    ACL, 2004, pp:550-557 [Conf]
  6. Mark-Jan Nederhof, Giorgio Satta
    An Extended Theory of Head-Driven Parsing. [Citation Graph (0, 0)][DBLP]
    ACL, 1994, pp:210-217 [Conf]
  7. Mark-Jan Nederhof, Giorgio Satta
    Efficient Tabular LR Parsing. [Citation Graph (0, 0)][DBLP]
    ACL, 1996, pp:239-247 [Conf]
  8. Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
    Prefix Probabilities from Stochastic Tree Adjoining Grammars. [Citation Graph (0, 0)][DBLP]
    COLING-ACL, 1998, pp:953-959 [Conf]
  9. Mark-Jan Nederhof, Giorgio Satta
    A Variant of Early Parsing. [Citation Graph (0, 0)][DBLP]
    AI*IA, 1997, pp:84-95 [Conf]
  10. Mark-Jan Nederhof, Giorgio Satta
    Left-To-Right Parsing and Bilexical Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    ANLP, 2000, pp:272-279 [Conf]
  11. Mark-Jan Nederhof
    Reversible Pushdown Automata and Bidirectional Parsing. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:472-481 [Conf]
  12. Mark-Jan Nederhof
    Generalized Left-Corner Parsing. [Citation Graph (0, 0)][DBLP]
    EACL, 1993, pp:305-314 [Conf]
  13. Eberhard Bertsch, Mark-Jan Nederhof
    On the Complexity of Some Extensions of RCG Parsing. [Citation Graph (0, 0)][DBLP]
    IWPT, 2001, pp:- [Conf]
  14. Mark-Jan Nederhof, Giorgio Satta
    Estimation of Consistent Probabilistic Context-free Grammars. [Citation Graph (0, 0)][DBLP]
    HLT-NAACL, 2006, pp:- [Conf]
  15. Mark-Jan Nederhof
    Preprocessing for Unification Parsing of Spoken Language. [Citation Graph (0, 0)][DBLP]
    Natural Language Processing, 2000, pp:118-129 [Conf]
  16. Mark-Jan Nederhof
    A New Top-Down Parsing Algorithm for Left-Recursive DCGs. [Citation Graph (0, 0)][DBLP]
    PLILP, 1993, pp:108-122 [Conf]
  17. Mark-Jan Nederhof
    Linear Indexed Automata and Tabulation of TAG Parsing. [Citation Graph (0, 0)][DBLP]
    TAPD, 1998, pp:1-9 [Conf]
  18. Martijn Wieling, Mark-Jan Nederhof, Gertjan van Noord
    Parsing Partially Bracketed Input. [Citation Graph (0, 0)][DBLP]
    CLIN, 2005, pp:- [Conf]
  19. Mark-Jan Nederhof, Janos J. Sarbo
    Partial Evaluation Grammars. [Citation Graph (0, 0)][DBLP]
    Comput. Lang., 1993, v:18, n:2, pp:137-151 [Journal]
  20. Mark-Jan Nederhof
    Practical Experiments with Regular Approximation of Context-free Languages. [Citation Graph (0, 0)][DBLP]
    Computational Linguistics, 2000, v:26, n:1, pp:17-44 [Journal]
  21. Mark-Jan Nederhof
    Weighted Deductive Parsing and Knuth's Algorithm. [Citation Graph (0, 0)][DBLP]
    Computational Linguistics, 2003, v:29, n:1, pp:135-143 [Journal]
  22. Mark-Jan Nederhof
    A General Technique to Train Language Models on Language Models. [Citation Graph (0, 0)][DBLP]
    Computational Linguistics, 2005, v:32, n:2, pp:173-185 [Journal]
  23. Mark-Jan Nederhof
    The Computational Complexity of the Correct-Prefix Property for TAGs. [Citation Graph (0, 0)][DBLP]
    Computational Linguistics, 1999, v:25, n:3, pp:345-360 [Journal]
  24. Mark-Jan Nederhof, Giorgio Satta
    Efficient Tabular LR Parsing [Citation Graph (0, 0)][DBLP]
    CoRR, 1996, v:0, n:, pp:- [Journal]
  25. Mark-Jan Nederhof, Gosse Bouma, Rob Koeling, Gertjan van Noord
    Grammatical analysis in the OVIS spoken-dialogue system [Citation Graph (0, 0)][DBLP]
    CoRR, 1997, v:0, n:, pp:- [Journal]
  26. Mark-Jan Nederhof, Giorgio Satta
    A Variant of Earley Parsing [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  27. Mark-Jan Nederhof, Giorgio Satta
    Probabilistic Parsing Strategies [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  28. Mark-Jan Nederhof, Giorgio Satta
    Tabular Parsing [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  29. Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
    Prefix Probabilities from Stochastic Tree Adjoining Grammars [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  30. Gertjan van Noord, Gosse Bouma, Rob Koeling, Mark-Jan Nederhof
    Robust Grammatical Analysis for Spoken Dialogue Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  31. Mark-Jan Nederhof
    Practical experiments with regular approximation of context-free languages [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  32. Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemonte de la Clergerie
    Tabulation of Automata for Tree-Adjoining Languages. [Citation Graph (0, 0)][DBLP]
    Grammars, 2000, v:3, n:2/3, pp:89-110 [Journal]
  33. Mark-Jan Nederhof, Giorgio Satta
    The language intersection problem for non-recursive context-free grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:192, n:2, pp:172-184 [Journal]
  34. Eberhard Bertsch, Mark-Jan Nederhof
    Size/lookahead tradeoff for LL(k)-grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2001, v:80, n:3, pp:125-129 [Journal]
  35. Eberhard Bertsch, Mark-Jan Nederhof
    Fast parallel recognition of LR language suffixes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:92, n:5, pp:225-229 [Journal]
  36. Mark-Jan Nederhof, Eberhard Bertsch
    Linear-Time Suffix Parsing for Deterministic Languages. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1996, v:43, n:3, pp:524-554 [Journal]
  37. Mark-Jan Nederhof, Giorgio Satta
    Probabilistic parsing strategies. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2006, v:53, n:3, pp:406-436 [Journal]
  38. Mark-Jan Nederhof, Giorgio Satta
    IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing. [Citation Graph (0, 0)][DBLP]
    J. Artif. Intell. Res. (JAIR), 2004, v:21, n:, pp:287-317 [Journal]
  39. Herman Geuvers, Mark-Jan Nederhof
    Modular Proof of Strong Normalization for the Calculus of Constructions. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1991, v:1, n:2, pp:155-189 [Journal]
  40. Eberhard Bertsch, Mark-Jan Nederhof
    Regular Closure of Deterministic Languages. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1999, v:29, n:1, pp:81-102 [Journal]
  41. Eberhard Bertsch, Mark-Jan Nederhof
    On Failure of the Pruning Technique in ``Error Repair in Shift-Reduce Parsers''. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1999, v:21, n:1, pp:1-10 [Journal]
  42. Eberhard Bertsch, Mark-Jan Nederhof
    Some observations on LR-like parsing with delayed reduction. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:6, pp:195-199 [Journal]

  43. Weighted parsing of trees. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.010secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002