Báo cáo khoa học: "Empirical Methods for Compound Splitting" ppt
... 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 ... California koehn@isi.edu Kevin Knight Information Sciences Institute Department of Computer Science University of Southern California knight@isi.edu Abstract Co...
Ngày tải lên: 08/03/2014, 21:20
... 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
... 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
Báo cáo khoa học: "An Account for Compound Prepositions in Farsi" docx
... behaves as Compound Prepositions. As they are not completely behaving as compounds, it is doubtful that the process of word formation is a morphological one. The analysis put forward by ... there are how the process of their word formation should be accounted for as their characteristics are not as straight forward as it is expected from other compound categories. Some Irania...
Ngày tải lên: 08/03/2014, 02:21
Báo cáo khoa học: "Hybrid Methods for POS Guessing of Chinese Unknown Words" pot
... 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
Báo cáo khoa học: "Fast Methods for Kernel-based Text Analysis" pot
... 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
Báo cáo khoa học: "CONCEPTUAL ASSOCIATION FOR COMPOUND NOUN ANALYSIS" ppt
... nouns, acting as a noun; pottery coffee mug, for example. For a detailed linguistic theory of compound noun syntax and semantics, see Levi (1978). Compound nouns are analysed syntactically by ... bracketing for a given noun sequence, known to form a compound noun, without knowledge of the context. E.G.: (pottery (coffee mug)); ((coffee mug) holder) Corpus Statistics: The n...
Ngày tải lên: 08/03/2014, 07:20
Báo cáo khoa học: "Unsupervised Methods for Head Assignments" potx
... 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
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. ... the other hand, to reject ill-formed words. On the other hand, we want to use our existing word-recognition and analysis programs as tools for gathering further infor- mation about Eng...
Ngày tải lên: 24/03/2014, 02:20
Báo cáo khoa học: "Machine Methods for Proving Logical Arguments Expressed in Englis" ppt
... 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