Generating with unification grammars

Xem 1-3 trên 3 kết quả Generating with unification grammars
  • Recent developments in generation algorithms have enabled work in nnificafion-based computational linguistics to approach more closely the ideal of grammars as declarative statements of linguistic facts, neutral between analysis an0_synthesis, x-"~-oui this perspective, however, the situation is still far from perfect; all known methods of generation impose constraints on the grammars they assume.

    pdf7p bungio_1 03-05-2013 35 1   Download

  • This paper proposes a method for generating a logicalconstraint-based internal representation from a unification grammar formalism with disjunctive information. Unification grammar formalisms based on path equations and lists of pairs of labels and values are better than those based on first-order terms in that the former is easier to describe and to understand. Parsing with term-based internal representations is more efficient than parsing with graph-based representations.

    pdf5p bunrieu_1 18-04-2013 28 2   Download

  • A simple formalism is proposed to represent the contexts in which pronouns, definite/indefinite descriptions, and ordinal descriptions (e.g. 'the second book') can be used, and the way in which these expressions change the context. It is shown that referring expressions can be generated by a unification grammar provided that some phrase-structure rules are specially tailored to express entities in the current knowledge base.

    pdf6p bunthai_1 06-05-2013 31 2   Download



p_strKeyword=Generating with unification grammars

nocache searchPhinxDoc


Đồng bộ tài khoản