Common Suffixes Research Articles

Optimizing Document Similarity Detection in Persian Information Retrieval

Most data on the Web is in the form of text or image. Finding desired data on the Web in a timely and cost-effective way is a problem of wide interest. In the last several years, many search engines have been created to help Web users find desired information. In this paper we present a new technique to eliminate the affixes and their effects on recognizing similar Persian documents. Reviewing affixes’ rules and exceptions in Persian language, we extracted about 300 common inflectional suffixes and their combinations. We evaluate the effectiveness of eliminating the affixes from Persian texts on document similarity using four major document similarity approaches: Latent Semantic Indexing, Shingling, Vector Space Model, and Co-occurrence. Evaluation results demonstrate improvement in retrieval and detection of similar documents after eliminating affixes.

A Peer-Tree Based Location Lookup Service in Mobile Wireless Networks

We present a location look-up service for aiding location-based routing in wireless networks with mobile hosts. This location look up service is constructed based on a peer-tree indexing structure which represents the friendship relations among mobile hosts. The friendship is derived from the relations of sharing various-length common suffixes of host identifiers. A friendship relation determines the cooperation relation among mobile hosts. The Peer-Tree indexing structure provides a guideline for propagating location updates and queries in an organized manner. Each host periodically propagates its up-to-date location to a small number of its friends. Location queries are forwarded to and serviced at one of the hosts which hold a copy of the location under query. Paths for forwarding location updates or queries are jointly determined by the Peer-Tree indexing structure and the temporary connectivity in a network. The goals of this location look-up service include achieving a high success rate on location discovery, having low demands on network resources, and being robust to frequent changes of network topology.

Learning Hierarchical Lexical Hyponymy

Chinese information processing is a critical step toward cognitive linguistic applications like machine translation. Lexical hyponymy relation, which exists in some Eastern languages like Chinese, is a kind of hyponymy that can be directly inferred from the lexical compositions of concepts, and of great importance in ontology learning. However, a key problem is that the lexical hyponymy is so commonsense that it cannot be discovered by any existing acquisition methods. In this paper, we systematically define lexical hyponymy relationship, its linguistic features and propose a computational approach to semi-automatically learn hierarchical lexical hyponymy relations from a large-scale concept set, instead of analyzing lexical structures of concepts. Our novel approach discovered lexical hyponymy relation by examining statistic features in a Common Suffix Tree. The experimental results show that our approach can correctly discover most lexical hyponymy relations in a given large-scale concept set.

English Affixal Nominalizations Across Language Registers

This paper is a study of register variation as observed in the distribution and productivity of English nominalizing suffixes. Little if anything is known from previous research about whether or not morphological structure beyond the nature of the rightmost affix is a conditioning factor in register variation. As a consequence, nominalizations ending in a particular affix, or virtually all nominalizations tend to be somewhat superficially treated as collectively more characteristic of one register than another. This study fills this research gap by showing that the suffixes exhibit preferences as to their occurrence in particular registers and that, in the case of the most common suffixes (-ness, -ity, -ion), the internal morphological make-up of their base forms may also significantly bear on their quantitative distributions. As regards morphological productivity, the suffixes will uncontroversially exhibit varied degrees of productivity. More interestingly, however, our analysis shows that the morphological constitution of the base form may still influence the probability of a new word coming into existence, and this probability will further be conditioned by register preferences.

Creating a Schoolwide Vocabulary Initiative in an Urban High School

In an effort to improve student achievement at an urban high school, teachers and administrators developed a 5-part, schoolwide vocabulary plan. Over 4 years, teachers provided students with increased opportunities to read, read to their students, developed content-specific vocabulary instruction, taught students academic words, and focused on 5 words each week with a common prefix, suffix, or root. Over the 4 years, student achievement in vocabulary and reading comprehension improved in significant ways, both on reading assessments and state achievement tests.

Learning About Word Parts With Kidspiration

Knowing the meanings of common root words, prefixes, and suffixes may help students read and spell the longer words they begin to run into in the upper elementary grades. This article describes how students can use the Kidspiration computer program to quickly and easily create word webs that illustrate the meanings of common root words and affixes.

“‐Logos,” “‐Ismos,” and “‐Ikos”

How are names for new disciplinary fields coined? Here a new (and fun) way to look at the history of such coinages is proposed, focusing on how phonesthemic tints and taints figure in decisions to adopt one type of suffix rather than another. The most common suffixes used in such coinages (“‐logy,” “‐ics,” etc.) convey semantic and evaluative content quite unpredictable from literal (root) meanings alone. Pharmaceutical manufacturers have long grasped the point, but historians have paid little attention to how suffixes of one sort or another become productive. A romp through examples from English shows that certain suffixes have become “hard” or “soft” in consequence of the status of their most prominent carrier disciplines. The “‐ics” ending came to signify hardness in consequence of the prestige of physics, for example (with “‐metrics” as the arteriosclerosis of suffixes), while lower‐status (less “hard”) disciplines have developed alternate endings (such as “studies”). Some suffixes are eschewed for their perceived ideologic slant (the “‐isms,” for example). Historians of science need to think more about the pragmatics of language, a task made easier by information technologies and databases that allow searches for words by suffix and first known use.

