dblp.uni-trier.dewww.uni-trier.de

Mark-Jan Nederhof

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

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

Coauthor Index

1Miguel A. Alonso (Miguel Angel Alonso Pardo) [23]
2Eberhard Bertsch [8] [18] [22] [27] [28] [33] [42]
3Gosse Bouma [11] [21]
4Eric Villemonte de la Clergerie [23]
5Herman Geuvers [1]
6Rob Koeling [11] [21]
7Gertjan van Noord [11] [21] [39]
8Janos J. Sarbo [2]
9Anoop Sarkar [13] [16]
10Giorgio Satta [5] [9] [10] [12] [13] [14] [16] [26] [29] [30] [32] [34] [35] [36] [37] [40] [41] [43]
11Martijn Wieling [39]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)