Báo cáo khoa học: "Neural Network Probability Estimation for Broad Coverage Parsing" doc

Báo cáo khoa học: "Neural Network Probability Estimation for Broad Coverage Parsing" doc

Báo cáo khoa học: "Neural Network Probability Estimation for Broad Coverage Parsing" doc

... Neural Network Probability Estimation for Broad Coverage Parsing James Henderson Departement d'Informatique Universite de Geneve James.Henderson@cui.unige.ch Abstract We present a neural -network- based ... (becoming [S-VP ]). These transforms are undone before any evaluation is performed on the output trees. We do not believe these transforms have a major impact on performan...

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

8 278 0
Báo cáo khoa học: "Neural Network Recognition of Spelling Errors" docx

Báo cáo khoa học: "Neural Network Recognition of Spelling Errors" docx

... input/output form fixed-length arrays of numbers. A common view in the neural network community has been that different forms of input/output representations have negligible effect on ANN performance. ... spell-checking and name searching. In order for ANNs to recognize variant and homographic forms of words, however, words must be transformed to a form that is meaningful to ANNs...

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

3 272 0
Tài liệu Báo cáo khoa học: "Performance Confidence Estimation for Automatic Summarization" ppt

Tài liệu Báo cáo khoa học: "Performance Confidence Estimation for Automatic Summarization" ppt

... examples for good and bad performance. We also extend the analysis to sin- gle document summarization, for which predict- ing system performance turns out to be much more accurate than for multi-document ... system performance for a given input is in fact relevant not only for summarization, but in general for all ap- plications aimed at facilitating information access. In questio...

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

8 342 0
Báo cáo khoa học: "Joint and conditional estimation of tagging and parsing models∗" docx

Báo cáo khoa học: "Joint and conditional estimation of tagging and parsing models∗" docx

... outperformed the conditional models by quite large amounts. This suggests that it may be worthwhile investigating meth- ods for maximum (joint) likelihood estimation for model classes for which ... maximum likelihood estimation and max- imum conditional likelihood estimation for three different kinds of models: PCFG parsers, HMM taggers and shift-reduce parsers. The results for...

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

8 370 0
Báo cáo khoa học: "Bayesian Network, a model for NLP?" ppt

Báo cáo khoa học: "Bayesian Network, a model for NLP?" ppt

... traditional systems. This ap- proach stands on the formalism, still little ex- ploited for NLP, of Bayesian Network (BN). As a probabilistic formalism, it offers a great expres- sion capacity ... HC rules method are marked in grey, white is for the LC rules method and black for the Clement’s method 3 . The Pronoun node estimates the de- cision probability for a given it occurence...

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

4 389 0
Báo cáo khoa học: Systems biology: parameter estimation for biochemical models ppt

Báo cáo khoa học: Systems biology: parameter estimation for biochemical models ppt

... exploratory step then has formed a basis for the parameter space with information in which directions the objective function decreases. In the next step, the pattern move, the information obtained is ... Kaandorp JA & Blom J (2007) Efficient parameter estimation for spatio-temporal models of pattern formation: case study of Drosophila melanogaster. Bioinformatics 23, 3356–3363. 37 Ki...

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

17 367 0
Báo cáo khoa học: "Social Network Extraction from Texts: A Thesis Proposal" doc

Báo cáo khoa học: "Social Network Extraction from Texts: A Thesis Proposal" doc

... novel way of constructing networks by analyzing text to capture such interactions or events. Motivation: Typically researchers construct a so- cial network from various forms of electronic in- teraction ... is a vastly rich network present in text such as the content of emails, comment threads on online social networks, transcribed phone calls. My work will enrich the 111 social network...

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

6 373 0
Tài liệu Báo cáo khoa học: "Generating Impact-Based Summaries for Scientific Literature" docx

Tài liệu Báo cáo khoa học: "Generating Impact-Based Summaries for Scientific Literature" docx

... our method consistently outperforms all the baselines. Among the baselines, MEAD -Doc is consistently better than both LEAD and MEAD -Doc+ Cite. While MEAD- Doc s outperforming LEAD is not surprising, ... surprising that MEAD -Doc also outperforms MEAD -Doc+ Cite as the latter uses both the cita- tion context and the original document. One possi- ble explanation may be that MEAD is not des...

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

9 376 0
Tài liệu Báo cáo khoa học: "Mining Wikipedia Revision Histories for Improving Sentence Compression" docx

Tài liệu Báo cáo khoa học: "Mining Wikipedia Revision Histories for Improving Sentence Compression" docx

... of them for such compres- sions/expansions. We make the simplifying assump- tion that all such edits also retain the core mean- ing of the sentence, and are therefore valid training data for our ... for glare protection] is effective and will help if your office has the fluorescent-light overkill [that ’s typical in offices]. (4) Prices range from $5,000 [for a microvax 2000] to $179,000...

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

4 328 0
Tài liệu Báo cáo khoa học: "Exploiting N-best Hypotheses for SMT Self-Enhancement" doc

Tài liệu Báo cáo khoa học: "Exploiting N-best Hypotheses for SMT Self-Enhancement" doc

... phrase-alignment information in each hy- pothesis indicates the word reordering for source sentence. We select the word reordering with the highest posterior probability as the best word reor- dering for ... Chinese-to-English task show performance improvements for all the strategies. Moreover, the combination of the three strategies achieves further improvements and outperforms...

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

4 313 0
w