intTypePromotion=1
ADSENSE

Robed j. p. ingria david

Xem 1-1 trên 1 kết quả Robed j. p. ingria david
  • This paper describes an implemented mechanism for handling bound anaphora, disjoint reference, and pronominal reference. The algorithm maps over every node in a parse tree in a left-to-right, depth first manner. Forward and backwards coreference, and disjoint reference are assigned during this tree walk. A semantic interpretation procedure is used to deal with multiple antecedents.

    pdf10p bungio_1 03-05-2013 30 2   Download

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

ADSENSE

p_strKeyword=Robed j. p. ingria david
p_strCode=robedjpingriadavid

nocache searchPhinxDoc

 

Đồng bộ tài khoản