{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T12:55:24Z","timestamp":1676897724488},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"3","license":[{"start":{"date-parts":[[2013,5,3]],"date-time":"2013-05-03T00:00:00Z","timestamp":1367539200000},"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":[[2013,7]]},"abstract":"<jats:p>The noun compound \u2013 a sequence of nouns which functions as a single noun \u2013 is very common in English texts. No language processing system should ignore expressions like <jats:italic>steel soup pot cover<\/jats:italic> if it wants to be serious about such high-end applications of computational linguistics as question answering, information extraction, text summarization, machine translation \u2013 the list goes on. Processing noun compounds, however, is far from trouble-free. For one thing, they can be bracketed in various ways: is it <jats:italic>steel soup<\/jats:italic>, <jats:italic>steel pot<\/jats:italic>, or <jats:italic>steel cover<\/jats:italic>? Then there are relations inside a compound, annoyingly not signalled by any words: does <jats:italic>pot<\/jats:italic><jats:sc>contain<\/jats:sc><jats:italic>soup<\/jats:italic> or is it <jats:sc>for cooking<\/jats:sc><jats:italic>soup<\/jats:italic>? These and many other research challenges are the subject of this special issue.<\/jats:p>","DOI":"10.1017\/s1351324913000090","type":"journal-article","created":{"date-parts":[[2013,5,3]],"date-time":"2013-05-03T12:32:52Z","timestamp":1367584372000},"page":"289-290","source":"Crossref","is-referenced-by-count":3,"title":["On the semantics of noun compounds"],"prefix":"10.1017","volume":"19","author":[{"given":"STAN","family":"SZPAKOWICZ","sequence":"first","affiliation":[]},{"given":"FRANCIS","family":"BOND","sequence":"additional","affiliation":[]},{"given":"PRESLAV","family":"NAKOV","sequence":"additional","affiliation":[]},{"given":"SU NAM","family":"KIM","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2013,5,3]]},"container-title":["Natural Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1351324913000090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T21:02:47Z","timestamp":1556053367000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1351324913000090\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,3]]},"references-count":0,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["S1351324913000090"],"URL":"https:\/\/doi.org\/10.1017\/s1351324913000090","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,3]]}}}