Deletion Rule Research Articles

The development of phonological patterns in an urban dialect contact setting: Evidence from Seoul Korean

Abstract: This study investigates the linguistic outcome of migration-induced dialect contact in contemporary urban settings by tracking the development of the variable deletion of /w/ in Seoul Korean. The results from apparent-time and real-time analyses reveal that the rate of postconsonantal /w/-deletion, which previously had been rising, has begun to fall. In addition, the strong effect of the preceding consonant on this deletion has weakened significantly. Meanwhile, the rate of non-postconsonantal /w/-deletion has continued to rise, and, for younger speakers, non-postconsonantal /w/-deletion now patterns similarly with postconsonantal /w/-deletion. I argue that the dilution of the original pattern of the deletion rule is the result of the interplay between linguistic diffusion induced by a massive influx of migrants into Seoul and phonological restructuring by subsequent generations.

Phrasal subcomparatives: a comparative coordination analysis based on evidence from Basque, Spanish, and English

AbstractBy analyzing an understudied type of comparative, namely, subcomparatives with surface-phrasal standards of comparison, this article offers an answer to three long-debated questions regarding the internal structure and semantic composition of comparative constructions in opposition to traditional assumptions and reductionist analyses. First I offer syntactic tests evidencing the non-clausal status of the standard in these subcomparatives in Basque, Spanish and English. Second, regarding the question of the linkage type between the compared elements (either a dependence relation or a coordination relation), I present previous and novel syntactic evidence showing that phrasal subcomparatives invariably behave like common phrasal coordinates. Therefore, I defend an architecture of these comparatives involving a phrasal coordinate structure and offer a transparent mapping between the surface syntax and semantic interpretation of these constructions. Third, subcomparatives involve the obligatory omission of a measure modifier from the standard. This process known ascomparative subdeletioncannot be explained as the result ofwh-movement within a clause, given the non-clausal status of the standard. Alternatively, comparative subdeletion is defined not as anad hocdeletion rule but rather as the result of an obligatory deletion operation independently attested in common coordinate structures.

Interpretations for the Tutte polynomials of morphisms of matroids

We study interpretations of the Tutte polynomials of set-pointed matroids and matroid perspectives. Suppose that M is a matroid whose ground set E is given with a linear ordering < . We show that the Tutte polynomial of M pointed by A ⊆ E equals ∑ x r ( M / ( A ∪ X ) ) y r ∗ ( M − ( A ∪ Y ) ) z r ( ( M / X ) − Y ) where the sum runs through the set D ( M ; A ; < ) of couples ( X , Y ) such that X ⊆ E ∖ A , Y = ( E ∖ A ) ∖ X , and X ∩ C (resp. Y ∩ C ) differs from { min ( C ) } for each circuit C of M ∗ − A (resp. M − A ). Furthermore, we characterize D ( M ; A ; < ) by a contraction–deletion rule. Analogous results are introduced for the Tutte polynomials of matroid perspectives.

Transit Route Planning for Megacities Based on Demand Density of Complex Networks

The aim of this work is to investigate the simplifica-tion of public transport networks (PTNs) for megacities and the optimisation of route planning based on the de-mand density of complex networks. A node deletion rule for network centre areas and a node merging rule for net-work border areas in the PTN are designed using the de-mand density of complex networks. A transit route plan-ning (TRP) model is established, which considers the demands of direct passengers, transfer passengers at the same stop and transfer passengers at different stops, and aims at maximising the transit demand density of a PTN. An optimisation process for TRP is developed based on the ant colony optimisation (ACO). The proposed method was validated through a sample application in Handan City in China. The results indicate that urban PTNs can be simplified while retaining their local attributes to a great extent. The hierarchical structure of the network is more obvious, and the layer-by-layer planning of routes can be effectively used in TRP. Moreover, the operating efficiency and service level of urban PTNs can be en-hanced effectively.

Enhancing traffic capacity of multilayer networks with two logical layers by link deletion

Improving the traffic capacity of multilayer networks has been the subject of extensive interest and research. This paper proposes an effective strategy to improve traffic capacity of three-layer networks via the process of removing links linking to nodes with large degrees. In order to improve the traffic capacity, two different link deletion rules are proposed to remove a portion of logical layer links without the change of physical layer topology structure. It is found that the proposed strategy can improve traffic capacity; furthermore, the link deletion rule that two logical layers delete the same number of links at the same time is better than the link deletion rule that only the links of one logical layer are deleted. This work contributes to the design and optimization of realistic multilayer networks. This paper proposes an effective strategy to improve traffic capacity of three-layer networks via the process of removing links linking to nodes with large degrees. Under the premise that the structure of physical layer in three-layer networks does not change, some logical layer links between the nodes with large degrees are removed to improve the traffic capacity, and two different link deletion rules are proposed.

