Search

Highlights • The parse of lian involves reusing the structure projected by a scalar implicature. • Dou is an intensifier-like adverb used to reinforce the illocutionary force of the sentence containing lian...dou. • The parse of Dou suggests that the alternatives projected by a scalar implicature are true in the relevant context. Abstract This paper deals with the puzzling Chinese verb doubling construction in the schema of lian...dou (verb doubling lian...dou construction, VDLD) from a parsing perspective. Within the framework of Dynamic Syntax (Kempson et al., 2001; Cann et al., 2005) which allows the interaction between structural, semantic and pragmatic information, it is shown that VDLD can receive a straightforward explanation on the assumption that the construction is licensed by an explicit or implicit context. Specifically, it is argued that (i) the first verb marked by lian is a topicalized focus, whose parse involves reusing the structure projected by a scalar implicature; (ii) dou is an intensifier-like adverb, whose parse suggests that the alternatives projected by a scalar implicature should be true in the relevant context. [ABSTRACT FROM AUTHOR]

Abstract: Right node raising sentences (RNR) have proved to be difficult for modern syntactic theory to account in an explanatory fashion. In this paper I argue that the reason for this difficulty is that RNR cannot be fully analyzed as a construction independent of online parsing. I argue against current and possible grammatical analyses of the construction and posit that the interpretation of the shared material in the first conjunct is effectively illusory. That is, the interpretive relation between the shared material in RNR and the gap position in the first conjunct is not encoded in the offline representation of the construction, but rather is only captured via a transitory online parsing operation. This analysis has consequences for the relation between the grammar and the parser as well the limits of grammatical relations. [ABSTRACT FROM AUTHOR]

During the temporal delay between the filler and gap sites in long-distance dependencies, the 'active filler' strategy can be implemented in two ways: the filler phrase can be actively maintained in working memory ('maintenance account'), or it can be retrieved only when the parser posits a gap ('retrieval account'). The current study tested whether filler content is maintained during the processing of dependencies. Using a self-paced reading paradigm, we compared reading times on a noun phrase (NP) between the filler and gap sites in object relative clauses, to reading times on an NP between the antecedent and ellipsis sites in ellipsis sentences. While in the former type of dependency a filler by hypothesis can be maintained, in the latter there is no indication for the existence of a dependency prior to the ellipsis site, and hence no maintenance. By varying the amount of similarity-based interference between the antecedent and integration sites, we tested the influence of holding an unresolved dependency on reading times. Significantly increased reading times due to interference were found only in the object relative condition, and not in the ellipsis condition, demonstrating filler maintenance costs. The fact that these costs were measured as an effect on similarity-based interference indicates that the maintained representation of the filler must include at least some of the features shared by the interfering NP. [ABSTRACT FROM AUTHOR]

A controlled reading experiment reveals that stress-based linguistic rhythm impinges on syntactic ambiguity resolution in silent and oral reading. The results suggest that, at points of syntactic underspecification, the accruing prosodic representation may affect even the earliest stages of structure building, viz. the analysis of syntactic features of an ambiguous word. Such an effect remains inexplicable in the context of (psycho-)linguistic theories that assume a strictly unidirectional relationship between syntactic and phonological processes, the latter merely interpreting the conditions the syntactic component imposes on it. Here, a performance compatible grammar in the framework of Optimal Parsing is presented that is capable of capturing the reading data. The model integrates syntactic parsing and prosodification in reading and predicts that, at points of syntactic indetermination, weak prosodic constraints alone may guide syntactic structure assignment. This suggests a bidirectional relationship between syntax and phonology in grammar and processing while, at the same time, confirming a tight coupling of language production and comprehension. [ABSTRACT FROM AUTHOR]

In a series of three experiments, we use children’s noun learning as a probe into their syntactic knowledge as well as their ability to deploy this knowledge, investigating how the predictions children make about upcoming syntactic structure change as their knowledge changes. In the first two experiments, we show that children display a developmental change in their ability to use a noun’s syntactic environment as a cue to its meaning. We argue that this pattern arises from children’s reliance on their knowledge of verbs’ subcategorization frame frequencies to guide parsing, coupled with an inability to revise incremental parsing decisions. We show that this analysis is consistent with the syntactic distributions in child-directed speech. In the third experiment, we show that the change arises from predictions based on verbs’ subcategorization frame frequencies. [ABSTRACT FROM AUTHOR]

Previous studies concluded that despite the parser's eagerness to resolve filler-gap dependencies, in island configurations it prefers to posit late grammatical gaps over early ungrammatical ones. This study investigates the possibility o f resolving filler-gap dependencies inside Hebrew islands. We investigated the acceptability of resumptive pronouns (RPs) in two islands and the sensitivity of on-line dependency formation to the status of those RPs. Results revealed a filled-gap effect inside the island that allows RPs but not inside the one that prohibits them. This suggests that active dependency formation can proceed inside islands, and that when processing dependencies with islands, the Hebrew parser prefers an early RP over a later gap. [ABSTRACT FROM AUTHOR]

