{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:33:03Z","timestamp":1648917183626},"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>A Lexical Transducer (LT) as defined by Karttunen, Kaplan, Zaenen\n 1992 is a \nspecialized finite state transducer (FST) that relates citation forms of\n words and \ntheir morphological categories to inflected surface forms. Using LTs is\n advantageous \nbecause the same structure and algorithms can be used for morphological\n analysis \n(stemming) and generation. Morphological processing (analysis and generation)\n is \ncomputationally faster, and the data for the process can be compacted more\n tightly \nthan with other methods. The standard way to construct an LT consists of\n three \nsteps: (1) constructing a simple finite state source lexicon \n<jats:italic>LA<\/jats:italic> which defines all valid \ncanonical citation forms of the language; (2) describing morphological\n alternations \nby means of two-level rules, compiling the rules to FSTs, and intersecting\n them to \nform a single rule transducer RT; and (3) composing <jats:italic>LA<\/jats:italic> and <jats:italic>RT<\/jats:italic>.<\/jats:p>","DOI":"10.1017\/s1351324997001575","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T13:36:03Z","timestamp":1027776963000},"page":"329-330","source":"Crossref","is-referenced-by-count":1,"title":["The Japanese lexical transducer based on stem-suffix style forms"],"prefix":"10.1017","volume":"2","author":[{"given":"MASAKAZU","family":"TATENO","sequence":"first","affiliation":[]},{"given":"HIROSHI","family":"MASUICHI","sequence":"additional","affiliation":[]},{"given":"HIROSHI","family":"UMEMOTO","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\/S1351324997001575","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\/S1351324997001575\/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":["S1351324997001575"],"URL":"https:\/\/doi.org\/10.1017\/s1351324997001575","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,12]]}}}