{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:56:23Z","timestamp":1648796183470},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[1996,12,1]],"date-time":"1996-12-01T00:00:00Z","timestamp":849398400000},"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":[[1996,12]]},"abstract":"<jats:p>In computational linguistics, efficient recognition of \nphrases is an important prerequisite for many ambitious goals, \nsuch as automated extraction of terminology, \npart of speech disambiguation, and automated translation. If one wants\n to recognize \na certain well-defined set of phrases, the question of which type of computational \ndevice to use for this task arises. For sets of phrases that are not \ntoo complex, as well \nas for many subtasks of the recognition process, finite state methods \nare appropriate \nand favourable because of their efficiency Gross and Perrin 1989; Silberztein\n 1993; \nTapanainen 1995. However, if very large sets of possibly complex phrases\n are \nconsidered where correct resolution of grammatical structure requires morphological \nanalysis (e.g. verb argument structure, extraposition of relative \nclauses, etc.), then the \ndesign and implementation of an appropriate finite state automaton might\n turn out \nto be infeasible in practice due to the immense number of morphological\n variants \nto be captured.<\/jats:p>","DOI":"10.1017\/s1351324997001630","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T13:30:22Z","timestamp":1027776622000},"page":"365-366","source":"Crossref","is-referenced-by-count":0,"title":["Between finite state and Prolog: constraint-based \nautomata for efficient recognition of phrases"],"prefix":"10.1017","volume":"2","author":[{"given":"KLAUS U.","family":"SCHULZ","sequence":"first","affiliation":[]},{"given":"TOMEK MIKO","family":"\u0141AJEWSKI","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[1996,12,1]]},"container-title":["Natural Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1351324997001630","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T19:47:47Z","timestamp":1557690467000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1351324997001630\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,12]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,12]]}},"alternative-id":["S1351324997001630"],"URL":"https:\/\/doi.org\/10.1017\/s1351324997001630","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}