Báo cáo khoa học: " Robust and Flexible Mixed-Initiative Dialogue for Telephone Services" pot

... of EACL '99 Robust and Flexible Mixed-Initiative Dialogue for Telephone Services Relafio Gil, Jos~ ~ and Tapias, Daniel and Gancedo, Maria C. Charfuelan, Marcela ~ and Hern£ndez, Luis ... designed for the telephone line and for a wide range of potential users. Therefore our evalua- tions will be done taking into account different lev- els of speech rec...

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

... misrepresentations, and have implemented and evaluated them in a partial tutorial dialogue system. The implemented system concentrates on the function of the misrepresentation expert, and therefore the dialogue ... computational dialogue and ITS. PMMs are intimately connected to ideas of instructional and dialogue focus, the latter of which was explored by Grosz [1977...

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

... English error detection and correction has focused on article errors (Knight and Chander, 1994; Brockett et al., 2006) and preposi- tion errors (Chodorow et al., 2007; Rozovskaya and Roth, 2011), that ... target and preceding/following verb phrases. In this paper, we formulate the task as sequence la- beling, and use Conditional Random Fields (Laf- ferty, 2001), which provides sta...

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

... and short- hand were expanded, for example defib expands to defibrillator. Table 3 shows some unknown to- kens and their resolutions. The proofreading re- quire considerable amount of human effort ... ma- chine learner is that it can utilise both the infor- mation form of the concepts themselves and the contextual information, and it is able to perform prediction without seeing the en...

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

... shallow parser (Daum ´ e and Marcu, 2005) for detecting constituents and employ only string similarity and WordNet for determining semantic relatedness, forgoing NomBank and the distributional ... Association for Computational Linguistics:shortpapers, pages 254–259, Portland, Oregon, June 19-24, 2011. c 2011 Association for Computational Linguistics Optimal and Syntacticall...

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

... consists of positive and negative data and is used in the procedure of section 4.4, and iii) the test data C ts which consists of positive and neg- ative data and is used for evaluating the ... Model Selection for Subcategorization Preference* Takehito Utsuro and Takashi Miyata and Yuji Matsumoto Graduate School of Information Science, Nara Institute of Science and Te...

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

... syntac- tic and semantic information from the context the word occurs (Schone and Jurafsky, 2000; Bordag, 2006; Yarowski and Wicentowski, 2000; Jacquemin, 1997). Exploiting semantic and syntactic informa- tion ... (±1% f-score) for any cutting point on the slope between 20% and 50% of the list (for the German data set ranks 4000 and 12000), but importantly before the function t...

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

... opted for it because it works in a left-to-right manner, and is very efficient and simple to implement. In our experiments, we found that the algorithm performs reasonably well on average, and ... unigram estimate for word category probabilities, (i.e., P(H j | (W j-1 , D j-1 )) ≈ P(H j ) and P(F j | (W j-1 , D j-1 )) ≈ P(F j )), and the standard trigram estimate for fu...

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

... investigate for document summarization. We show, in fact, that many well-established methods for summarization (Carbonell and Goldstein, 1998; Filatova and Hatzivassiloglou, 2004; Takamura and Okumura, ... Bilmes, 2005; Krause and Guestrin, 2005; Narasimhan and Bilmes, 2007; Krause et al., 2008; Kolmogorov and Zabin, 2004) and have recently been introduced to natural languag...

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

... (Lichte, 2007)), or TT-MCTAG for short. For some of the above formalisms the word recognition problem is NP-hard. This has been shown for non-local MCTAG (Rambow and Satta, 1992), even in the ... in the underlying TAG G T is licensed in G if and only if the following conditions (MC) and (SN-TTL) are both satisfied. • (MC): For all Γ from G and for all γ 1 , γ 2 in Γ, we have...

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