Title
An unsupervised algorithm for the induction of constructions
Abstract
We present an approach to the unsupervised induction of constructions for a specific domain. The main features of our approach are that i) it does not require any supervision in the form of explicit tutoring, ii) it learns pairings between form and meaning and iii) it induces complex syntactic constructions (and their arguments) together with a mapping to a semantic representation beyond mere word-concept associations. A comparison to approaches from the area of learning grammars for semantic parsing shows that the results of our approach are indeed competitive.
Year
DOI
Venue
2011
10.1109/DEVLRN.2011.6037371
ICDL), 2011 IEEE International Conference
Keywords
Field
DocType
grammars,unsupervised learning,complex syntactic constructions,explicit tutoring,grammar learning,semantic parsing,semantic representation,unsupervised algorithm,word-concept associations
Rule-based machine translation,L-attributed grammar,S-attributed grammar,Computer science,Unsupervised learning,Natural language processing,Artificial intelligence,Parsing,Semantic representation,Syntax,Machine learning
Conference
Volume
ISSN
ISBN
2
2161-9476
978-1-61284-989-8
Citations 
PageRank 
References 
3
0.42
10
Authors
4
Name
Order
Citations
PageRank
Gaspers, J.130.42
Philipp Cimiano23338217.41
Griffiths, S.S.352.49
Britta Wrede456260.31