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 />
C<strong>on</strong>tents<br />
1 Setting the stage: logics, prolog, theories 4<br />
1.1Summary............................................................................. 4<br />
1.2Propositi<strong>on</strong>alprolog...................................................................... 6<br />
1.3Usingprolog .......................................................................... 10<br />
1.4Somedistincti<strong>on</strong>s<strong>of</strong>humanlanguages.......................................................... 11<br />
1.5PredicateProlog ........................................................................ 13<br />
1.6Thelogic<strong>of</strong>sequences .................................................................... 18<br />
2 Recogniti<strong>on</strong>: first idea 26<br />
2.1Aprovabilitypredicate.................................................................... 27<br />
2.2Arecogniti<strong>on</strong>predicate.................................................................... 28<br />
2.3Finitestaterecognizers.................................................................... 31<br />
3 Extensi<strong>on</strong>s <strong>of</strong> the top-down recognizer 41<br />
3.1Unificati<strong>on</strong>grammars..................................................................... 41<br />
3.2Moreunificati<strong>on</strong>grammars:casefeatures ........................................................ 42<br />
3.3Recognizers:timeandspace ................................................................ 44<br />
3.4Trees,andparsing:firstidea ................................................................ 46<br />
3.5Thetop-downparser ..................................................................... 47<br />
3.6Somebasicrelati<strong>on</strong>s<strong>on</strong>trees................................................................ 48<br />
3.7Treegrammars......................................................................... 52<br />
4 Brief digressi<strong>on</strong>: simple patterns <strong>of</strong> dependency 58<br />
4.1Human-likelinguisticpatterns ............................................................... 58<br />
4.2 Semilinearity and some inhuman linguistic patterns .................................................. 60<br />
5 Trees, and tree manipulati<strong>on</strong>: sec<strong>on</strong>d idea 62<br />
5.1Nodesandleavesintreestructures ............................................................ 62<br />
5.2Categoriesandfeatures ................................................................... 64<br />
5.3Movementrelati<strong>on</strong>s...................................................................... 66<br />
6 C<strong>on</strong>text free parsing: stack-based strategies 75<br />
6.1LLparsing............................................................................ 75<br />
6.2LRparsing............................................................................ 80<br />
6.3LCparsing............................................................................ 82<br />
6.4AlltheGLCparsingmethods(the“stackbased”methods).............................................. 86<br />
6.5Oracles.............................................................................. 89<br />
6.6Assessment<strong>of</strong>theGLC(“stackbased”)parsers..................................................... 96<br />
7 C<strong>on</strong>text free parsing: dynamic programming methods 103<br />
7.1CKYrecogniti<strong>on</strong>forCFGs .................................................................. 103<br />
7.2Treecollecti<strong>on</strong> ......................................................................... 110<br />
7.3Earleyrecogniti<strong>on</strong>forCFGs ................................................................. 113<br />
8 Stochastic influences <strong>on</strong> simple language models 116<br />
8.1Motivati<strong>on</strong>sandbackground ................................................................ 116<br />
8.2Probabilisiticc<strong>on</strong>textfreegrammarsandparsing ................................................... 159<br />
8.3Multipleknowledgesources................................................................. 163<br />
8.4Nextsteps............................................................................ 166<br />
9 Bey<strong>on</strong>d c<strong>on</strong>text free: a first small step 167<br />
9.1 “Minimalist”grammars.................................................................... 168<br />
9.2CKYrecogniti<strong>on</strong>forMGs................................................................... 183<br />
10 Towards standard transformati<strong>on</strong>al grammar 198<br />
10.1Review:phrasalmovement ................................................................. 198<br />
10.2Headmovement ........................................................................ 201<br />
10.3Verbclassesandotherbasics................................................................ 209<br />
10.4Modifiersasadjuncts..................................................................... 220<br />
10.5Summaryandimplementati<strong>on</strong> ............................................................... 222<br />
10.6Someremainingissues .................................................................... 227<br />
11 Semantics, discourse, inference 231<br />
12 Review: first semantic categories 234<br />
12.1Things .............................................................................. 234<br />
12.2Properties<strong>of</strong>things...................................................................... 234<br />
12.3Unaryquantifiers,properties<strong>of</strong>properties<strong>of</strong>things ................................................. 235<br />
12.4Binaryrelati<strong>on</strong>sam<strong>on</strong>gthings ............................................................... 236<br />
12.5Binaryrelati<strong>on</strong>sam<strong>on</strong>gproperties<strong>of</strong>things....................................................... 237<br />
13 Correcti<strong>on</strong>: quantifiers as functi<strong>on</strong>als 237<br />
14 A first inference relati<strong>on</strong> 237<br />
14.1M<strong>on</strong>ot<strong>on</strong>icityinferencesforsubject-predicate...................................................... 238<br />
14.2MoreBooleaninferences ................................................................... 239<br />
15 Exercises 241<br />
15.1M<strong>on</strong>ot<strong>on</strong>icityinferencesfortransitivesentences.................................................... 242<br />
15.2M<strong>on</strong>ot<strong>on</strong>icityinference:Amoregeneralandc<strong>on</strong>ciseformulati<strong>on</strong> ......................................... 243<br />
16 Harder problems 246<br />
16.1Semanticcategories...................................................................... 246<br />
16.2C<strong>on</strong>textualinfluences..................................................................... 249<br />
16.3Meaningpostulates ...................................................................... 250<br />
16.4Scopeinversi<strong>on</strong>......................................................................... 252<br />
16.5Inference............................................................................. 254<br />
17 Morphology, ph<strong>on</strong>ology, orthography 259<br />
17.1Morphologysubsumed .................................................................... 259<br />
17.2Asimpleph<strong>on</strong>ology,orthography ............................................................. 263<br />
17.3Bettermodels<strong>of</strong>theinterface................................................................ 265<br />
18 Some open (mainly) formal questi<strong>on</strong>s about language 267<br />
1