intTypePromotion=1
zunia.vn Tuyển sinh 2024 dành cho Gen-Z zunia.vn zunia.vn
ADSENSE

Lexical functional grammar

Xem 1-20 trên 25 kết quả Lexical functional grammar
  • This paper defines a language Z~ for specifying LFG grammars. This enables constraints on LFG's composite ontology (c-structures synchronised with fstructures) to be stated directly; no appeal to the LFG construction algorithm is needed. We use f to specify schemata annotated rules and the LFG uniqueness, completeness and coherence principles. Broader issues raised by this work are noted and discussed.

    pdf6p buncha_1 08-05-2013 37 2   Download

  • We argue that the resource sharing that is commonly manifest in semantic accounts of coordination is instead appropriately handled in terms of structure-sharing in LFG f-structures. We provide an extension to the previous account of LFG semantics (Dalrymple et al., 1993a) according to which dependencies between f-structures are viewed as resources; as a result a one-to-one correspondence between uses of f-structures and meanings is maintained.

    pdf8p buncha_1 08-05-2013 36 1   Download

  • The HPSG grammars we are using, closely resemble the proposals in [Pollard and Sag, 1987]. As far as the coding of the lexical functions is concerned, we have simply interpreted these as relation names. 3 Representation The main aim of the ET-10/?5 project, 'Collocations and the Lexicalisation of Semantic Operations '1, is to evaluate the use of Mel'~uk's analysis of collocations in terms of lexical functions 2, as an interlingun device in a machine translation system.

    pdf1p buncha_1 08-05-2013 52 1   Download

  • The formal architecture of Lexical Functional Grammar offers a particular formal device, the structural correspondence, for modularizing the mapping between the surface forms of a language and representations of their underlying meanings. This approach works well when the structural discrepancies between form and meaning representations are finitely bounded, but there are some phenomena in natural language, e.g. adverbs in English, where this restriction does not hold.

    pdf8p buncha_1 08-05-2013 44 3   Download

  • We think the parts are of interest in their o~. The paper consists of three sections: (I) We give a detailed description of the PROLOG implementation of the parser which is based on the theory of lexical functional grammar (I/V.). The parser covers the fragment described in [1,94]. I.e., it is able to analyse constructions involving functional control and long distance dependencies.

    pdf6p buncha_1 08-05-2013 67 2   Download

  • A recognition grammar to supply information to a text-to-speech system for the synthesis of Italian must rely heavily upon lexical information, in order to instantiate the appropriate grammatical relations. Italian is an almost free word order language which nonetheless adopts f a i r l y analysable strategies to move major constituents: some of these can strongly affect the functioning of the phonotogical component. Two basic claims w i l l be made: i. d i f f i c u l t i e s in associating grammatical functions to constituent structure can be overcome only i f...

    pdf10p buncha_1 08-05-2013 38 2   Download

  • We present an algorithm for simultaneously constructing both the syntax and semantics of a sentence using a Lexicalized Tree Adjoining Grammar (LTAG). This approach captures naturally and elegantly the interaction between pragmatic and syntactic constraints on descriptions in a sentence, and the inferential interactions between multiple descriptions in a sentence. At the same time, it exploits linguistically motivated, declarative specifications of the discourse functions of syntactic constructions to make contextually appropriate syntactic choices. ...

    pdf8p bunthai_1 06-05-2013 46 3   Download

  • Probabilistic accounts of language processing can be psychologically tested by comparing word-reading times (RT) to the conditional word probabilities estimated by language models. Using surprisal as a linking function, a significant correlation between unlexicalized surprisal and RT has been reported (e.g., Demberg and Keller, 2008), but success using lexicalized models has been limited. In this study, phrase structure grammars and recurrent neural networks estimated both lexicalized and unlexicalized surprisal for words of independent sentences from narrative sources. ...

    pdf11p bunthai_1 06-05-2013 45 3   Download

  • We present several algorithms for assigning heads in phrase structure trees, based on different linguistic intuitions on the role of heads in natural language syntax. Starting point of our approach is the observation that a head-annotated treebank defines a unique lexicalized tree substitution grammar. This allows us to go back and forth between the two representations, and define objective functions for the unsupervised learning of head assignments in terms of features of the implicit lexicalized tree grammars.

    pdf9p bunthai_1 06-05-2013 41 1   Download

  • Topological Dependency Grammar (TDG) is a lexicalized dependency grammar formalism, able to model languages with a relatively free word order. In such languages, word order variation often has an important function: the realization of information structure. The paper discusses how to integrate information structure into TDG, and presents a constraint-based approach to modelling information structure and the various means to realize it, focusing on (possibly simultaneous use of) word order and tune. ...

    pdf8p bunthai_1 06-05-2013 48 3   Download

  • INKA is a natural language interface to facilitate knowledge acquisition during expert system development for electronic instrument trouble-thooting. The expert system design methodology develops a domain definition, called GLIB, in the form of a semantic grammar. This grammar format enables GLIB to be used with the INGLISH interface, which constrains users to create statements within a subset of English. Incremental patting in INGLISH allows immediate remedial information to be generated if a user deviates from the sublanguage.

    pdf8p bungio_1 03-05-2013 61 1   Download

  • The design, implementation, and use of grammar forma]isms for natural language have constituted a major branch of coml)utational linguistics throughout its development. By viewing grammar formalisms as just a special ease of computer languages, we can take advantage of the machinery of denotational semantics to provide a precise specification of their meaning.

    pdf7p bungio_1 03-05-2013 52 2   Download

  • An important goal of ntodent linguistic theory is to characterize as narrowly as possible the class of natural !anguaooes. An adequate linguistic theory should be broad enough to cover observed variation iu human languages, and yet narrow enough to account for what might be dubbed "cognitive demands" -- among these, perhaps, the demands of lcarnability and pars,ability. If cognitive demands are to carry any real theoretical weight, then presumably a language may be a (theoretically) pos~ible human language, and yet be "inaccessible" because it is not leanmble or pa~able. ...

    pdf6p bungio_1 03-05-2013 28 2   Download

  • A number of grammatical formalisms were introduced to define the syntax of natural languages. Among them are parallel multiple context-free grammars (pmcfg's) and lexical-functional grammars (lfg's). Pmcfg's and their subclass called multiple context-free grammars (mcfg's) are natural extensions of cfg's, and pmcfg's are known to be recognizable in polynomial time. Some subclasses of lfg's have been proposed, but they were shown to generate an AlP-complete language. Finite state translation systems (fts') were introduced as a computational model of transformational grammars. ...

    pdf10p bunmoc_1 20-04-2013 47 1   Download

  • We present a stochastic parsing system consisting of a Lexical-Functional Grammar (LFG), a constraint-based parser and a stochastic disambiguation model. We report on the results of applying this system to parsing the UPenn Wall Street Journal (WSJ) treebank. The model combines full and partial parsing techniques to reach full grammar coverage on unseen data. The treebank annotations are used to provide partially labeled data for discriminative statistical estimation using exponential models.

    pdf8p bunmoc_1 20-04-2013 40 2   Download

  • Discourse markers ('cue words') are lexical items that signal the kind of coherence relation holding between adjacent text spans; for example, because, since, and for this reason are different markers for causal relations. Discourse markers are a syntactically quite heterogeneous group of words, many of which are traditionally treated as function words belonging to the realm of grammar rather than to the lexicon.

    pdf5p bunrieu_1 18-04-2013 45 3   Download

  • This paper describes a wide-coverage Japanese grammar based on HPSG. The aim of this work is to see the coverage and accuracy attainable using an underspecified grammar. Underspecification, allowed in a typed feature structure formalism, enables us to write down a wide-coverage grammar concisely. The grammar we have implemented consists of only 6 ID schemata, 68 lexical entries (assigned to functional words), and 63 lexical entry templates (assigned to parts of speech ( B O S s ) ) .

    pdf5p bunrieu_1 18-04-2013 56 4   Download

  • The "glue" approach to semantic composition in Lexical-Functional Grammar uses linear logic to assemble meanings from syntactic analyses (Dalrymple et al., 1993). It has been compurationally feasible in practice (Dalrymple et al., 1997b). Yet deduction in linear logic is known to be intractable. Even the propositional tensor fragment is NP complete(Kanovich, 1992). In this paper, we investigate what has made the glue approach computationally feasible and show how to exploit that to efficiently deduce underspecified representations. ...

    pdf7p bunrieu_1 18-04-2013 47 3   Download

  • We present an LFG-DOP parser which uses fragments from LFG-annotated sentences to parse new sentences. Experiments with the Verbmobil and Homecentre corpora show that (1) Viterbi n best search performs about 100 times faster than Monte Carlo search while both achieve the same accuracy; (2) the DOP hypothesis which states that parse accuracy increases with increasing fragment size is confirmed for LFG-DOP; (3) LFGDOP's relative frequency estimator performs worse than a discounted frequency estimator; and (4) LFG-DOP significantly outperforms TreeDOP if evaluated on tree structures only.

    pdf8p bunrieu_1 18-04-2013 52 2   Download

  • We introduce a MetaGrammar, which allows us to automatically generate, from a single and compact MetaGrammar hierarchy, parallel Lexical Functional Grammars (LFG) and Tree-Adjoining Grammars (TAG) for French and for English: the grammar writer specifies in compact manner syntactic properties that are potentially framework-, and to some extent language-independent (such as subcategorization, valency alternations and realization of syntactic functions), from which grammars for several frameworks and languages are automatically generated offline. ...

    pdf8p bunbo_1 17-04-2013 40 1   Download

CHỦ ĐỀ BẠN MUỐN TÌM

ADSENSE

nocache searchPhinxDoc

 

Đồng bộ tài khoản
2=>2