Subjects

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

Formal Dependency Syntax 2 - NTIN080

Title:	Formální závislostní syntax 2
Guaranteed by:	Department of Theoretical Computer Science and Mathematical Logic (32-KTIML)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2020
Semester:	summer
E-Credits:	3
Hours per week, examination:	summer 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
Co-requisite :	NTIN079

Opinion survey results Examination dates SS schedule Noticeboard

Annotation -

Last update: T_KTI (19.05.2004)

The lecture is a continuation of 'Formal dependency syntax I'. The lecture is dealing with certain type of 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 advanced techniques, methods, and theory 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)

A.Ja. Dikovskij, L.S. Modina :

"Dependencies on the other side of the curtain", In: Traitement

Automatique des Langues (TAL), 41(1):79-111, 2000

Alexej V. Gladkij: Formalnyje gramatiki i jaziki, Nauka, Moskva, 1973

R.Gramatovici, M.Plátek :

"D-trivial Dependency Grammars with Global Word-Order Restrictions", Technical Report TR-2002-16, Institute of Computational Linguistics, Faculty of Mathematics and Physics, Charles University, Prague, 2002.

T. Holan, V.Kuboň, K.Oliva, M.Plátek:

"Two Useful Measures of Word Order Complexity", In:

Proceedings of the Coling '98

Workshop "Processing of Dependency-Based

Grammars", A. Polguere and S. Kahane (eds.),

University of Montreal, Montreal, 1998

M.Plátek, T.Holan, V.Kuboň :

On Relax-ability of Word-Order

by D-grammars., In:

Combinatorics, Computability and Logic,

C.S. Calude and M.J. Deneen (eds.),

Springer Verlag, Berlin, 2001, pp. 159-174

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 (20.05.2004)

1. Repetition of the main results from 'Formal dependency syntax I'.

2. Classical models of dependency grammars.

3. Dependency grammars and Chomsky hierarchy.

4. Relaxed dependency grammars.

5. Measures of the freedom and complexity of the word-order.

6. Hierarchies related to the measures of complexity.

7.Algorithms of syntactic analysis and their parameters.