Unsupervised Paradigm Clustering Using Transformation Rules
This paper describes the submission of the CU-UBC team for the SIGMORPHON 2021 Shared Task 2: Unsupervised morphological paradigm clustering. Our system generates paradigms using morphological transformation rules which are discovered from raw data. We experiment with two methods for discovering rules. Our first approach generates prefix and suffix transformations between similar strings. Secondly, we experiment with more general rules which can apply transformations inside the input strings in addition to prefix and suffix transformations. We find that the best overall performance is delivered by prefix and suffix rules but more general transformation rules perform better for languages with templatic morphology and very high morpheme-to-word ratios.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringTask 2Similar Papers 제목 키워드 기반
Unsupervised Co-Learning on G-Manifolds Across Irreducible Representations
We introduce a novel co-learning paradigm for manifolds naturally admitting an action of a transformation group $\mathcal{G}$, motivated by recent developments on learning a manifold from attached fibre bundle structures…
ClusteringCommunity DetectionPointClustering: Unsupervised Point Cloud Pre-Training Using Transformation Invariance in Clustering
Feature invariance under different data transformations, i.e., transformation invariance, can be regarded as a type of self-supervision for representation learning. In this paper, we present PointClustering, a new un…
ClusteringDeep ClusteringInductive BiasPhilosophy+2Implementing Online Reinforcement Learning with Temporal Neural Networks
A Temporal Neural Network (TNN) architecture for implementing efficient online reinforcement learning is proposed and studied via simulation. The proposed T-learning system is composed of a frontend TNN that implements o…
Clusteringreinforcement-learningReinforcement LearningReinforcement Learning (RL)Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations
Given a vertex-weighted graph, the maximum weight independent set problem asks for a pair-wise non-adjacent set of vertices such that the sum of their weights is maximum. The branch-and-reduce paradigm is the de facto st…
MARC: Mining Association Rules from datasets by using Clustering models
Association rules are useful to discover relationships, which are mostly hidden, between the different items in large datasets. Symbolic models are the principal tools to extract association rules. This basic technique i…
Clustering