Name
Abstract | ||
|---|---|---|
AB-categorial grammars (CGs in the following) is a lexicalized formalism having the expressive power of ε-free context-free languages [1]. It has a long common history with natural language [2]. Here, we first relate unidirectional CGs to a special case of recursive transition networks [3]. We then illustrate how the structures produced by a CG can be generated by a pair of recursive automata. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11605157_35 | CIAA |
Keywords | Field | DocType |
special case,long common history,unidirectional cgs,recursive transition network,lexicalized formalism,ab-categorial grammar,expressive power,free context-free language,natural language,recursive automaton,context free language,categorial grammar | Rule-based machine translation,Context-free language,Programming language,Computer science,Automaton,Natural language,Categorial grammar,Formalism (philosophy),Recursion,Special case | Conference |
Volume | ISSN | ISBN |
3845 | 0302-9743 | 3-540-31023-1 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| isabelle tellier | 1 | 84 | 20.31 |