Hints for Selected Exercises
Total Page:16
File Type:pdf, Size:1020Kb
Hints for selected exercises Chapter 2 1 Look for counterexamples 2a Start with the full and non-strict case 3b No 4 5 16 Consider the parentheses 18 Try different ordering relations over infinite sets such as the integers Chapter 3 4 Dogs are animals 11 Consider Cayley’s Theorem Chapter 4 4 Not all languages have examples of all four 14 Consider which states are sinks Chapter 5 3 Start with the smaller problem of one ...ninety nine 5 The distribution of -er is simpler to state as the union of two distributions, one related to verbal and the other to adjectival stems 7 Both fast and acting exist as free forms, but ˚fastact in particular, and adverbial-verb compounds in general, are missing. Does this necessitate ternary branching rules? Chapter 6 3 Use bignum-capable software such as Python or Mathematica Chapter 7 3 People do things out of fear 10 No © Springer Nature Switzerland AG 2019 267 A. Kornai, Semantics, https://doi.org/10.1007/978-3-319-65645-8 Solutions for selected exercises Chapter 4 7 While the automata associated to paaq˚ and pabq˚ are nearly identical, the syntactic monoids are quite a bit different, beginning with the fact that ta; bu˚{paaq˚ has only three classes while ta; bu˚{pabq˚ has four. There are three equivalence classes in com- mon: one that contains members of the language specified by the regular expression, which we denote by e; one that contains a, which we denote by a; and a sink class s. However, the letter b, which in the paaq˚ case falls in the sink class, will fall in a different ‘redeemable’ equivalence class r in the pabq˚ case. This is because using even a single b during the creation of a string the bounds of the paaq˚ language are left, while in the pabq˚ case we still can have a grammatical string as a result. We have the following multiplication tables: e a r s e a s e e a r s e e a s a a s e s a a e s r r s s s s s s s s s s s s Table 3.3 Multiplication in ta; bu˚{paaq˚ and in ta; bu˚{pabq˚ Chapter 9 2 Start with a single, essential good, say grain, and a uniform, annual mode of pro- duction that yields 105 seeds for every 100 seeds sown. Assume that individuals have free choice in saving as much as they wish for next year, subject to some minumum consumption limit, under which they’d die of hunger. Set up initial conditions in both societies so that the total availability of grain at the beginning equals to two years’ worth of consumption, but in one society the households are free to keep as much for seed as they wish, with the proceeds from later years staying with them, while in the other society whatever they don’t consume will go into a communal storage and invested equally on every household’s behalf. © Springer Nature Switzerland AG 2020 269 A. Kornai, Semantics, https://doi.org/10.1007/978-3-319-65645-8 References Ackerman, Nate (2001) “Lindstrom’s Theorem” in: http://bit.ly/2n5pwoS. Ács, Judit, Katalin Pajkossy, and András Kornai (2013) “Building basic vocabulary across 40 languages” in: Proceedings of the Sixth Workshop on Building and Using Comparable Corpora Sofia, Bulgaria: Association for Computational Linguistics, pp. 52–58. Adler, Mortimer (1978) Aristotle for Everyone: Difficult Thought Made Easy New York: Macmillan. Alcorta, Candace and Richard Sosis (2007) “Rituals of Humans and Animals” in: En- cyclopedia of Human-Animal Relationships 2 ed. by Marc Bekoff, pp. 599–605. Allen, B., Donna Gardiner, and D. Frantz (1984) “Noun Incorporation In Southern Tiwa” in: IJAL 50. Allen, J.F. and G. Ferguson (1994) “Actions and events in interval temporal logic” in: Journal of logic and computation 4.5, p. 531. Anderson, John M. (2005a) The non-autonomy of syntax vol. 39, pp. 223–250. Anderson, Stephen R. (1982) “Where Is Morphology?” In: Linguistic Inquiry 13, pp. 571–612. — (2003) “Morphology” in: Encyclopedia of Cognitive Science Macmillan Publishers Ltd. Anderson, Stephen R (2005b) Aspects of the Theory of Clitics Oxford University. Angluin, Dana and Carl H. Smith (1983) “Inductive Inference: Theory and Methods” in: ACM Computing Surveys 15.3, pp. 237–269. Apley, Daniel (2003) “Principal Components and Factor Analysis” in: The Handbook of Data Mining ed. by Nong Ye Lawrence Erlbaum Associates. Apresjan, Ju D (1965) “Opyt opisanija znacenij glagolov po ix sintaksiceskim priz- nakam (tipam upravlenija)” in: Voprosy jazykoznanija 5, pp. 51–66. Arnold, GM and AJ Collins (1993) “Interpretation of transformed axes in multivariate analysis” in: Applied statistics, pp. 381–400. Aronoff, M. (1974) Word-structure Ph.D. Thesis, Massachusetts Institute of Technol- ogy. Aronoff, Mark (1976) Word Formation in Generative Grammar MIT Press. — (1985) “Orthography and Linguistic Theory: The Syntactic Basis of Masoretic He- brew Punctuation” in: Language 61.1, pp. 28–72. — (2007) “In the beginning was the word” in: Language, pp. 803–830. Arora, Sanjeev et al. (2015) “Random Walks on Context Spaces: Towards an Expla- nation of the Mysteries of Semantic Word Embeddings” in: arXiv:1502.03520v1 4, pp. 385–399. Asher, Nicholas and Alex Lascarides (2003) Logics of Conversation Cambridge Univer- sity Press. Ayer, Alfred Jules (1946) Language, truth and logic New York: Dover Publications. Bach, Emmon (1981) “Discontinuous constituents in generalized categorial grammars” in: Proceedings of the NELS vol. II, pp. 1–12. © Springer Nature Switzerland AG 2019 271 A. Kornai, Semantics, https://doi.org/10.1007/978-3-319-65645-8 272 REFERENCES Bailey, Dan, Yuliya Lierler, and Benjamin Susman (2015) “Prepositional Phrase At- tachment Problem Revisited: How VERBNET Can Help” in: Proceedings of the 11th International Conference on Computational Semantics (IWCS) Association for Computational Linguistics. Bar-Hillel, Yehoshua, Chaim Gaifman, and Eli Shamir (1960) “On categorial and phrase structure grammars” in: Bulletin of the Research Council of Israel 9F, pp. 1– 16. Baxter, Jonathan (1995a) Learning Internal Representations Santa Cruz, CA: ACM Press, pp. 311–320. — (1995b) The canonical metric for vector quantization NeuroCOLT NC-TR-95-047 London: University of London. Bayles, M.D. (1968) Contemporary utilitarianism Anchor Books. Belinkov, Yonatan et al. (2014) “Exploring Compositional Architectures and Word Vector Representations for Prepositional Phrase Attachment” in: Transactions of the ACL 2, pp. 561–572. Belnap, Nuel D. (1977) “How a computer should think” in: Contemporary Aspects of Philosophy ed. by G. Ryle Newcastle upon Tyne: Oriel Press, pp. 30–56. Berge, Claude (1989) Hypergraphs vol. 45 North Holland Mathematical Library Ams- terdam: North Holland. Bergelson, Elika and Daniel Swingley (2013) “The acquisition of abstract words by young infants” in: Cognition 127, pp. 391–397. Bird, S., E. Klein, and E. Loper (2009) Natural language processing with Python O’Reilly Media. Blackburn, Patrick and Johan Bos (2005) Representation and Inference for Natural Lan- guage. A First Course in Computational Semantics CSLI. Blish, James (1973) The Quincunx of Time New York: Dell. Bloomfield, Leonard (1926) “A set of postulates for the science of language” in: Lan- guage 2, pp. 153–164. Bobro, Marc (2013) “Leibniz on Causation” in: The Stanford Encyclopedia of Philoso- phy ed. by Edward N. Zalta url: http://plato.stanford.edu/archives/ sum2013/entries/leibniz-causation. Boden, Margaret (2006) Mind as machine Oxford University Press. Bogert, Bruce P., Michael J.R. Healy, and John W. Tukey (1963) “The quefrency alany- sis of time series for echoes: cepstrum, pseudo-autocovariance, cross-cepstrum, and saphe cracking” in: Proceedings of the Symposium on Time Series Analysis ed. by M. Rosenblatt Wiley, pp. 209–243. Boguraev, Branimir K. and Edward J. Briscoe (1989) Computational Lexicography for Natural Language Processing Longman. Bolinger, Dwight (1965) “Pitch accents and sentence rhythm” in: Forms of English: accent, morpheme, order Cambridge MA: Harvard University Press. Bolinger, Dwight L. (1962) “Binomials and pitch accent” in: Lingua 11, pp. 34–44. Borer, Hagit (2005) Structuring sense vol. I and II Oxford University Press. REFERENCES 273 — (2013) Structuring sense vol. III Oxford University Press. Böttner, Michael (2001) “Peirce Grammar” in: Grammars 4.1, pp. 1–19. Brachman, R.J. and H. Levesque (1985) Readings in knowledge representation Morgan Kaufmann Publishers Inc., Los Altos, CA. Brown, P. et al. (1992) “An Estimate of an Upper Bound for the Entropy of English” in: Computational Linguistics 18/1, pp. 31–40. Brzozowski, J.A. (1962) “Canonical regular expressions and minimal state graphs for definite events” in: Mathematical theory of Automata Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y., pp. 529–561. Burris, Stanley (2001) “Downward Löwenheim–Skolem theorem” in: http://www. math.uwaterloo.ca/~snburris/htdocs/WWW/PDF/downward.pdf. Butt, Miriam (2006) Theories of Case Cambridge University Press. Camerer, Colin (2003) Behavioral game theory Princeton University Press. Carlson, Greg and Francis J. Pelletier, eds. (1995) The Generic Book University of Chicago Press. Carnap, Rudolf (1946) “Modalities and quantification” in: The Journal of Symbolic Logic 11.2, pp. 33–64. — (1947) Meaning and necessity. Carroll, Lewis (1896) Symbolic logic, Part I: Elementary London: Macmillan. Cawdrey, Robert (1604) A table alphabetical of hard usual English words. Chen, Danqi and Christopher D Manning (2014) “A Fast and Accurate Dependency Parser using Neural Networks.” in: EMNLP, pp. 740–750. Chen, Xinxiong, Zhiyuan Liu, and Maosong Sun (2014) “A unified model for word sense representation and disambiguation” in: Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pp. 1025–1035. Chiarcos, Christian and Tomaz Erjavec (2011) “OWL/DL formalization of the MUL- TEXT-East morphosyntactic specifications.” in: Linguistic Annotation Workshop, pp. 11–20. Chisholm, R. (1963) “Supererogation and Offence: A Conceptual Scheme for Ethics” in: Ratio 5, pp.