A graph auto-encoder model of derivational morphology
There has been little work on modeling the morphological well-formedness (MWF) of derivatives, a problem judged to be complex and difficult in linguistics. We present a graph auto-encoder that learns embeddings capturing information about the compatibility of affixes and stems in derivation. The aut...
| Автори: | , , |
|---|---|
| Формат: | Conference item |
| Мова: | English |
| Опубліковано: |
Association for Computational Linguistics
2020
|