Generation as Dependency Parsing

Alexander Koller,Kristina Striegnitz

Published 2002 in Annual Meeting of the Association for Computational Linguistics

ABSTRACT

Natural-Language Generation from flat semantics is an NP-complete problem. This makes it necessary to develop algorithms that run with reasonable efficiency in practice despite the high worst-case complexity. We show how to convert TAG generation problems into dependency parsing problems, which is useful because optimizations in recent dependency parsers based on constraint programming tackle exactly the combinatorics that make generation hard. Indeed, initial experiments display promising runtimes.

PUBLICATION RECORD

  • Publication year

    2002

  • Venue

    Annual Meeting of the Association for Computational Linguistics

  • Publication date

    2002-07-06

  • Fields of study

    Computer Science

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

CITED BY

Showing 1-77 of 77 citing papers · Page 1 of 1