Syntactic extensions

Ebook English grammar – A university course present the content: numerous authentic texts from a wide range of sources, both spoken and written, which exemplify the grammatical description; clear chapter and unit summaries which enable efficient class preparation and student revision; extensive exercises with a comprehensive answer key.

551p kikyou751998 31-05-2020 60 8   Download

Chapter 18 - Testing web applications. In this section, the key quality dimensions of web applications are listed; Content is an important factor that includes syntactic and semantic of content. Function is referred to conformance to requirements whereas structure of web application should be extensible. Usability of web application is related to user interface and navigability of web application is about the links to other pages.

23p nanhankhuoctai3 25-05-2020 10 0   Download

This paper presents a method for parsing associative Lambek grammars based on graphtheoretic properties. Connection graphs, which are a simplified version of proof-nets, are actually a mere conservative extension of the earlier method of syntactic connexion, discovered by Ajduckiewicz [1935]. The method amounts to find alternating spanning trees in graphs. A sketch of an algorithm for finding such a tree is provided. Interesting properties of time-complexity for this method are expected.

8p buncha_1 08-05-2013 47 1   Download

We show how idioms can be parsed in lexiealized TAGs. We rely on extensive studies of frozen phrases pursued at L.A.D.L) that show that idioms are pervasive in natural language and obey, generally speaking, the same morphological and syntactical patterns as 'free' structures. By idiom we mean a structure in which some items are lexically frozen and have a semantics that is not compositional. We thus consider idioms of different syntactic categories : NP, S, adverbials, compound prepositions.., in both English and French.

9p buncha_1 08-05-2013 46 2   Download

In this paper we present an efficient context-free (CF) bottom-up, non deterministic parser. It is an extension of the ICA (Immediate Constituent Analysis) parser proposed by Grishman (1976), and its major improvements are described. It has been designed to run Augmented Phrase-Structure Grammars (APSG) and performs semantic interpretation in parallel with syntactic analysis.

7p buncha_1 08-05-2013 41 1   Download

Syntactic constraints in Koskenniemi's Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turns out that although the constraints in Voutilainen's (1994) FSIG description of English make use of several extensions to regular expressions, the description as a whole reduces to a finite combination of union, complement and concatenation. This is an essential improvement to the descriptive complexity of ENGFSIG.

8p bunthai_1 06-05-2013 42 1   Download

The structure imposed upon spoken sentences by intonation seems frequently to be orthogohal to their traditional surface-syntactic structure. However, the notion of "intonational structure" as formulated by Pierrehumbert, Selkirk, and others, can be subsumed under a rather different notion of syntactic surface structure that emerges from a theory of grammar based on a "Combinatory" extension to Categorial Gram, mar.

8p bungio_1 03-05-2013 45 2   Download

There has recendy been a revival of interest in Categorial Grammars (CG) among computational linguists. The various versions noted below which extend pure C G by including operations such as functional composition have been claimed to offer simple and uniform accounts of a wide range of natural language (NL) constructions involving bounded and unbounded "movement" and coordination "reduction" in a number of languages. Such grammars have obvious advantages for computational applications, provided that they can be parsed efficiently.

8p bungio_1 03-05-2013 47 2   Download

By integrating syntactic and semantic processing, our parser (LAZY) is able to deterministically parse sentences which syntactically appear to be garden path sentences although native speakers do not need conscious reanalysis to understand them. LAZY comprises an extension to conceptual analysis which yields an explicit representation of syntactic information and a flexible interaction between semantic and syntactic knowledge. 1. INTRODUCTION The phenomenon we wish to model is the understanding of garden path sentences (GPs) by native speakers of English. ...

5p bungio_1 03-05-2013 34 1   Download

I entered the field of computational linguistics in 1967 and one of my earliest recollections is of studying the Harvard Syntactic Analyzer. To this date, this parser is one of the best documented programs and the extensive discussions cover a wide range of English syntax. It is sobering to recall that this analyzer was implemented on an IBM 7090 computer using 32K words of memory with tape as its mass storage medium. A great deal of attention was focussed on means to deal with the main memory and mass storage limitations. ...

3p bungio_1 03-05-2013 39 3   Download

