{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T01:26:45Z","timestamp":1777771605795,"version":"3.51.4"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2003,11,25]],"date-time":"2003-11-25T00:00:00Z","timestamp":1069718400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat. Lang. Eng."],"published-print":{"date-parts":[[2003,12]]},"abstract":"<jats:p>We present an <jats:italic>Augmented Template-Based<\/jats:italic> approach to text realization that addresses the \nrequirements of real-time, interactive systems such as a dialog system or an intelligent tutoring \nsystem. Template-based approaches are easier to implement and use than traditional approaches to \ntext realization. They can also generate texts more quickly. However traditional template-based \napproaches with rigid templates are inflexible and difficult to reuse. Our approach \n<jats:italic>augments<\/jats:italic> traditional template-based approaches by adding several types of declarative \ncontrol expressions and an attribute grammar-based mechanism for processing missing or \ninconsistent slot fillers. Therefore, augmented templates can be made more general than \ntraditional ones, yielding templates that are more flexible and reusable across applications.<\/jats:p>","DOI":"10.1017\/s1351324903003188","type":"journal-article","created":{"date-parts":[[2003,12,17]],"date-time":"2003-12-17T12:01:38Z","timestamp":1071662498000},"page":"381-420","source":"Crossref","is-referenced-by-count":25,"title":["An augmented template-based approach to text realization"],"prefix":"10.1017","volume":"9","author":[{"given":"SUSAN W.","family":"MCROY","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SONGSAK","family":"CHANNARUKUL","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"SYED S.","family":"ALI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2003,11,25]]},"container-title":["Natural Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1351324903003188","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T22:04:51Z","timestamp":1557180291000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1351324903003188\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,11,25]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S1351324903003188"],"URL":"https:\/\/doi.org\/10.1017\/s1351324903003188","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,11,25]]}}}