In this article, we present a novel approach for parsing argumentation structures. We identify argument components using sequence labeling at the token level and apply a new joint model for detecting argumentation structures. The proposed model globally optimizes argument component types and argumentative relations using Integer Linear Programming. We show that our model significantly outperforms challenging heuristic baselines on two different types of discourse. Moreover, we introduce a novel corpus of persuasive essays annotated with argumentation structures. We show that our annotation scheme and annotation guidelines successfully guide human annotators to substantial agreement. [ABSTRACT FROM AUTHOR]

The article discusses the use of dynamic syntax (DS) as a pragmatic approach to language parsing. Topics covered include how coherent interaction between participants in a multiparty conversation impose constraints, an approach to language via dialogues, and the traditional perspective on linguistics. Also mentioned are the complexity of natural language's syntax, the translation of natural language syntax into mathematical notation, and the computational paradigm provided by proof search.

The article discusses the dynamic syntax (DS) approach to embedding an account of linguistic behavior in a theory of action while considering natural languages as formal systems. Topics covered include the use of analysis trees, computational actions that operate on trees, and definite clause grammars (DCG). Also mentioned are computational approaches to parsing, linguistic theory's emphasis on incremental processing, and gameboard theory.

The Tanzanian Bantu language Rangi exhibits a comparatively and typologically unusual word order alternation in the future tense. Whilst declarative main clauses exhibit post-verbal auxiliary placement, the auxiliary appears pre-verbally in wh-questions, sentential negation, relative clauses, cleft constructions and subordinate clauses. This paper examines this alternation from the perspective of Dynamic Syntax ( Cann et al., 2005; Kempson et al., 2001 ). Dynamic Syntax (DS) is a parsing-oriented framework which aims to capture the way in which meaning is established incrementally as a result of lexical input encountered in context. The paper presents a unified analysis of this construction found in Rangi, locating it within the wider workings of the language. It shows that this seemingly idiosyncratic constituent order is in fact predictable on the basis of a general constraint operative in the DS framework which prohibits the co-occurrence of more than one unfixed node, thereby also confirming the claim of Dynamic Syntax to constitute a grammar framework rather than merely a parsing device. [ABSTRACT FROM AUTHOR]

In the last decade, various restricted classes of non-projective dependency trees have been proposed with the goal of achieving a good tradeoff between parsing efficiency and coverage of the syntactic structures found in natural languages. We perform an extensive study measuring the coverage of a wide range of such classes on corpora of 30 languages under two different syntactic annotation criteria. The results show that, among the currently known relaxations of projectivity, the best tradeoff between coverage and computational complexity of exact parsing is achieved by either 1-endpoint-crossing trees or MHk trees, depending on the level of coverage desired. We also present some properties of the relation of MHk trees to other relevant classes of trees. [ABSTRACT FROM AUTHOR]

The present study demonstrates the existence in Wandala (Central Chadic) of two inflectional markers which, although they change the form of the word, are not word-formation means but rather sentence-formation means. While neither of the forms indicates any specific semantic relation, they both enable the listener to parse the sentence into units that can undergo further analysis and allow for inferences about a large number of semantic relations within the clause and within the sentence. The types of inflectional marking described in this study are unrelated to the dichotomy of head marking and dependent marking. Although this study is based on data from a single language, it has implications for the typology of coding means and for theories of clausal structures. [ABSTRACT FROM AUTHOR]

This contribution investigates the syntactic conceptions of, and the diagramming system introduced by, the American grammarian Stephen Watkins Clark (1810-1901), who introduced the first comprehensive syntactic diagramming system. The structure of the English sentence is illustrated by agglutinated 'bubbles' expressing the relations between words by the means of their relative position. The sentence consists of two or three horizontally aligned bubbles containing words that are called principal elements. These principal elements can be complemented with adjunct elements, that appear in bubbles attached below them. For grammatical words the conventions differ depending on whether the grammatical word is a preposition or a conjunction. Coordination is never named as such, but there is an orthogonal abstract relation that connects elements performing the same role in a "compound" construction. The system allows recursivity in two different ways: by wrapping bubbles into other bubbles, thus following a mereological logic (i.e., partwhole relations) close to IC analysis or by hierarchically aggregating bubbles that resemble dependency trees. Clark's conceptions thus prefigure modern graphical formalizations. [ABSTRACT FROM AUTHOR]

