Articles
Total Articles: 38870
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13070
. Machine transliteration is an automatic method to generate characters or words in one alphabetical system for the corresponding characters in another alphabetical system. There has been increasing concern on machine translitera- tion as an assistant of machine translation and information retrieval. Three ma- chine transliteration models, including “grapheme-based model”, …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13071
. This paper presents a study of Sinhala syllable structure and an algo- rithm for identifying syllables in Sinhala words. After a thorough study of the Syllable structure and linguistic rules for syllabification of Sinhala words and a survey of the relevant literature, a set of rules was identified and …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13072
. Conventional QA systems cannot answer to the questions composed of two or more sentences. Therefore, we aim to construct a QA system that can answer such multiple-sentence questions. As the first stage, we propose a method for classifying multiple-sentence questions into question types. Specifically, we first extract the core …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13073
. Temporal question classification assigns time granularities to tempo- ral questions ac-cording to their anticipated answers. It is very important for an- swer extraction and verification in the literature of temporal question answer- ing. Other than simply distinguishing between "date" and "period", a more fine- grained classification hierarchy scaling down …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13074
. This paper studies the problem of mining relational data hidden in natural language text. In particular, it approaches the relation classification problem with the strategy of transductive learning. Dif- ferent algorithms are presented and empirically evaluated on the ACE corpus. We show that transductive learners exploiting various lexical and …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13076
. We propose a tree-similarity-based unsupervised learning method to extract relations between Named Entities from a large raw corpus. Our method regards relation extraction as a clustering problem on shallow parse trees. First, we modify previous tree kernels on relation extraction to estimate the similarity between parse trees more efficiently. …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13077
. This paper presents a supervised approach for relation extraction. We apply Support Vector Machines to detect and classify the relations in Automatic Content Extraction (ACE) corpus. We use a set of features including lexical to- kens, syntactic structures, and semantic entity types for relation detection and classification problem. Besides …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13078
. Building a thesaurus is very costly and time-consuming task. To alleviate this problem, this paper proposes a new method for extending a thesaurus by adding taxonomic information automatically extracted from an MRD. The proposed method adopts a machine learning algorithm in acquiring rules for identifying a taxonomic relationship to …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13079
. This paper analyzes the results of automatic concept align- ment between two ontologies. We use an iterative algorithm to perform concept alignment. The algorithm uses the similarity of shared terms in order to find the most appropriate target concept for a particular source concept. The results show that the …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13080
. When acquiring synonyms from large corpora, it is important to deal not only with such surface information as the context of the words but also their latent semantics. This paper describes how to utilize a latent semantic model PLSI to acquire synonyms automatically from large corpora. PLSI has been …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13081
ion with HowNet Semantics Tony Veale Department of Computer Science, University College Dublin, Belfield, D4, Dublin, Ireland Tony.Veale@UCD.ie http://www.cs.ucd.ie/staff/tveale.html Abstract. One generally accepted hallmark of creative thinking is an ability to look beyond conventional labels and recategorize a concept based on its behav- iour and functional potential. So while taxonomies …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13082
. We propose a novel type of document classification task that quantifies how much a given document (review) appreciates the target object using not binary polarity (good or bad) but a continuous mea- sure called sentiment polarity score (sp-score). An sp-score gives a very concise summary of a review and …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13083
. This paper proposes a two-step method for Chinese text categoriza- tion (TC). In the first step, a Naïve Bayesian classifier is used to fix the fuzzy area between two categories, and, in the second step, the classifier with more subtle and powerful features is used to deal with documents …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13084
. Research on linear text segmentation has been an on-going focus in NLP for the last decade, and it has great potential for a wide range of applications such as document summarization, information retrieval and text understanding. However, for linear text segmentation, there are two critical problems involving automatic boundary …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13085
. Document clustering has many uses in natural language tools and applications. For instance, summarizing sets of documents that all describe the same event requires first identifying and grouping those documents talking about the same event. Document clustering involves dividing a set of documents into non-overlapping clusters. In this paper, …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13086
. Many methods of term extraction have been discussed in terms of their accuracy on huge corpora. However, when we try to apply various methods that derive from frequency to a small corpus, we may not be able to achieve sufficient accuracy because of the shortage of statistical information on …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 13087
. We present a new implication of Wu’s (1997) Inversion Transduction Grammar (ITG) Hypothesis, on the problem of retriev- ing truly parallel sentence translations from large collections of highly non-parallel documents. Our approach leverages a strong language uni- versal constraint posited by the ITG Hypothesis, that can serve as a …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 19536
In this paper we argue that the Japanese causative constructions should be viewed as a complex predicate having two possible c-structure realizations (i.e. a single monoclausal f-structure, and monoclausal and biclausal c-structures). Along with the Optimality Theory architecture, we suggest that the emergence of two c-structures in predicate composition is …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 19550
It has been argued by LaPolla (1993, 1995) and Van Valin and LaPolla (1997) -- among others -- that word order in Mandarin Chinese (henceforth MC) is (almost) exclusively determined by informational/communicative considerations. Though it cannot be denied that word order does encode informative/communicative considerations such as identifiability, foregrounding, and …...
nan
Publication: TIPSTER (2005)
DOI: nan
Paper ID: 19551
Various kinds of IT and computer technology have enabled language tests to be delivered online or on computer, and to have much faster scoring time. Such computer-based tests can well assess three skill areas such as reading, writing, and listening comprehension. However, in many cases, speaking ability is still inferred …...