%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:42:29 +0100 GMT
%    
% Selection : Author: Giorgio_Satta
%




@InProceedings{Nederhof_et_al:1998,
      AUTHOR = {Nederhof, Mark-Jan and Sarkar, Anoop and Satta, Giorgio},
      TITLE = {Prefix Probabilities for Linear Indexed Grammars},
      YEAR = {1998},
      BOOKTITLE = {4th International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), August 1-3},
      NUMBER = {98-12},
      PAGES = {116-119},
      SERIES = {IRCS Report},
      ADDRESS = {University of Pennsylvania, Philadelphia, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98d.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98d.entry},
      ANNOTE = {COLIURL : Nederhof:1998:PPL.pdf Nederhof:1998:PPL.ps}
}

@InProceedings{Nederhof_Satta:2000,
      AUTHOR = {Nederhof, Mark-Jan and Satta, Giorgio},
      TITLE = {Left-To-Right Parsing and Bilexical Context-Free Grammars},
      YEAR = {2000},
      BOOKTITLE = {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},
      EDITOR = {Nirenburg, Sergei and Appelt, Douglas and Ciravegna, Fabio and Dale, Robert},
      ADDRESS = {Seattle, Washington, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof-satta00.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof-satta00.entry},
      ANNOTE = {COLIURL : Nederhof:2000:LRP.pdf Nederhof:2000:LRP.ps}
}

@InProceedings{Nederhof_et_al:1998_1,
      AUTHOR = {Nederhof, Mark-Jan and Sarkar, Anoop and Satta, Giorgio},
      TITLE = {Prefix Probabilities from Stochastic Tree Adjoining Grammar},
      YEAR = {1998},
      BOOKTITLE = {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},
      EDITOR = {ACL},
      ADDRESS = {Montréal, Québec, Canada},
      PUBLISHER = {Morgan Kaufmann Publishers},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98c.ps.gz ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98c.entry},
      ANNOTE = {COLIURL : Nederhof:1998:PPS.pdf Nederhof:1998:PPS.ps}
}

@InProceedings{Nederhof_et_al:1998_2,
      AUTHOR = {Nederhof, Mark-Jan and Sarkar, Anoop and Satta, Giorgio},
      TITLE = {Prefix Probabilities for Linear Indexed Grammars},
      YEAR = {1998},
      BOOKTITLE = {Proceedings of the 4th International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), August 1-3},
      NUMBER = {98-12},
      PAGES = {116-119},
      SERIES = {IRCS Report},
      ADDRESS = {University of Pennsylvania, Philadelphia, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof98d.ps.gz},
      ABSTRACT = {We show how prefix probabilities can be computed for stochastic linear indexed grammars (SLIGs). Our results apply as well to stochastic tree-adjoining grammars (STAGs), due to their equivalence to SLIGs.},
      ANNOTE = {COLIURL : Nederhof:1998:PPLb.pdf Nederhof:1998:PPLb.ps}
}

@InProceedings{Nederhof_Satta:1997,
      AUTHOR = {Nederhof, Mark-Jan and Satta, Giorgio},
      TITLE = {A Variant of Earley Parsing},
      YEAR = {1997},
      BOOKTITLE = {Advances in Artificial Intelligence. 5th Conference of the Italian Association for Artificial Intelligence (AI*IA 97), September 17-19},
      NUMBER = {1321},
      PAGES = {84-95},
      EDITOR = {Lenzerini, Maurizio},
      SERIES = {Lecture Notes in Artificial Intelligence},
      ADDRESS = {Rome, Italy},
      PUBLISHER = {Springer Verlag},
      URL = {http://lanl.arxiv.org/PS_cache/cmp-lg/pdf/9808/9808017.pdf},
      ANNOTE = {COLIURL : Nederhof:1997:VEP.pdf}
}

@InProceedings{Nederhof_Satta:2000_1,
      AUTHOR = {Nederhof, Mark-Jan and Satta, Giorgio},
      TITLE = {Left-To-Right Parsing and Bilexical Context-Free Grammars},
      YEAR = {2000},
      BOOKTITLE = {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},
      EDITOR = {Nirenburg, Sergei and Appelt, Douglas and Ciravegna, Fabio and Dale, Robert},
      ADDRESS = {Seattle, Washington, USA},
      URL = {ftp://lt-ftp.dfki.uni-sb.de/pub/papers/local/nederhof-satta00.ps.gz},
      ABSTRACT = {We compare the asymptotic time complexity of left-to-right and bidirectional parsing techniques for bilexical context-free grammars, a grammar formalism that is an abstraction of language models used in several state-of-the-art real-world parsers. We provide evidence that left-to-right parsing cannot be realised within acceptable time-bounds if the so called correct-prefix property is to be ensured. Our evidence is based on complexity results for the representation of regular languages.},
      ANNOTE = {COLIURL : Nederhof:2000:LRPb.pdf Nederhof:2000:LRPb.ps}
}

@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}
}

@InProceedings{KuKoSa2010,
      AUTHOR = {Kuhlmann, Marco and Koller, Alexander and Satta, Giorgio},
      TITLE = {The importance of rule restrictions in CCG.},
      YEAR = {2010},
      BOOKTITLE = {Proceedings of the 48th ACL, Uppsala},
      NOTE = {AK}
}