Highly ambiguous lexicons

Xem 1-3 trên 3 kết quả Highly ambiguous lexicons
  • Department of Linguistics The University of Texas at Austin Austin, Texas 78712 or trigram Hidden Markov Model (HMM). Ravi and Knight (2009) achieved the best results thus far (92.3% word token accuracy) via a Minimum Description Length approach using an integer program (IP) that finds a minimal bigram grammar that obeys the tag dictionary constraints and covers the observed data.

    pdf9p hongdo_1 12-04-2013 37 2   Download

  • Natural language systems based on Categorial Unification Grammar (CUG) have mainly employed bottomup parsing algorithms for processing. Conventional prediction techniques to improve the efficiency of the • parsing process, appear to fall short when parsing CUG. Nevertheless, prediction seems necessary when parsing grammars with highly ambiguous lexicons or with noncanonical categorial rules. In this paper we present a lexicalist prediction technique for CUG and show thai this may lead to considerable gains in efficiency for both bottom-up and top-down parsing. ...

    pdf6p buncha_1 08-05-2013 31 1   Download

  • Morphological processes in Semitic languages deliver space-delimited words which introduce multiple, distinct, syntactic units into the structure of the input sentence. These words are in turn highly ambiguous, breaking the assumption underlying most parsers that the yield of a tree for a given sentence is known in advance. Here we propose a single joint model for performing both morphological segmentation and syntactic disambiguation which bypasses the associated circularity.

    pdf9p hongphan_1 15-04-2013 32 3   Download



p_strKeyword=Highly ambiguous lexicons

nocache searchPhinxDoc


Đồng bộ tài khoản