Home
»
course syllabi, etc.
»
csc 350
»
CSC 350 Computational Linguistics — Notes
Overview
Regular sets
Perl
re
's
Perl examples ⇒
#1
⇒
#2
⇒
#3
⇒
#4
JavaScript example
Deterministic Finite Automaton — DFA
Nondeterministic FA — NFA
Morphology
Finite State Recognizers
Finite State Transducer — FST
Morphological Parsing
Document:
URL: