نتایج جستجو برای: derivational view

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

1994
Brad Blumenthal

Derivational analogy is a technique for reusing problem solving experience to improve problem solving performance. This research addresses an issue common to all problem solvers that use derivational analogy: overcoming the mismatches between past experiences and new problems that impede reuse. First, this research describes the variety of mismatches that can arise and proposes a new approach t...

2013
Britta D. Zeller Jan Snajder Sebastian Padó

Derivational models are still an underresearched area in computational morphology. Even for German, a rather resourcerich language, there is a lack of largecoverage derivational knowledge. This paper describes a rule-based framework for inducing derivational families (i.e., clusters of lemmas in derivational relationships) and its application to create a highcoverage German resource, DERIVBASE,...

2014
Kresimir Sojat Matea Srebacic

This paper deals with morphosemantic relations between Croatian verbs and discusses their inclusion in Croatian WordNet. Morphosemantic relations refer to semantic relations between morphologically related verbs, i.e., between verbs from the same derivational family. A derivational family consists of verbs with the same lexical morpheme grouped around a base form. Generally, a verb with the sim...

2007
Andrea Tyler William E. Nagy

Knowledge of derivational morphology potentially aids readers in the analysis and acquisition of new vocabulary, in lexical access and in establishing the syntactic structure of sentences. Although a number of studies have investigated the role of derivational morphology in acquiring vocabulary and in the organization of the internal lexicon, none have investigated the syntactic role of derivat...

2004
Henry Beecher Sharon Rose Chris Barker

The morphological paradigm as a theoretical construct has a central role in explaining inflectional word formation, particularly in Word & Paradigm approaches to morphology. In contrast, research into the role of paradigm in derivation has been programmatic as well as fragmentary. In this paper I investigate the extent to which patterns of relationships among derived words constitute a derivati...

2002
Tsz-Chiu Au Hector Muñoz-Avila Dana S. Nau

In this paper we present an algorithm called DerUCP, which can be regarded as a general model for plan adaptation using Derivational Analogy. Using DerUCP, we show that previous results on the complexity of plan adaptation do not apply to Derivational Analogy. We also show that Derivational Analogy can potentially produce exponential reductions in the size of the search space generated by a pla...

Journal: :CoRR 2010
Nabil Hathout

This paper describes in details the first version of Morphonette, a new French morphological resource and a new radically lexeme-based method of morphological analysis. This research is grounded in a paradigmatic conception of derivational morphology where the morphological structure is a structure of the entire lexicon and not one of the individual words it contains. The discovery of this stru...

2015
Aitao Lu Yanping Yu Jiaxin Niu John X. Zhang

The present study was carried out to investigate whether sign language structure plays a role in the processing of complex words (i.e., derivational and compound words), in particular, the delay of complex word reading in deaf adolescents. Chinese deaf adolescents were found to respond faster to derivational words than to compound words for one-sign-structure words, but showed comparable perfor...

2012
Nikhil Kanuparthi Abhilash Inumella Dipti Misra Sharma

Hindi is an Indian language which is relatively rich in morphology. A few morphological analyzers of this language have been developed. However, they give only inflectional analysis of the language. In this paper, we present our Hindi derivational morphological analyzer. Our algorithm upgrades an existing inflectional analyzer to a derivational analyzer and primarily achieves two goals. First, ...

2006
Georg Moser

We study the derivational complexity of rewrite systems R compatible with KBO, if the signature of R is in nite. We show that the known bounds on the derivation height are preserved, if R ful ls some mild conditions. This allows us to obtain bounds on the derivational height of non simply terminating TRSs. Furthermore, we re-establish the 2-recursive upper-bound on the derivational complexity o...

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

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