@InProceedings{Nederhof_Satta:2002,
      AUTHOR = {Nederhof, Mark-Jan and Satta, Giorgio},
      TITLE = {Parsing Non-Recursive Context-Free Grammars},
      YEAR = {2002},
      BOOKTITLE = {Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL ANNUAL'02), July 7-12},
      PAGES = {112-119},
      ADDRESS = {Philadelphia, Pennsylvania, USA},
      URL = {http://www.dfki.de/dfkibib/publications/docs/nederhof02d.ps},
      ABSTRACT = {We consider the problem of parsing nonrecursive contextfree grammars, i.e., contextfree grammars that generate finite languages. In natural language processing, this problem arises in several areas of application, including natural language generation, speech recognition and machine translation. We present two tabular algorithms for parsing of nonrecursive contextfree grammars, and show that they perform well in practical settings, despite the fact that this problem is PSPACE complete.},
      ANNOTE = {COLIURL : Nederhof:2002:PNR.pdf Nederhof:2002:PNR.ps}
}