PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Similarity and differences by finite automata
Tamas Gaal
In: The Analysis of Patterns 2007, 21-26 October 2007, Bertinoro, Italy.

Abstract

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.

EPrint Type:Conference or Workshop Item (Tutorial)
Additional Information:The static presentation (105 projected pages) was accompanied by related on-line demo snippets (XFST and WFSC examples) available on video.
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Natural Language Processing
Theory & Algorithms
ID Code:3917
Deposited By:Tamas Gaal
Deposited On:25 February 2008