Hasil untuk "Lexicography"

Anđela Vidović

Daniele Franceschi

This article examines the semantic relations holding between pairs of Anglo-Saxon and Latinate near-synonyms in present-day English, such as speed/velocity, sweat/perspire, shy/timid and before/prior. Meaning variation between etymologically unrelated lexical items expressing equivalent concepts has primarily been explained in terms of pragmatic principles, although the differences between them also result from constraints imposed by their denotational semantics. The analysis proposed aims to identify the nature of their semantic proximity not so much by observing meaning construal in specific contexts or the degree of collocational variation, but rather through the observation of how similarity of concepts is conventionally encoded and externalized. This approach has made it possible to provide a preliminary mapping of the areas of overlap and contrast between semantically related items. Eight main scenarios emerge from the analysis of the data: the pairs of words examined are linked by a generic-specific (or specific-generic), literal-figurative (or figurative-literal) or cause-effect relation, but also differ in terms of focus, conventional implicatures or level of iconicity. Some possible lexicographic representations of these meaning relations have been proposed for English monolingual and learners’ dictionaries.

Élise Guillemin-Bonniec

Pierre J.L. Arnaud

Proper names are generally considered as a specific category of nouns. Research may focus on their specificities, but also, in the opposite perspective, on what they share with common nouns. Are proper names, like the former, subject to metaphor and metonymy? After an overview of the characteristics of names and what they share with common nouns, the semantic relations present in metaphor and metonymy are examined, and in particular the source-target relations of metonymy and their taxonomies like those of Peirsman & Geeraerts [2006] and Pepper [2020]. The presence of the tropes is then investigated in antonomasia and three categories of onomastic data, nicknames, place-names and surnames, and their presence appears as frequent and diverse, which answers the above question. The 36 metonymic relations detected are grouped within the two taxonomies, which shows that some general categories have affinities with proper nouns and also confirms the value of multiple-level taxonomies.

Agnieszka Małocha-Krupa

The paper is dedicated to issues related to designations of women in the Polish language from the second half of the 19th century until the present time. The socio-cultural history of a group of Polish feminine personal nouns (referred to as feminitives or feminatives) which denote women's social and/or occupational status is discussed. It is argued that feminine personal nouns have been directly dependent on various ideologies: women's emancipation, socrealism and feminism. Ideologies have impacted the use of feminatives, by intensifying or limiting their use in discourse during a particular period, and the attitude of language users to ideologies has influenced the way in which feminatives are perceived. While presenting the richness of the repertoire of gender exponents in contemporary Polish, the possibility of the incorporation of feminine personal formations into dictionaries of general Polish in a scientific and objective manner is investigated. A similar idea was proposed at Wrocław University, as a result of which a group of female lexicographers compiled Słownik nazw żeńskich polszczyzny [Dictionary of Polish Female Nouns]. Some of its innovative lexicographical assumptions (description, not prescription, a discourse-centred method) are discussed in this article. The text corpus presented in the article enables the reader to trace the history of feminine personal nouns in Polish, i.e. their disappearance and re-appearance in the language.

Abel Cabrera Martínez, Suitberto Cabrera García, J. A. Rodríguez-Velázquez

Abstract In a graph G , a vertex dominates itself and its neighbours. A subset S ⊆ V ( G ) is said to be a double dominating set of G if S dominates every vertex of G at least twice. The minimum cardinality among all double dominating sets of G is the double domination number. In this article, we obtain tight bounds and closed formulas for the double domination number of lexicographic product graphs G ∘ H in terms of invariants of the factor graphs G and H .

Антон Анатольевич Степихов, Димитрий Геннадьевич Боровиков

