Abstract
There are mainly two approaches for creating syntactic dependency analyzers: supervised and unsupervised. The main goal of the first approach is to attain the best possible performance for a single language. For this purpose, a large collection of resources is gathered (using manually annotated corpora with part-of-speech annotations and syntactic and structure tags), which requires a significant amount of work and time. The state of the art in this approach attains syntactic annotation in about 85% of all full sentences (Rooth in Proceedings of the symposium on representation and acquisition of lexical knowledge. AAAI, 1995 [172]); in English, it attains over 90%. On the other hand, the unsupervised approach tries to discover the structure of a text using only raw text, which allows the creation of a dependency analyzer for virtually any language. Here, we explore this second approach. We present the model of an unsupervised dependency analyzer, named DILUCT-GI (GI short for grammar inference).
This chapter has been written with Omar Juárez-Gambino, ESCOM-IPN.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
- 2.
- 3.
Results kindly provided by Jordi Atserias, Technical University of Catalonia.
- 4.
Available at www.student.cs.uwaterloo.ca/~cs786s/susanne/.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
J. Gambino, O., Calvo, H. (2018). The Unsupervised Approach: Grammar Induction. In: Automatic Syntactic Analysis Based on Selectional Preferences. Studies in Computational Intelligence, vol 765. Springer, Cham. https://doi.org/10.1007/978-3-319-74054-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-74054-6_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-74053-9
Online ISBN: 978-3-319-74054-6
eBook Packages: EngineeringEngineering (R0)