Russian velar palatalization changes velars into alveopalatals before certain suffixes, including the stem extension –i and the diminutive suffixes –ok and –ek/ik. While velar palatalization always applies before the relevant suffixes in the established lexicon, as depicted by dictionaries, it often fails with nonce loanwords before –i and –ik but not before –ok or –ek. A model of rule inductio...

The context-tree weighting algorithm [4] is a universal source coding algorithm for binary tree sources. In [2] the algorithm is modified for byte-oriented tree sources. This paper describes the context-tree branch-weighting algorithm, which can reduce the number of parameters for such sources, without increasing the complexity significantly.

The context-tree weighting method (Willems, Shtarkov, and Tjalkens [1995]) is a sequential universal source coding method that achieves the Rissanen lower bound [1984] for tree sources. The same authors also proposed context-tree maximizing, a two-pass version of the context-tree weighting method [1993]. Later Willems and Tjalkens [1998] described a method based on ratios (betas) of sequence pr...

Due to the unique characteristics such as handling complex, nonlinear, and sometimes intangible dynamic systems, fuzzy systems are used in the modeling of InputOutput data of the process. The combination of fuzzy rule-based systems with genetic algorithms can lead to very useful descriptions of several optimization and search problems. In this paper, clustering strategy is implemented in the de...

The Nearest Neighbor rule is one of the most successful classifiers in machine learning. However, it is very sensitive to noisy, redundant and irrelevant features, which may cause its performance to deteriorate. Feature weighting methods try to overcome this problem by incorporating weights into the similarity function to increase or reduce the importance of each feature, according to how they ...

The recent surge in studies analyzing spatial dependence in political science has gone hand in hand with increased attention paid to the choice of estimation technique. In comparison, specification choice has been largely neglected, even though it leads to equally, if not more, important inference problems. In this article we discuss four issues. Two pitfalls can simply be avoided if researcher...

Due to the unique characteristics such as handling complex, nonlinear, and sometimes intangible dynamic systems, fuzzy systems are used in the modeling of InputOutput data of the process. The combination of fuzzy rule-based systems with genetic algorithms can lead to very useful descriptions of several optimization and search problems. In this paper, clustering strategy is implemented in the de...

In this paper, we consider the problem of learning commonsense knowledge in the form of first-order rules from incomplete and noisy natural-language extractions produced by an off-the-shelf information extraction (IE) system. Much of the information conveyed in text must be inferred from what is explicitly stated since easily inferable facts are rarely mentioned. The proposed rule learner accou...

We propose and study a new axiom, restricted endowment additivity, for the problem of adjudicating conflicting claims. This axiom requires that awards be additively decomposable with respect to the endowment whenever no agent’s claim is filled. For two-claimant problems, restricted endowment additivity essentially characterizes weighted extensions of the proportional rule. With additional agent...