Skip to content
Permalink
Browse files

start 2019 revisions; finish preface & chapter 1

  • Loading branch information...
thomas--graf committed Jan 25, 2019
1 parent d60f92b commit bfa9077978786ee23c8196ecb025b7ed5fe20a59
Showing with 1,432 additions and 463 deletions.
  1. +151 −28 bib/universal.bib
  2. +25 −0 code/list_intersection/list_intersection_dict.py
  3. +45 −0 code/list_intersection/list_intersection_slow.py
  4. +4 −2 code/list_search/binary_search_loop.py
  5. +1 −1 code/list_search/binary_search_recursive.py
  6. +4 −1 code/list_search/linear_search.py
  7. +24 −0 img/tikz/overview_unit.tikz
  8. +10 −0 img/tikz/turing1.tikz
  9. +10 −0 img/tikz/turing10.tikz
  10. +10 −0 img/tikz/turing11.tikz
  11. +10 −0 img/tikz/turing12.tikz
  12. +10 −0 img/tikz/turing13.tikz
  13. +10 −0 img/tikz/turing14.tikz
  14. +10 −0 img/tikz/turing15.tikz
  15. +10 −0 img/tikz/turing16.tikz
  16. +10 −0 img/tikz/turing2.tikz
  17. +10 −0 img/tikz/turing3.tikz
  18. +10 −0 img/tikz/turing4.tikz
  19. +10 −0 img/tikz/turing5.tikz
  20. +10 −0 img/tikz/turing6.tikz
  21. +10 −0 img/tikz/turing7.tikz
  22. +10 −0 img/tikz/turing8.tikz
  23. +10 −0 img/tikz/turing9.tikz
  24. +21 −5 main.tex
  25. +93 −18 mycommands.sty
  26. +31 −15 mypackages.sty
  27. +4 −0 tex/derivations.tex
  28. +704 −393 tex/formalization.tex
  29. +4 −0 tex/fosyntax.tex
  30. +4 −0 tex/generativecapacity.tex
  31. +4 −0 tex/learnabilitysl.tex
  32. +4 −0 tex/listphonology.tex
  33. +4 −0 tex/morphology.tex
  34. +4 −0 tex/parsing.tex
  35. +105 −0 tex/preface.tex
  36. +4 −0 tex/probabilisticlocal.tex
  37. +4 −0 tex/regular.tex
  38. +4 −0 tex/sl-alternatives.tex
  39. +4 −0 tex/sl-mathematics.tex
  40. +4 −0 tex/spe.tex
  41. +4 −0 tex/strictlylocal.tex
  42. +4 −0 tex/strictlypiecewise.tex
  43. +4 −0 tex/syllabus.tex
  44. +4 −0 tex/syntacticcomplexity.tex