Japanese and Rangi (a Bantu language) employ cleft constructions to encode pragmatic functions relating to discourse salience. In Japanese, a cleft is formed through the nominaliser ‘no,’ the topic marker ‘wa,’ and the copula ‘da.’ In Rangi, a cleft is formed through the copula ‘ní’ which appears before the focus. This article provides a description of clefts in these two unrelated languages; in particular, Rangi clefts have been understudied, and our description represents a first systematic treatment. The article also develops an account from the new perspective of how a cleft string is parsed left-toright in an online manner (Dynamic Syntax; Cann, R. et al. 2005. The Dynamics of Language. Elsevier). We propose that a number of seemingly idiosyncratic syntactic properties of clefts in these languages (including new data on case-marking patterns of foci in Japanese clefts and the auxiliary placement in Rangi clefts) can be accounted for by reference to left-to-right, online parsing, and the restriction on structural underspecification that is an integral part of the framework. Our account also models parallelisms and differences in Japanese and Rangi clefts in terms of parsing-dynamics. [ABSTRACT FROM AUTHOR]

The complexity of parsing with synchronous context-free grammars is polynomial in the sentence length for a fixed grammar, but the degree of the polynomial depends on the grammar. Specifically, the degree depends on the length of rules, the permutations represented by the rules, and the parsing strategy adopted to decompose the recognition of a rule into smaller steps. We address the problem of finding the best parsing strategy for a rule, in terms of space and time complexity. We show that it is NP-hard to find the binary strategy with the lowest space complexity. We also show that any algorithm for finding the strategy with the lowest time complexity would imply improved approximation algorithms for finding the tree width of general graphs. [ABSTRACT FROM AUTHOR]

The importance of the parsing task for NLP applications is well understood. However developing parsers remains difficult because of the complexity of the Arabic language. Most parsers are based on syntactic grammars that describe the syntactic structures of a language. The development of these grammars is laborious and time consuming. In this paper we present our method for building an Arabic parser based on an induced grammar, PCFG grammar. We first induce the PCFG grammar from an Arabic Treebank. Then, we implement the parser that assigns syntactic structure to each input sentence. The parser is tested on sentences extracted from the treebank (1650 sentences).We calculate the precision, recall and f-measure. Our experimental results showed the efficiency of the proposed parser for parsing modern standard Arabic sentences (Precision: 83.59 %, Recall: 82.98 % and F-measure: 83.23 %). [ABSTRACT FROM AUTHOR]

Illocutionary structure in real language use is intricate and complex, and nowhere more so than in argument and debate. Identifying this structure without any theoretical scaffolding is extremely challenging even for humans. New work in Inference Anchoring Theory has provided significant advances in such scaffolding which are helping to allow the analytical challenges of argumentation structure to be tackled. This paper demonstrates how these advances can also pave the way to automated and semi-automated research in understanding the structure of natural debate. [ABSTRACT FROM AUTHOR]

Imprecise manipulation of source code (semi-parsing) is useful for tasks such as robust parsing, error recovery, lexical analysis, and rapid development of parsers for data extraction. An island grammar precisely defines only a subset of a language syntax (islands), while the rest of the syntax (water) is defined imprecisely. Usually water is defined as the negation of islands. Albeit simple, such a definition of water is naïve and impedes composition of islands. When developing an island grammar, sooner or later a language engineer has to create water tailored to each individual island. Such an approach is fragile, because water can change with any change of a grammar. It is time-consuming, because water is defined manually by an engineer and not automatically. Finally, an island surrounded by water cannot be reused because water has to be defined for every grammar individually. In this paper we propose a new technique of island parsing — bounded seas. Bounded seas are composable, robust, reusable and easy to use because island-specific water is created automatically. Our work focuses on applications of island parsing to data extraction from source code. We have integrated bounded seas into a parser combinator framework as a demonstration of their composability and reusability. [ABSTRACT FROM AUTHOR]

We provide a test of Patel's [(2003). Language, music, syntax and the brain.Nature Neuroscience,6, 674–681] shared syntactic integration resources hypothesis by investigating the competition between determinants of rhythmic parsing and linguistic parsing using asentence-rhythm Stroop task. We played five-note rhythm patterns in which each note is replaced with a spoken word of a five-word sentence and asked participants to indicate the starting point of the rhythm while they disregarded which word would normally be heard as the first word of the sentence. In Study 1, listeners completed the task in their native language. In Study 2, we investigated whether this competition is weakened if the sentences were in a listener's non-native language. In Study 3, we investigated how much language mastery is necessary to obtain the effects seen in Studies 1 and 2. We demonstrate that processing resources for rhythmic parsing and linguistic parsing overlap with one another, particularly when the task is demanding. We also show that the tendency for language to bias processing does not require deep knowledge of the language. [ABSTRACT FROM PUBLISHER]

We address two important questions about the relationship between theoretical linguistics and psycholinguistics. First, do grammatical theories and language processing models describe separate cognitive systems, or are they accounts of different aspects of the same system? We argue that most evidence is consistent with the one-system view. Second, how should we relate grammatical theories and language processing models to each other? [ABSTRACT FROM AUTHOR]

