|
 
|
[Bar07a] Using Mazurkiewicz Trace Languages for Partition-Based Morphology
Conférence Internationale avec comité de lecture : ACL'07 Annual Meeting of the Association of Computational Linguistics, January 2007, pp.928-935,
motcle:
Résumé:
Partition-based morphology is an approach of finite-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 finite-state machines. In this
paper, we address the question of merging grammars using different
partitionings into a single finite-state machine. A morphological
description may then be obtained by parallel or sequential
application of constraints expressed on different partition notions
(e.g. morpheme, phoneme, grapheme). The theory of Mazurkiewicz Trace
Languages, a well known semantics of parallel systems, provides a
way of representing and compiling such a description.
Equipe:
sys
BibTeX
| @inproceedings { | |||
| Bar07a, | |||
| title | = | "{Using Mazurkiewicz Trace Languages for Partition-Based Morphology}", | |
| author | = | " F. Barthelemy ", | |
| booktitle | = | "{ACL'07 Annual Meeting of the Association of Computational Linguistics}", | |
| year | = | 2007, | |
| month | = | "January", | |
| pages | = | "928-935", | |
| } | |||