@@ -1,11 +1,146 @@
% This file was created with JabRef 2.7b.
% Encoding: UTF8
Bobaljik,
Jonathan D. 2008. Where’s φ? agreement as a post-syntactic operation. In
David Adger, Daniel Harbour & Susana Bejar (eds.), Phi theory: Phi-features
across modules and interfaces, 295–328. Oxford, UK: Oxford University
Press.
@unpublished{Whitehill13,
author = {Whitehill, Jacob},
title = {Understanding {ACT-R} --- an Outsider's Perspective},
year = {2013},
note = {Ms. UCSD},
url = {http://arxiv.org/abs/1306.0125},
}

@incollection{PullumKornai03,
author = {Pullum, Geoffrey K. and Kornai, András},
title = {Mathematical Linguistics},
year = {2003},
booktitle = {Oxford International Encyclopedia of Linguistics},
edition = {2},
pages = {17--20},
publisher = {Oxford University Press},
address = {Oxford}
}

@inproceedings{AshokEtAl13,
author = {Ashok, Vikas Ganjigunte and Feng, Song and Choi, Yejin},
title = {Success with Style: Using Writing Style to Predict the Success of Novels},
year = {2013},
pages = {1753-1764},
booktitle = {EMNLP 2013}
}

@article{Turing36,
author = {Turing, Alan M.},
title = {On Computable Numbers, with an Application to the {E}ntscheidungsproblem},
year = {1936},
journal = {Proceedings of the London Mathematical Society},
volume = {42},
pages = {230--265},
doi = {10.1112/plms/s2-42.1.230}
}

@article{Turing38,
author = {Turing, Alan M.},
title = {On Computable Numbers, with an Application to the {E}ntscheidungsproblem: A Correction},
year = {1938},
journal = {Proceedings of the London Mathematical Society},
volume = {43},
pages = {544--546},
doi = {10.1112/plms/s2-43.6.544}
}

@article{Krahmer10,
author = {Krahmer, Emiel},
title = {What Computational Linguists Can Learn from Psychologists (and Vice Versa)},
year = {2010},
journal = {Computational Linguistics},
volume = {36},
pages = {285--294},
doi = {10.1162/coli.2010.36.2.36201},
}
@book{Hodges83,
author = {Hodges, Andrew},
title = {Alan Turing: The Enigma},
year = {1983},
publisher = {Simon \& Schuster},
}

@book{Hofstadter79,
author = {Hofstader, Douglas},
title = {{G}ödel, {E}scher, {B}ach: An Eteneral Golden Braid},
year = {1979},
publisher = {Basic Books},
edition = {1999 Anniversay Edition},
}

@book{Morrill10,
author = {Morrill, Glyn},
title = {Categorial Grammar: Logical Syntax, Semantics, and Processing},
year = {2010},
publisher = {Oxford University Press},
address = {Oxford}
}

@book{MootRetore12,
author = {Moot, Richard and Retoré, Christian},
title = {The Logic of {C}ategorial Grammars: A Deductive Account of Natural Language Syntax and Semantics},
year = {2012},
publisher = {Springer},
address = {Berlin}
}

@incollection{Penn06,
author = {Penn, Gerald},
title = {Symbolic Computational Linguistics: Overview},
year = {2006},
pages = {338--352},
editor = {Brown, Keith},
booktitle = {Encyclopedia of Language \& Linguistics},
doi = {10.1016/B0-08-044854-2/00928-7},
publisher = {Elsevier},
address = {Amsterdam},
}


@incollection{Wilks06,
author = {Wilks, Yorick},
title = {Computational Linguistics: History},
year = {2006},
pages = {761--769},
editor = {Brown, Keith},
booktitle = {Encyclopedia of Language \& Linguistics},
doi = {10.1016/B0-08-044854-2/00928-7},
publisher = {Elsevier},
address = {Amsterdam},
}

@book{Hale14,
author = {Hale, John},
title = {Automaton Theories of Human Sentence Comprehension},
year = {2014},
publisher = {CSLI},
address ={Stanford},
}

@incollection{Crocker10,
author = {Crocker, Matthew},
title = {Computational Psycholinguistics},
year = {2010},
booktitle = {Handbook of Computational Linguistics and Natural Language Processing},
editor = {Clark, Alex and Fox, Chris and Lappin, Shalom},
pages = {482--514},
publisher = {Blackwell},
address = {London},
}

@article{Schwartz08,
author = {Schwartz, Martin},
title = {The Importance of Stupidity in Scientific Research},
year = {2008},
journal = {Journal of Cell Science},
volume = {121},
pages = {1771--1771},
doi = {0.1242/jcs.033340}
}

@incollection{Chametzky11,
author = {Chametzky, Robert A.},
@@ -3042,7 +3177,7 @@ @ARTICLE{Collins94
pages = {45--61}
}

@ARTICLE{CollinsÞr'ainsson96,
@ARTICLE{CollinsThrainsson96,
author = {Collins, Chris and Þr{\'a}insson, H{\"o}skuldur},
title = {{VP}-internal structure and Object Shift in {I}celandic},
year = {1996},
@@ -3362,7 +3497,7 @@ @BOOK{Enderton01
year = {2001},
publisher = {Academic Press},
address = {San Diego, CA},
edition = {2\(^\mathit{nd}\)}
edition = {2nd}
}

@ARTICLE{Engdahl83,
@@ -3512,7 +3647,7 @@ @BOOK{FHulHopVogler98
address = {Berlin}
}

@UNPUBLISHED{Fern'andez-SalgueiroIP,
@UNPUBLISHED{Fernandez-SalgueiroIP,
author = {Gerardo Fern{\'a}ndez-Salgueiro},
title = {Reducing Computation at the interface with the Sensory-Motor Systems.
A derivational approach to (Chain) linearization},
@@ -3667,7 +3802,7 @@ @BOOK{Fraleigh02
year = {2002},
publisher = {Addison Wesley},
address = {Reading, MA},
edition = {7\(^\mathit{th}\)}
edition = {7th},
}

@INCOLLECTION{Frampton96,
@@ -4066,7 +4201,7 @@ @ARTICLE{Goodman99

@INPROCEEDINGS{Gorn67,
author = {Gorn, Saul},
title = {Explicit definitions and linguistic dominoes},
title = {Explicit Definitions and Linguistic Dominoes},
year = {1967},
booktitle = {Systems and Computer Science, Proceedings of the Conference held
at University of Western Ontario, 1965},
@@ -4571,8 +4706,7 @@ @Article{HeinzIdsardi11
pages = {295--297},
year = {2011},
volume = {333},
number = {6040},
month = {July}
number = {6040}
}

@Article{HeinzIdsardi13,
@@ -5917,8 +6051,8 @@ @INPROCEEDINGS{Kobele.etal12
pages={32--51},
publisher={Springer},
address={Berlin, Heidelberg},
abstract={This paper provides a linking theory between the minimalist grammar formalism and off-line behavioural data. We examine the transient stack states of a top-down parser for Minimalist Grammars as it analyzes embedded sentences in English, Dutch and German. We find that the number of time steps that a derivation tree node persist on the parser's stack derives the observed contrasts in English center embedding, and the difference between German and Dutch embedding. This particular stack occupancy measure formalizes the leading idea of ``memory burden'' in a way that links predictive, incremental parsing to specific syntactic analyses.",
isbn="978-3-642-39998-5},
abstract={This paper provides a linking theory between the minimalist grammar formalism and off-line behavioural data. We examine the transient stack states of a top-down parser for Minimalist Grammars as it analyzes embedded sentences in English, Dutch and German. We find that the number of time steps that a derivation tree node persist on the parser's stack derives the observed contrasts in English center embedding, and the difference between German and Dutch embedding. This particular stack occupancy measure formalizes the leading idea of ``memory burden'' in a way that links predictive, incremental parsing to specific syntactic analyses.},
isbn={978-3-642-39998-5},
doi={10.1007/978-3-642-39998-5_3},
url={https://doi.org/10.1007/978-3-642-39998-5_3},
}
@@ -10451,7 +10585,7 @@ @INCOLLECTION{Thrainsson91
pages = {49--75}
}

@PROCEEDINGS{AdgerB'ejarar,
@PROCEEDINGS{AdgerBejarar,
title = {Phi Theory: {P}hi features across interfaces and modules},
year = {to appear},
editor = {Adger, David and B{\'e}jar, S.},
@@ -11704,17 +11838,6 @@ @book{NesporVogel86
address = {Dordrecht}
}

@incollection{Kaye95,
author = {Kaye, Jonathan},
title = {Derivations and Interfaces},
year = {1995},
booktitle = {Frontiers of Phonology},
editor = {Duran, Jacques and Katamba, Francis},
pages = {289--332},
publisher = {Longman},
address = {London}
}

@incollection{Scheer12,
author = {Scheer, Tobias},
title = {Chunk Definition in Phonology: Procosodic Constituency vs.\ Phrase Structure},
@@ -11763,7 +11886,7 @@ @comment{jabref-meta:
@comment{jabref-meta: groupstree:
0 AllEntriesGroup:;
1 ExplicitGroup:Timeline\;0\;Abney87\;AdgerRamchand05\;Aoun.etal81\;Ao
unSportiche83\;Bach62\;Bach64\;Baker85\;Baker88\;BarkerPullum90\;Beste
nunSportiche83\;Bach62\;Bach64\;Baker85\;Baker88\;BarkerPullum90\;Beste
n77\;Bierwisch63\;Borer84\;Brame68\;Bresnan70\;Bresnan72\;Bresnan76\;B
rody95\;Burzio81\;Burzio86\;Chomsky00\;Chomsky01\;Chomsky04\;Chomsky05
\;Chomsky57\;Chomsky62\;Chomsky65\;Chomsky70\;Chomsky73\;Chomsky74\;Ch
@@ -0,0 +1,25 @@
#!/usr/bin/env python
# encoding: utf-8


def list_intersection(listA, listB):
"""Build a list that only contains elements of all lists.
This algorithm uses dictionaries for speed,
but requires more memory.
"""
# convert second list to dictionary
dictB = {item: item for item in listB}

# create empty intersection
intersection = []

# for each item a of listA
for a in listA:
# is a in listB?
if dictB.get(a):
# found a, add it to intersection
intersection.append(a)

# return intersection
return intersection
@@ -0,0 +1,45 @@
#!/usr/bin/env python
# encoding: utf-8


def list_intersection(listA, listB):
"""Build a list that only contains elements of both lists.
This algorithm is highly ineffecient
because it loops over the second list multiple times!
Parameters
----------
listA : list
first list of elements
listB : list
second list of elements
Returns
-------
list
Examples
--------
>>> list_intersection([3, 1, 2], [4, 7, 2, 1])
[1, 2]
>>> list_intersection([3, 1, 2], [])
[]
>>> list_intersection([3, 1, 2], [1, 2, 3])
[3, 1, 2]
"""
# create empty intersection
intersection = []

# for each item a of listA
for a in listA:
# is any b of listB the same as a?
for b in listB:
if a == b:
# found a, add it to intersection
intersection.append(a)

# all loops done, return intersection
return intersection
@@ -6,7 +6,7 @@


def binary_search(search_list, item):
"""Perform binary search for item in search_list.
"""Use binary search to find position of item in search_list.
This algorithm is more efficient than linear search,
but only works for sorted lists!
@@ -34,7 +34,8 @@ def binary_search(search_list, item):
end = len(search_list) - 1

while start <= end:
# pick middle element of list
# pick middle element of list;
# we use int() for rounding down
middle = int(start + (end - start)/2)

# Case 1: our item is to the left of the item at the midpoint,
@@ -48,6 +49,7 @@ def binary_search(search_list, item):
# Case 3: we found our item, return its index
elif item == search_list[middle]:
return middle
# Case 4: item not in list, while-loop aborted
return False


@@ -6,7 +6,7 @@


def binary_search(search_list, item, start=0, end=None):
"""Perform binary search for item in search_list[start:end].
"""Use binary search to find position of item in search_list.
This algorithm is more efficient than linear search,
but only works for sorted lists!
@@ -6,7 +6,7 @@


def linear_search(search_list, item):
"""Search search_list from left to right for item.
"""Left-to-right search for position of item in search_list.
Parameters
----------
@@ -27,9 +27,12 @@ def linear_search(search_list, item):
>>> linear_search([0,1,7,9], 8)
False
"""
# iterate over all positions in the list
for i in range(len(search_list)):
if item == search_list[i]:
return i
# if we made it this far,
# then we haven't found anything
return False


0 comments on commit bfa9077

Please sign in to comment.
You can’t perform that action at this time.