Results 1 - 10
of
395
Parallel Algorithms for Unsupervised Tagging
"... We propose a new method for unsupervised tagging that finds minimal models which are then further improved by Expectation Max-imization training. In contrast to previous approaches that rely on manually specified and multi-step heuristics for model minimiza-tion, our approach is a simple greedy appr ..."
Abstract
- Add to MetaCart
We propose a new method for unsupervised tagging that finds minimal models which are then further improved by Expectation Max-imization training. In contrast to previous approaches that rely on manually specified and multi-step heuristics for model minimiza-tion, our approach is a simple greedy
Supporting Web-based Address Extraction with Unsupervised Tagging
- Data Analysis, Machine Learning and Applications, 2008
"... Abstract. The manual acquisition and modeling of tourist information as e.g. addresses of points of interest is time and, therefore, cost intensive. Furthermore, the encoded information is static and has to be refined for newly emerging sight seeing objects, restaurants or hotels. Automatic acquisit ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
. In the address domain, separate tags for street names, locations and other address parts can be observed. To extract the addresses, we apply a Conditional Random Field (CRF) on a labeled training set of addresses, using the unsupervised tags as features. Evaluation on a gold standard of correctly annotated data
Fast, Greedy Model Minimization for Unsupervised Tagging
"... Model minimization has been shown to work well for the task of unsupervised part-of-speech tagging with a dictionary. In (Ravi and Knight, 2009), the authors invoke an integer programming (IP) solver to do model minimization. However, solving this problem exactly using an integer programming formula ..."
Abstract
- Add to MetaCart
Model minimization has been shown to work well for the task of unsupervised part-of-speech tagging with a dictionary. In (Ravi and Knight, 2009), the authors invoke an integer programming (IP) solver to do model minimization. However, solving this problem exactly using an integer programming
The complex dynamics of collaborative tagging
- IN PROCEEDINGS OF INTERNATIONAL CONFERENCE
, 2007
"... The debate within the Web community over the optimal means by which to organize information often pits formalized classifications against distributed collaborative tagging systems. A number of questions remain unanswered, however, regarding the nature of collaborative tagging systems including wheth ..."
Abstract
-
Cited by 177 (7 self)
- Add to MetaCart
whether coherent categorization schemes can emerge from unsupervised tagging by users. This paper uses data from tagged sites on the social bookmarking site del.icio.us to examine the dynamics of collaborative tagging systems. In particular, we examine whether the distribution of the frequency of use
Unsupervised Learning of Disambiguation Rules for Part of Speech Tagging
- In Natural Language Processing Using Very Large Corpora
, 1995
"... In this paper we describe an unsupervised learning algorithm for automatically training a rule-based part of speech tagger without using a manually tagged corpus. We compare this algorithm to the Baum-Welch algorithm, used for unsupervised training of stochastic taggers. Next, we show a method for c ..."
Abstract
-
Cited by 130 (1 self)
- Add to MetaCart
In this paper we describe an unsupervised learning algorithm for automatically training a rule-based part of speech tagger without using a manually tagged corpus. We compare this algorithm to the Baum-Welch algorithm, used for unsupervised training of stochastic taggers. Next, we show a method
A fully bayesian approach to unsupervised part-of-speech tagging
- In ACL
, 2007
"... Unsupervised learning of linguistic structure is a difficult problem. A common approach is to define a generative model and maximize the probability of the hidden structure given the observed data. Typically, this is done using maximum-likelihood estimation (MLE) of the model parameters. We show usi ..."
Abstract
-
Cited by 165 (2 self)
- Add to MetaCart
Unsupervised learning of linguistic structure is a difficult problem. A common approach is to define a generative model and maximize the probability of the hidden structure given the observed data. Typically, this is done using maximum-likelihood estimation (MLE) of the model parameters. We show
Unsupervised Part-of-speech Tagging
, 1996
"... Different approaches have been taken in order to solve the part-of-speech tagging problem. Several methods for unsupervised tagging have obtained good accuracies in practice. The approach taken by Brill [Bri95] obtains results comparable to the best existing taggers. In this paper we explore the det ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Different approaches have been taken in order to solve the part-of-speech tagging problem. Several methods for unsupervised tagging have obtained good accuracies in practice. The approach taken by Brill [Bri95] obtains results comparable to the best existing taggers. In this paper we explore
Unsupervised Multilingual Learning for POS Tagging
"... We demonstrate the effectiveness of multilingual learning for unsupervised part-of-speech tagging. The key hypothesis of multilingual learning is that by combining cues from multiple languages, the structure of each becomes more apparent. We formulate a hierarchical Bayesian model for jointly predic ..."
Abstract
-
Cited by 22 (9 self)
- Add to MetaCart
We demonstrate the effectiveness of multilingual learning for unsupervised part-of-speech tagging. The key hypothesis of multilingual learning is that by combining cues from multiple languages, the structure of each becomes more apparent. We formulate a hierarchical Bayesian model for jointly
Data Clustering: 50 Years Beyond K-Means
, 2008
"... Organizing data into sensible groupings is one of the most fundamental modes of understanding and learning. As an example, a common scheme of scientific classification puts organisms into taxonomic ranks: domain, kingdom, phylum, class, etc.). Cluster analysis is the formal study of algorithms and m ..."
Abstract
-
Cited by 294 (7 self)
- Add to MetaCart
and methods for grouping, or clustering, objects according to measured or perceived intrinsic characteristics or similarity. Cluster analysis does not use category labels that tag objects with prior identifiers, i.e., class labels. The absence of category information distinguishes data clustering
SVD and clustering for unsupervised POS tagging
- In Proceedings of the ACL 2010 Conference: Short Papers
, 2010
"... We revisit the algorithm of Schütze (1995) for unsupervised part-of-speech tagging. The algorithm uses reduced-rank singular value decomposition followed by clustering to extract latent features from context distributions. As implemented here, it achieves state-of-the-art tagging accuracy at conside ..."
Abstract
-
Cited by 15 (2 self)
- Add to MetaCart
We revisit the algorithm of Schütze (1995) for unsupervised part-of-speech tagging. The algorithm uses reduced-rank singular value decomposition followed by clustering to extract latent features from context distributions. As implemented here, it achieves state-of-the-art tagging accuracy
Results 1 - 10
of
395