Compiling contextual restrictions on strings into finite-state automata

Show simple item record

dc.contributor Helsingin yliopisto, Nykykielten laitos 2010-2017 fi
dc.contributor Helsingin yliopisto, Nykykielten laitos 2010-2017 fi
dc.contributor.author Yli-Jyrä, Anssi Mikael
dc.contributor.author Koskenniemi, Kimmo
dc.contributor.editor Cleophas, L.
dc.contributor.editor Watson, B.W.
dc.date.accessioned 2017-10-15T00:13:05Z
dc.date.available 2017-10-15T00:13:05Z
dc.date.issued 2004
dc.identifier.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 . en
dc.identifier.citation conference en
dc.identifier.other PURE: 21744147
dc.identifier.other PURE UUID: e423667c-95cc-4c39-ac7d-20d5b89213d8
dc.identifier.other ORCID: /0000-0003-0731-2114/work/68612747
dc.identifier.other ORCID: /0000-0002-0061-9714/work/68616847
dc.identifier.uri http://hdl.handle.net/10138/225831
dc.description.abstract 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. fi
dc.format.extent 21
dc.language.iso fin
dc.publisher Technische Universiteit Eindhoven
dc.relation.ispartof Proceedings of the Eindhoven FASTAR Days 2004, Proceedings. Computer Science Reports 04/40, Eindhoven,
dc.rights en
dc.subject 113 Tietojenkäsittely- ja informaatiotieteet en
dc.subject 6121 Kielitieteet en
dc.title Compiling contextual restrictions on strings into finite-state automata fi
dc.type Konferenssiartikkeli
dc.type.uri info:eu-repo/semantics/other
dc.contributor.pbl
dc.contributor.pbl
dc.contributor.pbl

Files in this item

Total number of downloads: Loading...

Files Size Format View
7.pdf 139.2Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record