Báo cáo khoa học: "COMPUTER METHODS FOR MORPHOLOGICAL ANALYSIS" doc

... word recognition mechanisms for these dictionaries. One of the more important issues in word recognition for all morphologically complex languages involves mechanisms for dealing with affixes. ... COMPUTER METHODS FOR MORPHOLOGICAL ANALYSIS Roy J. Byrd, Judith L. Klavans I.B.M. Thomas J. Watson Research ... the other hand, to reject ill-formed words. On the other hand, we wa...

Ngày tải lên: 24/03/2014, 02:20

... are required for the word forms of a given language. A part of such a ma- chine is shown in Figure 1. The sequences which this will generate are those required for the Future forms both of ... morphosyntactic properties form the first entries in a block SUBSCRIPT (Box Al). Thus, for the word realized by canterébbero, LEXEME and SUBSCRIPT will read: PROCEDURE FOR MORPHOLOGI...

Ngày tải lên: 07/03/2014, 18:20

... Association for Computational Linguistics Ensemble Methods for Unsupervised WSD Samuel Brody School of Informatics University of Edinburgh s.brody@sms.ed.ac.uk Roberto Navigli Dipartimento di Informatica Universit ` a ... Informatics University of Edinburgh mlap@inf.ed.ac.uk Abstract Combination methods are an effective way of improving system performance. This paper examines the bene...

Ngày tải lên: 08/03/2014, 02:21

... Feature set for CRF. responding feature from the Plain feature group that also includes the lexical form of the predicate is most likely a sparse feature. For the opinion holder me in (10), for example, ... LEX-PRED. 6 For this learning method, we use CRF++. 7 We choose a configuration that provides good perfor- mance on our source domain (i.e. ETHICS). 8 For semantic role labeling w...

Ngày tải lên: 22/02/2014, 02:20

... recall for disyllabic words is low. The results for the trigram model are listed in Ta- ble 5. Candidates are restricted to the eight POS cat- egories listed in Table 2 for this model. Precision for the ... information and the like- lihood for a character to appear in a par- ticular position of words of a particular length and POS category. By combining models that use different sou...

Ngày tải lên: 08/03/2014, 04:22

... calcu- lated in an explicit form as: function PKI classify (X) r = 0 # an array, initialized as 0 foreach i ∈ X foreach j ∈ h(i) r j = r j + 1 end end r esult = 0 foreach j ∈ SV r esult = result ... feature combinations are crucial to improving performance, they are heuris- tically selected. Kernel methods change this situation. The merit of the kernel methods is that effective feature co...

Ngày tải lên: 08/03/2014, 04:22

... options for the German word Aktionsplan Aktionsplan Empirical Methods for Compound Splitting Philipp Koehn Information Sciences Institute Department of Computer Science University of Southern California koehn@isi.edu Kevin ... This poses challenges for a number of NLP applications such as machine translation, speech recognition, text classification, information extraction, or inform...

Ngày tải lên: 08/03/2014, 21:20

... March – 3 April 2009. c 2009 Association for Computational Linguistics Unsupervised Methods for Head Assignments Federico Sangati, Willem Zuidema Institute for Logic, Language and Computation University ... syntac- tic information for transforming constituency tree- banks to dependency structures (Nivre et al., 2007) or richer syntactic representations (e.g., Hocken- maier and Stee...

Ngày tải lên: 08/03/2014, 21:20

... communication as a system for realizing the output of the grammar. Although the phonology of the 1950s had its prob- lems, it would be foolish to discount it as all bad. For field work, in which ... provided the plan for an essential step that a modern linguist skips only at the risk of basing his generalizations on nothing but an ad hoc subset of a language that is convenient f...

Ngày tải lên: 16/03/2014, 19:20

... the form NP + $1/ PRNAME; go to 5. 4.2. No: go to 5. 5. Enter SFORM, and determine quasi-logical form of parsed formula; enter LF, and determine logical trans- lation of quasi-logical formula; ... mark end of formula; go to 2. 7. Combine formulae on Shelf 24 into a single formula of conditional form, in which the conjunction of the premisses implies the conclusion; store formula on...

Ngày tải lên: 30/03/2014, 17:20