Index Browse   Bibliographies My selection

Search: in All Authors Titles Conferences Journals Keywords Comments   (word length ≥ 3)       Login

References of Mark-Jan Nederhof   Order by:   Type | Year

<< Article (Journal) >>

1 Miguel Alonso Pardo, Mark-Jan Nederhof and Eric Villemonte de la Clergerie. Tabulation of Automata for Tree-Adjoining Languages. In Grammars, Vol. 3:89-110, 2000. [Abstract]     google [Annote] 2 Eberhard Bertsch and Mark-Jan Nederhof. On Failure of the Pruning Technique in Error Repair in Shift-Reduce Parsers. In ACM Transactions on Programming Languages and Systems (TOPLAS), Vol. 21(1):1-10, 1999. [Abstract]     google [Annote] 3 Eberhard Bertsch and Mark-Jan Nederhof. Regular Closure of Deterministic Languages. In SIAM Journal on Computing, Vol. 29(1):81-102, 1999. [Abstract]     google [Annote] 4 Eberhard Bertsch and Mark-Jan Nederhof. Size/ Lookahead Tradeoff for LL(k)-Grammars. In Information Processing Letters, Vol. 80:125-129, 2001. [Abstract]     google [Annote] 5 Mark-Jan Nederhof. The Computational Complexity of the Correct-Prefix Property for TAGs. In Computational Linguistics, Vol. 25(3):345-360, 1999.     google [Annote] 6 Mark-Jan Nederhof. Practical Experiments with Regular Approximation of Context-Free Languages. In Computational Linguistics, Vol. 26(1):17-44, 2000.     google [Annote] 7 Gertjan van Noord, Gosse Bouma, Rob Koeling and Mark-Jan Nederhof. Robust Grammatical Analysis for Spoken Dialogue Systems. In Natural Language Engineering, Vol. 5(1):45-93, 1999. [Abstract]     google

<< InProceedings >>

