Back to home page
The Grammar Workbench: A first step towards lingware engineering, Linguistic Engineering: Tools and Products (Second Twente Workshop on Language Technology), Twente, The Netherlands, April, 1992.
Coping with ambiguity in decorated parse forests, Coping with Linguistic Ambiguity in Typed Feature Formalisms (Workshop held at ECAI 92), Vienna, Austria, August, 1992.
Generalized left-corner parsing, Sixth Conference of the European Chapter of the ACL, Utrecht, The Netherlands, April, 1993.
Increasing the applicability of LR parsing, Third International Workshop on Parsing Technologies, Tilburg, The Netherlands, August, 1993.
A new top-down parsing algorithm for left-recursive DCGs, Programming Language Implementation and Logic Programming, 5th International Symposium, Tallinn, Estonia, August, 1993.
A multidisciplinary approach to a parsing algorithm, Natural Language Parsing: Methods and Formalisms (Sixth Twente Workshop on Language Technology), Twente, The Netherlands, December, 1993.
An optimal tabular parsing algorithm, 32nd Annual Meeting of the ACL, Las Cruces, New Mexico, USA, June, 1994.
An extended theory of head-driven parsing, 32nd Annual Meeting of the ACL, Las Cruces, New Mexico, USA, June, 1994.
Efficient non-correcting error recovery for deterministic languages, ASMICS workshop on Parsing Theory, Milan, Italy, October, 1994.
Reversible pushdown automata and bidirectional parsing, Developments in Language Theory II, Magdeburg, Germany, July 17-21, 1995.
On the borderline between finite and infinite argument domains, First AGFL Workshop, Nijmegen, The Netherlands, October 2-3, 1995.
Complexity and closure results for deterministic context-free languages, Fourth Meeting on Mathematics of Language, Philadelphia, PA, USA, October 26-28, 1995.
Efficient tabular LR parsing, 34th Annual Meeting of the ACL, Santa Cruz, California, USA, June 24-27, 1996.
Introduction to finite-state techniques, Master class: Finite-State Techniques in NLP, Groningen, The Netherlands, July 8-12, 1996.
An innovative finite-state concept for recognition and parsing of context-free languages, Extended Finite State Models of Language (Workshop at ECAI'96), Budapest, Hungary, August 11-12, 1996.
Solving the correct-prefix property for TAGs. Fifth Meeting on Mathematics of Language, Dagstuhl, Germany, August 25-27, 1997.
Regular approximations of CFLs: A grammatical view. International Workshop on Parsing Technologies, Boston, Massachusetts, USA, September 17-20, 1997.
Solving the correct-prefix property for TAGs. Institute for Research in Cognitive Science (University of Pennsylvania), Philadelphia, PA, USA, October 8, 1997.
Regular approximations of CFLs: A grammatical view. Institute for Research in Cognitive Science (University of Pennsylvania), Philadelphia, PA, USA, October 15, 1997.
Regular approximations of CFLs: A grammatical view. Deutsches Forschungszentrum für Künstliche Intelligenz, Saarbrücken, Germany, November 26, 1997.
Linear indexed automata and tabulation of TAG parsing. First workshop on Tabulation in Parsing and Deduction, Paris, France, April 2-3, 1998.
Context-free parsing through regular approximation. International Workshop on Finite State Methods in Natural Language Processing, Ankara, Turkey, June 30 - July 1, 1998.
Context-free parsing through regular approximation. Centrum für Informations- und Sprachverarbeitung, Universität München, Germany, July 17, 1998.
An alternative LR algorithm for TAGs. 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Montreal, Quebec, Canada, August 10-14, 1998.
Prefix probabilities from stochastic tree adjoining grammar. 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Montreal, Quebec, Canada, August 10-14, 1998.
Models of tabulation for TAG parsing. Sixth Meeting on Mathematics of Language, Orlando, Florida USA, July 23-25, 1999.
Left-to-right parsing and bilexical context-free grammars. 1st Meeting of the North American Chapter of the Association for Computational Linguistics, Seattle, Washington, USA, April 29 - May 4, 2000.
Preprocessing for unification parsing of spoken language. Natural Language Processing - NLP 2000, Patras, Greece, June 2-4, 2000.
Regular approximation of algebraic transductions. Ecole Polytechnique Federale de Lausanne, Switzerland, September 15, 2000.
Approximating context-free by rational transduction for example-based MT. 39th Annual Meeting and 10th Conference of the European Chapter of the ACL, Workshop: Data-driven Machine Translation, July 7, 2001.
On the complexity of some extensions of RCG parsing. Seventh International Workshop on Parsing Technologies, Beijing, China, October 17-19, 2001.
Egyptian writing and its encoding. Faculty of Arts, University of Groningen, The Netherlands, July 1, 2002.
Alignment of resources on Egyptian texts based on XML. XIV Computer-aided Egyptology Round Table, Pisa, Italy, July 8-10, 2002.
A revised encoding scheme for hieroglyphic. XIV Computer-aided Egyptology Round Table, Pisa, Italy, July 8-10, 2002.
Probabilistic parsing strategies. Descriptional Complexity of Formal Systems (DCFS), London, Canada, August 21-24, 2002.
Probabilistic parsing as intersection. 8th International Workshop on Parsing Technologies, Nancy, France, April 23-25, 2003.
Partially ordered multiset context-free grammars and free-word-order parsing. 8th International Workshop on Parsing Technologies, Nancy, France, April 23-25, 2003.
Probabilistic parsing strategies. University of Edinburgh, May 9, 2003.
An alternative method of training probabilistic LR parsers. 42nd Annual Meeting of the ACL, Barcelona, Spain, July 21-26, 2004.
Egyptological language resources and interlinear representation. Informatique et Egyptologie, Oxford, UK, August 8, 2006.
Computation of the partition function of probabilistic context-free grammars. School of Informatics, University of Edinburgh, UK, November 16, 2007.
Automatic alignment of hieroglyphic and transliteration. IAE Computer Group Meeting. Vienna, Austria, July 9, 2008.
Egyptological resources and interlinear text. Max-Planck Institute, Nijmegen, September 7, 2009.
Reusable electronic representations of philological resources. University of Oxford, School of Archaeology, October 11, 2009.
A framework for automatic creation of interlinear text. Oxford University Computing Laboratory, June 17, 2010.
Equations for weighted grammars. Weighted Automata: Theory and Applications (WATA 2010), Leipzig, Germany, May 3 - 7, 2010.
The power of intersection. Finite-State Methods and Natural Language Processing (FSMNLP 2011), Blois, France, July 12 - 16, 2011.
Transformation of LMF lexicon structures. Workshop on Finite-state Methods in Language Resources and Historical-comparative Linguistics, Düsseldorf, Germany, April 19, 2012.
Using automata to compute prefix and infix probabilities. ENS Cachan, Paris, France, June 12, 2012
Input and output restrictions of weighted synchronous grammars. Alpage (INRIA / Université Paris 7), France, June 22, 2012