Local grammars and their representation by finite automata

Abstract : In the study of collocations and of frozen sentences (idioms, clichés, collocations, many metaphors and figurative meanings, etc.) one often encounters sets of similar forms that cannot be related by formal rules of either type: phrase structure or transformational. We present examples of such situations and we show how the formalism of finite automata can be used to represent them in a natural way.
Document type :
Book section
M. Hoey. Data, Description, Discourse. Papers on the English Language in honour of John McH Sinclair, Harper-Collins, pp.26-38, 1993
Liste complète des métadonnées


https://halshs.archives-ouvertes.fr/halshs-00278308
Contributor : Eric Laporte <>
Submitted on : Sunday, May 11, 2008 - 3:22:44 PM
Last modification on : Tuesday, October 11, 2016 - 1:50:14 PM
Document(s) archivé(s) le : Friday, May 28, 2010 - 6:57:06 PM

File

sinc.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : halshs-00278308, version 1

Collections

Citation

Maurice Gross. Local grammars and their representation by finite automata. M. Hoey. Data, Description, Discourse. Papers on the English Language in honour of John McH Sinclair, Harper-Collins, pp.26-38, 1993. <halshs-00278308>

Share

Metrics

Record views

251

Document downloads

317