Name
Abstract | ||
|---|---|---|
In this paper, we interpret in terms of operations applying on extended finite state automata some algorithms that have been specified on categorial grammars to learn subclasses of context-free languages. The algorithms considered implement specialization strategies. This new perspective also helps to understand how it is possible to control the combinatorial explosion that specialization techniques have to face, thanks to a typing approach. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-88009-7_16 | ICGI |
Keywords | Field | DocType |
typing approach,specialization strategy,split recursive automata,new perspective,combinatorial explosion,extended finite state automaton,context-free language,categorial grammar,specialization technique,context free language,finite state automata,grammatical inference | Quantum finite automata,Automata theory,Programming language,Nested word,Computer science,Finite-state machine,Combinatory categorial grammar,Natural language processing,Artificial intelligence,Categorial grammar,Syntactic category,Combinatorial explosion | Conference |
Volume | ISSN | Citations |
5278 | 0302-9743 | 4 |
PageRank | References | Authors |
0.42 | 10 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| isabelle tellier | 1 | 84 | 20.31 |