Morphological parsing

Morphological parsing, in <a href="/facts/Natural_language_processing/1hjMKsSN">natural language processing</a>, is the process of determining the <a href="/facts/Morphemes/4JNcPMHs">morphemes</a> from which a given word is constructed. It must be able to distinguish between orthographic rules and morphological rules. For example, the word 'foxes' can be decomposed into 'fox' (the stem), and 'es' (a suffix indicating plurality).
The generally accepted approach to morphological parsing is through the use of a <a href="/facts/Finite_state_transducer/1IAIurRf">finite state transducer</a> (FST), which inputs words and outputs their stem and modifiers. The FST is initially created through algorithmic parsing of some word source, such as a dictionary, complete with modifier markups.
Another approach is through the use of an indexed lookup method, which uses a constructed <a href="/facts/Radix_tree/a1JKJPYc">radix tree</a>. This is not an often-taken route because it breaks down for morphologically complex languages.
With the advancement of <a href="/facts/Neural_networks/DDhJTfMc">neural networks</a> in natural language processing, it became less common to use FST for morphological analysis, especially for languages for which there is a lot of available <a href="/facts/Training_data/V3mMQb2G">training data</a>. For such languages, it is possible to build character-level <a href="/facts/Language_models/FntSpg0j">language models</a> without explicit use of a morphological parser.

Morphological parsing open-in-new

Morphological parsing