WFSM Auto-intersection and Join Algorithms

The join of two n-ary string relations is a main operation regarding to applications. n-Ary rational string relations are realized by weighted finite-state machines with n tapes. We provide an algorithm that computes the join of two machines via a more simple operation, the auto-intersection. The two operations generally do not preserve rationality. A delay-based algorithm is described for the case of a single tape pair, as well as the class of auto-intersections that it handles. It is generalized to multiple tape pairs and some enhancements are discussed.

• Type: Conference
• Year: 2005
• Where: FSMNLP
• Authors: André Kempe, Jean-Marc Champarnaud, Franck Guingne, Florent Nicart
• Keywords: FSMNLP 2005, N-Ary Rational String, N-ary String Relations, Natural Language Processing, String Relations