This paper presents empirical studies and closely corresponding theoretical models of the performance of a chart parser exhaustively parsing the Penn Treebank with the Treebank’s own CFG grammar. We show how performance is dramatically affected by rule representation and tree transformations, but little by top-down vs. bottom-up strategies. We discuss grammatical saturation, including analysis of the strongly connected components of the phrasal nonterminals in the Treebank, and model how, as sentence length increases, the effective grammar rule size increases (...) as regions of the grammar are unlocked, yielding super-cubic observed time behavior in some configurations. (shrink)

While symbolic parsers can be viewed as deduction systems, this view is less natural for probabilistic parsers. We present a view of parsing as directed hypergraph analysis which naturally covers both symbolic and probabilistic parsing. We illustrate the approach by showing how a dynamic extension of Dijkstra’s algorithm can be used to construct a probabilistic chart parser with an Ç´Ò¿µ time bound for arbitrary PCFGs, while preserving as much of the flexibility of symbolic chart parsers as (...) allowed by the inherent ordering of probabilistic dependencies. (shrink)

While symbolic parsers can be viewed as deduction systems, this view is less natural for probabilistic parsers. We present a view of parsing as directed hypergraph analysis which naturally covers both symbolic and probabilistic parsing. We illustrate the approach by showing how a dynamic extension of Dijkstra’s algorithm can be used to construct a probabilistic chart parser with an Ç´Ò¿µ time bound for arbitrary PCFGs, while preserving as much of the flexibility of symbolic chart parsers as (...) allowed by the inherent ordering of probabilistic dependencies. (shrink)

