Formal Syntax and Semantics of Programming Languages: A Laboratory Based Approach
Formal Syntax and Semantics of Programming Languages: A Laboratory Based Approach
Stochastic attribute-value grammars
Computational Linguistics
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
The unsupervised learning of natural language structure
The unsupervised learning of natural language structure
HHMM-based Chinese lexical analyzer ICTCLAS
SIGHAN '03 Proceedings of the second SIGHAN workshop on Chinese language processing - Volume 17
Introduction to Information Retrieval
Introduction to Information Retrieval
A Polynomial Algorithm for the Inference of Context Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Identification in the Limit of k,l-Substitutable Context-Free Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Learning Subclasses of Pure Pattern Languages
ICGI '08 Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications
Acquiring ISA Relations from Chinese Free Text Based on Multiple Patterns
FSKD '08 Proceedings of the 2008 Fifth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04
Improving tree-to-tree translation with packed forests
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - Volume 2
Learning concepts from text based on the inner-constructive model
KSEM'07 Proceedings of the 2nd international conference on Knowledge science, engineering and management
Painless unsupervised learning with features
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
Phylogenetic grammar induction
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Learning common grammar from multilingual corpus
ACLShort '10 Proceedings of the ACL 2010 Conference Short Papers
Identifying patterns for unsupervised grammar induction
CoNLL '10 Proceedings of the Fourteenth Conference on Computational Natural Language Learning
Using universal linguistic knowledge to guide grammar induction
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
Languages as hyperplanes: grammatical inference with string kernels
Machine Learning
Semantic convolution kernels over dependency trees: smoothed partial tree kernel
Proceedings of the 20th ACM international conference on Information and knowledge management
Identification in the limit of substitutable context-free languages
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
Planar languages and learnability
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Learning for deep language understanding
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Hi-index | 0.00 |
Grammar learning has been a bottleneck problem for a long time. In this paper, we propose a method of semantic separator learning, a special case of grammar learning. The method is based on the hypothesis that some classes of words, called semantic separators, split a sentence into several constituents. The semantic separators are represented by words together with their part-of-speech tags and other information so that rich semantic information can be involved. In the method, we first identify the semantic separators with the help of noun phrase boundaries, called subseparators. Next, the argument classes of the separators are learned from corpus by generalizing argument instances in a hypernym space. Finally, in order to evaluate the learned semantic separators, we use them in unsupervised Chinese text parsing. The experiments on a manually labeled test set show that the proposed method outperforms previous methods of unsupervised text parsing.