Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Kempe, André"'
Autor:
Kempe, André
HASH(0x5fffac8)
Externí odkaz:
http://edoc.ub.uni-muenchen.de/1218/1/Kempe_Andre.pdf
http://nbn-resolving.de/urn:nbn:de:bvb:19-12183
http://nbn-resolving.de/urn:nbn:de:bvb:19-12183
Autor:
Kempe, André
Thesis (doctoral)--Ludwig-Maximilians-Universität München, 2003.
Accompanying CD-ROM includes color images of all figures. Includes bibliographical references (p. 130-135). Original thesis in German available online via the Internet.
Accompanying CD-ROM includes color images of all figures. Includes bibliographical references (p. 130-135). Original thesis in German available online via the Internet.
Externí odkaz:
http://edoc.ub.uni-muenchen.de/archive/00001218/
Autor:
Kempe, André
Publikováno v:
Proc. FSMNLP 2009, Pretoria, South Africa. July 21-24. (invited talk)
A weighted finite-state machine with n tapes (n-WFSM) defines a rational relation on n strings. It is a generalization of weighted acceptors (one tape) and transducers (two tapes). After recalling some basic definitions about n-ary weighted rational
Externí odkaz:
http://arxiv.org/abs/1104.5362
Autor:
Kempe, André
Publikováno v:
Proc. FSMNLP 2009, Pretoria, South Africa. July 21-24. (improved version).
We present a generalization of the Viterbi algorithm for identifying the path with minimal (resp. maximal) weight in a n-tape weighted finite-state machine (n-WFSM), that accepts a given n-tuple of input strings (s_1,... s_n). It also allows us to co
Externí odkaz:
http://arxiv.org/abs/cs/0612041
Autor:
Kempe, André
The automatic extraction of acronyms and their meaning from corpora is an important sub-task of text mining. It can be seen as a special case of string alignment, where a text chunk is aligned with an acronym. Alternative alignments have different co
Externí odkaz:
http://arxiv.org/abs/cs/0612033
This report defines various operations for weighted multi-tape automata (WMTAs) and describes algorithms that have been implemented for those operations in the WFSC toolkit. Some algorithms are new, others are known or similar to known algorithms. Th
Externí odkaz:
http://arxiv.org/abs/cs/0406003
Autor:
Kempe, Andre
Publikováno v:
Proc. CLIN 2000, pp. 88-96, Tilburg, The Netherlands. November 3
We present a method of constructing and using a cascade consisting of a left- and a right-sequential finite-state transducer (FST), T1 and T2, for part-of-speech (POS) disambiguation. Compared to an HMM, this FST cascade has the advantage of signific
Externí odkaz:
http://arxiv.org/abs/cs/0110027
Autor:
Kempe, Andre
Publikováno v:
Proc. TALN 2000, pp. 207-215, Lausanne, Switzerland. October 16-18
This article describes an algorithm for reducing the intermediate alphabets in cascades of finite-state transducers (FSTs). Although the method modifies the component FSTs, there is no change in the overall relation described by the whole cascade. No
Externí odkaz:
http://arxiv.org/abs/cs/0010030
Autor:
Kempe, Andre
Publikováno v:
NeMLaP3/CoNLL'98, pp.29-37, Sydney, Australia. January 15-17, 1998
This paper describes the conversion of a Hidden Markov Model into a finite state transducer that closely approximates the behavior of the stochastic model. In some cases the transducer is equivalent to the HMM. This conversion is especially advantage
Externí odkaz:
http://arxiv.org/abs/cmp-lg/9802001