{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T11:13:28Z","timestamp":1648984408343},"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>This paper proposes a robust approach to parsing suitable for Information Extraction (IE) \nfrom texts using finite-state cascades. The approach is characterized by the construction of \nan approximation of the full parse tree that captures all the information relevant for IE \npurposes, leaving the other relations underspecified. Sequences of cascades of finite-state rules \ndeterministically analyze the text, building unambiguous structures. Initially basic chunks are \nanalyzed; then clauses are recognized and nested; finally modifier attachment is performed \nand the global parse tree is built. The parsing approach allows robust, effective and efficient \nanalysis of real world texts. The grammar organization simplifies changes, insertion of new \nrules and integration of domain-oriented rules. The approach has been tested for Italian, \nEnglish, and Russian. A parser based on such an approach has been implemented as part of \n<jats:italic>Pinocchio<\/jats:italic>, an environment for developing and running IE applications.<\/jats:p>","DOI":"10.1017\/s1351324902002917","type":"journal-article","created":{"date-parts":[[2002,8,26]],"date-time":"2002-08-26T21:14:38Z","timestamp":1030396478000},"page":"145-165","source":"Crossref","is-referenced-by-count":1,"title":["Full parsing approximation for information \nextraction via finite-state cascades"],"prefix":"10.1017","volume":"8","author":[{"given":"FABIO","family":"CIRAVEGNA","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALBERTO","family":"LAVELLI","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\/S1351324902002917","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,5]],"date-time":"2019-04-05T14:57:36Z","timestamp":1554476256000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1351324902002917\/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":["S1351324902002917"],"URL":"https:\/\/doi.org\/10.1017\/s1351324902002917","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}