Obtaining syntactic parses is an important step in many NLP pipelines. However, most of the world's languages do not have a large amount of syntactically annotated data available for building parsers. Syntactic projection techniques attempt to address this issue by using parallel corpora consisting of resource-poor and resource-rich language pairs, taking advantage of a parser for the resource-rich language and word alignment between the languages to project the parses onto the data for the resource-poor language. These projection methods can suffer, however, when syntactic structures for some sentence pairs in the two languages look quite different. In this paper, we investigate the use of small, parallel, annotated corpora to automatically detect divergent structural patterns between two languages. We then use these detected patterns to improve projection algorithms and dependency parsers, allowing for better performing NLP tools for resource-poor languages, particularly those that may not have large amounts of annotated data necessary for traditional, fully-supervised methods. While this detection process is not exhaustive, we demonstrate that common patterns of divergence can be identified automatically without prior knowledge of a given language pair, and the patterns can be used to improve performance of syntactic projection and parsing. [ABSTRACT FROM AUTHOR]

We present HamleDT-a HArmonized Multi-LanguagE Dependency Treebank. HamleDT is a compilation of existing dependency treebanks (or dependency conversions of other treebanks), transformed so that they all conform to the same annotation style. In the present article, we provide a thorough investigation and discussion of a number of phenomena that are comparable across languages, though their annotation in treebanks often differs. We claim that transformation procedures can be designed to automatically identify most such phenomena and convert them to a unified annotation style. This unification is beneficial both to comparative corpus linguistics and to machine learning of syntactic parsing. [ABSTRACT FROM AUTHOR]

Syntactic parsing processes establish dependencies between words in a sentence. These dependencies affect how comprehenders assign meaning to sentence constituents. Classical approaches to parsing describe it entirely as a bottom-up signal analysis. More recent approaches assign the comprehender a more active role, allowing the comprehender's individual experience, knowledge, and beliefs to influence his or her interpretation. This review describes developments in three related aspects of sentence processing research: anticipatory processing, Bayesian/noisy-channel approaches to sentence processing, and the ‘good-enough’ parsing hypothesis. [ABSTRACT FROM AUTHOR]

Minimalist grammars (MGs) and multiple context-free grammars (MCFGs) are weakly equivalent in the sense that they define the same languages, a large mildly context-sensitive class that properly includes context-free languages. But in addition, for each MG, there is an MCFG which is strongly equivalent in the sense that it defines the same language with isomorphic derivations. However, the structure-building rules of MGs but not MCFGs are defined in a way that generalizes across categories. Consequently, MGs can be exponentially more succinct than their MCFG equivalents, and this difference shows in parsing models too. An incremental, top-down beam parser for MGs is defined here, sound and complete for all MGs, and hence also capable of parsing all MCFG languages. But since the parser represents its grammar transparently, the relative succinctness of MGs is again evident. Although the determinants of MG structure are narrowly and discretely defined, probabilistic influences from a much broader domain can influence even the earliest analytic steps, allowing frequency and context effects to come early and from almost anywhere, as expected in incremental models. [ABSTRACT FROM AUTHOR]

The article focuses on the concept of reductionist approach to the syntax of grammar. It discusses unidirectionality and mentions that it is a principle of parsing. It tackles the use of a single semantic representation and Transfer Calculus and notes the proposed analysis on L1 English data as well as the Korean L2 learning

Syntactic representations based on word-to-word dependencies have a long-standing tradition in descriptive linguistics, and receive considerable interest in many applications. Nevertheless, dependency syntax has remained something of an island from a formal point of view. Moreover, most formalisms available for dependency grammar are restricted to projective analyses, and thus not able to support natural accounts of phenomena such as wh-movement and cross-serial dependencies. In this article we present a formalism for non-projective dependency grammar in the framework of linear context-free rewriting systems. A characteristic property of our formalism is a close correspondence between the non-projectivity of the dependency trees admitted by a grammar on the one hand, and the parsing complexity of the grammar on the other. We show that parsing with unrestricted grammars is intractable. We therefore study two constraints on non-projectivity, block-degree and well-nestedness. Jointly, these two constraints define a class of "mildly" non-projective dependency grammars that can be parsed in polynomial time. An evaluation on five dependency treebanks shows that these grammars have a good coverage of empirical data. [ABSTRACT FROM AUTHOR]

Efforts to characterize the memory system that supports sentence comprehension have historically drawn extensively on short-term memory as a source of mechanisms that might apply to sentences. The focus of these efforts has changed significantly in the past decade. As a result of changes in models of short-term working memory (ST-WM) and developments in models of sentence comprehension, the effort to relate entire components of an ST-WM system, such as those in the model developed by Baddeley (Nature Reviews Neuroscience 4: 829-839, ) to sentence comprehension has largely been replaced by an effort to relate more specific mechanisms found in modern models of ST-WM to memory processes that support one aspect of sentence comprehension-the assignment of syntactic structure (parsing) and its use in determining sentence meaning (interpretation) during sentence comprehension. In this article, we present the historical background to recent studies of the memory mechanisms that support parsing and interpretation and review recent research into this relation. We argue that the results of this research do not converge on a set of mechanisms derived from ST-WM that apply to parsing and interpretation. We argue that the memory mechanisms supporting parsing and interpretation have features that characterize another memory system that has been postulated to account for skilled performance-long-term working memory. We propose a model of the relation of different aspects of parsing and interpretation to ST-WM and long-term working memory. [ABSTRACT FROM AUTHOR]

