Báo cáo khoa học: "GENERALIZED CHART ALGORITHM: AN EFFICIENT PROCEDURE FOR COST-BASED ABDUCTION ATR" ppt

Báo cáo khoa học: "GENERALIZED CHART ALGORITHM: AN EFFICIENT PROCEDURE FOR COST-BASED ABDUCTION ATR" ppt

Báo cáo khoa học: "GENERALIZED CHART ALGORITHM: AN EFFICIENT PROCEDURE FOR COST-BASED ABDUCTION ATR" ppt

... GENERALIZED CHART ALGORITHM: AN EFFICIENT PROCEDURE FOR COST-BASED ABDUCTION Yasuharu Den ATR Interpreting Telecommunications Research ... language un- derstanding. Figure 3 provides the rules for spo- ken Japanese understanding, with which the sen- tence (1) is parsed and interpreted. They include the pragmatic, semantic and ... derivation steps in TD and HD, and the...
Ngày tải lên : 31/03/2014, 06:20
  • 8
  • 219
  • 0
Báo cáo khoa học: "The Treegram Index An Efficient Technique for Retrieval in Linguistic Treebanks" docx

Báo cáo khoa học: "The Treegram Index An Efficient Technique for Retrieval in Linguistic Treebanks" docx

... Treegram Index An Efficient Technique for Retrieval in Linguistic Treebanks Hans Argenton and Anke Feldhaus Infineon Technologies, DAT CIF, Postbox 801709, D-81617 Miinchen hans.argenton@infineon.com ... (MT, henceforth) are a common and well-understood data struc- ture for describing hierarchical linguistic information. With the availability of large treebanks, retrieval tech...
Ngày tải lên : 17/03/2014, 23:20
  • 2
  • 327
  • 0
Tài liệu Báo cáo khoa học: "Generalized Hebbian Algorithm for Incremental Singular Value Decomposition in Natural Language Processing" potx

Tài liệu Báo cáo khoa học: "Generalized Hebbian Algorithm for Incremental Singular Value Decomposition in Natural Language Processing" potx

