{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T19:35:05Z","timestamp":1694633705235},"reference-count":14,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"unspecified","delay-in-days":4760,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat. Lang. Eng."],"published-print":{"date-parts":[[1995,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Artificial languages for person-machine communication seldom display the most characteristic properties of natural languages, such as the use of anaphoric or other referring expressions, or ellipsis. This paper argues that useful use could be made of such devices in artificial languages, and proposes a mechanism for the resolution of ellipsis and anaphora in them using finite state transduction techniques. This yields an interpretation system displaying many desirable properties: easily implementable, efficient, incremental and reversible.<\/jats:p><jats:p><jats:italic>Linguists in general, and computational linguists in particular, do well to employ finite state devices wherever possible. They are theoretically appealing because they are computationally weak and best understood from a mathematical point of view. They are computationally appealing because they make for simple, elegant, and highly efficient implementations. In this paper, I hope I have shown how they can be applied to a problem\u2026 which seems initially to require heavier machinery<\/jats:italic>.<\/jats:p>","DOI":"10.1017\/s1351324900000188","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T11:22:01Z","timestamp":1221218521000},"page":"217-234","source":"Crossref","is-referenced-by-count":1,"title":["Anaphora and ellipsis in artificial languages"],"prefix":"10.1017","volume":"1","author":[{"given":"Stephen G.","family":"Pulman","sequence":"first","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"S1351324900000188_ref003","volume-title":"Principles of Compiler Design","author":"Aho","year":"1977"},{"key":"S1351324900000188_ref006","first-page":"331","article-title":"Regular models of phonological rule systems","volume":"20","author":"Kaplan","year":"1994","journal-title":"Computational Linguistics"},{"key":"S1351324900000188_ref013","doi-asserted-by":"publisher","DOI":"10.1080\/01690968608407061"},{"key":"S1351324900000188_ref011","doi-asserted-by":"publisher","DOI":"10.3115\/991635.991704"},{"key":"S1351324900000188_ref004","doi-asserted-by":"crossref","DOI":"10.1515\/9783112316009","volume-title":"Syntactic Structures","author":"Chomsky","year":"1957"},{"key":"S1351324900000188_ref007","doi-asserted-by":"publisher","DOI":"10.3115\/992066.992091"},{"key":"S1351324900000188_ref010","doi-asserted-by":"crossref","first-page":"178","DOI":"10.3115\/980431.980529","volume-title":"COLING-84, Proceedings of the 10th International Conference on Computational Linguistics","author":"Koskenniemi","year":"1984"},{"key":"S1351324900000188_ref014","volume-title":"Computational Morphology","author":"Ritchie","year":"1992"},{"key":"S1351324900000188_ref002","volume-title":"The Theory of Parsing, Translation, and Compiling","author":"Aho","year":"1972"},{"key":"S1351324900000188_ref008","first-page":"94","volume-title":"Automatic Natural Language Parsing","author":"Kay","year":"1984"},{"key":"S1351324900000188_ref012","volume-title":"Proceedings of the 29th Annual Meeting of the Association for Computational Linguistics","author":"Pereira","year":"1991"},{"key":"S1351324900000188_ref009","doi-asserted-by":"publisher","DOI":"10.3115\/976858.976860"},{"key":"S1351324900000188_ref001","volume-title":"The Core Language Engine","author":"Alshawi","year":"1992"},{"key":"S1351324900000188_ref005","unstructured":"Church K. , 1980. On Memory Limitations in Natural Language Processing. Technical Report LCS\/Tr-245, MIT."}],"container-title":["Natural Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1351324900000188","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,16]],"date-time":"2021-09-16T09:52:20Z","timestamp":1631785940000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1351324900000188\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["S1351324900000188"],"URL":"https:\/\/doi.org\/10.1017\/s1351324900000188","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}