Similarity and differences by finite automata
published: Dec. 14, 2007, recorded: October 2007, views: 916
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
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.
Download slides: aop07_gaal_sdf.pdf (1.1 MB)
Download slides: aop07_gaal_sdf.ppt (1.7 MB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !