Material Detail

Similarity and differences by finite automata

Similarity and differences by finite automata

This video was recorded at The Analysis of Patterns, Bertinoro 2007. Similarity and differences by finite automata in HMMs, kernels, morphological analysers, compilers and image compressors. Constraint satisfaction solving by unweighted finite automata. Weighted finite automata, basics, semirings, examples. Weighted regular expressions. Extensions: multi-tape automata, join operation, symbol classes, relations among tapes. Linguistic examples: morphology, part-of-speech tagging, German compound analysis, edit distance, asymmetric term alignment (Machine Translation with Machine Learning). Image compression and manipulation. Tools used: XFST and WFSC of Xerox.


  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material


Log in to participate in the discussions or sign up if you are not already a MERLOT member.