 |
|
|
|
| HAL : halshs-00278316, version 1 |
| Fiche détaillée |  Export this paper |
|
|
| Finite-State Language Processing, E. Roche & Y. Schabès (Ed.) (1997) 329-354 |
|
|
|
|
| The Construction of Local Grammars |
|
|
| Maurice Gross 1 |
|
|
| (1997) |
|
|
|
| Our programme is to use the model of W. Woods 1970 to attempt a full scale analysis of the language. It could be viewed as an attempt to revive the Markovian model, but this would be wrong, because previous Markovian models were aimed at giving a global description of a language, whereas the model we advocate, and which we call it finite-state for short, is of a strictly local nature. In this perspective, the global nature of language results from the interaction of a multiplicity of local finite-state schemes which we call finite-state local automata. To start with, we give elementary examples where the finite constraints can be exhaustively described in a local way, that is, without interferences from the rest of the grammar. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | Laboratoire d'automatique documentaire et linguistique (LADL) |
|
|
|
CNRS : UMR247 – Université Paris VII - Paris Diderot |
|
|
|
|
|
|
|
|
|
| Discipline | : | Humanities and Social Sciences/Linguistics Computer Science/Document and Text Processing |
|
|
| syntax – finite automaton – local grammar – recursive transition network |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| halshs-00278316, version 1 | |
| http://halshs.archives-ouvertes.fr/halshs-00278316 | |
| oai:halshs.archives-ouvertes.fr:halshs-00278316 | |
| Contributeur : Eric Laporte | |
| Submitted on : Sunday, 11 May 2008 16:14:35 | |
| Updated on : Tuesday, 13 May 2008 09:59:11 | |