A Class of Random Recursive Tree Algorithms with Deletion

We examine a discrete random recursive tree growth process that, at each time step, either adds or deletes a node from the tree with fixed, complementary probabilities. Node addition follows the usual uniform attachment model. For node removal, we identify a class of deletion rules guaranteeing the current tree conditioned on its size is uniformly distributed over its range. By using generating function theory and singularity analysis, we obtain asymptotic estimates for the expectation and variance of a tree’s size, as well as its expected leaf count and root degree. In all cases, the behavior of such trees falls into three regimes determined by the insertion probability. Interestingly, the results are independent of the specific class member deletion rule used.

Piecewise Sparse Recovery via Piecewise Inverse Scale Space Algorithm with Deletion Rule

Piecewise Sparse Recovery via Piecewise Inverse Scale Space Algorithm with Deletion Rule

MOVEMENT TRANSFORMATION IN GAYO SYNTAX

The purpose of this study is to present syntactic descriptions of how movement transformational rules apply in Gayo syntax and to examine the status of movement transformational rules in Gayo language (henceforth GL) in the theoretical framework of Transformational Linguistics (TL) proposed by Chomsky (1965, 1981) and Suhadi (2018). In this theory there are three kinds of syntactic rules: Movement Rule, Deletion Rule and Substitution Rule. The discussion focuses on Movement Transformational Rules in GL. Transformation is the inter-related process between the deep structure and the surface structure of a sentence by the application of one or more transformational rules. The method used in this study was descriptive qualitative approach as noted by Martin (2004). Descriptive research is to portray accurately the characteristics of a particular situation or group or individual with or without special initial hypotheses about the nature of these characteristics. Thus, descriptive research design was applied to give a detail description of a certain case accurately. The data were analyzed from two angles: the application and the status of movement rules in GL, which can be compulsory, optional, and restricted. The data of this research derived from some sentences in the folklore story written in GL and the invention of the writer herself as the native speaker of the language. The finding shows that all the twelve kinds of movement transformational rules proposed by Suhadi (2018) are relevant to apply in GL. After the application of movement rules, the main finding is on the status of movement transformational rules in GL in which it is found that four movement rules are compulsory, eight are optional and there is no restricted rule in the language.

Aspects of the Morphophonology of the Verb in Latin and in German and English

Aspects of the Morphophonology of the Verb in Latin and in German and English

Modifications of Tutte–Grothendieck invariants and Tutte polynomials

Generalized Tutte–Grothendieck invariants are mappings from the class of matroids to a commutative ring that are characterized recursively by contraction–deletion rules. Well known examples are Tutte, chromatic, tension and flow polynomials. In general, the rule consists of three formulas valid separately for loops, isthmuses, and the ordinary elements. We show that each generalized Tutte–Grothendieck invariant thus also Tutte polynomials on matroids can be transformed so that the contraction–deletion rule for loops (isthmuses) coincides with the general case.

영어 SMS 약어의 철자변이에 대한 음운분석

This paper considers the phonological characteristics and type frequency of spelling variation in English SMS abbreviations. We argue that spelling variation is not random but phonologically motivated. Showing that vowels are more likely to be deleted than consonants, we claim that word-intial vowel deletion is closely related to the trochaic rhythm of English, while word-medial vowel deletion is associated with word-initial prominence. We also show that word-final e is deleted only when the preceding vowel is short. Among consonants, gh and h are most frequently omitted, and r is deleted only in coda position, reflecting the /r/-deletion rule in Modern English. Meanwhile, geminate consonants are degeminated after a tense vowel, but degemination is optional after a lax vowel. We also show that ‘8’ is the most frequently used number homophone, and that only th and ks are subject to substitution. With regard to frequency, we assert that deletion (57.42%) occurs most frequently, which is followed by number homophone (13.23%), letter homophone (12.58%), substitution (9.68%) and alphanumeric homophone (1.94%) in that order. Besides, we also argue that spelling variation may result from assimilation and word-final e-insertion, though rare (1.29% each).

A pair of equivalent sequential and fully parallel 3D surface-thinning algorithms

Thinning is an iterative object reduction to obtain skeletons from binary digital pictures. The object boundary is traversed in an iteration step of a sequential thinning algorithm, and the actually visited single point is considered for possible removal. On the contrary, parallel thinning algorithms can remove a set of object points simultaneously. In fully parallel thinning algorithms, the same parallel reduction is applied in each iteration step, and it is repeated until stability is reached. Two thinning algorithms are said to be equivalent if they produce the same result for any input picture. This paper presents the first pair of equivalent sequential and fully parallel 3D surface-thinning algorithms. The proposed algorithms use the same deletion rule, and preserve topology for (26,6) pictures.

