Sciweavers

770 search results - page 12 / 154
» Subsequence similarity language models
Sort
View
ECAL
2001
Springer
14 years 28 days ago
Emergent Syntax: The Unremitting Value of Computational Modeling for Understanding the Origins of Complex Language
Abstract. In this paper we explore the similarities between a mathematical model of language evolution and several A-life simulations. We argue that the mathematical model makes so...
Willem H. Zuidema
ACL
1994
13 years 9 months ago
Similarity-Based Estimation of Word Cooccurrence Probabilities
In many applications of natural language processing it is necessary to determine the likelihood of a given word combination. For example, a speech recognizer may need to determine...
Ido Dagan, Fernando C. N. Pereira, Lillian Lee
NIPS
2001
13 years 9 months ago
Natural Language Grammar Induction Using a Constituent-Context Model
This paper presents a novel approach to the unsupervised learning of syntactic analyses of natural language text. Most previous work has focused on maximizing likelihood according...
Dan Klein, Christopher D. Manning
CORR
1998
Springer
82views Education» more  CORR 1998»
13 years 8 months ago
Name Strategy: Its Existence and Implications
It is argued that colour name strategy, object name strategy, and chunking strategy in memory are all aspects of the same general phenomena, called stereotyping, and this in turn ...
Mark D. Roberts
ALT
2006
Springer
14 years 5 months ago
The Complexity of Learning SUBSEQ (A)
Higman showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. We consider the following inductive inferenc...
Stephen A. Fenner, William I. Gasarch