IJCNLP
2005
Springer
14 years 1 months ago
2005
Springer
Japanese relative clause constructions (RCC’s) are defined as being the NP’s of structure ‘S NP’, noting the lack of a relative pronoun or any other explicit form of noun-...
IJCNLP
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present an empirical study that utilizes morph-syntactical information to improve translation quality. With three kinds of language pairs matched according to mor...
IJCNLP
2005
Springer
14 years 1 months ago
2005
Springer
IJCNLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Linguistic information can help improve evaluation of similarity between documents; however, the kind of linguistic information to be used depends on the task. In this pa...
ICCBR
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper, we propose an approach to attach semantic annotations to textual cases for their representation. To achieve this goal, a framework that combines machine le...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
The tagging problem in natural language processing is to find a way to label every word in a text as a particular part of speech, e.g., proper noun. An effective way of solving th...
FSMNLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The last decade has seen an increase in the number of available corpus query systems. These systems generally implement a query language as well as a database model. We r...
FSMNLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a formalization of lexicalized Recursive Transition Networks which we call Automaton-Based Generative Dependency Grammar (gdg). We show how to extract a gdg fr...
FSMNLP
2005
Springer
14 years 1 months ago
2005
Springer
The join of two n-ary string relations is a main operation regarding to applications. n-Ary rational string relations are realized by weighted finite-state machines with n tapes. ...
FSMNLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Stochastic finite automata are useful for identifying substrings (chunks) within larger units of text. Relevant applications include tokenization, base-NP chunking, name...