Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Formal Dependency Syntax 1 - NTIN079

Title:	Formální závislostní syntax 1
Guaranteed by:	Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2020
Semester:	winter
E-Credits:	3
Hours per week, examination:	winter s.:2/0, Ex [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	taught
Language:	Czech
Teaching methods:	full-time
Teaching methods:	full-time

Guarantor:	Martin Plátek, CSc.
Class:	Informatika Mgr. - volitelný
Classification:	Informatics > Theoretical Computer Science
Is co-requisite for:	NTIN080

Opinion survey results Examination dates WS schedule Noticeboard

Annotation -

Last update: T_KTI (19.05.2004)

The lecture is dealing with certain type of formal modelling of the syntax of natural languages. The dependency approach is gradually formalized and generalized. The main contribution of the proposed and studied models concern languages with the free-word order.

Aim of the course -

Last update: RNDr. Jan Hric (07.06.2019)

To learn techniques and methods used in analysis of natural languages

Course completion requirements -

Last update: RNDr. Jan Hric (07.06.2019)

TBA

Literature - Czech

Last update: T_KTI (19.05.2004)

Petr Jančar, František Mráz, Martin Plátek, and Jörg Vogel: Different types of monotonicity for restarting automata. Forschungsergebnisse der Fakultät für Mathematik und Informatik Math/Inf/98/15, Institut für Informatik, Friedrich-Schiller-Universität Jena, May 1998. 15 pages.

Petr Jančar, František Mráz, Martin Plátek, and Jörg Vogel: Monotonicity on restarting automata, Forschungsergebnisse der Fakultät für Mathematik und Informatik Math/Inf/02/01, Institut für Informatik, Friedrich-Schiller-Universität Jena, 2002, 12 pages.

Martin Plátek, Friedrich Otto, František Mráz, Tomasz Jurdzinski: Restarting automata and variants of j-monotonicity. Mathematische Schriften Kassel 9/03, Universität Kassel, October 2003.

M. Plátek, Elektronický text k této prednášce.

Plátek M., Tichá B.: List Automata as Dependency Parsers. PBML 50, 1988

P.Sgall, E.Hajičová, J.Panevová: The Meaning of the

Sentence in Its Semantic and Pragmatic Aspects, Dordrecht: Reidel

and Prague: Academia, 1986

Syllabus -

Last update: T_KTI (19.05.2004)

1. Analysis by reduction, subordination, coordination.

2. Linear-list automata, restarting automata - tools for modelling analysis by reduction.

3. Taxonomy of list and restarting automata.

4. Types of syntactic analysis - immediate constituents, dependencies.

5. Phrase-structure and categorial grammars.

6. Linear list automata - models of syntax.