{"title":"Semantic construction in feature-based TAG","authors":"Claire Gardent, Laura Kallmeyer","doi":"10.3115/1067807.1067825","DOIUrl":"https://doi.org/10.3115/1067807.1067825","url":null,"abstract":"We propose a semantic construction method for Feature-Based Tree Adjoining Grammar which is based on the derived tree, compare it with related proposals and briefly discuss some implementation possibilities,","PeriodicalId":396394,"journal":{"name":"Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - EACL '03","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132768497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Language independent authorship attribution using character level language models","authors":"Fuchun Peng, Dale Schuurmans, Shaojun Wang, Vlado Keselj","doi":"10.3115/1067807.1067843","DOIUrl":"https://doi.org/10.3115/1067807.1067843","url":null,"abstract":"We present a method for computer-assisted authorship attribution based on character-level n-gram language models. Our approach is based on simple information theoretic principles, and achieves improved performance across a variety of languages without requiring extensive pre-processing or feature selection. To demonstrate the effectiveness and language independence of our approach, we present experimental results on Greek, English, and Chinese data. We show that our approach achieves state of the art performance in each of these cases. In particular, we obtain a 18% accuracy improvement over the best published results for a Greek data set, while using a far simpler technique than previous investigations.","PeriodicalId":396394,"journal":{"name":"Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - EACL '03","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125047036","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Using POS information for statistical machine translation into morphologically rich languages","authors":"Nicola Ueffing, H. Ney","doi":"10.3115/1067807.1067853","DOIUrl":"https://doi.org/10.3115/1067807.1067853","url":null,"abstract":"When translating from languages with hardly any inflectional morphology like English into morphologically rich languages, the English word forms often do not contain enough information for producing the correct fullform in the target language. We investigate methods for improving the quality of such translations by making use of part-of-speech information and maximum entropy modeling. Results for translations from English into Spanish and Catalan are presented on the LC-STAR corpus which consists of spontaneously spoken dialogues in the domain of appointment scheduling and travel planning.","PeriodicalId":396394,"journal":{"name":"Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - EACL '03","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124250972","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A. Kilgarriff, R. Evans, R. Koeling, Michael Rundell, David Tugwell
{"title":"WASPBENCH","authors":"A. Kilgarriff, R. Evans, R. Koeling, Michael Rundell, David Tugwell","doi":"10.3115/1067737.1067787","DOIUrl":"https://doi.org/10.3115/1067737.1067787","url":null,"abstract":"Human Language Technologies (HLT) need dictionaries, to tell them what words mean and how they behave. People making dictionaries (lexicographers) need HLT, to help them identify how words behave so they can make better dictionaries. Thus a potential for synergy exists across the range of lexical data - in the construction of headword lists, for spelling correction, phonetics, morphology and syntax, but nowhere more than for semantics, and in particular the vexed question of how a word's meaning should be analysed into distinct senses. HLT needs all the help it can get from dictionaries, because it is a very hard problem to identify which meaning of a word applies. Lexicographers need all the help they can get because the analysis of meaning is the second hardest part of their job (Kilgarriff, 1998), it occupies a large share of their working hours, and it is one where, currently, they have very little to go on beyond intuition and other dictionaries.","PeriodicalId":396394,"journal":{"name":"Proceedings of the tenth conference on European chapter of the Association for Computational Linguistics - EACL '03","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121098877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}