forked from pnugues/edan20
-
Notifications
You must be signed in to change notification settings - Fork 0
/
lectures.xml
executable file
·1601 lines (1600 loc) · 81 KB
/
lectures.xml
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xml:lang="en" xmlns="http://www.w3.org/1999/xhtml">
<head>
<title>Lectures</title>
</head>
<body>
<!--<h1>Lectures</h1>-->
<p>
<b>This page is provisional. It will be updated in due time.</b>
</p>
<p>
I will live stream the lectures. The Zoom link is:
<br/>
https://lu-se.zoom.us/j/67450590401?pwd=K2hmMXpIMG1Zb0ZWUE96Mzd5Mnp1UT09
<br/>Enter the password: 75012
</p>
<p>I opened a chat room so that students can discuss topics regarding the course and the labs.
The link is:
<br/>
https://lu-se.zoom.us/j/64335139506?pwd=WDJaeUtBcnJsQ2c2K2tMVG9jcUJ1UT09
<br/>Enter the password: 75019
<br/>It is only open to Lund University registered students
</p>
<h2><a name="content"></a>Contents
</h2>
<table>
<tr>
<td>
<ul>
<li>
<a href="./#ch01">Ch. 1: An overview of language processing</a>
</li>
<li>
<a href="./#ch02">Ch. 2: Corpus processing tools</a>
</li>
<li>
<a href="#ch03">Ch. 3: Encoding and annotation schemes</a>
</li>
<li>
<a href="#ch04">Ch. 4: Topics in information theory and machine learning</a>
</li>
<li>
<a href="#ch05">Ch. 5: Counting words</a>
</li>
<li>
<a href="#ch06">Ch. 6: Words, parts of speech, and morphology</a>
</li>
<li>
<a href="#ch07">Ch. 7: Part-of-speech tagging using rules</a>
</li>
<li>
<a href="#ch08">Ch. 8: Part-of-speech tagging using stochastic techniques</a>
</li>
<li>
<a href="#ch09">Ch. 9: Phrase-structure grammars in Prolog</a>
</li>
</ul>
</td>
<td>
<ul>
<li>
<a href="#ch10">Ch. 10: Partial parsing</a>
</li>
<li>
<a href="#ch11">Ch. 11: Syntactic formalisms</a>
</li>
<li>
<a href="#ch12">Ch. 12: Constituent parsing</a>
</li>
<li>
<a href="#ch13">Ch. 13: Dependency parsing</a>
</li>
<li>
<a href="#ch14">Ch. 14: Semantics and predicate logic</a>
</li>
<li>
<a href="#ch15">Ch. 15: Lexical semantics</a>
</li>
<li>
<a href="#ch16">Ch. 16: Discourse</a>
</li>
<li>
<a href="#ch17">Ch. 17: Dialogue</a>
</li>
<li>
<a href="#ch_speech_synth">Compl.: Speech synthesis</a>
</li>
<li>
<a href="#ch_speech_rec">Compl.: Speech recognition</a>
</li>
</ul>
</td>
</tr>
</table>
<h2>
<a href="#content">^</a>
<a name="ch01"></a>Chapter 1: An overview of language processing (30/08/2021) [<a
href="http://link.springer.com/content/pdf/10.1007/978-3-642-41464-0_1.pdf">pdf</a>] [first ed. <a
href="http://link.springer.com/content/pdf/10.1007/3-540-34336-9_1.pdf">pdf</a>]
</h2>
<!--F 1 Cours 1-->
<ul>
<li>Contents: Presentation of language processing, applications, disciplines of linguistics</li>
<li>Lecture slides: [<a href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_ch01.pdf">pdf</a>].
</li>
<li>Application examples:
<ul>
<li>
<a href="http://ieeexplore.ieee.org/xpl/tocresult.jsp?reload=true&isnumber=6177717">Watson
</a>
from IBM: Question answering on <i>Jeopardy!</i>, a <a
href="https://www.youtube.com/watch?v=WFR3lOm_xhE">footage
</a> from the show, and an <a href="http://www.youtube.com/watch?v=3G2H3DZ8rNc">overview</a>.
</li>
<li>
<a href="http://nlp.cs.lth.se/">Carsim</a>
from LTH
</li>
<li>
<a href="http://project.sol.lu.se/DirektProfil/">Direkt Profil</a>
from Lund university
</li>
<li>The
<a href="http://research.microsoft.com/research/pubs/view.aspx?pubid=439">Persona project</a>
from
<a href="http://research.microsoft.com/">Microsoft Research</a>
</li>
<li>A video of
<a href="http://www.speech.kth.se/higgins/">Higgins</a>
</li>
<li>a video of
<a href="http://fileadmin.cs.lth.se/cs/Personal/Pierre_Nugues/Video/ulysse.avi">Ulysse</a>.
</li>
</ul>
</li>
<li>General resources:
<ul>
<li>
<a href="http://www.wikipedia.org/">Wikipedia</a>
</li>
<li>
<a href="https://www.aclweb.org/anthology/">ACL anthology</a>
</li>
<!--<li><a href="http://clair.si.umich.edu/clair/anthology/index.cgi">ACL anthology network</a>, a site to assess research trends from ACL-related conferences. For instance: impact of papers published in
<a href="http://clair.si.umich.edu/clair/anthology/rank.cgi?release_year=2009&type=Paper&stat=Incoming+Citations&limit=1000&year=1978">1978</a>,
<a href="http://clair.si.umich.edu/clair/anthology/rank.cgi?release_year=2009&type=Paper&stat=Incoming+Citations&limit=1000&year=1988">1988</a>,
<a href="http://clair.si.umich.edu/clair/anthology/rank.cgi?release_year=2009&type=Paper&stat=Incoming+Citations&limit=1000&year=1998">1998</a>, and
<a href="http://clair.si.umich.edu/clair/anthology/rank.cgi?release_year=2009&type=Paper&stat=Incoming+Citations&limit=1000&year=2008">2008</a>.
</li>-->
</ul>
</li>
<li>Research opportunities:
<ul>
<li>Companies:
<a href="http://research.microsoft.com/">Microsoft research</a>,
<a href="http://research.google.com/">Research at Google</a>,
<a href="http://www.research.ibm.com/">IBM research</a>,
<a href="http://research.yahoo.com/">Yahoo Research</a>,
</li>
<li>Lists: <a href="http://www.hit.uib.no/corpora/">Corpora</a>, <a href="http://www.elsnet.org/">
ELSNET</a>,
<a href="http://listes.cines.fr/arc/ln">LN</a>
</li>
</ul>
</li>
<li>Associations:
<a href="http://www.aclweb.org/">ACL</a>,
<a href="http://www.atala.org/">ATALA</a>,
<a href="http://www.gscl.org/">GSCL</a>.
</li>
</ul>
<h2>
<a href="#content">^</a>
<a name="ch02"></a>Chapter 2: Corpus processing tools (30/08/2021 and 2/09/2021) [<a
href="http://link.springer.com/content/pdf/10.1007/978-3-642-41464-0_2.pdf">pdf</a>] [first ed. <a
href="http://link.springer.com/content/pdf/10.1007/3-540-34336-9_2.pdf">pdf</a>]
</h2>
<!--F 1 2 Cours 1 Cours 2-->
<ul>
<li>Contents:
<ul>
<li>Regular expressions</li>
<li>Automata</li>
<li>An introduction to Python</li>
<li>Concordances</li>
<li>Approximate string matching</li>
</ul>
</li>
<li>Lecture slides [<a href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_ch02.pdf">pdf</a>].
</li>
<li>Programs:
<ol>
<li>Python
<ul>
<li>Short programs to illustrate regular expressions and pattern matching [<a
href="https://github.com/pnugues/ilppp/tree/master/programs/ch02/python">2</a>].
They
include a Jupyter notebook, where you can run regular expressions interactively.
</li>
<li>Concordances [<a
href="https://github.com/pnugues/ilppp/blob/master/programs/ch02/python/concord.py">
10</a>]
</li>
<li>Minimum edit distance [<a
href="https://github.com/pnugues/ilppp/blob/master/programs/ch02/python/min_edit.py">
11</a>]
</li>
<li>A concise and elegant <a href="http://norvig.com/spell-correct.html">spelling
corrector
</a> in
Python by <a href="http://norvig.com/">Peter Norvig</a> and a variation of it in Prolog: <a
href="https://github.com/pnugues/Spelling-Corrector-in-Prolog">Spelling
corrector in
Prolog</a>.
</li>
</ul>
</li>
<li>Prolog
<ul>
<li>An elementary automaton in Prolog [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch02/automaton.pl">
1</a>]
</li>
<li>Searching edits in Prolog [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch02/min_edit.pl">
12</a>]
</li>
</ul>
</li>
</ol>
</li>
<li>Corpora:
<ul>
<li>
<em>
<a href="http://www.corpusthomisticum.org/">Corpus thomisticum</a>
</em>
, the first electronic corpus compiled by <a href="http://en.wikipedia.org/wiki/Roberto_Busa">
Roberto Busa</a>.
</li>
<li>A <a href="http://vulsearch.sourceforge.net/cgi-bin/vulsearch">modern concordance</a> to the
Clementine Vulgate.
</li>
<li>The
<a href="http://ota.ahds.ac.uk/">Oxford text archive</a>,
<a href="http://www.cnrtl.fr/">Centre National des Ressources Textuelles et Lexicales</a>,
<a href="http://www.gutenberg.org/">Project Gutenberg</a>,
<a href="https://archive.org/">the Internet archive</a>,
the <a href="http://www.lysator.liu.se/runeberg/">Runeberg project</a>,
<a href="http://gallica.bnf.fr/">Gallica</a>.
</li>
</ul>
</li>
<li>Demonstrations:
<ul>
<li><a href="http://regex101.com/">Regex 101</a>, an online regex tester.
</li>
<!--<li><a href="http://osteele.com/tools/reanimator/">reAnimator</a>, A compiler of regular expressions that visualizes the resulting finite-state automata.
</li>-->
<li>Concordances and collocations:
<ul>
<li>
<a href="http://www.corpusthomisticum.org/it/">
<em>Corpus thomisticum</em>
</a>
</li>
<li>Many <a href="http://corpus.byu.edu/">corpora from Brigham-Young</a>, such as the <a
href="http://corpus.byu.edu/coca/">corpus of contemporary American English</a>,<a
href="http://spraakbanken.gu.se/">Språkbanken</a>, <a
href="http://www.cnrtl.fr/concordance/">CNRTL</a>.
<!--, and
<a href="http://www.collinslanguage.com/wordbanks/">Collins COBUILD</a>-->
</li>
<li><a href="http://www.google.com/">Google</a>, one of the largest concordancers to date.
</li>
</ul>
</li>
</ul>
</li>
<li>Software:
<ul>
<li><a href="http://www.openfst.org/">OpenFst</a>, a library for constructing weighted finite-state
transducers in C++ with bindings in Python
</li>
<li><a href="http://www.let.rug.nl/vannoord/Fsa/">FSA</a>, finite state automata utilities in Prolog
</li>
</ul>
</li>
<li>Documents:
<ul>
<li>Interesting tutorials by
<a href="http://www.cs.jhu.edu/~kchurch/">Ken Church</a>
</li>
<li>Another interesting
<a href="http://acl.ldc.upenn.edu/J/J96/J96-4002.pdf">paper</a>
on an algorithm to align words for historical comparison by
<a href="http://www.ai.uga.edu/mc/">Michael Covington</a>
</li>
</ul>
</li>
</ul>
<h2>
<a href="#content">^</a>
<a name="ch03"></a>Chapter 3: Encoding and annotation schemes (3/09/2020) [<a
href="http://link.springer.com/content/pdf/10.1007/978-3-642-41464-0_3.pdf">pdf</a>] [first ed. <a
href="http://link.springer.com/content/pdf/10.1007/3-540-34336-9_3.pdf">pdf</a>]
</h2>
<!--F 2 Cours 2-->
<ul>
<li>Contents:
<ul>
<li>Character sets and Unicode</li>
<li>Mark-up languages and XML</li>
</ul>
</li>
<li>Lecture slides: [<a href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_ch03.pdf">pdf</a>].
</li>
<li>Resources:
<ul>
<li>Unicode: the
<a href="http://www.unicode.org/">Unicode consortium</a>
and
<a href="http://site.icu-project.org/">international components for Unicode</a>
</li>
<li>XML: the
<a href="http://www.w3.org/XML/">XML site</a>
at W3C
</li>
<li>XML in text processing: The <a href="http://www.tei-c.org/index.xml">Text encoding
initiative</a>, <a href="http://www.docbook.org/">DocBook</a>, the <a
href="http://www.idpf.org/">International Digital Publishing Forum</a>.
</li>
</ul>
</li>
<li>Programs:
<ul>
<li>The programs of this chapter [<a
href="https://github.com/pnugues/ilppp/tree/master/programs/ch03/python">1</a>]
</li>
</ul>
</li>
</ul>
<h2>
<a href="#content">^</a>
<a name="ch04"></a>Chapter 4: Topics in information theory and machine learning (7/09/2020) [<a
href="http://link.springer.com/content/pdf/10.1007/978-3-642-41464-0_4.pdf">pdf</a>] [first ed. <a
href="http://link.springer.com/content/pdf/10.1007/3-540-34336-9_3.pdf">pdf</a>]
</h2>
<!--F 2 Cours 2-->
<ul>
<li>Contents:
<ul>
<li>Topics in information theory</li>
<!--<li>Entropy and decision trees</li>-->
<li>Using scikit learn, a popular machine learning toolkit</li>
</ul>
</li>
<li>Lecture slides: [<a href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_ch04.pdf">pdf</a>].
</li>
<li>Resources:
<ul>
<li>Machine-learning software:
<ul>
<li><a href="http://scikit-learn.org">scikit learn</a>, an excellent data mining software
for Python
</li>
<li><a href="http://www.rulequest.com/Personal/">C4.5</a>, ID3's successor, by Ross Quinlan
</li>
<li><a href="http://www.cs.waikato.ac.nz/ml/weka/">Weka</a>, a comprehensive data mining
software in Java
</li>
<li><a href="http://www.csie.ntu.edu.tw/%7Ecjlin/libsvm/">LIBSVM</a>, an efficient
implementation of support vector machines.
</li>
<li><a href="http://www.csie.ntu.edu.tw/%7Ecjlin/liblinear/">LIBLINEAR</a>, a library for
large linear classification.
</li>
</ul>
</li>
<li>Courses on machine learning:
<ul>
<li>At Stanford:
<a href="http://www.stanford.edu/class/cs229/">CS229</a>
</li>
<li>At Carnegie Mellon:
<a href="http://select.cs.cmu.edu/class/10701-F09/index.html">10-701</a>
</li>
<li>An interesting blog:
<a href="http://mechanistician.blogspot.com/">Mechanistician</a>
</li>
</ul>
</li>
</ul>
</li>
</ul>
<h2>
<a href="#content">^</a>
<a name="ch05"></a>Chapter 5: Counting words (7, 10, and 14/09/2020) [<a
href="http://link.springer.com/content/pdf/10.1007/978-3-642-41464-0_5.pdf">pdf</a>] [first ed. <a
href="http://link.springer.com/content/pdf/10.1007/3-540-34336-9_4.pdf">pdf</a>]
</h2>
<!--F 3 Cours 3-->
<ul>
<li>Contents:
<ul>
<li>Tokenization</li>
<li><em>N</em>-grams
</li>
<li>Counting words and
<em>N</em>-grams
</li>
<li>Probability of a word sequence</li>
<li>Smoothing</li>
<li>Collocations and other statistics</li>
<li>Embeddings</li>
</ul>
</li>
<li>Lecture slides: Three parts: [<a
href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_ch05_1.pdf">pdf</a>],
[<a href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_ch05_2.pdf">pdf</a>],
[<a href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_ch05_3.pdf">pdf</a>].
</li>
<li>Python programs:
<ul>
<li>The notesbooks of this chapter:
[<a href="https://github.com/pnugues/ilppp/blob/master/programs/ch05/python/ch05-1.ipynb">1</a>],
[<a href="https://github.com/pnugues/ilppp/blob/master/programs/ch05/python/ch05-2.ipynb">2</a>],
and
[<a href="https://github.com/pnugues/ilppp/blob/master/programs/ch05/python/ch05-3.ipynb">3</a>]
</li>
<li>Simple tokenizers [<a
href="https://github.com/pnugues/ilppp/blob/master/programs/ch05/python/tokenize_simple.py">
1a</a>], [<a
href="https://github.com/pnugues/ilppp/blob/master/programs/ch05/python/tokenizer.py">1b</a>]
and a more complex one by Gregory Grefenstette [<a
href="https://github.com/pnugues/ilppp/blob/master/programs/ch05/python/token_grefenstette.py">
2</a>]
</li>
<li>Another popular tokenizer by Robert MacIntyre, original version in sed [<a
href="http://www.cis.upenn.edu/%7Etreebank/tokenization.html">3</a>] and its translation in
Perl [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch04/token_perl_macintyre.pl">
4</a>]
</li>
<li>Counting unigrams [<a href="https://github.com/pnugues/ilppp/blob/master/programs/ch05/python/">
5</a>] and bigrams [<a
href="https://github.com/pnugues/ilppp/blob/master/programs/ch02/python/count_bigram.py">
6</a>]
</li>
<li>Mutual information [<a
href="https://github.com/pnugues/ilppp/blob/master/programs/ch05/python/mutual_info.py">
7</a>],
<em>t</em>-scores [<a
href="https://github.com/pnugues/ilppp/blob/master/programs/ch05/python/t_scores.py">
8</a>], and the log-likelihood ratio [<a
href="https://github.com/pnugues/ilppp/blob/master/programs/ch05/python/likelihood_ratio.py">
9</a>].
</li>
</ul>
</li>
<li>Java programs to tokenize text, count words and bigrams [<a
href="https://github.com/pnugues/ilppp/tree/master/programs/java/src/lppp/ch05">Java</a>]. Run them
on your corpus. You can count the words from the output of the tokenization program using the Unix <tt>
sort
</tt> and <tt>uniq</tt> commands
</li>
<li>Demonstrations:
<ul>
<li>A
collocation <a
href="https://corpora.linguistik.uni-erlangen.de/cgi-bin/demos/Web1T5/Web1T5_colloc.perl">
demo
</a> from
from the Corpus Linguistics group at FAU Erlangen-Nürnberg.
</li>
</ul>
</li>
<li>Software and resources:
<ul>
<li>
<a href="http://googleresearch.blogspot.com/2006/08/all-our-n-gram-are-belong-to-you.html"><i>
N</i>-grams
</a>
at Google Research and
<a href="http://research.microsoft.com/web-ngram"><i>N</i>-grams
</a>
at Microsoft Research.
</li>
<li>A journalist's <a href="http://www.wired.com/magazine/2010/02/ff_google_algorithm/all/1">
account
</a> from <a href="http://www.wired.com/">wired.com</a> on how Google uses bigrams in its search
engine.
</li>
<li>The
<a href="http://www.speech.sri.com/projects/srilm/">SRI language modeling toolkit</a>
</li>
<li>The
<a href="http://www.speech.cs.cmu.edu/SLM_info.html">CMU-Cambridge statistical language modeling
toolkit
</a>
</li>
</ul>
</li>
</ul>
<h2>
<a href="#content">^</a>
<a name="ch06"></a>Chapter 6: Words, parts of speech, and morphology (14/09/2020) [<a
href="http://link.springer.com/content/pdf/10.1007/978-3-642-41464-0_6.pdf">pdf</a>] [first ed. <a
href="http://link.springer.com/content/pdf/10.1007/3-540-34336-9_5.pdf">pdf</a>]
</h2>
<!--F 6 Cours 4 Cours 6-->
<ul>
<li>Contents:
<ul>
<li>Dictionaries</li>
<li>Morphology</li>
<li>Transducers</li>
</ul>
</li>
<li>Lecture slides: [<a href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_ch06.pdf">pdf</a>]
</li>
<li>Additional slides on the Prolog language [<a
href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_prolog_slides.pdf">pdf</a>].
</li>
<li>Prolog programs:
<ul>
<li>Building and searching a letter tree (trie) [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch05/trie.pl">1</a>]
</li>
<li>A transducer modeling the future tense of regular French verbs [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch05/transduce.pl">2</a>].
</li>
</ul>
</li>
<li>Grammar resources and history:
<ul>
<li>
<a href="http://www.hs-augsburg.de/~harsch/graeca/Chronologia/S_ante02/DionysiosThrax/dio_tech.html">
Tecknè</a>, the first grammar of Greek, by
<a href="http://en.wikipedia.org/wiki/Dionysius_Thrax">Dionysius Thrax</a>, who created concepts
we still use today
</li>
<li>
<a href="http://htl2.linguist.jussieu.fr:8080/CGL/text.jsp?id=T28">
<em>De partibus orationis ars minor</em>
</a>
, the most popular grammar in the west in the Middle ages by
<a href="http://en.wikipedia.org/wiki/Aelius_Donatus">Aelius Donatus</a>
</li>
<li>An
<a href="http://www.ucl.ac.uk/internet-grammar">introduction to the grammar of English</a>
from
<a href="http://www.ucl.ac.uk/">University College London</a>.
</li>
</ul>
</li>
<li>Software:
<ul>
<li><a href="https://software.sil.org/pc-kimmo/">PC-Kimmo</a>, a morphological parser from the
<a href="https://www.sil.org/">Summer Institute of Linguistics</a>.
</li>
<li>The
<a href="http://www.ling.helsinki.fi/kieliteknologia/tutkimus/hfst/">Helsinki Finite-State
Transducer
</a>
software, a toolkit to implement morphological parsers based on weighted and unweigted
finite-state transducers.
</li>
<li><a href="https://unitexgramlab.org/">Unitex</a>, a corpus processing system using
automata and transducers from Université de Marne-la-Vallée
</li>
</ul>
</li>
<li>Demonstrations:
<ul>
<li>The Xerox site on
<a href="http://open.xerox.com/Services/fst-nlp-tools">multilingual content analysis</a>.
</li>
<li>The
<a href="http://www2.lingsoft.fi/demos.html">Swedish morphological parser</a>
from
<a href="http://www.lingsoft.fi/">Lingsoft</a>
</li>
<li>The
<a href="http://www.canoonet.eu">German morphological parser</a>
from Canoo.
</li>
</ul>
</li>
</ul>
<h2>
<a href="#content">^</a>
<a name="ch07"></a>Chapter 7: Part-of-speech tagging using rules (17/09/2020) [<a
href="http://link.springer.com/content/pdf/10.1007/978-3-642-41464-0_7.pdf">pdf</a>] [first ed. <a
href="http://link.springer.com/content/pdf/10.1007/3-540-34336-9_6.pdf">pdf</a>]
</h2>
<!--F 6 Cours 4-->
<ul>
<li>Contents:
<ul>
<li>Part-of-speech tagging with symbolic rules</li>
<li>Annotation standards for parts of speech (tagsets)</li>
</ul>
</li>
<li>Lecture slides: [<a href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_ch07.pdf">pdf</a>].
</li>
<li>Annotation manuals and corpora:
<ul>
<li>
<a href="https://universaldependencies.org/">The universal dependencies</a>:
Multilingual annotated corpora
</li>
<li><a href="http://www.natcorp.ox.ac.uk/">BNC</a>, the British national corpus, an annotated corpus
in English following the text encoding initiative (TEI).
</li>
<li><a href="https://spraakbanken.gu.se/eng/resources/suc">SUC</a>, the Stockholm-Umeå corpus,
an annotated corpus in Swedish
</li>
<li><a href="http://www.coli.uni-saarland.de/projects/sfb378/negra-corpus/negra-corpus.html">
Negra</a>, an annotated corpus in German
</li>
<li>An
<a href="http://www.stanford.edu/dept/linguistics/corpora/inventory.html">inventory</a>
of available corpora compiled by a group at Stanford.
</li>
</ul>
</li>
<li>Software:
<ul>
<li>The
<a href="http://www.cs.cmu.edu/afs/cs/project/ai-repository/ai/areas/nlp/parsing/taggers/brill/0.html">
historical Brill's tagger
</a>
in Lisp.
</li>
<li>An
<a href="http://www.cs.jhu.edu/%7Erflorian/fntbl/">implementation of Brill's tagger</a>
in C++ by Radu Florian.
</li>
</ul>
</li>
</ul>
<h2>
<a href="#content">^</a>
<a name="ch08"></a>Chapter 8: Part-of-speech tagging using stochastic techniques (17/09/2020) [<a
href="http://link.springer.com/content/pdf/10.1007/978-3-642-41464-0_8.pdf">pdf</a>] [first ed. <a
href="http://link.springer.com/content/pdf/10.1007/3-540-34336-9_7.pdf">pdf</a>]
</h2>
<!--F 6 Cours 6-->
<ul>
<li>Contents:
<ul>
<li>Stochastic tagging</li>
<li>Markov models</li>
<li>Tagging with decision trees</li>
<li>Application: Language models for machine translation</li>
</ul>
</li>
<li>Lecture slides: [<a href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_ch08.pdf">pdf</a>].
</li>
<li>Demonstrations:
<ul>
<li>The Xerox site on
<a href="http://open.xerox.com/Services/fst-nlp-tools">multilingual content analysis.</a>
</li>
<li>
<a href="http://www.lsi.upc.edu/~nlp/SVMTool/demo.php">Demonstrations</a>
from Universitat politècnica de Catalunya.
</li>
<li>
<a href="http://skrutten.nada.kth.se/grim/">GRIM</a>
from the KTH.
</li>
</ul>
</li>
<li>Software:
<ul>
<li>The
<a href="ftp://parcftp.xerox.com/pub/tagger/">historical Xerox tagger</a>
based on hidden Markov models in Lisp.
</li>
<li><a href="http://www.ims.uni-stuttgart.de/projekte/corplex/TreeTagger/DecisionTreeTagger.html">
TreeTagger</a>, a multiligual tagger using decision trees from Helmut Schmid.
</li>
<li><a href="ftp://ftp.cis.upenn.edu/pub/adwait/jmx/jmx.tar.gz">MXPOST</a>, an efficient tagger from
<a href="http://sites.google.com/site/adwaitratnaparkhi/">Adwait Ratnaparkhi</a>.
</li>
<li><a href="http://www.lsi.upc.es/%7Enlp/SVMTool/">SVMTool</a>, a tagger using support vector
machines from Universitat politècnica de Catalunya.
</li>
<li>A <a href="http://www.csc.kth.se/tcs/humanlang/tools.html">part-of-speech tagger</a> and other
tools for Swedish from KTH.
</li>
<li>Stagger: another <a href="http://www.ling.su.se/english/nlp/tools/stagger">part-of-speech
tagger
</a> for Swedish.
</li>
<li><a href="http://www.fjoch.com/">GIZA++</a>, a software to train translation models from Franz
Josef Och.
</li>
</ul>
</li>
</ul>
<h2>
<a href="#content">^</a>
<a name="ch09"></a>Chapter 9: Phrase-structure grammars in Prolog (not taught in 2020) [<a
href="http://link.springer.com/content/pdf/10.1007/978-3-642-41464-0_9.pdf">pdf</a>] [first ed. <a
href="http://link.springer.com/content/pdf/10.1007/3-540-34336-9_8.pdf">pdf</a>]
</h2>
<!--F 5 6 Cours 4-->
<ul>
<li>Contents:
<ul>
<li>Constituents, trees</li>
<li>Using Prolog to do natural language analysis, DCG rules, variables</li>
<li>Getting the syntactic structure</li>
<li>Compositional analysis to get the semantic structure</li>
</ul>
</li>
<li>Lecture slides: [<a href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_ch09.pdf">pdf</a>]
</li>
<li>Prolog programs:
<ul>
<li>Two small DCG grammars [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch08/ch8.pl">1</a>] [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch08/ch88.pl">2</a>]
</li>
<li>A tokenizer using Prolog clauses [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch04/tokenize.pl">3</a>] and
another one using DCG rules [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch04/tokenize_dcg.pl">
4</a>].
</li>
<li>A small interpreter of regular expressions in Prolog by Robert Cameron [<a
href="http://www.cs.sfu.ca/%7Ecameron/Teaching/384/99-3/regexp-plg.html">5</a>].
</li>
</ul>
</li>
<li>Application examples:
<ul>
<li>The grammar checker in MS Word whose parser uses phrase-structure rules.</li>
<li>The
<a href="http://research.microsoft.com/nlp/">natural language group</a>
at Microsoft Research.
</li>
</ul>
</li>
</ul>
<h2>
<a href="#content">^</a>
<a name="ch10"></a>Chapter 10: Partial parsing (17 and 24/09/2020) [<a
href="http://link.springer.com/content/pdf/10.1007/978-3-642-41464-0_10.pdf">pdf</a>] [first ed. <a
href="http://link.springer.com/content/pdf/10.1007/3-540-34336-9_9.pdf">pdf</a>]
</h2>
<!--F 6 Cours 5-->
<ul>
<li>Contents:
<ul>
<li>ELIZA: word spotting and pattern matching</li>
<li>Multiwords and named entities</li>
<li>Noun groups and verb groups</li>
<li>Partial parsing: multiword and group detection in Prolog</li>
<li>Partial parsing: statistical techniques</li>
<li>Information extraction</li>
<li>Precision, recall, and
<em>F</em>-measure (harmonic mean)
</li>
</ul>
</li>
<li>Lecture slides: [<a href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_ch10.pdf">pdf</a>]
</li>
<li>Prolog programs:
<ul>
<li>Prolog predicates to write local DCG grammars with simple noun group and verb group rules [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch09/ch90.pl">1</a>].
</li>
</ul>
</li>
<li>Documents:
<ul>
<li>Many
<a href="http://www.vinartus.net/spa/publications.html">interesting papers</a>
on partial parsing by
<a href="http://www.vinartus.net/spa/">Steven Abney</a>;
</li>
<li>An application example of information extraction: the
<a href="http://www.ai.sri.com/natural-language/">FASTUS</a>
system from SRI.
</li>
<li><a href="http://nlp.cs.lth.se/">Carsim</a>, a system to generate animated 3D scenes from text
that uses information extraction techniques.
</li>
</ul>
</li>
<li>Annotated corpora and evaluation resources:
<ul>
<li>
<a href="https://www.clips.uantwerpen.be/conll2002/ner/">CoNLL-2002</a>
and <a href="https://www.clips.uantwerpen.be/conll2003/ner/">CoNLL-2003</a> on
language-independent
named entity recognition: Spanish, Dutch, English, and German.
</li>
<li>
<a href="https://www.clips.uantwerpen.be/conll2000/chunking/">CoNLL-2000</a>
on chunking and <a href="http://www.clips.uantwerpen.be/conll99/npb/">CoNLL-1999</a> on noun
phrase
chunking
</li>
<li>
<a href="http://www.clips.uantwerpen.be/conll2001/clauses/">CoNLL-2001</a>
on clause identification
</li>
</ul>
</li>
<li>Demonstrations:
<ul>
<li><a href="http://www.languagecomputer.com/index.php?page=labs">CiceroLite</a>, a system to
extract named entities
</li>
<li><a href="http://www.alchemyapi.com/api/demo.html">AlchemyAPI</a>, a system to identify people,
organizations, locations, and categorize text
</li>
<li><a href="http://www.opencalais.com/">Calais</a>, an information extraction system
</li>
<li>Visualizing and monitoring events and disasters on a map at <a
href="http://emm.newsbrief.eu/emmMap/?type=event&language=&language=all">EMM labs</a>,
part of the Europe media monitor.
The information extraction part of the <a
href="http://emm.newsbrief.eu/NewsBrief/eventedition/en/latest_en.html">event
detector</a>. A key to the
symbols used is available from <a href="http://press.jrc.it/aboutrtevents.html">this page</a>.
See also their <a href="http://emm.newsexplorer.eu/NewsExplorer/entities/en/1510.html">name
explorer</a>.
</li>
</ul>
</li>
<li>Software:
<ul>
<li><a href="http://chasen.org/%7Etaku/software/yamcha/">Yamcha</a>, an efficient chunker
</li>
<li>The <a href="http://nlp.stanford.edu/software/CRF-NER.shtml">Stanford named entity recognizer
</a> from Stanford University
</li>
<li>The <a href="http://cogcomp.cs.illinois.edu/page/demos/">Illinois named entity tagger</a> from
the University of Illinois
</li>
<li>The <a href="http://vilde.cs.lth.se:9000/#/">Langforia multilingual pipelines</a> from
Lund University
</li>
</ul>
</li>
<li>Annotation resources:
<ul>
<li>The
<a href="http://www.itl.nist.gov/iaui/894.02/related_projects/muc/index.html">MUC</a>
site;
</li>
<li><a href="http://www.limsi.fr/Individu/anne/Guide/PEAS_reference_annotations_v2.2.html">PEAS</a>,
a group annotation scheme for French
</li>
<li><a href="http://www.sfs.uni-tuebingen.de/en/ascl/resources/corpora/tuepp-dz.html">
TüPP-D/Z</a>, Tübingen Partially Parsed Corpus of Written German
</li>
</ul>
</li>
</ul>
<h2>
<a href="#content">^</a>
<a name="ch11"></a>Chapter 11: Syntactic formalisms (24/09 and 01/10/2020) [<a
href="http://link.springer.com/content/pdf/10.1007/978-3-642-41464-0_11.pdf">pdf</a>] [first ed. <a
href="http://link.springer.com/content/pdf/10.1007/3-540-34336-9_10.pdf">pdf</a>]
</h2>
<!--F 8 Cours 7-->
<ul>
<li>Contents:
<ul>
<li>Constituency and dependency</li>
<li>Phrase categories</li>
<li>Unification-based grammars</li>
<li>Dependency grammars</li>
<li>Valence and subcategorization frames</li>
<li>Functions</li>
</ul>
</li>
<li>Lecture slides: [<a href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_ch11.pdf">pdf</a>]
</li>
<li>Prolog programs:
<ul>
<li>Some simple DCG rules for German noun phrases [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch10/ch71.pl">1</a>]
</li>
<li>The generalized unification [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch10/ch72.pl">2</a>].
</li>
<li>Detection of nonprojective links in a dependency tree [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch10/nonprojective_links.pl">
3</a>] and examples of graphs [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch10/dgraph_examples.pl">4</a>].
</li>
<li>A program to convert the CONLL-X file format into a Prolog clause [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch10/convert_conll_clause.pl">
5</a>]. Useful with the nonprojectivity detection.
</li>
</ul>
</li>
<li>Corpus and programming resources:
<ul>
<li>
More than 60 annotated corpora in multiple languages from the
<a href="http://universaldependencies.org/">Universal dependencies</a>
site.
</li>
<li>Four freely available annotated dependency corpora, Danish, Dutch, Portuguese, and Swedish, and
links to seven others from the
<a href="http://nextens.uvt.nl/%7Econll/post_task_data.html">CONLL-X shared task</a>.
</li>
<li>The
<a href="http://www.grsampson.net/Resources.html">Susanne corpus</a>, a free treebank for
English.
</li>
<li>A
<a href="http://www.llf.cnrs.fr/fr/Gens/Abeille/French-Treebank-fr.php">French treebank</a>
from Université Paris VII (Available with a license).
</li>
<li>
<em>
<a href="http://infolingu.univ-mlv.fr/DonneesLinguistiques/Lexiques-Grammaires/Visualisation.html">
Tables lexique-grammaire
</a>
</em>
, subcategorization frames in French available from Université de Marne-la-Vallée.
</li>
<li>The
<a href="http://nlp.cs.lth.se/software/treebank_converter/">LTH converter</a>
to convert constituent trees using the Penn Treebank annotation into dependency graphs.
</li>
</ul>
</li>
<li>Lexical and grammar resources:
<ul>
<li>The <a href="http://www.oxfordadvancedlearnersdictionary.com/">Oxford Advanced Learner's
Dictionary</a>, a dictionary listing valence patterns of English verbs.
</li>
</ul>
</li>
<li>Annotation resources:
<ul>
<li>A
<a href="http://stp.lingfil.uu.se/~nivre/swedish_treebank/">dependency annotated corpus</a>
in Swedish from
<a href="http://stp.lingfil.uu.se/%7Enivre/">Joakim Nivre</a>
</li>
<li><a href="http://code.google.com/p/whatswrong/">What's wrong with my NLP</a>, a visualizer of
dependency graphs using the CoNLL formats.
</li>
<li>A
<a href="http://mbkromann.github.io/copenhagen-dependency-treebank/">guide to annotate
dependencies
</a>
for Danish from Handelshøjskolen i København, (Copenhagen Business School).
</li>
</ul>
</li>
</ul>
<h2>
<a href="#content">^</a>
<a name="ch12"></a>Chapter 12: Constituent parsing (not taught in 2020) [<a
href="http://link.springer.com/content/pdf/10.1007/978-3-642-41464-0_12.pdf">pdf</a>] [first ed. <a
href="http://link.springer.com/content/pdf/10.1007/3-540-34336-9_11.pdf">pdf</a>]
</h2>
<!--F 9 10 Cours 7 Cours 8-->
<ul>
<li>Contents:
<ul>
<li>Top-down and bottom-up strategies</li>
<li>The shift-reduce algorithm</li>
<li>Earley's algorithm</li>
<li>Statistical parsing and PCFG</li>
</ul>
</li>
<li>Lecture slides: [<a href="https://github.com/pnugues/ilppp/blob/master/slides/EDAN20_ch12.pdf">pdf</a>]
</li>
<li>Prolog programs:
<ul>
<li>A shift-reduce parser [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch11/shift-reduce.pl">1</a>]
</li>
<li>Earley's parser [<a
href="http://fileadmin.cs.lth.se/cs/Education/EDA171/Programs/ch11/earley.pl">2</a>]
</li>
</ul>
</li>
<li>Corpus resources:
<ul>
<li>The
<a href="http://www.grsampson.net/Resources.html">Susanne corpus</a>, a free treebank for
English
</li>
<li>A