Notes on computational linguistics.pdf - UCLA Department of ...
Notes on computational linguistics.pdf - UCLA Department of ...
Notes on computational linguistics.pdf - UCLA Department of ...
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Stabler - Lx 185/209 2003<br />
Linguistics 185a/209a: Computati<strong>on</strong>al <strong>linguistics</strong> I<br />
Lecture 12-2TR in Bunche 3170 Pr<strong>of</strong>. Ed Stabler<br />
Office: Campbell 3103F Office Hours: 2-3T, by appt, or stop by<br />
x50634 stabler@ucla.edu<br />
TA: Ying Lin Discussi<strong>on</strong>: TBA<br />
Prerequisites: Linguistics 180/208, Linguistics 120b, 165b<br />
C<strong>on</strong>tents: What kind <strong>of</strong> computati<strong>on</strong>al device could use a system like a human language? This class will<br />
explore the computati<strong>on</strong>al properties <strong>of</strong> devices that could compute morphological and synactic analyses, and<br />
recognize semantic entailment relati<strong>on</strong>s am<strong>on</strong>g sentences. Am<strong>on</strong>g other things, we will explore<br />
(1) how to define a range <strong>of</strong> grammatical analyses in grammars G that are expressive enough for human<br />
languages<br />
(2) how to calculate whether a sequence <strong>of</strong> gestures, sounds, or characters s ∈ L(G) (various ways!)<br />
(3) how to calculate and represent the structures d <strong>of</strong> expressi<strong>on</strong>s s ∈ L(G) (various ways!)<br />
(importantly, we see that size(d) < size(s), for natural size measures)<br />
(4) how to calculate morpheme sequences from standard written (or spoken) text<br />
(5) how to calculate entailment relati<strong>on</strong>s am<strong>on</strong>g structures<br />
(6) how ph<strong>on</strong>ological/orthographic, syntactic, semantic analyses can be integrated<br />
(7) depending <strong>on</strong> time and interest, maybe some special topics:<br />
• how to distribute probability measures over (the possibly infinitely many) structures <strong>of</strong> L(G),<br />
and how to calculate the most probable structure d <strong>of</strong> ambiguous s ∈ L(G)<br />
• how to handle a language that is “open-ended:” new words, new c<strong>on</strong>structi<strong>on</strong>s all the time<br />
• how to handle various kinds <strong>of</strong> c<strong>on</strong>text-dependence in the inference system<br />
• how to handle temporal relati<strong>on</strong>s in the language and in inference<br />
• how to calculate certain “discourse” relati<strong>on</strong>s<br />
• tools for studying large collecti<strong>on</strong>s <strong>of</strong> texts<br />
Readings: course notes distributed during the quarter from the class web page, supplemented occasi<strong>on</strong>ally<br />
with selected readings from other sources.<br />
Requirements and grades: Grades will be based entirely <strong>on</strong> problem sets given <strong>on</strong> a regular basis (roughly<br />
weekly) throughout the quarter. Some <strong>of</strong> these problem sets will be Prolog programming exercises; some will<br />
be exercises in formal grammar. Some will be challenging, others will be easy.<br />
Graduate students are expected to do the problem sets and an additi<strong>on</strong>al squib <strong>on</strong> a short term project or<br />
study.<br />
Computing Resources: We will use SWI Prolog, which is small and available for free for MSWindows, Linux/Unix,<br />
and MacOSX from http://www.swi-prolog.org/<br />
Tree display s<strong>of</strong>tware will be based <strong>on</strong> tcl/tk, which is available for free from http://www.scriptics.com/<br />
2
Change language