Please use this identifier to cite or link to this item:
http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6427Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.creator | Barton, G. Edward, Jr. | - |
| dc.date | 2004-10-04T14:55:59Z | - |
| dc.date | 2004-10-04T14:55:59Z | - |
| dc.date | 1985-11-01 | - |
| dc.date.accessioned | 2013-10-09T02:45:25Z | - |
| dc.date.available | 2013-10-09T02:45:25Z | - |
| dc.date.issued | 2013-10-09 | - |
| dc.identifier | AIM-856 | - |
| dc.identifier | http://hdl.handle.net/1721.1/6427 | - |
| dc.identifier.uri | http://koha.mediu.edu.my:8181/xmlui/handle/1721 | - |
| dc.description | Morphological 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. | - |
| dc.format | 6042815 bytes | - |
| dc.format | 4740399 bytes | - |
| dc.format | application/postscript | - |
| dc.format | application/pdf | - |
| dc.language | en_US | - |
| dc.relation | AIM-856 | - |
| dc.title | The Computational Complexity of Two-Level Morphology | - |
| Appears in Collections: | MIT Items | |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.