Explores parsing text into trees using parser combinators in Scala, covering filtering, transforming, sequencing, alternatives, recursion, spaces handling, lexing, monadic nature, and for-notation.
Explains the translation of for-expressions in Scala using map, flatmap, and filter functions, with examples and a discussion on its generalization to different types.
Covers syntactic structure, dependency parsing, and neural network transition-based parsing, highlighting the importance of dependency structure in linguistic analysis.