Design of gravity compensators using the Stephenson and Watt mechanisms

This paper evaluates the design method for a gravity compensator using associated linkages. For conventional design methods the kinematics and potential energy of every mechanism should be computed to design a static balancer. For the proposed design method, however, no computations of kinematics and potential energy are necessary to obtain static balancers of various mechanisms, once a static balancer of an associated linkage has been designed. The deletion rules (i.e., transformation relations) are derived with the concept of the associated linkage. The Stephenson and Watt linkages are adopted as associated linkages that contain ternary links and multi-loops. Gravity compensators of the associated linkages are designed based on the space mapping method. When a ternary link becomes a slider, several unit gravity compensators are attached at the ternary link and can be merged into an equivalent gravity compensator. In consideration of the equivalent gravity compensator, a new deletion rule is introduced and incorporated in the set of the original deletion rules. Various gravity compensators are derived applying the new deletion rules to gravity compensators of associated linkages. Performances of the various gravity compensators are evaluated with simulations.

Evaluating the Uralic–Yukaghiric word-initial, proto-sibilant correspondence rules

This paper evaluates and expands upon previously suggested sound rules governing the phonological outcome of early root-initial proto-sibilants (*s- and *ś-) and proto-affricates (*š-, *ć- and *č-) in Late Proto-Yukaghir (PY), as shown by cognate correspondences in Proto-Uralic (PU) and by Tungusic and Turkic borrowings. The proto-sibilant *s- underwent deletion (*Ø-), retention (*s-) or lateralization (*l-); *ś- was retained unchanged and earlier *š- had changed into *č- in PY. Universally, PY proto-sibilants and proto-affricates find regular lexical correspondences in PU as described by a set of non-trivial phonological rules:&#x0D; Pre-PY *sVr/k/γ- &gt; PY *lVr/k/γ-: a regular lateralization of the sibilant in Yukaghiric occurred with back vowels and *-r-, *-k- and possibly *-γ-, but not *-q-, through an intermediary hypothetical *θ- stage.&#x0D; Pre-PY *sVl/ŋ- &gt; PY *ØVl/ŋ-: a sibilant deletion rule occurred with any vowel and *-l- or *- ŋ-.&#x0D; However, all structures of the intermediate type Pre-PY *sV1ŋ/l/m/n-k/q-V2-, where V1 is a back vowel, pose an exception wherein sibilant deletion was blocked, and the sibilant was either retained or changed into a lateral. Sibilant deletion still occurred in these cases if V1 was a front vowel.&#x0D; Pre-PY *ś- &gt; PY *ś- &gt; KY š- &amp; TY s-: the Yukaghir lexicon in these cases likely developed through intermediate *š’-/*θ’- from Old Yukaghir. Furthermore, Pre-PY *š- &gt; PY *č- regularly.&#x0D; All of these sound changes are controlled by phonology and affect borrowings as well as inherited vocabulary from before PY, but do not affect post-PY borrowings. The sibilant-deletion rule is clearly an influence from extensive language contacts with Yakut-speakers, and certain roots show that the Yukaghir rules of synharmonism were already in effect prior to sibilant deletion. In addition, the results are concurrent with several older cognate suggestions between Uralic and Yukaghiric and further add to this corpus. Identifying these historical processes also strengthens the evidence that the Yukaghir languages are genetically related to the Uralic language family.

Two Self-Dual Lattices of Signed Integer Partitions

In this paper we study two self-dual lattices of signed integer partitions, D(m, n) and E(m, n), which can be considered also sub-lattices of the lattice L(m, 2n), where L(m, n) is the lattice of all the usual integer partitions with at most m parts and maximum part not exceeding n. We also introduce the concepts of k-covering poset for the signed partitions and we show that D(m, n) is 1-covering and E(m, n) is 2-covering. We study D(m, n) and E(m, n) as two discrete dynamical models with some evolution rules. In particular, the 1-covering lattices are exactly the lattices definable with one outside addition ru le and one outside deletion rule. The 2-covering lattices have further need of another inside-switch rule.

EQUIVALENT SEQUENTIAL AND PARALLEL REDUCTIONS IN ARBITRARY BINARY PICTURES