A compact static double-array keeping character codes

A trie represented by a double-array enables us to search a key fast with a small space. However, the double-array uses extra space to be updated dynamically. This paper presents a compact structure for a static double-array. The new structure keeps character codes instead of indices in order to compress elements of the double-array. In addition, the new structure unifies common suffixes and consists of less elements than the old structure. Experimental results for English keys show that the new structure reduces space usage of the double-array up to 40%.

Environmental biotechnology: A bioremediation perspective

The term environmental biotechnology has a certain air of modernity when in fact it has a long history of use, if one considers the underlying principles and not the appellation. However, as part of its complex meaning, there is a dynamic new definition and purpose in this discipline with regard to bioremediation. The ability to probe the environment at the molecular level with exquisite methods, to create a new awareness of fundamental biological processes therein, has created an important new paradigm in remediation engineering design and management. Further, biological lines of evidence made extremely robust through the merger of biotechnology and environmental science are poised to be incorporated into the very fabric of site evaluation and disposition at the regulatory level. At the operational level, the field of environmental biotechnology is driven by the “omics,” the common suffix for disciplines like genomics, proteomics, and metabolomics. An introduction to these elements of the process is followed by a review of how they are being used right now in a commercial framework, with the understanding that the entire process is still in the formative stages of its vast potential. © 2005 Wiley Periodicals, Inc.

Orthographic conundrums: the problem of ‐opsis and ‐botrys

AbstractA survey of the use of two common suffixes of generic names and species epithets in botanical nomenclature is provided and discrepancies in treatment, either in the form of the stem or in the gender, are demonstrated. The reasons for these discrepancies and their consequences are outlined and possible means of harmonization are indicated.

Spelling: Logical, Learnable—and Critical

Spelling: Logical, Learnable—and Critical

Tapestry

No abstract available.

Predicting the Future of Discrete Sequences from Fractal Representations of the Past

We propose a novel approach for building finite memory predictive models similar in spirit to variable memory length Markov models (VLMMs). The models are constructed by first transforming the n-block structure of the training sequence into a geometric structure of points in a unit hypercube, such that the longer is the common suffix shared by any two n-blocks, the closer lie their point representations. Such a transformation embodies a Markov assumption—n-blocks with long common suffixes are likely to produce similar continuations. Prediction contexts are found by detecting clusters in the geometric n-block representation of the training sequence via vector quantization. We compare our model with both the classical (fixed order) and variable memory length Markov models on five data sets with different memory and stochastic components. Fixed order Markov models (MMs) fail on three large data sets on which the advantage of allowing variable memory length can be exploited. On these data sets, our predictive models have a superior, or comparable performance to that of VLMMs, yet, their construction is fully automatic, which, is shown to be problematic in the case of VLMMs. On one data set, VLMMs are outperformed by the classical MMs. On this set, our models perform significantly better than MMs. On the remaining data set, classical MMs outperform the variable context length strategies.

The Administrative Systems of the Nanzhao and Dali Kingdoms

This article examines geographical arrangement and its changes via the administrative systems established by the Nanzhao _??__??_ and Dali _??__??_ kingdoms in Yunnan, with a view to shedding the new light upon the character and extent of rules excercised by those kingdoms.To begin with, the Nanzhao kingdom had several jian _??_ as provinces in the central area. These jian were mainly established on the west coast of Lake Erhai _??__??_ and the river basins in the south of the Lake, where the royal Meng family _??__??_ and most of the ruling class families had their strongholds. The differences between the jian in appearing Man-shu _??__??_ and that in Xin-tang-shu _??__??__??__??__??__??_ reflect the dates of the original sources. Although some scholars say the word tan_??_, instead of jian, should be used as the name of the resulting system, the difference in usage of two words tells us that tan is a kind of common suffix for a river basin, not a homophone of jian as a province.Secondly, on the periphery were jiedu _??__??_ and dudu _??__??_. The difference between jiedu and dudu is not so clear, but it should be pointed out that the directors of jiedu were Da-jun-jiang _??__??__??_, a title second in rank only to the prime ministers, Qing-ping-guan _??__??__??_ Regarding dudu, the sources say that the kingdom established a dudu for every ten thousand households, which is thought to be a kind of military draft system, such as Fubing-zhi _??__??__??_ in Tang China. The scale of military power, must also have something to do with jiedu and dudu as administrative institutions. On the other hand, jiedu and dudu were established on the major trade routes from the Erhai area to the four quarters. Especially from east to west, on the line around lat. 25°N, there are located many of the major river basins in Yunnan. It can be said that these trade routes formed a skeleton of the Nanzhao kingdom, with the river basins as their joints.Under the Dali kingdom, jiedu and dudu were reconstructed as fu _??_. And some jian, began to be established around those fu. Those jian were settled by immigrants from the Erhai area, who brought administrative systems familiar to them. The directorships of fu and jian gradually came to be transmitted by inheritance, and they often rebelled against the power of the kingdom, which shows that fu had begun to operate autonomously. The time when fu and jian were established in the periphery was also the time when the Bai people _??__??_ and their culture was formed in the Erhai area. Immigrants diffused their culture to those areas leading to a condition for the rapid acceptance of the Han culture that would arrive in the next age.

