Sciweavers

742 search results - page 23 / 149
» Formal Grammar for Java
Sort
View
LACL
2005
Springer
14 years 1 months ago
Learnable Classes of General Combinatory Grammars
Abstract. Kanazawa has shown that k-valued classical categorial grammars have the property of finite elasticity [1], which is a sufficient condition for learnability. He has also ...
Erwan Moreau
ECML
2003
Springer
14 years 1 months ago
Leveraging Lexical Semantics to Infer Context-Free Grammars
Context-free grammars cannot be identified in the limit from positive examples (Gold, 1967), yet natural language grammars are more powerful than context-free grammars and humans ...
Tim Oates, Tom Armstrong, Justin Harris, Mark Nejm...
ICGI
1994
Springer
13 years 12 months ago
Inducing Probabilistic Grammars by Bayesian Model Merging
We describe a framework for inducing probabilistic grammars from corpora of positive samples. First, samples are incorporated by adding ad-hoc rules to a working grammar; subseque...
Andreas Stolcke, Stephen M. Omohundro
ACL
2001
13 years 9 months ago
Practical Issues in Compiling Typed Unification Grammars for Speech Recognition
Current alternatives for language modeling are statistical techniques based on large amounts of training data, and hand-crafted context-free or finite-state grammars that are diff...
John Dowding, Beth Ann Hockey, Jean Mark Gawron, C...
COLING
2000
13 years 9 months ago
Parsing Schemata for Grammars with Variable Number and Order of Constituents
We define state transition grammars (STG) as an intermediate tbrmalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy ...
Karl-Michael Schneider