Controlling content realization with functional unification grammars | Zendy

Michael Elhadad | Zendy; Jacques Robin | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Controlling content realization with functional unification grammars

Author(s) -

Michael Elhadad,

Jacques Robin

Publication year - 1992

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-55399-1

DOI - 10.1007/3-540-55399-1_7

Subject(s) - computer science , unification , realization (probability) , backtracking , constraint (computer aided design) , rule based machine translation , modularity (biology) , programming language , natural language processing , complement (music) , grammar , sentence , artificial intelligence , theoretical computer science , linguistics , mathematics , biochemistry , statistics , chemistry , geometry , philosophy , complementation , biology , gene , phenotype , genetics

Standard Functional Unification Grammars (FUGs) provide a structurally guidedtop-down control regime for sentence generation. When using FUGs to performcontent realization as a whole, including lexical choice, this regime is no longerappropriate for two reasons: (1) the unification of non-lexicalized semantic inputwith an integrated lexico-grammar requires mapping "floating" semantic elementswhich can trigger extensive backtracking and (2) lexical choice requires accessingexternal...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research