This paper describes a sentence generator that was built primarily to focus on syntactic form and syntactic relationships. Our main goal was to produce a tutorial system for the English language; the intended users of the system are people with language delaying handicaps such as deafness, and people learning English as a foreign language. For these populations, extensive exposure to standard English constructions (negatives, questions, relatlvization, etc.) and their interactions is necessary. ...

6p bungio_1 03-05-2013 58 2   Download

This paper describes a system that leads us to believe in the feasibility of constructing natural spoken dialogue systems in task-oriented domains. It specifically addresses the issue of robust interpretation of speech in the presence of recognition errors. Robustness is achieved by a combination of statistical error post-correction, syntactically- and semantically-driven robust parsing, and extensive use of the dialogue context.

9p bunmoc_1 20-04-2013 37 2   Download

An extension to classical unification, called graded unification is presented. It is capable of combining contradictory information. An interactive processing paradigm and parser based on this new operator are also presented. Introduction Improved understanding of the nature of knowledge used in human language processing suggests the feasibility of interactive models in computational linguistics (CL). Recent psycholinguistic work such as (Stowe, 1989; Trueswell et al., 1994) has documented rapid employment of semantic information to guide human syntactic processing. ...

3p bunmoc_1 20-04-2013 37 1   Download

" Dept. of Computer and Information Sciences University of Pennsylvania P h i l a d e l p h i a , PA 1 9 1 0 4 (hoffman@ linc.cis.upenn.edu) INTRODUCTION In this paper, I present work in progress on an extension of Combinatory Categorial Grammars, CCGs, (Steedman 1985) to handle languages with freer word order than English, specifically Turkish. The approach I develop takes advantage of CCGs' ability to combine the syntactic as well as the semantic representations of adjacent elements in a sentence in an incremental manner. The linguistic claim behind my approach is that free word...

3p bunmoc_1 20-04-2013 48 3   Download

This paper presents a connectionist syntactic parser which uses Structure Unification Grammar as its grammatical framework. The parser is implemented in a connectionist architecture which stores and dynamically manipulates symbolic representations, but which can't represent arbitrary disjunction and has bounded memory. These problems can be overcome with Structure Unification Grammar's extensive use of partial descriptions.

8p bunmoc_1 20-04-2013 34 2   Download

We address the problem of clustering words (or constructing a thesaurus) based on co-occurrence data, and using the acquired word classes to improve the accuracy of syntactic disambiguation. We view this problem as that of estimating a joint probability distribution specifying the joint probabilities of word pairs, such as noun verb pairs. We propose an efficient algorithm based on the Minimum Description Length (MDL) principle for estimating such a probability distribution. Our method is a natural extension of those proposed in (Brown et al.

7p bunrieu_1 18-04-2013 34 3   Download

We explore the descriptive power, in terms of syntactic phenomena, of a formalism that extends TreeAdjoining Grammar (TAG) by adding a fourth level of hierarchical decomposition to the three levels TAG already employs.

8p bunbo_1 17-04-2013 43 2   Download

LE-PAROLE project for the morphological and syntactic layers, the LE-SIMPLE project for the semantic model and lexicon and the Italian project CLIPS 2 for the phonological level and the extension of the lexical coverage. The theoretical model underlying this lexicon is based on the EAGLES recommendations, on the results of the EWN and ACQUILEX projects and on a revised version of Pustejovsky’s Generative Lexicon theory (Pustejovsky 1995).

4p hongvang_1 16-04-2013 38 1   Download

This paper presents recent extensions to Poliqarp, an open source tool for indexing and searching morphosyntactically annotated corpora, which turn it into a tool for indexing and searching certain kinds of treebanks, complementary to existing treebank search engines. In particular, the paper discusses the motivation for such a new tool, the extended query syntax of Poliqarp and implementation and efficiency issues.

4p hongvang_1 16-04-2013 39 1   Download

Statistical MT has made great progress in the last few years, but current translation models are weak on re-ordering and target language fluency. Syntactic approaches seek to remedy these problems. In this paper, we take the framework for acquiring multi-level syntactic translation rules of (Galley et al.

8p hongvang_1 16-04-2013 47 2   Download