Comparing simple recurrent networks and \(n\)-grams in a large corpus (Q1405399)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Comparing simple recurrent networks and \(n\)-grams in a large corpus |
scientific article; zbMATH DE number 1970948
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Comparing simple recurrent networks and \(n\)-grams in a large corpus |
scientific article; zbMATH DE number 1970948 |
Statements
Comparing simple recurrent networks and \(n\)-grams in a large corpus (English)
0 references
25 August 2003
0 references
simple recurrent networks
0 references
\(n\)-gram modeling
0 references
entropy of English
0 references
connectionism
0 references