В ситуации системного кризиса читательской культуры, особенно остро ощущаемого сегодня в школьном образовании, чрезвычайно актуальной задачей является развитие культуры чтения художественного текста. Основной корпус литературных произведений, включенных в школьную программу, создавался более 100 лет назад, что затрудняет их понимание современными читателями. Изменить данную ситуацию можно с помощью мобильных технологий, ставших неотъемлемой частью нашей жизни. В статье описываются принципы создания «Словаря редкой лексики по произведениям школьной программы» (далее — Словарь). Словарь задуман как часть кросс-платформенного мобильного приложения, что должно способствовать росту мотивации к обучению у школьников и повышению его эффективности. Удобство пользования Словарем определяется его интеграцией в электронную библиотеку произведений школьной программы по литературе (базовый компонент по ФГОС). При составлении словника использовался инструментарий корпусной лингвистики, позволяющий оптимизировать работу с контекстами и отразить в словарной статье конкретное значение лексемы. В результате сравнения конкорданса, составленного на основе корпуса произведений русской литературы, со словником «Нового частотного словаря русской лексики» О. Н. Ляшевской и С. А. Шарова было выявлено более 20 000 лексических единиц, не вошедших в частотный словарь и, следовательно, претендующих на лексикографическое описание. Оно было начато с имен существительных, количество которых в полученном перечне составило около 9 500 единиц. При составлении словника перечень существительных был по определенным принципам сокращен. Для лексикографического описания было отобрано более 3 100 единиц, относящихся к различным лексико- семантическим группам. В словник вошла не только устаревшая лексика, но и низкочастотные лексемы, в том числе имена собственные и окказионализмы. Такой подход способствует освоению школьниками более широкого пласта слов, развитию у учащихся культуры чтения художественного текста и расширению кругозора. Словарь строится на принципах учебной лексикографии. Цель словарной статьи — не просто разъяснить значение слова и предоставить информацию о его нормативном употреблении, но прежде всего создать образ описываемой реалии в воображении читателя. Для этого авторы при необходимости прибегают к развернутым описаниям и пояснениям, иногда с включением сведений энциклопедического характера. Содержание словарных статей иллюстрируют многочисленные изображения.

Neven Vulić

Giovanni Casini, T. Meyer, I. Varzinczak

Mustafa Jarrar, Hamzeh Amayreh

Sven Tarp

Contextualization, i.e. to provide solutions to users' information needs directly in the situation or context where these needs occur, played a significant role in the work of the Greek scribes who inserted glosses into manuscript copies of the works of Homer and other earlier writers in order to explain obsolete and unusual words. After the invention of the glossary, a schism developed within lexicography. On the one hand, there was the new compilation of glossaries and dictionaries of a still more complex and sophisticated nature. On the other hand, there was the traditional insertion of glosses into manuscript copies of books from previous periods. Although the advent of dictionaries diminished the use of contextualization procedures they were still adhered to in some publications. This paper discusses the occurrence of contextualization and personalization procedures in different eras and environments and it is shown how these procedures also introduced a lexicographic practice to some extra-dictionary environments. The importance of contextualization and personalization in modern-day lexicography is stressed. Lexicographers often have had unfulfilled dreams of new possibilities within the digital environment. However, the lack of adequate technology has made their dreams impossible – at that stage. Today new technologies and collaboration between lexicography and information science offer numerous new challenges that can be met by lexicographers. It is shown how lexicographical products being integrated into information tools little by little are closing the more than two thousand year old schism in European lexicography, i.e. reuniting contextualization and personalization. Lexicographers, the modern-day scribes, have to endeavour to make the seemingly impossible possible.

Y. Rasekhipour, Iman Fadakar, A. Khajepour

Abstract There are driving situations that avoiding all obstacles is infeasible. In such situations, an autonomous vehicle should avoid vulnerable obstacles like pedestrians. In this paper, a motion planning method is presented that avoids obstacles according to their priority orders. The method utilizes a model predictive controller with obstacle constraints and applies lexicographic optimization to the controller to prioritize the constraints, and subsequently, prioritize the obstacles. The proposed method is simulated on a high fidelity CarSim vehicle model. The results show that when avoiding all obstacles is not feasible, the proposed method avoids the obstacles with the highest priority orders.

Peter G. Stechlinski, Kamil A. Khan, P. I. Barton

This paper extends classical sensitivity results for nonlinear programs to cases in which parametric perturbations cause changes in the active set. This is accomplished using lexicographic directional derivatives, a recently developed tool in nonsmooth analysis based on Nesterov's lexicographic differentiation. A nonsmooth implicit function theorem is augmented with generalized derivative information and applied to a standard nonsmooth reformulation of the parametric KKT system. It is shown that the sufficient conditions for this implicit function theorem variant are implied by a KKT point satisfying the linear independence constraint qualification and strong second-order sufficiency. Mirroring the classical theory, the resulting sensitivity system is a nonsmooth equation system which admits primal and dual sensitivities as its unique solution. Practically implementable algorithms are provided for calculating the nonsmooth sensitivity system's unique solution, which is then used to furnish B-subdifferenti...

