Guest (Restricted Access)
|
|
|
Bibliographic description  |
|
|
| Title |
|
Extended finite state models of language |
|
|
|
| Involved pers. |
|
Kornai, András; Joshi, Aravind K.; Hopely, Philip; Watson, Bruce W.; Karttunen, Lauri; Chanod, Jean-Pierre; Grefenstette, Gregory; Schiller, Anne; Tateno, Masakazu; Masuichi, Hiroshi; Umemoto, Hiroshi; Roche, Emmanuel; Vilar, Juan Miguel; Jiménez, Victor Manuel; Amengual, Juan Carlos; Castellanos, A.; Llorens, David; Vidal, E.; Ejerhed, Eva; Schulz, Klaus U.; Bertsch, E.; Mikołajewski, Tomek; Srinivas, B.; Nederhof, Mark-Jan |
| Written in |
|
English |
| Source |
 |
Natural language engineering. - Cambridge : Cambridge University Press |
| Volume |
|
2 |
| Year |
|
1996 |
| Issue |
|
4 |
| Page |
|
287-382 |
|
|
Classification |
| Domains / Computational linguistics |
|
| Domains / Computational linguistics / Parsing |
|
| Domains / Computational linguistics / Parsing / Grammar types (computational linguistics) |
|
| Domains / Computational linguistics / Parsing / Grammar types (computational linguistics) / Automata (theory of) |
|
| Domains / Grammaticography / Models of grammar / Tree adjoining grammar |
|
|
|
Redirected from |
| Computational linguistics ; Automatische Sprachanalyse (synt.) ; Formale Grammatiken; Chomsky-Hierarchie; Unrestricted rewriting system; Context-sensitive grammar; Context-free grammar; Finite state grammar; Polychrome tree grammar; Tectogrammatical tree structure; TGTS; Grammar types (computational linguistics) ; Theory of automata; Automata (theory of) ; Tree substitution grammar |
|
|
 |
|
