Sciweavers

1269 search results - page 46 / 254
» Learning Correction Grammars
Sort
View
104
Voted
MST
2000
86views more  MST 2000»
15 years 14 days ago
Team Learning of Computable Languages
A team of learning machines is a multiset of learning machines. A team is said to successfully learn a concept just in case each member of some nonempty subset, of predetermined s...
Sanjay Jain, Arun Sharma
91
Voted
GG
2004
Springer
15 years 6 months ago
Parsing String Generating Hypergraph Grammars
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of...
Sebastian Seifert, Ingrid Fischer
79
Voted
ACL
2006
15 years 2 months ago
FAST - An Automatic Generation System for Grammar Tests
This paper introduces a method for the semi-automatic generation of grammar test items by applying Natural Language Processing (NLP) techniques. Based on manually-designed pattern...
Chia-Yin Chen, Hsien-Chin Liou, Jason S. Chang
95
Voted
COLING
2000
15 years 2 months ago
Robust German Noun Chunking With a Probabilistic Context-Free Grammar
We present a noun chunker for German which is based on a head-lexicalised probabilistic contextfl'ee grammar. A manually developed grammar was semi-automatically extended wit...
Helmut Schmid, Sabine Schulte im Walde
79
Voted
FLAIRS
2008
15 years 3 months ago
Graph Grammars: An ITS Technology for Diagram Representations
For many educational applications such as learning tools for argumentation, structured diagrams are a suitable form of external representation. However, student-created graphs pos...
Niels Pinkwart, Kevin D. Ashley, Vincent Aleven, C...