Articles

This paper proposes a new model of machine translation system in which rule-based and example-based approaches are applied for English-to-Thai sentence translation. The proposed method has 4 steps :1) analyze an English sentence into a string of grammatical nodes, based on Phrase Structure Grammar, 2) map the input pattern with …...

AbstractThe paper reports on experiments which compare the translation outcome of three corpus-based MT systems, a string-based translation memory (STM), a lexeme-based translation memory (LTM) and the example-based machine translation (EBMT) system EDGAR. We use a fully automatic evaluation method to compare the outcome of each MT system and discuss …...

We introduce a learner capable of automatically extend- ing large, manually written natural language Definite Clause Grammars with missing syntactic rules. It is based upon the Minimum Description Length princi- ple, and can be trained upon either just raw text, or else raw text additionally annotated with parsed cor- pora. …...

We present a memory-based learning (MBL) approach to shallow parsing in which POS tagging, chunking, and identification of syntactic relations are formulated as memory-based modules. The experiments reported in this paper show competitive results, the F~=l for the Wall Street Journal (WSJ) treebank is: 93.8% for NP chunking, 94.7% for …...

Grammatical relationships are an important level of natural language processing. We present a trainable approach to find these relationships through transfor- mation sequences and-error-driven learning. Our ap- proach finds grammatical relationships between core syntax groups and bypasses much of the parsing phase. On our training and test set, our procedure …...

The #u-TBL system represents an attempt to use the search and database capabilities of the Prolog pro- gramming language to implement a generalized form of transformation-based learning. In the true spirit of logic-programming, the implementation is 'derived' from a declarative, logical interpretation of transforma- tion rules. The #-TBL system recognizes …...

Constructive induction transforms the representation of instances in order to produce a more accurate model of the concept to be learned. For this purpose, a vari- ety of operators has been proposed in the literature, including a Cartesian product operator forming pair- wise higher-order attributes. We study the effect of …...

This paper presents a semi-automatic technique for developing broad-coverage finite-state morphological analyzers for any language. It consists of three components-elicitation of linguistic information from humans, a machine learning bootstrapping scheme and a testing environment. The three components are ap- plied iteratively until a threshold of output quality is attained. The …...

The paper presents an entropy-based approach to segment a corpus into words, when no additional information about the corpus or the language, and no other resources such as a lexicon or grammar are available. To segment the corpus, the algorithm searches for separators, without knowing a priory by which symbols …...

This paper presents an unsupervised approach to lexical acquisition with the goodness measure de- scription length gain (DLG) formulated following classic information theory within the minimum de- scription length (MDL) paradigm. The learning algorithm seeks for an optimal segmentation of an utterance that maximises the description length gain from the …...

We present a technique which complements Hidden Markov Models by incorporating some lexicalized states representing syntactically un- common words. 'Our approach examines the distribution of transitions, selects the uncom- mon words, and makes lexicalized states for the words. We perfor'med a part-of-speech tagging experiment on the Brown corpus to evaluate …...

Accurate nominal compound analysis is cru- cial for in application of natural language pro- cessing such as information retrieval and ex- traction as well as nominal compound inter- pretation. I,n the nominal compound analysis area, some corpus-based approaches have re- ported successful results by using statistal co- occurrences of nouns. …...

In this paper, we present a learning approach for coreference resolution of noun phrases in unrestricted text. The approach learns from a small, annotated corpus and the task in- cludes resolving not just pronouns but rather general noun phrases. In contrast to previous work, we attempt to evaluate our approach …...

In this paper Brill's rule-based PoS tagger is tested and adapted for Hungarian. It is shown that the present system does not obtain as high accuracy for Hungarian as it does for English (and other Germanic languages) because of the structural difference between these languages. Hungarian, unlike English, has rich …...

Levin's (1993) taxonomy of verbs and their classes is a widely used resource for lexical semantics. In her framework, some verbs, such as give exhibit no class ambiguity. But other verbs, such as write, can inhabit more than one class. In some of these am- biguous cases the appropriate class …...

This paper is concerned with using a se- mantic hierarchy to estimate the frequency with which a word sense appears as a given argument of a verb, assuming the data is not sense disambiguated. The standard ap- proach is to split the count for any noun ap- pearing in the …...

In this paper we discuss cascaded Memory- Based grammatical relations assignment. In the first stages of the cascade, we find chunks of sev- eral types (NP,VP,ADJP,ADVP,PP) and label them with their adverbial function (e.g. local, temporal). In the last stage, we assign gram- matical relations to pairs of chunks. We …...

In this paper we use various methods for multiple neural network combination in tasks of prepo- sitional phrase attachment. Experiments with aggregation functions such as unweighted and weighted average, OWA operator, Choquet inte- gral and stacked generalization demonstrate that combining multiple networks improve the esti- mation of each individual neural …...

This paper describes and extensively evaluates a sys- tem for the automatic routing of submitted papers to reviewers and area committees, without the need for any human annotation from the reviewers or the pro- gram chair. Routing is based on a profile of previous writings obtainable on-line for the reviewer …...

String similarity metrics are used for several pur- poses in text-processing. One task is the extraction of cognates from bilingual text. In this paper three approaches to the automatic generation of language dependent string matching functions are presented. 1...