Finite State Automata (FSA) Morphological Analysis Task
Jump to navigation
Jump to search
A Finite State Automata (FSA) Morphological Analysis Task is a Morphological Analysis Task that is based on a Finite-State Machine.
- Context:
- It can be solved by a Finite State Automata (FSA) Morphological Analysis System by implementing a Finite State Automata (FSA) Morphological Analysis Algorithm.
- Example(s):
- Counter-Example(s):
- an Associative Model Morphological Analysis Task,
- a Corpus-Based Morphological Analysis Task,
- a Finite State Transducers (FST) Morphological Analysis Task,
- a Directed Acrylic Word Graph (DAWG) Morphological Analysis Task,
- a Two-Level Morphological Analysis Task,
- a Mininum Description Lenth Morphological Analysis Task,
- a Paradigm Based Morphological Analysis Task,
- a Recurrent Neural Network Language Model (RNNLM) Morphological Analysis Task,
- a Stemmer Morphological Analysis Task,
- See: Finite State Transducer, Natural Language Syntactic Analysis Task, Morphological Tag, Morphological Inflection, Morphological Derivation, Part-of-Speech Tagging System, Word Sense Disambiguation, Minimum Description Length, Zipfian Sparsity, Gibbs Sampling, Non-concatenative Morphology, Allomorphy, Morphophonology, Recurrent Neural Network Language Model.
References
2008
- (Saranya, 2008) ⇒ S. K. Saranya. (2008). “Morphological Analyzer for Malayalam Verbs.” In: M. Tech Thesis, Amrita School of Engineering, Coimbatore.
- QUOTE: A finite state machine or finite automation is a model of behavior compose of state, transitions and actions. A finite state automaton is a device that can be in one of a finite number of states. If the automation is in a final state, when it stops working, it is said to accept its input. The input is a sequence of symbols.
FSA is used to accept or reject a string in a given language. It uses regular expressions. When the automaton is switched on it will be in the initial stage and start working. In the final state it will accept or reject the given string. In between the initial state and finite state there are transition a process of switching over to another state. Regular expressions are powerful tools for text searching. FSA can be used to represent morphological lexicon and recognition.
- QUOTE: A finite state machine or finite automation is a model of behavior compose of state, transitions and actions. A finite state automaton is a device that can be in one of a finite number of states. If the automation is in a final state, when it stops working, it is said to accept its input. The input is a sequence of symbols.