50 likes | 175 Vues
This summary discusses key concepts from LING 570, including formal grammars, languages, and the Chomsky hierarchy. It highlights the equivalence of regular languages, grammars, and expressions, along with finite state automata (FSA) and their extensions, such as probabilistic FSAs. The practical applications of FSAs and finite state transducers (FSTs) are explored, particularly in morphological analysis and automatic speech recognition (ASR). Additionally, it outlines the components of morphological analysis, including lexicon, morphemes, and morphotactic rules.
E N D
Unit #1 Summary LING 570 Fei Xia Week 4: 10/17/07 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA
Recap: formal grammars and languages • Formal language and formal grammar • Chomsky hierarchy • Other grammars and languages • The following are equivalent: • Regular language • Regular grammar • Regular expression • FSA (DFA and NFA)
Recap: FSA • FSA and Extension of FSA • Probabilistic and weighted FSA • FST and weighted FST • Packages: AT&T, Carmel, NLTK • Applications of FSA / FST: • Morphological analyzer • ASR • …
Recap: morphological analysis • Three components: • Lexicon: book is a “regular” noun • Morphotactic rules: PL follows nouns • Orthographic rules: e-insertion, e-deletion
An example • Task: foxes fox +N +PL • Surface: foxes • Intermediate: fox s • Lexical: fox +N +pl Orthographic rules Lexicon + morphotactics