Báo cáo khoa học: "Minimized models and grammar-informed initialization for supertagging with highly ambiguous lexicons" pdf
... creating grammars and resources for CCG parsers for new domains and languages is highly labor- and knowledge-intensive. Baldridge (2008) uses grammar-informed initialization for HMM tag transitions ... Association for Computational Linguistics, pages 495–503, Uppsala, Sweden, 11-16 July 2010. c 2010 Association for Computational Linguistics Minimized models and gra...
Ngày tải lên: 07/03/2014, 22:20
... methods and results has accumulated around it, and these can be clearly compared with one another. We use the standard test set for this task, a 24,115-word subset of the Penn Treebank, for which ... Southern California Information Sciences Institute Marina del Rey, California 90292 {sravi,knight}@isi.edu Abstract We describe a novel method for the task of unsupervised POS tagging...
Ngày tải lên: 17/03/2014, 01:20
... PST as a knowl- edge source for DA detection, we essentially need to model the relationship between the random DA and the random DR. Denote the random DA by X and the random DR by Y . Given a text ... z-score (Larsen and Marx, 2000) of each word w in the ASR output. Figure 3 illustrates the PST for the sentences: Where is the Anping-Fort. There are two keywords Where and Anping-Fo...
Ngày tải lên: 20/02/2014, 05:20
Tài liệu Báo cáo khoa học: "Fast Decoding and Optimal Decoding for Machine Translation" doc
... position q with probability d (q–k class(f )), and so forth. NULL-generated. After heads and non-heads are placed, NULL-generated words are permuted into the remaining vacant slots randomly. If ... is chosen with probability 1/ . These stochastic decisions, starting with e, re- sult in different choices of f and an alignment of f with e. We map an e onto a particular a,f pair w...
Ngày tải lên: 20/02/2014, 18:20
Tài liệu Báo cáo khoa học: "Combining Functionality and Object Orientedness for Natural Language Processing" ppt
... composite expressions are constructed only with a binary form of function application. Thus, if z and I/ are well-formed formulas of PAL, so is a form z(y). Expressions of PAL are related to ... descendants, say z and y, a PAL expression for the phrase is one of the following forms: <z>( <V>) or <p>( <z>) where ~a> stands for a PAL expression for...
Ngày tải lên: 21/02/2014, 20:20
Tài liệu Báo cáo khoa học: "Learning Parse and Translation Decisions From Examples With Rich Context" pdf
... surface and lexi- cal form, syntactic and semantic category, subframes with syntactic and semantic roles, and form restric- 1The lexicon provides part-of-speech information and links words to ... describes the syn- tactic and semantic role structures for verbs, with currently 242 entries. The following representative examples, for easier understanding rendered in Eng...
Ngày tải lên: 22/02/2014, 03:20
Báo cáo khoa học: "Joint Processing and Discriminative Training for Letter-to-Phoneme Conversion" ppt
... approaches, such as those of Bisani and Ney (2002) and Marchand and Damper (2000), have shown that better performance can be achieved by pairing letter substrings with phoneme substrings, allowing ... classified into substrings of phonemes, and introducing an input segmentation step before prediction begins. The method accounts for sequence information with post-processing: the n...
Ngày tải lên: 08/03/2014, 01:20
Báo cáo khoa học: "Syntactic Features and Word Similarity for Supervised Metonymy Resolution" pot
... (Lakoff and Johnson, 1980; Fass, 1997; Stern, 1931)). In a place -for- people pattern, a place stands for any persons/organisations associ- ated with it, e.g., for sports teams in (2), (3), and (4), and ... evi- dence for any reading and lowering both recall and precision. Bad predictors are the verbs “to have” and “to be” and some prepositions such as with , which can b...
Ngày tải lên: 08/03/2014, 04:22
Báo cáo khoa học: "Plot Induction and Evolutionary Search for Story Generation" pot
... Traditionally, most of this knowl- edge is created by hand, and the effort must be re- peated for new domains, new characters and plot elements. Fortunately, recent work in natural language processing ... coherence) that is good enough for peo- ple to understand. Cheng and Mellish (2000) focus on the interaction of aggregation and text planning and use genetic algorithms to sear...
Ngày tải lên: 17/03/2014, 00:20
Báo cáo khoa học: "Phonological Constraints and Morphological Preprocessing for Grapheme-to-Phoneme Conversion" pot
... for Pronunciation by Analogy (PbA) (Marchand and Damper, 2005) on the same corpus. Marchand and Damper reported a processing time of several hours for c4), two days for c2) and several days for ... that uses the states without stress and syllable flags and enforces the constraints by eliminating invalid transitions, cf. section 3.1) to outperform the integrated version, v1,...
Ngày tải lên: 17/03/2014, 04:20