... decomposition; Gorrell and Webb (Gorrell and Webb, 2005) discuss using eigen decomposition to perform LSA, and demonstrate LSA using the Gen- eralized Hebbian Algorithm in its unmodified form. Sanger (Sanger, ... shadow any lower-ranked U m (m > n) by removing its projection from the input A j in order to assure both orthogonality and an ordered ranking of 99 the resulting eigenvectors. S...
Ngày tải lên : 22/02/2014, 02:20
  • 8
  • 362
  • 0
Báo cáo khoa học: "Graph Branch Algorithm: An Optimum Tree Search Method for Scored Dependency Graph with Arc Co-occurrence Constraints" potx

Báo cáo khoa học: "Graph Branch Algorithm: An Optimum Tree Search Method for Scored Dependency Graph with Arc Co-occurrence Constraints" potx

... syntactic-label WPP DG(Wang and Harper, 2004), semantic-label concept DG(Harada and Mizuno, 2001). 2.3 Well-formedness Constraints and Graph Search Algorithms There can be a variety of well-formedness con- straints ... 1,fly/n 2,like/p 2,like/v 3 ,an/ det 4,arrow/n root rt29 rt32 rt31 Figure 3: Scored dependency forest 2.5 Semantic Dependency Graph (SDG) The SDG is a semantic-label word DG de...
Ngày tải lên : 31/03/2014, 01:20
  • 8
  • 393
  • 0
Tài liệu Báo cáo khoa học: "ModelTalker Voice Recorder – An Interface System for Recording a Corpus of Speech for Synthesis" ppt

Tài liệu Báo cáo khoa học: "ModelTalker Voice Recorder – An Interface System for Recording a Corpus of Speech for Synthesis" ppt

... priority for these in- dividuals, almost equally important is the naturalness and individuality one associates with one’s own voice. Individuals with difficulty speak- ing can be any age, gender, and ... a text and an audito- ry version of the utterance. 1.2.3 Recording Feedback Once an utterance has been recorded, the user rece- ives feedback on the overall quality of the utter-...
Ngày tải lên : 20/02/2014, 09:20
  • 4
  • 419
  • 0
Báo cáo khoa học: Structural recognition of an optimized substrate for the ephrin family of receptor tyrosine kinases pot

Báo cáo khoa học: Structural recognition of an optimized substrate for the ephrin family of receptor tyrosine kinases pot

... ligand and the EPH RTKs are attractive drug targets for diseases inti- mately connected with pathological cell contact, including many types of cancers; tumorigenic growth, invasiveness and angiogenic ... multiple contacts between kinase and substrates; in particular, two residues undergo confor- mational changes and by mutation are found to be important for substrate binding and turnover...
Ngày tải lên : 16/03/2014, 02:20
  • 10
  • 441
  • 0
Báo cáo khoa học: "TENSE GENERATION IN AN INTELLIGENT TUTOR FOR FOREIGN LANGUAGE TEACHING: SOME ISSUES IN THE DESIGN OF THE VERB EXPERT" pot

Báo cáo khoa học: "TENSE GENERATION IN AN INTELLIGENT TUTOR FOR FOREIGN LANGUAGE TEACHING: SOME ISSUES IN THE DESIGN OF THE VERB EXPERT" pot

... TENSE GENERATION IN AN INTELLIGENT TUTOR FOR FOREIGN LANGUAGE TEACHING: SOME ISSUES IN THE DESIGN OF THE VERB EXPERT Danilo FUM (*), Paolo Giangrandi(°), Carlo Tasso (o) (*) Dipartimento ... Intelligence techniques for developing very sophisticated systems, called Intelligent Tutoring Systems, in the specific domain of foreign language teaching (Barchan, Woodmansee, and Yazdani,...
Ngày tải lên : 01/04/2014, 00:20
  • 6
  • 395
  • 1
Tài liệu Báo cáo khoa học: "Types of Common-Sense Knowledge Needed for Recognizing Textual Entailment" ppt

Tài liệu Báo cáo khoa học: "Types of Common-Sense Knowledge Needed for Recognizing Textual Entailment" ppt

... decisions, synonymy, and hypernymy. These phenomena are well-known to be important to language understanding and RTE (Mirkin et al., 2009; Roth and Sammons, 2007). Many synonymy and hypernymy databases ... κ handles more than two annotators, unlike the more familiar Cohen’s κ. 330 tions and all categories. Separately, we also compute κ once for each category C, by treating all annota- tions...
Ngày tải lên : 20/02/2014, 05:20
  • 6
  • 512
  • 0
Tài liệu Báo cáo khoa học: "Bilingually Motivated Domain-Adapted Word Segmentation for Statistical Machine Translation" pptx

Tài liệu Báo cáo khoa học: "Bilingually Motivated Domain-Adapted Word Segmentation for Statistical Machine Translation" pptx

... seg- menter 2 and Stanford segmenter version 2006-05- 11 3 . Both ICTCLAS and Stanford segmenters utilise machine learning techniques, with Hidden Markov Models for ICT (Zhang et al., 2003) and conditional ... Centre for High- End Computing. 10 We would like to thank the re- viewers for their insightful comments. References Satanjeev Banerjee and Alon Lavie. 2005. METEOR: An automatic...
Ngày tải lên : 22/02/2014, 02:20
  • 9
  • 236
  • 0
Báo cáo khoa học: "Automatic Induction of Finite State Transducers for Simple Phonological Rules" pptx

Báo cáo khoa học: "Automatic Induction of Finite State Transducers for Simple Phonological Rules" pptx

... subsequential transducer for the English flapping rule in 1 is shown in Figure 1; an underlying t is realized as a flap after a stressed vowel and any number of r's, and before an unstressed ... underlying forms as input and generate surface forms as output. The algorithm for learning them is an extension of the OSTIA algorithm for learn- ing general subsequential fini...
Ngày tải lên : 08/03/2014, 07:20
  • 7
  • 313
  • 0