Grammatical Inference: a Tutorial

author: Colin de la Higuera, University Jean Monnet, St Etienne

Description

The leactures will introduce the key ideas of grammatical inference and concentrate specially on the algorithmic aspects. Some algorithms that will be described are: The "State merging" family : Gold, Rpni, Edsm... The "Window" languages : Local and k-testable Learning with queries.

Categories

Top: Computer Science: Machine Learning: Human Language Technology

You might be experiencing some problems with Your Video player.

*Slides*
0:06	Grammatical inference: techniques and algorithms
0:33	Acknowledgements
1:48	Outline
2:38	1 How do we learn languages?
2:46	The problem:
3:15	The data
3:45	Hopefully something like this:
4:33	TITLE
5:15	Further arguments (1)
7:08	Further arguments (2)
8:24	Further arguments (3)
9:46	Further arguments (4)
10:29	Further arguments (5)
11:34	Further arguments (6)
12:33	Further arguments (7)
13:53	Our goal/idea
14:59	Better said
16:02	What do people know about formal language theory?
17:05	A crash course in Formal language theory
17:15	Symbols
17:26	Languages
17:38	Special languages
18:17	DFA: Deterministic Finite State Automaton
18:53	b
19:24	What is a context free grammar?
19:50	Example of a grammar
20:22	Derivations and derivation trees
21:42	Chomsky Hierarchy
22:31	Chomsky Hierarchy
24:30	The membership problem
25:59	The equivalence problem
27:35	b
28:42	0.1
30:03	What is nice with grammars?
34:02	What is not so nice with grammars?
37:39	2 Specificities of grammatical inference
38:25	The field
43:38	The data
44:11	Alternatives to grammatical inference
45:15	Examples of strings
47:10	TITLE
48:24	TITLE
49:29	>A BAC=41M14 LIBRARY=
49:33	TITLE
52:48	TITLE
52:50	TITLE
52:56
53:03
54:41	TITLE
55:33	A logic program learned by GIFT
57:43	3 Hardness of the task
59:20	Alternatives to answer these questions:
59:47	Use well admitted benchmarks
60:24	Build your own benchmarks
60:36	Solve a real problem
60:51	Theory
63:53	Identification in the limit
66:34	L is identifiable in the limit in terms of G from Pres iff LL, f Pres(L)
69:39	No quería componer otro Quijote —lo cual es fácil— sino el Quijote. Inútil agregar que no encaró nunca una transcripción mecánica del original; no se proponía copiarlo. Su admirable ambición era
72:07	4 Algorithmic ideas

Lecture rating

People found this lecture:
Worth seeing
because it is:
Valuable and informative
Well presented
Easily understandable
Acceptably recorded
You need to login to cast your vote.

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.