Kuvaus
Sequential Constraint Grammar (SCG)(Karlsson, 1990) and its extensions have
lacked clear connections to formal language
theory. The purpose of this article is
to lay a foundation for these connections
by simplifying the definition of strings
processed by the grammar and by showing
that Nonmonotonic SCG is undecidable
and that derivations similar to the Generative
Phonology exist. The current investigations
propose resource bounds that
restrict the generative power of SCG to
a subset of context sensitive languages
and present a strong finite-state condition
for grammars as wholes
| Aikajakso | 11 toukok. 2017 |
|---|
Tähän liittyvä sisältö
-
Projektit
-
A Usable Finite-State Model for Adequate Syntactic Complexity
Projekti: Tutkimusprojekti
-
Path-Decomposed Accurate Dependency Analysis and Translation with Weighted Automata
Projekti: Tutkimusprojekti
-
Building and use of language technology (BAULT)
Projekti: Tutkimuksen arviointi 2011
-
HFST - Helsinki Finite-State Technology
Projekti: Tutkimusprojekti
-
Aktiviteetit
-
The Regular Universe of Language Models and Its Continuing Expansion
Aktiviteetti: Puhe- tai esitystyypit › Suullinen esitys
-
Henrik Björklund
Aktiviteetti: Vierailijan isännöinnin tyypit › Isännöity akateeminen vierailu Helsingin yliopistossa