Paper: Using Mazurkiewicz Trace Languages for Partition-Based Morphology

ACL ID P07-1117
Title Using Mazurkiewicz Trace Languages for Partition-Based Morphology
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 2007
Authors

Partition-based morphology is an approach of nite-state morphology where a grammar describes a special kind of regular relations, which split all the strings of a given tuple into the same number of substrings. They are compiled in nite-state machines. In this paper, we address the question of merging grammars using different partitionings into a single nite-state machine. A morphologi- cal description may then be obtained by par- allel or sequential application of constraints expressed on different partition notions (e.g. morpheme, phoneme, grapheme). The the- ory of Mazurkiewicz Trace Languages, a well known semantics of parallel systems, provides a way of representing and compil- ing such a description. 1 Partition-Based Morphology Finite-State Morphology is based on the idea that regul...