compositionisourfriend(已修改)
2024-10-28 16:06 本頁面
【正文】 Composition is Our Friend Wednesday PM Kenh R. Beesley Xerox Research Centre Europe View position vertically p a t + i n + a d + i m + a b e i || _ .. p a t + i n + a d + i m + a b d j, t c || _ (“+”) i p a c + i n + a j + i m + a b b p, d t, g k || _ .. p a c + i n + a j + i m + a p Underlying form Rule 1 Intermediate form Rule 2 Intermediate form Rule n Final form View position vertically e i || _ .. d j, t c || _ (“+”) i b p, d t, g k || _ .. .o. .o. A Single FST p a t + i n + a d + i m + a b p a c + i n + a j + i m + a p Composition is Our Friend The position operation is often the key to building, modifying, filtering and testing finitestate systems. You Can Compose Transducers ? Regular languages (and the works that encode them) can be unioned, concatenated, intersected, subtracted and plemented. ? Regular relations (and the transducers that encode them) can be unioned and concatenated. ? But you cannot, in general, intersect, plement, or subtract transducers (relations). This is a mathematical restriction. Relations are not closed for these operations. ? But you can pose transducers An Example for the Mathematicians ? Regular relations are not closed under intersection (amp。), subtraction () or plementation (amp。). ? This means that when you intersect, subtract or plement regular relations, the result may no longer be regular. . the result may no longer be finite state, and so cannot be encoded as a finitestate work. ? The following example is
教學(xué)課件相關(guān)推薦
鄂ICP備17016276號(hào)-1