8 Eberhard Bertsch and Mark-Jan Nederhof. On the Complexity of some Extensions of RCG Parsing. In Proceedings of the 7th International Workshop on Parsing Technologies (IWPT'01), October 17-19, Pages 66-77, Beijing, China, 2001. [Abstract]     google [Annote] 9 Mark-Jan Nederhof. Regular Approximations of CFLs: A Grammatical View. In International Workshop on Parsing Technologies (IWPT '97), September 17-20, Boston, USA, 1997.     google 10 Mark-Jan Nederhof. An Alternative LR Algorithm for TAGs. In ACL editor, 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING-ACL '98), August 10-14, Vol. 2:946-952, Morgan Kaufmann Publishers, Montréal, Québec, Canada, 1998.     google [Annote] 11 Mark-Jan Nederhof. Linear Indexed Automata and Tabulation of TAG Parsing. In Premières Journées sur la Tabulation en Analyse Syntaxique et Déduction/ 1st Workshop on Tabulation in Parsing and Deduction (TAPD '98), April 2-3, Pages 1-9, Paris, France, 1998.     google [Annote] 12 Mark-Jan Nederhof. Context-Free Parsing Through Regular Approximation. In 1st International Workshop on Finite State Methods in Natural Language Processing (FSMNLP '98), June 29 - July 1, Pages 13-24, Bilkent University, Ankara, Turkey, 1998.     google [Annote] 13 Mark-Jan Nederhof. Models of Tabulation for TAG Parsing. In Proceedings of the 6th Meeting on Mathematics of Language (MOL6), July 23-25, Pages 143-158, Orlando, Florida, USA, 1999.     google [Annote] 14 Mark-Jan Nederhof. Preprocessing for Unification Parsing of Spoken Language. In Dimitris Christodoulakis editor, Proceedings of the Natural Language Processing - NLP 2000, June 2-4, (1835):118-129, Springer, Patras, Greece, 2000.     google [Annote] 15 Mark-Jan Nederhof. Preprocessing for Unification Parsing of Spoken Language. In Dimitris Christodoulakis editor, Proceedings of the Natural Language Processing - NLP 2000, June 2-4, (1835):118-129, Springer, Patras, Greece, 2000. [Abstract]     google [Annote] 16 Mark-Jan Nederhof. Approximating Context-Free by Rational Transduction for Example-Based MT. In Proceedings of the 39th Annual Meeting and 10th Conference of the European Chapter, Workshop proceedings: Data-Driven Machine Translation, July 5-11, Pages 25-32, Morgan Kaufmann Publishers, Toulouse, France, 2001. [Abstract]     google [Annote] 17 Mark-Jan Nederhof. Approximating Context-Free by Rational Transduction for Example-Based MT. In ACL editor, Proceedings of the 39th Annual Meeting and 10th Conference of the European Chapter, Workshop proceedings: Data-Driven Machine Translation, July 5-11, Pages 25-32, Morgan Kaufmann Publishers, Toulouse, France, 2001.     google [Annote] 18 Mark-Jan Nederhof, Anoop Sarkar and Giorgio Satta. Prefix Probabilities for Linear Indexed Grammars. In 4th International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), August 1-3, (98-12):116-119, University of Pennsylvania, Philadelphia, USA, 1998.     google [Annote] 19 Mark-Jan Nederhof and Giorgio Satta. Left-To-Right Parsing and Bilexical Context-Free Grammars. In Sergei Nirenburg, Douglas Appelt, Fabio Ciravegna and Robert Dale editors, Proceedings of the 6th Applied Natural Language Processing Conference and 1st Meeting of the North American Chapter of the Association for Computational Linguistics (ANLP-NAACL '00), April 29 - May 3, Pages 272-279, Seattle, Washington, USA, 2000.     google [Annote] 20 Mark-Jan Nederhof, Anoop Sarkar and Giorgio Satta. Prefix Probabilities from Stochastic Tree Adjoining Grammar. In ACL editor, Proceedings of the 17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association on Computational Linguistics (COLING-ACL '98), August 10-14, Vol. 2:953-959, Morgan Kaufmann Publishers, Montréal, Québec, Canada, 1998.     google [Annote] 21 Mark-Jan Nederhof, Anoop Sarkar and Giorgio Satta. Prefix Probabilities for Linear Indexed Grammars. In Proceedings of the 4th International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), August 1-3, (98-12):116-119, University of Pennsylvania, Philadelphia, USA, 1998. [Abstract]     google [Annote] 22 Mark-Jan Nederhof and Giorgio Satta. A Variant of Earley Parsing. In Maurizio Lenzerini editor, Advances in Artificial Intelligence. 5th Conference of the Italian Association for Artificial Intelligence (AI*IA 97), September 17-19, (1321):84-95, Springer Verlag, Rome, Italy, 1997.     google [Annote] 23 Mark-Jan Nederhof and Giorgio Satta. Left-To-Right Parsing and Bilexical Context-Free Grammars. In Sergei Nirenburg, Douglas Appelt, Fabio Ciravegna and Robert Dale editors, Proceedings of the 6th Applied Natural Language Processing Conference and 1st Meeting of the North American Chapter of the Association for Computational Linguistics (ANLP-NAACL'00), April 29 - May 3, Pages 272-279, Seattle, Washington, USA, 2000. [Abstract]     google [Annote] 24 Mark-Jan Nederhof and Giorgio Satta. Parsing Non-Recursive Context-Free Grammars. In Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL ANNUAL'02), July 7-12, Pages 112-119, Philadelphia, Pennsylvania, USA, 2002. [Abstract]     google [Annote]

<< InCollection >>

25 Bernd Kiefer, Hans-Ulrich Krieger and Mark-Jan Nederhof. Efficient and Robust Parsing of Word Hypotheses Graphs. In Wolfgang Wahlster editor, Verbmobil: Foundations of Speech-to-Speech Translation, Pages 280-295, Springer, Berlin, 2000. [Abstract]     google 26 Mehryar Mohri and Mark-Jan Nederhof. Regular Approximation of Context-Free Grammars through Transformation. In Jean-Claude Junqua and Gertjan van Noord editors, Robustness in Language and Speech Technology, Pages 153--163, Kluwer Academic Publishers, Dordrecht, 2001. [Abstract]     google [Annote] 27 Mark-Jan Nederhof. Efficient Generation of Random Sentences. In An Encyclopedia of Computer Science and Technology, Vol. 41:45-65, Marcel Dekker Verlag, 1999.     google [Annote] 28 Mark-Jan Nederhof. Regular Approximation of CFLs: A Grammatical View. In Harry Bunt and Anton Nijholt editors, Advances in Probabilistic and other Parsing Technologies, Pages 221-241, Kluwer Academic Publishers, 2000. [Abstract]     google [Annote] 29 Mark-Jan Nederhof. Regular Approximation of CFLs: A Grammatical View. In Harry Bunt and Anton Nijholt editors, Advances in Probabilistic and other Parsing Technologies, Pages 221-241, Kluwer Academic Publishers, 2000.     google [Annote] 30 Mark-Jan Nederhof and Eberhard Bertsch. An Innovative Finite State Concept for Recognition and Parsing of Context-Free Languages. In A. Kornai editor, Extended Finite State Models of Language, Pages 226-243, Cambridge University Press, Stanford, 1999.     google [Annote]

Last modified: Thu October 16 2014 19:11:34