Compiling contextual restrictions on strings into finite-state automata

Visa fullständig post



Permalänk

http://hdl.handle.net/10138/225831

Citation

Yli-Jyrä , A M & Koskenniemi , K 2004 , Compiling contextual restrictions on strings into finite-state automata . julkaisussa L Cleophas & B W Watson (toim) , Proceedings of the Eindhoven FASTAR Days 2004, Proceedings. Computer Science Reports 04/40, Eindhoven, . Technische Universiteit Eindhoven , Eindhoven , The Eindhoven FASTAR Days 2004 , Eindhoven , Alankomaat , 03/09/2004 .

Titel: Compiling contextual restrictions on strings into finite-state automata
Författare: Yli-Jyrä, Anssi Mikael; Koskenniemi, Kimmo
Editor: Cleophas, L.; Watson, B.W.
Medarbetare: Helsingin yliopisto, Nykykielten laitos 2010-2017
Helsingin yliopisto, Nykykielten laitos 2010-2017
Utgivare: Technische Universiteit Eindhoven
Datum: 2004
Språk: fin
Sidantal: 21
Tillhör serie: Proceedings of the Eindhoven FASTAR Days 2004, Proceedings. Computer Science Reports 04/40, Eindhoven,
Permanenta länken (URI): http://hdl.handle.net/10138/225831
Abstrakt: The paper discusses a language operation that we call context restriction. This operation is closely associated with context restriction rules (Kosken- niemi, 1983; Kiraz, 2000), right-arrow rules or implication rules (Kosken- niemi et al., 1992; Voutilainen, 1997) and the restriction operator (Beesley and Karttunen, 2003). The operation has been used in finite-state phonology and morphology in certain limited ways. A more general setting involves re- stricting overlapping occurrences of a center language under context condi- tions. Recently, star-free regular languages (and all regular languages) have been shown to be closed under context restrictions with such “overlapping centers” (Yli-Jyra ̈, 2003), but the construction involved is overly complex and becomes impractical when the number of operands grows. In this paper, we improve this recent result by presenting a more practical construction. This construction is not only simpler but it also leads to a generalization where contexts and centers may appear as conditions at both sides of the implication arrow (⇒): licensing conditions on the right-hand side specify the restriction and triggering conditions on the left-hand side regulate activation of the restriction. One application of the generalization is to facilitate splitting certain context restriction rules in grammars into a conjunction of separate rules.
Subject: 113 Tietojenkäsittely- ja informaatiotieteet
6121 Kielitieteet
Licens:


Filer under denna titel

Totalt antal nerladdningar: Laddar...

Filer Storlek Format Granska
7.pdf 139.2Kb PDF Granska/Öppna

Detta dokument registreras i samling:

Visa fullständig post