Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Mark-Jan
Last name:	Nederhof
DBLP:	83/165
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 25 of 43  

Select a publication
Show	Title	Venue	Rating	Date
	Mark-Jan Nederhof, Giorgio Satta. Computation of distances for regular and context-free probabilistic languages.	Theor. Comput. Sci. 2008, Volume 395	(0)	2008
	Eberhard Bertsch, Mark-Jan Nederhof. Some observations on LR-like parsing with delayed reduction.	Inf. Process. Lett. 2007, Volume 104	(0)	2007
	Mark-Jan Nederhof, Giorgio Satta. Estimation of Consistent Probabilistic Context-free Grammars.	Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, Proceedings, June 4-9, 2006, New York, New York, USA 2006	(0)	2006
	Mark-Jan Nederhof, Giorgio Satta. Probabilistic parsing strategies.	J. ACM 2006, Volume 53	(0)	2006
	Martijn Wieling, Mark-Jan Nederhof, Gertjan van Noord. Parsing Partially Bracketed Input.	Computational Linguistics in the Netherlands 2005, Proceedings 16th Meeting of Computational Linguistics in the Netherlands, December 16, 2005, University of Amsterdam 2006	(0)	2005
	Mark-Jan Nederhof. A General Technique to Train Language Models on Language Models.	Computational Linguistics 2005, Volume 31	(0)	2005
	Mark-Jan Nederhof, Giorgio Satta. Probabilistic Parsing Strategies.	ACL 2004	(0)	2004
	Mark-Jan Nederhof, Giorgio Satta. An Alternative Method of Training Probabilistic LR Parsers.	ACL 2004	(0)	2004
	Mark-Jan Nederhof, Giorgio Satta. Tabular Parsing	CoRR 2004, Volume 0	(0)	2004
	Mark-Jan Nederhof, Giorgio Satta. The language intersection problem for non-recursive context-free grammars.	Inf. Comput. 2004, Volume 192	(0)	2004
	Eberhard Bertsch, Mark-Jan Nederhof. Fast parallel recognition of LR language suffixes.	Inf. Process. Lett. 2004, Volume 92	(0)	2004
	Mark-Jan Nederhof, Giorgio Satta. IDL-Expressions: A Formalism for Representing and Parsing Finite Languages in Natural Language Processing.	J. Artif. Intell. Res. (JAIR) 2004, Volume 21	(0)	2004
	Mark-Jan Nederhof. Weighted Deductive Parsing and Knuth's Algorithm.	Computational Linguistics 2003, Volume 29	(0)	2003
	Mark-Jan Nederhof, Giorgio Satta. Parsing non-recursive CFGs.	ACL 2002	(0)	2002
	Mark-Jan Nederhof, Giorgio Satta. Probabilistic Parsing Strategies	CoRR 2002, Volume 0	(0)	2002
	Eberhard Bertsch, Mark-Jan Nederhof. On the Complexity of Some Extensions of RCG Parsing.	Proceedings of the Seventh International Workshop on Parsing Technologies (IWPT-2001), 17-19 October 2001, Beijing, China 2001	(0)	2001
	Eberhard Bertsch, Mark-Jan Nederhof. Size/lookahead tradeoff for LL(k)-grammars.	Inf. Process. Lett. 2001, Volume 80	(0)	2001
	Mark-Jan Nederhof, Giorgio Satta. Left-To-Right Parsing and Bilexical Context-Free Grammars.	ANLP 2000	(0)	2000
	Mark-Jan Nederhof. Preprocessing for Unification Parsing of Spoken Language.	Natural Language Processing - NLP 2000, Second International Conference, Patras, Greece, June 2-4, 2000, Proceedings 2000	(0)	2000
	Mark-Jan Nederhof. Practical Experiments with Regular Approximation of Context-free Languages.	Computational Linguistics 2000, Volume 26	(0)	2000
	Miguel A. Alonso, Mark-Jan Nederhof, Eric Villemonte de la Clergerie. Tabulation of Automata for Tree-Adjoining Languages.	Grammars 2000, Volume 3	(0)	2000
	Mark-Jan Nederhof. The Computational Complexity of the Correct-Prefix Property for TAGs.	Computational Linguistics 1999, Volume 25	(0)	1999
	Gertjan van Noord, Gosse Bouma, Rob Koeling, Mark-Jan Nederhof. Robust Grammatical Analysis for Spoken Dialogue Systems	CoRR 1999, Volume 0	(0)	1999
	Mark-Jan Nederhof. Practical experiments with regular approximation of context-free languages	CoRR 1999, Volume 0	(0)	1999
	Eberhard Bertsch, Mark-Jan Nederhof. Regular Closure of Deterministic Languages.	SIAM J. Comput. 2000, Volume 29	(0)	1999

Your query returned 43 matches in the database.