We present a constituency parsing system for Modern Hebrew. The system is based on the PCFG-LA parsing method of Petrov et al. (2006), which is extended in various ways in order to accommodate the specificities of Hebrew as a morphologically rich language with a small treebank. We show that parsing performance can be enhanced by utilizing a language resource external to the treebank, specifically, a lexicon-based morphological analyzer. We present a computational model of interfacing the external lexicon and a treebank-based parser, also in the common case where the lexicon and the treebank follow different annotation schemes. We show that Hebrew word-segmentation and constituency-parsing can be performed jointly using CKY lattice parsing. Performing the tasks jointly is effective, and substantially outperforms a pipeline-based model. We suggest modeling grammatical agreement in a constituency-based parser as a filter mechanism that is orthogonal to the grammar, and present a concrete implementation of the method. Although the constituency parser does not make many agreement mistakes to begin with, the filter mechanism is effective in fixing the agreement mistakes that the parser does make. These contributions extend outside of the scope of Hebrew processing, and are of general applicability to the NLP community. Hebrew is a specific case of a morphologically rich language, and ideas presented in this work are useful also for processing other languages, including English. The lattice-based parsing methodology is useful in any case where the input is uncertain. Extending the lexical coverage of a treebank-derived parser using an external lexicon is relevant for any language with a small treebank. [ABSTRACT FROM AUTHOR]

This paper presents the first efficient implementation of a weighted deductive CYK parser for Probabilistic Linear Context-Free Rewriting Systems (PLCFRSs). LCFRS, an extension of CFG, can describe discontinuities in a straightforward way and is therefore a natural candidate to be used for data-driven parsing. To speed up parsing, we use different context-summary estimates of parse items, some of them allowing for A* parsing. We evaluate our parser with grammars extracted from the German NeGra treebank. Our experiments show that data-driven LCFRS parsing is feasible and yields output of competitive quality. [ABSTRACT FROM AUTHOR]

We study constituent parsing of German, a morphologically rich and less-configurational language. We use a probabilistic context-free grammar treebank grammar that has been adapted to the morphologically rich properties of German by markovization and special features added to its productions. We evaluate the impact of adding lexical knowledge. Then we examine both monolingual and bilingual approaches to parse reranking. Our reranking parser is the new state of the art in constituency parsing of the TIGER Treebank. We perform an analysis, concluding with lessons learned, which apply to parsing other morphologically rich and less-configurational languages. [ABSTRACT FROM AUTHOR]

Most morphologically rich languages with free word order use case systems to mark the grammatical function of nominal elements, especially for the core argument functions of a verb. The standard pipeline approach in syntactic dependency parsing assumes a complete disambiguation of morphological (case) information prior to automatic syntactic analysis. Parsing experiments on Czech, German, and Hungarian show that this approach is susceptible to propagating morphological annotation errors when parsing languages displaying syncretism in their morphological case paradigms. We develop a different architecture where we use case as a possibly underspecified filtering device restricting the options for syntactic analysis. Carefully designed morpho-syntactic constraints can delimit the search space of a statistical dependency parser and exclude solutions that would violate the restrictions overtly marked in the morphology of the words in a given sentence. The constrained system outperforms a state-of-the-art data-driven pipeline architecture, as we show experimentally, and, in addition, the parser output comes with guarantees about local and global morpho-syntactic wellformedness, which can be useful for downstream applications. [ABSTRACT FROM AUTHOR]

Parsing is a key task in natural language processing. It involves predicting, for each natural language sentence, an abstract representation of the grammatical entities in the sentence and the relations between these entities. This representation provides an interface to compositional semantics and to the notions of "who did what to whom." The last two decades have seen great advances in parsing English, leading to major leaps also in the performance of applications that use parsers as part of their backbone, such as systems for information extraction, sentiment analysis, text summarization, and machine translation. Attempts to replicate the success of parsing English for other languages have often yielded unsatisfactory results. In particular, parsing languages with complex word structure and flexible word order has been shown to require non-trivial adaptation. This special issue reports on methods that successfully address the challenges involved in parsing a range of morphologically rich languages (MRLs). This introduction characterizes MRLs, describes the challenges in parsing MRLs, and outlines the contributions of the articles in the special issue. These contributions present up-to-date research efforts that address parsing in varied, cross-lingual settings. They show that parsing MRLs addresses challenges that transcend particular representational and algorithmic choices. [ABSTRACT FROM AUTHOR]

