Báo cáo khoa học: "Language Dynamics and Capitalization using Maximum Entropy" pot

... Association for Computational Linguistics Language Dynamics and Capitalization using Maximum Entropy Fernando Batista a,b , Nuno Mamede a,c and Isabel Trancoso a,c a L 2 F – Spoken Language Systems ... with spell corrections and grammar check. The capitalization problem can be seen as a se- quence tagging problem (Chelba and Acero, 2004; Lita et al., 2003; Kim and Woodland...

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

... for training and WSJ 22-24 for testing, and Toutanova and Manning (2000) use WSJ 00-20 for training and WSJ 23-24 for testing. Collins uses a linear perceptron, and Toutanova and Manning (T&A4) ... down both the training and tag- ging and requires more memory. Table 8 shows the difference in the number of contextual predi- cates and features between the original a...

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

... (5) where, p is prime and 0 < a < p , 0 ≤ b < p, and a and b are chosen at random. We apply q different random permutation for every vector (by choosing random values for a and b, q number ... vectors and randomly permute them (see Appendix A for more details on random permutation functions). A random permutation can be considered as random jumbling of the bits of each vect...

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

... Cole and Morgan (eda), 1975. Strawson, P.F. Intention and Convention in Speech Acts. Phil. Rev. 73, q, q39-~60, 196~. Walker, D.E. Understandin~ Spoken Language. New York, North Holland, ... solution proposed here is based on the following slmple and independently motivated hypotheses: (2.a) Language users are rational agents and thus speech acts are purposeful. In particu...

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

... A: a randomly selected word is w; B: a randomly selected dependency type is r; C: a randomly selected word is w ~. When the value of Ilw, r,w'll is unknown, we assume that A and C ... automatically generated thesaurus and (6) and (7) are corresponding entries in WordNet thesaurus and Roget thesaurus. (5) brief (noun): affidavit 0.13, petition 0.05, memorandum 0.05, mot...

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

... varying between 0.05 lm and 0.5 lm and between 0.01 lm and 0.5 lm for enzymes and inhibitor, respectively. Inhibitor concentrations were checked by UV absorbance at 280 nm using a molar extinction ... k cat were independently found equal to 135 min )1 and to 3.85 min )1 and K M values of 1250 lm and 850 lm for BApNA and GPpNA, respectively, by means of standard Lineweaver–Bu...

Ngày tải lên: 23/03/2014, 10:21

... high invasion potential (MDA-MB-231) and one with low invasion potential (BT-20), and also normal cells MCF-12A were used. The expression of PDGF-R and c-Kit, their ligands, MMP-9 and signal transduc- tion ... synthes- ized by Tre ´ zl and co-workers from CH 2 O and L-arginine may belong to that type of molecules. HMA was found in human blood and urine, and in plants (leaves,...

Ngày tải lên: 23/03/2014, 15:20

... considered as a predicate candidate in both training and testing processes. Let the nominal predicate candidate be w 0 , and its left and right neighboring words/POSs be w -1 /p -1 and w 1 /p 1 , respectively. ... Lluis Màrquez, and Joakim Nivre. 2008. The CoNLL-2008 Shared Task on Joint Parsing of Syntactic and Semantic Dependencies. In Pro- ceedings of CoNLL 2008. Charle...

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

... Chelba and Jelinek, 2000; Bened´ı and S´anchez, 2000). A formal framework to include long-distance and local information in the same language model is based on the Maximum Entropy principle (ME). Using ... easy to derive the Maximum Entropy conditional language model (Rosenfeld, 1996): if is the context space and is the vocabulary, then x is the states space, and if x then: (4...

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

... pred- ications (EPs) and handles (here, h 1 h 2 )thatref- erence those EPs. Underspecification is achieved by using unresolved handles as the arguments for scope-bearing elements and declaring constraints (with ... HLDS and evaluates it with respect to the criteria of other computational seman- tics frameworks. 4 shows how we can build HLDS terms using CCG with unification and 5 sho...

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