Tree unification grammar

Xem 1-7 trên 7 kết quả Tree unification grammar
  • Tree Unification Grammar is a declarative unification-bas~:l linguistic framework. The basic grammar stmaures of this framework are partial descriptions of trees, and the framework requires only a single grammar rule to combine these partial descriptions. Using this framework, constraints associated with various linguistic phenomena (reflexivisationin particular)~ be stated succinctlyin the lexicon.

    pdf9p bungio_1 03-05-2013 25 2   Download

  • This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs and products of them. The polarization of the objects of the elementary structures controls the saturation of the final structure. This formalism is both elementary and powerful enough to strongly simulate many grammar formalisms, such as rewriting systems, dependency grammars, TAG, HPSG and LFG.

    pdf8p hongvang_1 16-04-2013 28 1   Download

  • This paper describes how to construct a finite-state machine (FSM) approximating a 'unification-based' grammar using a left-corner grammar transform. The approximation is presented as a series of grammar transforms, and is exact for left-linear and rightlinear CFGs, and for trees up to a user-specified depth of center-embedding.

    pdf5p bunrieu_1 18-04-2013 29 2   Download

  • In this paper we introduce a logic for describing trees which allows us to reason about both the parent and domination relationships.

    pdf9p bunmoc_1 20-04-2013 28 1   Download

  • This paper defines multiset-valued linear index grammar and unordered vector grammar with dominance links. The former models certain uses of multisetvalued feature structures in unification-based formalisms, while the latter is motivated by word order variation and by "quasi-trees", a generalization of trees. The two formalisms are weakly equivalent, and an important subset is at most context-sensitive and polynomially parsable.

    pdf8p bunmoc_1 20-04-2013 39 1   Download

  • We present an algorithm for generating strings from logical form encodings that improves upon previous algorithms in that it places fewer restrictions on the class of grammars to which it is applicable. In particular, unlike an Earley deduction generator (Shieber, 1988), it allows use of semantically nonmonotonic grammars, yet unlike topdown methods, it also permits left-recursion. The enabling design feature of the algorithm is its implicit traversal of the analysis tree for the string being generated in a semantic-head-driven fashion. ...

    pdf11p bungio_1 03-05-2013 35 1   Download

  • One of the claimed benefits of Tree Adjoining G r a m m a r s is that they have an extended domain of locality (EDOL). We consider how this can be exploited to limit the need for feature structure unification during parsing. We compare two wide-coverage lexicalized g r a m m a r s of English, LEXSYS and XTAG, finding that the two grammars exploit EDOL in different ways.

    pdf8p bunthai_1 06-05-2013 39 2   Download



p_strKeyword=Tree unification grammar

nocache searchPhinxDoc


Đồng bộ tài khoản