Dependency trees used in syntactic parsing often include a root node representing a dummy word prefixed or suffixed to the sentence, a device that is generally considered a mere technical convenience and is tacitly assumed to have no impact on empirical results. We demonstrate that this assumption is false and that the accuracy of data-driven dependency parsers can in fact be sensitive to the existence and placement of the dummy root node. In particular, we show that a greedy, left-to-right, arc-eager transition-based parser consistently performs worse when the dummy root node is placed at the beginning of the sentence (following the current convention in data-driven dependency parsing) than when it is placed at the end or omitted completely. Control experiments with an arc-standard transition-based parser and an arc-factored graph-based parser reveal no consistent preferences but nevertheless exhibit considerable variation in results depending on root placement. We conclude that the treatment of dummy root nodes in data-driven dependency parsing is an underestimated source of variation in experiments and may also be a parameter worth tuning for some parsers. [ABSTRACT FROM AUTHOR]

A challenging aspect of Statistical Machine Translation from Arabic to English lies in bringing the Arabic source morpho-syntax to bear on the lexical as well as word-order choices of the English target string. In this article, we extend the feature-rich discriminative Direct Translation Model 2 (DTM2) with a novel linear-time parsing algorithm based on an eager, incremental interpretation of Combinatory Categorial Grammar. This way we can reap the benefits of a target syntactic enhancement that leads to more grammatical output while also enabling dynamic decoding without the risk of blowing up decoding space and time requirements. Our model defines a mix of model parameters, some of which involve DTM2 source morpho-syntactic features, and others are novel target side syntactic features. Alongside translation features extracted from the derived parse tree, we explore syntactic features extracted from the incremental derivation process. Our empirical experiments show that our model significantly outperforms the state-of-the-art DTM2 system. [ABSTRACT FROM AUTHOR]

Lexicon-Grammar tables, whose development was initiated by Gross (1975), are a very rich syntactic lexicon for the French language. They cover various lexical catégories such as verbs, nouns, adjectives and adverbs. This linguistic database is nevertheless not directly usable by computer programs, as it is incomplète and lacks consistency. Tables are defined on the basis of features which are not explicitly recorded in the lexicon. Thèse features are only described in literature. To use thèse tables, we must make explicit the essential features appearing in each one of them. In addition, many features must be renamed for consistency sake. Our aim is to adapt the tables, so as to make them usable in various Natural Language Processing (NLP) applications, in particular parsing. We describe the problems we encountered and the approaches we followed to enable their intégration into a parser. We propose LGExtract, a generic tool for generating a syntactic lexicon for NLP from the Lexicon-Grammar tables. It relies on a global table in which we added the missing features and on a single extraction script including ail opérations related to each property to be performed for ail tables. We also présent LGLex, the new generated lexicon of French verbs, predicative nouns, frozen expressions and adverbs. Then, we describe how we converted the verbs and predicatives nouns of this lexicon into the Alexina framework, that is the one of the Lejffî lexicon (Lexique des Formes Fléchies du Français) (Sagot, 2010), a freely available and large-coverage morphological and syntactic lexicon for French. This enables its intégration in the FRMG parser (French MetaGrammar) (Thomasset et de La Clergerie, 2005), a large-coverage deep parser for French, based on Tree-Adjoining Grammars (TAG), that usually relies on the Lejff. This conversion step consists in extracting the syntactic information encoded in Lexicon-Grammar tables. We describe the linguistic basis of this conversion process, and the resulting lexicon. We evaluate the FRMG parser on the référence corpus of the évaluation campaign for French parsers Passage (Produire des Annotations Syntaxiques à Grande Échelle) (Hamon et al., 2008), by comparing its Le$f-based version to our version relying on the converted Lexicon-Grammar tables. [ABSTRACT FROM AUTHOR]

Noun phrases (NPs) are a crucial part of natural language, and can have a very complex structure. However, this NP structure is largely ignored by the statistical parsing field, as the most widely used corpus is not annotated with it. This lack of gold-standard data has restricted previous efforts to parse NPs, making it impossible to perform the supervised experiments that have achieved high performance in so many Natural Language Processing (NLP) tasks. We comprehensively solve this problem by manually annotating NP structure for the entire Wall Street Journal section of the Penn Treebank. The inter-annotator agreement scores that we attain dispel the belief that the task is too difficult, and demonstrate that consistent NP annotation is possible. Our gold-standard NP data is now available for use in all parsers. We experiment with this new data, applying the Collins (2003) parsing model, and find that its recovery of NP structure is significantly worse than its overall performance. The parser's F-score is up to 5.69% lower than a baseline that uses deterministic rules. Through much experimentation, we determine that this result is primarily caused by a lack of lexical information. To solve this problem we construct a wide-coverage, large-scale NP Bracketing system. With our Penn Treebank data set, which is orders of magnitude larger than those used previously, we build a supervised model that achieves excellent results. Our model performs at 93.8% F-score on the simple NP task that most previous work has undertaken, and extends to bracket longer, more complex NPs that are rarely dealt with in the literature. We attain 89.14% F-score on this much more difficult task. Finally, we implement a post-processing module that brackets NPs identified by the Bikel (2004) parser. Our NP Bracketing model includes a wide variety of features that provide the lexical information that was missing during the parser experiments, and as a result, we outperform the parser's F-score by 9.04%. These experiments demonstrate the utility of the corpus, and show that many NLP applications can now make use of NP structure. [ABSTRACT FROM AUTHOR]

