Compounds
Some languages (in Indo-European particularly Germanic languages) like to make long compound words with low frequency that are unlikely to be found in dictionaries. Typically for any "normal" noun, there can be around 10—100 compound nouns which inflect in exactly the same way (at least for Afrikaans).
- Afrikaans: infrastruktuurontwikkelingsplan, infrastruktuur+ontwikkelings+plan ("infrastructure development plan"), (cf. personeelverminderingsprosedure, "personnel protection procedure")
- Dutch : "hulpagina" (help page), "woordbetekenis" (meaning of a word),
- German: Kontaktlinsenverträglichkeitstest, Kontakt+linsen+verträglichkeits+test ("contact-lens compatibility test")
Perhaps there could be some method of attempting to resolve unknown compound words into their constituent parts.
Outstanding questions
- Where would compound processing go in the pipeline? Presumably after initial analysis? e.g. in between
lt-procandapertium-tagger.
Proposed algorithms
Baseline
input: ^*infrastruktuurontwikkelingsplan$
- Read word from left to right.
- Take the longest match first from the dictionaries, e.g. infrastruktuurontwikkelingsplan,
- Read i-n-f-r-a-s-t-r-u-k-u-u-r (add, because no words have +o)
- Read o-n-t-w-i-k-k-e-l-i-n-g-s (add, because no words have +p)
- Read p-l-a-n
- Output in order.
output: ^infrastruktuur<n><sg>$ ^ontwikkeling<n><pl>$ ^plan<n><sg>$
Further reading
- Koehn, P. and Knight, K. (2003) "Empirical Methods for Compound Splitting". 11th Conference of the European Chapter of the Association for Computational Linguistics, (EACL2003).
- Brown, R. (2002) "Corpus-Driven Splitting of Compound Words". TMI 2002
- Larson, M., Willett, D., Köhler, J. and Rigoll, G. (2000) "Compound splitting and lexical unit recombination for improved performance of a speech recognition system for German parliamentary speeches". Conference on Spoken Language Processing, 2000.
- Moa, H. (2005) "Compounds and other oddities in machine translation". Proceedings of the 15th NODALIDA conference, Joensuu 2005.
