Selected Operations and Applications of n-Tape Weighted Finite-State Machines

被引：0

作者：

Kempe, Andre ^{[1
]}

机构：

[1] Cadege Technol, F-75015 Paris, France

来源：

FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING | 2010年 / 6062卷

关键词：

AUTO-INTERSECTION; ALGORITHMS; MORPHOLOGY; JOIN;

D O I：

暂无

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

A weighted finite-state machine with n tapes (n-WFSM) defines a rational relation on n strings. The paper recalls important operations on these relations, and an algorithm for their auto-intersection. Through a series of practical applications, it investigates the augmented descriptive power of n-WFSMs, w.r.t. classical 1- and 2-WFSMs (weighted acceptors and transducers). Some of the presented applications are not feasible with the latter.

引用

页码：31 / 46

页数：16

共 37 条

[1] Ait-Mokhtar S., 1997, P 5 C APPL NATURAL L, P72
[2] [Anonymous], 2003, Finite state morphology
[3] [Anonymous], ACM T SPEECH LANGUAG
[4] An efficient, probabilistically sound algorithm for segmentation and word discovery
Brent, MR
[J]. MACHINE LEARNING, 1999, 34 (1-3) : 71 - 105
[5] Algorithms for the join and auto-intersection of multi-tape weighted finite-state machines
Champarnaud, Jean-Marc
Guingne, Franck
Kempe, Andre
Nicart, Florent
[J]. INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2008, 19 (02) : 453 - 476
[6] Eilenberg S., 1974, Pure and Applied Mathematics, V59
[7] ON RELATIONS DEFINED BY GENERALIZED FINITE AUTOMATA
ELGOT, CC
MEZEI, JE
[J]. IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1965, 9 (01) : 47 - &
[8] SYNCHRONIZED RATIONAL RELATIONS OF FINITE AND INFINITE WORDS
FROUGNY, C
SAKAROVITCH, J
[J]. THEORETICAL COMPUTER SCIENCE, 1993, 108 (01) : 45 - 82
[9] Unsupervised learning of the morphology of a natural language
Goldsmith, J
[J]. COMPUTATIONAL LINGUISTICS, 2001, 27 (02) : 153 - 198
[10] THE EQUIVALENCE PROBLEM OF MULTITAPE FINITE AUTOMATA
HARJU, T
KARHUMAKI, J
[J]. THEORETICAL COMPUTER SCIENCE, 1991, 78 (02) : 347 - 355

← 1 2 3 4 →