نتایج جستجو برای: compound words

تعداد نتایج: 269283  

1999
Atsushi Fujii Tetsuya Ishikawa

This paper proposes a cross-language information retrieval (CLIR) system queried with technical compound words. Our system rst translates queries into the target language. Instead of exhaustively enumerating new compound words in a bilingual dictionary, we produce a dictionary for base words, and compute the plausibility score for each combination of base word translations. Then, the most plaus...

1999
Simonetta Vietri Annibale Elia

In thts paper we wdl show how Itahan electronic dictionaries have been budt within the methodological framework of Lexicon-grammar We wdl see the structure of electromc d~ctlonanes of simple and compound words, and we wdl show how to analyse texts employing these hngmst~c tools within INTEX. a morphological analyser Finally, we wdl show how electromc grammars (budt w~th INTEX) interact with dlc...

2003

In Germanic languages, compound words are very common and very productive. There are compound words which are bound and lexicalized and loose their semantic content when split (e.g. albatross or jordgubbe). This category will be referred to as opaque compounds. The opposite of the opaque compounds are the productive compounds, whose parts keep their semantic value when separated (Bjarnadóttir 2...

2002
Jenny Hayes Victoria Murphy Neil Davey Pamela Smith Lorna Peters

Compound words with irregular plural nouns in first position (e.g. mice-eater) are produced far more frequently than compound words with regular plural nouns in first position (e.g. *rats-eater), (Gordon, 1985). Using empirical evidence and neural net modelling, the studies presented here demonstrate how a single route, associative memory based account might provide an equally, if not more, val...

1996
David M. Carter Jaan Kaja Leonardo Neumeyer Manny Rayner Fuliang Weng Mats Wirén

This paper describes and evaluates a simple and general solution to the handling of compound nouns in Swedish and other languages in which compounds can be formed by concatenation of single words. The basic idea is to split compounds into their components and treat these components as recognition units equivalent to other words in the language model. By using a principled grammar-based language...

2011
Markus Nußbaum-Thom Amr El-Desoky Mousa Ralf Schlüter Hermann Ney

Compound words are a difficulty for German speech recognition systems since they cause high out-of-vocabulary and word error rates. State of the art approaches augment the language model by the fragments of compounds in order to increase lexical coverage, lower the perplexity and out-of-vocabulary rate. The fragments are tagged in order to concatenate subsequent equally tagged fragments in the ...

Journal: :Inf. Process. Manage. 2001
Turid Hedlund Ari Pirkola Kalervo Järvelin

This paper analyzes the features of the Swedish language from the viewpoint of monoand crosslanguage information retrieval (CLIR). The study was motivated by the fact that Swedish is known poorly from the IR perspective. This paper shows that Swedish has unique features, in particular gender features, the use of fogemorphemes in the formation of compound words, and a high frequency of homograph...

Journal: :journal of dental research, dental clinics, dental prospects 0
avinash tejasvi mds balaji babu

the tumors in which odontogenic differentiation is fully expressed are the odontomas. odontomas are considered as hamartomas rather than a true neoplasm. these tumors are composed of enamel, dentine, cementum and pulp tissue. it is most commonly associated with the eruption of the teeth. they are usually discovered on routine radiographic examination. in exceptional cases, the odontoma erupts i...

2000
Gabriele Kodydek

In text processing systems German words require special treatment because of the possibility to form compound words as a combination of existing words. To this end, a universal word analysis system will be introduced which allows an analysis of all words in German texts according to their atomic components. A recursive decomposition algorithm, following the rules for word flexion, derivation, a...

2016
Kabil BOUKHARI Mohamed Nazih OMRI

In this work, we propose a robust algorithm for automatic indexing unstructured Document. It can detect the most relevant words in an unstructured document. This algorithm is based on two main modules: the first module ensures the processing of compound words and the second allows the detection of the endings of the words that have not been taken into consideration by the approaches presented i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید