7 Million Study Materials
From students who've taken these classes before
From students who've taken these classes before
24/7 Access to Tutors
Personal attention for all your questions
Personal attention for all your questions
Learn
93% of our members earn better grades
93% of our members earn better grades
Washington | LING 472
Intr To Comput Ling
19 sample documents related to LING 472
-
Washington LING 472
okay, I guess I need to meet with you for about two hours during the week? when is a good time for you. well, on the ninth and the eleventh I am free, in the afternoons after noon. how does that sound for you. I, will be out of town, on, the ninth an -
Washington LING 472
Assignment 3, Part I: Ngrams. 1. In your own words, what are the purposes of each of these flags? In ngram-count a. -text b. -order c. -wbdiscount d. -lm In ngram a. -lm b. -or -
Washington LING 472
NB: This is not a linguistically adequate grammar, even for the small fragment it covers. In order to keep the phrasal productions strictly binary branching, I have introduced several oddities. It should suce, however, for the purposes of the assignm -
Washington LING 472
Ling/CSE 472: Intro to Computational Linguistics March 30, 2009 Introduction, overview Preview: regular languages Overview What is computational linguistics Whos here Syllabus Showing a computer whos boss Preview: Regular languages What is Com -
Washington LING 472
the inconsiderate waiter , by j . m . barrie frequently i have to ask myself in the street for the name of the man i bowed to just now , and then , before i can answer , the wind of the first corner blows him from my memory . i have a theory , howe -
Washington LING 472
Cancel, Cancel, Cancel my order placed on 10/03/01 I need someone to look into canceling my order immediately. Immediately cancel my order that I placed over the website. I need my order cancelled. Cancel my order please. I placed it on the website, -
Washington LING 472
Chapter 2 Regular Expressions & Finite State Automata April 1, 2009 Announcement Assignment 1 posted Due April 8 Overview Formal laguages (review) Why FSAs? Formal definition of regular languages (reprise) Extension to regular expressions Fi -
Washington LING 472
N-grams April 13, 2009 Overview N-grams motivation Basic N-gram counts Training and test sets Entropy and perplexity Smoothing Why Example strategies Interpolation and Backoff Discussion/comprehension questions Language models Given a sa -
Washington LING 472
Finite State Morphological Parsing April 8, 2009 Overview Re/overview: Finite state methods in morphology FSTs for spelling change rules XFST demo Ambiguity Lexicon-free morphology Detection and correction of spelling errors Review: FSAs and -
Washington LING 472
Part-of-Speech Tagging II April 20, 2009 Overview Transformation-based tagging Advanced Issues Tag indeterminacy Unknown words Highly inflected languages The noisy channel model (for spelling) Transformation-based tagging Combines elements -
Washington LING 472
Feature Structures May 6, 2009 Overview Review: Problems with CFG One solution: feature structures and unification An aside on modeling language Practice with Unification (pizza) Concepts relating to feature structures Feature structures in th -
Washington LING 472
A. 1. Why are there more edges in the chart than nodes in the tree for \"Kim snores in Oslo\"? 2. Are the `extra\' edges warranted? 3. Why or why not? 4. Why are there more edges in the chart than nodes in the tree for \"Kim adores snow\"? 5. A -
Washington LING 472
Statistical Parsing April 29, 2009 Overview Why probabilistic parsing? PCFGs Using the probabilities Learning the probabilities Probabilistic CKY Beyond CFGs Evaluating parsers Human sentence processing Why probabilistic parsing? Ambiguity -
Washington LING 472
the adventure of the abbey grange it was on a bitterly cold night and frosty morning , towards the end of the winter of \' 97 , that i was awakened by a tugging at my shoulder . it was holmes . the candle in his hand shone upon his eager , stoop -
Washington LING 472
Parsing April 27, 2009 Overview Review: CFGs, basic top-down parser Dynamic programming CKY algorithm Earley algorithm Chart parsing Finite-state parsing Problems with TOP-DOWN-PARSE Infinite loops with left-recursive grammars Ambiguity In -
Washington LING 472
Language and Complexity May 13, 2009 Overview Left over: Long Distance Dependencies The Chomsky hierarchy The pumping lemma Is natural language regular? Is natural language context-free? Complexity and human processing Long distance dependenc -
Washington LING 472
Unification May 11, 2009 Outline of today\'s lecture Review Using types to capture generalizations A unification algorithm Integrating a unifier into the Earley parser Further issues that arise in parsing with unification Using features and uni -
Washington LING 472
Computational Semantics May 27, 2009 Overview Review: semantic analysis Quantifier scope Cooper storage Hole semantics Unification-based Semantic Analysis Idioms and compositionality Semantic augmentations S NP VP NP Det N NP PN VP V VP -
Washington LING 472
Computational Semantics May 20, 2009 Overview Finishing representations: Description Logics Syntax-driven semantic analysis Semantic augmentations to syntactic rules Preview: Quantifier scope ambiguity Slot-filler representations Alternatives
7,000,000 study materials • 24/7 tutors • earn better grades