Shuping Dang, Gaojie Chen, J. Coon

In this paper, we propose a novel codebook design scheme for orthogonal frequency-division multiplexing with index modulation (OFDM-IM) to improve system performance. The optimization process can be implemented efficiently by the lexicographic ordering principle. By applying the proposed codebook design, all subcarrier activation patterns with a fixed number of active subcarriers will be explored. Furthermore, as the number of active subcarriers is fixed, the computational complexity for estimation at the receiver is reduced and the zero-active subcarrier dilemma is solved without involving complex higher layer transmission protocols. It is found that the codebook design can potentially provide a tradeoff between diversity and transmission rate. We investigate the diversity mechanism and formulate three diversity-rate optimization problems for the proposed OFDM-IM system. Based on the genetic algorithm, the method of solving these formulated optimization problems is provided and verified to be effective. Then, we analyze the average block error rate and bit error rate of the OFDM-IM systems applying the codebook design. Finally, all analyses are numerically verified by the Monte Carlo simulations. In addition, a series of comparisons are provided, by which the superiority of the codebook design is confirmed.

Anilkumar Markana, Nitin U. Padhiyar, K. Moudgalya

Abstract This research paper presents an offline and online user defined priority driven multi-objective optimal control study of a bioprocess in a fed-batch reactor. Productivity and the amount of substrates used in the process are considered as the two control objectives in that order of priority for this purpose. The priorities in the objective functions are realized using the lexicographic approach by sequentially solving multiple objectives to arrive at a Pareto solution point. This approach is not sensitive to the tuning of weighting parameters as compared to the scalarized objective, practiced conventionally. The weighting factors tuning issue is demonstrated with an offline optimal control. The lexicographic optimization approach is then implemented to overcome this thing issue. Subsequently, the online optimal control problem is solved using economic model predictive control (EMPC) owing to the economic nature of the control objectives. Often, the Pareto curve is such that marginally relaxing one objective results into a significant improvement in the other objective. This can easily be implemented with the lexicographic approach and is demonstrated using EMPC. Moreover, unlike the continuous processes, the batch processes operate for a specific batch time. Hence, the shrinking horizon approach along with the EMPC framework is employed in the fed-batch bioreactor for online control with extended Kalman filter (EKF).

Patrick Baxter Dragon, Oscar I. Hernandez, J. Sawada et al.

Abstract A k -ary de Bruijn sequence of order n is a circular k -ary string of length k n which contains every k -ary string of length n exactly once as a substring. It is well-known that a k -ary de Bruijn sequence of order n can be constructed by concatenating the aperiodic prefixes of the k -ary necklaces of length n in lexicographic order. In this article we prove that an alternate de Bruijn sequence is created by replacing lexicographic order with co-lexicographic order. We also provide a simple successor rule for generating each successive symbol in O ( n ) -time.

M. Dettlaff, M. Lemańska, J. A. Rodríguez-Velázquez et al.

Abstract The neighbourhood of a vertex v of a graph G is the set N ( v ) of all vertices adjacent to v in G . For D ⊆ V ( G ) we define D ¯ = V ( G ) ∖ D . A set D ⊆ V ( G ) is called a super dominating set if for every vertex u ∈ D ¯ , there exists v ∈ D such that N ( v ) ∩ D ¯ = { u } . The super domination number of G is the minimum cardinality among all super dominating sets in G . In this article we obtain closed formulas and tight bounds for the super dominating number of lexicographic product graphs in terms of invariants of the factor graphs involved in the product. As a consequence of the study, we show that the problem of finding the super domination number of a graph is NP-Hard.

Kadir Büyüközkan, Ibrahim Kucukkoc, S. I. Satoglu et al.

A. Estrada-Moreno, I. G. Yero, J. A. Rodríguez-Velázquez

M. Anilkumar, Nitin U. Padhiyar, K. Moudgalya