Show simple item record

dc.contributor.authorBarton, G. Edward, Jr.en_US
dc.date.accessioned2004-10-04T14:55:59Z
dc.date.available2004-10-04T14:55:59Z
dc.date.issued1985-11-01en_US
dc.identifier.otherAIM-856en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/6427
dc.description.abstractMorphological analysis requires knowledge of the stems, affixes, combnatory patterns, and spelling-change processes of a language. The computational difficulty of the task can be clarified by investigating the computational characteristics of specific models of morphologial processing. The use of finite-state machinery in the "two-level" model by Kimmo Koskenicimi model does not guarantee efficient processing. Reductions of the satisfiability problem show that finding the proper lexical??face correspondence in a two-level generation or recognition problem can be computationally difficult. However, another source of complexity in the existing algorithms can be sharply reduced by changing the implementation of the dictionary component. A merged dictionary with bit-vectors reduces the number of choices among alternative dictionary subdivisions by allowing several subdivisions to be searched at once.en_US
dc.format.extent6042815 bytes
dc.format.extent4740399 bytes
dc.format.mimetypeapplication/postscript
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.relation.ispartofseriesAIM-856en_US
dc.titleThe Computational Complexity of Two-Level Morphologyen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record