Local grammars and their representation by finite automata

Maurice Gross (1)

1 LADL - Laboratoire d'automatique documentaire et linguistique

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.

Mots clés: collocation; multi-word expression; local grammar; finite automaton; recursive transition network

Mots clés: expression multi-mots; automate fini; réseaun de transitions récursif

Domaines: Linguistique; Traitement du texte et du document

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⟩