Attribute grammars

Ebook "Formal syntax and semantics of programming languages" includes content: Specifying syntax, introduction to laboratory activities, attribute grammars, two level grammars, the lambda calculus, self definition of programming languages, translational semantics, traditional operational semantics,.... and other contents.

654p haojiubujain07 20-09-2023 4 3   Download

Part 1 of book "Compiler Construction" provide students with knowledge about: language and syntax; regular languages; analysis of context-free languages; attributed grammars and semantics; the programming language Oberon-0; a parser for Oberon-0; consideration of context specified by declarations; a RISC architecture as target; expressions and assignments;...

60p britaikridanik 05-07-2022 11 3   Download

Lecture Compiler construction: Lesson 31 - Sohail Aslam. The main topics covered in this chapter include: beyond syntax, context-sensitive analysis, use ad-hoc techniques: symbol tables, ad-hoc code; attribute grammars, synthesized attributes, inherited attributes,...

28p youzhangjing_1909 28-04-2022 10 1   Download

Lecture Compiler construction: Lesson 32 - Sohail Aslam. The main topics covered in this chapter include: evaluation methods, dynamic methods, rule-based (treewalk), attribute grammars have not achieved widespread use due to a myraid of problems, traversing parse tree, storage management for short-lived attributes,...

30p youzhangjing_1909 28-04-2022 14 1   Download

This article aims to make it clear that it is not quite satisfactory if we attribute any language difference between authentic English and the English we are learning and teaching only to the informal style.

5p viriyadh2711 19-12-2019 36 4   Download

Attribute grammars are an elegant formalization of the augmented context-free grammars characteristic of most current natural language systems. This paper presents an extension of Earley's algorithm to Knuth's attribute grammars, considering the case of S-attributed grammars. For this case, we study the conditions on the underlying base grammar under which the extended algorithm may be guaranteed to terminate. Finite partitioning of attribute domains is proposed to guarantee the termination of the algorithm, without the need for any restrictions on the context-free base. ...

4p buncha_1 08-05-2013 41 2   Download

This paper describes a classical logic for attribute-value (or feature description) languages which ate used in urfification grammar to describe a certain kind of linguistic object commonly called attribute-value structure (or feature structure). Tile algorithm which is used for deciding satisfiability of a feature description is based on a restricted deductive closure construction for sets of literals (atomic formulas and negated atomic formulas). In contrast to the Kasper/Rounds approach (cf.

6p buncha_1 08-05-2013 34 1   Download

The paper presents an application of Structural Correspondence Learning (SCL) (Blitzer et al., 2006) for domain adaptation of a stochastic attribute-value grammar (SAVG). So far, SCL has been applied successfully in NLP for Part-of-Speech tagging and Sentiment Analysis (Blitzer et al., 2006; Blitzer et al., 2007). An attempt was made in the CoNLL 2007 shared task to apply SCL to non-projective dependency parsing (Shimizu and Nakagawa, 2007), however, without any clear conclusions.

9p bunthai_1 06-05-2013 49 3   Download

Kay's functional-unification grammar notation [5] is a way of expressing grammars which relies on very few primitive notions. The primary syntactic structure is the feature structure, which can be visualised as a directed graph with arcs labeled by attributes of a constituent, and the primary structure-building operation is unification. In this paper we propose a mathematical formulation of FUG, using logic to give a precise account of the strings and the structures defined by any grammar written in this notation. ...

8p bungio_1 03-05-2013 39 1   Download

The syntactic analysis of languages with respect to Government-binding (GB) grammar is a problem that has received relatively little attention until recently. This paper describes an attribute grammar specification of the Government-binding theory. The paper focuses on the description of the attribution rules responsible for determining antecedent-trace relations in phrase-structure trees, and on some theoretical implications of those rules for the G B model.

7p bungio_1 03-05-2013 47 2   Download

Various feature descriptions are being employed in constrained-based grammar formalisms. The common notational primitive of these descriptions are functional attributes called features. The descriptions considered in this paper are the possibly quantified first-order formulae obtained from a signature of features and sorts. We establish a complete firstorder theory F T by means of three axiom schemes and construct three elementarily equivalent models. One of the models consists of so-called feature graphs, a data structure common in computational linguistics. ...

8p bunmoc_1 20-04-2013 34 1   Download

The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition problem for linear context-free rewriting languages is studied at length here, presenting evidence that, even in some restricted cases, it cannot be solved efficiently. This entails the existence of a gap between, for example, tree adjoining languages and the subclass of linear context-free rewriting languages that generalizes the former class; such a gap is attributed to "crossing configurations".

7p bunmoc_1 20-04-2013 43 1   Download

The form of rules in ¢ombinatory categorial grammars (CCG) is constrained by three principles, called "adjacency", "consistency" and "inheritance". These principles have been claimed elsewhere to constrain the combinatory rules of composition and type raising in such a way as to make certain linguistic universals concerning word order under coordination follow immediately.

8p bunmoc_1 20-04-2013 39 2   Download

Parametric polymorphism has been combined with inclusional polymorphism to provide natural type systems for Prolog (DH88), HiLog (YFS92), and coristraint resolution languages (Smo89), and, in linguistics, by HPSG-like grammars to classify lists and sets of linguistic objects (PS94), and by phonologists in representations of hierarchical structure (Kle91).

7p bunrieu_1 18-04-2013 39 3   Download

In this paper, we present a stochastic language model for Japanese using dependency. The prediction unit in this model is all attribute of "bunsetsu". This is represented by the product of the head of content words and that of function words. The relation between the attributes of "bunsetsu" is ruled by a context-free grammar. The word sequences axe predicted from the attribute using word n-gram model. The spell of U n k n o w word is predicted using character n-grain model.

7p bunrieu_1 18-04-2013 46 3   Download

This paper considers three assumptions conventionally made about signatures in typed feature logic that are in potential disagreement with current practice among grammar developers and linguists working within feature-based frameworks such as HPSG: meet-semilatticehood, unique feature introduction, and the absence of subtype covering.

8p bunrieu_1 18-04-2013 37 3   Download

In this paper we investigate the benefit of stochastic predictor components for the parsing quality which can be obtained with a rule-based dependency grammar. By including a chunker, a supertagger, a PP attacher, and a fast probabilistic parser we were able to improve upon the baseline by 3.2%, bringing the overall labelled accuracy to 91.1% on the German NEGRA corpus. We attribute the successful integration to the ability of the underlying grammar model to combine uncertain evidence in a soft manner, thus avoiding the problem of error propagation. ...

8p hongvang_1 16-04-2013 47 2   Download

An attractive property of attribute-value grammars is their reversibility. Attribute-value grammars are usually coupled with separate statistical components for parse selection and fluency ranking. We propose reversible stochastic attribute-value grammars, in which a single statistical model is employed both for parse selection and fluency ranking.

6p hongdo_1 12-04-2013 47 3   Download

In this paper, we present a novel approach for authorship attribution, the task of identifying the author of a document, using probabilistic context-free grammars. Our approach involves building a probabilistic context-free grammar for each author and using this grammar as a language model for classification. We evaluate the performance of our method on a wide range of datasets to demonstrate its efficacy. (2008) use a combination of word-level statistics and part-of-speech counts or n-grams. ...

5p hongdo_1 12-04-2013 54 2   Download

As a linguistic study, the book is an exploration of how one framework can account for tense in English, rather than a comparative study of other analyses or a comparison of our analysis with the analyses of other authors. Because of this, unless a particular analysis or argument is specifically attributable to one author, there arc few references to competing analyses, or to the huge number of books and articles dealing with tense in English.

7p kathy214 21-09-2010 63 3   Download