fundamental rule” in an order-independent manner, such that the same basic algorithm supports top-down and Most PCFG parsing work has used the bottom-up bottom-up parsing, and the parser deals correctly with CKY algorithm (Kasami, 1965; Younger, 1967) with the difficult cases of left-recursive rules, empty elements, Chomsky Normal Form Grammars (Baker, 1979; Jeand unary rules, in a natural way.

Discriminative feature-based methods are widely used in natural language processing, but sentence parsing is still dominated by generative methods. While prior feature-based dynamic programming parsers have restricted training and evaluation to artificially short sentences, we present the first general, featurerich discriminative parser, based on a conditional random field model, which has been successfully scaled to the full WSJ parsing data. Our efficiency is primarily due to the use of stochastic optimization techniques, as well as parallelization and chart (...) prefiltering. On WSJ15, we attain a state-of-the-art F-score of 90.9%, a 14% relative reduction in error over previous models, while being two orders of magnitude faster. On sentences of length 40, our system achieves an F-score of 89.0%, a 36% relative reduction in error over a generative baseline. (shrink)

While Ç ´Ò¿ µ methods for parsing probabilistic context-free grammars (PCFGs) are well known, a tabular parsing framework for arbitrary PCFGs which allows for botton-up, topdown, and other parsing strategies, has not yet been provided. This paper presents such an algorithm, and shows its correctness and advantages over prior work. The paper finishes by bringing out the connections between the algorithm and work on hypergraphs, which permits us to extend the presented Viterbi (best parse) algorithm to an (...) inside (total probability) algorithm. (shrink)

La literatura sobre las relaciones entre las personas y la técnica se refiere a análisis heredados de la economía, la sociología, la política, etc. Estas miradas abarcan a la técnica de forma global dificultando el estudio de algunos procesos que ocurren entre cada persona y la técnica. En este sentido, buscaremos explicitar estas relaciones a través de los productos de la técnica como mediadores sociales. Con esta base tienen sentido los criterios de las tecnologías entrañables para que esta mediación se (...) transforme en una relación deseable en términos sociales, proponiendo a la honestidad como concepto de consenso primario. (shrink)

This title was first published in 2000. Philosophers have been greatly concerned with the nature of explanation, but no account has been fully satisfactory within science or plausible in the wider world. The author asserts that this is due to a misplaced focus and that instead of focusing on explanation, philosophers should consider understanding. This work outlines his theory and defends it against some objections. Attempts to understand understanding can become self-referential, but the book is intended to enable readers to (...) build a good mental model of the author's theory. (shrink)

First published in 1921, and originally intended as a textbook for students entering secondary school, this book gives an overview of the human and physical geography of the occupied areas of the earth's surface. The text is richly illustrated with diagrams, tables, and contemporary photographs of places of interest. This book will be of value to anyone with an interest in the history of education.

Inference to the Best Explanation and Bayesianism have both been proposed as descriptions of the way that people make inferences. This paper argues that one result from cognitive psychology, the "feminist bank teller" experiment, suggests that people use Inference to the Best Explanation rather than Bayesian techniques.

Controlled natural languages (CNL) with a direct mapping to formal logic have been proposed to improve the usability of knowledge representation systems, query interfaces, and formal specifications. Predictive editors are a popular approach to solve the problem that CNLs are easy to read but hard to write. Such predictive editors need to be able to “look ahead” in order to show all possible continuations of a given unfinished sentence. Such lookahead features, however, are difficult to implement in a satisfying way (...) with existing grammar frameworks, especially if the CNL supports complex nonlocal structures such as anaphoric references. Here, methods and algorithms are presented for a new grammar notation called Codeco, which is specifically designed for controlled natural languages and predictive editors. A parsing approach for Codeco based on an extended chart parsing algorithm is presented. A large subset of Attempto Controlled English has been represented in Codeco. Evaluation of this grammar and the parser implementation shows that the approach is practical, adequate and efficient. (shrink)

This paper develops a novel psycholinguistic parser and tests it against experimental and corpus reading data. The parser builds on the recent research into memory structures, which argues that memory retrieval is content‐addressable and cue‐based. It is shown that the theory of cue‐based memory systems can be combined with transition‐based parsing to produce a parser that, when combined with the cognitive architecture ACT‐R, can model reading and predict online behavioral measures (reading times and regressions). The parser's modeling capacities are (...) tested against self‐paced reading experimental data (Grodner & Gibson, 2005), eye‐tracking experimental data (Staub, 2011), and a self‐paced reading corpus (Futrell et al., 2018). (shrink)

In this paper, we use antecedent-final conditionals to formulate two problems for parsing-based theories of presupposition projection and triviality of the kind given in Schlenker 2009. We show that, when it comes to antecedent-final conditionals, parsing-based theories predict filtering of presuppositions where there is in fact projection, and triviality judgments for sentences which are in fact felicitous. More concretely, these theories predict that presuppositions triggered in the antecedent of antecedent-final conditionals will be filtered (i.e. will not project) if (...) the negation of the consequent entails the presupposition. But this is wrong: John isn’t in Paris, if he regrets being in France intuitively presupposes that John is in France, contrary to this prediction. Likewise, parsing-based approaches to triviality predict that material entailed by the negation of the consequent will be redundant in the antecedent of the conditional; but John isn’t in Paris, if he’s in France and Mary is with him is intuitively felicitous, contrary to these predictions. Importantly, given that the trigger appears in sentence-final position, both incremental (left-to-right) and symmetric versions of such theories make the same predictions. These data constitute a challenge to the idea that presupposition projection and triviality should be computed on the basis of parsing. This issue is important because it relates to the more general question as to whether presupposition and triviality calculation should be thought of as a pragmatic post-compositional phenomenon or as part of compositional semantics (as in the more traditional dynamic approaches). We discuss a solution which allows us to maintain the parsing-based pragmatic approach; it is based on an analysis of conditionals which incorporates a presupposition that their antecedent is compatible with the context, together with a modification to Schlenker’s (2009) algorithm for calculating local contexts so that it takes into account presupposed material. As we will discuss, this solution works within a framework broadly similar to that of Schlenker’s (2009), but it doesn’t extend in an obvious way to other parsing-based accounts (e.g. parsing-based trivalent approaches). We conclude that a parsing-based theory can be maintained, but only if we adopt a substantial change of perspective on the framework. (shrink)

Navigating the ontology of color used to be a simple affair. There was the naive view that colors really are in objects the way they appear, and the view that they are secondary qualities to cause certain experiences in us. Today, there are myriad well-developed views but no satisfactory taxonomy of philosophical theories on color. In this article, I first examine the two newest taxonomies on offer and argue that they are inadequate. In particular, I look at Brogaard’s taxonomy and (...) then Cohen’s. One of the reasons I am displeased with Brogaard and Cohen’s taxonomies is that I find it implausible that dispositions are relational properties. I provide an argument against this way of classifying dispositions. Having learned from the vices and virtues of Brogaard and Cohens’ taxonomies, I provide what I believe is a much-enhanced way of taxonomizing philosophical views on color. My taxonomy rules out certain views, clarifies others, and shows that there is an unnoticed view worthy of consideration. (shrink)

The main result in this paper is a method for obtaining derivation trees from sentences of certain formal grammars. No parsing algorithm was previously known to exist for these grammars.Applied to Montague's PTQ the method produces all parses that could correspond to different meanings. The technique directly addresses scope and reference and provides a framework for examining these phenomena. The solution for PTQ is implemented in an efficient and useful computer program.

This study aimed to investigate the longitudinal trends in mathematical competencies of Grade 8 students in a public high school located in Zamboanga del Sur, Philippines. The study collected data over a period of six academic years, allowing for a comprehensive analysis of students' performance in 16 distinct mathematical competences of basic education curriculum. These topics include, but are not limited to, special products and factors, factoring, and basic concepts of probability. Using a quantitative research design, the study analyzed both (...) numerical and secondary data to identify patterns or trends in students' mathematical competencies. Trends were analyzed through regression analysis using slopes. The significance of these trends was then evaluated using t-tests for the standard error of slopes. The statistical analysis revealed significant upward trends in certain mathematical topics, indicating an improvement in the students' competencies over the six academic years. However, certain topics displayed downward or stable trends, indicating areas for improvement in the teaching methods used for these topics. The study highlights the importance of flexible and adaptable approaches to mathematics education. It emphasizes the need for constant evaluation and improvement of teaching methods to enhance student learning outcomes. The findings of this study provide valuable insights for educators and policymakers to guide evidence-based decision-making and improve the quality of mathematics education in the new normal setup. Implications and future research directions are incorporated in the study. (shrink)

This comprehensive analysis dives deep into the intricate interplay between artificial intelligence (AI) and human agency, examining the remarkable capabilities and inherent limitations of large language models (LLMs) such as GPT-3 and ChatGPT. The paper traces the complex trajectory of AI's evolution, highlighting its operation based on statistical pattern recognition, devoid of self-consciousness or innate comprehension. As AI permeates multiple spheres of human life, it raises substantial ethical, legal, and societal concerns that demand immediate attention and deliberation. The metaphorical illustration (...) of humans as “shepherds” of AI, coupled with a thought-provoking examination of “agency without intelligence,” engenders deep reflections on the future of human-AI interplay and the associated philosophical, ethical, and practical ramifications. The paper further elucidates critical challenges associated with AI, such as ethical dilemmas, “agency without intelligence,” the role of human oversight, and the environmental impact of AI technologies. In the pursuit of solutions, the paper maps prospective directions, emphasizing the need for robust AI policies, improved AI literacy, sustainable AI practices, and a continued dialogue on the multifaceted issues surrounding AI. Through a holistic exploration of AI, this paper underlines the necessity for a multidisciplinary, collaborative approach to chart an ethical, beneficial, and sustainable AI future, enabling society to harness the potential of AI responsibly while mitigating the associated risks. (shrink)

This chapter explores parsing and grammar in children, with an emphasis on how children resolve sentences with ambiguous scope. It focuses on an ambiguity involving the universal quantifier every in subject position along with a negated main predicate, as in the sentence “Every horse didn’t jump over the fence.” One interpretation of this sentence is the “surface-scope” interpretation, which views the expression every horse as a reference to all the horses in the set; thus, each horse in the set (...) did not jump over the fence. Another interpretation is the “inverse-scope” interpretation, whereby some horses jumped over the fence while others did not. The chapter presents evidence suggesting that children tend to prefer the surface-scope interpretation and cannot obtain the inverse-scope interpretation. In other words, children systematically use the surface position of the relevant quantificational elements to determine scope relations. The chapter also discusses negation and quantified noun phrases, along with isomorphism. Finally, it discusses the implications of these findings for language development and sentence processing. (shrink)

This paper contains the full code of an implementation in Haskell [2], in ‘literate programming’ style [3], of an approach to deductive parsing based on [4]. We focus on the case of the Earley [1] parsing algorithm for CF languages.

This paper extends the Earley parsing algorithm for context free languages [3] to the case of sequentially indexed languages. Sequentially indexed languages are related to indexed languages [1, 2]. The difference is that parallel processing of index stacks is replaced by sequential processing [4].

\ is a 7000 line Prolog parser/theorem-prover for logical categorial grammar. In such logical categorial grammar syntax is universal and grammar is reduced to logic: an expression is grammatical if and only if an associated logical statement is a theorem of a fixed calculus. Since the syntactic component is invariant, being the logic of the calculus, logical categorial grammar is purely lexicalist and a particular language model is defined by just a lexical dictionary. The foundational logic of continuity was established (...) by Lambek while a corresponding extension including also logic of discontinuity was established by Morrill and Valentín :167–192, 2010). \ implements a logic including as primitive connectives the continuous and discontinuous connectives of the displacement calculus, additives, 1st order quantifiers, normal modalities, bracket modalities, and universal and existential subexponentials. In this paper we review the rules of inference for these primitive connectives and their linguistic applications, and we survey the principles of Andreoli’s focusing, and of a generalisation of van Benthem’s count-invariance, on the basis of which \ is implemented. (shrink)

