Name
Abstract | ||
|---|---|---|
Abstract. This paper investigates the learnability of Pregroup Grammars, a context-free grammar formalism recently dened in the eld of computational linguistics. In a rst theoretical approach, we provide learnability and non-learnability results in the sense of Gold for subclasses of Pregroup Grammars. In a second more practical approach, we propose an acquisition algorithm from a special kind of input called Feature-tagged Examples, that is based on sets of constraints. Key-words. Learning from positive examples, Pregroup grammars, Computational linguistics, Categorial Grammars, Context-Free grammars. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s11225-007-9085-2 | Studia Logica |
Keywords | Field | DocType |
computational linguistics,parsing,context free grammar,categorial grammar | Context-sensitive grammar,Tree-adjoining grammar,S-attributed grammar,Context-free grammar,L-attributed grammar,Computer science,Phrase structure grammar,Indexed grammar,Artificial intelligence,Natural language processing,Learnability | Journal |
Volume | Issue | ISSN |
87 | 2-3 | 1572-8730 |
Citations | PageRank | References |
4 | 0.64 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Denis Béchet | 1 | 36 | 8.69 |
| Annie Foret | 2 | 55 | 10.06 |
| isabelle tellier | 3 | 84 | 20.31 |