About this document
Module2 NLP CP1 by srustihm is a document available to read on EtoBox.
The document discusses Regular Expressions (regexes) and Finite-State Automata (FSA), highlighting their applications in text parsing, Natural Language Processing, and language compiler design. It covers the basic syntax of regex, character classes, and the characteristics of deterministic and non-deterministic finite automata. Additionally, it explores morphological parsing, types of morphemes, and the use of finite-state transducers for morphological analysis.
- Author
- srustihm
- Language
- EN