{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T15:16:51Z","timestamp":1777130211809,"version":"3.51.4"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"2-3","license":[{"start":{"date-parts":[[2002,8,21]],"date-time":"2002-08-21T00:00:00Z","timestamp":1029888000000},"content-version":"unspecified","delay-in-days":81,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat. Lang. Eng."],"published-print":{"date-parts":[[2002,6]]},"abstract":"<jats:p>Robustness is a key issue for natural language processing in general and parsing in particular, \nand many approaches have been explored in the last decade for the design of robust parsing \nsystems. Among those approaches is shallow or partial parsing, which produces minimal and \nincomplete syntactic structures, often in an incremental way. We argue that with a systematic \nincremental methodology one can go beyond shallow parsing to deeper language analysis, \nwhile preserving robustness. We describe a generic system based on such a methodology and \ndesigned for building robust analyzers that tackle deeper linguistic phenomena than those \ntraditionally handled by the now widespread shallow parsers. The rule formalism allows the \nrecognition of n-ary linguistic relations between words or constituents on the basis of global \nor local structural, topological and\/or lexical conditions. It offers the advantage of accepting \nvarious types of inputs, ranging from raw to chunked or constituent-marked texts, so for \ninstance it can be used to process existing annotated corpora, or to perform a deeper analysis \non the output of an existing shallow parser. It has been successfully used to build a deep \nfunctional dependency parser, as well as for the task of co-reference resolution, in a modular \nway.<\/jats:p>","DOI":"10.1017\/s1351324902002887","type":"journal-article","created":{"date-parts":[[2002,8,27]],"date-time":"2002-08-27T01:14:38Z","timestamp":1030410878000},"page":"121-144","source":"Crossref","is-referenced-by-count":91,"title":["Robustness beyond shallowness: incremental deep \nparsing"],"prefix":"10.1017","volume":"8","author":[{"given":"S.","family":"A\u00cfT-MOKHTAR","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.-P.","family":"CHANOD","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"ROUX","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2002,8,21]]},"container-title":["Natural Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1351324902002887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T18:57:34Z","timestamp":1554490654000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1351324902002887\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":0,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S1351324902002887"],"URL":"https:\/\/doi.org\/10.1017\/s1351324902002887","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}