A dictionary retrieval algorithm using two trie structures

AbstractThe trie has the feature that the retrieval can be executed with the character symbols composing the key as the unit, and a high‐speed retrieval is realized independently of the total number of keys. Consequently, it used frequently in the search of the natural language dictionary and in other problems. A problem, however, is that the number of trie states increases with the enlargement of the key set, which necessitates a larger memory capacity. To remedy this point, DAWG (Directed Acyclic Word‐Graph) is proposed, where the common suffix of the tries is compressed.Then, a new problem arises in that the record information cannot be determined uniquely for the key. For this problem, this paper introduces a new structure, where the number of states is reduced by merging the common suffixes of the tries, while determining uniquely the record information for the key. The algorithm for retrieval, insertion and deletion of the key is proposed for the structure. In the proposed method, the set of keys is represented using two tries. One of the tries memorizes the prefix of the minimum length that can discriminate uniquely between the key from other keys. The other trie stores the suffixes of the remaining keys in order to merge the common suffix. A simulation is executed for various sets of keys such as Chinese character called Kanji, alphabets and Japanese Katakana characters, and it is seen that the number of states is reduced by approximately 30 to 65 percent for the key set of 50,000 words, compared to the ordinary trie.

An algorithm for dynamic processing of dawg's

SCOPE: Algorithms, Information storage and retrieval. A trie is a search tree obtained by merging the common suffixes of the key set. It has the advantage that all keys as prefixes of an input string can be retrieved with high speed. When the size of the key set is enlarged, however, a problem arises, as the number of transitions increases, so too does the need for a large storage capacity. This paper proposes an algorithm that dynamically constructs DAWGs (Directed Acyclic Word Graphs) for the handling of dynamic key sets. It also solves the problem of the increasing number of transitions in the trie structure. The proposed method constructs a DAWG through the local separation of common suffixes for updating a key and, after finishing updating a key, the local transition merge of common suffixes. The proposed algorithm is theoretically evaluated and the data structure for the implementation is discussed. Experimental results show that the number of transitions in the DAWG is reduced by approx. 50 to 70% compared of that of the trie, for key sets of several thousands of fifty thousand elements, also the updating of the keys can be executed in a practical time for sets of less than ten thousand keys.

A text compression algorithm

We present an algorithm using statistical information about word and digraph frequencies as well as the structural pattern concerning words with a common root and different suffixes. The single or composed most frequent words, included in a suitable dictionary, are encoded with a text pointer; the remaining words, where possible, are encoded according to the most frequent digraphs included in a different vocabulary

Design and analysis of a hyphenation procedure

AbstractA hyphenation procedure is described wherein the search list includes exceptional words, prefixes, suffixes as well as a probabilistic Break‐Value‐Table. The list of prefixes and suffixes is augmented with what are termed as root words to achieve greater flexibility and accuracy. Importance is given to a number of ways whereby the overall algorithm can be speeded up; in this connection a number of rejection rules are formulated so that only the likely candidates are processed. The order of searching of the various data tables is also considered. A further refinement is tried wherein the common suffixes and common prefixes are given preferential treatment. The algorithm developed was tested on approximately 2,700 common English technical words and an attempt is made to analyse the incorrectly handled words.

The Greek Masculines in Circumflexed -α ς

F ROM small beginnings in the classical period the suffix -as gradually spread out until in a possessive sense it became one of the most common suffixes in modern Greek. It commonly designates: (1) the male person in possession of a thing, as a,u7rEXas, of vines; irpoflaras, man of many sheep; (2) the possessor of a bodily or mental characteristic, e.g., KEcaXa's, fathead; Oaya', ravenous eater; (3) the maker or seller of something, a special case of (1), as xaXKW,4ara's, coppersmith; 'yaXaras, milkman. Through the intermediate idea of fondness of the thing possessed, it came to designate anyone fond of something, cf., e.g., yVvaLKas, lover of women; Kpo,uwv6a's, onion-eater. It occurs in a possessive sense also in many personal names and place names, the former, e.g., in 'A,47rEXa's or Atq3aa's, the latter in llerpas, Rockledge, in Crete or the Cean KaXa,a's, Reedville (cf. K. Dieterich, Balkan-Archiv, IV, 107 ff.).

FRENCH NOUN ENDINGS AND VOCABULARY BUILDING

Author's summary.— Concrete suggestions for Vocabulary building by the use of suffixes. A list of the most common und useful suffixes with meanings and examples.