Abstract
We discuss the question of how phenomena of type coercion (TC) can be integrated into Natural Language Generation (NLG). The ultimate goal is the generation of expressions that instantiate type coercion in cases where such expressions are the most natural verbalization for a given piece of information. Our approach is an extension of the SPUD NLG system developed by Matthew Stone. This system is well-suited for our approach because it allows the easy formulation of syntaxsemantics interface constraints (in the form of semantically annotated fragments of TAG syntax trees). These interface constraints are indispensable to avoid overgeneration of TC expressions. TC is integrated in the NLG system in that we formalize TC operators that provide additional options of generating expressions with a well-formed syntactic structure (to verbalize a given semantic input). TC operators are also represented by tree fragments and are subject to conditions on linguistic and other context features.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