A reduction transforms a binary picture only by changing some black points to white ones, which is referred to as deletion. Sequential reductions traverse the black points of a picture, and consider a single point for possible deletion, while parallel reductions can delete a set of black points simultaneously. Two reductions are called equivalent if they produce the same result for each input picture. A deletion rule is said to be equivalent if it yields a pair of equivalent parallel and sequential reductions. This paper introduces a class of equivalent deletion rules that allows us to establish a new sufficient condition for topology-preserving parallel reductions in arbitrary binary pictures. In addition we present a method of verifying that a deletion rule given by matching templates is equivalent, a necessary and sufficient condition for order-independent deletion rules, and a sufficient criterion for order-independent and translation-invariant parallel subfield-based algorithms.

Contour Tones in Igbo: 'Where They Come from'

Contour tones are typically predominant in tone languages operating a contour system in contrast with tone languages operating the register system. This paper examines the underlying and surface characterization of contour tones (rising and falling tones) at the lexical level in Igbo. Adopting the Autosegmental approach originally proposed by Goldsmith (1976), it reinforces the composite nature of both contours in Igbo. From the data, evidence is given that contour tones in Igbo are mere surface features which are motivated by some underlying rules that arise from the merging of tone at morpheme boundaries, historical loss of segments and the association of a floating tone. The two rules are identified are the deletion and docking rule. The manifestation of the latter is premised on the application of the former. The application of both rules is equally dependent on the fulfilment of some tone contour conditions such as presence of morpheme boundary, occurrence of contrasting tones at the morpheme boundary, similarity of vowels. The data used for this study are mostly individual words (place names and general nouns). These nouns are however morphologically derived complex words. The analysis shows that contour tones are usually induced at morpheme boundaries. Again, there is always a collapse of the contrasting tones realised on the tone bearing units (vowels) at the morpheme boundary. The morpheme boundary as used in this context and as applicable to Igbo is restricted to free morphemes. The first morpheme whose vowel is always affected by the deletion rule could start losing its original meaning overtime.

Predictability of flood pulse driven assembly rules for restoration of a floodplain plant community

Community assembly rules were formulated to evaluate the restoration of wet prairie along the periphery of the floodplain of the Kissimmee River in central Florida. Restoration of this plant community is expected to be driven by the reestablishment of flood pulse hydrology following the ongoing dechannelization of the river. Assembly rules were assessed with plant species composition and cover data from 15 permanent plots on the restored floodplain and 6 control plots on the channelized floodplain. These sites were sampled biannually from 1998 to 2010. Mean annual hydroperiods and depths confirmed that the frequency, duration and amplitude of post-restoration flood pulses at study sites were similar to historic reference locations. Elimination of pasture grasses (primarily Paspalum notatum Flugge) following restoration of the flood pulse validated the hypothesized deletion rule for initial transformation of the wet prairie zone. Predicted increased dominance of obligate and facultative wetland species, a “community addition rule”, also was confirmed. An index of weighted averages of wetland indicator taxa showed significant short-term responses to antecedent hydroperiods and depths, and a restoration trajectory for wetland plant species. As predicted, recruitment of wet prairie indicator species from the extant seed bank correlated with reestablishment of the flood pulse, but was greatest when inundation extended from the wet season into the dry season. Restoration of a wetland plant community did not result in the predicted increase in species richness and diversity. Colonization and expansion of the exotic grass, Hemarthria altissima (Poir.) Stapf & C.E. Hubb., disrupted community reassembly processes. By summer 2007, mean cover of this species and several other exotic grasses increased to 24%, and necessitated herbicide treatments. Assembly rules provided useful predictions for the initial restoration of wet prairie vegetation, but were eventually confounded by the spread of an exotic species that was new to the regional flora.

A Remark on the Remnant Movement Analysis of Gapping

Park, Yoen Mee. 2011. A Remark on the Remnant Movement Analysis of Gapping. Korean Journal of English Language and Linguistics 11-3, 811-827. This paper is to look into a particular analysis of gapping, namely, the remnant predicate movement analysis by Johnson (1996, 2009). After discussing both merits and demerits of the analysis, I propose an alternative analysis that is meant to capture the insights of the two approaches of gapping, that is, the ellipsis analysis and the movement analysis. More specifically, gapping in the new analysis is argued to be a combination of across-the-board verb movement followed by a phonological deletion rule.

Case base Maintenance Method based on Clustring and Rule

Maintenance of case base is an important part in Case-Based Reasoning (CBR) system. In order to improve the efficiency of case base maintenance, a method based on case clustering and rule was proposed in this paper. Firstly, by using of the Self-Organizing Maps networks (SOM), a visual clustering output of previous cases is obtained. Then, the maintenance rules, including addition rule and deletion rule for a new case is defined to describe the maintenance. So, according to maintenance rules and visual clustering graph, a human operator can “easily” decide whether the new case was discarded or added, and thus the maintenance of case base was completed. Finally, the efficiency of proposed method was verified by experimental results.