lexicon extraction for hindi

... word-form lexicon is an intermediate stage in the creation of a morphological lexicon. In this paper, we consider the problem of extract- ing a large-coverage root word-form lexicon for the Hindi ... POS information in this way HSE+Pos. 3.6 Root Selection The stem lexicon obtained by the process de- scribed above had to be converted into a root word- form lexicon. A root word-form lexicon ... with stems. Nouns in Hindi do not usually have more than four inflectional forms. The scarcity of suffix evidence for most word- forms poses a huge obstacle to the extraction of a high-coverage lexicon because...

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

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

Ngày tải lên: 26/11/2013, 20:30

... as Chen and Mooney and perform leave-one-map-out exper- iments. For the first task, we build a lexicon using ambiguous training data from two maps, and then use the lexicon to produce the best ... Association for Computational Linguistics, pages 430–439, Jeju, Republic of Korea, 8-14 July 2012. c 2012 Association for Computational Linguistics Fast Online Lexicon Learning for Grounded ... pairs 1: main 2: for training example (e i , p i ) do 3: Update((e i , p i )) 4: end for 5: OutputLexicon() 6: end main 7: 8: function Update(training example (e i , p i )) 9: for n-gram w that...

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

... existing lexicon words into a new word (Saon and Padmanabhan, 2001). Though proposed for English, this method is effective for Chinese ASR (Chen et al., 2004). Gao et al. (2002) combined an information ... struc- ture for SDR, which significantly outperforms word-based methods for IV or OOV queries. Here we apply S-CN structure to investigate the effec- tiveness of improved character accuracy for SDR. Here ... the ASR performance. Here we propose a dis- criminative lexicon adaptation approach for improved character accuracy, which not only adds new words but also deletes some words from the current lexicon. ...

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

... language. Those lexicon models lack from context infor- mation that can be extracted from the same paral- lel corpus. This additional information could be: Simple context information: information of the ... surrounding the word pair; Syntactic information: part-of-speech in- formation, syntactic constituent, sentence mood; Semantic information: disambiguation in- formation (e.g. from WordNet), cur- rent/previous ... fact that the algorithm for computing the -best lists is sub- optimal. Table 8: Preliminary translation results for the Verbmobil Test-147 for different contextual infor- mation and different...

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

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

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

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

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

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

Ngày tải lên: 12/04/2014, 15:41

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

Ngày tải lên: 05/09/2013, 09:08

... consists of three steps: 1320 4. The high performance as compared with the best-known methods for both definition and hypernym extraction. Our approach outper- forms the other systems particularly where the ... 2010. c 2010 Association for Computational Linguistics Learning Word-Class Lattices for Definition and Hypernym Extraction Roberto Navigli and Paola Velardi Dipartimento di Informatica Sapienza Universit ` a ... Discussion Definition Extraction. In Table 2 we report the results of definition extraction systems on the Wikipedia dataset. Given this dataset is also used for training, experiments are performed with...

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

... shown in Table 3. It can be seen that model-based phrase extraction using HIER out- performs or insignificantly underperforms heuris- tic phrase extraction over all experimental settings, while keeping ... removed for TM training. For both tasks, we perform weight tuning and testing on specified development and test sets. We compare the accuracy of our proposed method of joint phrase alignment and extraction ... phrase extraction as a second baseline. An example of these alignments is shown in Figure 3. In model HEUR-P, minimal phrases generated from P t are treated as aligned, and we perform phrase extraction...

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

... heuristics based on syntactic information taken from dependency structures. 7 Discussion We presented a method for automatic extraction of lexico-syntactic rules for negation/speculation scopes ... developed a super- vised classifier for identifying speculation cues and a manually compiled list of lexico-syntactic rules for identifying their scopes. For the performance of the rule based system ... with a factored model for natural language pars- ing. Advances in neural information processing sys- tems, pages 3–10. D. McClosky and E. Charniak. 2008. Self-training for biomedical parsing....

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

... can explore in an uniform way both new information nuggets and validated back- ground information nuggets interactively. Fig. 1 summarizes the main components and the informa- tion flow. Figure ... Saarbr ¨ ucken {neumann|schmeier}@dfki.de Abstract We present a mobile touchable application for online topic graph extraction and exploration of web content. The system has been imple- mented for operation on an iPad. The topic graph is constructed ... in- formation between chunk pairs which explic- itly takes their distance into account. An ini- tial user evaluation shows that this system is especially helpful for finding new interesting information...

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

... 113–116, Columbus, Ohio, USA, June 2008. c 2008 Association for Computational Linguistics Kernels on Linguistic Structures for Answer Extraction Alessandro Moschitti and Silvia Quarteroni DISI, ... European Commission Marie Curie Excellence Grant for the ADAMACH project (contract No. 022593). References J. Allan. 2000. Natural language processing for informa- tion retrieval. In Proceedings of NAACL/ANLP ... answer extraction (Chen et al., 2006; Collins- Thompson et al., 2004) rather than document re- trieval (a step usually carried out by off-the shelf IR engines). In question processing, useful information is...

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

... improve the relation extraction quality. On a public benchmark dataset the combination of a kernel for phrase grammar parse trees and for depen- dency parse trees outperforms all known tree kernel ... tree kernel outperforms all others by 5.7% F-Measure reaching an F-Measure of 71.2%. This result shows that both types of parse trees contain relevant information for relation extraction. The remainder ... automatic extraction of relations be- tween entities expressed in natural lan- guage text is an important problem for IR and text understanding. In this paper we show how different kernels for parse...

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