Index Browse   Bibliographies My selection

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

Publications list: <<   <       >   >>   Showing 2041 - 2070 (3003 total)

2041 Tobias Müller and Jörg Würtz. Interfacing Propagators with a Concurrent Constraint Language. In Joint International Conference and Symposium on Logic Programming (JICSLP '96). Post-Conference Workshop and Compulog Net Meeting on Parallelism and Implementation Technology for (Constraint) Logic Programming Languages, September 5-6, Pages 195-206, Bonn, Germany, 1996. [Abstract]     google [Annote] 2042 Tobias Müller and Jörg Würtz. Extending a Concurrent Constraint Language by Propagators. In J. Maluszynski editor, International Logic Programming Symposium (ILPS '97), October 12-17, Pages 149-163, MIT Press, Port Jefferson, Long Island N.Y., USA, 1997. [Abstract]     google [Annote] 2043 Tobias Müller and Jörg Würtz. Embedding Propagators in a Concurrent Constraint Language. In The Journal of Functional and Logic Programming, Nr. (Special Issue 1), 1999. [Abstract]     google Note: Published on the Internet: http://mitpress.mit.edu/JFLP/, ISSN 1080--5230, MIT Press Journals, Five Cambridge Center, Cambridge, USA. [Annote] 2044 Sonja Müller-Landmann. Corpus-Based Parse Pruning - Applying Empirical Data to Symbolic Knowledge. PhD thesis, Universität des Saarlandes, Department of Computational Linguistics, Saarbrücken, 2000.     google 2045 Reinhard Muskens. Combining Montague Semantics and Discourse Representation. In Linguistics and Philosophy, Vol. 19:143-186, 1996.     google 2046 Reinhard Muskens. Program Semantics and Classical Logic. Technical report, CLAUS-Report 86, Universität des Saarlandes, Saarbrücken, January 1997. [Abstract]     google [Annote] 2047 Reinhard Muskens. Underspecified Semantics. In U. Egli and K. Heusinger editors, Reference and Anaphoric Relations, Vol. 72:311--338 of Studies in Linguistics and Philosophy, Kluwer Academic Publishers, Dordrecht, 1999.     google 2048 Reinhard Muskens, Johan F. Van Benthem and Alber Visser. Dynamics. In Johan F. Van Benthem and A. Ter Meulen editors, Handbook of Logic and Language, Pages 587-648, Elsevier, Amsterdam, 1996.     google 2049 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 2050 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] 2051 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] 2052 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] 2053 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] 2054 Mark-Jan Nederhof. The Computational Complexity of the Correct-Prefix Property for TAGs. In Computational Linguistics, Vol. 25(3):345-360, 1999.     google [Annote] 2055 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] 2056 Mark-Jan Nederhof. Practical Experiments with Regular Approximation of Context-Free Languages. In Computational Linguistics, Vol. 26(1):17-44, 2000.     google [Annote] 2057 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] 2058 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] 2059 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] 2060 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] 2061 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] 2062 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] 2063 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] 2064 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] 2065 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] 2066 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] 2067 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] 2068 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] 2069 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] 2070 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]

Last modified: Thu October 16 2014 17:22:21