Articles
Total Articles: 38870
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 40938
A new chart-based technique for parsing ill-formed input is proposed. This can process sentences with unknown/misspelled words, omitted words or extraneous words. This generalized parsing strategy is, similar to Mellish's, based on an active chart parser, and shares the many advantages of Mellish's technique. It is based on pure syntactic …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 40939
Machine translation (MT) systems do not currently achieve optimal quality trans- lation on free text, whatever translation method they employ. Our hypothesis is that the quality of MT will improve if an MT environment uses output from a vari- ety of MT systems working on the same text. In the …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 40940
This paper proposes a model using associative processors (APs) for real-time spoken language translation. Spoken language translation re- quires (1) an accurate translation and (2) a real- time response. We have already proposed a model, TDMT (Transfer-Driven Machine Trans- lation), that translates a sentence utilizing ex- amples effectively and performs …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 40941
This paper reports on the techniques used to successfully translate with the help of a computer a Mathematics textbook from Portuguese to English. Even if these techniques are simple and this case has some peculiarities, it seems that the same method will be useful in other cases as well, and, …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 40942
A computational model for the acquisition of knowledge from encyclopedic texts is de- scribed. The model has been implemented in a program, called SNOWY, that reads unedited texts from The World Book En- cyclopedia, and acquires new concepts and conceptual relations about topics dealing with the dietary habits of animals, …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 40943
Labeling of sentence boundaries is a nec- essary prerequisite for many natural lan- guage processing tasks, including part-of- speech tagging and sentence alignment. End-of-sentence punctuation marks are ambiguous; to disambiguate them most systems use brittle, special-purpose regular expression grammars and exception rules. As an alternative, we have developed an ef- …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 40944
The framework we adopted for customiz- ing linguistic knowledge to individual ap- plication domains is an integration of sym- bolic and statistical approaches. In or- der to acquire domain specific knowledge, we have previously proposed a rule-based mechanism to hypothesize missing knowl- edge from partial parsing results of unsuc- cessfully …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 40945
Both full-text information retrieval and large scale parsing require text preprocessing to identify strong lexical associations in textual databases. In order to associate linguistic felicity with computational efficiency, we have conceived FASTR a unification-based parser supporting large textual and grammatical databases. The grammar is composed of term rules obtained by …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 40946
Many of the kinds of language model used in speech understanding suffer from imper- fect modeling of intra-sentential contextual influences. I argue that this problem can be addressed by clustering the sentences in a training corpus automatically into subcor- pora on the criterion of entropy reduction, and calculating separate language …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 40949
We discuss combining knowledge-based (or rule-based) and statistical part-of-speech taggers. We use two mature taggers, ENGCG and Xerox Tagger, to indepen- dently tag the same text and combine the results to produce a fully disambiguated text. In a 27000 word test sample taken from a previously unseen corpus we achieve …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 40950
The authors propose a model for analyz- ing English sentences including coordinate conjunctions such as "and", "or", "but" and the equivalent words. Syntactic analysis of the English coordinate sentences is one of the most difficult problems for machine translation (MT) systems. The problem is selecting, from all possible candidates, the …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 40952
This paper presents a practical machine translation system based on sentence types for economic news stories. Conventional English-to-Japanese machine translation (MT) systems which are rule-based approaches, are diffi- cult to translate certain types of Associated Press (AP) wire service news stories, such as economics and sports, because these topics include …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 40953
A new technique to locate content-represent- ing words for a given document image using abstract representation of character shapes is described. A character shape code representa- tion defined by the location of a character in a text line has been developed. Character shape code generation avoids the computational expense of …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 40954
Many documents are available to a computer only as images from paper. However, most nat- ural language processing systems expect their input as character-coded text, which may be difficult or expensive to extract accurately from the page. We describe a method for con- verting a document image into character shape …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 2495
Text corpora which are tagged with part-of-speech in- formation are useful in many areas of linguistic re- search. In this paper, a new part-of-speech tagging method hased on neural networks (Net-Tagger) is pre- sented and its performance is compared to that of a llMM-tagger (Cutting et al., 1992) and a …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 2496
To align bilingual texts becomes a crucial issue recently. Rather than using length-based or translation-based criterion, a part-of-speech-based criterion is proposed. We postulate that source texts and target texts should share the same concepts, ideas, entities, and events. Simulated annealing approach is used to implement this aligmnent algorithm. The preliminary …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 2497
The described tagger is b,'used on a hidden Markov model and uses tags composed of features such as part- of speech, gender, etc. 'l?he contextual probability of a tag (state transition probability) is deduced from the contextual probabilities of its feature--value-pairs. This approach is advantageous when the available training corpus …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 2498
: In a lexicalized grammar Ibrnlal- isni such as LexicMized Tree-Adjoining (h'~unmar (I3'AG), each lexicM item is associated with at least one elementary structure (supertag) that localizes syntactic a.nd semantic dependencies. Thus a parser for a lexicalized grammar must search a large set of supertags to choose the right ones …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 2499
Statistical NLP models usually only consider coarse information and very restricted context to make the estimation of parameters feasible. To reduce the modeling error introduced by a sim- plified probabilistic model, the Classitication and Regression Tree (CART) method was adopted in this paper to select more discriminative features for automatic …...
nan
Publication: TIPSTER (1994)
DOI: nan
Paper ID: 2500
We present an integrated architecture for word-level and sentence-level processing in a unification-based paradigm. The core of the sys- tem is a CLP implementation of a nnilication en- gine for feature structures suplmrting relational values. In this framework an IiPSC,-style granl- mar is implemented. Word-level processing uses X2MoltF, a morphological …...