In order to clarify Nishida’s notion of topos, I trace its forma­tion, starting with the notion of “pure experience,” of which he says: “To experience is to know the thing as it is.” By taking the act of “to know” as the thread that connects the ideas of pure experience and topos, I examine his early writings leading up to 1929, going beyond 1926, when Nishida’s essay “Basho” was published. Over against the commonly held “objectified” view of the topos as (...) a “location” or “field” in which the individual exists, a radically ontological reading of this notion emerges, requiring us to shift the vantage point from which we approach it. I conclude that Nishida introduced into his philosophi­cal system a locative dimension as an ontological feature, and we, con­scious beings, exist in this world “topologically”. The topos refers to the very logico-ontological mode of our being.In order to clarify what knowledge is, we need to begin with [the investigation of] reflective consciousness, rather than starting out with intellectual judgment. Consciousness pertaining to judgment cannot include the one [who judges] within it. It is an incomplete awareness that looks at the self externally. The explanation of how we know begins with the critical reflection of self-consciousness itself. Therein, we obtain the standpoint of genuine epistemology.Our real knowledge starts out with “I exist.” That “I exist” means that the topos is directly in the topos, and this is the standpoint of both inner perception and actual experience. (shrink)

The University of Pennsylvania Linguistics Department is home of a long-running project to create syntactically annotated (parsed) corpora of historical English. The project is directed by Anthony Kroch, Professor of Linguistics, and the research associate in charge of corpus annotation is Dr. Beatrice Santorini. The Middle English corpus was constructed by Dr. Ann Taylor, now research associate in charge of corpus annotation at the University of York, England.