. This paper lays the foundations for a processing model of relative acceptability levels in verb phrase ellipsis (VPE). In the proposed model, mismatching VPE examples are grammatical but less acceptable because they violate heuristic parsing strategies. This analysis is presented in a Minimalist Grammar formalism that is compatible with standard parsing techniques. The overall proposal integrates computational assumptions about parsing with a psycholinguistic linking hypothesis. These parts work together with the syntactic analysis to derive novel predictions that are confirmed in a controlled experiment. [ABSTRACT FROM AUTHOR]

This article shows that the structure of bilingual material from standard parsing and alignment tools is not optimal for training syntax-based statistical machine translation (SMT) systems. We present three modifications to the MT training data to improve the accuracy of a state-of-the-art syntax MT system: re-structuring changes the syntactic structure of training parse trees to enable reuse of substructures; re-labeling alters bracket labels to enrich rule application context; and re-aligning unifies word alignment across sentences to remove bad word alignments and refine good ones. Better structures, labels, and word alignments are learned by the EM algorithm. We show that each individual technique leads to improvement as measured by BLEU, and we also show that the greatest improvement is achieved by combining them. We report an overall 1.48 BLEU improvement on the NIST08 evaluation set over a strong baseline in Chinese/English translation. [ABSTRACT FROM AUTHOR]

The paper is an attempt to see how much we can learn about a given Parsing Expression Grammar with the help of classical concepts used in the construction of predictive top-down parsers. [ABSTRACT FROM AUTHOR]

The research investigated how comprehenders use verb information during syntactic parsing. Two reading experiments investigated the relationship between verb-specific variables and reading time. These experiments were close replications of prior work; however, two statistical techniques were used, rather than one. These were item-by-item correlations and participant-by-participant regression. In Experiment 1, reading time was measured using a self-paced moving window. In Experiment 2, eye movements were recorded during reading. The results of both experiments showed that the results of two types of statistical analyses support contradictory conclusions. The analyses involving participant-by-participant regression analyses provided no evidence for the early use of verb information in parsing and support syntax-first approaches to parsing. In contrast, the results of item-by-item correlation were consistent with the prior research, supporting the view that verb information can guide initial parsing decisions. Implications for theories of parsing are discussed. [ABSTRACT FROM AUTHOR]

While rules and exemplars are usually viewed as opposites, this paper argues that they form end points of the same distribution. By representing both rules and exemplars as (partial) trees, we can take into account the fluid middle ground between the two extremes. This insight is the starting point for a new theory of language learning that is based on the following idea: If a language learner does not know which phrase-structure trees should be assigned to initial sentences, s/he allows (implicitly) for all possible trees and lets linguistic experience decide which is the “best” tree for each sentence. The best tree is obtained by maximizing “structural analogy” between a sentence and previous sentences, which is formalized by the most probable shortest combination of subtrees from all trees of previous sentences. Corpus-based experiments with this model on the Penn Treebank and the Childes database indicate that it can learn both exemplar-based and rule-based aspects of language, ranging from phrasal verbs to auxiliary fronting. By having learned the syntactic structures of sentences, we have also learned the grammar implicit in these structures, which can in turn be used to produce new sentences. We show that our model mimicks children’s language development from item-based constructions to abstract constructions, and that the model can simulate some of the errors made by children in producing complex questions. [ABSTRACT FROM AUTHOR]

Wh-dependencies are known to be formed rapidly in real-time comprehension. The parser posits the location of gap sites in advance of the bottom-up evidence for missing constituents, and must therefore have a means of deciding when and where to project dependencies. Previous studies have observed that the parser avoids building ungrammatical wh-dependencies, for example, by restricting the search for gap sites from island domains. This paper tests the stronger claim that constraints are not merely respected, but that grammatical knowledge actively prompts the construction of some representations in advance of the input. Three self-paced reading experiments examined patterns of wh-dependency formation in multiple-dependency constructions: obligatory across-the-board (ATB) extraction from coordinated verb phrases, and from optional parasitic gaps in post-verbal adjunct clauses. The key finding is that comprehenders immediately enforce the requirement for extraction from coordinates, and hence actively search for multiple gap sites within a coordinate VP; but they do not search for post-verbal parasitic gaps. This difference cannot be attributed to relative differences in acceptability, as comprehenders rated both of these multiple-gap constructions equally highly, nor can it be explained by general parsing incentives to develop maximal incremental interpretations of partial strings. More plausibly, the difference reflects the deployment of detailed grammatical knowledge in a parser that is motivated to satisfy structural licensing requirements in real time. [ABSTRACT FROM AUTHOR]

