Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
[PDF][PDF] Polynomial Identification in the Limit of Substitutable Context-free Languages.
A Clark, R Eyraud - Journal of Machine Learning Research, 2007 - jmlr.org
This paper formalises the idea of substitutability introduced by Zellig Harris in the 1950s and
makes it the basis for a learning algorithm from positive data only for a subclass of context …
makes it the basis for a learning algorithm from positive data only for a subclass of context …
Computational models of language acquisition
S Wintner - International Conference on Intelligent Text Processing …, 2010 - Springer
Child language acquisition, one of Nature's most fascinating phenomena, is to a large extent
still a puzzle. Experimental evidence seems to support the view that early language is highly …
still a puzzle. Experimental evidence seems to support the view that early language is highly …
[PDF][PDF] Limitations of current grammar induction algorithms
B Cramer - Proceedings of the ACL 2007 Student Research …, 2007 - aclanthology.org
I review a number of grammar induction algorithms (ABL, Emile, Adios), and test them on the
Eindhoven corpus, resulting in disappointing results, compared to the usually tested corpora …
Eindhoven corpus, resulting in disappointing results, compared to the usually tested corpora …
Characterizing facial expressions by grammars of action unit sequences–A first investigation using ABL
We investigate the application of grammar inference to the analysis of facial expressions to
discover underlying sequential regularities characteristic for a specific mental state. The …
discover underlying sequential regularities characteristic for a specific mental state. The …
Grammar inference algorithms and applications in software engineering
Many problems exist whose solutions take the form of patterns that may be expressed using
grammars (eg, speech recognition, text processing, genetic sequencing). Construction of …
grammars (eg, speech recognition, text processing, genetic sequencing). Construction of …
Applications of grammatical inference in software engineering: domain specific language development
In this chapter, application of grammatical inference to facilitate development of domain-
specific languages (DSLs) is presented. Grammatical inference techniques have been …
specific languages (DSLs) is presented. Grammatical inference techniques have been …
An unsupervised incremental learning algorithm for domain-specific language development
While grammar inference (or grammar induction) has found extensive application in the
areas of robotics, computational biology, and speech recognition, its application to problems …
areas of robotics, computational biology, and speech recognition, its application to problems …
Applying grammar inference to identify generalized patterns of facial expressions of pain
We present an application of grammar inference in the domain of facial expression analysis.
Typically, only sets of AUs which occur in a given time frame are used for expression …
Typically, only sets of AUs which occur in a given time frame are used for expression …
Grammatical inference using suffix trees
J Geertzen, M van Zaanen - International Colloquium on Grammatical …, 2004 - Springer
The goal of the Alignment-Based Learning (ABL) grammatical inference framework is to
structure plain (natural language) sentences as if they are parsed according to a context-free …
structure plain (natural language) sentences as if they are parsed according to a context-free …
Polynomial identification in the limit of context-free substitutable languages
A Clark, R Eyraud - Journal of Machine Learning Research, 2007 - hal.science
This paper formalises the idea of substitutability introduced by Zellig Harris in the 1950s and
makes it the basis for a learning algorithm from positive data only for a subclass of context …
makes it the basis for a learning algorithm from positive data only for a subclass of context …