Morphological Parser
Jump to navigation
Jump to search
A Morphological Parser is a Computing System that can solve a Morphological Parsing Task by means of a Morphological Parsing Algorithm.
- AKA: Morphological Parsing System, Morphological Analyzer.
- Context:
- It can be supported by a Lemmatizer and a Tokenizer.
- Example(s):
- Counter-Example(s):
- See: Syntactic Parser, Finite State Transducer, Natural Language Processing System, Natural Language Understanding System.
References
2018
- (Schmid, 2018) ⇒ Helmut Schmid (2018). In: SFST - Stuttgart Finite State Transducer Tools Retrieved: 2018-08-23
- QUOTE: What is SFST?
SFST is a toolbox for the implementation of morphological analysers and other tools which are based on finite state transducer technology.
The SFST tools comprise
*** a compiler which translates transducer programs into minimised transducers
- interactive and batch-mode analysis programs
- tools for comparing and printing transducers
- an efficient C++ transducer library
- QUOTE: What is SFST?
2003
- (Beesley & Karttunen, 2003) ⇒ Kenneth R. Beesley, and Lauri Karttunen. (2003). “Finite State Morphology." CSLI Publications
- Includes software
- Keywords: Finite-State Automata, Finite-State Transducer.
1998
- (Lezius et al, 1998) ⇒ Wolfgang Lezius, Reinhard Rapp, Manfred Wettler. (1998). “A Freely Available Morphological Analyzer, Disambiguator and Context Sensitive Lemmatizer for German.” In: Proceedings of the 17th International Conference on Computational linguistics.
- ABSTRACT: In this paper we present Morphy, an integrated tool for German morphology, part-of-speech tagging and context-sensitive lemmatization. Its large lexicon of more than 320,000 word forms plus its ability to process German compound nouns guarantee a wide morphological coverage. Syntactic ambiguities can be resolved with a standard statistical part-of-speech tagger. By using the output of the tagger, the lemmatizer can determine the correct root even for ambiguous word forms. The complete package is freely available and can be downloaded from the World Wide Web.
1989
- (Abney, 1989) ⇒ Steven P. Abney. (1989). “Parsing By Chunks.” In: The MIT Parsing Volume, 1988-89. Center for Cognitive Science, MIT.
- QUOTE: … A typical natural language parser processes text in two stages. A tokenizer/morphological analyzer converts a stream of characters into a stream of words, and the parser proper converts a stream of words into a parsed sentence, or a stream of parsed sentences.