Defence on June 20th, 2005
Academic Dissertation
— electronic version (© 2005 Anssi Yli-Jyrä)
— paperback (© 2005 Anssi Yli-Jyrä)
Anssi Yli-Jyrä, Contributions to the Theory of Finite-State Based
Linguistic Grammars, Ph.D. dissertation, Publications of the
Department of General Linguistics, University of Helsinki, number
38, 2005, 228 pages. ISBN 952-10-2509-3. (Not for Sale)
Errata
- On page 26, the depth of circuits of $NC^k$ and $AC^k$ is
bounded by $log^k n$, rather than $k$.
- On page 35, the definition of $\mathbf{B}_0$ is
incorrect. Correct: $\mathbf{B}_0$ contains finite and co-finite
subsets of $\Sigma^*$.
- The Table 3.1 on page 38 contains some inconsistencies. The
point of the illustration is maintained despite the errors.
- Note that some non-standard terminological choices in the last
article [9] have been fixed in the dissertation.
Contributed Articles
- [1] Yli-Jyrä, Anssi Mikael. 2003. Describing syntax with
star-free regular expressions. In 11th EACL 2003, Proceedings of
the Conference, pages 379–386. Agro Hotel, Budapest,
Hungary.
- [2] Yli-Jyrä, Anssi Mikael. 2003. Regular approximations
through labeled bracketing (revised version). A manuscript submitted
for inclusion to the post-proceedings of the 8th conference on Formal
Grammar, Vienna, Austria, 16-17 August, 2003. The post proceedings
are due to be published as Online Proceedings of CSLI Publications,
Stanford, CA, USA.
- [3] Yli-Jyrä, Anssi Mikael. 2005. Approximating dependency
grammars through intersection of regular languages. In
Implementation and Application of Automata, 9th International
Conference, CIAA 2004. Kingston, Canada, July 22-24, 2004. Revised
Selected Papers, vol. 3317 of Lecture Notes in Computer Science
(LNCS), pages 281–292. Springer-Verlag.
Springer Links: OpenURL,
MetaPress Direct Linking,
- [4] Yli-Jyrä, Anssi Mikael. 2003. Multiplanarity — a
model for dependency structures in treebanks. In J. Nivre and
E. Hinrichs, eds., TLT 2003. Proceedings of the Second Workshop on
Treebanks and Linguistic Theories, vol. 9 of Mathematical
Modelling in Physics, Engineering and Cognitive Sciences, pages
189–200. Växjö, Sweden: Växjö University Press.
- [5] Yli-Jyrä, Anssi Mikael and Matti Nykänen. 2004. A
hierarchy of mildy context sensitive dependency
grammars. Gerhard Jäger, Paola Monachesi, Gerald Penn and Shuly
Wintner, eds., Proceedings of Formal Grammar 2004, August 7/8,
2004, Nancy, chapter 11, pages 151--166.
- [6] Yli-Jyrä, Anssi Mikael. 2004. Axiomatization of
restricted non-projective dependency trees through finite-state
constraints that analyse crossing bracketings. In G.-J. M. Kruijff
and D. Duchier, eds., Proceedings of the Workshop of Recent
Advances in Dependency Grammar, pages 33—40. Geneva,
Switzerland.
- [7] Yli-Jyrä, Anssi Mikael and Kimmo
Koskenniemi. 2004. Compiling contextual restrictions on strings into
finite-state automata. In L. Cleophas and B. W. Watson, eds.,
Proceedings of the Eindhoven FASTAR Days 2004,
Proceedings. Computer Science Reports 04/40, Eindhoven, The
Netherlands: Technische Universiteit Eindhoven. 21 pages.
- [8] Yli-Jyrä, Anssi Mikael. 2004. Simplifications of
intermediate results during intersection of multiple weighted
automata. In M. Droste and H. Vogler, eds., Weighted Automata:
Theory and Applications, Dresden, Germany, June 1-5, 2004,
no. TUD-FI04-05 in Technische Berichte der Fakultät Informatik,
ISSN-1430-211X, pages 46–48. D-01062 Dresden, Germany:
Technische Universität Dresden.
- [9] Yli-Jyrä, Anssi Mikael. 1995. Schematic finite-state
intersection parsing. In K. Koskenniemi, ed. Short Papers
Presented at the 10th Nordic Conference of Computational
Linguistics (NODALIDA-95), pages 95–103. Helsinki, Finland.
Other links