{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T22:19:43Z","timestamp":1673475583379},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"2","license":[{"start":{"date-parts":[[1999,6,1]],"date-time":"1999-06-01T00:00:00Z","timestamp":928195200000},"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":[[1999,6]]},"abstract":"<jats:p>In this paper, we describe a context-based method to semantically tag unknown proper \nnouns (<jats:italic>U-PNs<\/jats:italic>) in corpora. Like many others, our system relies on a gazetteer and a set of \ncontext-dependent heuristics to classify proper nouns. However, proper nouns are an open-end class: when parsing new fragments of a corpus, even in the same language domain, we \ncan expect that several proper nouns cannot be semantically tagged. The algorithm that we \npropose assigns to an unknown PN an entity type based on the analysis of <jats:italic>syntactically<\/jats:italic> \nand <jats:italic>semantically<\/jats:italic> similar contexts already seen in the application corpus. The performance of \nthe algorithm is evaluated not only in terms of precision, following the tradition of MUC \nconferences, but also in terms of information gain, an information theoretic measure that \ntakes into account the complexity of the classification task.<\/jats:p>","DOI":"10.1017\/s135132499900220x","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:36:03Z","timestamp":1027762563000},"page":"171-185","source":"Crossref","is-referenced-by-count":6,"title":["Semantic tagging of unknown proper nouns"],"prefix":"10.1017","volume":"5","author":[{"given":"ALESSANDRO","family":"CUCCHIARELLI","sequence":"first","affiliation":[]},{"given":"DANILO","family":"LUZI","sequence":"additional","affiliation":[]},{"given":"PAOLA","family":"VELARDI","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[1999,6,1]]},"container-title":["Natural Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S135132499900220X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T15:17:27Z","timestamp":1553872647000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S135132499900220X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,6]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,6]]}},"alternative-id":["S135132499900220X"],"URL":"https:\/\/doi.org\/10.1017\/s135132499900220x","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,6]]}}}