DFKI-LT - Publications

2003
 
Mark-Jan Nederhof, Giorgio Satta
Probabilistic parsing as intersection
8th International Workshop on Parsing Technologies, Pages 137-148, LORIA, Nancy, France, 2003
 
Mark-Jan Nederhof
Weighted deductive parsing and Knuth's algorithm
Computational Linguistics volume 29 number 1, Pages 135-143, 2003
 
Mark-Jan Nederhof, Giorgio Satta, Stuart M. Shieber
Partially ordered multiset context-free grammars and free-word-order parsing
Proceedings of the 8th International Workshop on Parsing Technologies (IWPT'03), April 23-25, Pages 171-182, Nancy, France, 2003
 
2002
 
Mark-Jan Nederhof
A Revised Encoding Scheme for Hieroglyphic
Proceedings of the 14th Table Ronde Informatique et Égyptologie, Pisa, Italy, o.A., 2002
 
Mark-Jan Nederhof, Giorgio Satta
Parsing Non-Recursive Context-Free Grammars
40th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, Pages 112-119, Philadelphia, Pennsylvania, USA, o.A., 2002
 
Mark-Jan Nederhof, Giorgio Satta
Probabilistic parsing strategies
in: Jürgen Dassow, Maia Hoeberechts, Helmut Jürgensen, Detlef Wotschke (eds.):
Proceedings of the 4th Workshop on Descriptional Complexity of Formal Systems (DCFS 2002), August 21 - 24, Pages 216-230, London, Canada, o.A., 2002
 
Mark-Jan Nederhof, Giorgio Satta
IDL-Expressions: A Compact Representation for Finite Languages in Generation Systems
in: Gerhard Jäger, Paola Monachesi, Gerald Penn, Shuly Wintner (eds.):
Proceedings of the 7th Conference on Formal Grammars (FG2002), Pages 125-136, Trento, Italy, o.A., 2002
 
Mark-Jan Nederhof
Alignment of resources on Egyptian texts based on XML
Proceedings of the 14th Table Ronde Informatique et Égyptologie, Pisa, Italy, o.A., 2002
 
2001
 
Mehryar Mohri, Mark-Jan Nederhof
Regular Approximation of Context-Free Grammars through Transformation
in: Jean-Claude Junqua, Gertjan van Noord (eds.):
Robustness in Language and Speech Technology, Pages 153-163, Kluwer Academic Publishers, Dordrecht, 2001
 
Mark-Jan Nederhof
Approximating Context-Free by Rational Transduction for Example-Based MT
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, Toulouse, France, Morgan Kaufmann Publishers, 2001
 
Eberhard Bertsch, Mark-Jan Nederhof
Size/ Lookahead Tradeoff for LL(k)-Grammars
Information Processing Letters volume 80, Pages 125-129, 2001
 
Eberhard Bertsch, Mark-Jan Nederhof
On the Complexity of some Extensions of RCG Parsing
Proceedings of the 7th International Workshop on Parsing Technologies (IWPT'01), October 17-19, Pages 66-77, Beijing, China, o.A., 2001
 
2000
 
Miguel Alonso Pardo, Mark-Jan Nederhof, Eric Villemonte de la Clergerie
Tabulation of Automata for Tree-Adjoining Languages
Grammars volume 3, Pages 89-110, 2000
 
Bernd Kiefer, Hans-Ulrich Krieger, Mark-Jan Nederhof
Efficient and Robust Parsing of Word Hypotheses Graphs
Verbmobil: Foundations of Speech-to-Speech Translation, Pages 280-295, Springer, Berlin, 2000
 
Mark-Jan Nederhof, Giorgio Satta
Left-To-Right Parsing and Bilexical Context-Free Grammars
in: Sergei Nirenburg, Douglas Appelt, Fabio Ciravegna, Robert Dale (eds.):
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, o.A., 2000
 
Mark-Jan Nederhof
Practical Experiments with Regular Approximation of Context-Free Languages
Computational Linguistics volume 26 number 1, Pages 17-44, 2000
 
Mark-Jan Nederhof
Regular Approximation of CFLs: A Grammatical View
in: Harry Bunt, Anton Nijholt (eds.):
Advances in Probabilistic and other Parsing Technologies, Pages 221-241, Kluwer Academic Publishers, 2000
 
Mark-Jan Nederhof
Preprocessing for Unification Parsing of Spoken Language
in: Dimitris Christodoulakis (ed.):
Proceedings of the Natural Language Processing - NLP 2000, June 2-4,
Lecture Notes in Artificial Intelligence number 1835, Pages 118-129, Patras, Greece, Springer, 2000
 
1999
 
Eberhard Bertsch, Mark-Jan Nederhof
Regular Closure of Deterministic Languages
SIAM Journal on Computing volume 29 number 1, Pages 81-102, 1999
 
Mark-Jan Nederhof, Eberhard Bertsch
An Innovative Finite State Concept for Recognition and Parsing of Context-Free Languages
in: A. Kornai (ed.):
Extended Finite State Models of Language, Pages 226-243, Cambridge University Press, Stanford, 1999
 
Mark-Jan Nederhof
Models of Tabulation for TAG Parsing
Proceedings of the 6th Meeting on Mathematics of Language (MOL6), July 23-25, Pages 143-158, Orlando, Florida, USA, o.A., 1999
 
Eberhard Bertsch, Mark-Jan Nederhof
On Failure of the Pruning Technique in "Error Repair in Shift-Reduce Parsers"
ACM Transactions on Programming Languages and Systems (TOPLAS) volume 21 number 1, Pages 1-10, 1999
 
Gertjan van Noord, Gosse Bouma, Rob Koeling, Mark-Jan Nederhof
Robust Grammatical Analysis for Spoken Dialogue Systems
Natural Language Engineering volume 5 number 1, Pages 45-93, 1999
 
Mark-Jan Nederhof
Efficient Generation of Random Sentences
An Encyclopedia of Computer Science and Technology volume 41, Pages 45-65, Marcel Dekker Verlag, 1999
 
Mark-Jan Nederhof
The Computational Complexity of the Correct-Prefix Property for TAGs
Computational Linguistics volume 25 number 3, Pages 345-360, 1999
 
1998
 
Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
Prefix Probabilities for Linear Indexed Grammars
Proceedings of the 4th International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), August 1-3,
IRCS Report number 98-12, Pages 116-119, University of Pennsylvania, Philadelphia, PA, USA, o.A., 1998
 
Mark-Jan Nederhof
An Alternative LR Algorithm for TAGs
17th International Conference on Computational Linguistics and 36th Annual Meeting of the Association for Computational Linguistics (COLING-ACL '98), August 10-14 volume 2, Pages 946-952, Montréal, QC, Canada, Morgan Kaufmann Publishers, 1998
 
Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
Prefix Probabilities for Linear Indexed Grammars
4th International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), August 1-3,
IRCS Report number 98-12, Pages 116-119, University of Pennsylvania, Philadelphia, PA, USA, o.A., 1998
 
Mark-Jan Nederhof
Context-Free Parsing Through Regular Approximation
1st International Workshop on Finite State Methods in Natural Language Processing (FSMNLP '98), June 29 - July 1, Pages 13-24, Bilkent University, Ankara, Turkey, o.A., 1998
 
Mark-Jan Nederhof
Linear Indexed Automata and Tabulation of TAG Parsing
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, o.A., 1998
 
Mark-Jan Nederhof, Anoop Sarkar, Giorgio Satta
Prefix Probabilities from Stochastic Tree Adjoining Grammar
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 volume 2, Pages 953-959, Montréal, Québec, QC, Canada, Morgan Kaufmann Publishers, 1998
 
1997
 
Mark-Jan Nederhof
Regular Approximations of CFLs: A Grammatical View
International Workshop on Parsing Technologies (IWPT '97), September 17-20, Boston, USA, o.A., 1997
 
Mark-Jan Nederhof, Giorgio Satta
A Variant of Earley Parsing
in: Maurizio Lenzerini (ed.):
Advances in Artificial Intelligence. 5th Conference of the Italian Association for Artificial Intelligence (AI*IA 97), September 17-19,
Lecture Notes in Artificial Intelligence number 1321, Pages 84-95, Rome, Italy, Springer Verlag, 1997