compositionisourfriend-wenkub
2022-10-23 16:06:59 本頁(yè)面
【正文】 uses/users of your system. ?Try to create a core system that may, by itself, serve nobody。t and laesst and lae223。 a e, 223。 and 223。 and 223。), 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 based on intersection Intersection of Two FiniteState Relations FST A: [ a:b ]* [ 0:c ]* FST B: [ 0:b ]* [ a:c ]* a:b 0:c 0:c 0:b a:c a:c ? On the upper side, some number n of as ? On the lower side, n bs, followed by any number of cs ? On the upper side, some number n of as ? On the lower side, any number of bs, followed by n cs Attempted Intersection of Two FiniteState Relations (FSTs) a:b 0:c 0:c 0:b a:c a:c 00 a bc aa bbcc aaa bbbccc aaaa bbbbcccc The lowerside language of the resulting relation is bn And the bn language is known to be contextfree in power (. beyond finitestate power). Back Down to Earth ?Just be aware that transducers cannot, in general, be intersected, subtracted, or plemented. ?But transducers can be unioned, concatenated, and posed. ?Composition is often the key operation for modifying, filtering, and bining transducers. Phonological/Orthographical Rules Lexicon FST (lexc) .o. Rule 1 .o. .o. Rule 2 Rule n “Application”
教學(xué)課件相關(guān)推薦
鄂ICP備17016276號(hào)-1