An eye tracking experiment examined how exposure to a second language (L2) influences sentence parsing in the first language. Forty-four monolingual Spanish speakers, 24 proficient Spanish–English bilinguals with limited immersion experience in the L2 environment and 20 proficient Spanish–English bilinguals with extensive L2 immersion experience read temporarily ambiguous constructions. The ambiguity concerned whether a relative clause (RC) that appeared after a complex noun phrase (NP) was interpreted as modifying the first or the second noun in the complex NP (El policía arrestó a la hermana del criado que estaba enferma desde hacía tiempo). The results showed that whereas the Spanish monolingual speakers and the Spanish–English bilinguals with limited exposure reliably attached the relative clause to the first noun, the Spanish–English bilingual with extensive exposure attached the relative to the second noun. Results are discussed in terms of models of sentence parsing most consistent with the findings. [ABSTRACT FROM AUTHOR]

Exemplar-based models of language propose that human language production and understanding operate with a store of concrete linguistic experiences rather than with abstract linguistic rules. While exemplar-based models are well acknowledged in areas like phonology and morphology, common wisdom has it that they are intrinsically flawed for syntax where infinite generative capacity is needed. This article shows that this common wisdom is wrong. It starts out by reviewing an exemplar-based syntactic model, known as Data-Oriented Parsing, or DOP, which operates on a corpus of phrase-structure trees. While this model is productive, it is inadequate from the point of grammatical productivity. We therefore extend it to the more sophisticated linguistic representations proposed by Lexical-Functional Grammar theory, resulting in the model known as LFG-DOP, which does allow for meta-linguistic judgments of acceptability. We show how DOP deals with first language acquisition, suggesting a unified model for language learning and language use, and go into a number of syntactic phenomena that can be explained by DOP but that challenge rule-based models. We argue that if there is anything innate in language cognition it is not Universal Grammar but "Universal Representation." [ABSTRACT FROM AUTHOR]

In order to investigate second language (L2) processing at ultimate attainment, 20 first language (L1) English and 20 L1 Dutch advanced to near-native speakers of German as well as 20 native Germans were tested in two experiments on subject–object ambiguities in German. The results from a self-paced reading task and a speeded acceptability judgement task show that the lower-proficient advanced learners in this study display the same processing preferences as natives in reading accuracy yet fail to demonstrate differential response latencies associated with native syntactic reanalysis. By contrast, near-native speakers of either L1 converge on incremental native reanalysis patterns. Together, the findings highlight the role of proficiency for processing the target language since it is only at near-native levels of proficiency that non-natives converge on native-like parsing. The results support the view that endstate non-native processing and native processing are qualitatively identical. [ABSTRACT FROM AUTHOR]

Anterior negativities obtained when a grammatical rule is violated may reflect highly automatic first-pass parsing processes, the detection of a morphosyntactic mismatch, and/or the inability to assign the incoming word to the current phrase structure. However, for some theorists these negativities rather reflect some aspect of working memory processes. Event-related brain potentials (ERPs) obtained for word category and morphosyntactic violations were directly compared with effects obtained when working memory is particularly demanded (embedding subject- or object-relative clauses), yielding a significant dissociation in terms of topography. Even though, the anterior negativities for grammatical violations vanished when relative clauses were embedded, suggesting that the processes reflected by anterior negativities related to grammatical violations and those related to working memory manipulations, even if different, are placing demands on a common pool of limited resources. [ABSTRACT FROM AUTHOR]

Grammatical Framework (GF) is a special-purpose functional language for defining grammars. It uses a Logical Framework (LF) for a description of abstract syntax, and adds to this a notation for defining concrete syntax. GF grammars themselves are purely declarative, but can be used both for linearizing syntax trees and parsing strings. GF can describe both formal and natural languages. The key notion of this description is a grammatical object, which is not just a string, but a record that contains all information on inflection and inherent grammatical features such as number and gender in natural languages, or precedence in formal languages. Grammatical objects have a type system, which helps to eliminate run-time errors in language processing. In the same way as a LF, GF uses dependent types in abstract syntax to express semantic conditions, such as well-typedness and proof obligations. Multilingual grammars, where one abstract syntax has many parallel concrete syntaxes, can be used for reliable and meaning-preserving translation. They can also be used in authoring systems, where syntax trees are constructed in an interactive editor similar to proof editors based on LF. While being edited, the trees can simultaneously be viewed in different languages. This paper starts with a gradual introduction to GF, going through a sequence of simpler formalisms till the full power is reached. The introduction is followed by a systematic presentation of the GF formalism and outlines of the main algorithms: partial evaluation and parser generation. The paper concludes by brief discussions of the Haskell implementation of GF, existing applications, and related work. [ABSTRACT FROM AUTHOR]