C.B. Macpherson's “Possessive Individualist” reading of Locke is one of the most radical and influential interpretations in the history of exegesis. Despite a substantial critical response over the past five decades, Macpherson's reading remains orthodox in various circles in the humanities generally, particularly in legal studies, and his interpretation of several crucial passages has unwittingly been followed even by his sharpest critics within Lockean scholarship. In order to present the definitive rebuttal to this interpretation, and so finally to lay it (...) to rest, I argue that every one of Macpherson's key pieces of textual evidence can be rejected entirely on its own terms; that is, by reference to no more than its immediate context. In this way I contend that fault of the Possessive Individualist reading lies far deeper than mere cherry-picking of the Lockean corpus, but centrally involves misreading, misplacing and misrepresenting the very parts of Locke's work Macpherson cites as evidence for his reading. (shrink)

In this paper, the historical development of the clitic systems of Standard Modern, Cypriot and Pontic Greek is discussed. These three varieties not only present the whole range of variation one can find across clitic systems in Greek but, furthermore, derive from a common linguistic ancestor, i.e. Koine Greek. This paper argues that the transition from Koine Greek to the Medieval varieties and from the Medieval varieties to the respective modern ones can be explained by making the assumption that routinisation (...) and parsing/hearer assymetries are two important factors behind syntactic change. The claim is that the transition from Koine to the Medieval Greek varieties involves the emergence of a clitic system with encoded syntactic constraints out of a freer one, where clitic positioning was regulated by pragmatic preferences rather than syntactic constraints. Then, the transition to the modern varieties from the respective medieval ones is explained, at least partly, on the assumption that production/parsing mismatches are capable of triggering syntactic change. This last assumption combined with: the tendency to obtain more generalised parsing triggers for parsing the individual clitics and the fact that the Medieval varieties in question differ in minimal but crucial ways, provides us an explanation for the transition to the modern varieties. (shrink)

A* PCFG parsing can dramatically reduce the time required to find the exact Viterbi parse by conservatively estimating outside Viterbi probabilities. We discuss various estimates and give efficient algorithms for computing them. On Penn treebank sentences, our most detailed estimate reduces the total number of edges processed to less than 3% of that required by exhaustive parsing, and even a simpler estimate which can be pre-computed in under a minute still reduces the work by a factor of 5. (...) The algorithm extends the classic A* graph search procedure to a certain hypergraph associated with parsing. Unlike bestfirst and finite-beam methods for achieving this kind of speed-up, the A* parser is guaranteed to return the most likely parse, not just an approximation. The algorithm is also correct for a wide range of parser control strategies and maintains a worst-case cubic time bound. (shrink)

When we speak about different interpretations of quantum mechanics it is suggested that there is one single quantum theory that can be interpreted in different ways. However, after an explicit characterization of what it is to interpret quantum mechanics, the right diagnosis is that we have a case of predictively equivalent rival theories. I extract some lessons regarding the resulting underdetermination of theory choice. Issues about theoretical identity, theoretical and methodological pluralism, and the prospects for a realist stance towards quantum (...) theory can be properly addressed once we recognize that interpretations of quantum mechanics are rival theories. (shrink)